The Environment as a Factor in Small Wars*

This research paper analyzes the relationship between small wars, insurgency, and the natural environment. Existing literature and data are organized into four behavioral patterns: the resource-based wars accounts for the fight over natural resources; the warfare ecology paradigm refers to non-premeditated damage in preparation for as well as during and after conflicts; the environment as a target discusses intended attacks on the ecosystem; and the insurgency–climate intersection pattern denotes a deviation in climate change that increases the frequency of intergroup violence. The main premise is that small wars emerge when the ecosystem becomes a political asset.     

故障预测技术综述

把握新军事变革机遇,加快信息化建设步伐,对军事装备进行有效的质量监控和故障预测是技术保障的重要内容。阐述了故障预测技术,系统地介绍了现有的、比较有代表性的故障预测技术方法,并叙述了其优缺点;最后重点对故障预测技术的发展前景进行了展望,指出了该研究领域当前需要进一步研究的问题和发展方向。研究故障预测技术对提高装备的维修和保障能力具有十分重要的意义。     

基于攻击树的网络安全事件发生概率评估

为了提高网络安全风险概率预测的准确性,采用攻击树模型作为网络安全事件的描述模型,改进了攻击结点的定义,提出了网络安全事件发生概率的推算方法和攻击路径的分析方法,利用贝叶斯网络方法量化攻击树模型中原子事件结点的发生概率。实例表明该方法科学、客观、有效,为制订安全防护策略提供有力支持。     

一种无线传感器网络中的Sybil攻击检测方案

Sybil攻击破坏无线传感器网络中的数据融合、公平资源分配等机制,因此对Sybil攻击的防范与检测具有很重要的意义。将一种基于到达时间差（TDOA）的三维定位引入到Sybil攻击的检测中,算法可以检测存在的Sybil攻击并对Sybil节点进行定位。通过性能分析证明该算法具有开销小、有效性高的特点。     

复杂网络可靠性研究进展

在分析网络可靠性概念和内涵的基础上,从基本可靠性和任务可靠性两个方面,以网络系统的生存性、抗毁性、可用性、可信性和完成性为主线,系统地总结了网络可靠性的相关研究进展,对未来发展趋势进行了展望。     

海战场移动自组织网络构建设计

面向海战场信息网络建设需求,结合移动自组织网络无中心、组网灵活,抗毁性强等特点,从移动自组织网络体系结构设计入手,研究海上移动自组织网络的组网技术,并提出一种适用于海战场信息网络动态组网的构建方法。     

无线传感器网络中保证覆盖的最少节点部署

无线传感器网络的能量消耗是空间不均匀的,但当前多数的部署方法考虑得较少,网络的能量利用率低,因此提出了保证覆盖率和网络生存期的最少节点部署问题.基于传感器网络的数据传输特性,从提高能量效率和降低剩余能量的角度提出了节点数递减的重叠放置方法和节点密度递减的随机部署方法.两种新部署方法比已有部署方法需要的节点数少,剩余能量低,因而提高了能量利用率.最后,仿真实验表明,两种新部署策略的能量效率是已有方法的3～4倍.     

FINANCIAL VERSUS HUMAN RESOURCES IN THE GREEK–TURKISH ARMS RACE 10 YEARS ON: A FORECASTING INVESTIGATION USING ARTIFICIAL NEURAL NETWORKS

This paper looks into the Greek–Turkish arms race a decade after an earlier contribution to the issue that relied heavily on artificial neural networks. The time period between the two papers contributes to the reliability of the results derived, not just by increasing the number of observations, but also mainly by incorporating the progress made in the realm of artificial intelligence. The focus on the case of both countries unlike the paper mentioned above that dealt with just the Greek side provides ample room for comparative purposes regarding the determinants of defense expenditure on both sides. The results derived in terms of input significance estimation support the findings of the earlier research as indicated above, pointing to the leading role of the demographic preponderance of Turkey over Greece. The paper also points to the fact that 10 years later, Turkey continues to set the arms race rules against its rival by determining the defense expenditure of Greece, whereas the role of the latter in affecting the military spending of Turkey is non‐existent.     

Formulations for dynamic lot sizing with service levels

In this article, we study deterministic dynamic lot‐sizing problems with a service‐level constraint on the total number of periods in which backlogs can occur over a finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS‐SL‐I) and study the structure of its solution. We show that an optimal solution to this problem can be found in \begin{align*}\mathcal O(n^2\kappa)\end{align*} time, where n is the planning horizon and \begin{align*}\kappa=\mathcal O(n)\end{align*} is the maximum number of periods in which demand can be backlogged. Using the proposed shortest path algorithms, we develop alternative tight extended formulations for LS‐SL‐I and one of its relaxations, which we refer to as uncapacitated lot sizing with setups for stocks and backlogs. {We show that this relaxation also appears as a substructure in a lot‐sizing problem which limits the total amount of a period's demand met from a later period, across all periods.} We report computational results that compare the natural and extended formulations on multi‐item service‐level constrained instances. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

用于目标跟踪无线传感器网络的动态分簇算法

针对跟踪精度和网络能耗的问题,提出了一种用于目标跟踪无线传感器网络的基于预测的动态分簇算法.把目标运动过程看作是高斯马尔可夫过程,根据目标历史轨迹,估计下一时刻位置坐标和运动速度,然后基于估计结果优化选择分簇的簇头和簇成员,形成一个动态分簇来实现目标跟踪.仿真结果表明:该算法使目标跟踪有较好的跟踪精度,能有效均衡网络能耗,延长网络寿命.