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.     

The Persistent Deficit of Militia Officers in the Swiss Armed Forces: An Opportunity Cost Explanation

The Swiss Armed Forces are suffering from a structural deficit of militia officers despite good pay and a general supportive attitude in the population. Whereas, prior studies have focused on motivation to explain understaffing in armed forces, we offer an alternative approach based on opportunity cost. We model decision alternatives both within and outside a military organization, taking private sector employment as the reference point. We then monetize opportunity costs of leisure, fringe benefits, and private sector income not compensated. Our results suggest that in terms of opportunity cost, service as a militia officer is the least attractive option, an effect that we believe explains the persistent staff deficit. Implications of these findings for the literature and recruitment policy are discussed.     

Israel’s Security Nexus as Strategic Restraint: The Case of Iran 2009–2013

This article examines the debates in Israel between 2009 and 2013 over Iran’s nuclear programme as a reflection of a particular type of civil–military or civil–security relationship. It analyses how key actors within that relationship – particularly those with an intelligence background – engaged with media outlets in Israel and further afield to influence domestic and international opinion over how best to contain Iran’s nuclear ambitions. In so doing, it seeks to address one fundamental question: are governments in Jerusalem any longer the final arbiters over deciding what is in the national security interests of the State of Israel?     

Violence in context: Mapping the strategies and operational art of irregular warfare

The malaise that the United States, and the West, have experienced in recent campaigns stems in large part from unclear thinking about war, its political essence, and the strategies needed to join the two. Instead, analysis and response are predicated on entrenched theoretical concepts with limited practical utility. The inadequacy of understanding has spawned new, and not so new, terms to capture unanticipated trends, starting with the re-discovery of “insurgency” and “counterinsurgency” and leading to discussion of “hybrid threats” and “gray-zone” operations. New terminology can help, but the change must go deeper. Challenging analytical orthodoxy, this article sets out a unifying approach for the study of political violence, or more accurately: violent politics. It provides a conceptual foundation that helps to make sense of recent shifts in warfare. In effect, it offers sorely needed theoretical insights into the nature of strategy and guides the process of responding to nontraditional threats.     

Crisis stability games

This article investigates the problem of crisis stability in the context of conventional and nuclear warfare, with emphasis on the incentives for one or both sides to engage in a preemptive nuclear strike. The approach is to offer two enriched versions of a recently developed model of escalation, to solve the models, and to observe that game-theoretic solutions can change from nonpreemption to preemption, depending upon the specific game structure and upon the values of the parameters describing the outcomes. © 1993 John Wiley & Sons, Inc.     

On scheduling with ready-times,due-dates and vacations

A single machine sequencing problem is considered in which there are ready-time and due-date constraints on jobs and vacation constraints on the machine. Each vacation has fixed starting and finish time and no preemption is allowed for the jobs. The objective is to minimize maximum lateness. An intriguing feature of this formulation is that it allows sequencing in disconnected time windows. A relaxation of the problem is obtained by modeling the vacations as a set of jobs with flexible ready-times and artificial due-dates and a branch and bound algorithm is developed for the problem. In the algorithm, the search is not only guided by the bounds but also by a careful manipulation of the artificial due-dates. Consequently; while searching in the relaxed solution space, solutions of the original problem are implicitly enumerated. Computational results indicate that the algorithm can satisfactorily solve problems with multiple vacations.     

When is greedy module assembly optimal?

Many coherent systems are configurations of identically structured modules, each consisting of a number of different components. The objective is to assemble the modules out of a collection of available components, and to install the modules in the system in a way that maximizes reliability. The greedy assembly rule builds one module out of the best available components, another out of the best remaining components, and so on. This article shows that greedy assembly is optimal whenever the modules have a series structure, no matter what the structure of the system in which the modules will be used might be, provided that the modules, once assembled, are installed in the system in an optimal way. The article also demonstrates that series modules are unique in this regard.     

The frequency assignment problem: A solution via nonlinear programming

This paper gives a mathematical programming model for the problem of assigning frequencies to nodes in a communications network. The objective is to select a frequency assignment which minimizes both cochannel and adjacent-channel interference. In addition, a design engineer has the option to designate key links in which the avoidance of jamming due to self interference is given a higher priority. The model has a nonconvex quadratic objective function, generalized upper-bounding constraints, and binary decision variables. We developed a special heuristic algorithm and software for this model and tested it on five test problems which were modifications of a real-world problem. Even though most of the test problems had over 600 binary variables, we were able to obtain a near optimum in less than 12 seconds of CPU time on a CDC Cyber-875.     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003