基于分布式数据流的的指控系统服务集成方法

针对SOA服务集成架构应用于军用指控系统遇到的问题,提出了一种基于分布式数据流的服务集成方法。其设计思想不同于现在常用的服务集成方法中采取的集中式数据流,该方法支持指控服务构件之间数据的直接通信,可避免集中式处理带来的通信瓶颈问题,提高了服务集成的性能,较好地适应了军用异构网络环境。     

分布式防空C3I系统面向对象建模方法

采用面向对象的建模思想,把分布式防空C3I系统的各个组成部分抽象成对象,从时间、空间和功能的角度对分布式防空C3I系统进行了描述.通过确定对象类、类的属性、操作及类之间的关系而建立了分布式防空C3I系统的对象模型;通过对系统状态转换的分析,建立了分布式防空C3I系统动态模型;通过对系统功能模型的分布,利用层次数据流图建立了分布式防空C3I系统功能模型.     

任务分配方法及其在指挥控制领域的应用

任务分配问题是一类经典的组合优化问题,任务分配方法的研究有利于作战指挥控制领域中多个问题的解决.从集中式分配和分布式分配的角度综述了任务分配方法,分析和对比了任务分配方法性能,最终探讨了在指挥控制领域应用任务分配方法的情况,并进行了应用展望.     

分层分布式分群监控体系下的网格资源发现机制

网格中资源发现机制是把资源提供者和资源请求者联系起来的重要环节.在分析分层分布式分群监控体系结构和现有资源发现机制的基础上,提出将集中式目录服务、资源路由表和移动代理三种机制相结合的网格资源发现机制.实验验证该机制在小范围内查找具有性能高效的特点,而在大范围内查找减少了资源发现代理的分发数量,降低了系统消息的负载,进而降低了网络资源的占用.     

一种高可靠监控模型的研究

监控模型自身的可靠性是衡量其好坏的重要指标.集中式监控模型具有简单高效的特点,但由于这种集中式管理模型只有一个唯一的管理者,因此在可靠性方面具有明显的缺陷和不足.在保留集中式监控模型优点的基础上,通过引入多互联模型、分布式机制和负载均衡策略,设计了一种具有高可靠性的监控模型,并对其进行了可靠性分析.     

分布式多传感器联合Viterbi数据互联算法

为了提高分布式多传感器对密集杂波环境下多目标的跟踪效果,基于Viterbi算法的思想,研究了分布式多传感器联合Viterbi数据互联算法,并与顺序处理结构的集中式多传感器联合概率数据互联算法和分布式多传感器联合概率数据互联算法进行了仿真性能比较.经仿真验证,该算法能够在密集杂波环境下对目标进行有效跟踪,综合性能优于顺序处理结构的集中式多传感器联合概率数据互联算法和分布式多传感器联合概率数据互联算法.     

基于模型转换的异步空间配准算法

在分布式融合系统中,融合中心在对传感器发送过来的航迹数据进行融合处理前,需要采用空间配准算法来消除航迹数据中可能存在的系统误差.已有的空间配准算法未考虑滤波处理中的状态方程对配准过程的影响.对不同传感器具有不同状态方程条件下的异步空间配准实现进行了研究,采用将模型误差和系统误差合并处理的思路,提出了基于模型转换的异步空间配准(AMCBA)算法.仿真结果表明AMCBA算法能够实现对模型误差和系统误差的准确估计.     

基于语义的服务发现架构浅析

服务发现问题的核心是如何根据用户需求,快速、高效的确定并获取网络中所提供的服务。基于语义的服务描述利用本体概念来表述领域内的知识,使计算机通过自动逻辑推理,完成服务的匹配、查找成为可能,并给服务发现架构的设计提出了新的要求。文章从基于语义的角度出发,按集中式、分布式、混合式三种类型对现有的服务发现架构进行分析,并给出下一步的研究方向。     

分布式代理技术在监控系统中的应用

集中式监控模型具有简单高效的特点,特别适合对小规模被监控系统的监控,但集中式监控模型在可靠性方面具有明显的缺陷和不足.针对小规模被监控系统,提出了通过在集中式监控模型中引入分布式机制达到提高监控系统可靠性的思想,同时,提出了适合这一特定模型的选举算法、负责均衡算法、负载指标评估模型,并对负载指标进行了量化.对上述模型和算法进行了详细的阐述,对模型和算法的正确性、性能和可靠性进行了分析.     

事件驱动过程链在军事信息系统建模中的应用

要实现军事信息系统的合理设计必须进行有效的系统建模.通过分析事件驱动的过程链(EPC)和Petri网的特点,提出两者相结合的建模方法,着重研究了基于EPC的系统过程描述方法,在EPC模型中引入组织描述和数据流描述,并分析了控制流、数据流相结合的结构合理性验证方法.设计实现了系统建模工具,并通过实例介绍建模过程,验证方法...     

数据流模型机SDS-l 的实现

文中全面地介绍了数据流模型机SDS-1的特点和实现方法。SDS-1模型机是一种同步和异步相结合、数据流和控制流相结合的数据流模型机,它能开发复合函数级的并行性。该模型机在Intel86/310微机和8个Intel86/12单板机组成的多机系统上实现,达到了80年代初国际先进水平。     

Capacity allocation to sales agents in a decentralized logistics network

Many logistics systems operate in a decentralized way, while most optimization models assume a centralized planner. One example of a decentralized system is in some sea cargo companies: sales agents, who share ship capacity on a network, independently accept cargo from their location and contribute to the revenue of the system. The central headquarters does not directly control the agents' decisions but can influence them through system design and incentives. In this paper, we model the firm's problem to determine the best capacity allocation to the agents such that system revenue is maximized. In the special case of a single‐route, we formulate the problem as a mixed integer program incorporating the optimal agent behavior. For the NP‐hard multiple‐route case, we propose several heuristics for the problem. Computational experiments show that the decentralized system generally performs worse when network capacity is tight and that the heuristics perform reasonably well. We show that the decentralized system may perform arbitrarily worse than the centralized system when the number of locations goes to infinity, although the choice of sales incentive impacts the performance. We develop an upper bound for the decentralized system, where the bound gives insight on the performance of the heuristics in large systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Scheduling and due‐date quotation in a make‐to‐order supply chain

We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a make‐to‐order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two‐machine flow shop, consider several variations of this problem, and design effective due‐date quotation and scheduling algorithms for centralized and decentralized versions of the model. We perform extensive computational testing to assess the effectiveness of our algorithms and to compare the centralized and decentralized models to quantify the value of centralized control in a make‐to‐order supply chain. Since complete information exchange and centralized control is not always practical or cost‐effective, we explore the value of partial information exchange for this system. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Some implications of pricing bundles

In this article, we consider a problem in which two suppliers can sell their respective products both individually and together as a bundle, and study the impact of bundle pricing. Four pricing models (centralized, decentralized, coop–comp, and comp–coop) are analyzed with regard to the competition formats and sequences. As one would expect, the firms are always better off when pricing decisions are centralized. However, rather surprisingly, we find that firms may be worse off if the bundle prices are set in a cooperative way; we provide analytical characterization of those instances. Numerical studies show that these insights also hold for some nonlinear demand. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011     

ASLR机制脆弱性自动分析方法

地址随机化是一种针对控制流劫持漏洞的防御机制。已有的漏洞自动分析与利用技术缺少对地址随机化机制影响的分析,导致生成的测试用例在实际环境中的运行效果受到极大限制。针对地址随机化的缺陷及其绕过技术的特点,提出了一种地址随机化脆弱性分析方法。该方法使用有限状态机描述程序运行路径中各关键节点的状态;针对常见的内存泄漏与控制流劫持场景建立约束条件;通过求解内存泄漏状态约束与控制流劫持状态约束的兼容性,分析地址随机化机制在特定场景下的脆弱性。实验结果表明,该方法可有效检测通过内存泄漏导致的地址随机化绕过及控制流劫持攻击,实现自动化的地址随机化脆弱性分析,提高针对软件安全性分析的效率。     

基于程序状态变迁的ASLR机制脆弱性分析方法

地址随机化ASLR是一种针对控制流劫持漏洞的防御机制。已有的漏洞自动分析与利用技术缺少对地址随机化机制影响的分析,导致生成的测试用例在实际环境中的运行效果受到极大限制。针对地址随机化的缺陷及其绕过技术的特点,本文提出了一种地址随机化脆弱性分析方法。该方法使用有限状态机描述程序运行路径中各关键节点的状态；针对常见的内存泄漏与控制流劫持场景建立约束条件；通过求解内存泄露状态约束与控制流劫持状态约束的兼容性,分析地址随机化机制在特定场景下的脆弱性。实验结果显示,该方法可有效检测通过内存泄漏导致的地址随机化绕过及控制流劫持攻击,实现自动化的地址随机化脆弱性分析,提高针对软件安全性分析的效率。     

Dynamic inventory and pricing models for competing retailers

We address infinite‐horizon models for oligopolies with competing retailers under demand uncertainty. We characterize the equilibrium behavior which arises under simple wholesale pricing schemes. More specifically, we consider a periodic review, infinite‐horizon model for a two‐echelon system with a single supplier servicing a network of competing retailers. In every period, each retailer faces a random demand volume, the distribution of which depends on his own retail price as well as those charged by possibly all competing retailers. We also derive various comparative statics results regarding the impact several exogenous system parameters (e.g., cost or distributional parameters) have on the equilibrium decisions of the retailers as well as their expected profits. We show that certain monotonicity properties, engrained in folklore as well as in known inventory models for centralized systems, may break down in decentralized chains under retailer competition. Our results can be used to optimize the aggregate profits in the supply chain (i.e., those of the supplier and all retailers) by implementing a specific wholesale pricing scheme. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Origins and Persistence of State-Sponsored Militias: Path Dependent Processes in Third World Military Development

This article uses a sequential mixed method approach to examine the origins and persistence of paramilitaries and state-sponsored militias in the developing world. Combining comparative case studies of Southeast Asia and the Middle East with statistical analysis, it shows that revolutionary decolonization produces more decentralized and localized force structures, while direct inheritance of colonial armies leads to more conventional force structures. Subsequently, the level of competition within the regional system influences whether a state can persist in the use of paramilitaries or must transition to a more centralized, conventional force.     

机器人的分散控制

本论文提出了一种新的机器人分散控制方法,这种分散控制方法把机器人系统的每个自由度作为一个子系统,首先从解耦子系统模型综合出N个分散线性控制器,然后在每个子系统内引入一个自适应控制环补偿非线性耦合项的影响。这种分散控制器的优点是:控制器结构简单、计算量小、易于用多微机系统实现并行控制。