风对反潜巡逻机应召搜索延迟时间的影响研究

为了定量分析风对反潜巡逻机应召搜索延迟时间的影响,根据飞行气象学中风对飞行的影响描述以及实际需求,建立了反潜巡逻机飞往潜艇初始概略位置的航路模型。研究结果证明了模型的正确性,并通过仿真分析了反潜巡逻机的航速和航向、风速和风向的变化对延迟时间的影响。结果表明风对延迟时间的影响是不能忽略的,为反潜巡逻机航路的优化、应召搜索效能的提高提供了决策依据。     

基于能力的武器装备体系需求生成框架研究

在界定基于能力的武器装备体系需求生成相关概念的基础上,对需求生成模式进行了总体分析,对需求生成过程按照作战任务分解描述、能力体系需求分析和装备体系需求生成进行了详细描述,初步形成了武器装备体系需求生成研究的基本框架。     

IETM在新型火炮装备中的应用

针对现代武器装备发展趋势及维修保障要求,以Borland Delphi为平台,采用关系数据库技术,开发了新型火炮装备的IETM系统。该系统将各种格式图像信息统一整合,采用Cult3D技术实现三维模型的人机交互,提供了方便快捷的检索方式。     

指挥控制系统服务化研究

网络化体系作战是军队未来主要的作战样式,面向服务的指挥控制系统是实施网络化指挥控制的技术基础,是网络化指挥控制系统的重要特征.分析了指挥控制系统服务化的原因,阐述了面向服务的指挥控制系统的特点和面临的问题,提出了实现指控系统服务化的关键技术.     

Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems

Clustering problems are often difficult to solve due to nonlinear cost functions and complicating constraints. Set partitioning formulations can help overcome these challenges, but at the cost of a very large number of variables. Therefore, techniques such as delayed column generation must be used to solve these large integer programs. The underlying pricing problem can suffer from the same challenges (non‐linear cost, complicating constraints) as the original problem, however, making a mathematical programming approach intractable. Motivated by a real‐world problem in printed circuit board (PCB) manufacturing, we develop a search‐based algorithm (Rank‐Cluster‐and‐Prune) as an alternative, present computational results for the PCB problem to demonstrate the tractability of our approach, and identify a broader class of clustering problems for which this approach can be used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

A cooperative game in search theory

Search theory originates from the military research efforts of WWII. Most researchers of that period modeled their search games in noncooperative games, where players are enemies or compete against each other. In this article, we deal with a cooperative search game, where multiple searchers behave cooperatively. First we describe several search problems and discuss the possibility of a coalition or cooperation among searchers. For the cooperative search game, we define a function named quasi‐characteristic function, which gives us a criterion similar to the so‐called characteristic function in the general coalition game with transferable utility. The search operation includes a kind of randomness with respect to whether the searchers can detect a target and get the value of the target. We also propose a methodology to divide the obtained target value among members of the coalition taking account of the randomness. As a concrete problem of the cooperative search game, we take the so‐called search allocation game, where searchers distribute their searching resources to detect a target in a cooperative way and the target moves in a search space to evade the searchers. Lastly, we discuss the core of the cooperative search allocation game. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

一种基于QFD与ANP的装备作战需求分析方法

针对当前在装备论证过程中缺乏合适的方法和工具将模糊的军事需求科学合理地映射到定量的作战使用性能上去的问题,提出一种基于质量功能部署(QFD)与网络分析法(ANP)的装备作战需求分析方法.该方法能够辅助论证人员深刻理解和合理判断论证中各种因素之间的相互影响关系,通过结构化的装备作战需求分析过程得到能正确反映军事需求的作战使用性能重要度排序.通过实例验证了方法的有效性和实用性.     

音圈式快速伺服刀架的分析与设计

自由曲面光学零件面形复杂,快刀伺服车削加工是其高效加工手段.针对压电陶瓷型伺服刀架行程小,加工能力有限的问题,提出一种基于音圈式直线电机驱动的快刀伺服方案.音圈式快速伺服刀架行程大,可大大拓宽快刀伺服加工范围.以典型光学零件加工为例,对快速伺服刀架所应具备的关键性能指标进行分析,给出了音圈电机的结构,对音圈式伺服刀架进行了理论建模、控制器设计以及实际性能测试.测试结果表明,所设计的音圈式伺服刀架行程大、频响高,在刀架行程为±100μm时可达到300Hz的频响能力,同样行程下的频响指标优于国外同类产品.     

磁流体动力学控制二维扩压器流场数值模拟研究

对常规扩压器进行了简介并作机理分析.用小磁雷诺数假设下基于Favre质量平均的全Navier-Stokes方程来求解外加电磁场的超声速扩压器流场.与常规扩压器比较可以发现,选用适当的外加电磁场组合可以使流动在更短的距离内实现减速扩压,并将部分动能转化为电能.研究表明:仅添加一定外磁场时,第一道激波位置、第二道激波位置、激波串长度分别为无外加电磁场情况的62.19%,77.74%和50.18%.