The case of Donald Rumsfeld: leadership traps in national security

Taking its point of departure in Donald Rumsfeld’s second term as US Secretary of Defense (2001–2006), this article analyses the crisis of strategic leadership in Western national security. Three “traps” are identified that explain why Donald Rumsfeld ultimately was a failure as defence secretary and demonstrate the perils of national security governance. These traps are termed the inquisitor trap, the strong leader trap and the delegation trap. It is argued that our understanding of strategic leadership in national security, particularly in defence, can benefit from insights gained from the study of strategic leadership in business. As such, this article engages the recent trend of merging insights from business and military strategy.     

临近空间高超声速目标跟踪方法研究?

临近空间高超声速目标跟踪技术研究在空天防御系统中具有重要军事意义和理论价值。本文综述了临近空间高超声速目标跟踪中的目标运动建模、目标跟踪算法等研究内容的研究进展,并对其存在的问题进行了深入分析。针对这类目标跟踪存在的问题,结合临近空间高超声速目标探测跟踪需求,指出了临近空间高超声速目标跟踪技术的研究思路,为相关研究提供了参考。     

Sequential and systematic sampling plans for the Markov‐dependent production process

Acceptance sampling plans are used to assess the quality of an ongoing production process, in addition to the lot acceptance. In this paper, we consider sampling inspection plans for monitoring the Markov‐dependent production process. We construct sequential plans that satisfy the usual probability requirements at acceptable quality level and rejectable quality level and, in addition, possess the minimum average sample number under semicurtailed inspection. As these plans result in large sample sizes, especially when the serial correlation is high, we suggest new plans called “systematic sampling plans.” The minimum average sample number systematic plans that satisfy the probability requirements are constructed. Our algorithm uses some simple recurrence relations to compute the required acceptance probabilities. The optimal systematic plans require much smaller sample sizes and acceptance numbers, compared to the sequential plans. However, they need larger production runs to make a decision. Tables for choosing appropriate sequential and systematic plans are provided. The problem of selecting the best systematic sampling plan is also addressed. The operating characteristic curves of some of the sequential and the systematic plans are compared, and are observed to be almost identical. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 451–467, 2001     

Reliability of a 2‐dimensional k‐within‐consecutive‐r × s‐out‐of‐m × n:F system

A 2‐dimensional rectangular (cylindrical) k‐within‐consecutive‐r × s‐out‐of‐m × n:F system is the rectangular (cylindrical) m × n‐system if the system fails whenever k components in a r × s‐submatrix fail. This paper proposes a recursive algorithm for the reliability of the 2‐dimensional k‐within‐consecutive‐r × s‐out‐m × n:F system, in the rectangular case and the cylindrical case. This algorithm requires min ( O (mk^r(n?s)), O (nk^s(m?r))), and O (mk^rn) computing time in the rectangular case and the cylindrical case, respectively. The proposed algorithm will be demonstrated and some numerical examples will be shown. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 625–637, 2001.     

多层DSS体系结构研究

在设计和部署DSS时,由于对DSS体系结构认识不清,常常不能做出正确的选择.而对DSS体系结构的正确选择正是成功实施DSS的关键.详细地分析了第一、二代DSS模型在具体实施和运行过程中存在的问题,提出了一种综合的多层DSS模型,并设计了软件体系结构.该模型综合了数据仓库和数据集市的优点,解决了第一、二代DSS模型存在的不足,对规划和部署DSS具有一定的指导意义.     

高速三维地形显示系统的体系结构

从自行设计的专用三维地形显示的硬件和软件系统的观点出发,讨论了高速三维地形显示系统的体系结构、关键技术及其实现方法。以新一代的高速处理器ＩＮＴＥＬｉ８６０为核心,采用分配树技术,解决多路并行输出产生的竞争和瓶颈问题;实现Ｚ－缓冲硬件算法,提高系统的图形消隐速度;设计多帧存体结构,支持多通道、多画面信息的快速显示。     

The open shop scheduling problem with a given sequence of jobs on one machine

The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998     

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     

一种面向个性化服务的无需反例集的用户建模方法

随着WWW信息的快速增长 ,查找用户感兴趣的信息变得越来越耗时耗力。个性化服务能为不同的用户提供有针对性的服务 ,日益受到研究者的重视。用户建模是实现个性化服务的关键技术。传统的需要正、反例集作为训练例集的用户建模方法容易干扰用户的正常浏览 ,或者由于推断失误而引入噪声。基于遗传算法和k近邻方法提出了一种无需反例集的用户建模方法 ,该方法被应用于个性化信息过滤中。实验结果表明 ,基于无需反例集的用户建模方法的信息过滤算法可以达到 73 91%的过滤率和 94 4 4 %的过滤精度。无需反例集的用户建模方法是一种可行、高效的用户建模方法     

多目标的分布式协同进化MDO算法

通过引入非优超排序和排挤的多目标处理机制 ,将分布式协同进化MDO算法的能力扩展到多目标的多学科设计优化问题。多目标的分布式协同进化MDO算法在保持各学科充分自治和各学科并行设计优化协同的基础上 ,通过一次运行即可获得具有良好分布的多个Pareto最优解 ,逼近整个Pareto最优前沿。应用于导弹气动 /发动机 /控制三学科两目标设计优化问题 ,与约束法计算结果的对比表明算法能够有效逼近该问题的Pareto最优前沿 ,为设计决策提供了丰富的信息