Optimal replacement for fault-tolerant systems

We consider the optimal replacement problem for a fault tolerant system comprised of N components. The components are distingushable, and the state of the system is given by knowing exactly which components are operationl and which have failed. The individual component failure rates depend on the state of the entire system. We assume that the rate at which the system produces income decreases as the system deteriorates and the system replacement cost rises. Individual components cannot be replaced. We give a greedy-type algorithm that produces the replacement policy that maximizes the long-run net system income per unit time.     

Book reviews

Die Faszination des Verrats: Eine Studie zur Dekadenz im Ost‐West Konflikt. By Thomas Noetzel. Hamburg, Junius (1989) DM48.

Les Nations Armées. By Maurice Faivre (Preface by Pierre Messmer), Paris FEDN/Economica (1988).

Insurgency and Terrorism: Inside Modern Revolutionary Warfare. By Bard E. O'Neill, Brassey's (US), Washington, DC (1990), $19.00.

LIC 2010: Special Operations and Unconventional Warfare in the Next Century. By Rod Paschall, Brassey's (US), Washington, DC, $24.00.

Air Power and Colonial Conflict: The Royal Air Force 1919–1939. By D. E. Omissi, Manchester University Press, Manchester and New York (1990), ISBN 0–7190–2960–0. £35.00.

Key to the Sinai: The Battles for Abu Ageila in the 1956 and 1967 Arab‐Israeli Wars. By George W. Gawrych. Combat Studies Institute Research Survey No. 7, US Army Command and General Staff College, Fort Leavenworth, Kansas, 1990. $8.00.

Arms Export Regulations. Edited by Ian Anthony. SIPRI/Oxford University Press, Oxford (1991), ISBN 0–19–829158–2, £25.00.     

复杂形状薄壁零件加工的综合质量控制

首先分析了加工时零件表面热量场和加工参数、余量场之间的关系;利用数字扫描及滤波的方法建立起复杂形面零件的数学模型;以此为基础,在加工过程中,对零件的几何质量和表面层质量进行了综合控制。研究表明,该方法是提高飞行器发动机中高负载复杂形状薄壁零件可靠性和寿命的有效新途径。     

Armed services recruiting research: Issues,findings, and needs

Manning the nation's armed services will continue to be a crucial issue for the remainder of the 1980s. With the projected growth of the services during this decade, the downturn in the 17–21-year-old male population, and the possible upturn in the economy, the ability of the services to meet their respective quality and quantity recruiting goals becomes of central concern. The accurate estimation of the supply for various types of recruits becomes especially important when one views the nearly $1 billion budgeted annually for recruiting and the impact that any military pay raises can have on the DOD's manpower costs of over $40 billion annually. In addition, perceived difficulties in recruiting can impact on weapon systems design decisions, authorized manning levels, and exacerbate the debate concerning the draft; hence, it is clear that few issues today warrant more attention than improving the efficiency and effectiveness of military recruiting. This article provides an introduction and review of some of the key issues involved in modeling and estimating the supply of military recruits. It summarizes and compares the findings of selected econometric models, all of which are based on enlistment experience since the introduction of the All-Volunteer Force in 1973. It also presents some new insights and directions for research dealing with simultaneity, validation, generation of rigorous confidence intervals, and data base selection. It concludes by listing some of the research needs to be addressed in the future.     

A method for reducing coefficients in integer linear inequalities

Approaches are considered for the reduction of coefficients in linear integer inequalities. It is shown that coefficients may be reduced easily in many practical examples. The (0-1) problem is also reconsidered and certain areas of exploration developed.     

The traveling salesman problem: An update of research

During the course of the last few years, attacks on the traveling salesman problem have resulted in a variety of often innovative and rather powerful computational procedures. In this article, we present a review of these results for problems defined on weighted and unweighted graphs. Some account of computational behavior for exact algorithms is provided; however, the primary coverage deals with the strategy of particular procedures. In addition, we include some aspects of nonexact algorithms with major interest confined to the establishment of worst-case bounds.