The massive influx of traffic on the Internet has made the composition of web traffic increasingly complex.Traditional port-based or protocol-based network traffic identification methods are no longer suitable for to...The massive influx of traffic on the Internet has made the composition of web traffic increasingly complex.Traditional port-based or protocol-based network traffic identification methods are no longer suitable for today’s complex and changing networks.Recently,machine learning has beenwidely applied to network traffic recognition.Still,high-dimensional features and redundant data in network traffic can lead to slow convergence problems and low identification accuracy of network traffic recognition algorithms.Taking advantage of the faster optimizationseeking capability of the jumping spider optimization algorithm(JSOA),this paper proposes a jumping spider optimization algorithmthat incorporates the harris hawk optimization(HHO)and small hole imaging(HHJSOA).We use it in network traffic identification feature selection.First,the method incorporates the HHO escape energy factor and the hard siege strategy to forma newsearch strategy for HHJSOA.This location update strategy enhances the search range of the optimal solution of HHJSOA.We use small hole imaging to update the inferior individual.Next,the feature selection problem is coded to propose a jumping spiders individual coding scheme.Multiple iterations of the HHJSOA algorithmfind the optimal individual used as the selected feature for KNN classification.Finally,we validate the classification accuracy and performance of the HHJSOA algorithm using the UNSW-NB15 dataset and KDD99 dataset.Experimental results show that compared with other algorithms for the UNSW-NB15 dataset,the improvement is at least 0.0705,0.00147,and 1 on the accuracy,fitness value,and the number of features.In addition,compared with other feature selectionmethods for the same datasets,the proposed algorithmhas faster convergence,better merit-seeking,and robustness.Therefore,HHJSOAcan improve the classification accuracy and solve the problem that the network traffic recognition algorithm needs to be faster to converge and easily fall into local optimum due to high-dimensional features.展开更多
As a new bionic algorithm,Spider Monkey Optimization(SMO)has been widely used in various complex optimization problems in recent years.However,the new space exploration power of SMO is limited and the diversity of the...As a new bionic algorithm,Spider Monkey Optimization(SMO)has been widely used in various complex optimization problems in recent years.However,the new space exploration power of SMO is limited and the diversity of the population in SMO is not abundant.Thus,this paper focuses on how to reconstruct SMO to improve its performance,and a novel spider monkey optimization algorithm with opposition-based learning and orthogonal experimental design(SMO^(3))is developed.A position updatingmethod based on the historical optimal domain and particle swarmfor Local Leader Phase(LLP)andGlobal Leader Phase(GLP)is presented to improve the diversity of the population of SMO.Moreover,an opposition-based learning strategy based on self-extremum is proposed to avoid suffering from premature convergence and getting stuck at locally optimal values.Also,a local worst individual elimination method based on orthogonal experimental design is used for helping the SMO algorithm eliminate the poor individuals in time.Furthermore,an extended SMO^(3)named CSMO^(3)is investigated to deal with constrained optimization problems.The proposed algorithm is applied to both unconstrained and constrained functions which include the CEC2006 benchmark set and three engineering problems.Experimental results show that the performance of the proposed algorithm is better than three well-known SMO algorithms and other evolutionary algorithms in unconstrained and constrained problems.展开更多
To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial populatio...To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial population is generated by a refracted opposition-based learning strategy to enhance diversity and ergodicity.Second,this paper introduces a non-linear adaptive dynamic weight factor to improve convergence efficiency.Then,using the crisscross strategy,using the horizontal crossover to enhance the global search and vertical crossover to keep the diversity of the population to avoid being trapped in the local optimum.At last,we adopt a Gauss-Cauchy mutation strategy to improve the stability of the algorithm by mutation of the optimal individuals.Therefore,the application of ISMO is validated by ten benchmark functions and feature selection.It is proved that the proposed method can resolve the problem of feature selection.展开更多
The distinct network organization, management, service and operating characteristics of US Southwest Airlines are key elements of its success compared with other airlines. As a network organization type, the spider we...The distinct network organization, management, service and operating characteristics of US Southwest Airlines are key elements of its success compared with other airlines. As a network organization type, the spider web airline network has received more attention. In this paper, we analyzed the relation between the spider web airline network and spider web, and the structure of spider web airline network, built the assignment model of the spider web airline network,and investigated the economics concerned.展开更多
Distribution of horizontal boom produced droplets downwards into maize canopies at flowering period and its effects on the efficacies of emamectin benzoate, lambda-cyhalothrin and chlorantraniliprole against the secon...Distribution of horizontal boom produced droplets downwards into maize canopies at flowering period and its effects on the efficacies of emamectin benzoate, lambda-cyhalothrin and chlorantraniliprole against the second generation of Asian corn borer (ACB) larvae and their toxicity to spiders were studied. When insecticides were sprayed downwards into the maize canopies, randomly filtering out droplets by upper leaves led to great variations of droplet coverage and density within the canopies. Consequently, the efficacies of lambda-cyhalothrin and emamectin benzoate against ACB larvae were decreased because of randomly filtering out droplets by upper leaves. But field investigation showed that lambda-cyhalothrin was extremely toxic to hunting spiders, Xysticus ephippiatus, and not suitable to IPM programs in regulation of the second generation of ACB. Therefore, randomly filtering out droplets by upper leaves decreased lambda-cyhalothrin's efficacy against ACB larvae, but did little to decrease its toxicity to X. ephippiatus. Amamectin benzoate can reduce the populations of X. ephippiatus by 58.1-61.4%, but the populations can recover at the end of the experiment. Chlorantraniliprole was relatively safe to X. ephippiatus. It only reduced the populations of X. ephippiatus by 22.3-33.0%, and the populations can totally recover 9 d after application.展开更多
基金funded by the National Natural Science Foundation of China under Grant No.61602162.
文摘The massive influx of traffic on the Internet has made the composition of web traffic increasingly complex.Traditional port-based or protocol-based network traffic identification methods are no longer suitable for today’s complex and changing networks.Recently,machine learning has beenwidely applied to network traffic recognition.Still,high-dimensional features and redundant data in network traffic can lead to slow convergence problems and low identification accuracy of network traffic recognition algorithms.Taking advantage of the faster optimizationseeking capability of the jumping spider optimization algorithm(JSOA),this paper proposes a jumping spider optimization algorithmthat incorporates the harris hawk optimization(HHO)and small hole imaging(HHJSOA).We use it in network traffic identification feature selection.First,the method incorporates the HHO escape energy factor and the hard siege strategy to forma newsearch strategy for HHJSOA.This location update strategy enhances the search range of the optimal solution of HHJSOA.We use small hole imaging to update the inferior individual.Next,the feature selection problem is coded to propose a jumping spiders individual coding scheme.Multiple iterations of the HHJSOA algorithmfind the optimal individual used as the selected feature for KNN classification.Finally,we validate the classification accuracy and performance of the HHJSOA algorithm using the UNSW-NB15 dataset and KDD99 dataset.Experimental results show that compared with other algorithms for the UNSW-NB15 dataset,the improvement is at least 0.0705,0.00147,and 1 on the accuracy,fitness value,and the number of features.In addition,compared with other feature selectionmethods for the same datasets,the proposed algorithmhas faster convergence,better merit-seeking,and robustness.Therefore,HHJSOAcan improve the classification accuracy and solve the problem that the network traffic recognition algorithm needs to be faster to converge and easily fall into local optimum due to high-dimensional features.
基金supported by the First Batch of Teaching Reform Projects of Zhejiang Higher Education“14th Five-Year Plan”(jg20220434)Special Scientific Research Project for Space Debris and Near-Earth Asteroid Defense(KJSP2020020202)+1 种基金Natural Science Foundation of Zhejiang Province(LGG19F030010)National Natural Science Foundation of China(61703183).
文摘As a new bionic algorithm,Spider Monkey Optimization(SMO)has been widely used in various complex optimization problems in recent years.However,the new space exploration power of SMO is limited and the diversity of the population in SMO is not abundant.Thus,this paper focuses on how to reconstruct SMO to improve its performance,and a novel spider monkey optimization algorithm with opposition-based learning and orthogonal experimental design(SMO^(3))is developed.A position updatingmethod based on the historical optimal domain and particle swarmfor Local Leader Phase(LLP)andGlobal Leader Phase(GLP)is presented to improve the diversity of the population of SMO.Moreover,an opposition-based learning strategy based on self-extremum is proposed to avoid suffering from premature convergence and getting stuck at locally optimal values.Also,a local worst individual elimination method based on orthogonal experimental design is used for helping the SMO algorithm eliminate the poor individuals in time.Furthermore,an extended SMO^(3)named CSMO^(3)is investigated to deal with constrained optimization problems.The proposed algorithm is applied to both unconstrained and constrained functions which include the CEC2006 benchmark set and three engineering problems.Experimental results show that the performance of the proposed algorithm is better than three well-known SMO algorithms and other evolutionary algorithms in unconstrained and constrained problems.
文摘To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial population is generated by a refracted opposition-based learning strategy to enhance diversity and ergodicity.Second,this paper introduces a non-linear adaptive dynamic weight factor to improve convergence efficiency.Then,using the crisscross strategy,using the horizontal crossover to enhance the global search and vertical crossover to keep the diversity of the population to avoid being trapped in the local optimum.At last,we adopt a Gauss-Cauchy mutation strategy to improve the stability of the algorithm by mutation of the optimal individuals.Therefore,the application of ISMO is validated by ten benchmark functions and feature selection.It is proved that the proposed method can resolve the problem of feature selection.
基金supported by the Research Program of Civil Aviation Administration of China (No.MHRD0622)
文摘The distinct network organization, management, service and operating characteristics of US Southwest Airlines are key elements of its success compared with other airlines. As a network organization type, the spider web airline network has received more attention. In this paper, we analyzed the relation between the spider web airline network and spider web, and the structure of spider web airline network, built the assignment model of the spider web airline network,and investigated the economics concerned.
基金supported by the China Agriculture Research System(CARS-02)the Public Welfare Project from Ministry of Agriculture of the People’s Republic of China(201203025)
文摘Distribution of horizontal boom produced droplets downwards into maize canopies at flowering period and its effects on the efficacies of emamectin benzoate, lambda-cyhalothrin and chlorantraniliprole against the second generation of Asian corn borer (ACB) larvae and their toxicity to spiders were studied. When insecticides were sprayed downwards into the maize canopies, randomly filtering out droplets by upper leaves led to great variations of droplet coverage and density within the canopies. Consequently, the efficacies of lambda-cyhalothrin and emamectin benzoate against ACB larvae were decreased because of randomly filtering out droplets by upper leaves. But field investigation showed that lambda-cyhalothrin was extremely toxic to hunting spiders, Xysticus ephippiatus, and not suitable to IPM programs in regulation of the second generation of ACB. Therefore, randomly filtering out droplets by upper leaves decreased lambda-cyhalothrin's efficacy against ACB larvae, but did little to decrease its toxicity to X. ephippiatus. Amamectin benzoate can reduce the populations of X. ephippiatus by 58.1-61.4%, but the populations can recover at the end of the experiment. Chlorantraniliprole was relatively safe to X. ephippiatus. It only reduced the populations of X. ephippiatus by 22.3-33.0%, and the populations can totally recover 9 d after application.