发射空对空导弹时目标进入角的确定

提出了一种确定目标进入角的原理和方法,这种原理和方法具有较高的计算精度和实时性,易于工程实现,可用于机载火力控制系统完成空对空导弹允许发射区计算.     

信息战战场分析模型

根据区域攻防的不同战场信息行动,建立3个非线性微分方程模型.以防御方的总射击速率和战斗力消耗率作为评价指标,着重探讨了进攻方的指挥控制系统、侦察监视系统、战毁评估系统和火力系统之间的性能匹配关系.     

空空导弹三维实时动态数字仿真

主要论述了某型空空导弹实现３维实时动态数字仿真的思路和方法,首先建立３维空战模型,然后通过一定的计算方法和编程技巧实现了数字仿真的实时性。在数字仿真实时性的基础上,实现了导弹攻击目标过程的３维动态图形显示。     

空空导弹导引头角预定精度研究

空空导弹导引头角预定是重要的导弹发射控制参数,其有效的计算精度分析,是导弹可靠截获和跟踪目标的重要保证。基于前置追踪攻击原理,给出了空空导弹导引头角预定的计算模型,建立了机载雷达误差对导引头角预定精度影响的误差分析仿真结构,并对仿真计算结果进行了讨论。     

电子战仿真系统中防空武器作战效能研究

介绍了电子战仿真系统总体结构,研究了空中拦截、地对空导弹及高炮等模块的作战效能模型,并用Ｍｏｎｔｅ Ｃａｒｌｏ 试验方法分析了系统的电子对抗作战效能     

沙漠之狐军事行动特点及其思考

通过沙漠之狐行动过程综述,总结了此次军事行动呈现的特点。加强战区导弹攻防对抗深入研究,高度重视防御体系建设已成为当务之急。     

Performance analysis of queue length monitoring of M/G/1 systems

This study investigates the statistical process control application for monitoring queue length data in M/G/1 systems. Specifically, we studied the average run length (ARL) characteristics of two different control charts for detecting changes in system utilization. First, the nL chart monitors the sums of successive queue length samples by subgrouping individual observations with sample size n. Next is the individual chart with a warning zone whose control scheme is specified by two pairs of parameters, (upper control limit, d_u) and (lower control limit, d_l), as proposed by Bhat and Rao (Oper Res 20 (1972) 955–966). We will present approaches to calculate ARL for the two types of control charts using the Markov chain formulation and also investigate the effects of parameters of the control charts to provide useful design guidelines for better performance. Extensive numerical results are included for illustration. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.