武器装备体系能力矩阵评估方法

针对武器装备体系能力难以客观、定量评估的问题,引入复杂网络理论,提出了基于矩阵运算的武器装备体系能力评估方法。分析了武器装备体系能力的概念,建立了武器装备体系的复杂层次网络模型,描述了装备网络的组成、运行过程,定义了装备网络的矩阵描述方法和矩阵运算规则,提出了装备网络作战能力描述参数,给出了装备网络能力的矩阵计算方法,进行了影响因素分析,最后通过实例验证了方法可行性、有效性和灵活性。     

65 nm工艺双层三维静态存储器的软错误分析与评估

新兴的三维静态存储器将代替二维静态存储器被广泛用于高性能微处理器中,但它依然会受到软错误的危害。为了能够快速、自动分析多层管芯堆叠结构的三维静态存储器软错误特性,搭建了三维静态存储器软错误分析平台。利用该平台对以字线划分设计的三维静态存储器和同等规模的二维静态存储器分别进行软错误分析,并对分析结果进行对比。研究结果表明二维和三维静态存储器的翻转截面几乎相同,但三维静态存储器单个字中发生的软错误要比二维静态存储器更严重,导致难以使用纠检错技术对其进行加固。静态模式下二维和三维静态存储器敏感节点均分布于存储阵列中,表明静态模式下逻辑电路不会引发软错误。     

基于复杂网络理论的岸防作战体系骨干网络研究

随着信息技术在战争中的大量应用,现代战争越来越呈现出网络化和体系对抗性,研究其拓扑特性已十分必要。基于复杂网络理论,首先建立了岸防作战体系网络模型,然后提出一种基于贪心思想的骨干网挖掘算法,最后对模型的骨干网络进行了研究。结果表明该方法能够快速、准确地挖掘出岸防作战体系的网络骨干,并能为军事对抗体系的复杂网络应用研究提供借鉴和参考。     

城市消防远程监控系统建设过程中的几点体会

通过对国内自动消防设施设备存在问题的归纳,结合城市消防远程监控系统实际功能的实现,从监控终端、通信网络、信息中心三个方面提高系统的容错能力,阐述了实际建设和调试过程中的解决办法,并对系统的可靠性和安全性进行了讨论。     

Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines

We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Analytic solution for the nucleolus of a three‐player cooperative game

The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Supply chain coordination with shelf‐space and retail price dependent demand and heterogeneous retailers

We consider supply chain coordination in which a manufacturer supplies some product to multiple heterogeneous retailers and wishes to coordinate the supply chain via wholesale price and holding cost subsidy. The retail price is either exogenous or endogenous. The market demand is described by the market share attraction model based on all retailers'shelf‐spaces and retail prices. We obtain optimal solutions for the centralized supply chain, where the optimal retail pricing is a modified version of the well‐known cost plus pricing strategy. We further get feasible contracts for the manufacturer to coordinate the hybrid and decentralized supply chains. The manufacturer can allocate the total profit free to himself and the retail market via the wholesale price when the retail price is exogenous, but otherwise he cannot. Finally, we point out that different characteristics of the retail market are due to different powers of the manufacturer, and the more power the manufacturer has, the simpler the contract to coordinate the chain will be. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于扩展Petri网的防空C~4ISRK系统建模分析

针对地空导弹武器系统防空中的火力分配问题,建立了战术级防空C4ISRK系统的Petri网模型。对其进行扩展,即联合谓词Petri网和赋色Petri网,建立旅级火力分配的改进模型,给出了具体的前置谓词公式。为有效分析战术决策的正确性提供了依据和思路。     

基于模糊-组合神经网络的信息系统安全风险评估

针对信息系统的安全风险评估问题,提出了一种将模糊理论与神经网络进行"浅层次"结合的评估方法。通过对信息系统所涉及的风险因素分别从资产影响、威胁频度、脆弱性严重程度三方面进行分析,建立了信息系统的安全风险层次化结构,并构造了各因素所对应评判集的隶属度矩阵;综合运用模糊推理算法与神经网络仿真技术,对信息系统的安全风险进行评估,进而判定信息系统安全风险等级。最后,通过实例分析说明了算法的应用,并借助误差分析检测了模型的有效性。