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     

A platform for initial testing of multiple camouflage patterns

The human visual system is still an important factor in military warfare; military personnel receive training on effective search strategies, and camouflage that can effectively conceal objects and personnel is a key component of a successful integrated survivability strategy. Previous methods of camouflage assessment have, amongst others, used psychophysics to generate distinctiveness metrics. However, the population from which the human observers are drawn is often not well defined, or necessarily appropriate. In this experiment we designed a new platform for testing multiple patterns based on a camouflaged object detection task, and investigate whether trained military observers perform better than civilians. We use a two-alternative forced choice paradigm, with participants searching images of woodland for a replica military helmet displaying Olive Green, Multi Terrain Pattern, US Marine Pattern or, as a conspicuous control, UN Peacekeeper Blue. Our data show that there is no difference in detection performance between the two observer groups but that there are clear differences in the effectiveness of the different helmet colour patterns in a temperate woodland environment. We conclude that when tasks involve very short stimulus presentation times, task-specific training has little effect on the success of target detection and thus this paradigm is particularly suitable for robust estimates of camouflage efficacy.     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Concept costing for defence projects: the problem and its solution

It is intrinsic to the nature of military competition that the unit acquisition costs of defence systems rise generation by generation. Traditional “bottom‐up” methods of cost‐estimating cannot meet the increasing demands for extensive studies of many options before commencing design and, while “top‐down” estimating techniques are an improvement, in particular by reducing the time required for preparing estimates, they also are inadequate to meet current requirements. A new method has been devised, therefore, further developing “top‐down” methods using Bayesian techniques to make best use of the available information, whether certain or uncertain, and its accuracy established by example.     

Excess capacity in weapons production: An empirical analysis∗ †

This paper analyzes a set of observations by the Congressional Budget Office (CBO) on individual weapons systems regarding whether large amounts of excess capacity exist and whether short run average cost (SRAC) appears to be severely decreasing. It is shown that the amount of excess capacity and steepness of SRAC are essentially independent of output rate. It is then argued that this suggests that production is occurring in inefficiently large plants—i.e.—off the long run cost curve.     

The artful use of national power: Portuguese Angola (1961–1974)

In its colony of Angola, Portugal during its colonial wars (1961–1974) was able to exploit the economic dependence and divided population loyalties of its hostile neighbours the Congo and Zambia as well as the cleavages within the nationalist movements to prevent a crippling insurgency. The rulers of both countries were largely dependent on Angola for trade, and were eager to have the side effects of the robust Angolan economy with its 11% annual growth brush off on their own moribund ones. While relationships were never comfortable, the sponsors of revolution were forced to reign in their ‘freedom fighters’ in order to maintain the functioning of their export-dependent economies. Portuguese leadership also played a vital role, as it was able to bring together diverse elements of national power in a concerted policy for dealing with these enemies, whether they were insurgents or their sanctuary countries. This policy of leveraging national power and playing on the vulnerabilities of its opponents worked well during its war in Angola and still holds valuable lessons for countries that find themselves in similar circumstances.     

Baixa do Cassang: Ending the abuse of Portuguese Africans

On 4 January 1961 in Baixa do Cassange, in the north of Angola, the blacks who worked in the cotton fields began a strike. The army with air support was called to quell the rebellion, and the article emphasizes the importance of air support tethered to the ground forces, particularly in a remote and vast area of operations in the tropical rainy season. In this case, the support originally came in the form a squadron of Lockheed PV-2 Harpoons from Luanda, some 300 kilometers away. These open-ocean reconnaissance aircraft and their crews were ill-suited for the task. When this became apparent, four small Auster D5/160s were relocated from Negage to Malange, among the ground forces. The Austers flew reconnaissance missions over the troubled zones, dropped provisions and messages to the advancing ground forces, and served as a backup communications link. When the strike ceased after three weeks, the Austers assumed a humanitarian role in support of the starving population. The conclusion is that air support to ground forces is indispensable, must be properly tailored to the job, and must operate as an integral part of the ground forces.     

‘The only good jihadist is a dead jihadist’:Boko Haram and de-radicalization around Lake Chad

ABSTRACT

This article discusses the shortcomings of the “de-radicalization doctrine” in sub-Saharan Africa. The issues raised are illustrated by the war against Boko Haram, which involves Nigeria, Niger, Chad and Cameroon. Relying on interviews with security officers, insurgents, civil servants, displaced people, humanitarian workers and Muslim and Christian clerics in Nigeria, Niger and Chad since 2005, the investigation shows that the four states focused on repression rather than demobilisation programs in prison or outdoors. The Boko Haram crisis is mainly a story of mismanagement. The article thus challenges the assumptions of the “de-radicalization doctrine” in Muslim Africa South of the Sahara. First, attempts to de-radicalize jihadi terrorists tend to focus too much on religious fanaticism and the exegesis of the Quran. Secondly, they are neither feasible nor efficient. Finally, they obscure priorities that are more important to counter extremism and demobilize insurgents.     

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.