A view from Berlin: Colonel Frederick trench and the development of British perceptions of German aggressive intent, 1906–1910

This essay traces the image of Germany that emerges from the reports of Colonel Frederick Trench (1857–1942), British military attache in Berlin from 1906 to 1910. At this time, the British Army possessed only the most limited intelligence‐gathering apparatus and had to rely heavily on the reports of military attaches for information about their continental rivals. Trench, who believed that Germany planned to wage war against Britain and said so categorically in his reports, was the main source of data on the German Army. From the limited surviving records of who read these reports and how they responded to them, this essay posits that Trench's views contributed to the growing British perception of a German threat, a perception that did much to influence British strategic planning in this period.     

Building A New Luftwaffe: The United States Air Force and Bundeswehr Planning for Rearmament, 1950–60

Rearming Germany was a long and complicated process. It was especially difficult to create a new German air force. The army generals who dominated the Bundeswehr cadre did not even want an air force but rather a small arm air corps. Moreover, Adenauer's defense staff failed to adequately budget or plan for a new air force. As rearmament began, US Air Force leaders, working closely with the small Luftwaffe staff in West Germany's shadow Defense Ministry, basically took charge of the process to ensure that the Germans built a new Luftwaffe on the American model – a large, multipurpose force organized as an independent service and fully integrated into NATO. The first Bundesluftwaffe commanders allied themselves to the Americans, often in opposition to their army comrades, to overcome the political problems caused by Adenauer's poor defense planning and create a modern air force on American lines.     

The survival probability function of a target moving along a straight line in a random field of obscuring elements

A target is moving along a straight-line path. Random portions of the path might be invisible to the hunter (in shadow). Shooting trials are conducted only along the visible segments of the path. An algorithm for the numerical determination of the survival probability of the target is developed. This algorithm is based on the distribution of shadow length, which is also developed. © 1994 John Wiley & Sons, Inc.     

A vertex-closing approach to the p-center problem

This article uses a vertex-closing approach to investigate the p-center problem. The optimal set of vertices to close are found in imbedded subgraphs of the original graph. Properties of these subgraphs are presented and then used to characterize the optimal solution, to establish a priori upper and lower bounds, to establish refined lower bounds, and to verify the optimality of solutions. These subgraphs form the foundation of two polynomial algorithms of complexity O(|E| log |E|) and O(|E|²). The algorithms are proven to converge to an optimum for special cases, and computational evidence is provided which suggests that they produce very good solutions more generally. Both algorithms perform very well on problems where p is large relative to the number of vertices n, specifically, when p/n ≥ 0.30. One of the algorithms is especially efficient for solving a sequence of problems on the same graph.     

A bayes approach to quality control of an M/G/1 queue

This article provides a Bayes approach for the quality control of a production process which is defined by an M/G/1 queue. An inspection procedure which is jointly optimal from the queue's operational characteristics and quality-control perspectives is found using a queue-inspection renewal cycle analysis (with overall expected profit per unit time as the optimization objective). Numerical results are obtained, highlighting the relationships between quality control and (queue-like) production management.     

A one-dimensional infiltration game

Minimax strategies are obtained for an infiltration game in which one player must move through a one-dimensional interval defended by the other player.     

An approximation to the stationary distribution of a multiechelon repairable-item inventory system with finite sources and repair channels

We consider a multiechelon repairable-item inventory system where several bases are supported by a central depot. Unlike METRIC-based models, there are only a finite number of repairmen at each base and the depot, and the failure rates at the bases depend on the current number of items online. The principal objective of this article is to develop a quick and accurate approximation to the steady-state distribution of this system. A secondary objective is to compare the solution of this system with a comparable METRIC solution.     

Product commonality in multiple‐period,make‐to‐stock systems

It is well known that replacing several products by a single common product can reduce required safety stock levels due to the benefits of risk pooling. Recent research utilizing single‐period models has investigated the cost savings (or losses) from doing so. This paper uses a very general multiple‐period model, with general demand distributions, any number of products, and the objective of minimizing production, holding, and shortage costs. Two scenarios are considered—one that utilizes a common product and one that does not. Prior results utilizing single‐period models indicate that even if the common product is more expensive than the products it replaces, there are many circumstances under which it is still worthwhile to employ. Surprisingly, this paper will show that this is almost never the case in a multiple‐period model. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 737–751, 1999     

On scheduling with ready-times,due-dates and vacations

A single machine sequencing problem is considered in which there are ready-time and due-date constraints on jobs and vacation constraints on the machine. Each vacation has fixed starting and finish time and no preemption is allowed for the jobs. The objective is to minimize maximum lateness. An intriguing feature of this formulation is that it allows sequencing in disconnected time windows. A relaxation of the problem is obtained by modeling the vacations as a set of jobs with flexible ready-times and artificial due-dates and a branch and bound algorithm is developed for the problem. In the algorithm, the search is not only guided by the bounds but also by a careful manipulation of the artificial due-dates. Consequently; while searching in the relaxed solution space, solutions of the original problem are implicitly enumerated. Computational results indicate that the algorithm can satisfactorily solve problems with multiple vacations.     

旋转稳定塑料弹体工程设计计算研究

本文以实验结果为依据,首先分析了塑料弹体影响弹丸膛内运动的物理性能,然后结合旋转弹丸的膛内运动特征,经过模拟试验,采用数学拟合法,初步建立旋转稳定弹塑料弹体工程设计计算的数学模型(包括结构尺寸设计计算、强度计算和内弹道计算)。