Imperial nostalgia,the liberal lie,and the perils of postmodern counterinsurgency

Since 9/11, counterinsurgency is back in fashion; the ‘war on terror’ has even been branded a ‘global counterinsurgency’. However the context within which counterinsurgency originally arose is critical to understanding the prospects for its present success; the radically changed environment in which it is currently being conducted casts into considerable doubt the validity of the doctrine's application by many national militaries currently ‘rediscovering’ this school of military thought today. Above all, classical counterinsurgency was a profoundly imperial, state-centric phenomenon; consequently it only rarely faced the thorny issue of sovereignty and legitimacy which bedevils and may doom these same efforts today.     

The African warlord revisited

To date, warlordism in Africa has been viewed solely negatively. This has come about, in part, because of the analytical lenses that have been used. Typically, warlordism has been examined at the state level; and behavioural traits, rather than definitionally necessary components, have been the focus. In effect, ‘warlord’ has been confused with other violent actors. I suggest here a reconceptualisation ‘from below’, which takes into account variation in types of warlordism, and which allows for both positive and negative effects of warlordism on society and the state.     

CORRUPTION,PERCEPTION AND FOREIGN DIRECT INVESTMENT

Bribery undermines human development and a transition to stable democratic rule. It props up illegitimate regimes as corporations bid for contracts by bribing, in a seeming race to the bottom. The world's wealthy are slowly waking up to this and criminalising this scandalous practice of bribing foreign public officials. However, such measures, if enforced, need to be combined with domestic anti-corruption strategies in the South. If this opportunity is missed, the risk of investing private capital in marginalised economies perceived to be highly corrupt is further upped, making investment-driven economic growth possibly even less unattainable.     

THE AU MISSION IN BURUNDI

Abstract

Even though the Movimento Popular de Libertação de Angola (Popular Movement for the Liberation of Angola, MPLA) managed to take firm control of the state as the war ended in 2002, this article contends that its hegemony is not absolute. At the fringes of the state administration, emerging regional elites have established associations that seek to provide a remedy against the centralised system, which essentially deprives regions of political influence and sufficient economic resources. As in many other countries on the African continent, political identities that were legally enforced and institutionally reproduced in colonial times have hardly been transcended in the post-colonial period. Even if the associations' influence today does not yet reach further than bringing some insecurity to an otherwise secure polity dominated by the MPLA, the associations could play a role in reinforcing strong regional solidarity and give political expression to feelings of exclusion. Such sentiments could in turn lead to an increase of exclusivity ideas about citizenship, or even xenophobic violence. Much will depend on the strategies of the MPLA, and to what extent it will accommodate these emergent forces in the post-war era, not the least through the current sub-national state reforms.     

POLITICAL SURVIVAL AND NUCLEAR PROLIFERATION

Nuclear Logics: Contrasting Paths in East Asia and the Middle East, by Etel Solingen. Princeton University Press, 2007. 404 pages, $26.95.     

基于对抗的防空体系结构演化性概念建模

为定量研究空防体系对抗过程,基于对空防体系对抗相关研究方法分析,提出从体系结构角度研究空防体系对抗.通过阐述对抗条件下的防空体系结构演化性建模思想,提出空防体系对抗实质是一个防空体系结构“动态编成—对抗消耗—优化修复”动态循环演化过程.在此基础上,围绕其中3个环节进行防空体系结构演化性概念建模,以此为空防体系对抗定量建模研究提供一种新思路.     

装备寿命预测的平行仿真模型在线演化方法

在面向装备剩余寿命预测的平行仿真技术研究基础上,统一了不同退化状态下的状态方程,提出了预测模型形态库的构建方法和预测模型形态选择算法,设计了“模型形态库构建—模型选择—数据同化—模型演化”的模型在线演化工作流程,运用扩展卡尔曼滤波和极大似然估计算法,实现了面向装备剩余寿命预测的平行仿真模型在线动态演化。通过仿真实验验证了模型形态选择算法和模型在线演化工作流程的有效性,取得了较好的仿真效果。     

比例最小偏度单形UKF的RBF神经网络算法

为提高RBF神经网络的建模性能,提出一种基于改进无迹Kalman滤波(UKF)的RBF神经网络训练算法。在该算法中,首先将比例最小偏度单形Sigma点采样策略引入UT,以有效改进UKF,提升其计算效率,然后利用改进的UKF优化估计RBF神经网络的最优参数。仿真结果表明,改进的UKF比EKF具有更高的RBF神经网络模型训练精度,与传统UKF的模型精度大体相当,但速度更快,计算效率更高。     

The probability of the existence of a feasible flow in a stochastic transportation network

Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016     

一个具有相互独立、不同分布服务时间序列的排队模型

讨论的排队模型 ,放宽了GI/G/1系统中“服务时间独立同分布”的限制 ,只要求各服务时间相互独立 ,因而较GI/G/1排队模型能更合理地拟合实际问题 .在此较宽的条件下 ,利用补充变量的方法 ,求得了该排队系统队长的瞬时分布