The Insurgency Environment in Northeast India

The northeast states of India have faced a series of insurgencies almost since independence. Most insurgent groups have been based on the competing demands of various ethnic groups, with conflicts not only between the insurgents and the government, but also between groups. The combination of anti-government and intercommunal violence shows little sign of ending. Although the Indian government has made progress in dealing with the largest groups, the continued existence of several dozen insurgent movements represents a significant security threat to internal stability in India.     

Command and Control of India's Nuclear Forces

The Indian government has not made a public comment about the status of its nuclear weapon program since approving a nuclear doctrine in 2003. However, there is now enough information in the public domain to determine that the command-and-control system for the nuclear program has steadily matured in accordance with the intent of the approved nuclear doctrine. The Indian government has successfully mitigated many of the issues that plague the conventional military. The result is a basic command-and-control system that is focused only on the delivery, if ordered by the prime minister, of nuclear weapons. The system is not as robust as those of the United States and Russia, but is in place and ready as new Indian nuclear weapons enter into operation. The command-and-control system is developing to meet India's needs and political compulsions, but not necessarily as part of a more assertive nuclear policy.     

An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem

We address the problem of dispatching a vehicle with different product classes. There is a common dispatch cost, but holding costs that vary by product class. The problem exhibits multidimensional state, outcome and action spaces, and as a result is computationally intractable using either discrete dynamic programming methods, or even as a deterministic integer program. We prove a key structural property for the decision function, and exploit this property in the development of continuous value function approximations that form the basis of an approximate dispatch rule. Comparisons on single product‐class problems, where optimal solutions are available, demonstrate solutions that are within a few percent of optimal. The algorithm is then applied to a problem with 100 product classes, and comparisons against a carefully tuned myopic heuristic demonstrate significant improvements. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 742–769, 2003.     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

基于结构光的柱体工件直径测量

为实现柱状工件直径的实时快速非接触测量,利用结构光原理,对柱体直径的视觉测量方法进行了研究.详细介绍了结构光法测直径的原理和步骤,以及激光平面的标定和坐标变换求解空间二次曲线方程及特征参数的方法.实验证明该方法测量速度快,精度适中的特点,适用于大批量产品在线测量,亦适用于恶劣环境下的测量.     

多级抽样折合的小子样计数抽样方法

高价值、小批量产品要求小子样抽样,传统的计数抽样方法不能很好地解决这一问题.提出了一种基于多级抽样的综合抽样方法,将子系统或组件、零部件抽样折合为全系统抽样,增加全系统样本量,从而达到减少全系统抽样量,降低试验成本的目的.实例表明,该抽样方法具有较好的工程使用价值.     

Optimal selection with alternative information

This article examines the problem of optimally selecting from several unknown rewards when there are given alternative, costly sources of information. The optimal rule, indicating the information to be purchased and the reward to be selected, is specified as a function of the decision maker's prior probabilities regarding the value of each alternative. The rule is surprisingly complex, balancing prior beliefs, the “informativeness” of the relevant information system, and the cost of acquiring information.     

The asymptotic joint distribution of the state occupancy times in an alternating renewal process

An alternating renewal process starts at time zero and visits states 1,2,…,r, 1,2, …,r 1,2, …,r, … in sucession. The time spent in state i during any cycle has cumulative distribution function F_i, and the sojourn times in each state are mutually independent, positive and nondegenerate random variables. In the fixed time interval [0,T], let U_i(T) denote the total amount of time spent in state i. In this note, a central limit theorem is proved for the random vector (U_i(T), 1 ≤ i ≤ r) (properly normed and centered) as T → ∞.