Moth-flame optimization(MFO)is a novel metaheuristic algorithm inspired by the characteristics of a moth’s navigation method in nature called transverse orientation.Like other metaheuristic algorithms,it is easy to f...Moth-flame optimization(MFO)is a novel metaheuristic algorithm inspired by the characteristics of a moth’s navigation method in nature called transverse orientation.Like other metaheuristic algorithms,it is easy to fall into local optimum and leads to slow convergence speed.The chaotic map is one of the best methods to improve exploration and exploitation of the metaheuristic algorithms.In the present study,we propose a chaos-enhanced MFO(CMFO)by incorporating chaos maps into the MFO algorithm to enhance its performance.The chaotic map is utilized to initialize the moths’population,handle the boundary overstepping,and tune the distance parameter.The CMFO is benchmarked on three groups of benchmark functions to find out the most efficient one.The performance of the CMFO is also verified by using two real engineering problems.The statistical results clearly demonstrate that the appropriate chaotic map(singer map)embedded in the appropriate component of MFO can significantly improve the performance of MFO.展开更多
The purpose of this study was to grasp current potential problems of dose error in intensity-modulated proton therapy (IMPT) plans. We were interested in dose differences of the Varian Eclipse treatment planning syste...The purpose of this study was to grasp current potential problems of dose error in intensity-modulated proton therapy (IMPT) plans. We were interested in dose differences of the Varian Eclipse treatment planning system (TPS) and the fast dose calculation method (FDC) for single-field optimization (SFO) and multi-field optimization (MFO) IMPT plans. In addition, because some authors have reported dosimetric benefit of a proton arc therapy with ultimate multi-fields in recent years, we wanted to evaluate how the number of fields and beam angles affect the differences for IMPT plans. Therefore, for one brain cancer patient with a large heterogeneity, SFO and MFO IMPT plans with various multi-angle beams were planned by the TPS. Dose distributions for each IMPT plan were calculated by both the TPS’s conventional pencil beam algorithm and the FDC. The dosimetric parameters were compared between the two algorithms. The TPS overestimated 400 - 500 cGy (RBE) for minimum dose to the CTV relative to the dose calculated by the FDC. These differences indicate clinically relevant effect on clinical results. In addition, we observed that the maximum difference in dose calculated between the TPS and the FDC was about 900 cGy (RBE) for the right optic nerve, and this quantity also has a possibility to have a clinical effect. The major difference was not seen in calculations for SFO IMPT planning and those for MFO IMPT planning. Differences between the TPS and the FDC in SFO and MFO IMPT plans depend strongly on beam arrangement and the presence of a heterogeneous body. We advocate use of a Monte Carlo method in proton treatment planning to deliver the most precise proton dose in IMPT.展开更多
The software engineering technique makes it possible to create high-quality software.One of the most significant qualities of good software is that it is devoid of bugs.One of the most time-consuming and costly softwar...The software engineering technique makes it possible to create high-quality software.One of the most significant qualities of good software is that it is devoid of bugs.One of the most time-consuming and costly software proce-dures isfinding andfixing bugs.Although it is impossible to eradicate all bugs,it is feasible to reduce the number of bugs and their negative effects.To broaden the scope of bug prediction techniques and increase software quality,numerous causes of software problems must be identified,and successful bug prediction models must be implemented.This study employs a hybrid of Faster Convolution Neural Network and the Moth Flame Optimization(MFO)algorithm to forecast the number of bugs in software based on the program data itself,such as the line quantity in codes,methods characteristics,and other essential software aspects.Here,the MFO method is used to train the neural network to identify optimal weights.The proposed MFO-FCNN technique is compared with existing methods such as AdaBoost(AB),Random Forest(RF),K-Nearest Neighbour(KNN),K-Means Clustering(KMC),Support Vector Machine(SVM)and Bagging Clas-sifier(BC)are examples of machine learning(ML)techniques.The assessment method revealed that machine learning techniques may be employed successfully and through a high level of accuracy.The obtained data revealed that the proposed strategy outperforms the traditional approach.展开更多
This paper presents an Enhanced Moth-Flame Optimization （EMFO） technique based on Cultural Learning （CL） and Gaussian Mutation （GM）. The mechanism of CL and the operator of GM are incorporated to the original al...This paper presents an Enhanced Moth-Flame Optimization （EMFO） technique based on Cultural Learning （CL） and Gaussian Mutation （GM）. The mechanism of CL and the operator of GM are incorporated to the original algorithm of Moth-Flame Optimization （MFO）. CL plays an important role in the inheritance of historical experiences and stimulates moths to obtain information from flames more effectively, which helps MFO enhance its searching ability. Furthermore, in order to overcome the disadvantage of trapping into local optima, the operator of GM is introduced to MFO. This operator acts on the best flame in order to generate several variant ones, which can increase the diversity. The proposed algorithm of EMFO has been comprehensively evaluated on 13 benchmark functions, in comparison with MFO. Simulation results verify that EMFO shows a significant improvement on MFO, in terms of solution quality and algorithmic reliability.展开更多
针对当前网络入侵检测中的数据量较大、数据维度较高的特点,将飞蛾扑火优化(MFO)算法应用于网络入侵检测的特征选择中。鉴于MFO算法收敛过快、易陷入局部最优的问题,提出一种融合粒子群优化(PSO)的二进制飞蛾扑火优化(BPMFO)算法。该算...针对当前网络入侵检测中的数据量较大、数据维度较高的特点,将飞蛾扑火优化(MFO)算法应用于网络入侵检测的特征选择中。鉴于MFO算法收敛过快、易陷入局部最优的问题,提出一种融合粒子群优化(PSO)的二进制飞蛾扑火优化(BPMFO)算法。该算法引入MFO螺旋飞行公式,具有较强的局部搜索能力;结合了粒子群优化(PSO)算法的速度更新方法,让种群个体随着全局最优解和历史最优解的方向移动,增强算法的全局收敛性,从而避免易陷入局部最优。仿真实验以KDD CUP 99数据集为实验基础,分别采用支持向量机(SVM)、K最近邻(KNN)算法和朴素贝叶斯(NBC)3种分类器,与二进制飞蛾扑火优化(BMFO)算法、二进制粒子群优化(BPSO)算法、二进制遗传算法(BGA)、二进制灰狼优化(BGWO)算法和二进制布谷鸟搜索(BCS)算法进行了实验对比。实验结果表明,BPMFO算法应用于网络入侵检测的特征选择时,在算法精度、运行效率、稳定性、收敛速度以及跳出局部最优的综合性能上具有明显优势。展开更多
基金supported by the Military Science Project of the National Social Science Foundation of China(15GJ003-141)
文摘Moth-flame optimization(MFO)is a novel metaheuristic algorithm inspired by the characteristics of a moth’s navigation method in nature called transverse orientation.Like other metaheuristic algorithms,it is easy to fall into local optimum and leads to slow convergence speed.The chaotic map is one of the best methods to improve exploration and exploitation of the metaheuristic algorithms.In the present study,we propose a chaos-enhanced MFO(CMFO)by incorporating chaos maps into the MFO algorithm to enhance its performance.The chaotic map is utilized to initialize the moths’population,handle the boundary overstepping,and tune the distance parameter.The CMFO is benchmarked on three groups of benchmark functions to find out the most efficient one.The performance of the CMFO is also verified by using two real engineering problems.The statistical results clearly demonstrate that the appropriate chaotic map(singer map)embedded in the appropriate component of MFO can significantly improve the performance of MFO.
文摘The purpose of this study was to grasp current potential problems of dose error in intensity-modulated proton therapy (IMPT) plans. We were interested in dose differences of the Varian Eclipse treatment planning system (TPS) and the fast dose calculation method (FDC) for single-field optimization (SFO) and multi-field optimization (MFO) IMPT plans. In addition, because some authors have reported dosimetric benefit of a proton arc therapy with ultimate multi-fields in recent years, we wanted to evaluate how the number of fields and beam angles affect the differences for IMPT plans. Therefore, for one brain cancer patient with a large heterogeneity, SFO and MFO IMPT plans with various multi-angle beams were planned by the TPS. Dose distributions for each IMPT plan were calculated by both the TPS’s conventional pencil beam algorithm and the FDC. The dosimetric parameters were compared between the two algorithms. The TPS overestimated 400 - 500 cGy (RBE) for minimum dose to the CTV relative to the dose calculated by the FDC. These differences indicate clinically relevant effect on clinical results. In addition, we observed that the maximum difference in dose calculated between the TPS and the FDC was about 900 cGy (RBE) for the right optic nerve, and this quantity also has a possibility to have a clinical effect. The major difference was not seen in calculations for SFO IMPT planning and those for MFO IMPT planning. Differences between the TPS and the FDC in SFO and MFO IMPT plans depend strongly on beam arrangement and the presence of a heterogeneous body. We advocate use of a Monte Carlo method in proton treatment planning to deliver the most precise proton dose in IMPT.
文摘The software engineering technique makes it possible to create high-quality software.One of the most significant qualities of good software is that it is devoid of bugs.One of the most time-consuming and costly software proce-dures isfinding andfixing bugs.Although it is impossible to eradicate all bugs,it is feasible to reduce the number of bugs and their negative effects.To broaden the scope of bug prediction techniques and increase software quality,numerous causes of software problems must be identified,and successful bug prediction models must be implemented.This study employs a hybrid of Faster Convolution Neural Network and the Moth Flame Optimization(MFO)algorithm to forecast the number of bugs in software based on the program data itself,such as the line quantity in codes,methods characteristics,and other essential software aspects.Here,the MFO method is used to train the neural network to identify optimal weights.The proposed MFO-FCNN technique is compared with existing methods such as AdaBoost(AB),Random Forest(RF),K-Nearest Neighbour(KNN),K-Means Clustering(KMC),Support Vector Machine(SVM)and Bagging Clas-sifier(BC)are examples of machine learning(ML)techniques.The assessment method revealed that machine learning techniques may be employed successfully and through a high level of accuracy.The obtained data revealed that the proposed strategy outperforms the traditional approach.
基金The work is supported by National Natural Science Foundation of China （Grant No. 51707069）, the State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources （Grant No. LAPS 18001）, National Natural Science Foundation of China （Grant No. 51277080）, MOE Key Laboratory of Image Processing and Intelligence Control, Wuhan, China （Grant No. IPIC2015-01）, and State Key Program of National Natural Science Foundation of China （Grant No.51537003）.
文摘This paper presents an Enhanced Moth-Flame Optimization （EMFO） technique based on Cultural Learning （CL） and Gaussian Mutation （GM）. The mechanism of CL and the operator of GM are incorporated to the original algorithm of Moth-Flame Optimization （MFO）. CL plays an important role in the inheritance of historical experiences and stimulates moths to obtain information from flames more effectively, which helps MFO enhance its searching ability. Furthermore, in order to overcome the disadvantage of trapping into local optima, the operator of GM is introduced to MFO. This operator acts on the best flame in order to generate several variant ones, which can increase the diversity. The proposed algorithm of EMFO has been comprehensively evaluated on 13 benchmark functions, in comparison with MFO. Simulation results verify that EMFO shows a significant improvement on MFO, in terms of solution quality and algorithmic reliability.
文摘针对当前网络入侵检测中的数据量较大、数据维度较高的特点,将飞蛾扑火优化(MFO)算法应用于网络入侵检测的特征选择中。鉴于MFO算法收敛过快、易陷入局部最优的问题,提出一种融合粒子群优化(PSO)的二进制飞蛾扑火优化(BPMFO)算法。该算法引入MFO螺旋飞行公式,具有较强的局部搜索能力;结合了粒子群优化(PSO)算法的速度更新方法,让种群个体随着全局最优解和历史最优解的方向移动,增强算法的全局收敛性,从而避免易陷入局部最优。仿真实验以KDD CUP 99数据集为实验基础,分别采用支持向量机(SVM)、K最近邻(KNN)算法和朴素贝叶斯(NBC)3种分类器,与二进制飞蛾扑火优化(BMFO)算法、二进制粒子群优化(BPSO)算法、二进制遗传算法(BGA)、二进制灰狼优化(BGWO)算法和二进制布谷鸟搜索(BCS)算法进行了实验对比。实验结果表明,BPMFO算法应用于网络入侵检测的特征选择时,在算法精度、运行效率、稳定性、收敛速度以及跳出局部最优的综合性能上具有明显优势。
