UCAV编队对地攻击智能决策系统总体结构

UCAV编队对地攻击是未来战争制信息权和制空权的关键所在,结合无人作战飞机(UCAV)与有人驾驶飞机各自的特点和优势,提出了UCAV编队对地攻击系统的基本组成和对地攻击流程.根据UCAV编队对地攻击的战术决策类型和决策方式,构造了UCAV编队对地攻击智能决策系统的总体结构并且提出了决策系统应该解决的关键技术,详细分析了所建立的UCAV编队对地攻击决策系统的决策方式和决策流程,并且对该系统所涉及的关键技术进行了详细的研究.     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

Manpower allocation with time windows and job‐teaming constraints

In this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Global counterinsurgency and US army expansion: the case for recruiting foreign troops

Given the nature of global counterinsurgency operations, the demands of military expansion, and the need for cultural, linguistic, and regional expertise, the United States Army should evaluate the establishment of US-led foreign troop units for its evolving force structure. This article proposes the creation of an American foreign legion based upon the recruitment of US-led, ethnically homogeneous tribal force units to meet the grist mill of counterinsurgency operations. This structured approach would be more beneficial than the current reliance on a de facto American Foreign Legion, represented by private military contractors (PMCs), many of them comprised of foreigners. These PMCs carry a number of oversight, accountability, and legal risks not found in a fully integrated, and US-officered foreign legion. The British Brigade of Gurkhas, the South-West African Police Counter-Insurgency Unit (Koevoet), and the Kit Carson Scouts serve as relevant historical examples where foreign troops were used to supplement national manpower resources.     

地震灾害应急救援队行动准则初探

从地震灾害的形成和影响地震灾害大小的因素入手,探讨地震灾害应急救援队能力界定的要素、衡量标准、影响因素等问题,规范了地震灾害救援的程序、搜救行动的持续时间、救援过程中的行动要求、救援过程中注意的事项和救援过程中二次伤害的预防等行动准则,目的是提升地震灾害救援队救援能力。