Country survey III — Defence spending in West Germany

This survey article deals with defence spending in West Germany from 1960 on, and the resulting manpower levels and major weapons of the Federal Armed forces, focusing on macro‐economic aspects. Statistics compiled from a variety of published and unpublished sources are presented in 16 tables. An econometric defence‐spending function is derived for the period. For comparison, the equivalent data of East Germany from the last years is also presented. The small set of developments in the next few years that can be predicted firmly are discussed.     

Military Debt: Perspectives from the Experience of Arab Countries

The sectoral production function model of Feder (1983) has been widely used to examine the link between defence spending and economic growth. In this paper, the model, for which too much has been claimed in some past work, is examined, and the case is made for using growth in real non‐defence output rather than growth in real aggregate output (inclusive of military spending) as the dependent variable. Attention is restricted to a small group of OECD countries for which reliable labour force and capital stock (as well as defence) data are obtainable. With non‐defence output as the dependent variable and using only high quality data, no evidence in favour of the underconsumptionist (as opposed to the defence as a burden) position is found.     

JavaKBB:集成框架与产生式规则的专家系统工具

描述了一个专家系统工具JavaKBB,其目标是设计一个容易使用、方便扩展的专家系统开发工具,可以同时表示领域概念知识与过程知识;既可以运行于商用操作系统Windows等,也可以运行于中标麒麟等军用国产操作系统。为此,提出了一种集成框架与产生式规则的知识表示模式,定义了五种抽象层次以设计一个专家系统,包括知识原语、知识单元、知识部件、知识库以及知识系统;在此基础上基于Java语言设计并实现了JavaKBB。JavaKBB的另外一个重要特征是它能以XML格式保存知识库,具备与其他知识库进行交互的潜力。目前,JavaKBB已经用来构建慢性肝炎防治专家系统、装备辅助决策系统等。     

Exact algorithms for integrated facility location and production planning problems

We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Dynamic lot‐sizing model with production time windows

We consider a dynamic lot‐sizing model with production time windows where each of n demands has earliest and latest production due dates and it must be satisfied during the given time window. For the case of nonspeculative cost structure, an O(nlogn) time procedure is developed and it is shown to run in O(n) when demands come in the order of latest production due dates. When the cost structure is somewhat general fixed plus linear that allows speculative motive, an optimal procedure with O(T⁴) is proposed where T is the length of a planning horizon. Finally, for the most general concave production cost structure, an optimal procedure with O(T⁵) is designed. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Multiple common due dates

Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001     

The selection allocation problem

The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999     

Sensitivity analysis on responsive pricing and production under imperfect demand updating

This paper examines three types of sensitivity analysis on a firm's responsive pricing and responsive production strategies under imperfect demand updating. Demand has a multiplicative form where the market size updates according to a bivariate normal model. First, we show that both responsive production and responsive pricing resemble the classical pricing newsvendor with posterior demand uncertainty in terms of the optimal performance and first‐stage decision. Second, we show that the performance of responsive production is sensitive to the first‐stage decision, but responsive pricing is insensitive. This suggests that a “posterior rationale” (ie, using the optimal production decision from the classical pricing newsvendor with expected posterior uncertainty) allows a simple and near‐optimal first‐stage production heuristic for responsive pricing. However, responsive production obtains higher expected profits than responsive pricing under certain conditions. This implies that the firm's ability to calculate the first‐stage decision correctly can help determine which responsive strategy to use. Lastly, we find that the firm's performance is not sensitive to the parameter uncertainty coming from the market size, total uncertainty level and information quality, but is sensitive to uncertainty originating from the procurement cost and price‐elasticity.     

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.     

基于任务冲击条件下弹药生产响应能力研究

在对弹药生产响应能力与生产速度关系分析的基础上,提出了基于任务冲击下,弹药生产响应能力的计算方法。对不同任务冲击度及生产速度约束条件下,弹药生产响应能力系数进行了对比,为任务冲击情况下弹药生产响应能力需求的确定提供参考。