Alternative models of Greek defence expenditures

This paper models and estimates Greek defence spending over the 1950–1989 period. It employs the Stone‐Geary welfare function and estimates levels of defence expenditures by the Engle‐Granger two‐step procedure. The Dickey‐Fuller test regression for cointegration is specified in terms of the significance of additional augmentations. The Deaton‐Muellbauer functional form is then employed and an estimating equation for the expenditure share of defence is derived. This specification is compared with the levels equation through a number of non‐nested tests involving model transformation.     

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.     

Resourcing for defense: Solving the roles and missions puzzle

One of the most important issues facing the post‐Cold War U.S. defense establishment concerns the future allocation of combat tasks and responsibilities among different branches of the armed forces. The challenge is to reduce unnecessary redundancy across roles and missions when resources are highly constrained, without compromising military effectiveness. Defining the policy problem as one of resource allocation rather than operational effectiveness, we develop a methodology for allocating roles and missions. Our methodology focuses at the highest level of force aggregation and uses a mathematical programming model to produce cross‐service cross‐mission trade‐offs that will yield the best total force combat and non‐combat potential within resource consumption constraints.     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

The effectiveness of the longest delivery time rule for the flow shop delivery time problem

In the flow shop delivery time problem, a set of jobs has to be processed on m machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize maximum delivery completion time over all the jobs, where the delivery completion time of a job is the sum of its completion time, and the delivery time associated with that job. In this paper, we prove the asymptotic optimality of the Longest Delivery Time algorithm for the static version of this problem, and the Longest Delivery Time among Available Jobs (LDTA) algorithm for the dynamic version of this problem. In addition, we present the result of computational testing of the effectiveness of these algorithms. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Analysis of a machine repair problem with an unreliable server and phase type repairs and services

In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

一种基于压缩Fisher向量的目标检索方法

当前,视觉词典法(Bo VW,Bag of Visual Words)是解决目标检索问题的主要方法,但传统的Bo VW方法具有词典生成时间效率低、检索内存消耗大等问题。针对这些问题,提出了基于压缩Fisher向量的目标检索方法,该方法首先将Fisher核机制用于目标检索,它能自动降低目标图像背景带来的不利影响,然后,采用位置敏感哈希(LSH,Locality Sensitive Hashing)对Fisher向量进行压缩编码以降低计算复杂度和内存开销,使之适用于大规模数据库。实验结果表明,新方法只用几百比特就能表征一幅图像内容,对大规模目标检索有很好的适用性,且较之当前主流的压缩视觉词典法具有更高的准确率。