Feeding Bread to the Luddites: The Radical Fundamentalist Islamic Revolution in Guerrilla Warfare

This study examines the war that the United States has waged since September 2001 as a global counterinsurgency. Placing the war against al-Qaeda and its allied groups and organizations in the context of a global insurgency also presents implications for doctrine, interagency coordination and military cultural change. The first part of the article offers a distilled analysis of al-Qaeda and its associated networks. The second section examines the US military in the context of the Western way of war, with the attendant military-cultural impediments to adapting to an enemy who embraces a very different approach to war. The third section aims to define and describe the nature of the war that America and its coalition partners are trying to wage. The concluding section offers the most value as it refines and distills the work of several international security and military thinkers to arrive at some imperatives for successfully prosecuting this type of war to its end.     

A Clash of Wills: Hizballah's Psychological Campaign Against Israel in South Lebanon

This article analyzes Hizballah's war against Israel in south Lebanon as a psychological contest where public opinion, perception, and persuasion were the real determinants of victory. Hizballah successfully mobilized popular support for its war by communicating nationalist and religious themes to different sectarian groups in Lebanon. At the same time, it used classic guerrilla warfare as a carefully calibrated psychological tool to erode the morale of Israeli forces, their Lebanese allies, and the Israeli public's support for the war. Hizballah's sophisticated media capability, particularly combat video footage aired on its satellite TV station and the Internet, played a critical role in amplifying the effects of its attrition campaign. By orchestrating information-age media and guerrilla tactics, this strategy has important implications for the future of irregular warfare.     

An American Trojan horse? Eisenhower,Latin America,and the development of us internal security policy 1954–1960

Perceptions of Third World nations as susceptible to communist subversion and revolutionary warfare led the Eisenhower administration to formulate a coordinated internal security strategy known simply as ‘1290d’. Later renamed the Overseas Internal Security Program (OISP), this policy initiative sought to strengthen host‐nation security forces, judicial systems, and public information media in an effort to combat indirect communist intervention strategies. Implementing OISP policy in Latin America proved difficult. In Congress, the administration was criticised for colluding with dictatorial regimes, while Latin Americans feared that the new program would be used as a ‘Trojan Horse’ to penetrate their security structures. After the Cuban Revolution, however, OISP policies developed under Eisenhower came to dominate US‐Latin American security relations for the remainder of the Cold War.     

The Demand for Military Spending in Egypt

Egypt plays a pivotal role in the security of the Middle East as the doorway to Europe and its military expenditure reflects its involvement in the machinations of such an unstable region, showing considerable variation over the last 40?years. These characteristics make it a particularly interesting case study of the determinants of military spending. This paper specifies and estimates an econometric model of the Egyptian demand for military spending, taking into account important strategic and political factors. Both economic and strategic factors are found to play a role in determining military burden/spending, with clear positive effects of lagged military burden, suggesting some sort of institutional inertia, plus negative output and net exports effects. The strategic effect as a result of the impact of Israel’s military burden is mostly positive and significant, though its impact is reduced when the impact of important strategic events are taken into account. The military spending of Egypt’s allies Jordan and Syria generally seems to have had no effect on Egypt’s spending. These results are consistent over a range of econometric techniques.     

Many‐player rendezvous search: Stick together or split and meet?

Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

A continuous-review inventory system with lost sales and variable lead time

Using a system-point (SP) method of level crossings, we derive the stationary distribution of the inventory level (stock on hand) in a continuous-review inventory system with compound Poisson demand, Erlang as well as hyperexponentially distributed lead times, and lost sales. This distribution is then used to formulate long-run average cost functions with/without a service level constraint. Some numerical results are also presented, and compared with the Hadley and Whitin heuristic. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 259–278, 1998