多目标攻击导弹捷联惯导的传递对准

在分析中距复合制导空空导弹捷联惯导传递对准的基础上,提出由机载火控系统根据导弹发射包线计算发出开始捷联惯导传递对准精对准的时刻,导弹惯导提前进行传递精对准的方法。利用此方法可以解决机载武器系统多目标攻击空空导弹传递对准满足连续发射多枚导弹实时性要求的问题。最后,在单目标情况下就开始传递对准时刻包线给出了算例。     

可供实用的舰船风浪中摇荡时历预报的模式

舰船在风浪中摇荡时历的极短期预报 ,具有多方面的实用价值 .现有的各种预报方法中 ,以卷积法和时间序列法中的ARMA模型较为常用 ,但如何测量艏前波是上述方法实施的前提条件 ,则未能解决 .文中提出的在舰船舯部装塔克测波仪 ,将所测波形时历转换为艏前任意点波形时历的方法 ,可解决上述矛盾 .再采用ARMA建模、依AIC法则估计模型阶数的预报方式 ,即可用于实船进行摇荡时历短期预报     

装备器材库温湿度监控系统的设计与实现

军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计.     

Waiting time analysis for a queueing system with time‐limited service and exponential timer

We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001.     

Computational analysis of MMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline

This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000     

Applying a bootstrap approach for setting reorder points in military supply systems

This paper develops and applies a nonparametric bootstrap methodology for setting inventory reorder points and a simple inequality for identifying existing reorder points that are unreasonably high. We demonstrate that an empirically based bootstrap method is both feasible and calculable for large inventories by applying it to the 1st Marine Expeditionary Force General Account, an inventory consisting of $20–30 million of stock for 10–20,000 different types of items. Further, we show that the bootstrap methodology works significantly better than the existing methodology based on mean days of supply. In fact, we demonstrate performance equivalent to the existing system with a reduced inventory at one‐half to one‐third the cost; conversely, we demonstrate significant improvement in fill rates and other inventory performance measures for an inventory of the same cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 459–478, 2000     

离散变结构系统的组合控制策略研究

对离散变结构控制系统的趋近律方法进行研究,提出了4种组合控制策略,它们可以明显改善系统的动态性能,并给出应用例子加以验证．     

面向Agent的海军军械勤务辅助支持系统的逻辑构建

结合分布式人工智能中的Agent技术和军械勤务辅助支持系统的特点 ,研究了面向A gent的军械勤务辅助支持结构。结合该系统介绍了Agent和多Agent系统的概念 ,讨论了A gent的通信机制     

建筑消防设计中疏散时间的确定方法

本文针对建筑消防设计中疏散时间计算这一关键问题 ,利用疏散行为指数确定生活不能自理的人的疏散能力 ,进而确定其疏散时间 ,为建筑消防安全设计和防火管理工作提供理论依据。文中介绍的方法、计算公式及步骤简捷 ,具有一定的实用价值。     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998