机械振动特征分析中的信号处理技术与微机特征分析系统

文中指出抑制阶比混迭和泄漏是建立一套完整的微机特征分析系统中需要解决的二个关键的信号处理问题。提出了阶比滤波器是抑制阶比混迭有效和实用的方法;并研制频率比合成器以抑制泄漏。介绍了由频率比合成器、阶比滤波器、TMS32010数据采集装置、主机和绘图仪所组成的微机特征分析系统。最后给出了该微机特征分析系统对轴承进行故障诊断的结果。     

火炮射表数据处理计算步骤和程序框图

本文是文献［１—３］的继续,主要研究火炮射表数据处理算法的计算步骤和程序设计框图。这两个内容是正确进行程序设计、分析和使用的重要环节。     

带噪声的 AR 模型的参数估计及定阶

本文讨论了带噪声情形下 AR 模型的参数估计及定阶问题,还给出了噪声模型的参数估计,并证明了它们的强相容性。     

基于数据压缩的LSP参数高效量化算法

文中为解决超长帧编码系统中联合帧数过多导致LSP参数量化性能下降这个问题,将多项式拟合引入超长帧编码系统中,利用多项式拟合压缩LSP参数矩阵,以降低量化时实际联合的帧数。再用分裂矩阵量化器进行量化。仿真结果表明,在120 bps的参数量化速率下,此算法的量化性能优于矩阵量化算法(MQ),平均谱失真比MQ算法降低了0.0719 dB,平均分段信噪比提高了0.1971 dB。     

导弹光学告警系统及对抗技术综述

详述了导弹羽烟热辐射的光电高速采集方法 ,并实时对导弹逼近告警。同时介绍了国外红外告警技术的发展现状     

机载武器控制系统算法研究

机载武器控制系统的算法是其软件部分的核心,算法的最终目的是保证在一定的条件下实现最有利的武器运用方案。将机载武器控制系统的算法分为四个不同的子算法,对每一子算法的建立方法进行了描述,最后得到形成执行命令的算法,即武器运用方案执行命令分配及形成的算法。     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

Numerical investigation of dynamic interaction with projectile and harmonic behaviour for T-finned machine gun barrels

Machine gun barrels differ from their rifle counterparts in terms of profile. To support high rates of sustained fire, machine gun barrels are made thicker in order to dissipate more heat and maintain their flexural rigidity and thus accuracy, but on other hand they also contribute in weight addition to weapon. This investigation deals with comparison between a conventional machine gun barrel and an improved innovative design having T-fins, both having same weight and chambered in 5.56 × 45 NATO ammunition, to compare their structural and harmonic characteristics which were parameterized by factors such as modal spectrum, directional deformation at muzzle ends during a single shot fire and harmonic behaviour at corresponding range of exciting frequencies. The solid models of both the barrels having same weight, were created using Solidworks. The continuous input data functions were generated by MATLAB using the field tested discreet data points. The generated velocity-distance functions were converted into time dependent functions using integration algorithms to calculate transient parameters such as time steps, excitation frequency range, angle of rotation of projectile and its angular velocity. The dynamic condition simulated the varying nature of forces due to eccentricity in projectile and this data was fed to a time step study using ANSYS transient structural work bench followed by modal and harmonic analysis. The results showed a significant reduction in muzzle end deformation which thus proved that the T-finned barrel, although had same weight as that of the conventional one, but had better structural and harmonic characteristics, and hence it would inherit better firing accuracy.     

On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.