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. 相似文献
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. 相似文献
The bounded interval generalized assignment model is a “many-for-one” assignment model. Each task must be assigned to exactly one agent; however, each agent can be assigned multiple tasks as long as the agent resource consumed by performing the assigned tasks falls within a specified interval. The bounded interval generalized assignment model is formulated, and an algorithm for its solution is developed. Algorithms for the bounded interval versions of the semiassignment model and sources-to-uses transportation model are also discussed. 相似文献
Consider a birth and death process starting in state 0. Keilson has shown by analytical arguments that the time of first passage into state n has an increasing failure rate (IFR) distribution. We present a probabilistic proof for this. In addition, our proof shows that for a nonnegative diffusion process, the first passage time from state 0 to any state x is IFR. 相似文献
We compare several competing estimates of the availability of a system which alternates between two states, “up” and “down,” in accordance with an alternating renewal process. Both interval and point estimators are compared under several special but representative situations. The comparison reaffirms the validity and robustness of the log-logistic jackknifed estimates. However, when the point estimates are compared from the intrinsic criterion of probability of concentration, the uniformly minimum variance estimate obtained for the Markov model performs very well. 相似文献
Under a free-replacement warranty of duration W, the customer is provided, for an initial cost of C, as many replacement items as needed to provide service for a period W. Payments of C are not made at fixed intervals of length W, but in random cycles of length Y = W + γ(W), where γ(W) is the (random) remaining life-time of the item in service W time units after the beginning of a cycle. The expected number of payments over the life cycle, L, of the item is given by MY(L), the renewal function for the random variable Y. We investigate this renewal function analytically and numerically and compare the latter with known asymptotic results. The distribution of Y, and hence the renewal function, depends on the underlying failure distribution of the items. Several choices for this distribution, including the exponential, uniform, gamma and Weibull, are considered. 相似文献
We formulate the set partitioning problem as a matching problem with simple side constraints. As a result we obtain a Lagrangian relaxation of the set partitioning problem in which the primal problem is a matching problem. To solve the Lagrangian dual we must solve a sequence of matching problems each with different edge-weights. We use the cyclic coordinate method to iterate the multipliers, which implies that successive matching problems differ in only two edge-weights. This enables us to use sensitivity analysis to modify one optimal matching to obtain the next one. We give theoretical and empirical comparisons of these dual bounds with the conventional linear programming ones. 相似文献
This paper deals with the bulk arrival queueing system MX/G/1 and its ramifications. In the system MX/G/1, customers arrive in groups of size X (a random variable) by a Poisson process, the service times distribution is general, and there is a single server. Although some results for this queueing system have appeared in various books, no unified account of these, as is being presented here, appears to have been reported so far. The chief objectives of the paper are (i) to unify by an elegant procedure the relationships between the p.g.f.'s