Putin's Wars: The Rise of Russia's New Imperialism

ABSTRACT

This article discusses the Rhodesian Front regime propaganda warfare strategy during Zimbabwe’s war of liberation. It uses the case of the Chilonga area of Chiredzi located in the south-east of Zimbabwe to demonstrate that propaganda warfare was introduced as a measure to counter guerrilla infiltration and civilian cooperation with them. Drawing on ideas of military anthropology vis-à-vis the importance of cultural awareness in counterinsurgency, the paper argues that the efforts of the Rhodesian Front regime to use propaganda were fruitless. This is because they mostly ignored the culture of the Shangani, local people. Despite that, there were other reasons for the failure of the Rhodesian Front’s propaganda strategy, including the lack of conformity between politics and military action.     

Investment in production resource flexibility: An empirical investigation of methods for planning under uncertainty

We examine several methods for evaluating resource acquisition decisions under uncertainty. Traditional methods may underestimate equipment benefit when part of this benefit comes from decision flexibility. We develop a new, practical method for resource planning under uncertainty, and show that this approach is more accurate than several commonly used methods. We successfully applied our approach to an investment problem faced by a major firm in the aviation information industry. Our recommendations were accepted and resulted in estimated annual savings in excess of $1 million (US). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

CONTRIBUTORS

Russia holds the largest stocks of civilian highly enriched uranium (HEU) of any country, operating more than fifty research reactors, pulsed reactors, and critical assemblies using HEU, as well as nine HEU-fueled icebreakers. Russia's participation in international efforts to phase out civilian HEU is crucial if international HEU minimization efforts are to succeed. Individual Russian institutes and organizations participate in international programs to replace HEU with low-enriched uranium in Soviet-supplied research reactors, develop alternative fuels, and repatriate fresh and spent HEU fuel from third countries. However, an overarching national policy on HEU phase-out has yet to be adopted. There are many obstacles to obtaining such a commitment from Moscow. At the same time, the ongoing reform of the Russian nuclear industry and plans for expansion of domestic nuclear power generation and for increased nuclear exports create opportunities for securing such a commitment.     

Optimal path finding in direction,location, and time dependent environments

This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Transporting jobs through a two‐machine open shop

We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009