基于CF融入SSA优化SVM和RF模型的滑坡易发性评价

针对传统的区域滑坡易发性评价建模过程可能存在的样本数据量纲不统一以及模型参数选取误差等问题,本文以陕西省留坝县为研究区,选取高程、坡度、水系、降雨量、地层岩性等10个评价因子,采用确定性系数模型(CF)计算各评价因子的敏感值作为支持向量机模型(SVM)和随机森林模型(RF)的输入样本属性值,引入麻雀搜索算法(SSA)分别对SVM模型和RF模型的参数进行优化,获取最优参数对两种模型进行训练,最终构建了CF-SSA-SVM和CF-SSA-RF模型,从而对整个研究区进行预测,完成滑坡易发性评价,并通过受试者工作特征曲线(ROC)对两种模型进行精度验证。结果表明,两种模型的评价结果均有较多滑坡点落在极高易发区,无滑坡点落在极低易发区,评价结果均有较高的准确率。其中,CF-SSA-RF模型的成功率和预测率曲线AUC值分别为0.994和0.940,高于CF-SSA-SVM模型;并以三处典型滑坡为例进行验证,结果显示易发性分区与历史滑坡点分布较为吻合。进一步表明CF-SSA-RF模型更适用于留坝县的滑坡易发性评价,为当地滑坡灾害风险评估提供了指导依据。

Improved algorithms to plan missions for agile earth observation satellites

This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.

Integrating Variable Reduction Strategy With Evolutionary Algorithms for Solving Nonlinear Equations Systems

Nonlinear equations systems(NESs)are widely used in real-world problems and they are difficult to solve due to their nonlinearity and multiple roots.Evolutionary algorithms(EAs)are one of the methods for solving NESs,given their global search capabilities and ability to locate multiple roots of a NES simultaneously within one run.Currently,the majority of research on using EAs to solve NESs focuses on transformation techniques and improving the performance of the used EAs.By contrast,problem domain knowledge of NESs is investigated in this study,where we propose the incorporation of a variable reduction strategy(VRS)into EAs to solve NESs.The VRS makes full use of the systems of expressing a NES and uses some variables(i.e.,core variable)to represent other variables(i.e.,reduced variables)through variable relationships that exist in the equation systems.It enables the reduction of partial variables and equations and shrinks the decision space,thereby reducing the complexity of the problem and improving the search efficiency of the EAs.To test the effectiveness of VRS in dealing with NESs,this paper mainly integrates the VRS into two existing state-of-the-art EA methods(i.e.,MONES and DR-JADE)according to the integration framework of the VRS and EA,respectively.Experimental results show that,with the assistance of the VRS,the EA methods can produce better results than the original methods and other compared methods.Furthermore,extensive experiments regarding the influence of different reduction schemes and EAs substantiate that a better EA for solving a NES with more reduced variables tends to provide better performance.

基于ease-off的通用加工参数的弧齿锥齿轮高阶反调修正研究

利用高阶运动系数表示的通用加工参数用来进行弧齿锥齿轮的精确ease-off齿面反调修正。首先基于通用展成加工模型(UGM)采用高阶多项式函数表达的通用加工参数来定义真实高阶ease-off齿面。然后考虑到方程求解的强烈非线性引入敏感系数矩阵和改进的带置信域策略的Levenberg-Marquardat(L-M)算法来获得精确稳定的通用加工参数反调量。最后基于通用加工参数的高阶反调方法被提出来主要包括:i)最优加工参数调整;ii)高阶ease-off齿面修正。

贴片机屏蔽罩视觉定位算法研究

针对贴片机生产中手机屏蔽罩视觉定位问题,分析了现有模板匹配算法的不足,提出了采用轮廓特征边提取算法实现屏蔽罩的视觉定位;算法针对屏蔽罩图像特点首先应用二值化及Blob点分析方法去除图像中的干扰点,再采用Laplacian变换提取出边缘轮廓,然后由外边缘轮廓提取出线段集并用屏蔽罩尺寸信息过滤出特征边,最后由特征边计算出屏蔽罩的中心及偏转角度;实验效果表明该算法的识别速度和精度都能满足实际生产的需要,并具有较强的鲁棒性。

软件确保智能测试用例生成PSO算法进展研究

测试用例生成是软件测试的重要环节,是软件确保的重要组成部分,其中启发性算法是近年来测试用例自动生成研究领域的热点。对启发性测试用例生成的新方法PSO进行了介绍和分析,详细讨论了PSO算法适应度函数、PSO算法早熟与局部最优、种群规模对PSO算法的影响以及PSO参数优化问题,并将PSO与GA算法进行了对比分析。展望了PSO测试用例生成算法的未来研究方向,指出PSO测试用例生成算法目前应重点解决测试用例规模优化、早熟抑制和参数优选等问题。

Experimental study of path planning problem using EMCOA for a holonomic mobile robot

In this paper,a comparative study of the path planning problem using evolutionary algorithms,in comparison with classical methods such as the A*algorithm,is presented for a holonomic mobile robot.The configured navigation system,which consists of the integration of sensors sources,map formatting,global and local path planners,and the base controller,aims to enable the robot to follow the shortest smooth path delicately.Grid-based mapping is used for scoring paths efficiently,allowing the determination of collision-free trajectories from the initial to the target position.This work considers the evolutionary algorithms,the mutated cuckoo optimization algorithm(MCOA)and the genetic algorithm(GA),as a global planner to find the shortest safe path among others.A non-uniform motion coefficient is introduced for MCOA in order to increase the performance of this algorithm.A series of experiments are accomplished and analyzed to confirm the performance of the global planner implemented on a holonomic mobile robot.The results of the experiments show the capacity of the planner framework with respect to the path planning problem under various obstacle layouts.

Data-driven evolutionary sampling optimization for expensive problems

Surrogate models have shown to be effective in assisting evolutionary algorithms(EAs)for solving computationally expensive complex optimization problems.However,the effectiveness of the existing surrogate-assisted evolutionary algorithms still needs to be improved.A data-driven evolutionary sampling optimization(DESO)framework is proposed,where at each generation it randomly employs one of two evolutionary sampling strategies,surrogate screening and surrogate local search based on historical data,to effectively balance global and local search.In DESO,the radial basis function(RBF)is used as the surrogate model in the sampling strategy,and different degrees of the evolutionary process are used to sample candidate points.The sampled points by sampling strategies are evaluated,and then added into the database for the updating surrogate model and population in the next sampling.To get the insight of DESO,extensive experiments and analysis of DESO have been performed.The proposed algorithm presents superior computational efficiency and robustness compared with five state-of-the-art algorithms on benchmark problems from 20 to 200 dimensions.Besides,DESO is applied to an airfoil design problem to show its effectiveness.

Evolvable Hardware Based Software-Hardware Co-Designing Platform ECDP

Based on the theories of EA （Evolutionary Algorithm） and EHW （Evolvable Hardware）, we devise an EHW based software-hardware co designing platform ECDP, on which we provided standards for hardware system encoding and evolving operation designing, as well as circuit emulating tools. The major features of this system are： two layer-encoding of circuit structure, off-line evolving with software cmulation and the evolving of genetic program designing. With this system, we implemented the auto designing of sonic software-hardware systems, like the random number generator.

I_(ϵ+)LGEA:A Learning-Guided Evolutionary Algorithm Based on I_(ϵ+) Indicator for Portfolio Optimization

Portfolio optimization is a classical and important problem in the field of asset management,which aims to achieve a trade-off between profit and risk.Previous portfolio optimization models use traditional risk measurements such as variance,which symmetrically delineate both positive and negative sides and are not practical and stable.In this paper,a new model with cardinality constraints is first proposed,in which the idiosyncratic volatility factor is used to replace traditional risk measurements and can capture the risks of the portfolio in a more accurate way.The new model has practical constraints which involve the sparsity and irregularity of variables and make it challenging to be solved by traditional Multi-Objective Evolutionary Algorithms(MOEAs).To solve the model,a Learning-Guided Evolutionary Algorithm based on I_(ϵ+)indicator(I_(ϵ+)LGEA)is developed.In I_(ϵ+)LGEA,the I_(ϵ+)indicator is incorporated into the initialization and genetic operators to guarantee the sparsity of solutions and can help improve the convergence of the algorithm.And a new constraint-handling method based on I_(ϵ+)indicator is also adopted to ensure the feasibility of solutions.The experimental results on five portfolio trading datasets including up to 1226 assets show that I_(ϵ+)LGEA outperforms some state-of-the-art MOEAs in most cases.

A hybrid evolutionary algorithm for distribution feeder reconfiguration

This paper presents a new method to reduce the distribution system loss by feeder reconfiguration.This new method combines self-adaptive particle swarm optimization(SAPSO) with shuffled frog-leaping algorithm(SFLA) in an attempt to find the global optimal solutions for the distribution feeder reconfiguration(DFR).In PSO algorithm,appropriate adjustment of the parameters is cumbersome and usually requires a lot of time and effort.Thus,a self-adaptive framework is proposed to improve the robustness of PSO.In SAPSO the learning factors of PSO coevolve with the particles.SFLA is combined with the SAPSO algorithm to improve its performance.The proposed algorithm is tested on two distribution test networks.The results of simulation show that the proposed algorithm is very powerful and guarantees to obtain the global optimization in minimum time.

Time Complexity Analysis of an Evolutionary Algorithm for Finding Nearly Maximum Cardinality Matching

Most of works on the time complexity analysis of evolutionary algorithms havealways focused on some artificial binary problems. The time complexity of the algorithms forcombinatorial optimisation has not been well understood. This paper considers the time complexity ofan evolutionary algorithm for a classical combinatorial optimisation problem, to find the maximumcardinality matching in a graph. It is shown that the evolutionary algorithm can produce a matchingwith nearly maximum cardinality in average polynomial time.

A survey on algorithm adaptation in evolutionary computation

Evolutionary computation （EC） is one of the fastest growing areas in computer science that solves intractable optimization problems by emulating biologic evolution and organizational behaviors in nature. To de- sign an EC algorithm, one needs to determine a set of algorithmic configurations like operator selections and parameter settings. How to design an effective and ef- ficient adaptation scheme for adjusting the configura- tions of EC algorithms has become a significant and promising research topic in the EC research community. This paper intends to provide a comprehensive survey on this rapidly growing field. We present a classification of adaptive EC （AEC） algorithms from the perspective of how an adaptation scheme is designed, involving the adaptation objects, adaptation evidences, and adapta- tion methods. In particular, by analyzing tile popula- tion distribution characteristics of EC algorithms, we discuss why and how the evolutionary state information of EC can be estimated and utilized for designing ef- fective EC adaptation schemes. Two AEC algorithms using the idea of evolutionary state estimation, includ- ing the clustering-based adaptive genetic algorithm and the adaptive particle swarm optimization algorithm are presented in detail. Some potential directions for the re- search of AECs are also discussed in this paper.

Dynamic multi-objective intelligent optimal control toward wastewater treatment processes

Wastewater treatment plays a crucial role in alleviating water shortages and protecting the environment from pollution.Due to the strong time variabilities and complex nonlinearities within wastewater treatment systems,devising an efficient optimal controller to reduce energy consumption while ensuring effluent quality is still a bottleneck that needs to be addressed.In this paper,in order to comprehensively consider different needs of the wastewater treatment process(WTTP),a two-objective model is to consider a scope,in which minimizing energy consumption and guaranteeing effluent quality are both considered to improve wastewater treatment efficiency.To efficiently solve the model functions,a grid-based dynamic multi-objective evolutionary decomposition algorithm,namely GD-MOEA/D,is designed.A GD-MOEA/D-based intelligent optimal controller(GD-MOEA/D-IOC)is devised to achieve tracking control of the main operating variables of the WTTP.Finally,the benchmark simulation model No.1(BSM1)is applied to verify the validity of the proposed approach.The experimental results demonstrate that the constructed models can catch the dynamics of WWTP accurately.Moreover,GD-MOEA/D has better optimization ability in solving the designed models.GD-MOEA/D-IOC can achieve a significant improvement in terms of reducing energy consumption and improving effluent quality.Therefore,the designed multi-objective intelligent optimal control method for WWTP has great potential to be applied to practical engineering since it can easily achieve a highly intelligent control in WTTP.

A Novel Self-adaptive Circuit Design Technique Based on Evolvable Hardware

Since traditional fault tolerance methods of electronic systems are based on redundant fault tolerance technique,and their structures are fixed when circuits are designed,the self-adaptive ability is limited.In order to solve these problems,a novel circuit self-adaptive design technique based on evolvable hardware(EHW)is proposed.It features robustness,self-organization and self-adaption.It can be adapted to a complex environment through dynamic configuration of the circuit.In this paper,the proposed technique simulated.The consumption of hardware resources and the number of convergence iterations researched.The effectiveness and superiority of the proposed technique are verified.The designed circuit has the ability of resistible redundant-state interference(RRSI).The proposed technique has a broad application prospect,and it has great significance.