Turkey’s imperial legacy and the conflict potential in the Balkans

Turkey is the only Eurasian state surrounded in almost a full circle by acute hot or “frozen conflicts,” ranging from low-intensity violence, terrorism to fully fledged wars. The prevailing pattern of intercommunal and interethnic conflicts in the continental Balkans and on Cyprus has long been different from those in the rest of Europe and in the Near East. This difference is closely related to the fact that these lands had experienced in the past centuries-long rule by the Ottoman Empire, whose legal successor is the Republic of Turkey. The intercommunal conflict potential in the rest of Europe used to differ substantially, but the difference has been greatly reduced as Western Europe has, in one respect, become “balkanized.”     

Scheduling combat logistics force replenishments at sea for the US Navy

The Replenishment at Sea Planner (RASP) is saving the U.S. Navy millions of dollars a year by reducing fuel consumption of its Combat Logistics Force (CLF). CLF shuttle supply ships deploy from ports to rendezvous with underway U.S. combatants and those of coalition partners. The overwhelming commodity transferred is fuel, ship‐to‐ship by hoses, while other important packaged goods and spare parts are high‐lined, or helicoptered between ships. The U.S. Navy is organized in large areas of responsibility called numbered fleets, and within each of these a scheduler must promulgate a daily forecast of CLF shuttle operations. The operational planning horizon extends out several weeks, or as far into the future as we can forecast demand. We solve RASP with integer linear optimization and a purpose‐built heuristic. RASP plans Replenishment‐at‐Sea (RAS) events with 4‐hour (Navy watch) time fidelity. For five years, RASP has served two purposes: (1) it helps schedulers generate a daily schedule and animates it using Google Earth, and (2) it automates reports command‐to‐ship messages that are essential to keep this complex logistics system operating.     

HOW THE UNITED STATES HELPED IRAN BUILD A LASER ENRICHMENT LABORATORY

In the spring of 1975, Iran became one of the first states to begin comprehensive research into using lasers for uranium isotope separation. As part of that research, the government sought the expertise of Jeff Eerkens, a leading American specialist in the field. This investigative article tells the story of their relationship: how it began, how it developed, and how it ended, drawing extensively from the authors' personal interviews with Eerkens as well as numerous publications and other interviews.     

Optimal sensor placement for underwater threat detection

The optimization framework for optimal sensor placement for underwater threat detection has been developed. It considers single‐period and multiperiod detection models, each of which includes two components: detection algorithm and optimization problem for sensor placement. The detection algorithms for single‐period and multiperiod models are based on likelihood ratio and sequential testing, respectively. For the both models, the optimization problems use the principle of superadditive coverage, which is closely related to energy‐based and information‐based approaches. An algorithm for quasi‐regular sensor placement approximating solutions to the optimization problems has been developed based on corresponding continuous relaxations and a criterion for its applicability has been obtained. Numerical experiments have demonstrated that the algorithm consistently outperforms existing optimization techniques for optimal sensor placement.© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Pricing bridges to cross a river

We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Optimization of steerable sensor network for threat detection

A Markov chain approach to detecting a threat in a given surveillance zone by a network of steerable sensors is presented. The network has a finite number of predetermined states, and transition from one state to another follows a Markov chain. Under the assumption that the threat avoids detection, two game theoretic problems for finding an optimal Markov chain (two surveillance strategies) are formulated: the first maximizes the probability of threat detection for two consecutive detection periods, whereas the second minimizes the average time of detection for the worst‐case threat's trajectory. Both problems are reduced to linear programming, and special techniques are suggested to solve them. For a dynamic environment with moving noise sources, the optimal Markov chain changes at each detection period, and the rate of convergence of the Markov chain to its stationary distribution is analyzed. Both surveillance strategies are tested in numerical experiments and compared one with another. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Quantitative monitoring of military transformation in the period 1992–2010: Do the protagonists of transformation really change more than other countries?

Military transformation is a complex, slow, asymmetric, changeable, political, and not necessarily completely rational process that clearly needs an effective monitoring mechanism. This paper fills a gap in current literature by creating and testing a model for multi-dimensional and multi-level quantitative monitoring of military transformation applicable in any country. The model is based on 10 transformation indicators that reflect changes in organizational structure, personnel structure, weapon systems, and defense spending. Its application on a sample of seven countries (USA, United Kingdom, France, Netherlands, Poland, Russia, and China) in the period from 1992 to 2010 unexpectedly shows that the USA – a protagonist in the transformation process among allies as well as globally – has carried out the smallest relative change. The non-directed transformation index indicates that Russia carried out 51.8% more change (or 34.1 index units), and the directed index indicates that Poland carried out 157.2% (or 40.8 index units) more change than the USA.