Constructive Ambiguity and the Peace Process in Northern Ireland

The Belfast Agreement of 1998 was hailed at the time as a breakthrough in conflict resolution both in Northern Ireland and as a model for international emulation. In fact it has turned out to be neither; rather it has been a sad exercise in surrendering to terrorism and the cause of increased sectarian segregation and enmity. The core of the problem lies in the 'constructive ambiguity' at the heart of the Agreement - that is, a form of words that all could sign up to because each party could interpret them differently. This may have enabled everyone to sign up, but also implied they were signing up to different things and therefore were not in agreement. Consequently clever word games and spin by politicians and senior civil servants have created an, in some ways, worse situation, largely because real, substantive issues were ducked. This in turn has its roots in postmodernism, whose baleful influence can be seen throughout not only the Agreement but most government policy over the past 20 odd years.     

A robust policy for serial agile production systems

One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

开放架构的数字视频管理系统iView研究与实现

iView是我们研制的基于多模态元数据提取,具有开放架构且支持无线移动存取的数字视频全内容管理系统。本文讨论了系统的需求,体系框架设计实现,描述了其中涉及的关键技术思想,并对存在的问题和研究方向做了简单探讨。     

Majority rule,minority issues: The Macedonian question in the Dekemvriana

This article examines the role of the Macedonian Question in the 1944 December Uprising (Dekemvriana) in Greece. While the Dekemvriana is commonly portrayed in right–left terminology in the historiography, this article argues that part of the reason for the left’s failure was their inability to manage the Macedonian ethnic component of the struggle, either within their armed forces or in their relationship with Yugoslavia. As such, this article integrates the early phases of the Greek Civil War into the broader literature on minorities in civil conflict, while simultaneously exposing some of the myths about Macedonian involvement that result from its contemporary political ramifications.     

On the busy period of the M/G/1 retrial queue

The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of the M/G/1$ retrial queue. The structure of the busy period and its analysis in terms of Laplace transforms have been discussed by several authors. However, this solution has serious limitations in practice. For instance, we cannot compute the first moments of L by direct differentiation. This paper complements the existing work and provides a direct method of calculation for the second moment of L. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 115–127, 2000     

A single‐period inventory placement problem for a serial supply chain

This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001