气象条件对武器效能动态评估与微分对策的影响分析

针对气象条件对作战双方武器效能的动态影响问题,基于微分对策思想,构建了包含气象影响因子的作战双方武器对抗的兰彻斯特模型,讨论了不同气象条件对双方武器效能的动态影响。结果表明:气象条件对双方武器效能都有损耗,但由于损耗程度不同,整个战局的态势将向损耗程度较小的一方倾斜;武器效能的固有差距是主要的,但一定的战场大气环境条件可以缩小此差距。     

双极化天线的通信信号检测方法

在详细分析与探讨信号防御性能的基础上,对利用边界扫描的大区域通信信号电路体系进行了探讨,提出以TD-SCDMA网络为基础的双极化天线通信信号检测系统。通信信号检测过程中,用嵌入式处理器LPC2148结合四阶累积量的切片检测出TD-SCDMA信号,并通过估计获得TD-SCDMA信号的采样率,经过二次谱算法的运算,获得谱峰间的距离来估计出OVSE码的周期参数。以标准验证芯片为中心,针对相同类型的混合信号电路组建验证电路,最终完成对验证模块DOT4MBST及验证电路的检测验证。测试结果表明,提出的双极化天线的通信信号检测系统能够在错综复杂环境中,对通信信号进行精确的采集,且鲁棒性强。     

基于不同叶片数目比的烟气涡轮多叶片通道数值模拟

基于定常假设,利用混合平面模型传递级间参数,运用Fluent软件对不同静动叶片数目比下的烟气涡轮多叶片通道流场进行了数值计算,得到了温度、压力、出口速度和马赫数等参数的变化规律,绘制了不同静动叶片数目比下各种参数的体积加权平均XY图,并通过数值分析确定了静动叶片最佳数目比为50∶74,最佳静叶安装角为35°。结果表明:叶片数目增减和静叶安装角的变化对烟气涡轮整体性能的影响须考虑多种因素,并不能以单一参数的变化来决定最佳叶片数目和静叶安装角。该结论可为烟气涡轮现有装备的科学管理和技术改进提供理论依据。     

数据链支持下的武器系统评估体系研究

结合数据链作战使用需求,针对国外采用统计法评估数据链系统代价高、费时和针对单一兵器系统的问题。创新性地将作用域原则引入WSSDL作战效能评估体系过程中,完成了基于作用域的指标体系构建和综合评估方法设计工作,首次有效地解决了数据链支持下武器系统的评估对象多样化、人在回路因素多、定性指标缺乏量化手段的问题,为数据链支持下的武器系统作战效能评估提供了可靠手段和方法。     

无动力运载器出水过程误差分析

无动力运载器在出水过程中受海浪的扰动作用,运动参数会产生一定的偏差。针对海浪随机性的特点,应用波能谱理论,在P-M谱基础上构建了随机海浪模型,并使用四元数法建立运载器水弹道数学模型,解决了运载器垂直出水姿态角存在的奇异性问题,通过采用二元切片法给出波浪力的计算公式。最终在Matlab/Simulink仿真工具箱下建立了运载器仿真模型,就不同海况与主浪向角影响下运载器出水的运动参数偏差进行了仿真计算,分析了其变化规律。仿真结果表明,运载器在4级海况以下各项运动参数都满足出水要求,对运载器的设计与使用具有一定的参考意义。     

基于奇异谱分析的盲源分离单通道语音增强算法研究

针对盲源分离算法无法直接对单路含噪语音信号进行分离的问题,提出一种基于奇异谱分析的盲源分离单通道语音增强算法.通过对单路含噪语音信号进行奇异谱分析,将其低频分量作为第二路观测信号,利用改进的最大信噪比盲源分离算法进行处理,从而实现语音信号和噪声的分离.实验结果表明,该算法能够有效抑制噪声,提高信噪比,起到良好的语音增强效果.     

装备分布式虚拟维修训练仿真负载平衡研究

基于HLA的装备分布式虚拟维修训练过程极易产生仿真节点负载失衡,以往的负载平衡研究多关注资源利用率,仿真运行过程中可能会因节点负载的不均衡进行频繁的负载调度,影响仿真运行效率.针对此问题,以保证仿真节点的高效运行为首要目的,将负载平衡定义为不存在超载节点即为平衡,提出了一种动静结合的复合式负载平衡调度方法.研究了复合式负载平衡系统的体系结构,采用最小连接调度法实现了节点静态负载的粗粒度平衡,引入仿真运行比率分量参数表征负载量值,进而设计了动态负载平衡算法对仿真运行过程进行实时监控和调度.实验结果表明,改进后仿真平衡调度频率明显下降,实现了资源利用率和仿真效率的平衡兼顾,取得了良好的效果.     

Optimal control of noncollaborative servers in two‐stage tandem queueing systems

We consider two‐stage tandem queueing systems with dedicated servers in each station and a flexible server that is trained to serve both stations. We assume no arrivals, exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming a noncollaborative work discipline with idling and preemptions allowed. For larger holding costs in the first station, we show that (i) nonidling policies are optimal and (ii) if the flexible server is not faster than the dedicated servers, the optimal server allocation strategy has a threshold‐type structure. For all other cases, we provide numerical results that support the optimality of threshold‐type policies. Our numerical experiments also indicate that when the flexible server is faster than the dedicated server of the second station, the optimal policy may have counterintuitive properties, which is not the case when a collaborative service discipline is assumed. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 435–446, 2014     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014     

动态WTA问题的混沌人工鱼群算法

针对不同作战平台上多个武器单元对一批目标进行射击时的武器目标分配问题,建立了该问题的数学模型。采用混沌人工鱼群算法对动态条件下的武器目标分配问题进行求解,并设计一个实例进行仿真实验。仿真结果表明,在时间约束条件下该算法较遗传算法更具优越性,验证了混沌人工鱼群算法用于动态武器目标分配的有效性。