The sources of the Australian tradition in irregular warfare, 1942–1974

This article had its genesis in a background study for the development of a new Australian Army counter-insurgency doctrine. Archival research showed that the Australian counter-insurgency doctrine employed in such post-1945 conflicts as Burma, Malaya, Borneo and Vietnam originated in the jungle campaigns of the South West Pacific Area during World War II. The historical record also showed that the Army's counter-insurgency doctrine, as with its World War II-jungle warfare doctrine, was a pragmatic amalgam of Australian experience and British doctrine. The article traces this process through the development of a series of doctrine manuals. It also considers the contribution of key individuals to both counter-insurgency theory and practice. This distinctively Australian approach to the development of doctrine was responsible for producing a highly successful manual, The Division in Battle: Pamphlet No. 11, Counter-Revolutionary Warfare (DIB 11), which the Army used during its involvement in Vietnam.     

Croatia's bitter harvest: Total National Defence's role in the Croatian War of Independence

Croatia's successful bid for independence was one of the defining moments of the immediate post-Cold War period. Nevertheless, the means that Croatia used to obtain independence remains relatively unexamined by academics. This article focuses on the early period of Croatia's bid for secession, and specifically the role that Yugoslavia's policy of Total National Defence played in facilitating its independence. Unlike in Slovenia, where the legacies of Total National Defence facilitated Slovenia's bid for secession, in Croatia the decision of its political leaders meant that the country largely neglected its positive legacies, resulting in a protracted four-year struggle.     

面向混部云失败批处理作业的预测算法

为了降低混部云失败批处理作业的风险,使用K-means聚类算法将批处理作业分为四类,在分类的基础上提出了二层嵌套分类模型(two-layer nested classification model, TLNM),实现了基于TLNM的预测算法。基于Ali Trace 2018数据集上的实验结果表明,该算法的接受者操作特性(receiver operating characteristic, ROC)曲线明显优于其他常用分类器,ROC曲线下面积(即AUC)可以达到0.978,表明该算法具有良好的分类性能。同时召回率可以达到0.951,通过混淆矩阵可以看出TLNM算法能够准确预测出执行失败的批处理作业。     

An efficient primal approach to bottleneck transportation problems

This article addresses bottleneck linear programming problems and in particular capacitated and constrained bottleneck transportation problems. A pseudopricing procedure based on the poly-ω procedure is used to facilitate the primal simplex procedure. This process allows the recent computational developments such as the Extended Threaded Index Method to be applied to bottleneck transportation problems. The impact on problem solution times is illustrated by computational testing and comparison with other current methods.     

Target selection in Lanchester combat: Linear-law attrition process

We develop the solution to a simple problem of target selection in Lanchester combat against two enemy force types each of which undergoes a “linear-law” attrition process. In addition to the Pontryagin maximum principle, the theory of singular extremals is required to solve this problem. Our major contribution is to show how to synthesize the optimal target selection policies from the basic optimality conditions. This solution synthesis methodology is applicable to more general dynamic (tactical) allocation problems. For constant attrition-rate coefficients we show that whether or not changes can occur in target priorities depends solely on how survivors are valued and is independent of the type of attrition process.