基于移动Agent的特定数值求解算法研究

在分布式环境下,运用移动Agent技术实现大型复杂系统研究中经常使用的特定数值算法求解,可显著提高计算效率。以分支定界法为例,介绍了其设计思想和实践步骤,并对算法的时间复杂度进行了分析。     

影响合成旅实战化装备保障能力问题与对策

针对“跨越-2020库尔勒B”演习中,装备保障矛盾问题突出、维修保障难度大的情况,从装备保障力量发展不均衡、保障分队自身保障存在不足、人才储备弱的影响;高温、潮湿、风沙、高海拔等周边环境恶劣程度的影响;器材筹措效率高低、器材储供管理的好坏、器材利用率高低的影响;指挥控制链路关系、感知战场态势、控制战场节奏的影响四个方面存在的问题,对解决提出的问题进行了思考,从固强补弱装备保障力量、积极适应战场周边环境、优化器材储供管理和筹措渠道、提高装备保障指挥控制能力等方面着手,结合演训地区实际装备保障存在矛盾问题出发,探索和研究实战化训练中装备保障的对策措施,以期为部队实战化装备保障提供借鉴。     

关于教师继续教育培训模式的思考

继续教育作为终身教育的重要组成部分和基本形式,对教师的发展成长意义重大。继续教育工作开展十多年来,取得了一定的成绩,但还存在不少问题,如学习动机较为被动,管理认识不到位,教学内容陈旧空泛,教学方法呆板机械等。随着课程改革的不断深入,继续教育必须采取相应的改进措施,树立以人为本,服务至上的观点,教学内容的前瞻性与实用性并重,教学人员进行整合,教学方法灵活多样,评价考核规范科学等,以此激活受训教师内在的学习动机,更大程度地提高继续教育培训的实际效果。     

转型期再分配中存在的问题及其治理对策

转型期再分配中存在的问题既有认识上的 ,也有操作上的 ,既包括理论研究层面 ,也涵盖政策设计领域。具体问题包括对再分配原因的认识、目标的选择、问题的认定、地位的判断、功能的界定与作用的发挥、主体的确定与手段的运用等。要治理这些问题 ,就必须强化原因认识、规范目标选择、准确认定问题、科学判断地位、合理界定功能、有效发挥作用、完善主体、健全手段     

Militarism in post-war Cyprus: the development of the ideology of defence

This article provides a theorisation of militarism in post-war Cyprus. Based on qualitative empirical research conducted in Cyprus in 2011, the article explores the manifestation and steadfastness of Greek-Cypriot militarism, and the development of this militarism, which appeared after the partition of the island in 1974. In particular, it proposes the ideology of defence as a way to understand post-war Greek-Cypriot militarism. It shows the embedded nature of defence in the idea of the national struggle. It aims at mapping the character of this militarism in order to provide the grounds for future discussion. Only by understanding the interconnecting discourses that made Greek-Cypriot militarism possible in post-war Cyprus, can we understand its past, present, and future.     

A strategic model for state compliance verification

The theory of directed graphs and noncooperative games is applied to the problem of verification of State compliance to international treaties on arms control, disarmament and nonproliferation of weapons of mass destruction. Hypothetical treaty violations are formulated in terms of illegal acquisition paths for the accumulation of clandestine weapons, weapons‐grade materials or some other military capability. The paths constitute the illegal strategies of a sovereign State in a two‐person inspection game played against a multi‐ or international Inspectorate charged with compliance verification. The effectiveness of existing or postulated verification measures is quantified in terms of the Inspectorate's expected utility at Nash equilibrium. A prototype software implementation of the methodology and a case study are presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 260–271, 2016     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

Transformations of node‐balanced routing problems

This article describes a polynomial transformation for a class of unit‐demand vehicle routing problems, named node‐balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (TSP), which can then be transformed into a TSP. The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 370–387, 2015     

超视距多目标攻击排序及火力分配建模与解算

针对未来超视距空战条件下的多目标攻击排序和制导武器火力分配问题,提出了一种用以评估超视距空战作战效能的综合优势指数法;当目标数多于攻击机数时,通过构造综合优势矩阵,将非平衡指派问题转化为平衡指派问题,并建立了多目标攻击排序的0-1规划模型,该模型可解决对多个目标同时攻击的排序问题;以2对8攻击排序为例,利用求解线性规划软件Lindo6.0进行解算。最后,建立了1对4攻击火力分配的非线性规划模型,并利用求解非线性规划软件Lingo5.0进行解算。计算结果验证了建模的合理性和运用Lindo、Lingo软件求解较大规模目标攻击排序和火力分配问题的实时性。     

航路规划中大地主题解算的简化方法

介绍了大地主题解算的精确公式:Bowring公式,给出了三种大地主题解算的简化方法,包括:椭球体到圆球体、椭球面到圆球面以及椭球面到平面的简化方法,并分析了各种简化方法的误差大小。