Algorithms for the design of finite-capacity service units

Finite-capacity queues arise naturally in many practical situations, notably in communications and manufacturing engineering. In this article, the matrix formalism of probability distributions of phase type is used to develop fast algorithms to compute various steady-state distributions for the finite-capacity PH/PH/1 queue. This algorithm is an important ingredient in solving nontraditional but significant design problems. Some of these are described as illustrative examples.     

Multilateral defense cooperation in the Indo-Asia-Pacific region: Tentative steps toward a regional NATO?

Some U.S. military leaders have asserted that the United States, Japan, Australia, and India and the Republic of Korea are developing multilateral defense cooperation to deter aggression and uphold norms much like North Atlantic Treaty Organization (NATO) has in Europe. Frequent military exercises and China’s threats to freedom of navigation (FoN) and North Korea’s nuclear missiles comprise the motive force for such cooperation. However, cooperation thus far has been trilateral and minimal, given divergent national interests and dispersed geopolitical locations. Cooperation among Japan, Republic of Korea (ROK), and the United States is increasing given the threat, but ROK’s public opinion is divided about Japan. Australia, Japan, and India have increased cooperation with the United States but are reluctant to conduct FoN operations with the United States to challenge China’s expansionism in the South China Sea. If China becomes more aggressive and blocks FoN or seizes territory, development toward an Asian NATO is possible.     

A computation procedure for the exact solution of location-allocation problems with rectangular distances

A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem.     

A Bayesian approach to demand estimation and inventory provisioning

This article addresses the problem of explicitly taking into account uncertainty about the demand for spare parts in making inventory procurement and stockage decisions. The model described provides for a unified treatment of the closely related problems of statistical estimation of demand and resource allocation within the inventory system, and leads to an easily implemented, efficient method of determining requirements for spare parts both in the early provisioning phase and in later periods of operations when demand data have accumulated Analyses of the model's theoretical foundations and of sample outcomes of the model based upon data on parts intended for use in the F-14 lead to conclusions of great importance to both support planners and operations planners Finally, of particular significance is the ability afforded the planner by this model to quantify the impact on inventory system costs of varying levels of system reliability or management uncertainty as to projected system performance. This will provide an economic basis for analysis of such alternatives as early deployment, operational testing, and equipment redesign.     

Location of facilities with rectangular distances among point and area destinations

This article is concerned with the optimal location of any number (n) of facilities in relation to any number (m) of destinations on the Euclidean plane. The criterion to be satisfied is the minimization of total weighted distances where the distances are rectangular. The destinations may be either single points, lines or rectangular areas. A gradient reduction solution procedure is described which has the property that the direction of descent is determined by the geometrical properties of the problem.     

System comparison procedures for automatic target recognition systems

Estimating the performance of an automatic target recognition (ATR) system in terms of its probability of successfully identifying a target involves extensive image collection and processing, which can be very time‐consuming and expensive. Therefore, we investigate the Wald sequential test for the difference in two proportions as a sample size‐reducing alternative to ranking and selection procedures and confidence intervals. An analysis of the test parameters leads to a practical methodology for implementing the Wald test for fairly comparing two systems, based on specific experimental goals. The test is also extended with the modified, sequentially rejective Bonferroni procedure for the multiple pairwise comparison of more than two systems. Two sampling schemes for different experimental goals are also discussed. The test methodology is applied to actual data to compare different configurations of a specific ATR system, with the results demonstrating that the modified Wald sequential procedure is a useful alternative to comparing proportions with confidence intervals, particularly when data are expensive. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 357–371, 1999     

The residual life of the renewal process: A simple algorithm

We develop a simple algorithm, which does not require convolutions, for computing the distribution of the residual life when the renewal process is discrete. We also analyze the algorithm for the particular case of lattice distributions, and we show how it can apply to an inventory problem. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 435–443, 1999     

Rebellion,Repression and Welfare

I develop a dynamic model of social conflict whereby manifest grievances of the poor generate the incentive of taking over political power violently. Rebellion can be an equilibrium outcome depending on the level of preexisting inequality between the poor and the ruling elite, the relative military capabilities of the two groups and the destructiveness of conflict. Once a technology of repression is introduced, widespread fear reduces the parameter space for which rebellion is an equilibrium outcome. However, I show that repression-driven peace comes at a cost as it produces a welfare loss to society.