How do wars end? A multidisciplinary enquiry

ABSTRACT

The cessation of military confrontations rarely coincides with the end of war. Legal and political matters continue after the last shot has been fired, civilians driven from their homes try to rebuild their houses and their lives, veterans need to adapt to their new role in civil society, and the struggle to define the history and the significance of past events only begins. In recent years, in particular, the changes in the character of contemporary warfare have created uncertainties across different disciplines about how to identify and conceptualise the end of war. It is therefore an opportune moment to examine how wars end from a multidisciplinary perspective that combines enquiries into the politics of war, the laws of war and the military and intellectual history of war. This approach enables both an understanding of how ‘the end’ as a concept informs the understanding of war in international relations, in international law and in history and a reconsideration of the nature of scientific method in the field of war studies as such.     

A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal

The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

论按要素分配与按劳分配

十六大明确了新的分配原则即“生产要素按贡献参与分配原则”,这是我国收入分配理论和政策方面的革命性突破。弄清楚这一原则的确切含义、实施原因、分配形式、实现途径以及它与按劳分配之间的关系,对充分调动社会各方面的积极性,优化资源配置,切实保障广大群众的切身利益有着十分重大的意义。     

基于数字地形分析的智能兵力部署

兵力部署是指挥员组织实施战斗的重要工作,也是实现战斗决心的重要条件。在分析兵力部署原则基础上,结合兵种配置的地形条件和战术条件,提出了兵力部署适应度函数。采用遗传算法,设计了适应于数字地形分析的编码方案。实验证明,遗传算法能够有效解决兵力部署的智能化自动生成和评价问题,方法可行。     

图像处理技术在桨叶表面应力分布试验中的应用

介绍图像处理技术在桨叶表面应力分布测试试验中的应用情况 ,对实际使用中的图像处理技术进行了较详细的分析讨论 .经过处理后的桨叶试验图像 ,不仅增加了图像的清晰程度 ,而且从中可获得半定量以至定量的参数 ,以帮助对桨叶表面应力分布进行分析     

A constrained optimization problem for a processor sharing queue

In this article we discuss a processor sharing queueing model for a stored program controlled telephone exchange. The model incorporates the effects of both call requests and operator tasks on the load of the processor. Newly arriving call requests and operator tasks can either be admitted or rejected and for this decision the state of the queue at the moment of arrival is available as information. To guarantee a high level of service, we formulate a constrained optimization problem. Two types of access control, viz., partitioning policies and sharing policies, are considered. The optimization problem is solved for partitioning policies and the performance of both types of policies is compared. © 1993 John Wiley & Sons, Inc.     

弹道导弹的突防与拦截

简述了弹道导弹在现代战争中的重要性。在介绍美国的国家导弹防御系统 (NMD)的基础上 ,针对其使用的拦截手段 ,重点分析了弹道导弹可采取的突防措施。     

可判定条件下的零知识证明

零知识证明是密码学关注的问题之一。在可判定条件下，运用代数学中群的共轭性质进行零知识证明，其实例就是数学中关于寻找共轭子的困难性问题。