逆重复 m 序列输入下 FIR 模型辨识及精度分析

针对离散控制系统的有限脉冲响应 (FIR)函数模型 ,研究了在伪随机逆重复m序列输入激励下的相关辨识及其精度问题 ,得到了有色噪声干扰下FIR参数估计精度的显式表达式。文中有仿真实例。     

一类无穷次多项式系统极限环研究

利用平面自治系统的极限环理论和分支理论研究了一类无穷次多项式系统,并讨论了该系统极限环的存在性和唯一性。应用所得结论,推广并改进了前人的结果。     

一种基于UML/OCL的软件测试方法

根据UML/OCL和建模环境提供的软件模型信息,以一个武器装备管理信息系统的装备入库顺序图为例,在分析UML/OCL顺序图的语法和对象间的交互信息的基础上产生测试场景,提供了一种基于UML/OCL的面向对象的软件测试方法,并提出测试自动化的设想,对软件测试有一定的借鉴作用。     

JTIDS消息字还原模块的FPGA设计

根据公开的关于Link16数据链的信息标准并结合我军对战术数据链的具体要求,设计了一种JTIDS终端消息字还原模块,该模块包含CCSK码字解密,CCSK译码,解交织,RS译码等一系列基带数据处理过程。首先介绍了Link16数据链消息字还原模块的原理,对其各个子处理模块进行了设计并提出了硬件实现方案,然后在Quartus II环境下选择Cyclone II系列的EP2C8Q208C8 FPGA芯片进行了JTIDS消息字还原模块的系统级综合与仿真,并在该芯片的开发板上进行了验证,硬件成品可用于JTIDS终端功能测试与评估等多种场合。     

组网电子对抗中应对远程威胁的对抗优选决策

在组网电子对抗作战背景下,简单分析作战中远程威胁目标,讨论了威胁决策因子及其优属度获取办法,在此基础上,提出了经过对抗方案总体设计、最优方案选择的决策方法,建立了应对远程威胁目标的决策模型。最后,通过合理假定作战场景进行实例分析,验证了该方法是科学合理的。     

基于最优打击序列的弹道导弹火力分配模型研究

针对弹道导弹火力计划的拟制过程进行研究。围绕效费比最大化目标,对目标打击序列的影响因素进行了分析,设计了打击目标排序算法;采用层次分析法对弹道导弹打击能力进行了分析,并对打击目标所使用的作战单位排序值进行了计算,建立了最优火力分配模型。该模型不仅可最大发挥作战单位的作战能力,而且满足以最小代价获取最佳打击效果。     

动态系统可靠性分析的新概念

传统可靠性分析的概念只能描述静态逻辑关系,不能满足现代复杂动态系统可靠性分析的需要。在给出动态系统状态空间结构和结构函数的基础上,提出失效序列和失效丛的概念描述动态系统的故障模式,这一概念扩展了传统可靠性分析的概念,将割集、蕴含集等作为其在静态情形的特例。给出动态系统部件的概率重要度、结构重要度以及关键重要度的概念,用实例对提出的有关概念进行了说明。     

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.     

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

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

Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue

We use the matrix‐geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady‐state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981), 945–958] can be extended to an upper triangular block structure. Moreover, the subblock matrices of matrix R also have such a structure. With this special structure, we develop a procedure to compute the matrix R. After obtaining the stationary distribution of the system, we study two primary performance indices, namely, the distributions of the number of jobs of each type in the system and their waiting times. Although most of our analysis is carried out for the case of K = 3, the developed approach is general enough to study the other cases (K ≥ 4). © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 662–682, 2003.