一种新型的OFDM智能天线

根据自适应天线阵列理论,结合给定的参考波束的误差,引入虚拟干扰的概念,对目标波束图形状进行调整,提出一种新的可以应用于任意类型天线阵列的波束综合算法.应用提出的新算法,在主瓣和旁瓣位置都可以对波束进行有效的调节.最终获得阵列的最优权矢量,能够最小化目标波束图与参考波束图间的差异.理论分析与仿真结果表明,与现有的同类算法相比,该算法能更有效地获得与参考波束基本相符的波束.应用于OFDM智能天线系统时,对不同子载波频率上信号进行单独处理,利用该算法进行波束综合,能够在整个有效频段,使所有子载波上获得基本一致的阵列输出.     

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     

国外经典核爆炸放射性沉降模式概述

介绍了国外经典的核爆炸放射性沉降模式,包含了DELFIC、WSEG系列、KDFOC系列、SEER系列、DNAF系列和EM-1。同时列举了各种模式在主要物理过程中的区别,包括了云的初始化、粒子分布、沉降机制,放射性活度和剂量率的转化、放射性衰变和传输过程。最后简述了目前核爆炸放射性沉降模式研究的发展趋势。     

Random disambiguation paths for traversing a mapped hazard field

We consider the problem of safely and swiftly navigating through a spatial arrangement of potential hazard detections in which each detection has associated with it a probability that the detection is indeed a true hazard. When in close proximity to a detection, we assume the ability—for a cost—to determine whether or not the hazard is real. Our approach to this problem involves a new object, the random disambiguation path (RDP), which is a curve‐valued random variable parametrized by a binary tree with particular properties. We prove an admissibility result showing that there is positive probability that the use of an RDP reduces the expected traversal length compared to the conventional shortest zero‐risk path, and we introduce a practically computable additive‐constant approximation to the optimal RDP. The theoretical considerations are complemented by simulation and example. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

利用迭代线性约束最小二乘方法实现不规则阵列的方向图综合

研究了用自适应波束形成技术实现不规则阵列的方向图综合问题,改进了应用于方向图综合的迭代线性约束最小二乘方法,改进后的算法提高了数值稳定性和对随机稀疏阵的适应性。对特定的阵列如果指定的理想方向图无法达到,该算法可以获得最好的逼近。仿真结果验证了算法的性能。     

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

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

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

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

前馈网络在状态识别中的应用

介绍了前馈网络的结构,BP算法以及算法的推导过程,并对算法做了一些改进.然后将该算法应用于抽油机减速箱的状态识别,给出了识别结果.实验表明,基于BP算法的前馈网络在识别的精度和自学习方面都优于传统方法.     

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

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

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