Search

Edge computing enables portable devices to provide smart applications, and the indoor positioning technique offers accurate location-based indoor navigation and personalized smart services. To achieve the high positioning accuracy, an indoor positioning algorithm based on particle filter requires a large number of sample particles to approximate the probability density function, which leads to the additional computational cost and high fusion delay. Focusing on real-time and accurate positioning, an edge computing-enabled green multi-source fusion indoor positioning algorithm called APFP is proposed based on adaptive particle filter in this paper. APFP considers both pedestrian dead reckoning (PDR) signals in mobile terminals and the received signal strength indication (RSSI) of Bluetooth, and effectively merges the error-free accumulation of trilateral positioning and the accurate short-range positioning of PDR, which enables mobile terminals adaptively perform particle filter to reduce the computing time and power consumption while ensuring positioning accuracy simultaneously. Detailed experimental results show that, compared with the traditional particle filter algorithm and the map-constrained algorithm, the proposed APFP reduces fusion computing cost by 59.89% and 54.37%, respectively. [ABSTRACT FROM AUTHOR]

Power shift tractors have been widely used in agricultural tractors in recent years because of their advantages of uninterrupted power during shifting, high transmission efficiency and high stability. As one of the indispensable driving states of the power shift tractor, the starting process requires a small impact and a starting speed that meets the driver's requirements. In this paper, aiming at such contradictory requirements, the starting control strategy of a power shift tractor is formulated with the goal of starting quality and the driver's intention. Firstly, the identification characteristics of the driver under three starting intentions are obtained by a real vehicle test. An extreme learning machine with fast identification speed and short training time is used to establish the basic driver's intention identification model. For the instability of the identification results of the Extreme Learning Machine (ELM), the particle swarm optimization algorithm (PSO) is used to optimize the ELM. The optimized extreme learning machine model has an accuracy of 96.891% for driver's intention identification. The wet clutch is an important part of the power shift gearbox. In this paper, the starting control strategy knowledge base of the starting clutch is established by a combination of bench tests and simulation tests. Through the fuzzy algorithm, the driver's intention is combined with the starting control strategy. Different drivers' intentions will affect the comprehensive evaluation model of the clutch (the single evaluation index of the clutch is: the maximum sliding power, the sliding power, the speed stability time, the impact degree), thus affecting the final choice of the starting clutch control strategy considering the driver's intention. On this basis, this paper studies and establishes the MPC starting controller for the power shift gearbox. Compared with the linear control strategy, the PSO-ELM-fuzzy weight starting strategy proposed in this paper can reduce the maximum sliding friction power by 45%, the sliding friction power by 69.45%, and the speed stabilization time by 0.11 s. The effectiveness of the starting control strategy considering the driver's intention proposed in this paper to improve the starting quality of the power shift tractor is verified. [ABSTRACT FROM AUTHOR]

Path planning is one of the core issues in the autonomous navigation of an Unmanned Surface Vehicle (USV), as the accuracy of the results directly affects the safety of the USV. Hence, this paper proposes a USV path planning algorithm that integrates an improved Particle Swarm Optimisation (PSO) algorithm with a Dynamic Window Approach (DWA). Firstly, in order to advance the solution accuracy and convergence speed of the PSO algorithm, a nonlinear decreasing inertia weight and adaptive learning factors are introduced. Secondly, in order to solve the problem of long path and path non-smoothness, the fitness function of PSO is modified to consider both path length and path smoothness. Finally, the International Regulations for Preventing Collisions at Sea (COLREGS) are utilised to achieve dynamic obstacle avoidance while complying with maritime practices. Numerical cases verify that the path planned via the proposed algorithm is shorter and smoother, guaranteeing the safety of USV navigation while complying with the COLREGS. [ABSTRACT FROM AUTHOR]

The problem of finding optimal block designs can be formulated as a combinatorial optimization, but its resolution is still a formidable challenge. This paper presents a general and user-friendly algorithm, namely Modified Particle Swarm Optimization (MPSO), to construct optimal or near-optimal block designs. It can be used for several classes of block designs such as binary, non-binary and test-control block designs with correlated or uncorrelated observations. In order to evaluate the algorithm, we compare our results with the optimal designs presented in some published papers. An advantage of our algorithm is its independency to the sizes of blocks and the structure of correlations. [ABSTRACT FROM AUTHOR]

S-box is the only non-linear device in the cryptographic algorithm, and its quality determines the lower limit strength of the cryptographic algorithm. However, because the image data is highly correlated, the traditional encryption methods and their S-boxes, such as AES and DES are not suitable for using in image encryption. Based on this, this paper proposes an S-box generation algorithm based on a 4D hyperchaotic system and improved particle swarm optimization. Firstly, this paper improves on the Lorenz chaotic system and proposes a 4D hyperchaotic system with a higher Lyapunov exponent and more complex dynamics. Secondly, the idea of simulated annealing algorithm is introduced into the particle swarm optimization algorithm, which further improves the efficiency of the particle swarm optimization algorithm and improves the problem that the particle swarm optimization algorithm is easy to fall into the local optimal solution. Then an improved particle swarm optimization algorithm is used to optimize the nonlinearity of the S-box to improve the performance of the S-box. Finally, use the generated S-box to design an image encryption algorithm and prove the security of the S-box. The experimental results show that the S-box designed in this paper has excellent performance in the five indicators of Nonlinearity, SAC, BIC-NL, LP, and DP. At the same time, the encryption result can resist common attacks, so it has strong multimedia security. [ABSTRACT FROM AUTHOR]

In everyday life, 5G-based localization technology is commonly used, but non-line-of-sight (NLOS) environments can block the propagation of the localization signal, thus preventing localization. In order to solve this problem, this paper proposes a reconfigurable intelligent surface non-line-of-sight time difference of arrival (TDOA) localization (RNTL) algorithm. Firstly, a model of a reflective-surface-based intelligent localization (RBP) system is constructed, which utilizes multiple RISs deployed in the air to reflect signals. Secondly, in order to reduce the localization error, this paper establishes the optimization problem of minimizing the distance between each estimated coordinate and the actual coordinate and solves it via the piecewise linear chaotic map–gray wolf optimization algorithm (PWLCM-GWO). Finally, the simulation results show that the RNTL algorithm significantly outperforms the traditional gray wolf optimization and particle swarm optimization algorithms in different signal-to-noise ratios, and the localization errors are reduced by 46% and 53.5%, respectively. [ABSTRACT FROM AUTHOR]

This paper investigates the optimal control problem generated in Tumor Treating Fields (TTFields). TTFields is an emerging cancer treatment method with several advantages including the convenience of treatment, fewer side effects, and a better quality of life for patients. Therefore, it holds significant promise for applications in cancer treatments and other fields. In view of such an immense potential, in this work, we are motivated to determine the optimal arrangement of electrodes for TTFields. The paper begins by presenting a comprehensive modeling process for TTFields, followed by the establishment of an optimal control problem that involves finding the optimal configuration of the electrode array. To solve this problem, the particle swarm optimization (PSO) algorithm, which is a type of intelligent algorithm, is employed, and is further improved on to address various situations. Finally, the model is validated and the effectiveness of the PSO algorithm is verified through numerical examples. [ABSTRACT FROM AUTHOR]

As the terminal of the power system, the distribution network is the main area where failures occur. In addition, with the integration of distributed generation, the traditional distribution network becomes more complex, rendering the conventional fault location algorithms based on a single power supply obsolete. Therefore, it is necessary to seek a new algorithm to locate the fault of the distributed power distribution network. In existing fault localization algorithms for distribution networks, since there are only two states of line faults, which can usually be represented by 0 and 1, most algorithms use discrete algorithms with this characteristic for iterative optimization. Therefore, this paper combines the advantages of the particle swarm algorithm and genetic algorithm and uses continuous real numbers for iteration to construct a successive particle swarm genetic algorithm (SPSO-GA) different from previous algorithms. The accuracy, speed, and fault tolerance of SPSO-GA, discrete particle swarm Genetic algorithm, and artificial fish swarm algorithm are compared in an IEEE33-node distribution network with the distributed power supply. The simulation results show that the SPSO-GA algorithm has high optimization accuracy and stability for single, double, or triple faults. Furthermore, SPSO-GA has a rapid convergence velocity, requires fewer particles, and can locate the fault segment accurately for the distribution network containing distorted information. [ABSTRACT FROM AUTHOR]

To address the reactive power optimization control problem in offshore wind farms (OWFs), this paper proposes an adaptive reactive power optimization control strategy based on an improved Particle Swarm Optimization (PSO) algorithm. Firstly, an OWF multi-objective optimization control model is established, with the total sum of voltage deviations at wind turbine (WT) terminals, active power network losses, and reactive power margin of WTs as comprehensive optimization objectives. Innovatively, adaptive weighting coefficients are introduced for the three sub-objectives, enabling the weights of each optimization objective to be adaptively adjusted based on real-time operating conditions, thus enhancing the adaptability of the reactive power optimization model to changes in operating conditions. Secondly, a Uniform Adaptive Particle Swarm Optimization (UAPSO) algorithm is proposed. On one hand, the algorithm initializes the particle swarm using a uniform initialization method; on the other hand, it improves the particle velocity update formula, allowing the inertia coefficient to adaptively adjust based on the number of iterations and the fitness ranking of particles. Simulation results demonstrate the following: (1) Under various operating conditions, the proposed adaptive multi-objective reactive power optimization strategy can ensure the stability of node voltages in offshore wind farms, reduce active power losses, and simultaneously improve reactive power margins. (2) Compared with the traditional PSO algorithm, UAPSO exhibits an approximately 10% improvement in solution speed and enhanced solution accuracy. [ABSTRACT FROM AUTHOR]

This paper presents an improved swarming algorithm that enhances low-illumination images. The algorithm combines a hybrid Harris Eagle algorithm with double gamma (IHHO-BIGA) and incomplete beta (IHHO-NBeta) functions. This paper integrates the concept of symmetry into the improvement steps of the image adaptive enhancement algorithm. The enhanced algorithm integrates chaotic mapping for population initialization, a nonlinear formula for prey energy calculation, spiral motion from the black widow algorithm for global search enhancement, a nonlinear inertia weight factor inspired by particle swarm optimization, and a modified Levy flight strategy to prevent premature convergence to local optima. This paper compares the algorithm's performance with other swarm intelligence algorithms using commonly used test functions. The algorithm's performance is compared against several emerging swarm intelligence algorithms using commonly used test functions, with results demonstrating its superior performance. The improved Harris Eagle algorithm is then applied for image adaptive enhancement, and its effectiveness is evaluated on five low-illumination images from the LOL dataset. The proposed method is compared to three common image enhancement techniques and the IHHO-BIGA and IHHO-NBeta methods. The experimental results reveal that the proposed approach achieves optimal visual perception and enhanced image evaluation metrics, outperforming the existing techniques. Notably, the standard deviation data of the first image show that the IHHO-NBeta method enhances the image by 8.26%, 120.91%, 126.85%, and 164.02% compared with IHHO-BIGA, the single-scale Retinex enhancement method, the homomorphic filtering method, and the limited contrast adaptive histogram equalization method, respectively. The processing time of the improved method is also better than the previous heuristic algorithm. [ABSTRACT FROM AUTHOR]

Cryo-electron micrograph images have various characteristics such as varying sizes, shapes, and distribution densities of individual particles, severe background noise, high levels of impurities, irregular shapes, blurred edges, and similar color to the background. How to demonstrate good adaptability in the field of image vision by picking up single particles from multiple types of cryo-electron micrographs is currently a challenge in the field of cryo-electron micrographs. This paper combines the characteristics of the MixUp hybrid enhancement algorithm, enhances the image feature information in the pre-processing stage, builds a feature perception network based on the channel self-attention mechanism in the forward network of the Swin Transformer model network, achieving adaptive adjustment of self-attention mechanism between different single particles, increasing the network's tolerance to noise, Incorporating PReLU activation function to enhance information exchange between pixel blocks of different single particles, and combining the Cross-Entropy function with the softmax function to construct a classification network based on Swin Transformer suitable for cryo-electron micrograph single particle detection model (Swin-cryoEM), achieving mixed detection of multiple types of single particles. Swin-cryoEM algorithm can better solve the problem of good adaptability in picking single particles of many types of cryo-electron micrographs, improve the accuracy and generalization ability of the single particle picking method, and provide high-quality data support for the three-dimensional reconstruction of a single particle. In this paper, ablation experiments and comparison experiments were designed to evaluate and compare Swin-cryoEM algorithms in detail and comprehensively on multiple datasets. The Average Precision is an important evaluation index of the evaluation model, and the optimal Average Precision reached 95.5% in the training stage Swin-cryoEM, and the single particle picking performance was also superior in the prediction stage. This model inherits the advantages of the Swin Transformer detection model and is superior to mainstream models such as Faster R-CNN and YOLOv5 in terms of the single particle detection capability of cryo-electron micrographs. [ABSTRACT FROM AUTHOR]

To solve the problems of high storage resource consumption and low efficiency of the RRT exploration algorithm in the late stage of exploration, this paper proposes an Improved Artificial Fish Swarm based Optimize Rapidly-exploring Random Trees multi-robot Exploration Algorithm. Firstly, the efficiency of a single robot's exploration of nearby unknown regions is improved by dynamically adjusting the step size of the RRT tree.Secondly, the improved artificial fish swarm algorithm is used to delete the redundant nodes in the RRT tree and optimize the node state in the RRT tree, which reduces the occupation of memory resources and improves the exploration efficiency of the RRT tree in the narrow environment.Results from comparative experiments in simulation environments with different degrees of openness show that the optimized exploration algorithm can save significant storage resources and show better exploration performance in narrow environments compared to the original RRT exploration algorithm. [ABSTRACT FROM AUTHOR]

Lithium-ion batteries are widely used in power grids as a common form of energy storage in power stations. The state of charge (SOC) and state of health (SOH) reflect the capacity and lifetime variation in the Li-ion batteries, and they are important state parameters of Li-ion batteries. Therefore, the establishment of accurate SOC and SOH prediction models is an essential prerequisite for the correct assessment of the status of lithium batteries, the improvement of the operational accuracy of energy-storage stations, and the development of maintenance plans for energy-storage stations. This paper first analyzes the correlation between SOC and SOH, and then proposes a joint SOC and SOH prediction model using the particle swarm optimization (PSO) algorithm to optimize the extreme gradient boosting algorithm (XGBoost), which takes into account the dynamic correlation between SOC and SOH dynamics, thus enabling more accurate SOC and SOH prediction. Finally, the prediction model is validated using the Oxford battery aging dataset. The correlation between SOC and SOH is verified by comparing the joint prediction results with the SOC individual prediction results. Then, the prediction results of the PSO-XGBoost model, the traditional XGBoost model, and the long short-term memory neural network are compared to verify the effectiveness and accuracy of the PSO-XGBoost model. [ABSTRACT FROM AUTHOR]

Most models of quantum neural networks are optimized based on gradient descent, and like classical neural networks, gradient descent suffers from the barren plateau phenomenon, which reduces the effectiveness of optimization. Therefore, this paper establishes a new QNN model, the optimization process adopts efficient quantum particle swarm optimization, and tentatively adds a quantum activation circuit to our QNN model. Our model will inherit the superposition property of quantum and the random search property of quantum particle swarm. Simulation experiments on some classification data show that the model proposed in this paper has higher classification performance than the gradient descent-based QNN. [ABSTRACT FROM AUTHOR]

Metaheuristic optimization algorithms (MHA) play a significant role in obtaining the best (optimal) values of the system's parameters to improve its performance. This role is significantly apparent when dealing with systems where the classical analytical methods fail. Fractional-order (FO) systems have not yet shown an easy procedure to deal with the determination of their optimal parameters through traditional methods. In this paper, a recent, systematic. And comprehensive review is presented to highlight the role of MHA in obtaining the best set of gains and orders for FO controllers. The systematic review starts by exploring the most relevant publications related to the MHA and the FO controllers. The study is focused on the most popular controllers such as the FO-PI, FO-PID, FO Type-1 fuzzy-PID, and FO Type-2 fuzzy-PID. The time domain is restricted in the articles published through the last decade (2014:2023) in the most reputed databases such as Scopus, Web of Science, Science Direct, and Google Scholar. The identified number of papers, from the entire databases, has reached 850 articles. A Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) methodology was applied to the initial set of articles to be screened and filtered to end up with a final list that contains 82 articles. Then, a thorough and comprehensive study was applied to the final list. The results showed that Particle Swarm Optimization (PSO) is the most attractive optimizer to the researchers to be used in the optimal parameters identification of the FO controllers as it attains about 25% of the published papers. In addition, the papers that used PSO as an optimizer have gained a high citation number despite the fact that the Chaotic Atom Search Optimization (ChASO) is the highest one, but it is used only once. Furthermore, the Integral of the Time-Weighted Absolute Error (ITAE) is the best nominated cost function. Based on our comprehensive literature review, this appears to be the first review paper that systematically and comprehensively addresses the optimization of the parameters of the fractional-order PI, PID, Type-1, and Type-2 fuzzy controllers with the use of MHAs. Therefore, the work in this paper can be used as a guide for researchers who are interested in working in this field. [ABSTRACT FROM AUTHOR]

The features of the kernel extreme learning machine—efficient processing, improved performance, and less human parameter setting—have allowed it to be effectively used to batch multi-label classification tasks. These classic classification algorithms must at present contend with accuracy and space–time issues as a result of the vast and quick, multi-label, and concept drift features of the developing data streams in the practical application sector. The KELM training procedure still has a difficulty in that it has to be repeated numerous times independently in order to maximize the model's generalization performance or the number of nodes in the hidden layer. In this paper, a kernel extreme learning machine multi-label data classification method based on the butterfly algorithm optimized by particle swarm optimization is proposed. The proposed algorithm, which fully accounts for the optimization of the model generalization ability and the number of hidden layer nodes, can train multiple KELM hidden layer networks at once while maintaining the algorithm's current time complexity and avoiding a significant number of repeated calculations. The simulation results demonstrate that, in comparison to the PSO-KELM, BBA-KELM, and BOA-KELM algorithms, the PSOBOA-KELM algorithm proposed in this paper can more effectively search the kernel extreme learning machine parameters and more effectively balance the global and local performance, resulting in a KELM prediction model with a higher prediction accuracy. [ABSTRACT FROM AUTHOR]

The optimization and allocation of transport cost savings among stakeholders are two important issues that influence the satisfaction of information providers, drivers and passengers in ridesharing recommendation systems. For optimization issues, finding optimal solutions for nonconvex constrained discrete ridesharing optimization problems poses a challenge due to computational complexity. For the allocation of transport cost savings issues, the development of an effective method to allocate cost savings in ridesharing recommendation systems is an urgent need to improve the acceptability of ridesharing. The hybridization of different metaheuristic approaches has demonstrated its advantages in tackling the complexity of optimization problems. The principle of the hybridization of metaheuristic approaches is similar to a marriage of two people with the goal of having a happy ending. However, the effectiveness of hybrid metaheuristic algorithms is unknown a priori and depends on the problem to be solved. This is similar to a situation where no one knows whether a marriage will have a happy ending a priori. Whether the hybridization of the Firefly Algorithm (FA) with Particle Swarm Optimization (PSO) or Differential Evolution (DE) can work effectively in solving ridesharing optimization problems needs further study. Motivated by deficiencies in existing studies, this paper focuses on the effectiveness of hybrid metaheuristic algorithms for solving ridesharing problems based on the hybridization of FA with PSO or the hybridization of FA with DE. Another focus of this paper is to propose and study the effectiveness of a new method to allocate ridesharing cost savings to the stakeholders in ridesharing systems. The developed hybrid metaheuristic algorithms and the allocation method have been compared with examples of several application scenarios to illustrate their effectiveness. The results indicate that hybridizing FA with PSO creates a more efficient algorithm, whereas hybridizing FA with DE does not lead to a more efficient algorithm for the ridesharing recommendation problem. An interesting finding of this study is very similar to what happens in the real world: "Not all marriages have happy endings". [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is constantly evolving. The variety of IoT applications has caused new demands to emerge on users' part and competition between computing service providers. On the one hand, an IoT application may exhibit several important criteria, such as deadline and runtime simultaneously, and it is confronted with resource limitations and high energy consumption on the other hand. This has turned to adopting a computing environment and scheduling as a fundamental challenge. To resolve the issue, IoT applications are considered in this paper as a workflow composed of a series of interdependent tasks. The tasks in the same workflow (at the same level) are subject to priorities and deadlines for execution, making the problem far more complex and closer to the real world. In this paper, a hybrid Particle Swarm Optimization and Simulated Annealing algorithm (PSO–SA) is used for prioritizing tasks and improving fitness function. Our proposed method managed the task allocation and optimized energy consumption and makespan at the fog-cloud environment nodes. The simulation results indicated that the PSO–SA enhanced energy and makespan by 5% and 9% respectively on average compared with the baseline algorithm (IKH-EFT). [ABSTRACT FROM AUTHOR]

Numerous surrogate-assisted evolutionary algorithms have been proposed for expensive optimization problems. However, each surrogate model has its own characteristics and different applicable situations, which caused a serious challenge for model selection. To alleviate this challenge, this paper proposes an adaptive surrogate-assisted particle swarm optimization (ASAPSO) algorithm by effectively combining global and local surrogate models, which utilizes the uncertainty level of the current population state to evaluate the approximation ability of the surrogate model in its predictions. In ASAPSO, the transformation between local and global surrogate models is controlled by an adaptive Gaussian distribution parameter with a gauge of the advisability to improve the search process with better local exploration and diversity in uncertain solutions. Four expensive optimization benchmark functions and an airfoil aerodynamic real-world engineering optimization problem are utilized to validate the effectiveness and performance of ASAPSO. Experimental results demonstrate that ASAPSO has superiority in terms of solution accuracy compared with state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Copyright of Baghdad Science Journal is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

A lot of discussion is done these days regarding the actual novelty of newcomer nature-inspired approaches. Crucial role on that matter is played by the mechanisms included in these approaches, where many of these mechanisms have been previously introduced as part of another algorithm. On the other hand, a good practice would be to use the mechanisms of a nature-inspired algorithm to enhance the performance or to overcome the drawbacks of another one. This paper investigates this issue, where four mechanisms have been isolated and studied. Furthermore, the well-known Particle Swarm Optimization and Firefly Algorithm were used to test the effect of the studied mechanisms on the exploration and exploitation of established approaches that suffer from premature convergence or mostly explore the search space, respectively. [ABSTRACT FROM AUTHOR]

Numerical models play a primary role in Cultural Heritage preservation. Nevertheless, the design of a realistic model remains challenging due not only to the complex behavior of masonry but also to the asynchronous building phases, the damage induced by natural and anthropic aggression, and the associated repairs. This paper discusses the impact of the information provided by an in-depth analysis of the construction history on the updating process of a Finite Element building model. The case study is the church of Sant'Agata del Mugello (Italy); for this building, a previous historical–archaeological study identified and recorded the asynchronous construction phases, the repair techniques, and the damage induced by three historical earthquakes (1542, 1611, and 1919) – moreover, a dense ambient vibration survey allowed to identify the modal parameters. The information from previous works is summarized in five Finite Element models with increasing complexity. A vibration-based model updating methodology based on a Particle Swarm Algorithm is developed. This work shows that the best minimization of the difference between the numerical and experimental modal parameters is obtained with the numerical model considering the identified construction techniques, repair phases, and connection relations between the bell tower and the nave. [ABSTRACT FROM AUTHOR]

This paper introduces an innovative approach to address the distribution network reconfiguration (DNR) challenge, aiming to reduce power loss through an advanced hyperbolic tangent particle swarm optimization (HT-PSO) method. This approach is distinguished by the adoption of a novel hyperbolic tangent function, which effectively limits the rate of change values, offering a significant improvement over traditional sigmoid function-based methods. A key feature of this new approach is the integration of a tunable parameter, δ , into the HT-PSO, enhancing the curve's adaptability. The careful optimization of δ ensures superior control over the rate of change across the entire operational range. This enhanced control mechanism substantially improves the efficiency of the search and convergence processes in DNR. Comparative simulations conducted on 33- and 94-bus systems show an improvement in convergence, demonstrating a more exhaustive exploration of the search space than existing methods documented in the literature based on PSO and variations where functions are proposed for the rate of change of values. [ABSTRACT FROM AUTHOR]

The Marine Predators Algorithm (MPA) is a swarm intelligence algorithm developed based on the foraging behavior of the ocean's predators. This algorithm has drawbacks including, insufficient population diversity, leading to trapping in local optima and poor convergence. To mitigate these drawbacks, this paper introduces an enhanced MPA based on Adaptive Sampling with Maximin Distance Criterion (AM) and the horizontal and vertical crossover operators – i.e. Adaptive Crossover-based MPA (AC-MPA). The AM approach is used to generate diverse and well-distributed candidate solutions. Whereas the horizontal and vertical crossover operators maintain the population diversity during the search process. The performance of AC-MPA was tested using 51 benchmark functions from CEC2017, CEC2020, and CEC2022, with varying degrees of dimensionality, and the findings are compared with those of its basic version, variants, and numerous well-established metaheuristics. Additionally, 11 engineering optimization problems were utilized to verify the capabilities of the AC-MPA in handling real-world optimization problems. The findings clearly show that AC-MPA performs well in terms of its solution accuracy, convergence, and robustness. Furthermore, the proposed algorithm demonstrates considerable advantages in solving engineering problems, proving its effectiveness and adaptability. [ABSTRACT FROM AUTHOR]

Copyright of Systems Engineering & Electronics is the property of Journal of Systems Engineering & Electronics Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Searching an optimal value of the neural emulator adaptive rate presents a great problem. Indeed, a new scheme of neural emulators based on the Particle Swarm Optimization (PSO) algorithm for nonlinear systems is adopted in this paper. The main goal of this approach consists in adjusting effectively the neural emulator adaptive rate in order to accelerate the convergence speed and to improve the precision degree. The obtained results are compared with those reached with an intelligent tuning strategy. An experimental validation of the new emulator adaptation is carried on chemical reactor. Efficiency of the proposed method is proved according to the obtained performances. [ABSTRACT FROM AUTHOR]

Intelligent control algorithms have been extensively utilized for adaptive controller parameter adjustment. While the Particle Swarm Optimization (PSO) algorithm has several issues: slow convergence speed requiring a large number of iterations, a tendency to get trapped in local optima, and difficulty escaping from them. It is also sensitive to the distribution of the solution space, where uneven distribution can lead to inefficient contraction. On the other hand, the Beetle Antennae Search (BAS) algorithm is robust, precise, and has strong global search capabilities. However, its limitation lies in focusing on a single individual. As the number of iterations increases, the step size decays, causing it to get stuck in local extrema and preventing escape. Although setting a fixed or larger initial step size can avoid this, it results in poor stability. The PSO algorithm, which targets a population, can help the BAS algorithm increase diversity and address its deficiencies. Conversely, the characteristics of the BAS algorithm can aid the PSO algorithm in finding the optimal solution early in the optimization process, accelerating convergence. Therefore, considering the combination of BAS and PSO algorithms can leverage their respective advantages and enhance overall algorithm performance. This paper proposes an improved algorithm, W-K-BSO, which integrates the Beetle Antennae Search strategy into the local search phase of PSO. By leveraging chaotic mapping, the algorithm enhances population diversity and accelerates convergence speed. Additionally, the adoption of linearly decreasing inertia weight enhances algorithm performance, while the coordinated control of the contraction factor and inertia weight regulates global and local optimization performance. Furthermore, the influence of beetle antennae position increments on particles is incorporated, along with the establishment of new velocity update rules. Simulation experiments conducted on nine benchmark functions demonstrate that the W-K-BSO algorithm consistently exhibits strong optimization capabilities. It significantly improves the ability to escape local optima, convergence precision, and algorithm stability across various dimensions, with enhancements ranging from 7 to 9 orders of magnitude compared to the BAS algorithm. Application of the W-K-BSO algorithm to PID optimization for the Pointing and Tracking System (PTS) reduced system stabilization time by 28.5%, confirming the algorithm's superiority and competitiveness. [ABSTRACT FROM AUTHOR]

The Tree-Seed Algorithm (TSA) has been effective in addressing a multitude of optimization issues. However, it has faced challenges with early convergence and difficulties in managing high-dimensional, intricate optimization problems. To tackle these shortcomings, this paper introduces a TSA variant (DTSA). DTSA incorporates a suite of methodological enhancements that significantly bolster TSA's capabilities. It introduces the PSO-inspired seed generation mechanism, which draws inspiration from Particle Swarm Optimization (PSO) to integrate velocity vectors, thereby enhancing the algorithm's ability to explore and exploit solution spaces. Moreover, DTSA's adaptive velocity adaptation mechanism based on count parameters employs a counter to dynamically adjust these velocity vectors, effectively curbing the risk of premature convergence and strategically reversing vectors to evade local optima. DTSA also integrates the trees population integrated evolutionary strategy, which leverages arithmetic crossover and natural selection to bolster population diversity, accelerate convergence, and improve solution accuracy. Through experimental validation on the IEEE CEC 2014 benchmark functions, DTSA has demonstrated its enhanced performance, outperforming recent TSA variants like STSA, EST-TSA, fb-TSA, and MTSA, as well as established benchmark algorithms such as GWO, PSO, BOA, GA, and RSA. In addition, the study analyzed the best value, mean, and standard deviation to demonstrate the algorithm's efficiency and stability in handling complex optimization issues, and DTSA's robustness and efficiency are proven through its successful application in five complex, constrained engineering scenarios, demonstrating its superiority over the traditional TSA by dynamically optimizing solutions and overcoming inherent limitations. [ABSTRACT FROM AUTHOR]

In order to improve the autonomy and intelligence of group animation behavior, this paper proposes a particle swarm optimization algorithm for automatic control of group animation behavior. After the user inputs the group animation behavior construction target, the individual path is planned according to the fixed behavior rules, and the particle swarm optimization algorithm and the improved artificial fish swarm optimization algorithm are used to select the optimal action for the individual in the group animation according to the top-down control process. The experimental results show that after the PSO converges to the global optimal solution, the evolution times of the PSO converge to the global optimal solution again when the surrounding environment changes 10 times. The population diversity of particle swarm optimization algorithm is obviously better than those of the other two algorithms in the process of automatically controlling the movement of individuals to the circle and to the stand in the crowd animation. Compared with the original algorithm AFSA, the improved artificial fish swarm algorithm proposed in this paper is easier to obtain the global optimal value, and the optimization speed is also improved. In conclusion, the example analysis verifies that the algorithm can effectively realize the automatic control of group animation behavior and has high convergence speed and high autonomy. [ABSTRACT FROM AUTHOR]

In the current complex cyber environment, malicious attacks take various forms and constantly change. To overcome the problems of low detection efficiency and high false alarm rate in traditional intrusion detection techniques, a new method of network intrusion detection combining the variable scale chaos bat (MSCB) algorithm and BP neural network (BPNN) called MSCB-BPNN is proposed in this paper. In the proposed approach, a new MSCB algorithm is proposed to improve the BPNN by optimizing its thresholds and weights so as to prevent it from falling into local optimum. To verify the practical classification performance of the proposed method for intrusion detection, some experiments are carried out. In these experiments, the proposed approach is compared with BPNN, SA-BPNN, and GA-BPNN on the benchmark intrusion detection datasets KDD cup 99 and UNSW-NB15. The experimental results show that the accuracy of the proposed method can reach 99.4% and 99.8% accuracy on the KDD cup 99 training and test sets, respectively, while 89.0% and 93.9% accuracy on the UNSW-NB15 training and test sets, respectively, which are higher than BPNN, SA-BPNN, and GA-BPNN. Furthermore, the precision and recall ratio of MSCB-BPNN are also superior to other approaches. Thus, the proposed model has significant advantages over BPNN, SA-BPNN, and GA-BPNN methods. [ABSTRACT FROM AUTHOR]

As is well known that the global optimization ability of the Fruit fly Optimization Algorithm (FOA)is weak because it is easy to fall into local optimum. In this paper, a Fruit Fly Optimization Algorithm based on Locality Sensitive Hashing-aware (LSHFOA)was proposed. The locality sensitive hashing mechanism to optimize the generation mechanism for swarm population individuals was used, which can improve the individual diversity of the population. Meanwhile, when the fruit fly population falls into the local optimum, the locality sensitive hashing mechanism was adopted to change the population location, which is used for jumping out of local optimal limits. To verify the performance of LSHFOA, it was compared with FOA and its improvement algorithms CFOA, and IFFO with 8 representative benchmark functions. A large number of experimental results showed that LSHFOA has a faster convergence speed and higher precision of optimization for function optimization, especially in high-dimensional multi-peak functions. In addition to the theoretical evaluation, we also evaluate its performance in a real-world scenario. Generally, an edge computing environment, as an extension of cloud computing, can allow the users to access the network in a low-latency manner. In this way, to capture the high-speed convergence advantage, this paper makes the first attempt to tackle a classic research problem in the edge computing environment, i.e., the edge server placement problem. The experimental results show that the new algorithm has an excellent application effect. [ABSTRACT FROM AUTHOR]

Among the indoor localization algorithms, the algorithm based on traditional Back Propagation Neural Network (BPNN) has the problems of slow convergence and easy to fall into local optimum. It is difficult to apply the algorithm in noisy environments. Therefore, in this paper, we propose a novel indoor localization algorithm where the whole localization process is divided into two parts: data preprocessing and localization output. Data preprocessing means using filtering algorithm to process the Received Signal Strength Indication (RSSI) sequence. It is considered that the initial value of the received sequence has a significant impact on the performance of Kalman Filter (KF). An improved Kalman Filtering algorithm (DBSCAN-KF) is proposed based on the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. First, the RSSI values that are seriously disturbed by noise in the sequence are removed using the DBSCAN algorithm, and then the RSSI sequences are processed using KF so that the RSSI values can be closer to the theoretical values. The localization output part is to reduce the localization error caused by the BPNN. In this paper, the Differential Evolution (DE) algorithm and Particle Swarm Optimization (PSO) algorithm are combined, and the Differential Evolution Particle Swarm Optimization (DE-PSO) algorithm is proposed. The BPNN weights and thresholds are optimized in parallel, which improves the speed and ability of global optimization search and further avoids the shortcomings of traditional BPNNs that are prone to fall into local optimization in the training process. Experimental results show that the BPNN localization algorithm based on DBSCAN-KF improves the average localization accuracy by 0.26m compared with the BPNN localization algorithm without filtering. After filtering, the localization algorithm based on DE-PSO improved BPNN (DE-PSO-BP) improves the average localization accuracy by about 24% compared with the localization algorithm based on DE-PSO-BP. The localization algorithm based on DE-PSO-BP improves the average localization accuracy by about 61% compared with the traditional BPNN. [ABSTRACT FROM AUTHOR]

In recent days, the major concern for diabetic patients is foot ulcers. According to the survey, among 15 people among 100 are suffering from this foot ulcer. The wound or ulcer found which is found in diabetic patients consumes more time to heal, also required more conscious treatment. Foot ulcers may lead to deleterious danger condition and also may be the cause for loss of limb. By understanding this grim condition, this paper proposes Fractional-Order Darwinian Particle Swarm Optimization (FO-DPSO) technique for analyzing foot ulcer 2D color images. This paper deals with standard image processing, i.e. efficient segmentation using FO-DPSO algorithm and extracting textural features using Gray Level Co-occurrence Matrix (GLCM) technique. The whole effort projected results as accuracy of 91.2%, sensitivity of 100% and specificity as 96.7% for Naïve Bayes classifier and accuracy of 91.2%, sensitivity of 100% and sensitivity of 79.6% for Hoeffding tree classifier. [ABSTRACT FROM AUTHOR]

In recent years, the cuckoo search (CS) algorithm has been successfully applied to single-objective optimization problems. But in real life, most optimization problems are multi-objective optimization problems (MOPs). In order to enable CS to better solve MOPs, this paper proposes an elite-guided multi-objective cuckoo search algorithm based on cross-operation and information enhancement (CIE-MOCS). This algorithm first enhances its population diversity through crossover operation, then adds elite individuals to guide its update process to speed up the algorithm convergence speed. Finally, the method of information enhancement is adopted in the abandonment process, so that the algorithm is not easy to fall into the local optimum. In order to verify the performance of the algorithm, this paper uses a variety of benchmark functions and performance evaluation indicators to evaluate it, and provides a case to verify the effectiveness of the algorithm in practical applications. The experimental results show that CIE-MOCS has good performance compared with the contrasting algorithms. [ABSTRACT FROM AUTHOR]

Conventionally, researchers have favored the model-based control scheme for controlling gantry crane systems. However, this method necessitates a substantial investment of time and resources in order to develop an accurate mathematical model of the complex crane system. Recognizing this challenge, the current paper introduces a novel data-driven control scheme that relies exclusively on input and output data. Undertaking a couple of modifications to the conventional marine predators algorithm (MPA), random average marine predators algorithm (RAMPA) with tunable adaptive coefficient to control the step size (CF) has been proposed in this paper as an enhanced alternative towards fine-tuning data-driven multiple-node hormone regulation neuroendocrine-PID (MnHR-NEPID) controller parameters for the multi-input–multi-output (MIMO) gantry crane system. First modification involved a random average location calculation within the algorithm's updating mechanism to solve the local optima issue. The second modification then introduced tunable CF that enhanced search capacity by enabling users' resilience towards attaining an offsetting level of exploration and exploitation phases. Effectiveness of the proposed method is evaluated based on the convergence curve and statistical analysis of the fitness function, the total norms of error and input, Wilcoxon's rank test, time response analysis, and robustness analysis under the influence of external disturbance. Comparative findings alongside other existing metaheuristic-based algorithms confirmed excellence of the proposed method through its superior performance against the conventional MPA, particle swarm optimization (PSO), grey wolf optimizer (GWO), moth-flame optimization (MFO), multi-verse optimizer (MVO), sine-cosine algorithm (SCA), salp-swarm algorithm (SSA), slime mould algorithm (SMA), flow direction algorithm (FDA), and the formally published adaptive safe experimentation dynamics (ASED)-based methods. [ABSTRACT FROM AUTHOR]

In the era of network communication, digital image encryption (DIE) technology is critical to ensure the security of image data. However, there has been limited research on combining deep learning neural networks with chaotic mapping for the encryption of digital images. So, this paper addresses this gap by studying the generation of pseudo-random sequences (PRS) chaotic signals using dual logistic chaotic maps. These signals are then predicted using long and short-term memory (LSTM) networks, resulting in the reconstruction of a new chaotic signal. During the research process, it was discovered that there are numerous training parameters associated with the LSTM network, which can hinder training efficiency. To overcome this challenge and improve training efficiency, the paper proposes an improved particle swarm optimization (IPSO) algorithm to optimize the LSTM network. Subsequently, the obtained chaotic signal from the optimized model training is further scrambled, obfuscated, and diffused to achieve the final encrypted image. This research presents a digital image encryption (DIE) algorithm based on a double chaotic map (DCM) and LSTM. The algorithm demonstrates a high average NPCR (Number of Pixel Change Rate) of 99.56% and a UACI (Unified Average Changing Intensity) value of 33.46%, indicating a strong ability to resist differential attacks. Overall, the proposed algorithm realizes secure and sensitive digital image encryption, ensuring the protection of personal information in the Internet environment. [ABSTRACT FROM AUTHOR]

For underwater target exploration, multiple Autonomous Underwater Vehicles (AUVs) have shown significant advantages over single AUVs. Aiming at Multi-AUV task allocation, which is an important issue for collaborative work in underwater environments, this paper proposes a Multi-AUV task allocation method based on the Differential Evolutionary Gray Wolf Optimization (DE-GWO) algorithm. Firstly, the working process of the Multi-AUV system was analyzed, and the allocation model and objective function were established. Then, we combined the advantages of the strong global search capability of the Differential Evolutionary (DE) algorithm and the excellent convergence performance of Gray Wolf Optimization (GWO) to solve the task assignment of the Multi-AUV system. Finally, a reassignment mechanism was used to solve the problem of AUV failures during the task's execution. In the simulation comparison experiments, the DE-GWO, GWO, DE, and Particle Swarm Optimization (PSO) algorithms were carried out for different AUV execution capabilities, respectively. [ABSTRACT FROM AUTHOR]

Recently, there had been a massive group of people, who were being rapidly affected by melanoma. Melanoma is a form of skin cancer that develops on the skin's surface layer. This is primarily caused due to excessive skin exposure to UV radiation and severe sunburns. Thus, the early detection of melanoma can aid us to cure it completely. This paper intends to introduce a new melanoma detection framework with four main phases viz. segmentation, feature extraction, optimal feature selection, as well as detection. Initially, the segmentation process takes place to the input skin image via Fuzzy C-Means Clustering (FCM) approach. From the segmented image ( Im seg ) , some of the features such as Gray Level Run Length Matrix (GLRM), Local Vector Pattern (LVP), Local Binary Pattern (LBP), Local Directional Pattern (LDP) and Local Tetra Pattern (LTrP) are extracted. As the extracted features (F) suffered from the issue of "curse of dimensionality", this paper utilizes optimization to select optimal features, which makes the detection more precise. As a novelty, a new hybrid algorithm Particle-Assisted Moth Search Algorithm (PA-MSA) is introduced that hybridizes the concept of Moth Search Algorithm (MSA) and Particle Swarm Optimization (PSO), respectively. For the classification process, the optimally chosen features (F opt ) are fed as input, where Deep Convolution Neural Network (DCNN) is used. Finally, a performance-based comparative analysis is conducted among the proposed PA-MSA as well as the existing models with respect to various measures. [ABSTRACT FROM AUTHOR]

In complex two-dimensional monitoring environments, how to enhance network efficiency and network lifespan while utilizing limited energy resources, and ensuring that wireless sensor networks achieve the required partial coverage of the monitoring area, are the challenges of optimizing coverage in wireless sensor networks.With the premise of ensuring connectivity in the target network area, an enhanced multi-objective salp swarm algorithm based on non-dominated sorting (EMSSA) is proposed in this paper, by jointly optimizing network coverage, node utilization, and network energy balance objectives. Firstly, the logistic chaotic mapping is used to maintain the diversity of the initial salp swarm population. Secondly, to balance global and local search capabilities, a new dynamic convergence factor is introduced. Finally, to escape local optima more effectively, a follower updating strategy is implemented to reduce the blind following of followers while retaining superior individual information. The effectiveness of the strategy is validated through comparative experiments on ZDT and DTLZ test functions, and the proposed algorithm is applied to coverage optimization in WSNs in complex environments. The results demonstrate that the algorithm can adjust coverage thresholds according to different application requirements, providing various effective coverage optimization configurations. With the same preset requirements for partial coverage achieved, both network efficiency and lifespan have been significantly improved. [ABSTRACT FROM AUTHOR]

In this paper, solving the problem of the noise covariance matrix parameters tuning of the extended Kalman filter (EKF) and unscented Kalman filter algorithms (UKF) is difficult. A speed estimation strategy for a permanent magnet synchronous motor (PMSM) based on particle swarm optimization (PSO) optimized Kalman filter (KF) series algorithms is proposed. By using MATLAB/Simulink, in this paper, 20 effective simulation experiments on the noise covariance matrix parameter optimization process are conducted to obtain the optimal covariance matrix parameters of the extended Kalman filter and unscented Kalman filter. Moreover, EKF, PSO-EKF, UKF, and PSO-UKF are also compared to verify the effectiveness of the particle swarm optimization algorithm in optimizing the systems using the extended Kalman filter and unscented Kalman filter. For the error of speed estimation, taking 4000 rpm as a reference, the system using PSO-EKF has improved by 2.125% compared to that using EKF, and the system applying PSO-UKF has improved by 0.55% compared to the system applying UKF. For the error of electrical angle estimation, taking the system errors of original algorithms as references, the system adopting PSO-EKF has decreased by 60% compared to that adopting EKF, and the system using PSO-UKF has decreased by 47% compared to the system using UKF. [ABSTRACT FROM AUTHOR]

Inspired by the migration and reproduction of species in nature to explore suitable habitats, this paper proposed a new swarm intelligence algorithm called the Migration and Reproduction Algorithm (MARA). This new algorithm discusses how to transform the behavior of an organism looking for a suitable habitat into a mathematical model, which can solve optimization problems. MARA has some common features with other optimization methods such as particle swarm optimization (PSO) and the fireworks algorithm (FWA), which means MARA can also solve the optimization problems that PSO and FWA are used to, namely, high-dimensional optimization problems. MARA also has some unique features among biology-based optimization methods. In this paper, we articulated the structure of MARA by correlating it with natural biogeography; then, we demonstrated the performance of MARA on sets of 12 benchmark functions. In the end, we applied it to optimize a practical problem of power dispatching in a multi-microgrid system that proved it has certain value in practical applications. [ABSTRACT FROM AUTHOR]

Spam emails have become a pervasive issue in recent years, as internet users receive increasing amounts of unwanted or fake emails. To combat this issue, automatic spam detection methods have been proposed, which aim to classify emails into spam and non-spam categories. Machine learning techniques have been utilized for this task with considerable success. In this paper, we introduce a novel approach to spam email detection by presenting significant advancements to the Dandelion Optimizer (DO) algorithm. The DO is a relatively new nature-inspired optimization algorithm inspired by the flight of dandelion seeds. While the DO shows promise, it faces challenges, especially in high-dimensional problems such as feature selection for spam detection. Our primary contributions focus on enhancing the DO algorithm. Firstly, we introduce a new local search algorithm based on flipping (LSAF), designed to improve the DO's ability to find the best solutions. Secondly, we propose a reduction equation that streamlines the population size during algorithm execution, reducing computational complexity. To showcase the effectiveness of our modified DO algorithm, which we refer to as the Improved DO (IDO), we conduct a comprehensive evaluation using the Spam base dataset from the UCI repository. However, we emphasize that our primary objective is to advance the DO algorithm, with spam email detection serving as a case study application. Comparative analysis against several popular algorithms, including Particle Swarm Optimization (PSO), the Genetic Algorithm (GA), Generalized Normal Distribution Optimization (GNDO), the Chimp Optimization Algorithm (ChOA), the Grasshopper Optimization Algorithm (GOA), Ant Lion Optimizer (ALO), and the Dragonfly Algorithm (DA), demonstrates the superior performance of our proposed IDO algorithm. It excels in accuracy, fitness, and the number of selected features, among other metrics. Our results clearly indicate that the IDO overcomes the local optima problem commonly associated with the standard DO algorithm, owing to the incorporation of LSAF and the reduction in equation methods. In summary, our paper underscores the significant advancement made in the form of the IDO algorithm, which represents a promising approach for solving high-dimensional optimization problems, with a keen focus on practical applications in real-world systems. While we employ spam email detection as a case study, our primary contribution lies in the improved DO algorithm, which is efficient, accurate, and outperforms several state-of-the-art algorithms in various metrics. This work opens avenues for enhancing optimization techniques and their applications in machine learning. [ABSTRACT FROM AUTHOR]

This paper extends our previous algorithm, termed as Particle Swarm Optimization with Distributed Acceleration Constants (PSODAC), which has been introduced for mitigating congestion based on rescheduling in a deregulated environment. The proposed variant adopts a sequential hybridization of the PSODAC principle with Differential Evolution, which is a well-known evolutionary algorithm. The variant in this paper is termed as Sequentially Hybridized Differential Evolution with Particle Swarm Optimization (SH-DEPSO). The experimental investigations are carried out in the IEEE 14 bus system in two scenarios namely, single point congestion and multipoint congestion. Firstly, the performance investigation is carried out on mitigating the congestion using cost analysis, stability analysis, complexity analysis, and strategy analysis. Secondly, the characteristics of the algorithm are observed by performing convergence analysis and investigating the quality of the solution dynamics. The studies demonstrate the competing performance of SH-DEPSO over PSODAC and the traditional PSO. [ABSTRACT FROM AUTHOR]

In CNC toolpath generation process, the operation of linking toolpaths from different sub-machining regions is common and inevitable. Apparently, the jumping toolpath between machining regions is invalid. They do not contribute to the machining process but only waste valuable manufacturing time; therefore, these toolpaths should be as short as possible. Many methods have been used to link toolpaths, such as the Genetic Algorithm (GA), the Particle Swarm Optimization (PSO) or even the greedy algorithm. However, GA and PSO require multiple iterations to find the global optimum, while greedy algorithm selects the current shortest connection each time without considering the global optimum. To reduce the total length of non-productive toolpaths and save computing time, in this paper, a new method is proposed by modeling the toolpath linking problem purely as a traveling salesman problem (TSP). The initial toolpaths in different subregions are generated in ordinary ways. Each toolpath of a subregion has two endpoints, which can be simplified as a line segment. In this way, the toolpath linking problem can be considered as a segment TSP: finding the shortest tour through all the segments. In this paper, the efficient TSP solver using Lin-Kernighan–Helsgaun (LKH) algorithm is employed and modified for the segment TSP application. The distance function between 'cities' is redefined to adapt the segments TSP. Finally, the feasibility of the proposed method is verified with several examples. The comparison with the result of traditional greedy algorithm proves the superiority of the proposed method. [ABSTRACT FROM AUTHOR]

In the lung computer-aided detection (Lung CAD) system, the region of interest (ROI) of lung nodules has more false positives, making the imbalance between positive and negative (true positive and false positive) samples more likely to lead to misclassification of true positive nodules, a cost-sensitive multikernel learning support vector machine (CS-MKL-SVM) algorithm is proposed. Different penalty coefficients are assigned to positive and negative samples, so that the model can better learn the features of true positive nodules and improve the classification effect. To further improve the detection rate of pulmonary nodules and overall recognition accuracy, a score function named F-new based on the harmonic mean of accuracy (ACC) and sensitivity (SEN) is proposed as a fitness function for subsequent particle swarm optimization (PSO) parameter optimization, and a feasibility analysis of this function is performed. Compared with the fitness function that considers only accuracy or sensitivity, both the detection rate and the recognition accuracy of pulmonary nodules can be improved by this new algorithm. Compared with the grid search algorithm, using PSO for parameter search can reduce the model training time by nearly 20 times and achieve rapid parameter optimization. The maximum F-new obtained on the test set is 0.9357 for the proposed algorithm. When the maximum value of F-new is achieved, the corresponding recognition ACC is 91%, and SEN is 96.3%. Compared with the radial basis function in the single kernel, the F-new of the algorithm in this paper is 2.16% higher, ACC is 1.00% higher and SEN is equal. Compared with the polynomial kernel function in the single kernel, the F-new of the algorithm is 3.64% higher, ACC is 1.00% higher and SEN is 7.41% higher. The experimental results show that the F-new, ACC and SEN of the proposed algorithm is the best among them, and the results obtained by using multikernel function combined with F-new index are better than the single kernel function. Compared with the MKL-SVM algorithm of grid search, the ACC of the algorithm in this paper is reduced by 1%, and the results are equal to those of the MKL-SVM algorithm based on PSO only. Compared with the above two algorithms, SEN is increased by 3.71% and 7.41%, respectively. Therefore, it can be seen that the cost sensitive method can effectively reduce the missed detection of nodules, and the availability of the new algorithm can be further verified. [ABSTRACT FROM AUTHOR]

Cloud computing has seen a major boom during the past few years. Many people have switched to cloud computing because traditional systems require complex resource distribution and cloud solutions are less expensive. Load balancing (LB) is one of the essential challenges in cloud computing used to balance the workload of cloud services. This research paper presents a performance evaluation of the existing load-balancing algorithms which are particle swarm optimization (PSO), round robin (RR), equally spread current execution (ESCE), and throttled load balancing. This study offers a detailed performance evaluation of various load-balancing algorithms by employing a cloud analyst platform. Efficiency concerning various service broker policy configurations for load-balancing algorithms' virtual machine load balance was also calculated using metrics such as optimized response time (ORT), data center processing time (DCPT), virtual machine costs, data transfer costs, and total cost for different workloads and user bases. Many of the past papers that were mentioned in the literature worked on round robin and equally spread current execution, and throttled load-balancing algorithms were based on efficiency and response time in virtual machines without recognizing the relation between the task and the virtual machines, and the practical significance of the application. A comparison of specific load-balancing algorithms has been investigated. Different service broker policy (SBP) tests have been conducted to illustrate the load-balancing algorithm capabilities. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks are booming with the development of computer technology, network communication technology, and sensor technology. However, the question of how to use fewer nodes to achieve maximum coverage still exists. In this paper, a two-layer Surrogate-Assisted Phasmatodea Population Evolution (SAPPE) is proposed for 3D coverage of wireless sensors by combining the characteristics of meta-heuristic algorithms and surrogate models. In this algorithm, Radial Basis Function Networks are used to construct the surrogate model, and the two surrogate models are global surrogate-assisted and local surrogate-assisted, respectively. The global-surrogate model is used to smooth the fitness function, and the local surrogate-assisted model is used to find the optimal value accurately. They use the same archive DataBase (DB) to store particle positions and true fitness values. However, the number of particles involved in the creation of the surrogate-assisted model is different. Seven benchmark functions are used to test and analyze the algorithm, and the results show that the algorithm has good performance. Also, the algorithm verified the significance of the algorithm using Wilcoxon rank test. The result shows that the proposed algorithm is effective compared with PPE, PSO, PPSO, FMO, and BA. This paper compares the number of nodes and coverage radius using different algorithms to ensure maximum coverage. The result shows that the SAPPE algorithm has better performance in terms of 3D coverage. [ABSTRACT FROM AUTHOR]