基于FFT的自适应频率估计算法

为了解决FFT算法中因能量泄露和栅栏效应而导致的算法估计性能下降的问题,提出了一种基于FFT的自适应频率估计算法.分析了Rife算法,指出当信号频率位于量化频率附近时,由于插值方向错误,会导致频率估计性能下降;对于分段FFT相位差频率估计算法,当2段信号最大谱线处对应的相位相差比较大时,容易产生相位模糊,从而增大估计误差.基于FFT的自适应频率估计算法将2种算法进行了综合,既保留了2种算法的优点,又对算法性能有所改进.仿真结果表明:该算法的估计精度、稳定性和抗噪能力都有显著提高.     

Irreversible demagnetization mechanism of permanent magnets during electromagnetic buffering

The permanent magnets will be irreversibly demagnetized under high temperature and high velocity during the electromagnetic buffering. In this study, the magnetic field induced by eddy currents and the self-demagnetizing field of permanent magnet are taken into consideration together for demagnetiza-tion analyse. The magnetic Reynolds number is used to express the eddy currents demagnetization. The correction coefficient being expressed as the index of the air-gap width, the inner cylinder thickness, iron pole axial length and the permanent magnet demagnetization coefficient is introduced by magnetic path analysis to represent the self-demagnetization effect and the demagnetization extent. The electromag-netic buffer (EMB) prototype is tested under intensive impact loads of different strengths at room temperature. The accuracy of the nonlinear irreversible demagnetization finite element model is verified by demagnetization on damping force, velocity and displacement. Finally, high-velocity demagnetization and high-temperature demagnetization are analysed in order to obtain the distribution law of irre-versible demagnetization.     

An exact aggregation/disaggregation algorithm for large scale markov chains

Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc.     

Weak aging properties for coherent systems with statistically dependent component lifetimes

As a relevant topic in reliability theory, the preservation of aging properties under the formation of various coherent structures contributes to improving system performance through better structure design and more effective system maintenance. The classical research in this line usually focuses upon coherent systems with independent component lifetimes. Recently, some authors discussed the preservation of IFR, NBU, and DMRL in the setting of dependent component lifetimes. This paper further investigates sufficient conditions for coherent systems with dependent component lifetimes to preserve aging properties including NBUC, NBU (2), DMRL, and their dual versions. Some examples are presented to illustrate coherent structures and typical copula functions fulfilling the present sufficient conditions as well.     

信息化战场下军事指挥决策的人机交互技术与方式研究

人机交互环境是影响信息化战场下军事指挥决策能力与效率的一个重要因素。文章分析了未来信息化战场军事指挥决策面临的挑战,对军事指挥决策人机交互技术与方式的理论、技术与实践进行了深入探讨,研究了我军军事指挥决策人机交互技术与方式的发展思路和方向,提出了信息时代提升我军军事指挥决策能力的建议和对策。     

火炮身管内孔测量仪自动定心装置设计

介绍了一种用于火炮身管内孔参数测量仪的新型自动定心装置设计,给出了这种定心装置的设计思想、工作原理和所达到的定心精度.     

多帧高斯混合概率假设密度的多目标跟踪算法

针对低检测概率下多目标跟踪时,概率假设密度滤波器难以正确估计当前目标个数以及目标状态问题,提出一种基于多帧融合的高斯混合概率假设密度滤波算法。根据不同时刻目标权值构造目标多帧权值记录集及目标状态抽取标志。当某些时刻目标被漏检时,依据目标状态抽取标志,并结合目标多帧权值记录集中权值信息估计丢失目标的状态。仿真实验表明,算法有效地提高了低检测概率下现有相关算法的目标状态和数目估计精度。     

基于FLAC^3D的岩土边坡施工效应研究

采用FLAC3D对预应力锚索框架梁支护的岩土边坡施工过程进行数值模拟,围绕施工中坡体位移场与应力场的变化以及下级边坡施工对上部已完成的支挡结构受力影响进行研究.结果表明坡体开挖引起的松弛区呈圆弧状,且位移由临空面向坡体内逐渐减小,坡体弹性模量与其变形呈非线性递减关系;预应力锚索框架梁能有效抑制坡体变形,从坡顶到坡脚锚索轴力依次增大,故工程设计中宜对其分别设计,做到“强腰固脚”;下级边坡与上级边坡的支挡结构相互约束,共同承担滑坡推力,形成一种“联合支挡结构”.     

基于位置信息的无线传感网络路由改进

基于位置信息的无线传感器网络如果完全采用无状态的方式路由,在某些拓扑结构中存在数据不可到达的缺陷,即死亡点的问题.针对这一问题,将无线传感器网络抽象为一数学模型,在此模型的基础上,给出了问题的数学描述.经分析,提出了一种基于逃离算法的详细解决方案.对算法的性能从理论上分析得出算法没有环路,是正确可行的,而仿真结果也验证了这一点,算法的时间复杂度为O(n).