基于熵的空中目标识别模型及应用

空中目标识别是现代防空作战的重要研究内容。研究根据不同类型的目标产生不同的辐射和不同的雷达回波信号对目标进行识别。提出利用熵理论来处理目标识别问题,采用层次分析法与熵权的组合来确定指标的权重。仿真实例表明,基于熵的识别是一种运算简单,结果可靠的目标识别算法。     

机械原理教学过程优化的研究

教学过程是一个复杂多变的过程,受各种因素的制约,只有以系统优化为基本原理去组织教学活动,才能全面提高教学质量。本文针对《机械原理》课的性质、特点及教学中面临的复杂情况,从几个方面讨论了教学过程优化的思路和方法。     

Optimal policies for stochastic clearing systems with time-dependent delay penalties

We study stochastic clearing systems with a discrete-time Markovian input process, and an output mechanism that intermittently and instantaneously clears the system partially or completely. The decision to clear the system depends on both quantities and delays of outstanding inputs. Clearing the system incurs a fixed cost, and outstanding inputs are charged a delay penalty, which is a general increasing function of the quantities and delays of individual inputs. By recording the quantities and delays of outstanding inputs in a sequence, we model the clearing system as a tree-structured Markov decision process over both a finite and infinite horizon. We show that the optimal clearing policies, under realistic conditions, are of the on-off type or the threshold type. Based on the characterization of the optimal policies, we develop efficient algorithms to compute parameters of the optimal policies for such complex clearing systems for the first time. We conduct a numerical analysis on the impact of the nonlinear delay penalty cost function, the comparison of the optimal policy and the classical hybrid policy (ie, quantity and age thresholds), and the impact of the state of the input process. Our experiments demonstrate that (a) the classical linear approximation of the cost function can lead to significant performance differences; (b) the classical hybrid policy may perform poorly (as compared to the optimal policies); and (c) the consideration of the state of the input process makes significant improvement in system performance.     

基于模糊综合评判的地空导弹阵地选择

在现代防空中,由于精确制导技术在空袭兵器当中的运用,使防空作战中兵力机动显得格外重要.为实现机动作战,阵地选择就成为机动作战中的重要环节.运用模糊数学原理和方法,结合地空导弹部队阵地选择的特点,给出了阵地选择评价因素指标体系,建立了阵地选择方案的二级模糊综合评判模型,并采用层次分析法(AHP)对阵地选择评价因素的权重进行了确定,最终得出阵地选择合理的评价结果.     

现代文本分类技术研究

分析了当前的文本分类技术,总结了文本分类需要解决的问题;在详细比较了各种不同的分类算法以及文本模型以后,为进一步开展优化以及提高文本分类技术的研究工作提供了一些参考和建议。     

行星变速箱换档过程动态仿真研究

从传动系行星排传递单元和构件出发,建立了N自由度行星变速箱运动学数学模型,并运用该模型对三自由度行星变速箱进行了换档过程的动态仿真。     

Age replacement policies in two time scales

We develop and estimate optimal age replacement policies for devices whose age is measured in two time scales. For example, the age of a jet engine can be measured in the number of flight hours and the number of landings. Under a single‐scale age replacement policy, a device is replaced at age τ or upon failure, whichever occurs first. We show that a natural generalization to two scales is to replace nonfailed devices when their usage path crosses the boundary of a two‐dimensional region M, where M is a lower set with respect to the matrix partial order. For lifetimes measured in two scales, we consider devices that age along linear usage paths. We generalize the single‐scale long‐run average cost, estimate optimal two‐scale policies, and give an example. We note that these policies are strongly consistent estimators of the true optimal policies under mild conditions, and study small‐sample behavior using simulation. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 592–613, 2003.     

Nonparametric estimation of some quantities of interest from renewal theory

In this paper, confidence intervals are given for two quantities of importance related to renewal processes. For each quantity, two confidence intervals are discussed. One confidence interval is given for general, all‐purpose use. Another confidence interval is given which is easier to compute, but not of general use. The case where data are subject to right censorship is also considered. Some numerical comparisons are made. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 638–649, 2003.     

Optimizing the quality control station configuration

We study unreliable serial production lines with known failure probabilities for each operation. Such a production line consists of a series of stations, existing machines, and optional quality control stations (QCSs). Our aim is to decide on the allocation of the QCSs within the assembly line, so as to maximize the expected profit of the system. In such a problem, the designer has to determine the QCS configuration and the production rate simultaneously. The profit maximization problem is approximated assuming exponentially distributed processing times, Poisson arrival process of jobs into the system, and the existing of holding costs. The novel feature of our model is the incorporation of holding costs that significantly complicated the problem. Our approximation approach uses a branch and bound strategy that employs our fast dynamic programming algorithm for minimizing the expected operational costs for a given production rate as a subroutine. Extensive numerical experiments are conducted to demonstrate the efficiency of the branch and bound procedure for solving large scale instances of the problem and for obtaining some qualitative insights.

相似文献   

Dynamic learning,pricing, and ordering by a censored newsvendor

We address the problem of determining optimal ordering and pricing policies in a finite‐horizon newsvendor model with unobservable lost sales. The demand distribution is price‐dependent and involves unknown parameters. We consider both the cases of perishable and nonperishable inventory. A very general class of demand functions is studied in this paper. We derive the optimal ordering and pricing policies as unique functions of the stocking factor (which is a linear transformation of the safety factor). An important expression is obtained for the marginal expected value of information. As a consequence, we show when lost sales are unobservable, with perishable inventory the optimal stocking factor is always at least as large as the one given by the single‐period model; however, if inventory is nonperishable, this result holds only under a strong condition. This expression also helps to explain why the optimal stocking factor of a period may not increase with the length of the problem. We compare this behavior with that of a full information model. We further examine the implications of the results to the special cases when demand uncertainty is described by additive and multiplicative models. For the additive case, we show that if demand is censored, the optimal policy is to order more as well as charge higher retail prices when compared to the policies in the single‐period model and the full information model. We also compare the optimal and myopic policies for the additive and multiplicative models. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007