并行调试环境中的追踪和重演

通过传递消息进行通信的并行程序，由于受进程调度和消息等待时间变化的影响，其执行结果可能是不确定的。这导致调试时相继执行不能再现先前的故障，为此，在并行调试环境中引入了追踪和重演机制。本文详细讨论了一种比较先进的追踪和重演算法及其工程实现。     

柔性机械手加速度反馈抑制振动的机理与稳定性分析

在柔性机械手的控制中,末端加速度反馈是一种抑制振动有效而简便的途径。但直到现在对其中抑制振动和稳定性的机理并不很清楚。本文深入系统地分析了其内在原因,证明其反馈稳定性,并在自行建立的柔性手实验平台上完成了实验证明,得出了几个确定性有实际指导意义的结论     

一种基于细胞动力学的双目匹配方法

双目匹配是计算机立体视觉的一个难点。以往的各种模型把注意力集中于将左视图像和右视图像中的要素特征唯一地进行双目匹配的任务上。有别于以往的这些模型，文章在ＦＡＣＡＤＥ模型框架的基础上，利用细胞动力学模型隐含了竞争和合作这一原理，实现了一个采用“方位合作，视差竞争”方法的双目匹配模型，从而探索一条利用生物视觉原理进行计算机立体视觉研究的可行途径。     

Bayes 试验分析中验前分布的表示

结合武器系统试验鉴定中的问题，研究Ｂａｙｅｓ方法运用中的验前信息表示问题。文中运用自助（Ｂｏｏｔｓｔｒａｐ）方法和随机加权法确定验前分布。对于多种信息源之下的验前信息，给出了验前分布的融合估计。对当前工程实践中常用的方法及存在的问题，提出了看法和处置方法。     

导弹攻防对抗作战效能仿真分析方法论

本文介绍了在基于攻防对抗仿真的导弹作战效能分析时应该面对的四个主要环节，提出了采用攻防对抗仿真进行导弹作战效能分析的一般过程。该方法适用于各类导弹等武器系统攻防对抗仿真作战效能研究。     

The long shadow of colonial cartography: Britain and the Sino-Indian war of 1962

ABSTRACT

This article examines British responses to the Sino-Indian border war of 1962. It illustrates how, in the years leading up to the war, Britain’s colonial legacy in the Indian subcontinent saw it drawn reluctantly into a territorial dispute between Asia’s two largest and most powerful nations. It analyses disagreements in Whitehall between the Foreign Office and Commonwealth Relations Office over the relative strength of India and China’s border claims, and assesses how these debates reshaped British regional policy. It argues that the border war was instrumental in transforming Britain’s post-colonial relationship with South Asia. Continuing to filter relations with India through an imperial prism proved unsatisfactory, what followed was a more pragmatic Indo-British association.     

Slow failure: Understanding America’s quagmire in Afghanistan

ABSTRACT

The United States government has no organised way of thinking about war termination other than seeking decisive military victory. This implicit assumption is inducing three major errors. First, the United States tends to select military-centric strategies that have low probabilities of success. Second, the United States is slow to modify losing or ineffective strategies due to cognitive obstacles, internal frictions, and patron-client challenges with the host nation government. Finally, as the U.S. government tires of the war and elects to withdraw, bargaining asymmetries prevent successful transitions (building the host nation to win on its own) or negotiations.     

Scheduling workers in a constricted area

A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc.     

A lost sales (S — 1, S) perishable inventory system with renewal demand

This article analyzes a one-to-one ordering perishable inventory model with renewal demands and exponential lifetimes. The leadtimes are independently and exponentially distributed and the demands that occur during stock out periods are lost. Although the items are assumed to decay at a constant rate, the output process is not renewal and the Markov renewal techniques are successfully employed to obtain the operating characteristics. The problem of minimizing the long run expected cost rate is discussed and numerical values of optimal stock level are also provided. © 1996 John Wiley & Sons, Inc.     

An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs

In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc.