A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.     

强爆轰驱动超高速碎片发射装置设计因素分析

为了得到发射装置设计因素和超高速碎片性能间的关系,考虑了药型罩的材料、炸药种类、装药长径比、药型罩的锥角、药型罩的厚度、药型罩顶部靠近装药侧的曲率半径等设计因素,采用AUTODYNTM,结合正交试验,对超高速碎片的发射过程进行数值模拟。结果表明,3种发射装置结构分别可以提供质量为1. 533 g的紫铜碎片、速度为11. 649 km/s的铝碎片、动能为85. 6 k J的铝碎片; 2种发射装置结构均可以提供质量大于1 g、速度高于11 km/s的密实结构圆柱状碎片。验证了仿真方法的可信性,对影响碎片性能的设计因素进行了分析、排序,并得到了这些设计因素与碎片质量、速度、动能的关系。     

分布式系统设计中的互斥问题

介绍了互斥问题的基本概念,并针对分布式系统设计中的互斥问题分析了非基于令牌和基于令牌的两种解决方案.通过对典型算法的分析,有助于对分布式系统形成可操作的数学模型.     

基于模糊C-划分和3D小波变换的视频编码方法

在传统矢量量化的基础上,引入噪声模型的影响,结合模糊数学理论,提出了一种基于模糊C-划分的混合噪声模型的矢量量化方法,并将其应用到视频编码中。文中视频编码方法采用了运动补偿与3D小波变换相结合。主要对基于模糊C-划分的混合噪声模型的矢量量化进行了分析。实验结果表明,该方法在视频压缩中具有良好的效果。     

利用星载GPS伪码测距进行小卫星星座的整网定位

首先针对小卫星星载ＧＰＳ伪码测距，基于星间差分消除／消弱误差，并引入星座网形约束，论述了星座模式下提高小卫星定位精度的一种整网数据处理方法，并给出了一个算例。然后进一步论述了不依赖ＧＰＳ的小卫星星座测控，以及提高小卫星星座定位自主性问题的几点设想。     

武警院校干部体能评价研究

通过对4所武警院校共计800名教员和机关干部体能状况进行调查，研究了不同体型干部的体能现状，进行了相应的体能评定，并制订了体能综合评价模型。本研究建议：加强武警院校干部的耐力素质训练，以提高干部体能水平，增强体能，改进生活方式，提高武警院校干部的教研能力。     

移动式铁路油罐车清洗装置水循环使用与节能分析

装备节能研究对建设绿色节能型社会具有重要意义。对移动式铁路油罐车清洗装置中清洗管路和吸污管路的热损进行分析计算,提出了水掺混循环使用的节能清洗方案,对清洗工艺中的传热过程、水循环使用中水掺混比例进行了详尽的分析计算,并对节能效果进行了分析。结果表明,清洗管路系统热损较低,水掺混循环使用的节能效果明显。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020