Security testing is a critical concern for organizations worldwide due to the potential financial setbacks and damage to reputation caused by insecure software systems.One of the challenges in software security testin...Security testing is a critical concern for organizations worldwide due to the potential financial setbacks and damage to reputation caused by insecure software systems.One of the challenges in software security testing is test case prioritization,which aims to reduce redundancy in fault occurrences when executing test suites.By effectively applying test case prioritization,both the time and cost required for developing secure software can be reduced.This paper proposes a test case prioritization technique based on the Ant Colony Optimization(ACO)algorithm,a metaheuristic approach.The performance of the ACO-based technique is evaluated using the Average Percentage of Fault Detection(APFD)metric,comparing it with traditional techniques.It has been applied to a Mobile Payment Wallet application to validate the proposed approach.The results demonstrate that the proposed technique outperforms the traditional techniques in terms of the APFD metric.The ACO-based technique achieves an APFD of approximately 76%,two percent higher than the second-best optimal ordering technique.These findings suggest that metaheuristic-based prioritization techniques can effectively identify the best test cases,saving time and improving software security overall.展开更多
A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the s...A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.展开更多
To efficiently complete a complex computation task,the complex task should be decomposed into subcomputation tasks that run parallel in edge computing.Wireless Sensor Network(WSN)is a typical application of parallel c...To efficiently complete a complex computation task,the complex task should be decomposed into subcomputation tasks that run parallel in edge computing.Wireless Sensor Network(WSN)is a typical application of parallel computation.To achieve highly reliable parallel computation for wireless sensor network,the network's lifetime needs to be extended.Therefore,a proper task allocation strategy is needed to reduce the energy consumption and balance the load of the network.This paper proposes a task model and a cluster-based WSN model in edge computing.In our model,different tasks require different types of resources and different sensors provide different types of resources,so our model is heterogeneous,which makes the model more practical.Then we propose a task allocation algorithm that combines the Genetic Algorithm(GA)and the Ant Colony Optimization(ACO)algorithm.The algorithm concentrates on energy conservation and load balancing so that the lifetime of the network can be extended.The experimental result shows the algorithm's effectiveness and advantages in energy conservation and load balancing.展开更多
Traditional material handling vehicles often use internal combustion engines as their power source, which results in exhaust emissions that pollute the environment. In contrast, automated material handling vehicles ha...Traditional material handling vehicles often use internal combustion engines as their power source, which results in exhaust emissions that pollute the environment. In contrast, automated material handling vehicles have the advantages of zero emissions, low noise, and low vibration, thus avoiding exhaust pollution and providing a more comfortable working environment for operators. In order to achieve the goals of “peaking carbon emissions by 2030 and achieving carbon neutrality by 2060”, the use of environmentally friendly autonomous material handling vehicles for material transportation is an inevitable trend. To maximize the amount of transported materials, consider peak-to-valley electricity pricing, battery pack procurement, and the construction of charging and swapping stations while achieving “minimum daily transportation volume” and “lowest investment and operational cost over a 3-year settlement period” with the shortest overall travel distance for all material handling vehicles, this paper examines two different scenarios and establishes goal programming models. The appropriate locations for material handling vehicle swapping stations and vehicle battery pack scheduling schemes are then developed using the NSGA-II algorithm and ant colony optimization algorithm. The results show that, while ensuring a daily transportation volume of no less than 300 vehicles, the lowest investment and operational cost over a 3-year settlement period is approximately 24.1 million Yuan. The material handling vehicles follow the shortest path of 119.2653 km passing through the designated retrieval points and have two shortest routes. Furthermore, the advantages and disadvantages of the proposed models are analyzed, followed by an evaluation, deepening, and potential extension of the models. Finally, future research directions in this field are suggested.展开更多
The ant colony optimization algorithm has been widely studied and many important results have been obtained.Though this algorithm has been applied to many fields,the analysis about its convergence is much less,which w...The ant colony optimization algorithm has been widely studied and many important results have been obtained.Though this algorithm has been applied to many fields,the analysis about its convergence is much less,which will influence the improvement of this algorithm.Therefore,the convergence of this algorithm applied to the traveling salesman problem(TSP)was analyzed in detail.The conclusion that this algorithm will definitely converge to the optimal solution under the condition of 0<q_(0)<1 was proved true.In addition,the influence on its convergence caused by the properties of the closed path,heuristic functions,the pheromone and q_(0) was analyzed.Based on the above-mentioned,some conclusions about how to improve the speed of its convergence are obtained.展开更多
In view of the serious reactive power loss in the rural network,improved ant colony optimization algorithm(ACOA)was used to optimize the reactive power compensation for the rural distribution system.In this study,the ...In view of the serious reactive power loss in the rural network,improved ant colony optimization algorithm(ACOA)was used to optimize the reactive power compensation for the rural distribution system.In this study,the traditional ACOA was improved in two aspects:one was the local search strategy,and the other was pheromone mutation and re-initialization strategies.The reactive power optimization for a county's distribution network showed that the improved ACOA was practicable.展开更多
As a typical screening apparatus,the elliptically vibrating screen was extensively employed for the size classification of granular materials.Unremitting efforts have been paid on the improvement of sieving performanc...As a typical screening apparatus,the elliptically vibrating screen was extensively employed for the size classification of granular materials.Unremitting efforts have been paid on the improvement of sieving performance,but the optimization problem was still perplexing the researchers due to the complexity of sieving process.In the present paper,the sieving process of elliptically vibrating screen was numerically simulated based on the Discrete Element Method(DEM).The production quality and the processing capacity of vibrating screen were measured by the screening efficiency and the screening time,respectively.The sieving parameters including the length of semi-major axis,the length ratio of two semi-axes,the vibration frequency,the inclination angle,the vibration direction angle and the motion direction of screen deck were investigated.Firstly,the Gradient Boosting Decision Trees(GBDT)algorithm was adopted in the modelling task of screening data.The trained prediction models with sufficient generalization performance were obtained,and the relative importance of six parameters for both the screening indexes was revealed.After that,a hybrid MACO-GBDT algorithm based on the Ant Colony Optimization(ACO)was proposed for optimizing the sieving performance of vibrating screen.Both the single objective optimization of screening efficiency and the stepwise optimization of screening results were conducted.Ultimately,the reliability of the MACO-GBDT algorithm were examined by the numerical experiments.The optimization strategy provided in this work would be helpful for the parameter design and the performance improvement of vibrating screens.展开更多
基金Deanship of Scientific Research at King Khalid University for funding this work through Large Group Research Project under Grant Number RGP2/249/44.
文摘Security testing is a critical concern for organizations worldwide due to the potential financial setbacks and damage to reputation caused by insecure software systems.One of the challenges in software security testing is test case prioritization,which aims to reduce redundancy in fault occurrences when executing test suites.By effectively applying test case prioritization,both the time and cost required for developing secure software can be reduced.This paper proposes a test case prioritization technique based on the Ant Colony Optimization(ACO)algorithm,a metaheuristic approach.The performance of the ACO-based technique is evaluated using the Average Percentage of Fault Detection(APFD)metric,comparing it with traditional techniques.It has been applied to a Mobile Payment Wallet application to validate the proposed approach.The results demonstrate that the proposed technique outperforms the traditional techniques in terms of the APFD metric.The ACO-based technique achieves an APFD of approximately 76%,two percent higher than the second-best optimal ordering technique.These findings suggest that metaheuristic-based prioritization techniques can effectively identify the best test cases,saving time and improving software security overall.
文摘A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.
基金supported by Postdoctoral Science Foundation of China(No.2021M702441)National Natural Science Foundation of China(No.61871283)。
文摘To efficiently complete a complex computation task,the complex task should be decomposed into subcomputation tasks that run parallel in edge computing.Wireless Sensor Network(WSN)is a typical application of parallel computation.To achieve highly reliable parallel computation for wireless sensor network,the network's lifetime needs to be extended.Therefore,a proper task allocation strategy is needed to reduce the energy consumption and balance the load of the network.This paper proposes a task model and a cluster-based WSN model in edge computing.In our model,different tasks require different types of resources and different sensors provide different types of resources,so our model is heterogeneous,which makes the model more practical.Then we propose a task allocation algorithm that combines the Genetic Algorithm(GA)and the Ant Colony Optimization(ACO)algorithm.The algorithm concentrates on energy conservation and load balancing so that the lifetime of the network can be extended.The experimental result shows the algorithm's effectiveness and advantages in energy conservation and load balancing.
文摘Traditional material handling vehicles often use internal combustion engines as their power source, which results in exhaust emissions that pollute the environment. In contrast, automated material handling vehicles have the advantages of zero emissions, low noise, and low vibration, thus avoiding exhaust pollution and providing a more comfortable working environment for operators. In order to achieve the goals of “peaking carbon emissions by 2030 and achieving carbon neutrality by 2060”, the use of environmentally friendly autonomous material handling vehicles for material transportation is an inevitable trend. To maximize the amount of transported materials, consider peak-to-valley electricity pricing, battery pack procurement, and the construction of charging and swapping stations while achieving “minimum daily transportation volume” and “lowest investment and operational cost over a 3-year settlement period” with the shortest overall travel distance for all material handling vehicles, this paper examines two different scenarios and establishes goal programming models. The appropriate locations for material handling vehicle swapping stations and vehicle battery pack scheduling schemes are then developed using the NSGA-II algorithm and ant colony optimization algorithm. The results show that, while ensuring a daily transportation volume of no less than 300 vehicles, the lowest investment and operational cost over a 3-year settlement period is approximately 24.1 million Yuan. The material handling vehicles follow the shortest path of 119.2653 km passing through the designated retrieval points and have two shortest routes. Furthermore, the advantages and disadvantages of the proposed models are analyzed, followed by an evaluation, deepening, and potential extension of the models. Finally, future research directions in this field are suggested.
基金supported by the National Natural Science Foundation of China (Grant No.60673102)the Natural Science Foundation of Jiangsu Province of China (Grant No.BK2006218).
文摘The ant colony optimization algorithm has been widely studied and many important results have been obtained.Though this algorithm has been applied to many fields,the analysis about its convergence is much less,which will influence the improvement of this algorithm.Therefore,the convergence of this algorithm applied to the traveling salesman problem(TSP)was analyzed in detail.The conclusion that this algorithm will definitely converge to the optimal solution under the condition of 0<q_(0)<1 was proved true.In addition,the influence on its convergence caused by the properties of the closed path,heuristic functions,the pheromone and q_(0) was analyzed.Based on the above-mentioned,some conclusions about how to improve the speed of its convergence are obtained.
基金Supported by China Postdoctoral Science Foundation(20090460873)
文摘In view of the serious reactive power loss in the rural network,improved ant colony optimization algorithm(ACOA)was used to optimize the reactive power compensation for the rural distribution system.In this study,the traditional ACOA was improved in two aspects:one was the local search strategy,and the other was pheromone mutation and re-initialization strategies.The reactive power optimization for a county's distribution network showed that the improved ACOA was practicable.
基金The research work is financially supported by National Natural Science Foundation of China(No.51775113)Natural Science Foundation of Fujian Province(No.2017J01675)+2 种基金51st Scientific Research Fund Program of Fujian University of Technology(No.GY-Z160139)Key Research Platform of NC Equipment and Technology in Fujian Province(No.2014H2002)Subsidized Project for Postgraduates’Innovative Fund in Scientific Research of Huaqiao University(No.17013080007).
文摘As a typical screening apparatus,the elliptically vibrating screen was extensively employed for the size classification of granular materials.Unremitting efforts have been paid on the improvement of sieving performance,but the optimization problem was still perplexing the researchers due to the complexity of sieving process.In the present paper,the sieving process of elliptically vibrating screen was numerically simulated based on the Discrete Element Method(DEM).The production quality and the processing capacity of vibrating screen were measured by the screening efficiency and the screening time,respectively.The sieving parameters including the length of semi-major axis,the length ratio of two semi-axes,the vibration frequency,the inclination angle,the vibration direction angle and the motion direction of screen deck were investigated.Firstly,the Gradient Boosting Decision Trees(GBDT)algorithm was adopted in the modelling task of screening data.The trained prediction models with sufficient generalization performance were obtained,and the relative importance of six parameters for both the screening indexes was revealed.After that,a hybrid MACO-GBDT algorithm based on the Ant Colony Optimization(ACO)was proposed for optimizing the sieving performance of vibrating screen.Both the single objective optimization of screening efficiency and the stepwise optimization of screening results were conducted.Ultimately,the reliability of the MACO-GBDT algorithm were examined by the numerical experiments.The optimization strategy provided in this work would be helpful for the parameter design and the performance improvement of vibrating screens.