Evaluating the trade‐off between military spending and investment in the United States

Using tests of a single equation model and cointegration techniques, this paper finds no evidence of a long run trade‐off, and some evidence of a short‐run trade‐off, between military spending and investment in post‐World War II United States data. The short‐run trade‐off is confined to the 1949–1971 period, and may be the result of the sharp expansion and contraction of military outlays in connection with the Korean and Vietnam Wars. In addition, cointegration techniques are used to identify a possible long‐run trade‐off between military spending and consumption.     

Military expenditure and economic growth: peru 1970–1996

The present study examines the effects of military expenditure on growth in Peru in the period from 1970 to 1996. By using a Deger‐type Simultaneous Equations Model it is possible to break up the net effect into supply‐ and demand‐side influences. The former consist of positive externalities of defence activities on the other sectors of the economy, while the latter can be described as crowding‐out of civilian investment. Estimations find the supply‐side effects to be insignificantly different from zero, while the crowding‐out effect of defence spending is significant and substantial. It is thereby established that defence expenditure has a negative overall effect on economic growth in Peru. Although several caveats – including specification problems of the Deger model, the quality of the data used, a relatively small sample and the presence of autocorrelation in the estimations – must be considered, these results turn out to be quite robust with respect to estimation methods (3SLS, 2SLS, OLS) and slight modifications to the model. They are also consistent with previous empirical findings from other countries and cross sectional studies.     

The effect of deployment on first‐ and second‐term re‐enlistment in the US active duty force

Why should deployment affect re‐enlistment? In our model, members enter the military with naïve beliefs about deployment and use actual deployment experience to update their beliefs and revise their expected utility of re‐enlisting. Empirically, re‐enlistment is related to the type and number of deployments, consistent with the learning model. Non‐hostile deployment increases first‐term re‐enlistment but hostile deployment has little effect except for the Army, where the effect is positive. Both types increase second‐term re‐enlistment. Interestingly, first‐term members with dependants tend to respond to deployment like second‐term members. In addition, deployment acts directly to affect re‐enlistment, not indirectly through time to promotion.     

Aid versus sanctions for taming oppressors: theory and case study of the Iraqi Kurds

We model an oppressor aiming at victimizing an excluded group in his country, with two main variants. A foreign power affects his behaviour using either conditional aid, subject to the dictator’s participation constraint, or the threat of sanctions, broadly defined, subject to the credibility constraint. The choice between the two is either determined by the latter, or by their relative cost. Aid is preferred when the threat of sanctions is ineffective, and sanctions are too expensive. Sanctions might be imposed, if the threat is ineffective. A case study of the Iraqi Kurds after Iraq was subject to sanctions is presented.     

基于粗糙集理论的武器系统效能评定

简述了各种武器效能评定方法。建立武器参数效能模型,首先要挑选特征参数,这里采用知识约简方法选择武器的特征参数。利用神经网络理论建立了参数效能模型,武器系统的效能与武器特征参数的关系可通过神经网络的阈值和权值得到体现。通过实例对神经网络法与指数法所得的结果进行了比较,结果表明神经网络法比指数法精确。     

基于QFD及粗糙集的保障能力需求满足度评价方法

针对传统能力评价中指标及其权重的确定具有不一致性和不确定性特点,提出了一种以保障能力需求满足度为依据的评价方法。利用由保障能力-保障性能-保障特性映射的质量屋信息,按照构建质量屋的反方向将保障特性满足度转化为保障能力满足度。为了有效处理模糊和不确定的保障特性评价信息,采用粗糙集理论将评价数据表达为粗糙数形式。最后举例验证了方法的有效性。     

Stage life testing

In progressive censoring, items are removed at certain times during the life test. Commonly, it is assumed that the removed items are used for further testing. In order to take into account information about these additional testing in inferential procedures, we propose a two‐step model of stage life testing with one fixed stage‐change time which incorporates information about both the removed items (further tested under different conditions) and those remaining in the current life test. We show that some marginal distributions in our model correspond either to progressive censoring with a fixed censoring time or to a simple‐step stress model. Furthermore, assuming a cumulative exposure model, we establish exact inferential results for the distribution parameters when the lifetimes are exponentially distributed. An extension to Weibull distributed lifetimes is also discussed.     

Case‐based reasoning and improved adaptive search for project scheduling

Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000     

一体化联合作战指挥信息流通体系逻辑结构分析

针对协同性联合作战向一体化联合作战转变对作战指挥产生的影响,在正确定位指挥信息流通体系的基础上,从一体化联合作战的本质特征及对指挥信息流通体系的影响出发,设计了基本作战单元指挥信息输入、输出模型,并通过将作战体系区分为四类模块,得出了指挥信息流通体系的逻辑结构.     

Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility

In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.