Book Reviews

Strategic Air Defense. Edited by Stephen J. Cimbala. Scholarly Resources, Wilmington, DE (1989), ISBN 0–8420–2285–6, $40.00

NATO's Defence of the North. Brassey's Atlantic Commentaries No. 1. Edited by Eric Grove. Brassey's, London (1989), ISBN 0–08–037339–9, £7.50

Maritime Strategy and the Balance of Power: Britain and America in the Twentieth Century. Edited by John B. Hattendorf and Robert S. Jordan. Macmillan, London (1989), ISBN 0–333–43789–6, £45.00

Superpowers at Sea: an Assessment of the Naval Arms Race. By Richard Fieldhouse and Shunji Taoka. SIPRI, Oxford (1989), ISBN 0–19–829135–3

Security at Sea: Naval Arms Control. Edited by Richard Fieldhouse. Oxford University Press, Oxford (1990), ISBN 0–19–829130–2, £25.00

Strategy in the Southern Oceans: a South American View. By Virginia Gamba‐Stonehouse. Pinter, London (1989), ISBN 0–86187–017–4, £30.00

The Defence Industrial Base and the West. Edited by D. G. Haglund. Routledge, London (1989), ISBN 0–415–00923–5, £30.00

Defense and Détente: US and West German Perspectives on Defense Policy. Edited by Joseph I. Coffey and Klaus von Schubert. Westview Press, Boulder, CO, ISBN 0–8133–7722–6, $36.50     

采用空气轴承的大行程快速刀具伺服系统

随着对结构化超精密部件需要的不断增加,出现了加工具有高的表面光洁度以及形状精度的非旋转对称镜片的新技术。根据现有的快速刀具伺服系统,研制出了最大行程为16mm的新型快速刀具伺服系统(图1)。以前的快速刀具伺服系统采用了弹性导向机构,而现在的快速刀具伺服系统则采用了空气轴承,并且用了一个高频直线电机来驱动这个系统。由于采用了一个新的功率放大器,使得这个系统能够最高达到100Hz的频率以及1mm的振动幅度。这篇文章给出了这种新型快速刀具伺服系统的技术细节。     

Book Reviews

Men, Ideas and Tanks: British Military Thought and Armoured Forces, 1903–1939. By J. P. Harris, Manchester University Press, (1995) ISBN 0 7190 3762 (hardback) £40.00 or ISBN 0 7190 4814 (paperback) £14.99

Fighting for Ireland. By M. L. R. Smith. London and New York: Routledge, (1995) ISBN 0–415–09161–6.

The Fundamentals of British Maritime Doctrine (BR1806) HMSO London (1995) ISBN 0–11–772470‐X £9.50

Regional Conflicts: The Challenges to US‐Russian Co‐Operation Edited by James E. Goodby SIPRI: Oxford University Press 1995 ISBN 019‐S29–171X, £30.00

SIPRI Yearbook 1995 ‐ Armaments, Disarmament and International Security Oxford: Oxford University Press 1995. ISBN 019–829–1930, £60.00.

Drug Trafficking in the Americas Edited by Bruce M. Bagley & William O. Walker III Transaction Publishers, New Brunswick, (USA), 1994 ISBN 1–56000–752–4.

Raglan: From the Peninsula to the Crimea By John Sweetman, Arms & Armour 1993. ISBN 1–85409–059–3. £19.00.     

Pseudo-monotonic interval programming

A pseudo-monotonic interval program is a problem of maximizing f(x) subject to x ε X = {x ε Rⁿ | a < Ax < b, a, b ε R^m} where f is a pseudomonotonic function on X, the set defined by the linear interval constraints. In this paper, an algorithm to solve the above program is proposed. The algorithm is based on solving a finite number of linear interval programs whose solutions techniques are well known. These optimal solutions then yield an optimal solution of the proposed pseudo-monotonic interval program.     

A note on the “value” of bounds on EVPI in stochastic programming

The existing literature concentrates on determining sharp upper bounds for EVPI in stochastic programming problems. This seems to be a problem without an application. Lower bounds, which we view as having an important application, are only the incidental subject of study and in the few instances that are available are obtained at an extremely high cost. In order to suggest a rethinking of the course of this research, we analyze the need for bounds on EVPI in the context of its significance in decision problems.     

On the generation of deep disjunctive cutting planes

In this paper we address the question of deriving deep cuts for nonconvex disjunctive programs. These problems include logical constraints which restrict the variables to at least one of a finite number of constraint sets. Based on the works of Balas. Glover, and Jeroslow, we examine the set of valid inequalities or cuts which one may derive in this context, and defining reasonable criteria to measure depth of a cut we demonstrate how one may obtain the “deepest” cut. The analysis covers the case where each constraint set in the logical statement has only one constraint and is also extended for the case where each of these constraint sets may have more than one constraint.