Interactions between the experiment designer and the computer

Popularized scientific accounts have publicized the use of the computer for solving combinatorial problems associated with the construction of specific kinds of experiment designs, such as sets of orthogonal Latin squares and Hadamard matrices. Historically, the regular combinatorial properties associated with such designs have been required to obviate extremely tedious calculations required for design analysis. Now computers are generally available for performing these computations, so that interest in regular designs is waning. The experiment designer is now free to select a design for its appropriateness to the experiment and its statistical properties. Once again, he interacts with the computer, using it to evaluate the statistical properties of designs, even before the experiment is carried out. Based on such calculations, he may make a selection from a number of ad hoc designs constructed for a given experiment without regard for combinatorial properties. Although the experiment designer will always be a frequent computer user, the most important interaction between the two will probably be in the application of experiment design to computer simulation. Parametric studies of comprehensive system models that have been programmed for computers can be conducted efficiently and economically with experiment design and the associated analysis techniques. A typical example is given.     

Rendezvous of three agents on the line

This paper considers a three‐person rendezvous problem on the line which was introduced earlier by the authors. Three agents are placed at three consecutive integer value points on the real line, say 1, 2, and 3. Each agent is randomly faced towards the right or left. Agents are blind and have a maximum speed of 1. Their common aim is to gather at a common location as quickly as possible. The main result is the proof that a strategy given by V. Baston is the unique minimax strategy. Baston's strategy ensures a three way rendezvous in time at most 3.5 for any of the 3!2³ = 48 possible initial configurations corresponding to positions and directions of each agent. A connection is established between the above rendezvous problem and a search problem of L. Thomas in which two parents search separately to find their lost child and then meet again. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 244–255, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10005     

Rendezvous search on labeled networks

Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least expected time. We consider continuous and discrete versions, in which they may move at unit speed or between adjacent distinct nodes, respectively. There are two versions of the problem (asymmetric or symmetric), depending on whether or not we allow the players to use different strategies. After obtaining some optimality conditions for general networks, we specialize to the interval and circle networks. In the first setting, we extend the work of J. V. Howard; in the second we prove a conjecture concerning the optimal symmetric strategy. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 256–274, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10011     

“These aren’t the SLOC’s you’re looking for”: mirror-imaging battles of the Atlantic won’t solve current Atlantic security needs

ABSTRACT

Discussion surrounding the announcement of a new NATO Maritime Command for the North Atlantic seems to have settled on the assumption that there is again a vital “sea-line of communication” (SLOC) between North America and Europe as there was supposed to be during the Cold War. The Soviet Union had a large fleet of nuclear and conventional submarines and it seemed very clear that Soviet admirals intended to fight a third “Battle of the Atlantic” in the event of war to prevent Western resupply of NATO. However, this scenario bore no resemblance to what the Soviet Navy actually intended to do in case of war. Changes in technology, notably in submarine propulsion, antisubmarine warfare (ASW), and ballistic missile range and accuracy were the real drivers of the Cold War in the Atlantic. Cruise missile-armed submarines that can attack shore-based economic infrastructure are the real threat from the Russian submarine force.     

Too little,too late: protecting American soft networks in COIN/CT

ABSTRACT

Assistance of local-national partners is necessary to the USA in order to protect its national security interests throughout the world. These partners, typically individuals who support USA diplomats, service members, and non-governmental organizations (NGOs) in non-combatant roles, form USA soft networks. Due to the nature of their work, many of these individuals associated with the policy and actions of the USA become vulnerable to violent threats from adversaries. In fact, adversaries have grasped that attacking USA soft networks is a logical approach for enemies fighting from positions of weakness. As a result, examination of other domains may yield best practices that build resiliency in USA soft networks, thereby cementing national security interests. Further, agency theory illuminates critical principles in the relationships between local-national partners and field practitioners, and informs policy development efforts as a result.