基于复杂网络理论的防空节点攻击排序研究  

Rearch on the Defense Code Attacking Compositor Based on the Theory of the Complex Network

作　　者：姜波[1] 刘志成[2] 严建钢 

机构地区：[1]山东工商学院数学与信息学院,山东烟台264005 [2]93534部队,天津301716 [3]海军航空空程学院指挥系,山东烟台264005

出　　处：《数学的实践与认识》2013年第24期75-79,共5页Mathematics in Practice and Theory

摘　　要：应用图论将防空系统抽象成二维网络的拓扑结构图,通过指定点对间最小拦截概率的计算,得到防空拓扑图的子图,并应用复杂网络理论,综合考虑攻击节点的拦截概率及兵力需求量,建立了防空节点攻击价值的计算公式.在此基础上设计了防空节点攻击优化排序算法,给出了最优攻击路径.The graph theory is applied to the air defense system,the subgraph of the defense system is given thruogh the calculation of the minimum penetration probability of the given defense code group.Considering the rivalry probability and the force demand,the calculate formula of the defense code value is built according to the complex network theory, based on this,the optimize arithmetic of the attack compositor of the defense code is designed,giving the the most optimize attack path.

关 键 词：复杂网络 反应时间 突防概率 

分 类 号：E91[军事] O157.5[理学—数学]