Effects of cueing in cooperative search

We consider the effects of cueing in a cooperative search mission that involves several autonomous agents. Two scenarios are discussed: one in which the search is conducted by a number of identical search‐and‐engage vehicles and one where these vehicles are assisted by a search‐only (reconnaissance) asset. The cooperation between the autonomous agents is facilitated via cueing, i.e., the information transmitted to the agents by a searcher that has just detected a target. The effect of cueing on the target detection probability is derived from first principles using a Markov chain analysis. In particular, it is demonstrated that the benefit of cueing on the system's effectiveness is bounded. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于多元高斯概率分布的无线局域网定位方法研究

针对无线局域网环境及室内目标定位需求,研究了基于接收信号强度指示的定位技术,提出了一种基于多元高斯概率分布的信号强度模式匹配方法,讨论了定位系统框架。试验结果表明,该方法具有较好的室内定位效果。     

用赋形天线提高炮瞄雷达性能

"炮瞄雷达搜索天线系统"在原某型炮瞄雷达的基础上,通过展宽其垂直方向的波束宽度,使其成为赋型天线,并加装高放,来提高炮瞄雷达的性能。介绍了它的组成和战技性能,重点阐述了该系统对部队作战效能的影响,并对其可能产生的战术运用效果进行了简要的预测。     

用局部对比度信息改善图像质量

在图像的摄取和传输中,图像经常降质。为了改善图像质量,将信息熵的概念与图像的局部对比度信息相结合,提出了一种基于熵概念的非线性噪声的滤除方法,并进一步利用局部统计信息对图像进行增强。分别对模拟图像以及红外图像进行了试验,并与中值滤波、Lee滤波、Frost滤波等经典噪声滤波方法进行比较,实验结果验证了该方法的有效性。     

目标搜索的预测分析及搜索计划的优化逼近

给出了目标搜索的预测分析公式,提出了最优搜索计划的一种优化逼近方法及有关实例     

基于广域网的建筑工程管理系统设计

针对韩村河建筑集团工程与办公的特点,设计出基于公共数据交换网环境的工程管理系统。它以建筑工程管理为主,包含办公管理、合同管理、财务管理、材料管理、进度控制和数据接口等功能。系统采用模块化设计并具备多层安全控制机制。     

一种无约束最优化方法——恰当共轭方向法

本文提出了一种求解无约束最优化问题的方法,称之为“恰当共轭方向法”。与通常的共轭方向法(如共轭梯度法)相比,这种方法可以节省大量的一维搜索工作量,并且还能提高收敛速率。     

令牌式计算机局部网的仿真研究

本文介绍了令牌式计算机局部网仿真模型的建立和某些初步的仿真结果,同时对令牌的顺序传递两种方案进行了比较。     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017     

To catch an intruder: Part A—uncluttered scenario

We analyze an interdiction scenario where an interceptor attempts to catch an intruder as the intruder moves through the area of interest. A motivating example is the detection and interdiction of drug smuggling vessels in the Eastern Pacific and Caribbean. We study two models in this article. The first considers a nonstrategic target that moves through the area without taking evasive action to avoid the interdictor. We determine the optimal location the interceptor should position itself to best respond when a target arrives. The second model analyzes the strategic interaction between the interceptor and intruder using a Blotto approach. The intruder chooses a route to travel on and the interceptor chooses a route to patrol. We model the interaction as a two‐player game with a bilinear payoff function. We compute the optimal strategy for both players and examine several extensions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 29–40, 2017