Book Reviews

Iain McCallum, Blood Brothers Hiram and Hudson Maxim: Pioneers of Modern Warfare. London: Chatham, 1999. Pp. 224, 33 illus., 2 maps, biblio., index. £20. ISBN 1–86176–096–5.

Eric Ash, Sir Frederick Sykes and the Air Revolution, 1912–1918. London and Portland, OR: Frank Cass, 1999. Pp.xviii + 268, 20 illus., 3 maps, biblio., index. £42.50/$59.50 (cloth), £18.50/$27.50 (paper). ISBN 0–7146–4828–0 and ‐4382–3.

Azar Gat, Fascist and Liberal Visions of War: Fuller, Liddell Hart, Douhet, and other Modernists. Oxford: Clarendon Press, 1998. Ppviii + 334, biblio., index. £45. ISBN 0–19–820715–8.

David B. Woolner (ed.), The Second Quebec Conference Revisited: Waging War, Formulating Peace: Canada, Great Britain, and the United States in 1944–1945. Basingstoke; London: Macmillan Press, 1998. Pp.xiii + 210, index. £32.50. ISBN 0–333–75970–2.

Jeffrey Grey. Up Top: The Royal Australian Navy and Southeast Asian Conflicts 1955–1972. St Leonards NSW: Allen &; Unwin in association with the Australian War Memorial, 1998. Pp.xx + 380, 110 illus., 12 tables, 23 maps &; diagrams, appendices, notes, biblio., index. NP. ISBN 1–86448–290–7.

Susan L Carruthers, The Media at War. Basingstoke: Macmillan, 2000. Pp.321, biblio., index. £14.99 (paper). ISBN 0–333–69143–1, also available in hardback.

Edward J. Marolda and Robert J. Schneller Jr, Shield and Sword: The United States Navy and the Persian Gulf War. Washington DC: Naval Historical Center, 1998. Pp.xxi + 517, 120 illus., 14 maps, biblio., index. NP. ISBN 0–1604–9476–1.

Marvin Pokrant, Desert Shield at Sea: What the Navy Really Did and Desert Storm at Sea: What the Navy Really Did. Both Westport, CT: Greenwood Press, 1999. Pp.xxiii + 265,9 illus., biblio., index. £44.95. ISBN 0–313–31023–8. Pp.xxiv + 329,12 illus., biblio., index. NP. ISBN 0–313–31024–6.

David Kaularich and Ronald C. Kramer, Crimes of the American Nuclear State: At Home and Abroad. Boston: Northeastern University Press, 1999. Pp.xviii + 195, biblio., index. £42.75. ISBN 1–55553–371‐X.

Stanley Hoffmann, World Disorders: Troubled Peace in the Post‐Cold War Era. Lanham, MD: Rowman &; Littlefield, 1998. Pp.viii+279, notes, index. $29.95. ISBN 0–8476–8574–8.

Lawrence Freedman (ed.), Strategic Coercion: Concepts and Cases. Oxford: Oxford‐University Press, 1998. Pp.400, index. £48. ISBN 0–19–829–349–6.

Stephen J. Cimbala, Coercive Military Strategy. College Station, TX: Texas A&;M University Press, 1998. Pp.229, biblio, index; $39.95. ISBN 0–89096–836–5     

Light weight HTPB-clay nanocomposites(HCN)with enhanced ablation performance as inhibition materials for composite propellant

In the present study,organically modified Montmorillonite clay with polar moiety,the Cloisite 30B,is used for preparation of Hydroxyl terminated polybutadiene(HTPB)-clay nanocomposites(HCN)by dispersion of nanoclay in polymer matrix under high shear mixing.The nanocomposites thus prepared are evaluated in composite propellants as inhibitor material for their functional utility.Several inhibition formulations containing 5 wt％-15 wt％of nanoclay,with or without the conventional filler Sb2O3,were prepared.All these formulations were evaluated for their physical,mechanical,thermal,and ablative properties.Ablation rate and density of the compositions containing Cloisite 30B is around 23％and 5％lower respectively in comparison of the base composition.Strain capability of these compositions is twofold higher than that of base composition.These compositions have also been evaluated for their smoke generation tendency by measuring infra red(IR)attenuation in the wavelength range 1.3 μm-5.6 μm and 8 μm-13 μm and thereby compared with the base composition.The corresponding results confirmed that the compositions containing Cloisite 30B as filler have much lower IR attenuation than compositions with conventional filler,Sb2O3.Replacement of 5％Sb2O3 by nanoclay showed 8％reduction in IR attenuation rate which further reduced to 16％on replacement of 15％of Sb2O3.Interfacial bonding of HCN based inhibitors is also comparable or even better than conventional inhibitors.Precisely,the nanoclay composites with Cloisite 30B as filler exhibit all desirable properties of an inhibitor.     

Maximizing the ratio of two convex functions over a convex set

The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Due-date assignment and early/tardy scheduling on identical parallel machines

This article examines the problem of simultaneously assigning a common due date to a set of independent jobs and scheduling them on identical parallel machines in such a way that the costs associated with the due date and with the earliness or tardiness of the jobs are minimized. We establish that, for certain values of the due-date cost, an optimal schedule for this problem is also optimal for an early/tardy scheduling problem studied by Emmons. We discuss the solution properties for the two problems, and show that both problems are NP-hard even for two machines. We further show that these problems become strongly NP-hard if the number of machines is allowed to be arbitrary. We provide a dynamic programming solution for the problems, the complexity of which indicates that the problems can be solved in pseudopolynomial time as long as the number of machines remains fixed. Finally, we present the results of a limited computational study. © 1994 John Wiley & Sons, Inc.     

A bivariate pareto model and its applications to reliability

We consider a bivariate Pareto distribution, as a generalization of the Lindley-Singpurwalla model, by incorporating the influence of the operating conditions on a two-component dependent system. The properties of the model and its applications to reliability analysis are discussed. © 1993 John Wiley & Sons, Inc.     

On the solution of a stochastic bottleneck assignment problem and its variations

In this article, we study the stochastic version of the so-called bottleneck assignment problem. Our primary objective is to maximize the probability that the bottleneck value satisfies a specified target. Under general stochastic assumptions, we show that the solution in this case is easily obtained by solving a linear assignment problem. We next examine the situation where the target is to be minimized, given that the probability of satisfying the target exceeds a specified threshold. Finally, we address extensions to the original problem where a second objective is also considered.     

Waiting times for M/G/1 queues with service-time or delay-dependent server vacations

This article shows how to determine the stationary distribution of the virtual wait in M/G/1 queues with either one-at-a-time or exhaustive server vacations, depending on either service times or accrued workload. For the first type of dependence, each vacation time is a function of the immediately preceding service time or of whether the server finds the system empty after returning from vacation. In this way, it is possible to model situations such as long service times followed by short vacations, and vice versa. For the second type of dependence, the vacation time assigned to an arrival to follow its service is a function of the level of virtual wait reached. By this device, we can model situations in which vacations may be shortened whenever virtual delays have gotten excessive. The method of analysis employs level-crossing theory, and examples are given for various cases of service and vacation-time distributions. A closing discussion relates the new model class to standard M/G/1 queues where the service time is a sum of variables having complex dependencies. © 1992 John Wiley & Sons, Inc.     

Finite Markov chain models skip-free in one direction

Finite Markov processes are considered, with bidimensional state space, such that transitions from state (n, i) to state (m, j) are possible only if m ≤ n + 1. The analysis leads to efficient computational algorithms, to determine the stationary probability distribution, and moments of first passage times.