相依网络研究综述

网络相依性和相依网络研究已经成为近年来复杂网络领域的热点,但是目前对相关研究进展进行综合归纳的文献却不多见。在对国内外相关文献进行系统分析的基础上,简要介绍相依网络研究涉及的渗流理论;描述该类型网络的级联失效过程;从相依网络的子网络特性、相依边的方向和类型、子网络组合方式等三个角度对相依网络鲁棒性的研究成果进行总结;并从理论和应用两方面对未来相依网络研究的发展方向进行展望。     

论岛屿应急救援体系的构建

为全面提高海南省岛屿应急救援能力,有效防范和应对灾害事故和突发事件,保护人民生命财产安全,提出建立岛屿应急救援体系的思路,构建岛屿应急救援专业队伍和多种形式消防队伍有效联动的综合性应急救援力量体系。     

一种灵巧的多假目标干扰技术研究

相干假目标的产生是欺骗干扰的关键技术,针对现代雷达技术对干扰技术提出的更高要求,首先介绍了间歇转发干扰技术,然后从信号频谱分析入手,提出了利用频谱调制的办法产生大量相干假目标,并给出了结构框图及干扰信号形式.在此基础上,把间歇采样与频谱调制组合使用产生了一种新的干扰技术.通过仿真试验,并与间歇采样转发干扰技术比较,验证了新技术的可行性和优越性.     

雷达组网效能量化评估模型

针对雷达组网效能评估过程中决策者的主观判断可能存在一定误差的情况,将层次分析法应用于组网雷达效能评估中。首先建立了组网雷达效能评估结构模型。其次结合案例构造了雷达组网效能评估判断矩阵,进行层次单排序以及层次总排序和一致性检验。最后,利用灰度层次分析法对模型的合理性进行了验证。结果表明,该模型的建立在一定程度上为雷达组网的合理分配使用提供决策依据。     

Nonperiodic preventive maintenance for repairable systems

As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

坦克炮控系统非线性特性及自适应补偿控制

影响坦克炮控系统低速性能主要有两个方面的因素,摩擦非线性和齿隙非线性。建立了坦克炮控系统数学模型,介绍了坦克炮控系统中摩擦、齿隙两类重要非线性模型,分析了摩擦、齿隙对炮控系统性能的影响,以及摩擦非线性环节导致系统低速时的爬行现象、速度过零时的平顶现象;齿隙非线性环节造成系统输出误差外,系统会因极限环振荡或冲击而降低性能,甚至不稳定,总结了炮控系统中针对摩擦、齿隙等非线性环节的自适应补偿控制的研究成果。     

远距离干扰下的被动侦察雷达功能仿真

对雷达探测能力的仿真往往是武器系统作战效能仿真中重要的一部分,功能仿真由于其方法简单、使用方便、速度快,比较适合较大对抗系统中对雷达探测能力的仿真。将被动侦察雷达功能进行分解并进行有机地结合,介绍了主要模块的数学模型,通过仿真实验对远距离支援干扰条件下的被动侦察雷达进行功能仿真,结果表明该方法具有较好的结果和较大的灵活性。     

基于重力加速度的自对准算法在摇摆台上的验证

摇摆基座条件下陀螺和加速度计测量的地球自转角速度和重力加速度受到了摇摆运动的干扰,无法根据陀螺和加速度计的输出直接获得初始姿态矩阵。针对这一问题,通过验证实验证明了基于重力加速度的对准算法的有效性,并依据实验结果从理论上对该方法的对准误差进行了分析,提出了进一步提高对准精度的措施。