Fully sequential procedures for comparing constrained systems via simulation

We consider the problem of finding the system with the best primary performance measure among a finite number of simulated systems in the presence of a stochastic constraint on a single real‐valued secondary performance measure. Solving this problem requires the identification and removal from consideration of infeasible systems (Phase I) and of systems whose primary performance measure is dominated by that of other feasible systems (Phase II). We use indifference zones in both phases and consider two approaches, namely, carrying out Phases I and II sequentially and carrying out Phases I and II simultaneously, and we provide specific example procedures of each type. We present theoretical results guaranteeing that our approaches (general and specific, sequential and simultaneous) yield the best system with at least a prespecified probability, and we provide a portion of an extensive numerical study aimed at evaluating and comparing the performance of our approaches. The experimental results show that both new procedures are useful for constrained ranking and selection, with neither procedure showing uniform superiority over the other.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Path optimization for the resource‐constrained searcher

We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Newsvendor bounds and heuristics for serial supply chains with regular and expedited shipping

We study an infinite‐horizon, N‐stage, serial production/inventory system with two transportation modes between stages: regular shipping and expedited shipping. The optimal inventory policy for this system is a top–down echelon base‐stock policy, which can be computed through minimizing 2N nested convex functions recursively (Lawson and Porteus, Oper Res 48 (2000), 878–893). In this article, we first present some structural properties and comparative statics for the parameters of the optimal inventory policies, we then derive simple, newsvendor‐type lower and upper bounds for the optimal control parameters. These results are used to develop near optimal heuristic solutions for the echelon base‐stock policies. Numerical studies show that the heuristic performs well. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

战场数据融合仿真系统设计与实现

介绍了一种战场数据融合仿真系统的设计与实现方法。该系统由场景设定、信号产生、融合跟踪处理、目标识别、态势与威胁估计与数据库支持等功能子系统组成,模拟了数据融合的整个信息处理流程,包括:主动探测雷达、雷达侦察设备、通信侦察设备和敌我识别器获取敌我目标观测信息、利用多传感器跟踪数据对目标进行融合跟踪、提取辐射源电磁信息特征对敌方目标识别,进而形成态势与威胁估计。最终在Visual C#开发平台上利用MapX和ORACLE开发了战场数据融合仿真系统,并成功应用于实际系统中,取得了较好的效果。     

基于博弈论的C~4ISR系统监视与侦察功能模型

监视与侦察已成为现代C4ISR系统的重要组成部分,传统的监视与侦察系统效能分析方法存在模型难以建立、结果不准确等问题,很难量化其与作战效果之间的影响。在对基于Lanchester方程的C4ISR系统建模方法进行研究的基础上,提出了反映监视与侦察功能的Lanchester方程模型,并引入博弈论分析了战场上信息的不对称对交战结果的影响,克服了描述C4ISR系统的Lanchester方程没有考虑作战单元、对手和环境间的动态交互以及数学结构简单的缺点。仿真结果验证了模型的有效性。     

UML在水下输送艇指挥控制系统分析中的应用

在对水下输送艇指挥控制系统进行需求描述的基础上,遵循统一建模语言UML系统分析的一般过程,分别建立了系统的用例模型、静态模型、行为模型、交互模型和实现模型,并对所建模型逐一进行了测试,测试结果表明了该模型建立的正确性,为下一步系统软件的设计和实现奠定了基础。     

一种面向多制式路径规划的网络模型

随着综合交通运输与导航应用技术的发展,综合利用多种交通方式实施路径规划的应用需求日益迫切,传统的单一制式路径规划系统与服务正在向多制式的方向发展.然而,传统的路径规划模型与算法难以直接应用在多制式的条件下.针对多制式路径规划的特点,构建合理的数据模型是解决该问题的基础.为此,提出了制式切换点的概念,并以此为基础建立了包含多制式图集合、顶点属性表和切换点矩阵三个主要部分的多制式网络模型,并在真实的城市道路网数据集上进行了多制式网络构建实验.该工作能够从理论和实践两个方面为多制式路径规划算法的设计提供基础性的技术支持.     

驱动管中柱状装药爆轰过程的数值模拟

数值模拟了爆炸驱动管中柱状装药内爆轰波的传播过程.计算采用欧拉型有限体积方法,炸药及爆轰产物均采用JWL状态方程,空气采用理想气体状态方程,采用"点火-生长"模型计算化学反应速率.计算得到了驱动管内波系结构的发展过程,爆速与经验公式符合得较好.计算表明,驱动管侧壁的压力峰值在800MPa以上,而在管底中心处,由于激波的汇聚,压力峰值高达12.4GPa.     

海军舰载导弹防空系统信息作战方法

信息与火力是海军舰载导弹防空系统研究的核心问题,运用信息作战原理,在给定攻击战机的条件下,对舰载导弹防空系统的信息与火力联合作战能力的分析表明:与提高作战安全性的隐形战机相比,军事诱骗战术更易降低舰载导弹防空系统的火力防御能力.火力对作战能力的贡献约为信息的4倍.根据这一结论,可以为海军舰载导弹防空系统开发出基于信息作战原理的新战法,全面提高指战员在实战中把握信息与火力的运用规律、实施信息作战、做出科学决策和夺取战场胜利的能力.     

树状小波与多尺度估计理论的图像融合技术

针对红外和可见光图像的特点及相互融合的应用,提出一种基于树状小波多尺度估计理论的红外与可见光图像融合算法.首先对源图像进行树状小波多尺度分解,依据子图像的信息量得到塔式结构子图像;然后基于不同子图像对应层上的对应像素,根据EM算法估计模型参数,采用SAGE迭代算法优化估计参数得到融合子图像;最后根据小波逆变换获得融合图像.实验结果表明:该融合算法能够更好地综合利用红外图像较好的目标指示特性与可见光图像较清晰的场景信息;性能评估显示:该算法得到的融合图像互信息较文献[5,6]分别提高了49.60%和24.90%,均方根误差分别减小了66.40%和56.00%.