On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.     

基于数据压缩的LSP参数高效量化算法

文中为解决超长帧编码系统中联合帧数过多导致LSP参数量化性能下降这个问题,将多项式拟合引入超长帧编码系统中,利用多项式拟合压缩LSP参数矩阵,以降低量化时实际联合的帧数。再用分裂矩阵量化器进行量化。仿真结果表明,在120 bps的参数量化速率下,此算法的量化性能优于矩阵量化算法(MQ),平均谱失真比MQ算法降低了0.0719 dB,平均分段信噪比提高了0.1971 dB。     

消防法实施细则制定的必要性

《消防法》是消防工作的基本法律，完善的消防法律体系应当由消防法律、消防行政法规、地方消防法规、部门消防规章和地方消防规章组成。而目前我国的消防法律体系中却没有专门的消防行政法规。因此，制定《消防法实施细则》是完善消防立法体系、细化《消防法》、落实政府消防法律职责、拓展消防部队职能和借鉴其他法律的需要。     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

论公安现役本科院校基础课程设置

公安现役本科院校的基础课程,是根据边、消、警部队人才基本素质全面发展的培养目标要求而设定的。它既要满足国民高等学历教育的需要,又要适应部队人才需要和发展的要求,有其明显的职业指向性。因此,公安现役本科院校的基础课设置必须把公安现役高等教育的职业化特色与普通高等教育规范化要求有机结合,形成具有公安现役教育特色的基础课程体系。     

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     

Simple paths with exact and forbidden lengths

We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.     

强爆轰驱动超高速碎片发射装置设计因素分析

为了得到发射装置设计因素和超高速碎片性能间的关系,考虑了药型罩的材料、炸药种类、装药长径比、药型罩的锥角、药型罩的厚度、药型罩顶部靠近装药侧的曲率半径等设计因素,采用AUTODYNTM,结合正交试验,对超高速碎片的发射过程进行数值模拟。结果表明,3种发射装置结构分别可以提供质量为1. 533 g的紫铜碎片、速度为11. 649 km/s的铝碎片、动能为85. 6 k J的铝碎片; 2种发射装置结构均可以提供质量大于1 g、速度高于11 km/s的密实结构圆柱状碎片。验证了仿真方法的可信性,对影响碎片性能的设计因素进行了分析、排序,并得到了这些设计因素与碎片质量、速度、动能的关系。     

数据链系统效能评估框架研究

研究了数据链系统效能评估相关概念及其对作战的影响机制,给出了数据链系统效能评价指标体系以及不同层次指标的计算、聚合方法。在此基础上形成数据链系统的效能评估框架,通过该框架可以指导数据链系统的效能评估,为数据链装备的发展及应用提供科学依据。     

基于无线双工通信系统分组数据传输的探讨

分析了军用无线双工通信系统数据传输资源,指出了存在的问题及改进办法;利用话音、报文、传真、数据电路交换信令的工作模式标示,提出了基于无线双工通信系统的数据传输TCP/IP结构体系及协议栈,并探讨了网络适配和实现与军用公共数据网、地域通信网（电路交换网、分组交换网）、数字化部队单工无线电数据网互联的关键技术。