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     

进气道角度对含硼推进剂固冲发动机性能的影响

为了提高含硼推进剂固体火箭冲压发动机内硼颗粒的燃烧效率,采用颗粒轨道模型进行了补燃室两相流的数值模拟,其中硼颗粒的点火和燃烧模型采用的是King模型,建立了发动机补燃室内简单反应流模型,在该模型下研究了进气道的位置对非壅塞固体火箭冲压发动机燃烧效率的影响,并在此基础上进行直连式试验研究.结果表明,后进气道角度为60°时的燃烧效率比90°时高.     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

冲压增程弹进气道设计方法与性能分析

以冲压增程弹为应用背景进行了进气道设计.结合增程弹的特点,讨论了轴对称进气道中心锥参数、喉道参数、外罩参数的选择.特别对进气道唇口处参数、扩张段角度设计方法进行了分析.设计了单锥混压式、单锥外压式以及双锥混压式三种进气道,并进行了数值模拟.分析了进气道主要设计参数对其性能的影响.数值结果表明,就增程弹的性能要求而言,双锥混压式进气道的性能较高.     

一种高效的显式模型检验方法

随着软硬件系统规模和功能的不断扩充,状态空间爆炸问题严重影响了模型检验的进一步发展与应用,成为验证大规模系统的瓶颈.在显式模型检验工具Murphi的基础上,针对其可达状态空间组织存在的问题进行改进,提出了基于整型指针与Fibonacci散列的可达状态空间组织方法,实现了一个高效的显式模型检验原型系统,在确保验证正确的同时有效缩短了验证时间,并能在系统规范不可满足的情况下给出反例,有助于系统设计人员快速定位错误.理论分析和实验结果表明了本方法的有效性.     

结合全局与局部信息的主动轮廓分割模型

针对传统的基于区域的主动轮廓模型在分割灰度不均匀图像和噪声图像存在效果不佳的问题,提出结合全局项与局部项的主动轮廓分割模型。全局项由CV(Chan-Vese)模型的保真项构成,局部项的构建考虑局部区域信息的同时引入反映图像灰度特性的局部熵信息。依据图像灰度的特点,选择合理的全局项和局部项参数,并加入正则项保证曲线在演化过程中保持平滑,保障分割结果的可靠性。通过变分水平集方法最小化能量泛函,依据梯度下降流迭代更新水平集,完成曲线演化。采用模拟图像和实际图像进行实验分析,结果表明,所提出的结合全局项和局部项的主动轮廓模型可以高效地分割噪声严重以及灰度分布不均匀的图像。     

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.     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

超低照度下微光图像增强神经网络损失函数设计分析

超低照度下(环境照度小于2×10~(-3)lux)微光图像具有低信噪比、低对比度等特点,使目标难以辨识,严重影响观察效果。为了提高超低照度下微光图像质量,设计了一种用于微光图像增强的卷积自编码深度神经网络,并针对传统的均方误差损失函数不符合人类视觉感知特性等问题,结合现有的全参考图像质量评价指标,研究了包括感知损失在内的几种损失函数,并提出了一种新的可微分损失函数。实验结果表明,在网络结构不发生改变的情况下,所提损失函数具有更好的性能,在提高微光图像信噪比和对比度的同时,能够有效地增强图像内部细节信息。     

飞机反区速度矢量不稳定及其控制的机理

在信号流图的基础上,提出多回路分析的方法,并用于研究反区时速度矢量不稳定及其稳定控制的机理。建立了纵向动力学的信号流图,并证明了一个回路的收敛性定理。在此基础上,通过理论分析得出了速度矢量不稳定在不同层面上的原因,也得出了速度和轨迹的发散度表达式等,并表明阻力-速度曲线、轨迹角-速度曲线、极曲线、阻力系数曲线等存在相互对应的反区和正区,并且阻力-速度曲线和轨迹角-速度曲线在斜率上成比例。研究得出进场动力补偿系统下速度矢量的稳定临界条件、收敛度、稳定机理等,理论分析和仿真比较了速度恒定进场动力补偿系统和迎角恒定进场动力补偿系统在控制性能上的差异。