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.     

提高“两课”教学的生动性三议

提高“两课”教学的生动性，就要在备课和讲课时，注重追求思想上的深刻、资料上的精彩和语言上的震撼与精美。力求思想深刻，内容精彩，语言精美。     

H 面双填充介质金属方波导的本征模

通过求解Ｈ面双填充介质金属方波导中位函数的亥姆霍兹方程,得到系统的电磁波的本征模函数及本征值方程,其本征模为ＬＳＥ模或ＬＳＭ模,并给出了色散关系的数值解。     

舰炮瞄准角速度和角加速度的定量分析

从舰炮火控原理出发,用坐标转换技术和微分理论,推导了在二轴和三轴稳定情况下,火炮瞄准的角速度和角加速度公式,并讨论了跟踪器的有关情况,给出了计算实例和主要结论。     

四支板超声速引射器性能特性试验

对二维喷管构型的四支板超声速引射器进行冷流试验,分析启动、负载匹配方面的性能特性。试验结果表明:启动特性方面,四支板超声速引射系统的盲腔压力低于3 kPa,引射器入口腔压的迟滞压力比启动压力低15.9%。负载匹配特性方面,四支板引射器在小引射系数、大增压比状态下具有十分明显的优势,当引射系数为0.04时,增压比为11.21;当引射系数为0.10时,增压比为7.0。因此,二维喷管构型的多支板超声速引射器具有良好的启动、负载匹配性能,工程应用潜力较大。     

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     

激波诱导惰性堆积粉尘运动的建模及数值模拟

基于空间平均的双流体模型 ,引入描述颗粒脉动速度的粒化温度 ,建立颗粒相的本构方程 ,将粒化温度模型推广到解决高速流动问题。采用AUSM+ 有限差分法 ,数值模拟激波在一定厚度的惰性粉尘床中传播及诱导粉尘颗粒运动的过程。结果表明 ,粒化温度模型较好地描述了这一过程 ,证实了此模型在处理稠密颗粒高速流动和流场存在强间断中的可行性     

Dynamic pricing under first order Markovian competition

We evaluate the effect of competition on prices, profits, and consumers' surplus in multiperiod, finite horizon, dynamic pricing settings. In our base model, a single myopic consumer visits two competing retailers, who offer identical goods, in a (first order Markovian) probabilistic fashion—if the posted price exceeds the consumer's valuation for the good, he returns to the same store in the following period with a certain probability. We find that even a small reduction in the return probability from one—which corresponds to the monopoly case at which prices decline linearly—is sufficient to revert the price decline from a linear into an exponential shape. Each retailer's profit is particularly sensitive to changes in his return probability when it is relatively high, and is maximized under complete loyalty behavior (i.e., return probability is one). On the other hand, consumer surplus is maximized under complete switching behavior (i.e., return probability is zero). In the presence of many similar consumers, the insights remain valid. We further focus on the extreme scenario where all consumers follow a complete switching behavior, to derive sharp bounds, and also consider the instance where, in this setting, myopic consumers are replaced with strategic consumers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011