基于物元分析方法的作战指挥信息效能评估

根据信息作战需要,总结出作战指挥信息效能评估分层指标,运用物元分析理论构造了评估模型,并结合具体实例验证了此模型的可行性和实用性。该方法能够有效结合定性与定量分析,且模型结构简单规范,为作战指挥信息效能的评估提供了一种较为有效的方法和途径。     

基于中间件的潜艇作战系统数据库访问技术

在分析国外典型潜艇作战系统体系结构的基础上,针对基于VxWorks的嵌入式应用系统访问Oracle数据库问题,提出了一种基于中间件的跨平台数据库访问方案,解决了分布式异构系统下多用户并发访问数据库的问题;设计开发了基于CORBA的数据库访问中间件,并对中间件的实时性、并发性进行了测试。测试表明:该方案可以解决嵌入式应用系统对Oracle数据库的跨平台访问,并且性能指标满足应用需求。     

低地球轨道卫星网络节能方法

通常卫星的唯一能源来源是太阳能,因此星上网络设备的能源供应问题比地面网络的更加严峻。通过修改和扩展链路容量受限的最小代价多商品流模型来适应卫星网络这一特殊的体系结构,并基于低轨道卫星网络的多重覆盖机制和流量分布模型,改进现有的启发式算法来关闭冗余的卫星节点、星地链路和星间链路。在满足链路利用率和路由跳数增加比例约束的条件下,仿真实验中关闭上述三种参数的比例分别可达59%、61%和72%,卫星网络的总体节能比例可达65%。     

The FARC’s militaristic blueprint

This article intends to explain the outstanding sequence of success and failure exhibited by the FARC, the main Colombian guerrilla since the 1980s. It claims that such sequence is unintelligible unless the adoption by the FARC of a militaristic organizational blueprint at its 1982 7^th Conference is taken into account. By building itself like an army, the FARC could boost its combat capacity, maintain its structural integrity, and develop powerful mechanisms that held the whole structure together. At the same time, the militarization of the FARC also entailed significant risks and costs like political isolation and high personnel turnover. After describing the militaristic blueprint, the article compares the FARC with other irregular forces that operated in the Colombian context – a comparison which is important to understand the specificity of the FARC trajectory, as well as the benefits and costs involved in it. The analysis highlights the critical role of organizational dimensions in the explanation of civil war outcomes, and suggests that at least for some problems organizational dynamics should be observed at a low level of granularity.     

Analysis of artillery shoot‐and‐scoot tactics

Firing multiple artillery rounds from the same location has two main benefits: a high rate of fire at the enemy and improved accuracy as the shooter's aim adjusts to previous rounds. However, firing repeatedly from the same location carries significant risk that the enemy will detect the artillery's location. Therefore, the shooter may periodically move locations to avoid counter‐battery fire. This maneuver is known as the shoot‐and‐scoot tactic. This article analyzes the shoot‐and‐scoot tactic for a time‐critical mission using Markov models. We compute optimal move policies and develop heuristics for more complex and realistic settings. Spending a reasonable amount of time firing multiple shots from the same location is often preferable to moving immediately after firing an initial salvo. Moving frequently reduces risk to the artillery, but also limits the artillery's ability to inflict damage on the enemy.     

凹腔超声速流场结构的试验研究

对超声速冷流情况下凹腔流场特性进行了试验和数值仿真研究,分析了不同构型的凹腔对超声速流场的影响。研究结果表明,在5～9范围内长深比L/D对凹腔流场结构基本没有影响;在30°～60°范围内,凹腔后壁倾角θ不会改变凹腔流场整体结构和特征,但对剪切层的空间发展和凹腔回流区结构有比较大的影响。     

基于分布式排队网络的防空战术协同模型

分析了多个防空火力单元的作战过程,将战术BM/C3的控制协调决策抽象为决策策略。建立了多个火力单元协同作战的排队网络模型,并运用SPN理论对排队网络的运行机制进行了强有力的描述,有效地体现了防空作战过程中的威胁评估、目标分配等战术决策过程。这将为建立大型复杂排队网络,模拟仿真战役层面防空作战过程奠定基础。     

UDP协议的海量信息快速传输解决方案

提出了一种在网络上提高大容量信息传输速度的实现方案和算法。它对传统的文件传输方式进行了改进,将点对点的传输转换成多点对一点的传输。对数据源的识别、缓冲区的管理、负载的分配、流量的控制等问题进行了说明。该算法简洁、灵活、高效,具有很强的实用性。最后对实验结果进行了讨论和分析。     

Proportionate flow shop: New complexity results and models with due date assignment

It is known that the proportionate flow shop minimum makespan $Fm/prpt/C_{\max }$ problem is solved optimally by any permutation job sequence. We show that the $Fm/prpt/C_{\max }$ problem is at least ordinary NP‐hard when missing operations are allowed and present some solvable cases. We then consider the standard proportionate flow shop problem (with no missing operations) and show that the solution algorithms for a class of single‐machine due date assignment problems can be extended/generalized to the corresponding proportionate flow shop problems. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 98–106, 2015     

一种改进遗传算法在UCAV快速航迹规划中的应用

针对无人作战飞机(Unmanned Combat Aerial Vehicle,UCAV)航迹规划约束条件复杂、不确定因素多、实时性要求高的特点,提出了一种基于Voronoi图和改进遗传算法的快速航迹规划方法。该方法采取分层航迹规划的思想,首先根据Voronoi图生成初始航迹,并综合考虑约束条件,赋予各条航迹相应的权值;然后应用改进的遗传算法在生成的航迹空间中寻优,最终得到满意的航迹。该算法利用多处理机并行计算技术对传统遗传算法进行改进,大大缩短寻优时间。仿真结果表明基于Voronoi图和改进遗传算法的航迹规划提高了实时性,增强了UCAV的动态战场适应能力和突发威胁应对能力。