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

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

基于区间数理论的空战目标威胁评估

针对空战目标威胁评估问题,提出了一种新的基于区间数理论的评估方法。在分析了现有的目标威胁评估方法中距离威胁模型存在不足的基础上,提出了改进的距离威胁模型。给出了区间数特征向量法求解威胁指标权重的计算步骤,建立了基于区间数理论的空战目标威胁评估的数学模型。最后给出了仿真算例,仿真结果表明该方法是合理和有效的。     

空投设备气囊缓冲系统的缓冲特性分析与匹配方法

采用解析分析法,根据排气口流量方程和载荷运动方程建立了无量纲的空投设备气囊缓冲过程数学模型,并根据此模型构造了气囊的匹配设计图。讨论了排气口面积、气囊高度、着陆初速度、载荷质量、气囊底面积及排气口开启压力等参数对气囊缓冲性能的影响,提出了空投设备气囊缓冲系统的参数匹配设计方法,为空投设备气囊缓冲系统的匹配设计提供了技术支持。     

C4ISR体系结构设计方法

系统体系结构的设计在C4ISR系统开发中具有重要的地位,文章深入研究了目前运用广泛的三种C4ISR系统体系结构分析设计方法面向过程分析方法、面向对象设计方法和三维视图方法,分析了各种方法的优缺点并进行了比较;讨论了C4ISR体系结构设计方法和C4ISR系统本身的发展趋势以及两者之间的密切关系,对C4ISR系统体系结构的建设提出了自己的看法.     

Ordering policies for an inventory system with three supply modes

This article explores ordering policies for inventory systems with three supply modes. This model is particularly interesting because the optimal ordering decision needs to balance the inventory and purchase costs, as well as the costs for earlier and later periods. The latter cost trade-off is present only in inventory systems with three or more supply modes. Therefore, the result not only offers guidelines for the operation of the concerned inventory systems, but also provides valuable insight into the complex cost trade-offs when more supply modes are available. We assume that the difference between the lead times is one period, and the inventory holding and shortage costs are linear. We analyze two cases and obtain the structure of the optimal ordering policy. Moreover, in the first case, explicit formulas are derived to calculate the optimal order-up-to levels. In the second case, although the optimal order-up-to levels are functions of the initial inventory state and are not obtained in closed form, their properties are discussed. We also develop heuristic ordering policies based on the news-vendor model. Our numerical experiments suggest that the heuristic policies perform reasonably well. © 1996 John Wiley & Sons, Inc.     

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.     

Expressions for item fill rates in periodic inventory systems

We examine the problem of estimating the item fill rate in a periodic inventory system. We show that the traditional expressions for line item fill rate, found in many operations management textbooks, perform well for high fill rates (above 90%), but they consistently underestimate the true fill rate. The problem of underestimation becomes significant as the fill rate falls below 90% and is greatly amplified in cases with very low fill rates (below 50%). We review other more accurate expressions for fill rate, discussing their relative merits. We then develop an exact fill rate expression that is robust for both high and low fill rates. We compare the new expression to others found in the literature via an extensive set of simulation experiments using data that reflect actual inventory systems found at Hewlett-Packard. We also examine the robustness of the expressions to violations in the underlying assumptions. Finally, we develop an alternative fill rate expression that is robust for cases of high demand variability where product returns are allowed. © 1995 John Wiley & Sons, Inc.