基于灰色系统理论的火灾事故预测方法

简要叙述应用灰色系统理论进行火灾事故预测的理论和方法 ,建立了火灾事故预测的GM (1,1)模型 ,并用该模型对火灾事故进行预测。     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

Another manifestation of cyber conflict: attaining military objectives through cyber avenues of approach

Cyberspace is an avenue of approach through which a military force can attain objectives of value. Through these cyber avenues of approach, military forces can engage, vet, organize, and direct human agents to accomplish specific activities. Although the objectives of these activities could differ from traditional military objectives, they still have military relevance. This particular manifestation of cyber conflict is neither a new domain of war nor something outside of warfare. Rather, it can be viewed as an emerging avenue of approach in the larger context of military operations, auguring benefits in the integration of cyber activities with operations.     

基于灰色关联和D-S证据理论的导弹系统安全性评估

针对导弹系统安全性评价的不确定性问题,提出了将灰色关联和D-S证据理论相结合的方法,从人员安全性、设备安全性和环境安全性建立了综合评估指标体系,用灰色关联分析处理了指标之间的关联性。在传统证据合成公式的基础上,考虑证据集非关键因素的权重,给出了修正的证据合成公式。并以打靶选弹为例进行了计算分析,得出了导弹安全性优先级排序,并将改进算法与传统计算方法的结果进行了比较,验证了评价模型的可行性与实用性,为导弹系统的管理工作提供了有益的参考。     

基于贝叶斯混合博弈的空袭火力资源分配决策模型

从博弈论的角度出发研究空袭火力资源的分配问题,针对空袭编队和防空火力单元攻防对抗过程中存在的不确定性、静态性以及动态性,建立基于贝叶斯混合博弈的空袭对抗火力分配模型。通过构造贝叶斯混合博弈树,采用逆向回溯法分别建立不同的博弈分析模型,利用混合粒子群算法求解那什均衡。仿真结果表明:以博弈论为背景研究空袭作战火力分配问题,符合真实的作战坏境,有效性好,有较高的理论应用价值。     

释放点排布方式对水雾红外遮蔽性能的影响

水雾作为一种优良的红外伪装措施,受到了越来越多的关注。水雾遮蔽性能的仿真研究也成为了关注的焦点,但是始终没有一种有效的仿真途径来探讨水雾释放点排布产生的影响。针对这一问题,基于高斯扩散理论与Mie散射理论,提出了一种空间划分的建模方案,解决了这一问题,并根据仿真结果,简单分析了相同条件下不同释放点排布方式对其红外辐射遮蔽性能的影响。所得结论对制定有效的红外对抗策略有一定的参考价值。     

相依网络研究综述

网络相依性和相依网络研究已经成为近年来复杂网络领域的热点,但是目前对相关研究进展进行综合归纳的文献却不多见。在对国内外相关文献进行系统分析的基础上,简要介绍相依网络研究涉及的渗流理论;描述该类型网络的级联失效过程;从相依网络的子网络特性、相依边的方向和类型、子网络组合方式等三个角度对相依网络鲁棒性的研究成果进行总结;并从理论和应用两方面对未来相依网络研究的发展方向进行展望。     

基于Epsilon-Nash策略的动态武器-目标分配方法

在大型任务规划软件的作战单元任务分配中,搜索零和博弈问题的纳什均衡点是求解任务分配的一种有效的方法。然而,纳什均衡点在决策中并不一定总是存在且唯一,这造成了纳什均衡策略在实际使用时具有较大的局限。通过采用Epsilon-Nash策略克服这种局限,并将其应用于自主空战任务规划系统中,通过仿真实验,证实Epsilon-Nash策略具有近似于纳什策略的效果。     

在任职教育中开发学员任职经验的探讨

任职教育是在受训学员有着一定的任职经验基础上,提高岗位任职能力的一种短期培训。在教学实施过程中,必须注重挖掘任职经验,交流任职经验,再把经验上升为理论从而去指导部队实践。这种任职经验的开发,有利于在教学过程中按需施教,扩大师生的视野,丰富教学资源,实现理论与实践的统一,有效达成任职教育的目标。