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.     

守望生命中的第二故乡——探析沈苇诗歌的新疆主题

生于江南水乡的诗人沈苇，大学毕业后来到新疆。身为异乡人的他，对脚下这片独具异域特点的土地饱含着一份炙热的爱。到如今，新疆已成为他生命中的第二故乡。新疆主题，一直以来是沈苇诗歌创作的根源和内在的精神原动力，他执着在异域他乡的诗人之路上，努力在第二故乡里寻求灵魂的栖息地，从而完成对个体生命强度、韧性以及承载力的检验。     

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

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

一类反向混合单调算子方程组解的存在惟一性

运用锥与半序理论和非对称迭代方法,讨论半序Banach空间一类反向混合单调算子方程组解的存在惟一性,并给出了迭代序列收敛于解的误差估计,同时推广讨论了非反向混合单调算子方程组解的存在惟一性.所得结果改进和推广了混合单调算子方程某些已知的结果.     

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

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

Turbo C与Microsoft FORTRAN混合编程的实现

本文通过研究Borland公司的Turbo C与Microsoft公司的FORTRAN混合编程时出现的问题,提出了修改初始化模块及函数库的原理与方法,并利用TLINK的动态连接功能,实现了这两种语言在源程序级的混合编程,最后说明了实现过程与注意事项。     

变量有界线性目标规划的对偶算法

本文讨论了变量有界的线性目标规划问题,给出了求解这类问题的一个对偶算法,此方法与变量有界线性规划问题的对偶算法相类似。文中证明了算法的有效性,并举例说明了计算过程。     

并行程序设计语言在串行机上的编译实现

目前,诸如Fortran 8x 程序设计语言中已经引入了并行运算成份。这给普通串行(标量)机上实现编译器带来了困难。本文提出了数组(矩阵)运算串行化的概念,并给出了串行化的判别准则及算法。     

单片微型计算机的最新开发技术

本文以 MCS-51系列单片微型机为例,讨论了当前单片机最新编程技术 MBASIC 语言编程和在 IBM-PC 机及兼容机中直接进行模拟/调试,文中给出相应的例子。