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.     

超声波扩频测距及其信道自适应均衡技术

在扩频通讯系统框架中,建立一种新颖的多阵元超声波测距定位系统。从测距系统的仿真结果来看,采用二进制相移键控(BPSK)直序信号数字相关解调技术和基于最小均方算法的超声波接收信道自适应均衡器,不仅可以克服本地载波(相干解调)相位偏移所带来的不利影响,而且可以抑制多径信道噪声干扰和接收信道增益、相位随机漂移对测量精度的影响,从而提高了超声波测距系统的信噪比和分辨率。此外,采用伪随机码扩频解扩方法,容易实现码分多址(只要给安装在大范围测量区域中多个传感器分配相应的伪随机码,就可以方便地辨认出各个区域传感器发出的信号),扩大超声波测距系统的测量范围。     

刚性夹杂双周期分布的反平面问题

在遵循复合材料中各夹杂相互影响的条件下,构造呈双周期分布且相互影响的椭圆形刚性夹杂模型的复应力函数,采用复变函数的依次保角映射方法,达到满足各个夹杂的边界条件,利用围线积分将求解方程组化为线性代数方程组,推导出了椭圆形刚性夹杂呈双周期分布的界面应力解析表达式,并讨论了夹杂间距对界面应力最大值（应力集中系数）的影响规律,描绘出了曲线。     

MPP Fortran 程序中串行循环的优化

在大规模并行处理系统中,通讯开销是影响程序性能的一个重要因素。本文提出了一种ＭＰＰＦｏｒｔｒａｎ程序中串行循环的优化技术：在串行循环中加入同步控制、将串行循环转换成共享循环。该技术能减少通讯开销、提高程序的性能。     

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     

软件随机黑盒测试的快速覆盖技术

本文提出了求多个测试序列极大距离的算法,该算法对数字电路的测试和软件测试技术是通用的。理论上看,该方法可以弥补随机测试和伪随机测试的缺陷。     

拦截弹测量数据处理的建模与仿真

针对拦截弹上实时测得的带有随机干扰的测量值,讨论了测量数据的建模与处理方法,并结合数据处理过程中所涉及到的阶次的确定、样本数的选取和拐点问题提出数据处理的简化方法。最后给出了一个仿真算例     

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