Existing feature selection methods for intrusion detection systems in the Industrial Internet of Things often suffer from local optimality and high computational complexity.These challenges hinder traditional IDS from...Existing feature selection methods for intrusion detection systems in the Industrial Internet of Things often suffer from local optimality and high computational complexity.These challenges hinder traditional IDS from effectively extracting features while maintaining detection accuracy.This paper proposes an industrial Internet ofThings intrusion detection feature selection algorithm based on an improved whale optimization algorithm(GSLDWOA).The aim is to address the problems that feature selection algorithms under high-dimensional data are prone to,such as local optimality,long detection time,and reduced accuracy.First,the initial population’s diversity is increased using the Gaussian Mutation mechanism.Then,Non-linear Shrinking Factor balances global exploration and local development,avoiding premature convergence.Lastly,Variable-step Levy Flight operator and Dynamic Differential Evolution strategy are introduced to improve the algorithm’s search efficiency and convergence accuracy in highdimensional feature space.Experiments on the NSL-KDD and WUSTL-IIoT-2021 datasets demonstrate that the feature subset selected by GSLDWOA significantly improves detection performance.Compared to the traditional WOA algorithm,the detection rate and F1-score increased by 3.68%and 4.12%.On the WUSTL-IIoT-2021 dataset,accuracy,recall,and F1-score all exceed 99.9%.展开更多
To further improve upon the deficiencies of traditional algorithms in terms of population diversity,convergence accuracy,and speed,this paper introduces a Dynamic Multi-Population Hybrid Metaheuristic Algorithm(DHA).D...To further improve upon the deficiencies of traditional algorithms in terms of population diversity,convergence accuracy,and speed,this paper introduces a Dynamic Multi-Population Hybrid Metaheuristic Algorithm(DHA).DHA dynamically categorizes the population into Elite,Follower,and Explorer subgroups,applying specific strategies:a novel dimension-wise Gaussian mutation combined with the Sine Cosine Algorithm(SCA)for the Elite,a randomized spiral search for the Explorer,and Lévy flight for the Follower.Rigorous testing on benchmark sets like CEC2005,CEC2017,and CEC2019,alongside practical application in Service Function Chain(SFC)mapping,underscores DHA’s superior performance and applicability.展开更多
A genetic algorithm(GA)-based new method is designed to evaluate thecircularity error of mechanical parts. The method uses the capability of nonlinear optimization ofGA to search for the optimal solution of circularit...A genetic algorithm(GA)-based new method is designed to evaluate thecircularity error of mechanical parts. The method uses the capability of nonlinear optimization ofGA to search for the optimal solution of circularity error. The finely-designed GA (FDGA)characterized dynamical bisexual recombination and Gaussian mutation. The mathematical model of thenonlinear problem is given. The implementation details in FDGA are described such as the crossoveror recombination mechanism which utilized a bisexual reproduction scheme and the elitist reservationmethod; and the adaptive mutation which used the Gaussian probability distribution to determine thevalues of the offspring produced by mutation mechanism. The examples are provided to verify thedesigned FDGA. The computation results indicate that the FDGA works very well in the field of formerror evaluation such as circularity evaluation.展开更多
In this study,we analyze three portfolio selection strategies for loss-averse investors:semi-variance,conditional value-at-risk,and a combination of both risk measures.Moreover,we propose a novel version of the non-do...In this study,we analyze three portfolio selection strategies for loss-averse investors:semi-variance,conditional value-at-risk,and a combination of both risk measures.Moreover,we propose a novel version of the non-dominated sorting genetic algorithm II and of the strength Pareto evolutionary algorithm 2 to tackle this optimization problem.The effectiveness of these algorithms is compared with two alternatives from the literature from five publicly available datasets.The computational results indicate that the proposed algorithms in this study outperform the others for all the examined performance metrics.Moreover,they are able to approximate the Pareto front even in cases in which all the other approaches fail.展开更多
In this paper,a modified genetic local search algorithm(MGLSA) is proposed.The proposed algorithm is resulted from employing the simulated annealing technique to regulate the variance of the Gaussian mutation of the g...In this paper,a modified genetic local search algorithm(MGLSA) is proposed.The proposed algorithm is resulted from employing the simulated annealing technique to regulate the variance of the Gaussian mutation of the genetic local search algorithm(GLSA).Then,an MGLSA-based inverse algorithm is proposed for magnetic flux leakage(MFL) signal inversion of corrosive flaws,in which the MGLSA is used to solve the optimization problem in the MFL inverse problem.Experimental results demonstrate that the MGLSA-based inverse algorithm is more robust than GLSA-based inverse algorithm in the presence of noise in the measured MFL signals.展开更多
Particle swarm optimization(PSO)is a type of swarm intelligence algorithm that is frequently used to resolve specific global optimization problems due to its rapid convergence and ease of operation.However,PSO still h...Particle swarm optimization(PSO)is a type of swarm intelligence algorithm that is frequently used to resolve specific global optimization problems due to its rapid convergence and ease of operation.However,PSO still has certain deficiencies,such as a poor trade-off between exploration and exploitation and premature convergence.Hence,this paper proposes a dual-stage hybrid learning particle swarm optimization(DHLPSO).In the algorithm,the iterative process is partitioned into two stages.The learning strategy used at each stage emphasizes exploration and exploitation,respectively.In the first stage,to increase population variety,a Manhattan distance based learning strategy is proposed.In this strategy,each particle chooses the furthest Manhattan distance particle and a better particle for learning.In the second stage,an excellent example learning strategy is adopted to perform local optimization operations on the population,in which each particle learns from the global optimal particle and a better particle.Utilizing the Gaussian mutation strategy,the algorithm’s searchability in particular multimodal functions is significantly enhanced.On benchmark functions from CEC 2013,DHLPSO is evaluated alongside other PSO variants already in existence.The comparison results clearly demonstrate that,compared to other cutting-edge PSO variations,DHLPSO implements highly competitive performance in handling global optimization problems.展开更多
基金supported by the Major Science and Technology Programs in Henan Province(No.241100210100)Henan Provincial Science and Technology Research Project(No.252102211085,No.252102211105)+3 种基金Endogenous Security Cloud Network Convergence R&D Center(No.602431011PQ1)The Special Project for Research and Development in Key Areas of Guangdong Province(No.2021ZDZX1098)The Stabilization Support Program of Science,Technology and Innovation Commission of Shenzhen Municipality(No.20231128083944001)The Key scientific research projects of Henan higher education institutions(No.24A520042).
文摘Existing feature selection methods for intrusion detection systems in the Industrial Internet of Things often suffer from local optimality and high computational complexity.These challenges hinder traditional IDS from effectively extracting features while maintaining detection accuracy.This paper proposes an industrial Internet ofThings intrusion detection feature selection algorithm based on an improved whale optimization algorithm(GSLDWOA).The aim is to address the problems that feature selection algorithms under high-dimensional data are prone to,such as local optimality,long detection time,and reduced accuracy.First,the initial population’s diversity is increased using the Gaussian Mutation mechanism.Then,Non-linear Shrinking Factor balances global exploration and local development,avoiding premature convergence.Lastly,Variable-step Levy Flight operator and Dynamic Differential Evolution strategy are introduced to improve the algorithm’s search efficiency and convergence accuracy in highdimensional feature space.Experiments on the NSL-KDD and WUSTL-IIoT-2021 datasets demonstrate that the feature subset selected by GSLDWOA significantly improves detection performance.Compared to the traditional WOA algorithm,the detection rate and F1-score increased by 3.68%and 4.12%.On the WUSTL-IIoT-2021 dataset,accuracy,recall,and F1-score all exceed 99.9%.
基金supported by the Natural Science Foundation of Zhejiang Province(LZ20F010008)the National College Students Innovation and Entrepreneurship Training Program(202310351075)the Zhejiang Xinmiao Talents Program(2023R451023).
文摘To further improve upon the deficiencies of traditional algorithms in terms of population diversity,convergence accuracy,and speed,this paper introduces a Dynamic Multi-Population Hybrid Metaheuristic Algorithm(DHA).DHA dynamically categorizes the population into Elite,Follower,and Explorer subgroups,applying specific strategies:a novel dimension-wise Gaussian mutation combined with the Sine Cosine Algorithm(SCA)for the Elite,a randomized spiral search for the Explorer,and Lévy flight for the Follower.Rigorous testing on benchmark sets like CEC2005,CEC2017,and CEC2019,alongside practical application in Service Function Chain(SFC)mapping,underscores DHA’s superior performance and applicability.
基金The project is supported by National Natural Science Foundation of China(No.59975025).
文摘A genetic algorithm(GA)-based new method is designed to evaluate thecircularity error of mechanical parts. The method uses the capability of nonlinear optimization ofGA to search for the optimal solution of circularity error. The finely-designed GA (FDGA)characterized dynamical bisexual recombination and Gaussian mutation. The mathematical model of thenonlinear problem is given. The implementation details in FDGA are described such as the crossoveror recombination mechanism which utilized a bisexual reproduction scheme and the elitist reservationmethod; and the adaptive mutation which used the Gaussian probability distribution to determine thevalues of the offspring produced by mutation mechanism. The examples are provided to verify thedesigned FDGA. The computation results indicate that the FDGA works very well in the field of formerror evaluation such as circularity evaluation.
文摘In this study,we analyze three portfolio selection strategies for loss-averse investors:semi-variance,conditional value-at-risk,and a combination of both risk measures.Moreover,we propose a novel version of the non-dominated sorting genetic algorithm II and of the strength Pareto evolutionary algorithm 2 to tackle this optimization problem.The effectiveness of these algorithms is compared with two alternatives from the literature from five publicly available datasets.The computational results indicate that the proposed algorithms in this study outperform the others for all the examined performance metrics.Moreover,they are able to approximate the Pareto front even in cases in which all the other approaches fail.
基金the Innovation Program of ShanghaiMunicipal Education Commission(No.09YZ340)the Leading Academic Discipline Project of ShanghaiMunicipal Education Commission(No.J51301)+2 种基金the Special Scientific Research Project of Scienceand Technology Commission of Shanghai Municipality(No.08240512000)the Shanghai Municipal EducationCommission Scientific Foundation Projection(No.06LZ009)the Shanghai Key Science and TechnologyProject(No.061612041)
文摘In this paper,a modified genetic local search algorithm(MGLSA) is proposed.The proposed algorithm is resulted from employing the simulated annealing technique to regulate the variance of the Gaussian mutation of the genetic local search algorithm(GLSA).Then,an MGLSA-based inverse algorithm is proposed for magnetic flux leakage(MFL) signal inversion of corrosive flaws,in which the MGLSA is used to solve the optimization problem in the MFL inverse problem.Experimental results demonstrate that the MGLSA-based inverse algorithm is more robust than GLSA-based inverse algorithm in the presence of noise in the measured MFL signals.
基金the National Natural Science Foundation of China(Nos.62066019 and 61903089)the Natural Science Foundation of Jiangxi Province(Nos.20202BABL202020 and 20202BAB202014)the Graduate Innovation Foundation of Jiangxi University of Science and Technology(Nos.XY2021-S092 and YC2022-S641).
文摘Particle swarm optimization(PSO)is a type of swarm intelligence algorithm that is frequently used to resolve specific global optimization problems due to its rapid convergence and ease of operation.However,PSO still has certain deficiencies,such as a poor trade-off between exploration and exploitation and premature convergence.Hence,this paper proposes a dual-stage hybrid learning particle swarm optimization(DHLPSO).In the algorithm,the iterative process is partitioned into two stages.The learning strategy used at each stage emphasizes exploration and exploitation,respectively.In the first stage,to increase population variety,a Manhattan distance based learning strategy is proposed.In this strategy,each particle chooses the furthest Manhattan distance particle and a better particle for learning.In the second stage,an excellent example learning strategy is adopted to perform local optimization operations on the population,in which each particle learns from the global optimal particle and a better particle.Utilizing the Gaussian mutation strategy,the algorithm’s searchability in particular multimodal functions is significantly enhanced.On benchmark functions from CEC 2013,DHLPSO is evaluated alongside other PSO variants already in existence.The comparison results clearly demonstrate that,compared to other cutting-edge PSO variations,DHLPSO implements highly competitive performance in handling global optimization problems.
