It's all the rage: why mechanization doesn't explain COIN outcomes

A recent article, ‘Rage Against the Machines’, does a disservice to the debate over what explains counterinsurgency (COIN) success. While it establishes a negative correlation between the diffusion of military mechanization in the state system and COIN success, its theoretical argument does not hold up under close scrutiny and its micro-case comparison of two units in Iraq during 2003–2004 ignores obvious counter-examples and factors that influence COIN success, such as leadership. A deeper inquiry would have revealed that there is much more to COIN success than simply not having access to vehicles.     

Factors influencing military recruitment in South Africa: the voices of Cape Town high school learners

This research sets out to establish how the youth in South Africa view military service, and what factors affect the ability of the South African National Defence Force (SANDF) to attract suitable recruits to staff its modern, technologically advanced military. Due to high levels of youth unemployment, South Africa has sufficient persons volunteering for military service. The problem lies with recruiting sufficient quality personnel with the right profile and abilities. To establish what affects enlistment, focus group discussions were conducted with learners from eight schools to determine what influences their career choices, what deters them from or attracts them to military service, their perception of the military profession, their knowledge of the military, and the influence of factors such as race and gender. The conclusion is reached that the SANDF is not considered an employer of choice due to poor service conditions, a decline in the prestige of the military, unfavourable aspects associated with military culture, a growing ‘knowledge gap’ and disconnect between the military and South African society, the estrangement of certain race groups, and the masculine nature of the military. These aspects need to be addressed if the SANDF wishes to attract learners with good academic credentials.     

Quadratic bottleneck problems

We study the quadratic bottleneck problem (QBP) which generalizes several well‐studied optimization problems. A weak duality theorem is introduced along with a general purpose algorithm to solve QBP. An example is given which illustrates duality gap in the weak duality theorem. It is shown that the special case of QBP where feasible solutions are subsets of a finite set having the same cardinality is NP‐hard. Likewise the quadratic bottleneck spanning tree problem (QBST) is shown to be NP‐hard on a bipartite graph even if the cost function takes 0–1 values only. Two lower bounds for QBST are derived and compared. Efficient heuristic algorithms are presented for QBST along with computational results. When the cost function is decomposable, we show that QBP is solvable in polynomial time whenever an associated linear bottleneck problem can be solved in polynomial time. As a consequence, QBP with feasible solutions form spanning trees, s‐t paths, matchings, etc., of a graph are solvable in polynomial time with a decomposable cost function. We also show that QBP can be formulated as a quadratic minsum problem and establish some asymptotic results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

On the bivariate negative binomial distribution of mitchell and paulson

The bivariate negative binomial distribution of Mitchell and Paulson [17] for the case b = c = 0 is shown to be equivalent to the accident proneness model of Edwards and Gurland [4] and Subrahmaniam [19,20]. The diagonal series expansion of its joint probability function is then derived. Two other formulations of this distribution are also considered: (i) as a mixture model, which showed how it arises as the discrete analogue to the Wicksell-Kibble bivariate gamma distribution, and (ii) as a consequence of the linear birth-and-death process with immigration.     

A simple Markov model for the analysis of multiple air combat

It is proposed to describe multiple air-to-air combat having a moderate number of participants with the aid of a stochastic process based on end-game duels. A simple model describing the dominant features of air combat leads to a continuous time discrete-state Markov process. Solution of the forward Kolmogorov equations enables one to investigate the influence of initial force levels and performance parameters on the outcome probabilities of the multiple engagement. As is illustrated, such results may be useful in the decision-making process for aircraft and weapon system development planning. Some comparisons are made with Lanchester models as well as with a semi-Markov model.     

The discrete max-min problem

The historic max-min problem is examined as a discrete process rather than in its more usual continuous mode. Since the practical application of the max-min model usually involves discrete objects such as ballistic missiles, the discrete formulation of the problem seems quite appropriate. This paper uses an illegal modification to the dynamic programming process to obtain an upper bound to the max-min value. Then a second but legal application of dynamic programming to the minimization part of the problem for a fixed maximizing vector will give a lower bound to the max-min value. Concepts of optimal stopping rules may be applied to indicate when sufficiently near optimal solutions have been obtained.