浅谈战伤修理备件研究

分析了装备战伤修理与平时维修的主要差别,指出平时装备备件研究基本假设不适用于战伤修理备件研究。在此基础上作者介绍了另一种适合于战伤修理备件研究的基本假设,给出了基本的数学推导。最后作者还提出了战伤修理备件研究的一般步骤。     

智能飞机悬挂物及武器发射/投放管理系统研究

采用人工智能技术研究飞机悬挂物及武器发射／投放管理系统,实现对飞机悬挂物及武器发射／投放的自动化、智能化控制与管理,以此减轻驾驶员的工作负担,提高飞机的作战效能和自身的安全性及生存率,并对系统功能进行了具体的编程仿真。     

No Sequences 互相关函数值的分配

讨论了ＮｏＳｅｑｕｅｎｃｅｓ的互相关特性,证明了ＮｏＳｅｑｕｅｎｃｅｓ的互相关函数一定取集合｛２~ｎ－１,－２~ｍ－１,－１,２~ｍ－１｝中的每一个值,并且给出它们各自的分配。     

Augmented nested sampling for stochastic programs with recourse and endogenous uncertainty

We propose a novel simulation‐based approach for solving two‐stage stochastic programs with recourse and endogenous (decision dependent) uncertainty. The proposed augmented nested sampling approach recasts the stochastic optimization problem as a simulation problem by treating the decision variables as random. The optimal decision is obtained via the mode of the augmented probability model. We illustrate our methodology on a newsvendor problem with stock‐dependent uncertain demand both in single and multi‐item (news‐stand) cases. We provide performance comparisons with Markov chain Monte Carlo and traditional Monte Carlo simulation‐based optimization schemes. Finally, we conclude with directions for future research.     

Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017     

基于正交设计的反舰导弹末制导雷达参数优化

分析了反舰导弹末制导雷达的目标捕捉的限制条件,以一种典型的目标态势为前提建立了基于蒙特卡洛仿真法的目标捕捉概率计算模型,在此基础上利用正交设计的方法对末制导雷达参数组合进行寻优,并通过调整重要因素水平进行多次实验,得到了适合当前目标态势的较优参数组合,为提高反舰导弹目标捕捉能力的相关研究提供了参考。     

INS辅助的GNSS接收机信号捕获性能分析

针对信号捕获过程中Doppler频移造成的影响,采用INS辅助的GNSS信号捕获方法,分析了INS辅助后卫星信号捕获的性能。利用INS速度误差方程与Doppler误差之间的关系,分析INS辅助后的捕获性能,并通过性能参数的比较,理论上验证了INS辅助后的捕获能力的提升。仿真结果表明,INS辅助能够有效提高信号捕获的检测概率和对弱信号的捕获能力,并大幅减小平均捕获时间。同时,考虑到INS器件参数的关键性作用,采用战术级的INS器件完全满足工程需求。     

基于改进鸽群优化的直升机协同目标分配

针对多直升机协同目标分配问题,建立了基于敌我相对态势的对地打击多目标的分配模型。引入多Agent系统机制,加快了有益信息在系统中的流动;并借助雁群成员在飞行中借鉴雁群整体经验的操作,来修正鸽群算法中地标算子的寻优方向,进而提出了基于多Agent的改进鸽群优化的问题求解策略。最后,以典型的直升机对地作战目标分配问题为背景,仿真验证了模型及其求解算法的合理性和有效性。     

主要国家推动民口基础研究成果向国防领域转化应用的经验

主要国家高度重视通过基础研究挖掘装备发展的机遇,在推动基础研究向国防领域转化应用方面做了大量工作。对主要国家在推进基础研究成果向国防领域转化应用的主要做法,特别是在管理模式、转化机构、转化方式、激励机制等方面进行了总结分析,其经验做法值得借鉴。     

康特洛维奇的数值方法在矩形薄板横向弯曲振动中的应用

本文提出的解决矩形薄板弯曲振动问题的康特洛维奇的数值方法,大大减少了所需要的计算机内存。通过算例表明它具有比较高的计算精度和计算速度,是一种有前途的计算方法。