多边修正算法中的换顶原理及复杂性分析

对于无向赋权图,利用换顶过程中矩阵翻转与数据块调换时上三角部分数据的变化规律,对权值矩阵的数据进行处理,以完成无向完全图中H圈（H路类似）的修正过程。事实上,多边修正的原理最终是通过变换顶点达到的,而其主要用到的换顶规则是矩阵数据的块调换与翻转,该思想还可以推广到有向图的情形。最后利用换顶原理对多边修正算法进行了复杂性分析,讨论修正边数对复杂性的影响。     

基于博弈论计算机网络对抗问题研究

针对日益普遍和多样的网络攻击行为,如何对网络各种攻防过程进行分析已逐渐成为热点研究方向。在对计算机网络对抗问题复杂性表现和产生根源进行探讨基础上,从完全信息静态博弈、完全信息动态博弈、不完全信息静态博弈、不完全信息动态博弈4个视角,对计算机网络对抗问题进行分类论述,对各解决方法进行了综合比较,并对今后的研究进行了展望。     

基于图熵法的战场抢救抢修方案复杂性量化模型

从战场抢救抢修注重时效的特点出发,提出了战场抢救抢修作业复杂性概念,分析了影响抢救抢修作业复杂性的因素．引入软件工程领域的图熵模型,从微观方面研究战场抢救抢修方案实施过程中的复杂性问题．将抢救抢修方案划分为3个层次,利用petri网对操作过程进行建模,并从中提取信息结构图和动作结构图．以作业的量化为基础,给出了方案的综合量化方法．实例证明该方法可以很好的反映抢救抢修方案的可操作性．     

变量度量估计软件的复杂度

提出软件的变量度量方法分别度量软件的变量个数、变量距离及变量聚合缺乏度来估计软件的复杂度.该方法与已有的软件复杂度度量方法,如Halstead科学度量法、McCabe圈复杂度度量法以及Chidamber的6个度量OO代码的指标等不同,它通过度量构成软件的基本元素-变量,更能从底层抓住软件的本质,而且该方法运用于实际的软件复杂度估计十分准确有效.     

Challenges of measuring progress in Afghanistan using violence trends: the effects of aggregation,military operations,seasonality, weather,and other causal factors

Measuring nationwide progress of counterinsurgency operations in Afghanistan using violence trends is difficult due to several factors: aggregation of data to the national level may obfuscate disparate local trends; the observed seasonality in violence makes comparisons difficult and may obscure progress; and short-term spikes or troughs – attributable to weather, military operations and tempo, or holiday periods – heavily influence simple averaging schemes. Despite these challenges, proper understanding of violence statistics is critical to estimating the effectiveness of military forces added during a surge or redeployed as part of transition. This article explores methods for analyzing observed violence trends to identify causal factors, to provide a comparable baseline, and to inform assessments at appropriate levels of aggregation. One methodology for seasonal adjustment of violence data is discussed and shown to provide a logical baseline for examining trends. An ordinary least squares regression model is developed and implemented using time-series violence data.     

Balancing perfectly periodic service schedules: An application from recycling and waste management

A national recycling and waste management company provides periodic services to its customers from over 160 service centers. The services are performed periodically in units of weeks over a planning horizon. The number of truck‐hours allocated to this effort is determined by the maximum weekly workload during the planning horizon. Therefore, minimizing the maximum weekly workload results in minimum operating expenses. The perfectly periodic service scheduling (PPSS) problem is defined based on the practices of the company. It is shown that the PPSS problem is strongly NP‐hard. Attempts to solve large instances by using an integer programming formulation are unsuccessful. Therefore, greedy BestFit heuristics with three different sorting schemes are designed and tested for six real‐world PPSS instances and 80 randomly generated data files. The heuristics provide effective solutions that are within 2% of optimality on average. When the best found BestFit schedules are compared with the existing schedules, it is shown that operational costs are reduced by 18% on average. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 160–171, 2012     

基于小世界网络模型的“梅特卡夫定律”反思

为了真正认清“网络中心战”的理论价值,对按照作为其理论支撑的“梅特卡夫定律”所规定的网络连接方式进行反思,定性分析了其带来的复杂性,并且应用小世界模型（WS）建立了复杂网络价值增益模型并进行了综合分析,发现实际网络不能够按照“梅特卡夫定律”的要求组网,指出“网络中心战”的理论缺陷,对我军信息化建设有一定的启示。     

基于复杂度特征的干扰识别算法

复杂度可以用来刻画信号的波形变化特征。文中使用了L-Z复杂度和分形维数这两种复杂度作为干扰识别的特征参数并结合支持向量机对干扰进行分类。仿真结果表明L-Z复杂度和分形维数计算复杂度低,且具有较好的类别差异度,同时文中提出的算法具有较高的识别准确率。