Urban gangs evolving as criminal Netwar actors

The nature of conflict and crime is changing. Technology allows groups to spread their influence without regard to geographic limitations. A shift from hierarchies to network organizational forms is also occurring. As a consequence non‐state actors can extend their influence to gain social, political or economic power and challenge state institutions. This article examines the potential for gangs, transnational criminals and terrorists to embrace network forms and utilize technology to wage netwar. Factors which influence ‘third generation’ gang organization (politicization, internationalization and sophistication) are described to illustrate how a net‐based threat can mature. A move toward network organization within transnational criminal organizations and terrorist groups demonstrating the potential for these classic criminal entities to emerge as netwar actors is also reviewed. Finally, the need for state institutions such as the police and military to develop networked responses to combat networked threats is stated.     

Deterrence and overseas stability

The use of conventional armed forces in a deterrent role merits close consideration. Instability in weak or failing states can have global ramifications, while efforts to build stability take time. In principle, conventional deterrence can be used to buy the time required for such stabilization efforts. Attempts at deterrence will, however, need to overcome credibility problems stemming from the technical limitations associated with conventional armed forces, and with the likely requirement for multiple external actors to deter multiple intrastate audiences. While deterrence might work under certain circumstances, it will not play as central a role in strategy as it did during the Cold War.     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Landmarks in defense literature

Some Principles of Maritime Strategy. Julian S. Corbett. Longmans, London, 1911     

War reserve spares kits supplemented by normal operating assets

In peacetime, base stock levels of spares are determined on the assumption of normal resupply from the depot. In the event of war, however, a unit must be prepared to operate from stock on hand for a period of time without being resupplied from the depot. This paper describes a mathematical model for determining such war reserve spares (WRS) requirements. Specifically, the model solves the following kind of optimization problem: find the least-cost WRS kits that will keep the probability of a stockout after K cannibalizations less than or equal to some target objective α. The user of the model specifies the number of allowable cannibalizations, and the level of protection that the kit is supposed to provide. One interesting feature of this model is that in the probability computation it takes into account the possiblility of utilizing normal base operating assets. Results of a sensitivity analysis indicate that if peacetime levels were explicitly taken into account when designing a WRS kit, a cost saving of nearly 40 percent could be effected without degrading base supply performance in wartime.     

A heuristic routine for solving large loading problems

The loading problem involves the optimal allocation of n objects, each having a specified weight and value, to m boxes, each of specified capacity. While special cases of these problems can be solved with relative ease, the general problem having variable item weights and box sizes can become very difficult to solve. This paper presents a heuristic procedure for solving large loading problems of the more general type. The procedure uses a surrogate procedure for reducing the original problem to a simpler knapsack problem, the solution of which is then employed in searching for feasible solutions to the original problem. The procedure is easy to apply, and is capable of identifying optimal solutions if they are found.