Note: Remarks on theory of the core

This note proposes a necessary and sufficient condition for the existence of an undominated core and a necessary and sufficient condition for coincidence of the intersection core and the undominated core. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 455–458, 2000     

外场维护指挥控制系统可靠度模型

分析了影响外场指挥控制系统可靠性的主要因素,以指挥人员为主体,根据战时的实际,对指挥关系进行了重构,将串联指挥关系变为并联关系,通过利用马尔可夫链给出了指挥控制系统状态转移图,建立了计算外场指挥系统可靠性的数学模型。并且进一步给出了计算指挥控制系统的可靠性的方法。     

炮控系统性能试验中角位移量的几种测量方法

炮控分系统是主战坦克等地面攻坚武器系统的重要组成部分,在坦克全系统定型试验前,必须进行分系统的试验测试。国内目前使用的测试方法和测量设备还停在五六十年代的水平,为适应主战坦克武器系统的发展,必须研制一套测量精度高、自动化程度强的测量设备。介绍了以计算机为中心构建的炮控性能参数测试系统的组成与工作原理,讨论了炮控系统性能试验中利用CCD传感器与坐标靶、PSD传感器与电子靶、点光源与CCD传感器、激光(光纤)陀螺传感器或电测法进行角位移量测量的几种方法。     

EMS磁浮列车的轨道共振和悬浮控制系统设计

主要从悬浮控制系统设计的角度来解决磁浮列车的轨道共振问题,研究鲁棒状态观测器的设计,讨论观测器参数的选择方法。仿真和实验的结果表明,所设计的悬浮控制系统可以消除轨道共振,实现磁浮列车的稳定悬浮     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

Analysis of a new vehicle scheduling and location problem

We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001     

Fully sequential procedures for comparing constrained systems via simulation

We consider the problem of finding the system with the best primary performance measure among a finite number of simulated systems in the presence of a stochastic constraint on a single real‐valued secondary performance measure. Solving this problem requires the identification and removal from consideration of infeasible systems (Phase I) and of systems whose primary performance measure is dominated by that of other feasible systems (Phase II). We use indifference zones in both phases and consider two approaches, namely, carrying out Phases I and II sequentially and carrying out Phases I and II simultaneously, and we provide specific example procedures of each type. We present theoretical results guaranteeing that our approaches (general and specific, sequential and simultaneous) yield the best system with at least a prespecified probability, and we provide a portion of an extensive numerical study aimed at evaluating and comparing the performance of our approaches. The experimental results show that both new procedures are useful for constrained ranking and selection, with neither procedure showing uniform superiority over the other.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

On the exponentially weighted moving variance

MacGregor and Harris (J Quality Technol 25 (1993) 106–118) proposed the exponentially weighted mean squared deviation (EWMS) and the exponentially weighted moving variance (EWMV) charts as ways of monitoring process variability. These two charts are particularly useful for individual observations where no estimate of variability is available from replicates. However, the control charts derived by using the approximate distributions of the EWMS and EWMV statistics are difficult to interpret in terms of the average run length (ARL). Furthermore, both control charting schemes are biased procedures. In this article, we propose two new control charts by applying a normal approximation to the distributions of the logarithms of the weighted sum of chi squared random variables, which are respectively functions of the EWMS and EWMV statistics. These new control charts are easy to interpret in terms of the ARL. On the basis of the simulation studies, we demonstrate that the proposed charts are superior to the EWMS and EWMV charts and they both are nearly unbiased for the commonly used smoothing constants. We also compare the performance of the proposed charts with that of the change point (CP) CUSUM chart of Acosta‐Mejia (1995). The design of the proposed control charts is discussed. An example is also given to illustrate the applicability of the proposed control charts. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

基于3Dmax和OGRE的某型装备视景仿真研究*

某型装备视景仿真的研制对于提高教学质量和训练水平具有重要意义.提出了一种基于3Dmax和OGRE可视类的视景仿真方法,给出了视景仿真系统的总体结构和实现过程,解决了视景仿真过程中一些视点变换、角度控制、场景变化、面板仿真等关键的技术问题.