Search

In industry, the task of defect classification and defect localization is an important part of defect detection system. However, existing studies only focus on one task and it is difficult to ensure the accuracy of both tasks. This paper proposes a defect detection system based on improved Yolo_v4, which greatly improves the detection ability of minor defects. For K_Means algorithm clustering prianchors question with strong subjectivity, the paper proposes the Density Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm to determine the number of Anchors. To solve the problem of low detection rate of small targets caused by insufficient reuse rate of low-level features in CSPDarknet53 feature extraction network, this paper proposes an ECA-DenseNet-BC-121 feature extraction network to improve it. And the Dual Channel Feature Enhancement (DCFE) module is proposed to improve the local information loss and gradient propagation obstruction caused by quad chain convolution in PANet networks to improve the robustness of the model. The experimental results on the fabric surface defect detection datasets show that the mAP of the improved Yolo_v4 is 98.97%, which is 7.67% higher than SSD, 3.75% higher than Faster_RCNN, 10.82% higher than Yolo_v4 tiny, and 5.35% higher than Yolo_v4, and the detection speed reaches 39.4 fps. It can meet the real-time monitoring needs of industrial sites. [ABSTRACT FROM AUTHOR]

To solve the problem of oscillation instability in permanent magnetic synchronous generator (PMSG)-based wind power connected systems during low-voltage ride through (LVRT) process, a parameter adjustment strategy based on interaction energy path optimization is proposed in this paper. Firstly, a modular state-space model of PMSG under fault transient conditions is constructed, and the system is divided into five subsystems. Then, the dynamic energy function of subsystems reflecting the oscillation stability of the system is derived. Based on that, the dynamic energy flow path is described considering the introduction of LVRT control. On this basis, the interaction energy between LVRT control links and subsystems is analyzed, and the coupling mechanism of voltage support and damping characteristics in the LVRT process is explained. Further, aiming at the optimal change rate of the total interaction energy in the LVRT process, the adjustment strategy of LVRT control parameters is constructed to meet voltage and damping requirements. Finally, a PMSG-connected system model is built on the MATLAB/Simulink platform to verify the effectiveness of the adjustment strategy. The results show that the proposed method can effectively improve the damping level under the fault transient condition, as well as supporting system voltage. [ABSTRACT FROM AUTHOR]

The Manta Ray Foraging Optimization Algorithm (MRFO) is a metaheuristic algorithm for solving real-world problems. However, MRFO suffers from slow convergence precision and is easily trapped in a local optimal. Hence, to overcome these deficiencies, this paper proposes an Improved MRFO algorithm (IMRFO) that employs Tent chaotic mapping, the bidirectional search strategy, and the Levy flight strategy. Among these strategies, Tent chaotic mapping distributes the manta ray more uniformly and improves the quality of the initial solution, while the bidirectional search strategy expands the search area. The Levy flight strategy strengthens the algorithm's ability to escape from local optimal. To verify IMRFO's performance, the algorithm is compared with 10 other algorithms on 23 benchmark functions, the CEC2017 and CEC2022 benchmark suites, and five engineering problems, with statistical analysis illustrating the superiority and significance of the difference between IMRFO and other algorithms. The results indicate that the IMRFO outperforms the competitor optimization algorithms. [ABSTRACT FROM AUTHOR]

Drones play an important role in modern cities, they bring convenience but also bring corresponding risks. Falling drones can cause casualties or damage to urban facilities and serious property damage, which increases the third-party risk problem. An effective way to reduce these third-party risks is to avoid high-risk areas in path planning, but most current path planning methods are optimized to minimize flight distance, and third-party risk costs are rarely considered. In this paper, a comprehensive risk-cost UAV path planning method is proposed, which evaluates urban risk by establishing a third-party risk model that incorporates obstacle risk, death risk, and property loss risk. This paper proposes a Min-cost A* algorithm based on city risk assessment, and smooths the generated low-risk path through the improved Floyd algorithm. The results show that the path planning method can effectively reduce the risk in the flight path, improve the reliability of the UAV flight path in the urban environment, and solve the problem of planning the third-party risk path of the UAV. [ABSTRACT FROM AUTHOR]

Due to the increasing complexity of decision problems, many managers employ multiple experts to reach a good decision in a group decision making. Now, if there is ambiguity in the evaluation of experts, the use of fuzzy numbers can be useful for each expert. In these situations, the use of hesitant fuzzy numbers (HFNs) which consists of several fuzzy numbers with special conditions can be suggested. HFNs are as an extension of the fuzzy numbers to take a better determining the membership functions of the parameters by several experts. Because of simple and fast calculations, in this paper, we use triangular HFNs in the pairwise comparison matrix of analytic hierarchy process by opinions of a group of decision makers in a hesitant fuzzy environment. We define consistency of the hesitant fuzzy pairwise comparison matrix and use the arithmetic operations on the HFNs and a new method of comparing HFNs to get the hesitant fuzzy performance score. By using score function to hesitant fuzzy score we can get a final score for alternatives. Finally, a practical example is provided to show the the effectiveness of this study. The obtained results from this paper show that new method can get a better answer by keeping the experts' opinions in the process of solving the problem. [ABSTRACT FROM AUTHOR]

Aiming at the problem of multi-object detection such as target occlusion and tiny targets in road scenes, this paper proposes an improved YOLOv5 multi-object detection model based on ML-AFP (multi-level aggregation feature perception) mechanism. Since tiny targets such as non-motor vehicle and pedestrians are not easily detected, this paper adds a micro target detection layer and a double head mechanism to improve the detection ability of tiny targets. Varifocal loss is used to achieve a more accurate ranking in the process of non-maximum suppression to solve the problem of target occlusion, and this paper also proposes a ML-AFP mechanism. The adaptive fusion of spatial feature information at different scales improves the expression ability of network model features, and improves the detection accuracy of the model as a whole. Our experimental results on multiple challenging datasets such as KITTI, BDD100K, and show that the accuracy, recall rate and mAP value of the proposed model are greatly improved, which solves the problem of multi-object detection in crowded road scenes. [ABSTRACT FROM AUTHOR]

The optimal operation of reservoir groups is a strongly constrained, multi-stage, and high-dimensional optimization problem. In response to this issue, this article couples the standard Pelican optimization algorithm with adaptive ε constraint methods, and further improves the optimization performance of the algorithm by initializing the population with a good point set, reverse differential evolution, and optimal individual t-distribution perturbation strategy. Based on this, an improved Pelican algorithm coupled with adaptive ε constraint method is proposed (ε-IPOA). The performance of the algorithm was tested through 24 constraint testing functions to find the optimal ability and solve constraint optimization problems. The results showed that the algorithm has strong optimization ability and stable performance. In this paper, we select Sanmenxia and Xiaolangdi reservoirs as the research objects, establish the maximum peak-cutting model of terrace reservoirs, apply the ε-IPOA algorithm to solve the model, and compare it with the ε-POA (Pelican algorithm coupled with adaptive ε constraint method) and ε-DE (Differential Evolution Algorithm) algorithms, the results indicate that ε. The peak flow rate of the Huayuankou control point solved by the IPOA algorithm is 12,319 m3/s, which is much lower than the safe overflow flow rate of 22,000 m3/s at the Huayuankou control point, with a peak shaving rate of 44%, and other algorithms do not find effective solutions meeting the constraint conditions. This paper provides a new idea for solving the problem of flood control optimal operation of cascade reservoirs. [ABSTRACT FROM AUTHOR]

To overcome the disadvantages of premature convergence and easy trapping into local optimum solutions, this paper proposes an improved particle swarm optimization algorithm (named NDWPSO algorithm) based on multiple hybrid strategies. Firstly, the elite opposition-based learning method is utilized to initialize the particle position matrix. Secondly, the dynamic inertial weight parameters are given to improve the global search speed in the early iterative phase. Thirdly, a new local optimal jump-out strategy is proposed to overcome the "premature" problem. Finally, the algorithm applies the spiral shrinkage search strategy from the whale optimization algorithm (WOA) and the Differential Evolution (DE) mutation strategy in the later iteration to accelerate the convergence speed. The NDWPSO is further compared with other 8 well-known nature-inspired algorithms (3 PSO variants and 5 other intelligent algorithms) on 23 benchmark test functions and three practical engineering problems. Simulation results prove that the NDWPSO algorithm obtains better results for all 49 sets of data than the other 3 PSO variants. Compared with 5 other intelligent algorithms, the NDWPSO obtains 69.2%, 84.6%, and 84.6% of the best results for the benchmark function ( f 1 - f 13 ) with 3 kinds of dimensional spaces (Dim = 30,50,100) and 80% of the best optimal solutions for 10 fixed-multimodal benchmark functions. Also, the best design solutions are obtained by NDWPSO for all 3 classical practical engineering problems. [ABSTRACT FROM AUTHOR]

To overcome the disadvantages of premature convergence and easy trapping into local optimum solutions, this paper proposes an improved particle swarm optimization algorithm (named NDWPSO algorithm) based on multiple hybrid strategies. Firstly, the elite opposition-based learning method is utilized to initialize the particle position matrix. Secondly, the dynamic inertial weight parameters are given to improve the global search speed in the early iterative phase. Thirdly, a new local optimal jump-out strategy is proposed to overcome the "premature" problem. Finally, the algorithm applies the spiral shrinkage search strategy from the whale optimization algorithm (WOA) and the Differential Evolution (DE) mutation strategy in the later iteration to accelerate the convergence speed. The NDWPSO is further compared with other 8 well-known nature-inspired algorithms (3 PSO variants and 5 other intelligent algorithms) on 23 benchmark test functions and three practical engineering problems. Simulation results prove that the NDWPSO algorithm obtains better results for all 49 sets of data than the other 3 PSO variants. Compared with 5 other intelligent algorithms, the NDWPSO obtains 69.2%, 84.6%, and 84.6% of the best results for the benchmark function ( f 1 - f 13 ) with 3 kinds of dimensional spaces (Dim = 30,50,100) and 80% of the best optimal solutions for 10 fixed-multimodal benchmark functions. Also, the best design solutions are obtained by NDWPSO for all 3 classical practical engineering problems. [ABSTRACT FROM AUTHOR]

Removal of volatile organic compounds (VOCs) from the air has been an important issue in many industrial fields. Traditionally, the operation of VOCs removal systems has relied on fixed operating conditions determined by domain experts based on their expertise and intuition. In practice, this manual operation cannot respond immediately to changes in the system environment. To facilitate the autonomous operation of the system, the operating conditions should be optimized properly in real time to adapt to the changes in the system environment. Recently, optimization frameworks have been widely applied to real-world industrial systems across various domains using different approaches. The primary motivation for this study is the effective implementation of an optimization framework targeting a VOCs removal system. In this paper, we present a data-driven autonomous operation method for optimizing the operating conditions of a VOCs removal system to enhance the overall performance. An optimization problem is formulated with the decision variables denoting the parameters associated with the operating condition, the environmental variables representing the measurements for the system environment, the constraints specifying the control ranges of the parameters, and the objective function representing the system performance as determined by the operating conditions and environment. Using the previous operation data from the system, a neural network is trained to model the system performance as a function of the decision and environmental variables to approximate the objective function. For the current state of the system environment, the optimal operating condition is derived by solving the optimization problem. A case study of a targeted VOCs removal system demonstrates that the proposed method effectively optimizes the operating conditions for improved system performance without intervention from domain experts. [ABSTRACT FROM AUTHOR]

Addressing the challenge of efficiently solving multi-objective optimization problems (MOP) and attaining satisfactory optimal solutions has always posed a formidable task. In this paper, based on the chicken swarm optimization algorithm, proposes the non-dominated sorting chicken swarm optimization (NSCSO) algorithm. The proposed approach involves assigning ranks to individuals in the chicken swarm through fast non-dominance sorting and utilizing the crowding distance strategy to sort particles within the same rank. The MOP is tackled based on these two strategies, with the integration of an elite opposition-based learning strategy to facilitate the exploration of optimal solution directions by individual roosters. NSCSO and 6 other excellent algorithms were tested in 15 different benchmark functions for experiments. By comprehensive comparison of the test function results and Friedman test results, the results obtained by using the NSCSO algorithm to solve the MOP problem have better performance. Compares the NSCSO algorithm with other multi-objective optimization algorithms in six different engineering design problems. The results show that NSCSO not only performs well in multi-objective function tests, but also obtains realistic solutions in multi-objective engineering example problems. [ABSTRACT FROM AUTHOR]

Metaheuristic algorithms, widely applied across various domains due to their simplicity and strong optimization capabilities, play a crucial role in problem-solving. While the Aquila Optimizer is recognized for its effectiveness, it often exhibits slow convergence rates and susceptibility to local optima in certain scenarios. To address these concerns, this paper introduces an enhanced version, termed Tent-enhanced Aquila Optimizer (TEAO). TEAO incorporates the Tent chaotic map to initialize the Aquila population, promoting a more uniform distribution within the solution space. To balance exploration and exploitation, novel formulas are proposed, accelerating convergence while ensuring precision. The effectiveness of the TEAO algorithm is validated through a comprehensive comparison with 14 state-of-the-art algorithms using 23 classical benchmark test functions. Additionally, to assess the practical feasibility of the approach, TEAO is applied to six constrained engineering problems and benchmarked against the performance of the same 14 algorithms. All experimental results consistently demonstrate that TEAO outperforms other advanced algorithms in terms of solution quality and stability, establishing it as a more competitive choice for optimization tasks. [ABSTRACT FROM AUTHOR]

Aiming at the problem of multi-object detection such as target occlusion and tiny targets in road scenes, this paper proposes an improved YOLOv5 multi-object detection model based on ML-AFP (multi-level aggregation feature perception) mechanism. Since tiny targets such as non-motor vehicle and pedestrians are not easily detected, this paper adds a micro target detection layer and a double head mechanism to improve the detection ability of tiny targets. Varifocal loss is used to achieve a more accurate ranking in the process of non-maximum suppression to solve the problem of target occlusion, and this paper also proposes a ML-AFP mechanism. The adaptive fusion of spatial feature information at different scales improves the expression ability of network model features, and improves the detection accuracy of the model as a whole. Our experimental results on multiple challenging datasets such as KITTI, BDD100K, and show that the accuracy, recall rate and mAP value of the proposed model are greatly improved, which solves the problem of multi-object detection in crowded road scenes. [ABSTRACT FROM AUTHOR]

The optimal operation of reservoir groups is a strongly constrained, multi-stage, and high-dimensional optimization problem. In response to this issue, this article couples the standard Pelican optimization algorithm with adaptive ε constraint methods, and further improves the optimization performance of the algorithm by initializing the population with a good point set, reverse differential evolution, and optimal individual t-distribution perturbation strategy. Based on this, an improved Pelican algorithm coupled with adaptive ε constraint method is proposed (ε-IPOA). The performance of the algorithm was tested through 24 constraint testing functions to find the optimal ability and solve constraint optimization problems. The results showed that the algorithm has strong optimization ability and stable performance. In this paper, we select Sanmenxia and Xiaolangdi reservoirs as the research objects, establish the maximum peak-cutting model of terrace reservoirs, apply the ε-IPOA algorithm to solve the model, and compare it with the ε-POA (Pelican algorithm coupled with adaptive ε constraint method) and ε-DE (Differential Evolution Algorithm) algorithms, the results indicate that ε. The peak flow rate of the Huayuankou control point solved by the IPOA algorithm is 12,319 m3/s, which is much lower than the safe overflow flow rate of 22,000 m3/s at the Huayuankou control point, with a peak shaving rate of 44%, and other algorithms do not find effective solutions meeting the constraint conditions. This paper provides a new idea for solving the problem of flood control optimal operation of cascade reservoirs. [ABSTRACT FROM AUTHOR]

High-dimensional optimization has numerous potential applications in both academia and industry. It is a major challenge for optimization algorithms to generate very accurate solutions in high-dimensional search spaces. However, traditional search tools are prone to dimensional catastrophes and local optima, thus failing to provide high-precision results. To solve these problems, a novel hermit crab optimization algorithm (the HCOA) is introduced in this paper. Inspired by the group behaviour of hermit crabs, the HCOA combines the optimal search and historical path search to balance the depth and breadth searches. In the experimental section of the paper, the HCOA competes with 5 well-known metaheuristic algorithms in the CEC2017 benchmark functions, which contain 29 functions, with 23 of these ranking first. The state of work BPSO-CM is also chosen to compare with the HCOA, and the competition shows that the HCOA has a better performance in the 100-dimensional test of the CEC2017 benchmark functions. All the experimental results demonstrate that the HCOA presents highly accurate and robust results for high-dimensional optimization problems. [ABSTRACT FROM AUTHOR]

Collaboration is a key driver of science and innovation. Mainly motivated by the need to leverage different capacities and expertise to solve a scientific problem, collaboration is also an excellent source of information about the future behavior of scholars. In particular, it allows us to infer the likelihood that scientists choose future research directions via the intertwined mechanisms of selection and social influence. Here we thoroughly investigate the interplay between collaboration and topic switches. We find that the probability for a scholar to start working on a new topic increases with the number of previous collaborators, with a pattern showing that the effects of individual collaborators are not independent. The higher the productivity and the impact of authors, the more likely their coworkers will start working on new topics. The average number of coauthors per paper is also inversely related to the topic switch probability, suggesting a dilution of this effect as the number of collaborators increases. [ABSTRACT FROM AUTHOR]

Unmanned Aerial Vehicles are useful tools for many applications. However, autonomous path planning for Unmanned Aerial Vehicles in unfamiliar environments is a challenging problem when facing a series of problems such as poor consistency, high influence by the native controller of the Unmanned Aerial Vehicles. In this paper, we investigate reinforcement learning-based autonomous local path planning methods for Unmanned Aerial Vehicles with high autonomous decision-making capability and locally high portability. We propose an autonomous local path planning algorithm based on the TD3 strategy to solve the problem of local obstacle avoidance and path planning in unfamiliar environments using autonomous decision-making of Unmanned Aerial Vehicles. The simulation results on Gazebo show that our method can effectively realize the autonomous local path planning task for Unmanned Aerial Vehicles, the success rate of path planning with our method can reach 93% under the interference of no obstacles, and 92% in the environment with obstacles. Finally, our method can be used for autonomous path planning of Unmanned Aerial Vehicles in unfamiliar environments. [ABSTRACT FROM AUTHOR]

In this paper, with motivation from the No Free Lunch theorem, a new human-based metaheuristic algorithm named Preschool Education Optimization Algorithm (PEOA) is introduced for solving optimization problems. Human activities in the preschool education process are the fundamental inspiration in the design of PEOA. Hence, PEOA is mathematically modeled in three phases: (i) the gradual growth of the preschool teacher's educational influence, (ii) individual knowledge development guided by the teacher, and (iii) individual increase of knowledge and self-awareness. The PEOA's performance in optimization is evaluated using fifty-two standard benchmark functions encompassing unimodal, high-dimensional multimodal, and fixed-dimensional multimodal types, as well as the CEC 2017 test suite. The optimization results show that PEOA has a high ability in exploration–exploitation and can balance them during the search process. To provide a comprehensive analysis, the performance of PEOA is compared against ten well-known metaheuristic algorithms. The simulation results show that the proposed PEOA approach performs better than competing algorithms by providing effective solutions for the benchmark functions and overall ranking as the first-best optimizer. Presenting a statistical analysis of the Wilcoxon signed-rank test shows that PEOA has significant statistical superiority in competition with compared algorithms. Furthermore, the implementation of PEOA in solving twenty-two optimization problems from the CEC 2011 test suite and four engineering design problems illustrates its efficacy in real-world optimization applications. [ABSTRACT FROM AUTHOR]

Under the shared big data environment, the existing shared data auditing schemes rarely consider the authorization management of group users. Thus, in this paper, we propose a novel remote shared data checking possession scheme that support group authority management. To implement group user rights management, we firstly introduce a trusted entity group manager. To assist the group manager in authorization management, we formalize a new algebraic structure operator named authorization invisible authenticator (AIA). Meanwhile, we provide a basic AIA scheme for general security scenarios and a standard AIA scheme suitable for high-level security scenarios respectively. The standard AIA scheme can fully meet the needs of the group manager to safely perform rights management work. It is composed of the User Information Table (UIT) and the basic AIA scheme, which has higher security and is applicable to a wider range of scenarios. By distributing AIA through the standard AIA scheme, the group manager can easily carry out authority management, including enrolling, revoking, updating. After solving the problem of authorization management, the detailed design of the scheme based on identity-based encryption (IBE) is given. Furthermore, the security analysis and performance evaluation demonstrate that the scheme is safe and feasible. [ABSTRACT FROM AUTHOR]

In this paper, inhomogeneous chemical kinetics are simulated by describing the concentrations of interacting chemical species by a linear expansion of basis functions in such a manner that the coupled reaction and diffusion processes are propagated through time efficiently by tailor-made numerical methods. The approach is illustrated through modelling α - and γ -radiolysis in thin layers of water and at their solid interfaces from the start of the chemical phase until equilibrium was established. The method's efficiency is such that hundreds of such systems can be modelled in a few hours using a single core of a typical laptop, allowing the investigation of the effects of the underlying parameter space. Illustrative calculations showing the effects of changing dose-rate and water-layer thickness are presented. Other simulations are presented which show the approach's capability to solve problems with spherical symmetry (an approximation to an isolated radiolytic spur), where the hollowing out of an initial Gaussian distribution is observed, in line with previous calculations. These illustrative simulations show the generality and the computational efficiency of this approach to solving reaction-diffusion problems. Furthermore, these example simulations illustrate the method's suitability for simulating solid-fluid interfaces, which have received a lot of experimental attention in contrast to the lack of computational studies. [ABSTRACT FROM AUTHOR]

The COVID-19 pandemic has caused significant disruptions to the daily lives of individuals worldwide, with many losing their lives to the virus. Vaccination has been identified as a crucial strategy to combat the spread of a disease, but with a limited supply of vaccines, targeted blocking is becoming increasingly necessary. One such approach is to block a select group of individuals in the community to control the spread of the disease in its early stages. Therefore, in this paper, a method is proposed for solving this problem, based on the similarity between this issue and the problem of identifying super-spreader nodes. The proposed method attempts to select the minimum set of network nodes that, when removed, no large component remains in the network. To this end, the network is partitioned into various communities, and a method for limiting the spread of the disease to communities is proposed by blocking connecting nodes. Four real networks and four synthetics networks created using the LFR algorithm were used to evaluate the control of the disease by the selected set of nodes using each method, and the results obtained indicate better performance of the proposed method compared to other methods. [ABSTRACT FROM AUTHOR]

Online portfolio optimization with transaction costs is a big challenge in large-scale intelligent computing community, since its undersample from rapidly-changing market and complexity from varying transaction costs. In this paper, we focus on this problem and solve it by machine learning system. Specifically, we reformulate the optimization problem with the minimization over simplex containing three items, which are negative expected return, the elastic net regularization of transaction costs controlled term and portfolio variable, respectively. We propose to apply linearized augmented Lagrangian method (LALM) and the alternating direction method of multipliers (ADMM) to solve the optimization model in a higher efficiency, meanwhile theoretically guarantee their convergence and deduce closed-form solutions of their subproblems in each iteration. Furthermore, we conduct extensive experiments on five benchmark datasets from real market to demonstrate that the proposed algorithms outperform compared state-of-the-art strategies in most cases in six dimensions. [ABSTRACT FROM AUTHOR]

With the advent of the era of big data, privacy computing analyzes and calculates data on the premise of protecting data privacy, to achieve data 'available and invisible'. As an important branch of secure multi-party computation, the geometric problem can solve practical problems in the military, national defense, finance, life, and other fields, and has important research significance. In this paper, we study the similarity problem of geometric graphics. First, this paper proposes the adjacency matrix vector coding method of isomorphic graphics, and use the Paillier variant encryption cryptography to solve the problem of isomorphic graphics confidentiality under the semi-honest model. Using cryptography tools such as elliptic curve cryptosystem, zero-knowledge proof, and cut-choose method, this paper designs a graphic similarity security decision protocol that can resist malicious adversary attacks. The analysis shows that the protocol has high computational efficiency and has wide application value in terrain matching, mechanical parts, biomolecules, face recognition, and other fields. [ABSTRACT FROM AUTHOR]

This paper developed XJCT-3D, a simulation software for cooling tower wet plume dispersion. By coupling it with the Open GIS component Dotspatial, we have achieved geospatial visual representation of the calculation results, which has solved the problems of low calculation efficiency and insufficient visual representation of the traditional CFD software in the calculation of cooling tower wet plume dispersion. In order to verify the validity of the XJCT-3D software simulation results, we have conducted tracer experimental data from the ChalkPoint power plant. XJCT-3D accurately models wet plume deposition during cooling tower operation. From the XJCT-3D calculation results, we have observed that the maximum value of the cooling tower thermal plume wet deposition occurs near 610 m with a maximum value of 6.9E−07 kg/m2 s. This finding suggests that the cooling tower emissions carry a significant load of particles or droplets that have settled on surfaces at this particular altitude. It provides insights into potential environmental and human health impacts and helps in identifying and assessing areas at relatively higher risk of deposition, such as nearby ecosystems, farmland, or urban areas. This information can contribute to the development of effective mitigation strategies and the implementation of appropriate measures to minimize the impact of cooling tower emissions. [ABSTRACT FROM AUTHOR]

High-efficiency rock breaking technology is an important problem to be solved urgently in deep mining. The existing auxiliary rock breaking technology for coal mine excavation has problems such as polluting coal, high requirements for tool materials, and difficulty in subsequent washing. In this paper, an active excitation cutting system for rotary cylinder of cantilever roadheader based on alternating valve is proposed. According to the classical calculation formula of cutting load of roadheader, considering the stiffness-damping characteristics of cutting part and cutting cylinder, the simulation algorithm of cutting load is compiled based on MATLAB simulation analysis software. The excitation cutting experiments of different cutting depths are carried out on the cutting test bench, and compared with the simulation algorithm of cutting load. Taking the cutting load as the discriminant index, the influence of oil supply pressure and excitation frequency of rotary cylinder on the cutting load is analyzed based on the simulation algorithm of cutting load. The results show that the error between the simulation results and the experimental results of the active excitation state is less than 12%, and the two are in good agreement. Under the condition of 30 HZ, when the excitation amplitude is 8 Mpa, 10 Mpa, 12 Mpa, 14 Mpa, when the rotary cylinder excitation amplitude is 10 Mpa, the minimum is 131.42 KN. Compared with the rotary cylinder excitation amplitude under the condition of 10 Mpa, when the excitation frequency is 30 HZ, 35 HZ, 40 HZ, 45 HZ, when the excitation frequency is 40 HZ, the minimum is 83.08 KN, indicating that changing the excitation amplitude or oil supply pressure of the rotary cylinder is helpful to adjust the cutting performance. [ABSTRACT FROM AUTHOR]

Submarine garbage is constantly destroying the marine ecological environment and polluting the ocean. It is critical to use detection methods to quickly locate and identify submarine garbage. The background of submarine garbage images is much more complex than that of natural scene images, with object deformation and missing contours putting higher demands on the detection network. To solve the problem of low accuracy under complex backgrounds, full stage networks with auxiliary focal loss and multi-attention module are proposed for submarine garbage object detection based on YOLO. To maximize the gradient combination, a hierarchical fusion feature mechanism and a segmentation and merging strategy are used in this paper to optimize the difference in gradient combination to obtain full-stage features. Then the criss-cross attention module is used to precisely extract multi-scale features of small object dense regions while removing noise information from complex backgrounds. Finally, the auxiliary focal loss function addresses the issue of unbalanced positive and negative samples, focusing on the learning of difficult samples while improving overall detection precision. Based on comparative experiments and ablation experiments, the FSA networks achieved state-of-the-art performance, and is applicable to the real-time object detection of submarine garbage in complex backgrounds. [ABSTRACT FROM AUTHOR]

The COVID-19 pandemic has caused significant disruptions to the daily lives of individuals worldwide, with many losing their lives to the virus. Vaccination has been identified as a crucial strategy to combat the spread of a disease, but with a limited supply of vaccines, targeted blocking is becoming increasingly necessary. One such approach is to block a select group of individuals in the community to control the spread of the disease in its early stages. Therefore, in this paper, a method is proposed for solving this problem, based on the similarity between this issue and the problem of identifying super-spreader nodes. The proposed method attempts to select the minimum set of network nodes that, when removed, no large component remains in the network. To this end, the network is partitioned into various communities, and a method for limiting the spread of the disease to communities is proposed by blocking connecting nodes. Four real networks and four synthetics networks created using the LFR algorithm were used to evaluate the control of the disease by the selected set of nodes using each method, and the results obtained indicate better performance of the proposed method compared to other methods. [ABSTRACT FROM AUTHOR]

In this paper, inhomogeneous chemical kinetics are simulated by describing the concentrations of interacting chemical species by a linear expansion of basis functions in such a manner that the coupled reaction and diffusion processes are propagated through time efficiently by tailor-made numerical methods. The approach is illustrated through modelling α - and γ -radiolysis in thin layers of water and at their solid interfaces from the start of the chemical phase until equilibrium was established. The method's efficiency is such that hundreds of such systems can be modelled in a few hours using a single core of a typical laptop, allowing the investigation of the effects of the underlying parameter space. Illustrative calculations showing the effects of changing dose-rate and water-layer thickness are presented. Other simulations are presented which show the approach's capability to solve problems with spherical symmetry (an approximation to an isolated radiolytic spur), where the hollowing out of an initial Gaussian distribution is observed, in line with previous calculations. These illustrative simulations show the generality and the computational efficiency of this approach to solving reaction-diffusion problems. Furthermore, these example simulations illustrate the method's suitability for simulating solid-fluid interfaces, which have received a lot of experimental attention in contrast to the lack of computational studies. [ABSTRACT FROM AUTHOR]

Under the shared big data environment, the existing shared data auditing schemes rarely consider the authorization management of group users. Thus, in this paper, we propose a novel remote shared data checking possession scheme that support group authority management. To implement group user rights management, we firstly introduce a trusted entity group manager. To assist the group manager in authorization management, we formalize a new algebraic structure operator named authorization invisible authenticator (AIA). Meanwhile, we provide a basic AIA scheme for general security scenarios and a standard AIA scheme suitable for high-level security scenarios respectively. The standard AIA scheme can fully meet the needs of the group manager to safely perform rights management work. It is composed of the User Information Table (UIT) and the basic AIA scheme, which has higher security and is applicable to a wider range of scenarios. By distributing AIA through the standard AIA scheme, the group manager can easily carry out authority management, including enrolling, revoking, updating. After solving the problem of authorization management, the detailed design of the scheme based on identity-based encryption (IBE) is given. Furthermore, the security analysis and performance evaluation demonstrate that the scheme is safe and feasible. [ABSTRACT FROM AUTHOR]

Least squares reverse time migration (LSRTM) imaging is the one of the most accurate methods for migration imaging at present, and Polak–Ribiere–Polyak conjugate gradient (PRPCG) for LSRTM has the good numerical performance but weak convergence, so we construct an optimization factor to improve the iteration direction of the gradient, which can automatically generate a sufficient descent direction. The improved PRPCG (IPRPCG) can reduce the data residual values and speed up the iteration. And the illumination preconditioned (IP) operator is employed to IPRPCG-LSRTM which solves the problem of low resolution due to the insufficient iterative gradient information. In this paper, the experiments show that the imaging results of the proposed method (IPRPCG-IP-LSRTM) is improved greatly in detail characterization and events continuity, the iterative curve converged faster significantly, and the normalized data residual was reduced by 6.55% on average, which improved the accuracy of migration imaging effectively. [ABSTRACT FROM AUTHOR]

This paper introduces a new bio-inspired metaheuristic algorithm called Walrus Optimization Algorithm (WaOA), which mimics walrus behaviors in nature. The fundamental inspirations employed in WaOA design are the process of feeding, migrating, escaping, and fighting predators. The WaOA implementation steps are mathematically modeled in three phases exploration, migration, and exploitation. Sixty-eight standard benchmark functions consisting of unimodal, high-dimensional multimodal, fixed-dimensional multimodal, CEC 2015 test suite, and CEC 2017 test suite are employed to evaluate WaOA performance in optimization applications. The optimization results of unimodal functions indicate the exploitation ability of WaOA, the optimization results of multimodal functions indicate the exploration ability of WaOA, and the optimization results of CEC 2015 and CEC 2017 test suites indicate the high ability of WaOA in balancing exploration and exploitation during the search process. The performance of WaOA is compared with the results of ten well-known metaheuristic algorithms. The results of the simulations demonstrate that WaOA, due to its excellent ability to balance exploration and exploitation, and its capacity to deliver superior results for most of the benchmark functions, has exhibited a remarkably competitive and superior performance in contrast to other comparable algorithms. In addition, the use of WaOA in addressing four design engineering issues and twenty-two real-world optimization problems from the CEC 2011 test suite demonstrates the apparent effectiveness of WaOA in real-world applications. The MATLAB codes of WaOA are available in https://uk.mathworks.com/matlabcentral/profile/authors/13903104. [ABSTRACT FROM AUTHOR]

Organ biobanking is the pending subject of cryopreservation. Although the problem is multifaceted, advances in recent decades have largely related it to achieving rapid and uniform rewarming of cryopreserved samples. This is a physical challenge largely investigated in past in addition to cryoprotectant toxicity studies, which have also shown a great amount of advancement. This paper presents a proof-of-principle, based on the nematode Caenorhabditis elegans, of a technology capable of performing such a function: high intensity focused ultrasound. Thus, avoiding the problem of recrystallization, this worm, in its adult state, preserved at − 80 ∘ C , has been systematically brought back to life after being heated with High Intensity Focused Ultrasound (HIFU) waves. The great advantage of this technology is that it is scalable; in addition, rewarming can be monitored in real time by MRI thermography and can be controlled by acoustic interferometry. We anticipate that our findings are the starting point for a possible approach to rewarming that can be used for cryopreservation of millimeter scale systems: either alone or in combination with other promising ways of heating, like nanowarming or dielectric heating, the present technology provides new ways of solving the physical aspects of the problem of recrystallization in cryopreservation, opening the door for the long-term storage of larger samples. [ABSTRACT FROM AUTHOR]

The learning with errors (LWE) problem is a problem derived from machine learning that is believed to be intractable for quantum computers. This paper proposes a method that can reduce an LWE problem to a set of maximum independent set (MIS) problems, which are graph problems that are suitable for a quantum annealing machine to solve. The reduction algorithm can reduce an n-dimensional LWE problem to several small MIS problems with at most 2 O (n) nodes when the lattice-reduction algorithm used in the LWE-reduction method successfully finds short vectors. The algorithm is useful for solving LWE problems in a quantum-classical hybrid manner by using an existing quantum algorithm to solve the MIS problems. For example, the smallest LWE challenge problem is reduced to MIS problems with about 40,000 vertices. This result means that the smallest LWE challenge problem will be within the scope of a real quantum computer in the near future. [ABSTRACT FROM AUTHOR]

In the field of intelligent manufacturing, robot grasping and sorting is important content. However, there are some disadvantages in the traditional single-view-based manipulator grasping methods by using a 2D camera, where the efficiency and the accuracy of grasping are both low when facing the scene of stacking and occlusion for the reason that there is information missing by single-view 2D camera-based methods while acquiring scene information, and the methods of grasping only can't change the difficult-to-grasp scene which is stack and occluded. Regarding the issue above, a pushing-grasping collaborative method based on the deep Q-network in dual viewpoints is proposed in this paper. This method in this paper adopts an improved deep Q-network algorithm, with an RGB-D camera to obtain the information of objects' RGB images and point clouds from two viewpoints, which solved the problem of lack of information missing. What's more, it combines the pushing and grasping actions with the deep Q-network, which make it have the ability of active exploration, so that the trained manipulator can make the scenes less stacking and occlusion, and with the help of that, it can perform well in more complicated grasping scenes. In addition, we improved the reward function of the deep Q-network and propose the piecewise reward function to speed up the convergence of the deep Q-network. We trained different models and tried different methods in the V-REP simulation environment, and it drew a conclusion that the method proposed in this paper converges quickly and the success rate of grasping objects in unstructured scenes raises up to 83.5%. Besides, it shows the generalization ability and well performance when novel objects appear in the scenes that the manipulator has never grasped before. [ABSTRACT FROM AUTHOR]

As a key problem in slope-stability analysis, searching for potential sliding surfaces has attracted the attention of experts and scholars for a long time. However, the commonly used sliding surface curves are only considered in terms of shape approximation and lack physical significance. The search process involved in stability analysis of multi-level slopes is complex and a large amount of calculation is required. In order to solve this problem, this paper proposes a new sliding surface form based on physical interpretation of the brachistochrone, and establishes a search model for the brachistochrone sliding surface of a multi-level loess slope. At the same time, in order to further expand the search range and find a more ideal potential sliding surface curve shape and position with a lower safety factor, we recommend continuing the sliding-surface search after the brachistochrone is improved. We compared the calculation results for the position of the potential sliding surface and the stability safety factor with the corresponding results for an arc sliding surface (in combination with a calculation example) to verify its rationality. The approach offered here not only provides a new choice of sliding surface curve form for slope-stability analysis, but also significantly improves search efficiency for potential sliding surfaces of multi-level loess slopes. [ABSTRACT FROM AUTHOR]

Multi-object Tracking is an important issue that has been widely investigated in computer vision. However, in practical applications, moving targets are often occluded due to complex changes in the background, which leads to frequent pedestrian ID switches in multi-object tracking. To solve the problem, we present a multi-object tracking algorithm based on FairMOT and Circle Loss. In this paper, HRNet is adopted as the baseline. Then, Polarized Self-Attention is added to HRNet-w32 to obtain weights of helpful information based on its modeling advantages. Moreover, the re-identification branch is optimized, and the Circle Loss is selected as the loss function to acquire more discriminative pedestrian features and to distinguish different pedestrians. The method proposed is assessed on the public MOT17 datasets. The experimental results show that the MOTA score achieves 69.5%, IDF1 reaches 70.0%, and the number of ID switches (IDs) decreases 636 times compared to the TraDes algorithm. [ABSTRACT FROM AUTHOR]

This paper takes the P-RAN, a proximity wireless access network system for 5G and 6G, as an example, and uses the theory related to value evaluation to discuss how to realize the decentralization of underlying infrastructure from the perspective of different interactive players in the system. The analysis of P-RAN helps to promote mobile network operators to recognize network interaction and solve the problems of weak coverage, reduce the cost of network construction, and provides a new research idea for exploring more network evaluation indicators in the future. [ABSTRACT FROM AUTHOR]

The identification of important nodes is a hot topic in complex networks. Many methods have been proposed in different fields for solving this problem. Most previous work emphasized the role of a single feature and, as a result, rarely made full use of multiple items. This paper proposes a new method that utilizes multiple characteristics of nodes for the evaluation of their importance. First, an extended degree is defined to improve the classical degree. And E-shell hierarchy decomposition is put forward for determining nodes' position through the network's hierarchical structure. Then, based on the combination of these two components, a hybrid characteristic centrality and its extended version are proposed for evaluating the importance of nodes. Extensive experiments are conducted in six real networks, and the susceptible–infected–recovered model and monotonicity criterion are introduced to test the performance of the new approach. The comparison results demonstrate that the proposed new approach exposes more competitive advantages in both accuracy and resolution compared to the other five approaches. [ABSTRACT FROM AUTHOR]

The power quality and efficiency of the hydro-power station depend on the stable operation of the hydro-generator unit, which needs to continue to operate and it is prone to axis failure. Therefore, to adopt effective axis adjustment technology to eliminate faults. This paper proposes a new method for axis adjustment of hydro-generator unit based on an improved grey prediction model and swarms intelligence optimization neural network. First of all, it proposes a sequence acceleration translation and mean value transformation method, which is used to pre-process the axis net total swing sequence that exhibits oscillating fluctuations. It uses e1 and e2 factor transformation to establish an improved axis net total swing gray prediction model. Then, the advanced flamingo search algorithm is used to search the maximum value of the sine function of the net total pendulum of the axis, and the axis adjustment orientation is obtained. This method solves the problem that GM(1, 1) can only be predicted by monotone sequence in the past and the problem that the search algorithm is easy to fall into local optimum, effectively improves the calculation efficiency of axis and shorts the search time. Simulation examples show that the proposed method can significantly improve accuracy of axis adjustment. This method greatly improves the efficiency of azimuth search for axis adjustment. [ABSTRACT FROM AUTHOR]

Although the belief rule base (BRB) expert system has many advantages, such as the effective use of semi-quantitative information, objective description of uncertainty, and efficient nonlinear modeling capability, it is always limited by the problem of combinatorial explosion. The main reason is that the optimization of a BRB with many rules will consume many computing resources, which makes it unable to meet the real-time requirements in some complex systems. Another reason is that the optimization process will destroy the interpretability of those parameters that belong to the inadequately activated rules given by experts. To solve these problems, a novel optimization method for BRB is proposed in this paper. Through the activation rate, the rules that have never been activated or inadequately activated are pruned during the optimization process. Furthermore, even if there is a complete data set and all rules are activated, the activation rate can also be used in the parallel optimization process of the BRB expert system, where the training data set is divided into some subprocesses. The proposed method effectively solves the combinatorial explosion problem of BRB and can make full use of quantitative data without destroying the original interpretability provided by experts. Case studies prove the advantages and effectiveness of the proposed method, which greatly expands the application fields of the BRB expert system. [ABSTRACT FROM AUTHOR]

The grasshopper optimization algorithm (GOA) is a meta-heuristic algorithm proposed in 2017 mimics the biological behavior of grasshopper swarms seeking food sources in nature for solving optimization problems. Nonetheless, some shortcomings exist in the origin GOA, and GOA global search ability is more or less insufficient and precision also needs to be further improved. Although there are many different GOA variants in the literature, the problem of inefficient and rough precision has still emerged in GOA variants. Aiming at these deficiencies, this paper develops an improved version of GOA with Levy Flight mechanism called LFGOA to alleviate the shortcomings of the origin GOA. The LFGOA algorithm achieved a more suitable balance between exploitation and exploration during searching for the most promising region. The performance of LFGOA is tested using 23 mathematical benchmark functions in comparison with the eight well-known meta-heuristic algorithms and seven real-world engineering problems. The statistical analysis and experimental results show the efficiency of LFGOA. According to obtained results, it is possible to say that the LFGOA algorithm can be a potential alternative in the solution of meta-heuristic optimization problems as it has high exploration and exploitation capabilities. [ABSTRACT FROM AUTHOR]

In complex networks, key nodes are important factors that directly affect network structure and functions. Therefore, accurate mining and identification of key nodes are crucial to achieving better control and a higher utilization rate of complex networks. To address this problem, this paper proposes an accurate and efficient algorithm for critical node mining. The influential nodes are determined using both global and local information (GLI) to solve the shortcoming of the existing key node identification methods that consider either local or global information. The proposed method considers two main factors, global and local influences. The global influence is determined using the K-shell hierarchical information of a node, and local influence is obtained considering the number of edges connected by the node and the given values of adjacent nodes. The given values of adjacent nodes are determined based on the degree and K-shell hierarchical information. Further, the similarity coefficient of neighbors is considered, which enhances the differentiation degree of the adjacent given values. The proposed method solves the problems of the high complexity of global information-based algorithms and the low accuracy of local information-based algorithms. The proposed method is verified by simulation experiments using the SIR and SI models as a reference, and twelve typical real-world networks are used for the comparison. The proposed GLI algorithm is compared with several common algorithms at different periods. The comparison results show that the GLI algorithm can effectively explore influential nodes in complex networks. [ABSTRACT FROM AUTHOR]

Computational techniques are widely used to solve complex optimization problems in different fields such as engineering, finance, biology, and so on. In this paper, the Human Conception Optimizer (HCO) is proposed as a novel metaheuristic algorithm to solve any optimization problems. The idea of this algorithm is based on some biological principles of the human conception process, such as the selective nature of cervical gel in the female reproductive system to allow only healthy sperm cells into the cervix, the guidance nature of mucus gel to help sperm track a genital tracking path towards the egg in the Fallopian tube, the asymmetric nature of flagellar movement which allows sperm cells to move in the reproductive system, the sperm hyperactivation process to make them able to fertilize an egg. Thus, the strategies pursued by the sperm in searching for the egg in the Fallopian tube are modeled mathematically. The best sperm which will meet the position of the egg will be the solution of the algorithm. The performance of the proposed HCO algorithm is examined with a set of basic benchmark test functions called IEEE CEC-2005 and IEEE CEC-2020. A comparative study is also performed between the HCO algorithm and other available algorithms. The significance of the results is verified with statistical test methods. To validate the proposed HCO algorithm, two real-world engineering optimization problems are examined. For this purpose, a complex 14 over-current relay based IEEE 8 bus distribution system is considered. With the proposed algorithm, an improvement of 50% to 60% in total relay operating times is observed comparing with some existing results for the same system. Another engineering problem of designing an optimal proportional integral derivative (PID) controller for a blower driven patient hose mechanical ventilator (MV) is examined. A significant improvement in terms of response time, settling time is observed in the MV system by comparing with existing results. [ABSTRACT FROM AUTHOR]

Social protests, in particular in the form of street protests, are a frequent phenomenon of modern world often making a significant disruptive effect on the society. Understanding the factors that can affect their duration and intensity is therefore an important problem. In this paper, we consider a mathematical model of protests dynamics describing how the number of protesters change with time. We apply the model to two events such as the Yellow Vest Movement 2018–2019 in France and Khabarovsk protests 2019–2020 in Russia. We show that in both cases our model provides a good description of the protests dynamics. We consider how the model parameters can be estimated by solving the inverse problem based on the available data on protesters number at different time. The analysis of parameter sensitivity then allows for determining which factor(s) may have the strongest effect on the protests dynamics. [ABSTRACT FROM AUTHOR]

In this paper, a new stochastic optimization algorithm is introduced, called Driving Training-Based Optimization (DTBO), which mimics the human activity of driving training. The fundamental inspiration behind the DTBO design is the learning process to drive in the driving school and the training of the driving instructor. DTBO is mathematically modeled in three phases: (1) training by the driving instructor, (2) patterning of students from instructor skills, and (3) practice. The performance of DTBO in optimization is evaluated on a set of 53 standard objective functions of unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and IEEE CEC2017 test functions types. The optimization results show that DTBO has been able to provide appropriate solutions to optimization problems by maintaining a proper balance between exploration and exploitation. The performance quality of DTBO is compared with the results of 11 well-known algorithms. The simulation results show that DTBO performs better compared to 11 competitor algorithms and is more efficient in optimization applications. [ABSTRACT FROM AUTHOR]

In the development of anti-breast cancer drugs, the quantitative structure-activity relationship model of compounds is usually used to select potential active compounds. However, the existing methods often have problems such as low model prediction performance, lack of overall consideration of the biological activity and related properties of compounds, and difficulty in directly selection candidate drugs. Therefore, this paper constructs a complete set of compound selection framework from three aspects: feature selection, relationship mapping and multi-objective optimization problem solving. In feature selection part, a feature selection method based on unsupervised spectral clustering is proposed. The selected features have more comprehensive information expression ability. In the relationship mapping part, a variety of machine learning algorithms are used for comparative experiments. Finally, the CatBoost algorithm is selected to perform the relationship mapping between each other, and better prediction performance is achieved. In the multi-objective optimization part, based on the analysis of the conflict relationship between the objectives, the AGE-MOEA algorithm is improved and used to solve this problem. Compared with various algorithms, the improved algorithm has better search performance. [ABSTRACT FROM AUTHOR]

The complexity of engineering optimization problems is increasing. Classical gradient-based optimization algorithms are a mathematical means of solving complex problems whose ability to do so is limited. Metaheuristics have become more popular than exact methods for solving optimization problems because of their simplicity and the robustness of the results that they yield. Recently, population-based bio-inspired algorithms have been demonstrated to perform favorably in solving a wide range of optimization problems. The jellyfish search optimizer (JSO) is one such bio-inspired metaheuristic algorithm, which is based on the food-finding behavior of jellyfish in the ocean. According to the literature, JSO outperforms many well-known meta-heuristics in a wide range of benchmark functions and real-world applications. JSO can also be used in conjunction with other artificial intelligence-related techniques. The success of JSO in solving diverse optimization problems motivates the present comprehensive discussion of the latest findings related to JSO. This paper reviews various issues associated with JSO, such as its inspiration, variants, and applications, and will provide the latest developments and research findings concerning JSO. The systematic review contributes to the development of modified versions and the hybridization of JSO to improve upon the original JSO and present variants, and will help researchers to develop superior metaheuristic optimization algorithms with recommendations of add-on intelligent agents. [ABSTRACT FROM AUTHOR]

Most of the current excellent models in speaker verification are ResNet-based deep models and attention-based models. These models have a general weakness, which is the large number of parameters and high hardware requirements. On the other hand, many deep structures only generate embedding features from the features extracted by the last frame-level layer, which causes shallow features and channel-related features to be ignored. To solve these problems, this paper proposed a shallow speaker verification model based on Lambda-vector, its main structure is composed of three Lambda-SE modules. The module extracts long-distance dependencies between frame-level features and channel-related interaction information to enhance representation of features. Meanwhile, so that adequately mine the information in deep and shallow features, the model introduces multi-layer feature aggregation to fuse the features of different frame-level layers together. It can increase the detailed information in the deep features and improve the model's ability to represent complex information. The experimental results on the public datasets Voxceleb1 and Voxceleb2 show that the model has more stable training speed, fewer model parameters, and better identification performances than baseline models. [ABSTRACT FROM AUTHOR]

In this paper, a new optimization algorithm called hybrid leader-based optimization (HLBO) is introduced that is applicable in optimization challenges. The main idea of HLBO is to guide the algorithm population under the guidance of a hybrid leader. The stages of HLBO are modeled mathematically in two phases of exploration and exploitation. The efficiency of HLBO in optimization is tested by finding solutions to twenty-three standard benchmark functions of different types of unimodal and multimodal. The optimization results of unimodal functions indicate the high exploitation ability of HLBO in local search for better convergence to global optimal, while the optimization results of multimodal functions show the high exploration ability of HLBO in global search to accurately scan different areas of search space. In addition, the performance of HLBO on solving IEEE CEC 2017 benchmark functions including thirty objective functions is evaluated. The optimization results show the efficiency of HLBO in handling complex objective functions. The quality of the results obtained from HLBO is compared with the results of ten well-known algorithms. The simulation results show the superiority of HLBO in convergence to the global solution as well as the passage of optimally localized areas of the search space compared to ten competing algorithms. In addition, the implementation of HLBO on four engineering design issues demonstrates the applicability of HLBO in real-world problem solving. [ABSTRACT FROM AUTHOR]

This paper introduces a new human-based metaheuristic algorithm called Sewing Training-Based Optimization (STBO), which has applications in handling optimization tasks. The fundamental inspiration of STBO is teaching the process of sewing to beginner tailors. The theory of the proposed STBO approach is described and then mathematically modeled in three phases: (i) training, (ii) imitation of the instructor's skills, and (iii) practice. STBO performance is evaluated on fifty-two benchmark functions consisting of unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. The optimization results show that STBO, with its high power of exploration and exploitation, has provided suitable solutions for benchmark functions. The performance of STBO is compared with eleven well-known metaheuristic algorithms. The simulation results show that STBO, with its high ability to balance exploration and exploitation, has provided far more competitive performance in solving benchmark functions than competitor algorithms. Finally, the implementation of STBO in solving four engineering design problems demonstrates the capability of the proposed STBO in dealing with real-world applications. [ABSTRACT FROM AUTHOR]