改进IAHP-CIM模型的雷达组网探测能力评估方法

针对雷达组网探测能力的评估问题,采用鱼骨图法对影响雷达组网探测能力的多种因素进行梳理,得到结构层次清晰的指标评价体系。采用改进的区间层次分析—控制区间和记忆模型对该指标体系进行评估,具体方法是:运用区间层次分析法构造区间判断矩阵;利用蛙跳算法求解区间判断矩阵中满足最小一致性的确定性矩阵;利用控制区间和记忆模型来确定各指标的风险概率,实现指标体系的评估。以具体的案例为对象进行仿真实验,结果表明,所提评估方法有效,评估结论相对客观、可信,对雷达组网探测能力评估具有一定参考价值,从而为雷达组网的优化部署奠定良好基础。     

反潜机采用阿基米德螺旋线搜潜问题研究

反潜机是重要的反潜力量,根据反潜机搜潜情况,建立了反潜飞机采用阿基米德螺旋线样式搜潜的数学模型和目标运动模型,讨论了螺旋线采用的三种轨迹间隔,通过仿真验证,确立了反潜机搜潜最优轨迹间隔,以达到提高发现目标潜艇概率、优化反潜效能的目的,为反潜飞机采用阿基米德巡逻线搜潜样式搜潜时提供战术参考。     

远程火炮密集度试验多组数据的处理方法

远程火炮密集度试验需要进行多次射击,同一试验条件下的多组数据通常认为来源于同一分布,但却未见于证明。利用统计检验方法,给出了对试验数据方差齐性及均值相等性的检验方法,并在多组试验数据一致性的基础上给出了试验数据均值、方差的无偏估计,同时在既定置信度下给出了其置信区间,为远程火炮精度检测提供了工具。     

New results on rendezvous search on the interval

In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013     

Inequality‐based reliability estimates for complex systems

Full‐system testing for large‐scale systems is often infeasible or very costly. Thus, when estimating system reliability, it is desirable to use a method that uses subsystem tests, which are often less expensive and more feasible. This article presents a method for bounding full‐system reliabilities based on subsystem tests and, if available, full‐system tests. The method does not require that subsystems be independent. It accounts for dependencies through the use of certain probability inequalities. The inequalities provide the basis for valid reliability calculations while not requiring independent subsystems or full‐system tests. The inequalities allow for test information on pairwise subsystem failure modes to be incorporated, thereby improving the bound on system reliability. We illustrate some of the properties of the estimates via an example application. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

战时装备保障阵地选址不确定决策方法

针对战时选址属性信息为区间数的情形,提出了一种基于模糊偏序关系的装备保障阵地选址决策方法.首先,建立战时装备保障点选址的评估值模型,并对其进行预处理;然后建立了模糊偏序关系模型,将混合型评估值模型转化为评估关系模型,得到各备选点之间的偏序关系;最后,对偏序关系进行集结,得到全序关系,从而获取方案的优劣排序.这为战时装备保障阵地选址提供了一种新的有效途径.     

舰艇辐射噪声仿真信号应用风险评估模型

为了克服传统风险评估中定性分析方法客观性较差等缺点,定义了与仿真信号特征参数一致性相关联的后果系数,对仿真信号风险事件所导致的后果进行了定量分析,并在此基础上提出了基于一致性分析的仿真信号应用风险评估模型,最后给出了该模型应用于舰艇辐射噪声仿真的评估实例。评估实例表明,该模型不仅有助于充分挖掘信号仿真中阶段性数据的有用信息,同时也能为仿真信号的风险评估提供实用工具。     

炮瞄雷达试验数据处理中有关问题的探讨

结合炮瞄雷达国家军用标准和靶场炮瞄雷达试验,对炮瞄雷达精度试验数据处理中的误差分组统计方法、样本大小选取和异常数据点处理等问题进行了探讨,并且提出了相应的处理方法     

基于改进CS的随机PRI雷达精确测速及杂波抑制算法

传统的脉冲多普勒雷达存在严重的测距测速模糊和盲区效应。考虑在正常脉冲重复间隔(PRI)上叠加一个随机扰动,并把PRI的随机变化巧妙转化为稀疏观测矩阵的受限等距性质,提出的基于压缩感知的随机脉冲重复间隔雷达为全相参动目标检测提供了一种新思路。针对其在实际应用中存在的粗糙损失和杂波干扰两个问题,分别提出了基于局部词典细化的精确测速算法和基于改进优化模型的杂波抑制方法。仿真实验结果表明该方案具有较高的测速精度和较强的杂波抑制性能。     

Interval scheduling: A survey

In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007