一种新的高分辨率SAR图像目标自动鉴别方法

目标鉴别是SAR图像目标识别系统的关键环节,用以消除预筛选阶段因异常检测产生的大量虚假的感兴趣区域切片。针对目标鉴别问题,提出了一种新的目标自动鉴别方法,首先对CFAR检测的结果做基于面积特征的预鉴别处理,而后对获得的ROI目标切片提取鉴别特征,并在特征分析的基础上设定特征判决阈值,实现序贯鉴别处理。利用X波段SAR图像数据检验了上述方法,给出了鉴别输出的ROI切片。     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

假设检验在军事工程应用中的若干问题

对假设检验这一统计学工具在军事工程应用中值得注意的若干问题进行了探讨,包括假设的设置、检验门限的设置和统计量的构造等,这些问题在理论上有一些一般的指导,但在实际工程应用中,需要根据具体问题进行设计,这中间涉及一些技巧和经验,也容易出现一些常被忽视的问题。指出了这些问题,并给出了在实际工程中应用好假设检验的一些建议。     

一种新的卫星导航星间链路测距体制及其定轨性能分析

现有的GPS星间链路轮询时分测距体制未针对定轨性能进行优化。对轮询时分测距体制进行改进,提出了一种新的分组时分测距体制,通过对整星座所有卫星进行分组测距来提高星间测距链路数量,从而提高星地星间联合定轨精度。以整星座平均定轨精度最优为目标,提出了两步优化算法,得到星间总测距链路数最多的卫星分组,使每组内卫星的星间测距DOP值最小。仿真结果表明,采用优化算法得到的最优分组时分测距方式对卫星定轨精度有明显改善。     

应用径向基代理模型实现序列自适应再采样优化策略

针对径向基插值代理模型样本点预测误差为零时无法获得误差函数进行序列再采样优化的问题,将样本点分布约束引入序列再采样过程,利用潜在最优解加速收敛性,提出一种适用于径向基插值代理模型序列优化的再采样策略,该策略兼顾仿真模型的输出响应特性与样本点的空间分布特性。仿真结果表明,使用该再采样策略后,算法寻优效率和精度均优于传统基于代理模型的优化方法,在对最优解进行有效预测的同时,能显著减少原始模型计算次数。     

资源约束条件下的空中兵力编组＊

通过对空中兵力的合理编组,实现作战资源的优化配置是提升兵力作战效能的有效途径。针对现代空战编队对抗过程的特点,从战术企图和信息优势角度提出了编队目标威胁评估方法。以编队目标为研究对象从宏观上调配己方作战资源,提出了作战资源成本和兵力调度成本2种兵力编组成本,在此基础上建立了资源约束条件下的兵力编组优化模型,并采用改进PSO算法对模型进行求解。作战想定仿真结果表明兵力编组模型能够有效解决空战兵力分配问题。     

异步雷达组网协同跟踪动态传感器分配算法

针对异步雷达组网下的协同跟踪问题提出了一种基于异步顺序融合的动态传感器分配算法。该算法对异步雷达的量测值按采样时刻顺序滤波,根据滤波协方差和目标期望协方差的接近程度动态选择下一时刻跟踪的最优传感器集合。仿真分析表明该算法和基于伪量测的异步雷达组网协同跟踪传感器分配算法相比具有较少的计算量和较高的目标跟踪精度。     

作战系统的序参量及其演化方程

"新三论"(包括耗散结构论、协同学和突变论)作为一种新的世界观,给研究作战系统这个复杂的非线性系统提供了新的视角。运用"新三论"的思想和方法指出作战系统的序参量,建立序参量方程,分析序参量演化稳定性与途径,得出一些有价值的结论,对于探索作战系统发展演变的规律具有重要意义。     

Efficient sequential decision‐making algorithms for container inspection operations

Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Allocating capacity in parallel queues to improve their resilience to deliberate attack

We develop models that lend insight into how to design systems that enjoy economies of scale in their operating costs, when those systems will subsequently face disruptions from accidents, acts of nature, or an intentional attack from a well‐informed attacker. The systems are modeled as parallel M/M/1 queues, and the key question is how to allocate service capacity among the queues to make the system resilient to worst‐case disruptions. We formulate this problem as a three‐level sequential game of perfect information between a defender and a hypothetical attacker. The optimal allocation of service capacity to queues depends on the type of attack one is facing. We distinguish between deterministic incremental attacks, where some, but not all, of the capacity of each attacked queue is knocked out, and zero‐one random‐outcome (ZORO) attacks, where the outcome is random and either all capacity at an attacked queue is knocked out or none is. There are differences in the way one should design systems in the face of incremental or ZORO attacks. For incremental attacks it is best to concentrate capacity. For ZORO attacks the optimal allocation is more complex, typically, but not always, involving spreading the service capacity out somewhat among the servers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011