一种基于帧间相关的红外弱小目标运动轨迹检测方法

针对传统帧间相关法对部分虚警轨迹难以排除的问题,研究了一种简单的帧间相关去噪算法,并提出在此基础上再次运用数学形态学方法来进一步排除虚假轨迹。算法采用形态学top-hat变换和二值化方法预处理原始图像,然后根据目标帧间相关而噪声点不相关的特点去噪,之后相加得到初步运动轨迹图像;最后采用形态学开运算,排除虚假轨迹,得到最终的检测结果。结果中检测出的目标轨迹清晰,虚警少。实验表明,该方法能有效地检测出弱小目标的运动轨迹。     

Gold序列跳变扩频在毫米波敌我识别系统中的应用

在毫米波敌我识别系统中,识别信息在低频部分经过数字信号处理后,进行扩频调制后由微波收发信机进行传输。介绍了毫米波敌我识别系统中采用扩频调制设计原则和跳变Gold码扩频序列的设计方法,分析了扩频抗截收/截获的能力,并给出了一种用STEL2000-A芯片产生Gold序列进行跳变扩频调制的具体实现实例。     

广义Fibonacci数列的通项及性质

著名的Fibonacci数列有许多通项表达式和性质。利用数学归纳法和特征方程求根的方法对广义Fibonacci数列Rn 1=uRn vRn-1,R0=a,R1=b进行研究,得到了两个通项表达式和一个性质.     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.     

多维AR(p)模型在预报舰船运动中的应用

在舰空导弹武器系统的实战中,能够实时预报舰船的运动状态非常必要。给出了利用多维AR(p)模型对舰船运动参数进行预报及修正的方法。     

Solving partially observable agent‐intruder games with an application to border security problems

In this paper, we introduce partially observable agent‐intruder games (POAIGs). These games model dynamic search games on graphs between security forces (an agent) and an intruder given possible (border) entry points and high value assets that require protection. The agent faces situations with dynamically changing, partially observable information about the state of the intruder and vice versa. The agent may place sensors at selected locations, while the intruder may recruit partners to observe the agent's movement. We formulate the problem as a two‐person zero‐sum game, and develop efficient algorithms to compute each player's optimal strategy. The solution to the game will help the agent choose sensor locations and design patrol routes that can handle imperfect information. First, we prove the existence of ?‐optimal strategies for POAIGs with an infinite time horizon. Second, we introduce a Bayesian approximation algorithm to identify these ?‐optimal strategies using belief functions that incorporate the imperfect information that becomes available during the game. For the solutions of large POAIGs with a finite time horizon, we use a solution method common to extensive form games, namely, the sequence form representation. To illustrate the POAIGs, we present several examples and numerical results.     

雷达故障"板级定位"诊断系统的设计

为故障精确定位而设计的雷达故障诊断系统,利用VXI测试仪器为硬件平台,设计了基于征兆(测点)的集成推理软件平台.对征兆的测试数据(含结果)进行采集,基于序贯分类方法的数据结果,再进行故障的合理识别、推理和判断,推断出正确的结果,将故障定位在板级(即最小可更换单元).     

基于球面映射和拆卸树的拆卸序列生成算法

拆卸序列生成是虚拟维修的核心之一,直接关系到虚拟维修的可行性及成本。搜索所有可行拆卸序列、避免组合爆炸并保持算法的通用性是序列生成算法的研究难点。通过引入球面映射概念,定义了局部和全局阻碍方向及可拆卸方向,克服了传统方法中基于六坐标轴方向创建干涉矩阵的局限性。提出了一种符合拆卸规则和拆卸关系表的拆卸树生成算法,求得所有可行的拆卸序列,并通过实例在虚拟维修平台上得到了实现。     

利用对象Petri网验证场景

序列图表示的场景常被用于系统开发早期的需求获取与描述,但因其弱语义性而难以被验证.将序列图表示的场景转换为语义精细的对象Petri网模型OPDL,并通过其仿真环境OPMSE对其进行仿真,将场景描述的系统行为"展示"给需求开发者和用户,以此进行行为需求的验证.     

排序法在某类弹药寿命分析中的应用研究

将排序法应用于无失效弹药贮存寿命试验数据的统计分析 ,介绍了排序法的基本思想 ,并计算了某类弹药的平均贮存寿命置信下界。