Moving the techno-science gap in Security Force Assistance

This paper looks at the impact of military technology diffusion on military assistance operations (MAO), in the United States known as Security Force Assistance or SFA. The discussion looks conceptually at the role of technological change and how it interacts with martial cultures in military assistant operations. I argue that growing trends in science and technology suggest potential conflicts between culture and technology. Relying on a culture-technology model drawn from anthropology, the paper contends that new technologies will present increasing challenges for the emerging MAO landscape. The paper will illustrate that the techno-science gap will continue to grow as innovations such as robotics, sensors, and networks continue to develop. Finally, the paper will look at ways to overcome this conflict between culture and technology.     

Geopolitical Risks and Movements in Islamic Bond and Equity Markets: A Note

This study applies a non-parametric causality-in-quantiles test to examine the causal effect of geopolitical risks on return and volatility dynamics of Islamic equity and bond markets. Geopolitical risks are generally found to impact Islamic equity market volatility measures, rather than returns. However, geopolitical risks tend to predict both returns and volatility measures of Islamic bonds. Interestingly, causality, when it exists for returns and/or volatility of Islamic equities and bonds, is found to hold over entire conditional distributions of returns and volatilities, barring the extreme ends of the same.     

Late Medieval Lance Use: Mounted Combat and Martial Arts in Western Europe from the 14th to the 16th Century

Despite the lance’s status and the amount of attention the couched lance has received in historiography, study of its martial art has been neglected. The various lance types and techniques used by western European cavalry have only recently begun to receive scholarly attention. Additionally, Medieval European lance use has too often been studied in isolation, without an adequate understanding of the idiosyncratic and asymmetrical dynamics of mounted combat. Although the charge with the couched lance was a valid tactic, it was only one of many. Light and heavy lances were used in one hand or two to trip, block, unhorse, and wrestle. These techniques were governed by the harsh laws of distance, speed, impact, iron, and asymmetry. By utilizing the surviving Fechtbücher and several Peninsular and Near Eastern sources, a brief foray into the diverse techniques of lance use and their purposes has been attempted here.     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.     

Scheduling target illuminators in naval battle-group anti-air warfare

We schedule a set of illuminators (homing devices) to strike a set of targets using surface-to-air missiles in a naval battle. The task is viewed as a production floor shop scheduling problem of minimizing the total weighted flow time, subject to time-window job availability and machine downtime side constraints. A simple algorithm based on solving assignment problems is developed for the case when all the job processing times are equal and the data are all integer. For the general case of scheduling jobs with unequal processing times, we develop two alternate formulations and analyze their relative strengths by comparing their respective linear programming relaxations. We select the better formulation in this comparison and exploit its special structures to develop several effective heuristic algorithms that provide good-quality solutions in real time; this is an essential element for use by the Navy. © 1995 John Wiley & Sons, Inc.     

The evolution of a selection system

The article is a case study. It describes the initialization and subsequent modifications of the selection process used for the annual Award for Excellence in Teaching at the Naval Postgraduate School (NPS). The method treats highly unbalanced data and utilizes some exploratory data analysis techniques in interesting ways. It leads to a defensible choice for a winner in a very messy setting. The award designates a faculty member as “teacher of the year” and includes a stipend of substantial value. The recipient is chosen by a committee which reviews objective information summarized from ballots submitted by franchised voters. The issues encountered have some general content and the handling of a number of them may have broader interest. ©John Wiley & Sons, Inc.

1 This article is a US Government work and, as such, is in the public domain in the United States of America.

     

Due-date assignment and early/tardy scheduling on identical parallel machines

This article examines the problem of simultaneously assigning a common due date to a set of independent jobs and scheduling them on identical parallel machines in such a way that the costs associated with the due date and with the earliness or tardiness of the jobs are minimized. We establish that, for certain values of the due-date cost, an optimal schedule for this problem is also optimal for an early/tardy scheduling problem studied by Emmons. We discuss the solution properties for the two problems, and show that both problems are NP-hard even for two machines. We further show that these problems become strongly NP-hard if the number of machines is allowed to be arbitrary. We provide a dynamic programming solution for the problems, the complexity of which indicates that the problems can be solved in pseudopolynomial time as long as the number of machines remains fixed. Finally, we present the results of a limited computational study. © 1994 John Wiley & Sons, Inc.     

A penalty for concave minimization derived from the tuy cutting plane

A wide variety of optimization problems have been approached with branch-and-bound methodology, most notably integer programming and continuous nonconvex programming. Penalty calculations provide a means to reduce the number of subproblems solved during the branch-and-bound search. We develop a new penalty based on the Tuy cutting plane for the nonconvex problem of globally minimizing a concave function over linear constraints and continuous variables. Computational testing with a branch-and-bound algorithm for concave minimization indicates that, for the problems solved, the penalty reduces solution time by a factor ranging from 1.2 to 7.2. © 1994 John Wiley & Sons, Inc.     

On the timing of adoption of multiproduct technologies

This article examines a game of multiproduct technology adoption. We consider a duopoly model in which firms choose when to switch from a traditional single-product technology to a more flexible and more expensive multiproduct technology. The multiproduct technology allows a firm to invade the other firm's market, creating a more competitive environment and reducing profits. We analyze this investment decision as a game of timing using two different equilibrium concepts. First, we utilize the “silent” equilibrium concept, where firms commit at time zero to a switching time. This concept would be applicable to situations where firms cannot observe each other's actions, or when the implementation of the technology requires long lead times and the investment decision is private information. Using this notion we find that both firms adopt the multiproduct technology simultaneously within a certain time interval. We then characterize this time interval in terms of cost and demand conditions. We also derive conditions under which sequential adoption of the multiproduct technology occurs. The second concept used is that of noisy equilibrium, where firms cannot precommit themselves to an adoption time. This concept is appropriate when investment decisions are common knowledge. In this case a firm can credibly threaten to immediately follow suit if the other firm decides to adopt. This threat is sufficient to ensure the collusive outcome where neither firm adopts the flexible technology. © 1994 John Wiley & Sons, Inc.