基于SLAM的图形建模仿真环境

本文详细介绍了基于ＳＬＡＭ的图形建模仿真环境的设计与应用，包括图形建模环境的实现，ＳＬＡＭ网络的进程交互仿真策略以及仿真器的设计，并进一步探讨了该系统用于协同仿真进行混合异构建模的思想。     

MPP数据并行FORTRAN汇编代码模拟环境的设计与实现

本文阐述了一种在单机上模拟ＭＰＰ机执行并行汇编代码的方法。这种并行汇编代码由ＭＰＰＦＯＲＴＲＡＮ编译器生成。由于在一个大型工程中，编译生成的目标代码运行环境不一定能及时具备，所以，研制汇编代码模拟环境ＤＰＦＡＳ有助于及早验证编译目标代码的正确性和完备性。本文通过共享进程组在ＳＧＩ工作站上实现多机环境模拟和远程地址访问模拟。此模拟环境的实现对ＭＰＰ数据并行ＦＯＲＴＲＡＮ编译器的正确性验证和效率评估有一定的帮助。     

C~3I 系统多传感器的信息融合——Fuzzy 函数聚类算法

在对多类传感器收集空中目标状态信息描述的基础上,用Ｆｕｚｚｙ目标函数聚类算法建立了对空情数据融合的数学模型。对数据融合过程,参数的初始化问题进行了实际应用的讨论;并对其应用效果和优势作了实际的分析。该方法是Ｃ３Ｉ系统数据融合技术的有效方法之一。     

故障类别的模糊聚类分析

本文通过故障状态-特征的模糊聚类分析,按故障间的相似性对故障进行分类,然后按类别实施故障诊断,可在最少监测点的条件下,获得最多的设备运行故障信息。从而简化故障诊断过程,提高诊断速度和精度。     

基于模糊综合的红外目标融合识别

为了提高在复杂背景和强干扰条件下目标识别的可靠性,提出了一种基于模糊综合的目标融合识别算法,并采用双色红外成像系统所获得的红外图像数据进行了实验仿真。实验结果表明该算法在较大程度上提高了目标识别的可信度。     

军用嵌入式操作系统安全性增强措施

操作系统是紧靠硬件的基础软件,它既是应用软件安全的坚实基础,又是硬件不安全因素的屏蔽器.在操作系统安全隐患和嵌入式操作系统技术特点的基础上,提出信息保护、空间域保护和时间域保护等增强操作系统安全性的几种方法,以提高嵌入式系统抗击系统本身缺陷或敌方恶意攻击等安全威胁的能力.上述几种安全保护技术已在嵌入式Linux中进行验证,并取得满意的结果.     

Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1

A queueing system characterized by the discrete batch Markovian arrival process (D-BMAP) and a probability of phase type distribution for the service time is one that arises frequently in the area of telecommunications. Under this arrival process and service time distribution we derive the waiting time distribution for three queue disciplines: first in first out (FIFO), last in first out (LIFO), and service in random order (SIRO). We also outline efficient algorithmic procedures for computing the waiting time distributions under each discipline. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 559–576, 1997     

舰船对空作战效能的多层次Fuzzy综合评判

介绍了影响舰船对空作战效能的各种因素,详细分析了多层次模糊(Fuzzy)综合评判的数学模型,用此数学模型对舰船对空作战效能进行了模糊综合评判,这种方法是用精确的数学来描述作战效能分析中的模糊现象和专家经验,为专家们评判舰船对空作战效能提供一种新的办法.     

Aggregating courier deliveries

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.     

动态武器目标分配问题的马尔可夫性

动态武器目标分配(weapon target assignment,WTA)问题是军事运筹学研究的重要理论问题,也是作战指挥决策中迫切需要解决的现实问题。在对动态WTA问题进行描述分析的基础上,运用随机过程理论证明了动态WTA过程的马尔可夫性;给出了该马尔可夫决策过程的状态转移概率的解析表达式,并对其状态特点进行了简要分析。研究结果可以为动态WTA及相关问题的研究提供理论和方法依据。