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

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

Modeling multiple stage manufacturing systems with generalized costs and capacity issues

This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Predictability of operational processes over finite horizon

Operational processes are usually studied in terms of stochastic processes. The main information measure used for predictability of stochastic processes is the entropy rate, which is asymptotic conditional entropy, thus not suitable for application over a finite horizon. We use the conditional entropy to study the predictability of stochastic processes over the finite horizon. It is well‐known that the conditional entropies of stationary processes decrease as the processes evolve, implying that, on average, their pasts become more informative about prediction of their future outcomes. Some important operational processes such as martingale, models for maintenance policies, nonhomogeneous Poisson, and mixed Poisson processes are nonstationary. We show that as a nonstationary process evolves, it may provide more information or less information about the future state of the system. We develop results for comparing the predictability of stochastic processes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

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     

Interpreting the Ribchester Helmet

In 1796 a 13-year-old boy playing on wasteland behind his father’s house in Ribchester, Lancashire discovered an assemblage of over 30 Roman artefacts, including a decorated brass helmet. Although partially corroded the Ribchester helmet is a fine example of a first-century AD cavalry sports helmet. This article considers how the interpretation of the helmet has evolved since its discovery. The multi-faceted iconography of the helmet with its mural crown diadem is that of an elite soldier and is paralleled in other examples of cavalry sports helmets of the Ribchester type. The long-neglected imagery on the helmet bowl is reinterpreted and seen not as a haphazard collection of randomly placed combatants but as a highly structured, symmetrical composition specifically designed to be viewed from different directions.     

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.     

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.     

Stochastic linear fractional programming with the ratio of independent Cauchy variates

In this article is studied a stochastic linear fractional programming problem, in which the parameters of both the numerator and the denominator are assumed to be mutually independent Cauchy variates. The deterministic equivalent of the problem is obtained and is shown to be a linear fractional program. A numerical example is also added for illustration.     

Stochastic comparisons for single-server queues

We consider single-server queueing systems with the queue discipline “first come, first served,” interarrival times {u_k, k ≥ l}, and service times {u_k, k ≥ l}, where the {u_k} and {u_k} are independent sequences of non-negative random variables that are independently but not necessarily identically distributed. Let X_k = u_k − u_k (k ≥ 1), S₀ 0, S_n = X₁ + X₂ … + X_n(n≥1). It is known that the (possibly nonhomogeneous) random walk {S_n} determines the behavior of the system. In this paper we make stochastic comparisons of two such systems σ₁,σ₂ whose basic random variables X and X are stochastically ordered. The corresponding random walks are also similarly ordered, and this leads to stochastic comparisons of idle times, duration of busy period and busy cycles, number of customers served during a busy period, and output from the system. In the classical case of identical distributions of {u_k} and {u_k} we obtain further comparisons. Our results are for the transient behavior of the systems, not merely for steady state.