美国陆军随军牧师制度发展简史

一、美国陆军随军牧师制度的早期形成与发展(一)随军牧师制度溯源如要探寻美国陆军随军牧师制度的源头,可以追溯到悠远的历史深处。每当出现骚乱、危急和恐怖的时刻,人类总是寄希望于宗教和宗教人士,以获得安慰。战争时期也不例外。在发生战争冲突的时期,无论是古代社会,还是现代社会,人们都会转而求助于宗教。公众总是期望把宗教的抚慰同样传递给那些在战场上服役的士兵们。从人们已知的有文字记载之前的社会开始,祭司和其他宗教人士或许就在为战争的胜利而祈求上帝或众神的保佑了。《旧约》中就常提及随军参战的祭司(priests)。在《摩西五…     

Production‐inventory systems with imperfect advance demand information and updating

We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Single machine sequencing with random processing times and random due-dates

A single machine scheduling problem in which both the processing times and due-dates of the jobs awaiting servicing are random variables is analyzed. It is proved that the properties of the shortest processing time rule and the due-date rule which are known for the deterministic situation also hold in the probabilistic environment when they are suitably, and reasonably, refined for this context.     

An inventory problem with obsolescence

A stochastic single product convex cost inventory problem is considered in which there is a probability, π_j, that the product will become obsolete in the future period j. In an interesting paper, Barankin and Denny essentially formulate the model, but do not describe some of its interesting and relevant ramifications. This paper is written not only to bring out some of these ramifications, but also to describe some computational results using this model. The computational results show that if obsolescence is a distinct possibility in the near future, it is quite important that the probabilities of obsolescence be incorporated into the model before computing the optimal policies.     

A simulated port facility in a theatre of operations

A hypothetical port facility in a theatre of operations is modeled and coded in a special purpose simulation language, for the purpose of conducting simulation experiments on a digital computer. The experiments are conducted to investigate the resource requirements necessary for the reception, discharge, and clearance of supplies at the port. Queue lengths, waiting times, facility utilizations, temporary storage levels, and ship turn-around times are analyzed as functions of transportation and cargo handling resources, using response surface methodology. The resulting response surfaces are revealing in regard to the sensitivity of port operations to transportation resource levels and the characteristics of the port facility's load factor. Two specific conclusions of significant value are derived. First, the simulation experiments clearly show that the standard procedures for determining discharge and clearance capacities take insufficient account of the effects of variability. Second, the response surfaces for ship turn-around times and temporary storage levels indicate that an extremely steep gradient exists as a function of troop levels.     

Initial point search on weighted trees

An initial point search game on a weighted graph involves a searcher who wants to minimize search and travel costs seeking a hider who wants to maximize these costs. The searcher starts from a specified vertex 0 and searches each vertex in some order. The hider chooses a nonzero vertex and remains there. We solve the game in which the graph is a simple tree, and use this solution to solve a search game on a tree in which each branch is itself a weighted graph with a certain property, and the searcher is obliged to search the entire branch before departing. © 1994 John Wiley & Sons, Inc.     

Land power in the age of joint interdependence: toward a theory of land power for the twenty-first century*

This essay outlines a theory of land power. After explaining the absence of such a theory, the article establishes the modern context for such a theory, specifically within the concept of joint interdependence. The analysis defines key terms and premises behind the theory, to include a definition of land power. The argument then outlines the national elements of power that contribute to a theory of land power. The analysis next applies the theory to the fundamental purposes of military power: defeat, deter, compel, assure, shape and support to the nation. The analysis then tests key definitions, supporting premises, and utility of the theory. The essay argues that historical experience validates the applicability and utility of the theory, and offers a solid basis for extrapolating the validity of the theory into the near future.