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     

模糊时滞系统控制器依赖于状态时滞的H∞控制

针对一类非线性时滞系统，研究了该系统基于T—S模糊模型的H∞控制器设计问题。采用线性矩阵不等式LMI的方法，设计一个依赖于状态时滞的模糊控制器，得到了系统存在模糊控制器的充分条件，此充分条件等价于一类线性矩阵不等式的可解性，最后通过仿真说明了控制器的有效性。     

班主任应具备的基本素质和工作方法

班主任工作的好坏,直接影响着学校整体学生管理工作。提高班主任素质,不断探索班主任工作的新途径、新方法,才能实现班主任工作的新突破,开创班主任工作的新局面。     

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.     

对称矩阵性态数的并行计算

本文针对对称矩阵A建立起性态数的并行计算公式,并通过数值试验得到了矩阵性态数变化对方程组Ax=b的解的误差影响,同时进行了向量和标量计算,计算结果表明:当x大于等于300时,向量计算速度比标量计算速度快17倍。     

提高聚氨酯推进剂基体粘结强度的途径探索

聚氨酯的水解稳定性较差,粘结强度偏低。将端羟基聚丁二烯与聚氨酯进行共混改性,提高了聚氨酯基体的表观交联度及推进剂的拉伸强度。采用示差扫描量热法和红外光谱法分析基体共混物的微观结构,表明这是提高聚氨酯基体粘结强度的一条有效途径。     

灰色矩阵对策

本文结合灰色系统与对策论的知识,给出了以区间型灰数为元素的灰矩阵对策的定义,讨论了灰矩阵对策在纯策略与混合策略意义下的最优策略及灰解的存在性。     

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

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

高阶稠密矩阵的并行求逆与应用

采用基于列交换的Ｇａｕｓｓ－Ｊｏｒｄａｎ并行算法来解决空气动力学中超音速高阶面元法的稠密矩阵求逆问题,该方法采取了块循环数据分配方式,尤其对超立方体结构的并行机系统来说具有通讯优势。在４台ＳＧＩ工作站构成的２×２网格上进行的实验表明,对秩为１０００左右的矩阵可得到５７％～６４％的效率。     

树网结构上一种新的矩阵迭代求逆并行算法

运用树网结构可以完成矩阵的并行快速求逆,其中迭代法是一种非常重要的方法。本文给出了一种新的迭代格式,对任意非奇异矩阵Ａ,运用新的迭代格式对Ａ求逆相对于经典牛顿迭代法,在同样精度要求下,时间可减少一半。