基于引力搜索算法的漏磁缺陷重构

缺陷重构,即从漏磁信号反演出铁磁性材料的缺陷轮廓或几何参数,是漏磁无损评估中的一个重要研究方向。针对缺陷漏磁信号特征及缺陷轮廓特征的复杂性,提出基于引力搜索算法的漏磁缺陷重构方法。依据磁偶极子模型理论分析提取实测漏磁信号有效信息段,径向基函数神经网络作为前向模型,引力搜索算法作为迭代算法,利用其在高维解空间中避免陷入局部最优的能力,得到最优缺陷轮廓,实现缺陷重构。仿真和实验结果表明,基于引力搜索算法的缺陷重构方法能提高重构精度和效率,具有较高的实用价值。     

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

局部特征提取在点云相关应用中具有十分重要的作用,因此提出一种用于点云局部特征表示的扩展点特征直方图描述子。针对邻域点的两两点对提出一系列不变量;在特征点上构建一个局部参考坐标框架以获得特征描述子对旋转和平移的不变性;将关键点局部邻域划分成多个子空间,并依据每个子空间中的点对不变量构建一个直方图;将所有直方图串联起来得到扩展点特征直方图特征描述子。采用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.     

相控阵雷达LPI搜索方法研究

相控阵雷达可通过合理配置工作参数优化其性能。针对相控阵雷达在搜索目标时易受敌方电子侦察设备威胁的现实,研究了在保持搜索能力的同时,通过合理配置参数降低截获概率的问题。分析了影响相控阵雷达搜索状态LPI(Low Probability of Intercept)性能的主要因素,建立了截获概率模型与搜索能力模型,给出了3种参数调整策略。仿真试验验证了模型的有效性,并比较了3种策略的优劣。     

Sequential and systematic sampling plans for the Markov‐dependent production process

Acceptance sampling plans are used to assess the quality of an ongoing production process, in addition to the lot acceptance. In this paper, we consider sampling inspection plans for monitoring the Markov‐dependent production process. We construct sequential plans that satisfy the usual probability requirements at acceptable quality level and rejectable quality level and, in addition, possess the minimum average sample number under semicurtailed inspection. As these plans result in large sample sizes, especially when the serial correlation is high, we suggest new plans called “systematic sampling plans.” The minimum average sample number systematic plans that satisfy the probability requirements are constructed. Our algorithm uses some simple recurrence relations to compute the required acceptance probabilities. The optimal systematic plans require much smaller sample sizes and acceptance numbers, compared to the sequential plans. However, they need larger production runs to make a decision. Tables for choosing appropriate sequential and systematic plans are provided. The problem of selecting the best systematic sampling plan is also addressed. The operating characteristic curves of some of the sequential and the systematic plans are compared, and are observed to be almost identical. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 451–467, 2001     

一类对固定目标的集群搜寻对策问题及求解

利用集群搜索对策的理论与方法 ,建立了集群对固定目标的一类搜索对策模型 ,给出了集群的ε -最优搜寻策略 ,并考虑了其在搜索过程中的应用     

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.     

Rendezvous of three agents on the line

This paper considers a three‐person rendezvous problem on the line which was introduced earlier by the authors. Three agents are placed at three consecutive integer value points on the real line, say 1, 2, and 3. Each agent is randomly faced towards the right or left. Agents are blind and have a maximum speed of 1. Their common aim is to gather at a common location as quickly as possible. The main result is the proof that a strategy given by V. Baston is the unique minimax strategy. Baston's strategy ensures a three way rendezvous in time at most 3.5 for any of the 3!2³ = 48 possible initial configurations corresponding to positions and directions of each agent. A connection is established between the above rendezvous problem and a search problem of L. Thomas in which two parents search separately to find their lost child and then meet again. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 244–255, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10005     

Rendezvous search on labeled networks

Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least expected time. We consider continuous and discrete versions, in which they may move at unit speed or between adjacent distinct nodes, respectively. There are two versions of the problem (asymmetric or symmetric), depending on whether or not we allow the players to use different strategies. After obtaining some optimality conditions for general networks, we specialize to the interval and circle networks. In the first setting, we extend the work of J. V. Howard; in the second we prove a conjecture concerning the optimal symmetric strategy. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 256–274, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10011