机载红外搜索跟踪系统

红外搜索和跟踪（ＩＲＳＴ） 系统是迅速探测红外威胁源的存在, 识别威胁源的种类,测定威胁源的方位并报警的一种光电系统。介绍了对机载ＩＲＳＴ的性能要求, 美国和欧洲等国对机载ＩＲＳＴ的研制及装备概况, 分析了今后机载ＩＲＳＴ系统的发展方向。     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

雷达实际平面探测威力模型与仿真算法研究

在考虑地物遮蔽的情况下,建立了3种程式雷达实际平面探测威力的数学模型,并对参数获取、盲区估算等问题进行了讨论。给出了一种基于DEM数据的雷达实际平面探测威力实用算法,实现了雷达在任意高度层的实际平面探测威力的自动仿真生成。应用表明,雷达实际平面探测威力图绘制的精度和效率较传统方法有较大提高。     

石河子农耕区不同林地地被昆虫群落结构研究

用"五点式"取样法对石河子农耕区不同林地地被中的昆虫群落结构多样性进行了调查,共采集到昆虫31种,分属8目14科,共计1099头。结果表明:杨树老林地被昆虫群落的丰富度最高(为23),幼榆林次之(为14),苗圃和葡萄的最低(均为7)。多样性指数幼杂林最高(为1.8613),苗圃次之(为1.6833),幼榆林最低,为0.8534。     

任务分配问题的对称群方法

探讨了无人飞行器(UAV)编队的任务分配问题。任务分配是UAV协同控制的基础,其解是任务区域内各任务的一个排列。求解UAV任务分配问题的有效方法是能在合理的计算时间内找到近似最优解的启发式算法。用对称群描述UAV任务分配的搜索空间,基于右乘运算构造搜索邻域。仿真结果验证了群论禁忌搜索算法的有效性。     

(修，2撤3)关键几何参数对超声速膨胀器流场和性能影响的数值研究

为了揭示关键几何参数对超声速膨胀器流动特性影响的规律,对3种隔板安装角和5种出进口面积比超声速膨胀器设计工况下的流场进行了数值研究。结果表明：随隔板安装角增加,斜激波向出口迁移,斜激波强度略有降低,超声速膨胀器膨胀比减小,效率提高;随出进口面积比增加,流道内高速区显著扩大并逐渐靠近压力面,斜激波增强,出口流动损失增加,超声速膨胀器膨胀比增大,效率降低。为获得综合性能较优超声速膨胀器结构,需在较小出进口面积比和较大隔板安装角之间做折衷选择。     

预冷却引射系统性能一维分析

根据引射器的一维设计理论可知,二次流在进入混合室之前进行预冷降温可以提高引射效率,增大引射系数,但引入预冷器会同时引起流动损失,故需要对引射系统进行性能评估。针对设有预冷器的引射系统,应用一维理论分析预冷对系统性能的影响,重点分析预冷增强效果与流阻减弱效果对引射效率的作用。研究发现:预冷器对引射系统同时带来冷却增强作用和流阻减弱作用,横截面积和换热面积是主要影响因素。预冷器存在临界横截面积,横截面积大于临界值时,换热面积越大,引射性能越高;反之,换热面积越大,引射性能越低。等压混合引射方案比等截面混合引射方案性能高,前者引射系数比后者大60%;预冷却能够有效提高引射性能,尤其是等截面混合引射方案,性能提高可达35.5%。