导弹气动参数变化时PID与模糊控制的仿真

以参数大范围变化的导弹为研究对象,分别设计PID控制器和模糊控制器,并对PID控制器和模糊控制器组成的稳定回路进行仿真,仿真结果表明,PID控制器不能适应参数大范围的变化,表现为容易产生超调。简单模糊控制器对外界参数具有较好的适应性和鲁棒性,但存在稳态误差,通过采取模糊——积分并联混合,改善了模糊控制的稳态性能,提高了模糊控制的稳态精度。     

A linear-programming-based method for determining whether or not n demand points are on a hemisphere

Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush-Kuhn-Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc.     

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.     

The reliability of a series system of repairable subsystems: A bayesian approach

Consider the problem of estimating the reliability of a series system of (possibly) repairable subsystems when test data and historical information are available at the component, subsystem, and system levels. Such a problem is well suited to a Bayesian approach. Martz, Waller, and Fickas [Technometrics, 30 , 143–154 (1988)] presented a Bayesian procedure that accommodates pass/fail (binomial) data at any level. However, other types of test data are often available, including (a) lifetimes of nonrepayable components, and (b) repair histories for repairable subsystems. In this article we describe a new Bayesian procedure that accommodates pass/fail, life, and repair data at any level. We assume a Weibull model for the life data, a censored Weibull model for the pass/fail data, and a power-law process model for the repair data. Consequently, the test data at each level can be represented by a two-parameter likelihood function of a certain form, and historical information can be expressed using a conjugate family of prior distributions. We discuss computational issues, and use the procedure to analyze the reliability of a vehicle system. © 1994 John Wiley & Sons, Inc.     

基于伪随机线性调频的双序列跳频通信系统

针对双序列跳频(Binary-Sequence Frequency Hopping,BSFH)在对偶信道被干扰的情况下会导致通信瘫痪的缺点,提出了一种基于伪随机线性调频的双序列跳频通信系统。在发送端利用线性调频信号对每一跳载波进行带内扩频,接收端将解跳后的信号作分数阶傅里叶变换,然后通过抽样判决得到发端信息。构建了相应的系统模型,推导了其在跟踪干扰和部分频带干扰下的误码率数学表达式。理论和仿真结果表明:在最坏跟踪干扰下,该系统比BSFH约有5 dB以上的性能增益;在部分频带干扰下,达到相同误码率时所需的信干比,改进方法比BSFH低约4 dB。     

基于压制武器系统的自组网实现方法

根据压制武器系统网络的特点和未来战争对武器系统的要求,将自组网引入到了压制武器系统网络,介绍了其实现方法。该方法结合通用的自组网协议提出了网络的设计方案,采用了跨层的方法,主要设计链路层、网络层和传输层,网络实现采用模块化的设计方式。本网络具有一定的自组织、自恢复能力,具有更高的可靠性、灵活性,在一定的距离范围内能够满足网络通信的基本要求。