飞机发动机关键系统智能故障诊断方法

飞机发动机是一个非常复杂的大系统,由于其结构复杂,工作环境恶劣,对其关键系统的故障进行准确诊断始终是困扰业界的技术瓶颈之一。提出了采用EMD小波阈值降噪与主元分析相结合的方法,对飞机发动机气路系统故障诊断进行了深入研究。针对某型真实飞机发动机进行测试试验采集的气路多参量数据,首先采用经验模态分解(Empirical Mode Decomposition,EMD)对气路系统各参量信号进行EMD分解,然后采用软阈值函数对其进行降噪,并进行信号重构,从而可得到飞机发动机气路工作状态有效数据。在此基础上,设计了飞机发动机气路系统主元分析故障诊断模型,并结合预处理得到的飞机发动机气路有效数据,运用所设计的主元分析故障诊断模型对飞机发动机进行故障诊断技术研究。研究结果表明,所提出的方法能够很好地诊断出飞机发动机气路系统实际运行时所出现的故障,具有重要的实际应用价值,并有广泛的应用前景。     

基于逆合成孔径成像激光雷达的自旋小目标成像系统

为了获得毫米级自旋小目标的清晰成像,采用逆合成孔径成像激光雷达技术设计了基于距离向数据与方位向数据相融合的图像重建系统。系统采用大带宽、窄线宽光纤激光器配合调制器实现激光脉冲的线性调频,利用光外差原理对回波信号进行采集处理。结合自旋目标的运动特性,给出了含有自旋分量的回波信号函数方程,并将该分量引入传统的R-D算法中实现了对自旋目标的ISAIL二维图像的重建。实验采用毫米级铝条构成被测小目标,通过步进电机及带倾角的转台完成运动及自旋模拟。实验结果显示,当目标固定时,可通过回波能量数据获得一维距离向图像,与被测目标的4个特征点位置一致。当目标运动时,通过数据压缩并代入自旋参量,最后通过R-D算法可以获得可识别的ISAIL二维图像,验证了系统符合自旋小目标成像的设计要求。     

军事无线通信抗干扰装备及技术发展

以经典扩跳频抗干扰通信技术为切入点,综述了外军短波、超短波战术通信和数据链领域抗干扰装备和技术的发展现状,在此基础上,对通信抗干扰技术未来发展趋势进行了分析和预测。     

对调频斜率极性捷变SAR欠采样转发干扰

针对传统欺骗干扰难以对调频斜率极性捷变SAR（chirp rate polarity jittered SAR, CRPJ-SAR）形成有效干扰,研究了对CRPJ-SAR欠采样转发干扰。通过建立CRPJ-SAR有限时长欠采样转发干扰信号模型,分析了欠采样转发干扰对CRPJ-SAR的干扰效果。给出假目标数目、位置以及幅度的理论计算公式。在此基础上讨论了欠采样周期对干扰效果的影响。利用数字仿真验证了理论分析的正确性。     

基于反馈线性化的深海潜标姿态滑模控制

针对潜标空间运动的强非线性及数学模型中存在的干扰不确定性为控制带来的挑战,提出了一种基于反馈线性化的深海潜标姿态滑模控制律,并编程进行了仿真及与输入输出线性化控制方法进行比较,结果表明,两种方法均能将潜标控制到参考姿态,滑模控制对系统的不确定性干扰和执行器滞后具有更好的鲁棒性。另外,通过程序可以数值模拟的方式观察潜标在控制过程中的水动力、力矩,潜标姿态、空间运动轨迹、缆索动力学特征等信息,为客观分析潜标的控制与水动力机理提供了支撑。     

备件冷储备方案下装备群任务可靠性建模

针对具有相同结构功能的装备群系统可靠性评估问题,根据任务周期内对装备完好数的要求,合理表示了系统状态转移过程。以部件任务期间状态变化为研究对象,将系统等效表示为多阶段任务系统,即串行k/N(G)系统。在确定系统可行状态过程基础上,分别建立了部件寿命分布在3种不同情形下的系统任务可靠性模型,并分析了备件冷储备方案的影响。为确定系统任务期间备件携带量提供决策支持,最后给出了一个应用实例。     

A characterization of optimal base‐stock levels for a multistage serial supply chain

In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016     

When Programming Trumps Policy and Plans: The Case of the US Department of the Navy11

Traditionally, policy and planning have been institutionally weak in the Naval Staff (Office of the Chief of Naval Operations – OPNAV). In their place, the N8 (Programming) has dominated resource decision-making, and, by default, decisions relating to policy and planning. Recent uncertainty over defense authorization and appropriations has resulted in calls for a greater role to be played by the N3/5, Policy and Plans Directorate. The article argues that reform of the Department of the Navy’s planning process is urgently needed. OPNAV’s weak planning and overly dominant programming practices are compared with those of the Departments of the Army and Air Force and are shown to be out of conformance with them. The article concludes with specific and detailed recommendations for reform of both the current planning and programming processes.     

The probability of the existence of a feasible flow in a stochastic transportation network

Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016     

基于节点选择更新的简化LDPC译码算法

文中通过分析信息在短环中传递的特性,提出了一种基于节点选择更新的简化LDPC译码算法。该算法可以通过在一定程度上避免短环对译码的影响来降低译码运算复杂度。仿真结果表明对于二元以及多元LDPC码,该算法相对于BP算法只有少量性能损失。