基于元评估的武器装备作战效能评估可信性研究

针对武器装备作战效能评估过程中存在的诸多不确定因素,研究了作战效能评估的可信性问题;利用元评估方法对武器装备作战效能评估的可信性进行评估,归纳了基于元评估方法进行可信性评估的原则、步骤和框架;在此基础上,研究了元评估在可信性评估中所涉及的几个关键问题。     

基于遗传BP神经网络的装备研制风险分析方法

简要介绍了GA和BP算法,利用遗传算法全局性搜索的特点,改变BP算法依赖梯度信息的指导来调整网络权值的方法,寻找最为合适的网络连接权和网络结构,提出了遗传算法优化BP神经网络的思路及其数学模型.最后,结合对某型航空装备的风险源的分析,利用此优化模型进行了验证.结果表明了该方法的可行性,为装备研制风险分析提供了一种新思路.     

层次任务网络的作战计划建模及生成技术

针对以网络为中心的作战计划的特点,提出基于层次任务网络的军事作战计划建模方法.在对层次任务网络形式化描述的基础上,介绍层次任务网络计划求解算法.基于军事作战计划的抽象模型,提出军事和战计划中军事规则、作战使命、作战能力和作战行动过程等要素与层次任务网络的映射关系,并针对登岛战役案例对基于层次任务网络的军事计划建模和求解过程进行说明.     

澳大利亚维和警察新体制解析

缘于新时期地区安全战略的需要,澳大利亚打造了国际派遣处,建立起了维和警察新体制。该维和警察新体制的运作机制和理念值得关注和学习。澳大利亚希望通过其维和警察新体制扩张并主导在南太平洋地区的警察维和行动。与此同时,澳大利亚在南太平洋地区的强势维和行动面临挑战。     

防暴驱散车的设计研究

根据当前大规模群体性突发事件对驱散装备在作战效能、防护能力、机动性能、勤务性能等方面提出的新要求,探讨研发一种新型防暴驱散车,在其功能设定、方案选择、主战装备等的设计上进行了分析研究,给出了满足使用要求的技术途径和设计方案。     

基于态势描述的陆军作战仿真外部决策模型研究

为解决陆军作战行动仿真中指挥决策模型的建模问题,在分析外部决策模型特点的基础上,提出了基于态势描述的外部决策模型,并对模型实现的原理进行了论述,重点对陆军作战行动仿真中态势描述这一核心问题进行了深入研究,提出了基于位置状态、战损状态、任务状态和消息信息等四类实体信息的态势描述方法,为决策模型的构建提供了新思路。     

谈军校学报在院校科研活动中的能动作用

军校学报在院校的科研活动中不仅仅是学术交流的园地、成果展示的平台,同时,也在整合研究力量,引导学科建设;促进学术协作,推进研究深入;提高学术水平,优化作者队伍方面起着积极的作用。可以说军校学报在院校科研活动中发挥着积极的能动作用。     

关于加强公安现役部队科研环境建设的思考

目前公安现役部队科研环境建设,还存在项目申请难度大、投资渠道单一化、团结协作攻关难、科技资源共享少、学术科研氛围淡等问题,对人才队伍建设造成一定影响。坚持“以人为本”,加强制度建设,解放思想,增加投入,活跃学术氛围,树立科研标兵,以进一步改善和优化公安现役部队科研环境。     

Optimal resource allocation and redistribution strategy in military conflicts with Lanchester square law attrition

We address the problem of optimal decision‐making in conflicts based on Lanchester square law attrition model where a defending force needs to be partitioned optimally, and allocated to two different attacking forces of differing strengths and capabilities. We consider a resource allocation scheme called the Time Zero Allocation with Redistribution (TZAR) strategy, where allocation is followed by redistribution of defending forces, on the occurrence of certain decisive events. Unlike previous work on Lanchester attrition model based tactical decision‐making, which propose time sequential tactics through an optimal control approach, the present article focuses on obtaining simpler resource allocation tactics based on a static optimization framework, and demonstrates that the results obtained are similar to those obtained by the more complex dynamic optimal control solution. Complete solution for this strategy is obtained for optimal partitioning of resources of the defending forces. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Route optimization for multiple searchers

We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010