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.     

机载武器控制系统算法研究

机载武器控制系统的算法是其软件部分的核心,算法的最终目的是保证在一定的条件下实现最有利的武器运用方案。将机载武器控制系统的算法分为四个不同的子算法,对每一子算法的建立方法进行了描述,最后得到形成执行命令的算法,即武器运用方案执行命令分配及形成的算法。     

机械振动特征分析中的信号处理技术与微机特征分析系统

文中指出抑制阶比混迭和泄漏是建立一套完整的微机特征分析系统中需要解决的二个关键的信号处理问题。提出了阶比滤波器是抑制阶比混迭有效和实用的方法;并研制频率比合成器以抑制泄漏。介绍了由频率比合成器、阶比滤波器、TMS32010数据采集装置、主机和绘图仪所组成的微机特征分析系统。最后给出了该微机特征分析系统对轴承进行故障诊断的结果。     

带噪声的 AR 模型的参数估计及定阶

本文讨论了带噪声情形下 AR 模型的参数估计及定阶问题,还给出了噪声模型的参数估计,并证明了它们的强相容性。     

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     

ENO格式应用分析

对一类高阶、高分辨率的ENO格式进行了较为详细的讨论。通过一些典型算例的应用和同常用TVD类型格式的比较 ,说明了在计算中采用高阶格式分辨复杂流动结构的优越性。在对格式应用分析的基础上 ,指出了格式应用中需注意的问题。通过定量分析说明 ,高阶ENO格式在计算中 ,不但能够减少网格规模 ,而且能够明显提高计算物理量 ,特别是其导数的计算精度     

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

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

论开放对改革的历史意义和现实作用

中国的改革始终并越来越置于开放的国际大环境和背景下 ,围绕开放来进行 ,改革的历史取向、实际步骤等方方面面都自觉不自觉地受到开放的很大影响 :开放引致改革、开放促进改革、开放制约改革、开放本身就是改革、开放保障改革。因此 ,中国的改革是一种典型的开放式改革 ,中国的“改革开放”也可以或越来越应当是“开放改革” ;就改革与开放的相互关系、作用及对整个社会发展的作用和意义而言 ,开放重于改革。