Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Power series expansions for the distribution and mean value function of a geometric process with Weibull interarrival times

The geometric process is considered when the distribution of the first interarrival time is assumed to be Weibull. Its one‐dimensional probability distribution is derived as a power series expansion of the convolution of the Weibull distributions. Further, the mean value function is expanded into a power series using an integral equation. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 599–603, 2014     

Book reviews

The Political Economy of Defense, Ross A. L. (ed), Greenwood Press, 1991, New York. pp. ix, 229; ISBN 0–313–26462–7, Price $47.95

Economie Politique de la Defense, Jacques Aben, (Paris: Editions Cujas, 1992, 170 pages, 120 French Francs, ISBN: 2–254–92723‐X)     

VISIONS OF FISSION

For many years, non-nuclear weapons states have sought binding commitments from nuclear armed states that they would not be the victim of either the threat or use of nuclear weapons—so-called negative security assurances (NSAs). The nuclear weapon states have traditionally resisted granting such unconditional NSAs. Recent U.S. efforts to use nuclear deterrence against the acquisition and use by other states of chemical, biological and radiological weapons, however, have further exacerbated this divide. This article analyzes the historical development of NSAs and contrasts U.S. commitments not to use nuclear weapons with the empirical realities of current U.S. nuclear weapons employment doctrines. The authors conclude that NSAs are most likely to be issued as unilateral declarations and that such pledges are the worst possible manner in which to handle the issue of security assurance.     

Institutional Analysis and Irregular Warfare: A Case Study of the French Army in Algeria 1954–1960

This article proposes a case study to illustrate the usefulness of sociological institutional analysis as a method to uncover ‘blue force’ challenges to deal with irregular warfare. The French Army's adaptation to revolutionary warfare in Algeria, starting in 1954, is used to illustrate both the application of the methodology and how institutional forces can hinder as well as overwhelm transformation for irregular warfare. The analysis emphasizes three key dimensions of the French Army's institutional adaptation: the regulative, normative and cognitive. These empirical elements are used to show how they interacted and influenced the institutional implementation of the French COIN structures.     

Scheduling with earliest start and due date constraints on multiple machines

We consider the scheduling of n jobs on m identical machines when the jobs become available for processing at ready times a_i, a_i, ? 0, require d_i time units for processing and must be completed by times b_i for i = 1, 2, … n. The objective chosen is that of minimizing the total elapsed time to complete all jobs subject to the ready time and due date constraints, preemption is not allowed. We present a multi-stage solution algorithm for this problem that is based on an implicit enumeration procedure and also uses the labelling type algorithm which solves the problem when preemption is allowed.     

On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem

Recent efforts to improve lower bounds in implicit enumeration algorithms for the general (n/m/G/F_max) sequencing problem have been directed to the solution of an auxiliary single machine problem that results from the relaxation of some of the interference constraints. We develop an algorithm that obtains optimal and near optimal solutions for this relaxed problem with relatively little computational effort. We report on computational results achieved when this method is used to obtain lower bounds for the general problem. Finally, we show the equivalence of this problem to a single machine sequencing problem with earliest start and due date constraints where the objective is to minimize the maximum lateness.     

(0, 1) hyperbolic programming problems

In the first part of this paper we study the unconstrained {0, 1} hyperbolic programming problem treated in [1]. We describe a new algorithm for this problem which produces an optimal solution by scanning just once the set of fractions to be analysed. This algorithm shows better computing performance than the one described in [1]. In the second part we study the {0, 1} hyperbolic programming problem with constraints given by inequalities on nondeereasing pseudo-boolean functions. We describe a “branch and bound” type algorithm for this problem.     

MAKING THE AGENDA STICK Lessons Learned From the 2007 NPT PrepCom

After the conclusion of the 2008 Preparatory Committee (PrepCom) for the 2010 Review Conference of the Parties to the Treaty on the Non-Proliferation of Nuclear Weapons (NPT), the Nonproliferation Review interviewed Ambassador Yukiya Amano of Japan, who presided over the 2007 session of the PrepCom in Vienna. He provided valuable insights into his preparations for the PrepCom and shared his thoughts on some of the most pressing issues that confronted his chairmanship and the PrepCom as a whole. The interview also provides useful perspectives on the future of the strengthened review process.