用户意图的网络边缘主动计算方法

互联网端到端的设计原则没有区分端系统和网络间接口,使得用户分组处理期望无法告知网络,降低了网络效能。首次提出用户转发意图概念,端系统凭此向网络通告其意图,并借助网络边缘计算能力得以执行,实现用户意图在网络节点转发决策中的主动使能,构成新型主动表意网络i-ECAN。主动表意网络可以在视频直播加速、物联网数据融合、端系统安全认证等场景中得到应用。基于CORE模拟器构建网络演示环境,对无线网络切换和基于主动表意网络的无线网络切换的延迟进行比较,证明了主动表意网络机制的合理性和可行性。主动表意网络扩展了新的端系统和网络之间的接口,为人-网协同提供了基础。     

Reclaiming the local in EU peacebuilding: Effectiveness,ownership, and resistance

ABSTRACT

Since the early 2000s, the “local turn” has thoroughly transformed the field of peacebuilding. The European Union (EU) policy discourse on peacebuilding has also aligned with this trend, with an increasing number of EU policy statements insisting on the importance of “the local.” However, most studies on EU peacebuilding still adopt a top-down approach and focus on institutions, capabilities, and decision-making at the EU level. This special issue contributes to the literature by focusing on bottom-up and local dynamics of EU peacebuilding. After outlining the rationale and the scope of the special issue, this article discusses the local turn in international peacebuilding and identifies several interrelated concepts relevant to theorizing the role of the local, specifically those of effectiveness, ownership, and resistance. In the conclusion, we summarize the key contributions of this special issue and suggest some avenues for further research.     

用于三维点云表示的扩展点特征直方图算法

局部特征提取在点云相关应用中具有十分重要的作用,因此提出一种用于点云局部特征表示的扩展点特征直方图描述子。针对邻域点的两两点对提出一系列不变量;在特征点上构建一个局部参考坐标框架以获得特征描述子对旋转和平移的不变性;将关键点局部邻域划分成多个子空间,并依据每个子空间中的点对不变量构建一个直方图;将所有直方图串联起来得到扩展点特征直方图特征描述子。采用Bologna公共数据集对扩展点特征直方图特征描述子的性能进行测试,并与多个现有算法进行对比。结果表明,扩展点特征直方图特征描述子获得了良好的性能,其结果优于多个现有的特征描述子。     

面向多平台多目标协同跟踪的指派问题

针对多平台多目标协同跟踪中要求多个无人地面平台尽可能均匀地协同跟踪多个目标的特点,提出了改进的离散粒子群优化算法。首先采用连续型粒子群优化算法中的速度和位置迭代公式,然后对粒子位置进行离散编码,使粒子编码对应于可行的指派方案;其次,在优化算法中引入局部搜索,提高算法寻优性能。最后将所提算法应用于多平台多目标协同跟踪中的指派问题,并与未加入局部搜索的粒子群优化算法比较,仿真结果表明,加入局部搜索后的离散粒子群优化算法具有较好的寻优性能。     

Why internal conflict deteriorates state capacity? Evidence from Colombian municipalities

Previous work has documented a negative correlation between internal conflict and state capacity. We attempt to shed light on mechanisms that underlie this relationship, using data for Colombian municipalities. We rely on identifying heterogeneous effects of different types of violent events on state capacity, taking advantage of variability across municipalities in the prevalence of specific manifestations of conflict and their intensity. Our findings suggest that events making civilians feel targeted affect the state’s capacity to collect taxes, while those reflecting a stronger military capacity of illegal armies, in particular their large-scale attacks, affect the state’s capacity to provide public goods.     

军事仿真训练系统体系架构改进研究

现有军事仿真训练系统多基于传统C／S架构进行体系设计,在大规模战术训练仿真部署时,存在并发访问能力弱、可靠性差等问题。通过对仿真系统的体系架构进行研究,结合云计算技术提出增加访问控制服务器、仿真数据共享服务器以及仿真引擎虚拟化等改进方式,并通过对比分析,总结了三种方式对仿真训练系统的可扩展性、并发访问性以及数据可靠性等方面能力优化和提升的异同,并提出仿真训练系统传统体系向云计算体系逐步过渡的思路。     

多目标的分布式协同进化MDO算法

通过引入非优超排序和排挤的多目标处理机制 ,将分布式协同进化MDO算法的能力扩展到多目标的多学科设计优化问题。多目标的分布式协同进化MDO算法在保持各学科充分自治和各学科并行设计优化协同的基础上 ,通过一次运行即可获得具有良好分布的多个Pareto最优解 ,逼近整个Pareto最优前沿。应用于导弹气动 /发动机 /控制三学科两目标设计优化问题 ,与约束法计算结果的对比表明算法能够有效逼近该问题的Pareto最优前沿 ,为设计决策提供了丰富的信息     

Adaptive random search for continuous simulation optimization

We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

修订地方性消防法规需要审视的几个关系

随着消防法的修订颁布,目前各地适用的地方性消防法规的相关规定已经不适应新形势下消防法制建设的需要,亟待重新修订。通过对消防法、相关法律以及部门消防规章与地方性消防法规之间关系的审视和分析,为地方性消防法规的修订提供参考。     

贪心遗传算法解决一般武器-目标分配问题

一般武器-目标分配问题,是使武器发挥最大效能而使目标遭受最大毁伤的最优化问题.遗传算法广泛用于解决最优化问题.提出一种具有贪心优化机制的局部搜索方法,以提高遗传算法的搜索效率,从而迅速找到全局最优解.应用于炮兵武器-目标分配问题的仿真试验结果表明,此算法比现有的其他搜寻算法具有更好的求解效率.