军事工程技术院校争取基金项目的实践与思考

本文阐述了军校开展基金项目研究的重要性,论证了军校申报科学基金项目的可行性,探讨了获取基金项目立项工作的基础和有效途径,并针对军校特点,提出了加强基金申报工作的切实可行的措施和策略。     

Quarrelsome committees in US defense acquisition: the KC-X case

When the US Air Force set out to acquire a new aerial tanker (the KC-X), two highly suitable alternatives were offered. What could have been a short and simple source selection turned into a prolonged embarrassment. The original selection of 100 leased KC-767s was made in May 2003. But the KC-46 is expected to be operational in 2017 – more than a decade later. Our primary purpose here is to narrate and explain key events in the KC-X program. We search for useful paradigms, based in part on the US Government being better viewed as a quarrelsome committee than a monopsonist. In addition, we consider what this case might tell us about the US defense acquisition system.     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017     

测试性增长中资源优化配置模型及求解

良好的测试性设计对系统维修性具有重要意义,测试性增长试验通过一系列测试性设计缺陷发现和纠正措施,可保证系统测试性指标达到设计要求。针对基于延缓纠正的测试性增长过程中的资源配置问题进行研究,基于增长试验目标是否明确和试验资源是否受限制问题构建资源优化配置模型,并提出一种基于拉格朗日松弛和本地搜索的快速优化算法。仿真结果表明:该模型能够有效指导测试性增长中的资源优化配置问题,所提混合优化方法能够高效、准确地求解整数规划问题。     

基于跟踪连续性的多传感器多跟踪任务管理方法

雷达组网系统中,当进行多目标连续性跟踪时,传统跟踪方法过多关注多传感器之间的跟踪精度和切换率,而轻视跟踪的连续性,无法满足现有连续性跟踪工程需求。因此,提出了一种新的基于跟踪连续性的多传感器多跟踪任务资源管理算法,该算法分为两个优化过程,第1次优化过程尽量保证跟踪目标个数的最大化,第2次优化过程中提出了一种用于衡量目标跟踪连续性的优化指标,基于该指标,提出了一种快速的传感器资源管理算法。仿真结果表明,该算法能够在较短的时间内对多传感器进行有效的快速分配,既跟踪了更多的目标,又保持了跟踪的连续性。     

军事云环境下基于动态博弈的资源调度方法

针对军事云环境下联合指挥资源调度优化问题,综合考虑了多部队任务需求,多目标优化,多部队资源竞争等约束条件,运用动态博弈理论及方法,建立并提出了一种基于完全信息扩展博弈的资源调度模型及方法,提高了资源调度效率,兼顾了多部队利益,增加了联合作战效益。最后通过实验验证了其有效性及准确性。     

非致命武器系统安全性分析

非致命武器在各类防暴和处突任务中发挥着重要作用,为提高非致命武器的系统安全性,给出了系统安全性的定义,明确了非致命武器系统安全性的组成,分析了非致命武器本质(固有)安全性和使用安全性的关系。在建立非致命武器系统安全性评价指标的基础上,建立了适用于非致命武器的安全管理系统模型,为非致命武器的安全管理模式提供了一种新的思路。     

多传感器融合系统航迹号管理方法

多目标杂波环境下 ,多传感器探测形成的航迹之间呈现错综复杂的关系 ,多传感器系统融合中心航迹管理成了迫切需要解决的问题。在原有单航迹号分配方法的基础上 ,提出多航迹号分配方法 ,并扩展到立体图航迹号管理方法。尤其是航迹号立体图的引入 ,为航迹管理提供了一个新的思路。     

A self‐adapting genetic algorithm for project scheduling under resource constraints

This papers deals with the classical resource‐constrained project scheduling problem (RCPSP). There, the activities of a project have to be scheduled subject to precedence and resource constraints. The objective is to minimize the makespan of the project. We propose a new heuristic called self‐adapting genetic algorithm to solve the RCPSP. The heuristic employs the well‐known activity list representation and considers two different decoding procedures. An additional gene in the representation determines which of the two decoding procedures is actually used to compute a schedule for an individual. This allows the genetic algorithm to adapt itself to the problem instance actually solved. That is, the genetic algorithm learns which of the alternative decoding procedures is the more successful one for this instance. In other words, not only the solution for the problem, but also the algorithm itself is subject to genetic optimization. Computational experiments show that the mechanism of self‐adaptation is capable to exploit the benefits of both decoding procedures. Moreover, the tests show that the proposed heuristic is among the best ones currently available for the RCPSP. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 433–448, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10029     

NMD作战管理仿真模型框架设计

针对美国国家导弹防御系统NMD(nationalmissiledefence)的发展现状,重点分析了NMD作战管理系统模型的行为过程以及与其它系统模型的接口关系,设计了作战管理系统的模型体系框架,提出了将系统的行为过程描述和功能描述相分离的建模思路。