机动式保障基地系统防护需求分析

当前,军队工程防护对象以地下工程和野战阵地为主,对于设施设备及军事活动以地表为主的机动式保障基地系统,其毁伤特点规律、防护威胁、评估方法及防护标准等尚无专门研究。本文介绍了机动式保障基地系统的基本概念、主要功能及构成要素,研究了近年来典型军事基地遇袭案例,采用案例分析与数据库研究相结合的方法,分析了机动式保障基地系统的主要威胁及其毁伤元和毁伤评估量,并提出机动式保障基地系统防护需求的构建原则和评估步骤。根据建立的原则和步骤,建立5级防护需求等级,以海外维和基地为例,分析了基地内各类保障装备的防护等级需求和防护等级设置的主要依据,为开展机动式保障基地系统防护体系研究打下基础。     

基于分治采样粒子滤波的三维跟踪算法

粒子滤波在处理三维机动目标跟踪问题时,粒子点难以均匀覆盖目标状态空间,较低的样本多样性和算法冗余直接影响跟踪性能。针对该问题提出一种基于分治采样粒子滤波的跟踪算法,算法通过划分独立的状态子空间,使随机样本在各子空间内单独抽样,对目标机动实现降维处理,提高跟踪性能。仿真实验表明,相对于标准粒子滤波,该算法有效提高了样本多样性,具有更好的跟踪性能,对复杂机动状况适应性更强。     

基于HHT的助飞反潜鱼雷入水信号检测方法

针对助飞反潜鱼雷入水信号在浅海条件下信噪比低、干扰成分多导致难以检测的问题,采用HHT处理方法,通过CEEMD分解方法提高原始信号的信噪比;通过希尔伯特变换突出入水信号的时域特征,降低了入水信号检测的难度。所提方法应用于实航试验数据,显著提高了信号检测的可靠性。     

军事信息主动推荐系统框架研究

现代网络环境下,如何从海量信息中提取有效信息进行利用在现代战争中尤为重要,我军十分重视军事信息服务能力。在信息主动推荐的基础上提出了军事信息主动推荐的概念。阐述了信息主动推荐的军事需求,介绍了军事信息主动推荐的基本内涵以及所具有的优势。在此基础上,构建了军事信息主动推荐系统并介绍了其基本原理。最后,论述了军事信息推荐系统的应用。     

多码组合扩频通信中软解调解扩算法研究

多码组合扩频通过采用多条PN序列叠加传输的方式,在相同带宽条件下相比多进制扩频可有效提高信息承载能力,然而,多条PN序列并行叠加会造成检测性能下降。从解调解扩联合处理角度,提出基于最大似然解调检测的联合解调解扩的软判决算法,该算法通过对接收组合序列进行最大似然网络图相关值路径搜索,完成解调解扩联合处理。从而既克服了硬判决解调导致的信道信息损失,又节省了常规软判决算法中相关器的数量需求。仿真结果表明:所提算法在相同误码率情况下相比硬判决算法提升约6 dB。     

面向RISC-V内核的标记指令复算与纠错机制的设计

由宇宙辐射等环境因素引起的硬件瞬时故障会极大降低计算机系统的可靠性。为了减小硬件瞬时故障对系统可靠性的影响,保证程序的正确运行,基于RISC-V开源内核“蜂鸟e203”提出一种标记指令复算与纠错机制。该机制为指令码额外增加了复算标记,以较小的硬件开销实现对指定指令的复算操作。此外,该机制可以在第一次复算结果与初始运算结果不等时自动进行二次复算,并由三次运算结果的多数表决结果来纠正大部分硬件瞬时故障所引起的数据流异常。实验表明,通过与中断处理程序相结合,在随机注入瞬时故障的情况下,程序的正确执行概率平均增加了86.67%。     

Dynamic routing of prioritized warranty repairs

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

纯方位跟踪问题研究及算法性能

针对纯方位跟踪系统的特点,对修正增益扩展卡尔曼滤波、伪线性滤波、基于无迹变换的卡尔曼滤波、修正球坐标系下的扩展卡尔曼滤波、直接对角度信息建模的卡尔曼滤波等被动目标跟踪算法予以详细的讨论,并在满足可比性的条件下,对各个跟踪算法进行了仿真实验,比较和分析了仿真结果,指出了修正增益扩展卡尔曼滤波的算法优势,对实际工程应用中算法选择问题提出了参考性建议.     

激光陀螺漂移测试数据的处理与分析

根据获得的激光陀螺漂移测试数据,利用时间序列分析的方法对漂移数据进行了建模,得到了漂移数据的时间序列模型;在此基础上用Kalman滤波的方法对数据进行了处理;从时域和频域两方面对滤波结果进行了分析.结果表明,采用的建模和滤波方法能有效提高陀螺的精度.     

Relaxation method for the solution of the minimax location-allocation problem in euclidean space

A method previously devised for the solution of the p-center problem on a network has now been extended to solve the analogous minimax location-allocation problem in continuous space. The essence of the method is that we choose a subset of the n points to be served and consider the circles based on one, two, or three points. Using a set-covering algorithm we find a set of p such circles which cover the points in the relaxed problem (the one with m < n points). If this is possible, we check whether the n original points are covered by the solution; if so, we have a feasible solution to the problem. We now delete the largest circle with radius r_p (which is currently an upper limit to the optimal solution) and try to find a better feasible solution. If we have a feasible solution to the relaxed problem which is not feasible to the original, we augment the relaxed problem by adding a point, preferably the one which is farthest from its nearest center. If we have a feasible solution to the original problem and we delete the largest circle and find that the relaxed problem cannot be covered by p circles, we conclude that the latest feasible solution to the original problem is optimal. An example of the solution of a problem with ten demand points and two and three service points is given in some detail. Computational data for problems of 30 demand points and 1–30 service points, and 100, 200, and 300 demand points and 1–3 service points are reported.