Gorshkov's Gambit

This article is a portrait of Admiral Sergei Gorshkov, commander of the Soviet Navy for almost three decades, from 1956–85. The author, a retired US Navy admiral with a Harvard PhD in Russian studies who served as both defense and naval attaché in Moscow, draws on numerous face-to-face interactions with Gorshkov. He also explores Gorshkov's memoirs that were published recently in Russia but have not appeared in an English translation. The paper is not only a first-hand account of an important historical figure, but also a window into the world of military-to-military diplomacy and intelligence during the Cold War.     

Local defence forces and counterinsurgency in Afghanistan: learning from the CIA's Village Defense Program in South Vietnam

Some scholars would have us believe that the distinctions between military and policing roles, methods and objectives have become increasingly blurred by the security demands of a post-Cold War and post-11 September global and domestic order. This article explores the current state of the police–military divide through a conceptual and case study analysis. It concludes that, in this case, there is some conflation occurring at a macro-level as international and domestic affairs have become increasingly indistinct, but the article also demonstrates that the actual ethos and practice of these agencies still differs strongly. Most importantly, the article argues that this distinction is in fact a very useful one in planning for future peace support operations     

Effect of friction stir processing on mechanical properties and heat transfer of TIG welded joint of AA6061 and AA7075

Tungsten inert gas (TIG) welding is the most commonly used joining process for aluminum alloy for AA6061 and AA7075 which are highly demanded in the aerospace engineering and the automobile sector, but there are some defects occur during TIG welding like micro-crack, coarse grain structure, and porosity. To improve these defects, the TIG welded joint is processed using friction stir processing (FSP). This paper presents the effect of friction stir processing on TIG welding with filler ER4043 and ER 5356 for dissimilar aluminum alloy AA6061 and AA7075. The mechanical characterization, finite element formulation and mathematical equations of heat transfer of TIG + FSP welded joints are investigated using ANSYS Fluent software by adjusting process parameters of FSP. The results show that the maximum compressive residual stress 73 MPa was obtained at the fusion zone (FZ) of the TIG weldment with filler ER4043, whereas minimum compressive residual stress 37 MPa was obtained at stir zone (SZ) of the TIG+FSP with filler 5356. The maximum heat flux 5.33 × 106 W/m2 and temperature 515 ℃ have observed at tool rotation 1600 rpm with a feed rate of 63 mm/min. These results give a satisfactory measure of confidence in the fidelity of the simulation     

Algorithms for solving the conditional covering problem on paths

Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Production/distribution system design with inventory considerations

This study addresses the design of a three‐stage production/distribution system where the first stage includes the set of established retailers and the second and third stages include the sets of potential distribution centers (DCs) and potential capacitated suppliers, respectively. In this problem, in addition to the fixed location/operating costs associated with locating DCs and suppliers, we consider the coordinated inventory replenishment decisions at the located DCs and retailers along with the appropriate inventory costs explicitly. In particular, we account for the replenishment and holding costs at the retailers and selected DCs, and the fixed plus distance‐based transportation costs between the selected plants and their assigned DCs, and between the selected DCs and their respective retailers, explicitly. The resulting formulation is a challenging mixed‐integer nonlinear programming model for which we propose efficient heuristic solution approaches. Our computational results demonstrate the performance of the heuristic approaches as well as the value of integrated decision‐making by verifying that significant cost savings are realizable when the inventory decisions and costs are incorporated in the production distribution system design. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 172–195, 2012     

A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

A mathematical programming approach for improving the robustness of least sum of absolute deviations regression

This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Emulating US Counterinsurgency Doctrine: Barriers for Developing Country Forces,Evidence from Peru

ABSTRACT

Recent US advances in counterinsurgency doctrine have been adopted by developing country armed forces. Nevertheless, no systematic study has examined the barriers they face to implementing highly involved counterinsurgency strategy. Tracing the evolution of Peruvian doctrine demonstrates that Peru was able to quickly improve the unity of effort, intelligence capacity, and military basing to meet the demands of a population-centric hearts-and-minds approach to counterinsurgency. Nevertheless, the limited tactical initiative and flexibility of Peruvian forces remains a challenge. The Peruvian experience is instructive for other militaries undergoing similar transitions. However, given the diversity of insurgent conflicts, this doctrine is not universally appropriate.