Evaluating the usage of fault localization in automated program repair: an empirical study

Fault localization techniques are originally proposed to assist in manual debugging by generally producing a rank list of suspicious locations.With the increasing popularity of automated program repair,the fault localization techniques have been introduced to effectively reduce the search space of automated program repair.Unlike developers who mainly focus on the rank information,current automated program repair has two strategies to use the fault localization information:suspiciousness-first algorithm(SFA)based on the suspiciousness accuracy and rank-first algorithm(RFA)relying on the rank accuracy.However,despite the fact that the two different usages are widely adopted by current automated program repair and may result in different repair results,little is known about the impacts of the two strategies on automated program repair.In this paper we empirically compare the performance of SFA and RFA in the context of automated program repair.Specifically,we implement the two strategies and six well-studied fault localization techniques into four state-of-the-art automated program repair tools,and then use these tools to perform repair experiments on 60 real-world bugs from Defects4J.Our study presents a number of interesting findings:RFA outperforms SFA in 70.02%of cases when measured by the number of candidate patches generated before a valid patch is found(NCP),while SFA performs better in parallel repair and patch diversity;the performance of SFA can be improved by increasing the suspiciousness accuracy of fault localization techniques;finally,we use SimFix that deploys SFA to successfully repair four extra Defects4J bugs which cannot be repaired by SimFix originally using RFA.These observations provide a new perspective for future research on the usage and improvement of fault localization in automated program repair.     

主从式USV协同定位系统性能分析

为研究以距离为观测量的主从式无人水面航行器(unmanned surface vehicle,USV)协同定位系统在不同运动状态下的定位性能问题,建立一种新的协同坐标系,并在该坐标系中推导主从USV运动模型,以主从USV相对距离为观测量分析主从式USV协同定位系统的可观测性及可观测度.同时,针对不可观测路径,提出通过改变控制输入的方法以达到提高系统可观测度的目的.通过MATLAB仿真实验与水面舰艇实验,结果表明:在不同情况下,通过调整控制输入的方法改变系统的可观测度是有效的;利用所提出的分析方法可以反映协同定位系统的定位性能,验证了所得结论及方法的有效性.     

Mathematical Advancement of General Chlorine Bulk Decay Model

An accurate chlorine bulk decay model is needed to ensure that potable water meets the microbial and the chemical safeties at the treatment plant and throughout the distribution. Among the mathematical models available,the general second-order chlorine bulk decay model( GBDM) is the most fundamentally sound.Application of the GBDM,however,has been hindered by its numerous fictive parameters and lack of an analytical solution. This theoretical work removes the two obstacles. The GBDM is solved through transformation and integration. The analytical solution provides deep insights into the GBDM and facilitates the parameterization and sensitivity analysis. The background natural organic matter( NOM) is characterized with the probabilistic distribution of functional groups. It reveals that the mean of the function group distribution is correlated with the initial chlorine decay rate coefficient( κ_0). A simple formula is developed to determine κ_0 directly from the initial chlorine decay. The theoretical treatment reduces the fictive parameters to a minimum. For the common lognormal distribution,the GBDM needs only three parameters,well defined as initial chlorine demand X_0,median rate coefficient km,and heterogeneity index σ. For more complicated scenarios,composite distributions are constructed through superposition of individual distributions. A highlighted example is to predict chlorine decay in blends of different waters. With the theoretical and mathematical advancement here,the GBDM can be applied effectively to any reactive background matter in any reaction systems.     

利用测距值优化的室内三维定位算法

为了解决实际误差分布与假设误差分布不匹配导致最小二乘三维定位算法精度较低的问题,提出一种基于测距值优化的最小二乘室内三维定位算法.结合残差修正、Cayley-Menger行列式及空间四面体几何约束,利用非线性规划方法优化测距值,使测距误差符合高斯分布特性,从而提高最小二乘三维定位算法的定位精度.实验对比分析结果显示,所提算法具有较高的定位精度及稳定性.     

城市交通发展规模与交通资源适应性模型及算法

为科学确定城市交通的发展规模,在分析关键交叉口转向能力的基础上,提出了基于超级节点的城市交通网络构建方法;考虑公交资源以及公交优先发展战略的因素,构建了城市交通发展规模与交通资源适应性的数学模型,并设计了基于反馈的免疫克隆算法.以城市内某一区域为例对模型和算法进行验证,结果表明:模型及算法具有较好的实用性,能够为城市交通规划部门提供良好的决策支持.     

Multi-Dimensional Pedestrian System on the New Campus of University of Macau

The Multi-dimensional Pedestrian System( MPS) is an integral part of the new campus of University of Macau. It observes the principle of "pedestrian first " and features a pedestrian-vehicle dividing system.Based on a comprehensive analysis of the location,climate,ecology and other factors of the project site,the conception of the idea of MPS and the related researches are illustrated. The transportation features of the MPS,as summarized,include multi-dimensions,short-distance and weather-resistance. Its features for the sake of livability include integration of nature, respect for the environment and sharing of landscape. Upon the completion of the project, the effects on its users were tested. Finally, some constructive rules for the construction of similar campus pedestrian systems were proposed.     

基于信号相位搜索的WSN节点定位算法

节点定位是无线传感器网络（wireless sensor network,WSN）研究的热点问题之一,基于信号相位信息与物理距离间的关系提出了基于信号相位搜索的WSN节点定位算法。该算法首先根据节点间信号相位信息,基于余弦相似性算法原理构建目标函数,将WSN节点定位问题转换为目标函数最优解搜索问题;然后基于质心定位算法原理确定搜索初始像素单元;最后利用梯度下降法替代逐像素单元的遍历搜索,在不影响定位精度情况下进一步提高定位效率,减小定位功耗。仿真实验结果表明,该算法的各项指标良好,适用于WSN的节点定位。     

基于传声器阵列的机器人声源定位系统

随着计算机技术和信号处理技术的发展,各种具有特殊功能的机器人应用到人们的生产生活中。听觉系统可以弥补机器人视觉系统存在的不足,使机器人在黑暗或有障碍物遮挡的环境中,利用声音信息感知环境中存在的目标,并对其定位,辅助机器人工作,尤其在灾难现场搜救、军事等领域,声源定位系统具有独特的优势。针对机器人声源定位系统进行研究,设计了基于传声器阵列的机器人声源定位系统,采用平面四元传声阵列,利用广义互相关算法,实现对声源的定位,具有较高的实用价值。     

基于畅通度度量的无尺度网络中关键节点的选取方法 

现实世界中大量存在着的无尺度网络的抗蓄意攻击能力的不足,决定了从无尺度网络中选择关键节点的重要性。网络中节点的重要性程度可用将该节点从网络中删除前后,网络的连通性能的变化进行度量。文章提出了无尺度网络畅通度的概念,从3个不同的角度对无尺度网络的畅通度进行评价,构造出无尺度网络畅通度的综合度量公式,构建了无尺度网络的关键节点的选取模型,并利用分布估计算法对模型进行求解。仿真结果表明,利用分布估计算法得到的结果要好于直接选取度数最大的节点作为关键节点的方法。     

一种基于声誉的DTN节点合作机制

DTN自私节点由于资源有限,会拒绝转发其他节点的消息,严重影响路由性能,因此针对DTN节点的自私性,设计能够促使节点进行合作转发的节点合作机制具有重要意义。首先采用确认机制监测节点的转发行为,然后基于直接声誉值和间接声誉值计算节点的声誉值,最后提出一种基于声誉的节点合作机制。实验结果表明该机制能够促使自私节点合作转发消息,提高消息传递率,并减小消息传递时延。