Control-variate selection criteria

For multiresponse simulations requiring point and confidence-region estimators of the mean response, we propose control-variate selection criteria that minimize mean-square confidence-region volume in two situations: (a) Only the mean control vector is known, and standard linear control-variate estimation procedures are used. (b) Covariances among controls are also known and are incorporated into new linear control-variate estimation procedures. An example illustrates the performance of these selection criteria.     

Sandwich approximation of univariate convex functions with an application to separable convex programming

In this article an algorithm for computing upper and lower ? approximations of a (implicitly or explicitly) given convex function h defined on an interval of length T is developed. The approximations can be obtained under weak assumptions on h (in particular, no differentiability), and the error decreases quadratically with the number of iterations. To reach an absolute accuracy of ? the number of iterations is bounded by

     

Approximating partial inverse moments for certain normal variates with an application to decaying inventories

This paper considers the problem of computing E(X^?n; X > t) when X is a normal variate having the property that the mean is substantially larger than the standard deviation. An approximation is developed which is determined from the mean, standard deviation, and the cumulative standard normal distribution. Computations comparing the approximate moments with the actual are reported for various values of the relevant parameters. These results are applied to the problem of computing the expected number of shortages in a lead-time for a single product which exhibits continuous exponential decay.     

All-integer linear programming — a new approach via dynamic programming

An exact method for solving all-integer linear-programming problems is presented. Dynamic-programming methodology is used to search efficiently candidate hyperplanes for the optimal feasible integer solution. The explosive storage requirements for high-dimensional dynamic programming are avoided by the development of an analytic representation of the optimal allocation at each stage. Computational results for problems of small to moderate size are also presented.     

Life distribution analysis based on Lévy subordinators for degradation with random jumps

For a component or a system subject to stochastic degradation with sporadic jumps that occur at random times and have random sizes, we propose to model the cumulative degradation with random jumps using a single stochastic process based on the characteristics of Lévy subordinators, the class of nondecreasing Lévy processes. Based on the inverse Fourier transform, we derive a new closed‐form reliability function and probability density function for lifetime, represented by Lévy measures. The reliability function derived using the traditional convolution approach for common stochastic models such as gamma degradation process with random jumps, is revealed to be a special case of our general model. Numerical experiments are used to demonstrate that our model performs well for different applications, when compared with the traditional convolution method. More importantly, it is a general and useful tool for life distribution analysis of stochastic degradation with random jumps in multidimensional cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 483–492, 2015     

Fitting Lanchester equations to the battles of Kursk and Ardennes

Lanchester equations and their extensions are widely used to calculate attrition in models of warfare. This paper examines how Lanchester models fit detailed daily data on the battles of Kursk and Ardennes. The data on Kursk, often called the greatest tank battle in history, was only recently made available. A new approach is used to find the optimal parameter values and gain an understanding of how well various parameter combinations explain the battles. It turns out that a variety of Lanchester models fit the data about as well. This explains why previous studies on Ardennes, using different minimization techniques and data formulations, have found disparate optimal fits. We also find that none of the basic Lanchester laws (i.e., square, linear, and logarithmic) fit the data particularly well or consistently perform better than the others. This means that it does not matter which of these laws you use, for with the right coefficients you will get about the same result. Furthermore, no constant attrition coefficient Lanchester law fits very well. The failure to find a good‐fitting Lanchester model suggests that it may be beneficial to look for new ways to model highly aggregated attrition. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Small world,big guns: globalization,interstate security networks and conventional weapons imports

With the burgeoning influence of emerging markets in Asia, a tectonic shift is taking place in the global security landscape. Asian states are concomitantly arming as their economic clout grows. In light of these developments, security analysts would benefit from a formal means of placing these arms acquisitions in a structural context. Are arms acquisitions on par with the expectations of Asian states, given their structural dispositions, or are recent acquisitions beyond anticipated levels? By using a dynamic panel regression of 187 states from 1950 to 2011, this research predicts arms import volume using the degree of interstate arms linkages, the size of a state's military, and its level of economic development. The technique offers analysts a formal means of distinguishing orthodox behavior in importing conventional weapons from extraneous security motivations. The article concludes by generating near-term forecasts of Asian arms imports and discussing the implications of the technique.     

The campaign of the lost footsteps: the pacification of Burma, 1885-95

ABSTRACT

What Rudyard Kipling called the ‘campaign of lost footsteps’ was the longest campaign fought by the Victorian army. The conquest of Upper Burma, an area of 140,000 sq. miles with a population of four million, took only three weeks in November 1885 and was accomplished with minimum cost. However, the removal and deportation of the Burmese King and dismantling of all traditional authority dismantled led to growing resistance to British rule leading to an increasingly difficult guerrilla war. Though the Burmese guerrillas were characterised by the British as mere bandits or dacoits, many were former soldiers along with Buddhist monks. The extremely difficult nature of campaigning in the terrain and climate of Burma was not sufficiently appreciated by the War Office, who viewed the conflict as a ‘subaltern’s war’ and ‘police’ work. Intended regime change was also not accompanied by any consideration of the likely implications. Prolonged insurgency necessitated deploying a force far larger than originally intended; though order was finally secured by 1895, the campaign proved destructive of Burmese society while British recruitment of hill tribes into the police and armed forces sowed the seeds for future divisions.