In this paper, we implement a new method binary Particle Swarm Optimization (PSO) for solving the kidney exchange problem, which will improve the future decisions of kidney exchange programs. Because using a kidney exchange, we can help incompatible patient-donor couples to swap donors to receive a compatible kidney. Kidney paired donation programs provide an innovative approach for increasing the number of available kidneys. Further, we implementing binary particle swarm optimization in parallel with MATLAB with one, two, three and four threads and from the computations point of view, the authors compare the performance to reduce the running time for kidney exchange to match patients as fast as possible to help clinicians. Moreover, implementing binary particle swarm optimization in solving the kidney exchange problem is an effective method. The obtained results indicate that binary PSO outperforms other stochastic-based methods such as genetic algorithm, ant lion optimization, and efficient the number of resulting exchanges.

Nowadays, model checking is applied as an accurate technique to verify software systems. The main problem of model checking techniques is the state space explosion. This problem occurs due to the exponential memory usage by the model checker. In this situation, using meta-heuristic and evolutionary algorithms to search for a state in which a property is satisfied/violated is a promising solution. Recently, different evolutionary algorithms like GA, PSO, etc. are applied to find deadlock state. Even though useful, most of them are concentrated on finding deadlock. This paper proposes a fuzzy algorithm in order to analyze reachability properties in systems specified through GTS with enormous state space. To do so, we first extend the existing PSO algorithm (for checking deadlocks) to analyze reachability properties. Then, to increase the accuracy, we employ a Fuzzy adaptive PSO algorithm to determine which state and path should be explored in each step to find the corresponding reachable state. These two approaches are implemented in an open-source toolset for designing and model checking GTS called GROOVE. Moreover, the experimental results indicate that the hybrid fuzzy approach improves speed and accuracy in comparison with other techniques based on meta-heuristic algorithms such as GA and the hybrid of PSO-GSA in analyzing reachability properties.

Particle swarm optimization (PSO) is an effective algorithm to solve the optimization problem in case that derivative of target function is inexistent or difficult to be determined. Because PSO has many parameters and variants, I propose a general framework of PSO called GPSO which aggregates important parameters and generalizes important variants so that researchers can customize PSO easily. Moreover, two main properties of PSO are exploration and exploitation. The exploration property aims to avoid premature converging so as to reach global optimal solution whereas the exploitation property aims to motivate PSO to converge as fast as possible. These two aspects are equally important. Therefore, GPSO also aims to balance the exploration and the exploitation. It is expected that GPSO supports users to tune parameters for not only solving premature problem but also fast convergence.

In this paper, a multi-patch weakly singular isogeometric boundary element method (WSIGABEM) for two-dimensional elastostatics is proposed. Since the method based on the weakly singular boundary integral equation, the quadrature techniques, dedicated for the weakly singular and regular integrals, are applied in the method. A new formula for the generation of collocation points is suggested to take the full advantage of the multi-patch technique. The generated collo-cation points are essentially inside the patches without any correction. If the boundary conditions are assumed to be continuous in every patch, no collocation point lies on the discontinuous boundaries, thus simplifying the implementation. The multi-patch WSIGABEM is verified by the simple examples with analytical solutions. The feature of the present multi-patch WSIGABEM is investigated by the comparison with the traditional IGABEM. Furthermore, the combination of the present multi-patch WSIGABEM and the particle swarm optimization algorithm results in a shape optimization method in two-dimensional elastostatics. By changing some specific control points and their weights, the shape optimizations of the fillet corner, the spanner and the arch bridge are verified to be effective.

Multigranulation is a new approach to the Rough Set Theory, where several separability relationships are used to obtain different granulations of the universe. The Multigranulation starts from the existence of different contexts or subsets of features to characterize the objects of the universe. In this paper, a method for the generation of contexts from the construction of similarity relations is proposed.The proposed solution was evaluated in an international database using the KNN classifier. It was also applied in the solution of a real problem in Civil Engineering specifically in Traffic Engineering, the contexts generated from the proposal used to determine the features of higher incidence in the service level of the road. The results achieved both in the international database and in the proposed application demonstrate the applicability of the proposed method.

Water is essential for living organisms. The increase in world population, global climate change and rapid growth in industrialization and urbanization have brought with them water issues around the world in recent years. Not only should existing water resources be used reasonably and efficiently but alternative water resources should also be explored and secured. Rainwater harvesting, which is one of the alternative water resources, can provide economic and environmental solutions. For rainwater harvesting, the size of reservoirs in which rainwater captured from roof catchments is stored should be determined. Determining the optimum tank capacity depending on precipitation and consumption rates allows us to make maximum use of rainwater tanks. The aim of this study is to determine the optimum tank capacity for the storage of rainwater captured from roof catchments in order to meet the water demand for agricultural production. Precipitation data were collected from the city of Isparta and its districts. Rainwater tank capacity was determined using the Rippl, residual mass curve, minimum flow and particle swarm optimization methods. Storage capacities varying according to roof areas and consumption rates are shown in a graph. Results show that particle swarm optimization is the best method.

This paper introduces an innovative Particle Swarm Optimization (PSO) Algorithm in-corporating Sobol and Halton Random number samplings. It evaluates the enhanced PSO's performance against conventional PSO employing Monte Carlo Random Number Samplings. The comparison involves assessing the algorithms across nine benchmark problems and the renowned Travelling Salesman Problem (TSP). The re-sults reveal consistent enhancements achieved by the enhanced PSO utilizing Sob-ol/Halton samplings across the benchmark problems. Particularly noteworthy are the substantial improvements demonstrated by the enhanced PSO in solving the Travel-ling Salesman Problem. These findings underscore the efficacy of employing Sobol and Halton random number generation methods in enhancing algorithm efficiency.

Swarm intelligence (SI) methods are nature-inspired metaheuristics for global optimization that exploit a coordinated stochastic search strategy by a group of agents. Particle Swarm Optimization (PSO) is an established SI method that has been applied successfully to the optimization of rugged high-dimensional likelihood functions, a problem that presents the main bottleneck across a variety of gravitational wave (GW) data analysis challenges. We present results from a first application of PSO to one of the most difficult of these challenges, namely, the search for Extreme Mass Ratio Inspiral (EMRI) in data from future spaceborne GW detectors such as LISA, Taiji, or Tianqin. We use the standard Generalized Likelihood Ratio Test formalism, with minimal use of restrictive approximations, to search 6 months of simulated LISA data and quantify the search depth, in signal-to-noise ratio (SNR), and breadth, in the ranges of the EMRI parameters, that PSO can handle. Our results demonstrate that a PSO-based EMRI search is successful over a search region that is in the ballpark of the one that current hierarchical schemes can identify. Directions for future improvements, including computational bottlenecks to be overcome, are identified.

This study aims to evaluate a new approach in modeling gully erosion susceptibility based on deep learning neural network (DLNN) model, ensemble Particle swarm optimization (PSO) algorithm with DLNN (PSO-DLNN) and comparing these approaches with common artificial neural network (ANN) and support vector machine (SVM) models in Shiran watershed, Iran. For this purpose, 13 independent variables affecting gully erosion susceptibility in the study area, including altitude, slope, aspect, plan curvature, profile curvature, drainage density, distance from river, land use, soil, lithology, rainfall, , stream power index (SPI), topographic wetness index (TWI), were prepared. Also, 132 gully erosion locations were identified during field visits. Data for modeling were divided into two categories of training (70%) and testing (30%). Receiver operating characteristic (ROC) parameters including sensitivity, specificity, negative predictive value (NPV), positive predictive value (PPV) and area under curve (AUC) were used to evaluate the performance of the models. The results showed that, the AUC values from ROC with considering testing datasets of PSO-DLNN is 0.89 and which is associated with superb accuracy. Rest of the models also associated with optimal accuracy and near about PSO-DLNN model; the AUC values from ROC of DLNN, SVM and ANN for testing datasets are 0.87, 0.85 and 0.84 respectively. The PSO algorithm has updated and optimized the weights of DLNN model, and as a result, the efficiency of this model in predicting gully erosion susceptibility has increased. Therefore, it can be concluded that the use of DLNN model and its ensemble with PSO algorithm can be used as a novel and practical method in predicting the susceptibility of gully erosion that helps planners and managers in managing and reducing the risk of this phenomenon.

The Fuzzy Transportation Problem (FTP) represents a significant extension of the Classical Transportation Problem (TP) by introducing uncertainly and imprecision into the parameters involved. Various algorithms have been proposed to solve the FTP, including fuzzy linear programming, metaheuristic algorithms and fuzzy mathematical programming techniques combined with Artificial Neural Networks. This paper presents the application of Trigonometric Acceleration Coefficients-PSO (TrigAc-PSO), a variation of the Classical Particle Swarm optimization algorithm, which is an innovative algorithm originally developed for solving the TP. TrigAC-PSO, has demonstrated remarkable success in optimizing various problem domains in crisp environments.

Indonesia's SUMBAGUT 150 kV transmission of High Voltage Alternating Current Network (HVAC) system has considerable power losses. These power losses are a critical problem in the transmission network system. Meanwhile, this study provides one solution to reduce power losses using a High Voltage Direct Current (HVDC) network system. Determining the location to convert HVAC into HVDC is very important. The authors use Particle Swarm Optimization (PSO) to get the optimal location on the 150 kV SUMBAGUT HVAC transmission network system. The study results showed that before using the HVDC network system, the power losses were 122.26 MW. Meanwhile, power losses with one transmission HVDC in the "Paya Pasir-Sei Rotan" are 84.16 MW, "Porsa-P. Siantar" 90.83 MW, "Paya Pasir-Paya Geli" 104.14 MW. Then power losses with two transmission HVDC in "Paya Pasir-Sei Rattan" and "Porsa-P. Siantar" is 71.24 MW, "Paya Pasir-Sei Rotan" and "Paya Pasir-Paya Geli" 77.46 MW, "Porsa-P. Siantar" and "Paya Pasir-Paya Geli" 78.52 MW. The last result, power losses with three transmission HVDC in "Paya Pasir-Sei Rotan," "Porsa-P. Siantar," and "Paya Pasir-Paya Geli" lost 64.57 MW.

Scour depth around bridge piers plays a vital role in the safety and stability of the bridges. Existing methods to predict scour depth are mainly based on regression models or black box models in which the first one lacks enough accuracy while the later one does not provide a clear mathematical expression to easily employ it for other situations or cases. Therefore, this paper aims to develop new equations using particle swarm optimization as a metaheuristic approach to predict scour depth around bridge piers. To improve the efficiency of the proposed model, individual equations are derived for laboratory and field data. Moreover, sensitivity analysis is conducted to achieve the most effective parameters in the estimation of scour depth for both experimental and filed data sets. Comparing the results of the proposed model with those of existing regression-based equations reveal the superiority of the proposed method in terms of accuracy and uncertainty. Moreover, the ratio of pier width to flow depth and ratio of d50 (mean particle diameter) to flow depth for the laboratory and field data were recognized as the most effective parameters, respectively. The derived equations can be used as a suitable proxy to estimate scour depth in both experimental and prototype scales.

With the engineering system becoming more and more complex, the uncertainty factors have a more and more profound influence on the reliability and security of the engineering system. In recent years, Reliability-Based Design Optimization (RBDO) has been studied extensively in complex engineering system design. The research on reliability optimization design considering stochastic uncertainty has been comprehensive and widely used. However, the reliability optimization design considering mixed uncertainty has the disadvantages of large computation and imprecise convergence. This study proposes an RBDO method based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to overcome this challenge. In the method, PSO is used to solve the most probable point, while SA has excellent global optimization capability to acquire the global optimal solution. Finally, three examples are given to illustrate the advantages of the proposed method.

Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional problems which cannot be solved using traditional deterministic algorithms. The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. This paper serves to provide a thorough survey of the PSO algorithm with special emphasis on the development, deployment and improvements of its most basic as well as some of the very recent state–of-the-art implementations. Concepts and directions on choosing the inertia weight, constriction factor, cognition and social weights and perspectives on convergence, parallelization, elitism, niching and discrete optimization as well as neighborhood topologies are outlined. Hybridization attempts with other evolutionary and swarm paradigms in selected applications are covered and an up-to-date review is put forward for the interested reader.

Extreme-mass-ratio inspirals (EMRIs) are significant observational targets for spaceborne gravitational wave detectors, namely, LISA, Taiji, and Tianqin, which involve the inspiral of stellar-mass compact objects into massive black holes with a mass range of approximately 104∼107M⊙. EMRIs are estimated to produce long lived gravitational wave signals with more than 105 cycles before plunge, making them an ideal laboratory for exploring the strong-gravity properties of the spacetimes around the MBHs, stellar dynamics in galactic nuclei, and properties of the MBHs itself. However, the complexity of the waveform model, which involves the superposition of multiple harmonics, as well as the high-dimensional and large-volume parameter space, make the fully coherent search challenging. In our previous work, we proposed a 10-dimensional search using Particle Swarm Optimization (PSO) with local maximization over the three initial angles. In this study, we extend the search to an 8-dimensional PSO with local maximization over both the three initial angles and the angles of spin direction of the MBH where the latter contribute a time independent amplitude to the waveforms. Additionally we propose a 7-dimensional PSO search by using a fiducial value for the initial orbital frequency and shifting the corresponding 8-dimensional Time Delay Interferometry responses until a certain lag returns the corresponding 8-dimensional log-likelihood ratio maximum. The reduced dimensionality likelihoods enable us to successfully search for EMRI signals with duration of 0.5 years and signal-to-noise ratio of 50 within a wider search range than our previous study. We discuss further developments, such as using a hierarchical search to narrow down the search ranges of certain parameters, and applying Graphics Processing Units to speed up the code. These advances aim to improve the efficiency and accuracy of the EMRI search algorithm.

Most of existing fuzzy forecasting models partition historical training time series into fuzzy time series and build fuzzy-trend logical relationship groups to generate forecasting rules. The determination process of intervals is complex and uncertainty. In this paper, we present a novel fuzzy forecasting model based on high-order fuzzy-fluctuation trends and the fuzzy-fluctuation logical relationships of the training time series. Firstly, we compare each data with the data of its previous day in historical training time series to generate a new fluctuation trend time series(FTTS). Then, fuzzify the FTTS into fuzzy-fluctuation time series(FFTS) according to the up, equal or down range and orientation of the fluctuations. Since the relationship between historical FFTS and the fluctuation trend of future is nonlinear, Particle Swarm Optimization (PSO) algorithm is employed to estimate the required parameters. Finally, use the acquired parameters to forecast the future fluctuations. In order to compare the performance of the proposed model with that of the other models, we apply the proposed method to forecast the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) time series datasets. The experimental results and the comparison results show that the proposed method can be successfully applied in stock market forecasting or such kinds of time series. We also apply the proposed method to forecast Shanghai Stock Exchange Composite Index (SHSECI) to verify its effectiveness and universality.

Accurate medical image segmentation is paramount for precise diagnosis and treatment in modern healthcare. This research presents a comprehensive study on the efficacy of Particle Swarm Optimization (PSO) combined with Histogram Equalization (HE) preprocessing for medical image segmentation, focusing on Lung CT-Scan and Chest X-ray datasets. Best Cost values reveal the PSO algorithm’s performance, with HE preprocessing demonstrating significant stabilization and enhanced convergence, particularly in complex Lung CT-Scan images. Evaluation metrics, including Accuracy, Precision, Recall, F-Score, Specificity, Dice, and Jaccard, show substantial improvements with HE preprocessing, emphasizing its impact on segmentation accuracy. Comparative analyses against alternative methods, such as Otsu, Watershed, and K-means, confirm the competitiveness of the PSO-HE approach, especially in Chest X-ray images. The study also underscores the positive influence of preprocessing on image clarity and precision. These findings highlight the promise of the PSO-HE approach in advancing the accuracy and reliability of medical image segmentation, paving the way for further research and method integration to enhance this critical healthcare application.

Soil moisture is an important factor affecting the plant growth. For a long time, the convenience, timeliness and accuracy of soil moisture monitoring have been limited due to the backward of observation methods and equipment. Therefore, the quantitative prediction of soil moisture has become a difficult problem. Aiming at the problems of high erection cost, easily damaged sensors and low measurement accuracy of the existing fixed sensor soil moisture monitoring system, a soil moisture prediction model based on the long short term memory neural network (LSTM) integrating the particle swarm optimization (PSO) (PSO-LSTM) is designed and implemented. The hyperparameters of the LSTM network can be obtained based on the excellent global search ability of the PSO algorithm. According to the meteorological data and soil moisture data of Haidian Park in 2019, the long short term memory(LSTM) neural network based prediction model is constructed with input vectors of surface temperature, average temperature, evaporation, sunshine hours, precipitation and average wind speed, and the output vector of soil relative humidity. The results show that compared with the back propagation(BP) neural network, the Elman neural network and the LSTM neural network, the proposed PSO-LSTM model has higher prediction performance.

With the every passing day, the demand for data traffic is increasing and this demand forces the research community not only to look for alternating spectrum for communication but also urges the radio frequency planners to use the existing spectrum smartly. Cell size is shrinking with the every upcoming communication generation which makes the base station placement planning complex and cumbersome. In order to make the next-generation cost-effective, it is important to design the network in such a way which utilizes minimum number of base stations while ensure coverage and quality of service. This paper aims at develop a new approach using hybrid metaheuristic and metamodel applied in multi-transmitter placement planning (MTPP) problem. We apply radial basis function (RBF) metamodel to assist particle swarm optimizer (PSO) in a constrained simulation-optimization (SO) of MTPP to mitigate the associated computational burden of optimization procedure. We evaluate the effectiveness and applicability of proposed algorithm in a case study by simulating MTPP model with two, three, four and five transmitters.

Evolutionary algorithms and swarm intelligence algorithms find applicability in reinforcement learning of neural networks due to their independence from gradient-based methods. To achieve successful training of neural networks using these algorithms, careful considerations must be made to select appropriate algorithms due to the availability of various algorithmic variations. In Part1, 2 and 3, the author previously reported experimental evaluations on Evolution Strategy, Genetic Algorithm, and Differential Evolution for reinforcement learning of neural networks, utilizing the Acrobot control task. This article constitutes Part4 of the series of comparative research. In this study, Particle Swarm Optimization is adopted as an instance of major swarm intelligence algorithms. The experimental result shows that PSO performed worse than all of DE, GA and ES. The difference between PSO and DE was statistically significant (p<.01). In addition, PSO exhibited lower capability in exploring solutions in high-dimensional search spaces than DE, GA, and ES did. A larger swarm size compensated for the weakness of PSO in global exploration, thus making itself more beneficial than a larger number of swarm search iterations.

In order to overcome the limitation of the traditional adaptive Unscented Kalman Filtering (UKF) algorithm in noise covariance estimation for statement and measurement, we propose a hybrid adaptive UKF algorithm based on combining Maximum a posteriori (MAP) criterion and Maximum likelihood (ML) criterion, in this paper. First, to prevent the actual noise covariance deviating from the true value which can lead to the state estimation error and arouse the filtering divergence, a real-time covariance matrices estimation algorithm based on hybrid MAP and ML is proposed for obtaining the statement and measurement noises covariance, respectively; and then, a balance equation the two kinds of covariance matrix is structured in this proposed to minimize the statement estimation error. Compared with the UFK based MAP and based ML, the proposed algorithm provides better convergence and stability.

Segmentation of brain tumor images is a major research topic in medical imaging to have a refined detection and understanding of abnormal masses in the brain. This paper proposes a new segmentation method, consisting of three main steps, to detect brain lesions using magnetic resonance imaging (MRI). In the first step, the parts of the image delineating the skull bone are removed to exclude insignificant data. In the second step, which is the main contribution of this study, the particle swarm optimization (PSO) technique is applied to detect the block that contains the brain lesions. The fitness function, used to determine the best block among all candidate blocks, is based on a two-way fixed-effects analysis of variance (ANOVA). In the last step of the algorithm, the K-means segmentation method is used in the lesion block to classify it as tumor or not. A thorough evaluation of the proposed algorithm is performed using the MRI database provided by the Kouba imaging center in Algiers, Algeria. Estimates of the selected fitness function are first compared to those based on the sum-of-absolute-differences (SAD) dissimilarity criterion and demonstrate the efficiency and robustness of the ANOVA. The performance of the optimized brain tumor segmentation algorithm is then compared to the results of several state-of-the-art techniques, including fuzzy C-means, K-means, Otsu thresholding, local thresholding, and watershed segmentation. The results obtained using Dice coefficient, Jaccard distance, correlation coefficient, and root mean square error (RMSE) measurements demonstrate the superiority of the proposed optimized segmentation algorithm over equivalent techniques.

Novel applications of artificial intelligence for tuning the parameters of industrial machines for optimal performance are emerging at a fast pace. Tuning the combine harvesters and improving the machine performance can dramatically minimize the wastes during harvesting, and it is also beneficial to machine maintenance. Literature includes several soft computing, machine learning and optimization methods that had been used to model the function of harvesters of various crops. Due to the complexity of the problem, machine learning methods had been recently proposed to predict the optimal performance with promising results. In this paper, through proposing a novel hybrid machine learning model based on artificial neural networks integrated with particle swarm optimization (ANN-PSO), the performance analysis of a common combine harvester is presented. The hybridization of machine learning methods with soft computing techniques has recently shown promising results to improve the performance of the combine harvesters. This research aims at improving the results further by providing more stable models with higher accuracy.

To address the problem that it is easy to form coverage blind areas when wireless sensor networks are randomly deployed, an improved coverage optimization algorithm based on improved Salpa swarm Intelligent algorithm (ATSSA) is proposed for wireless sensor networks. Firstly, the pop-ulation is initialized using tent chaotic sequence to enhance the optimization ability of the algo-rithm. Secondly, the T-distribution mutation is added to the update formula of the leaders for improving the ability to jump out of the local optimal value. Finally, an adaptive formula for updating the position of the follower is proposed, which not only guarantees the local searching ability of the algorithm in the late iteration period, but also improves the global searching ability of the algorithm in the early iteration period. The experimental results show that ATSSA algorithm can improve the coverage of the wireless sensor networks and reduce deployment costs com-pared with other algorithms, when it is used in the wireless sensor networks.

Proteomics research has become one of the most important topics in the fields of life science and natural science. At present, research on protein–protein interaction networks (PPINs) mainly focuses on detecting protein complexes or function modules. However, existing approaches are either ineffective or incomplete. In this paper, we investigate function module detection mechanisms in PPIN, including open databases, existing detection algorithms and recent solutions. After that, we describe the proposed solution based on simplified swarm optimization (SSO) algorithm and gene ontology knowledge. The proposed solution implements SSO algorithm for clustering proteins with similar function, and imports biological gene ontology knowledge for further identifying function complexes and improving detection accuracy. Furthermore, we use four different categories of species dataset for experiment: Fruitfly, Mouse, Scere, and Human. The testing and analysis result show that the proposed solution is feasible, efficient and could achieve a higher accuracy of prediction than existing approaches.

Tablets are the most used solid dosage form in medical treatments. The realistic modeling 1 of such specific object shapes in computer simulations has been demonstrated already by the author 2 for bi-convex round tablets but needs to be extended for a wider range of tablet shapes. Moreover, 3 the number of tablets must be large enough to simulate industrial drum coaters, which are typically 4 used for film coating processes. Whilst this long lasting process where tablets flow continuously, 5 tablets are loaded by frequent changes of individual contacts. Using a tailored simulation tool named 6 pharmAssist , written for GPUs (modern massively parallel processors in graphics cards and HPC 7 accelerators), we implemented the widely used oblong tablet shape. We are able to simulate flows 8 involving industrial scale number of such tablets. Data mining allows for statistical analyzis of 9 pair-wise contacts of different geometric features. Our simulation results serves as an observation 10 space, which cannot be addressed by experimental analyzis and will help to avoid degradation of 11 tablets like chipping or other defect phenomena. This paper reflects current development work in 12 order to extend the DEM with a new shape class, which comprises the modelling of compacted or 13 extruded objects, which have a smooth exterior, a flat band and sharp contour edges

In view of the problem of charging and hydrogen filling facilities construction in the transition from fuel vehicles to electric vehicles and hydrogen fuel cell vehicles, in order to meet the electric energy demand of electric vehicles and hydrogen energy demand of hydrogen fuel cell vehicles at the same time, this paper puts forward a method of siting and capacity determination of electric-hydrogen refueling integrated station (EHRIS) based on Voronoi diagram and particle swarm algorithm based on calculating the demand of charging and filling of hydrogen in vehicles. Firstly, OD pair(Origin-Destination) is used to represent the starting point and end point of the car to portray the travel demand of the car, and on the basis of the traffic network model, the shortest driving path of the new energy car is determined by Dijkstra algorithm, and Monte Carlo simulation is used to get the electric-hydrogen energy demand of the car; secondly, the Voronoi diagram is introduced to classify the service scope of the electric-hydrogen charging station to determine the equipment capacity of the electric-hydrogen charging station, while taking into account the electric-hydrogen charging and refueling capacity. Secondly, a Voronoi diagram is introduced to divide the service scope of the EHRIS, determine the capacity of the equipment in the EHRIS, and consider the distance constraints between the sites of EHRIS, so as to make the division of the site and service scope more reasonable. Finally, a dynamic optimal current model framework for distribution networks based on second-order cone relaxation is established, and each element of the active distribution network is planned, so that the distribution network can operate safely and stably after being connected to the EHRIS. With the objective of minimizing the total social cost of EHRIS and considering the constraints of the charging equipment and hydrogen production and injection equipment of the EHRIS, a siting and capacity model to meet the electric-hydrogen energy demand of electric and hydrogen fuel cell vehicles is developed, and solved by a particle swarm algorithm. Finally, the simulation planning is carried out with Sioux Falls city and IEEE33 network, which ensures the stable operation of the power grid while meeting the energy demand of automobiles, and the results verify the effectiveness and feasibility of the proposed method.

Diabetes is a serious health problem throughout the world, including in Indonesia. The International Diabetes Federation (IDF) reports that the number of adults with diabetes is increasing every year. The Behavioral Risk Factor Surveillance System (BRFSS) is a survey conducted by the Centers for Disease Control and Prevention (CDC) in the United States. Classification methods in data mining techniques are used to classify diabetics and non-diabetics. The data mining process is carried out by preprocessing, feature selection, and dataset classification stages. In the preprocessing stage, data cleaning, data formatting, and data oversampling are carried out using the Synthetic Minority Over-sampling Technique (SMOTE). Next, the feature selection stage is carried out using the Particle Swarm Optimization (PSO) algorithm to find the best attributes. The dataset classification stage is carried out using the CART Model Decision Tree algorithm. The results of the performance evaluation of the CART algorithm are calculated using the confusion matrix and the MAE value, the results obtained for the CART algorithm without SMOTE and PSO obtained the best accuracy of 75.34% and the MAE value of 0.2466, while the CART algorithm using SMOTE and PSO can increase accuracy by 10 .94% to 86.28% and an MAE value of 0.1372.

CAD-CAE software companies have introduced numerous tools aimed at facilitating topology optimization through Finite Element Simulation, thereby enhancing accessibility for designers via user-friendly interfaces. However, the imposition of intricate constraint conditions or additional restrictions during calculations may introduce instability into the resultant outcomes. In this paper, an algorithm for updating the design variables called Adaptive Variable Design is proposed to keep the final design space volume of the optimized part always under the target value while giving the main algorithm multiple chances to update the optimization parameters and search for a valid design. This algorithm aims to producing results that are more conducive to manufacturability and potentially more straightforward in interpretation. A comparison between several commercial software and the proposed algorithm, implemented in MATLAB, is carried out to prove the robustness of the latter. By simulating identical parts under similar conditions, we seek to generate comparable results and underscore the advantages stemming from the adoption and comprehension of the proposed topology optimization methodology. Our findings reveal that the integrated enhancements within MATLAB pertaining to the topology optimization process yield favourable outcomes with respect to discretization, and the manufacturability of resultant geometries. Furthermore, we assert that the methodology evaluated within MATLAB holds promise for potential integration into commercial packages, thereby enhancing the efficiency of topology optimization processes.

This paper presents a discrete particle swarm optimization (DPSO) algorithm with heterogeneous (non-uniform) parameter values for solving the dynamic travelling salesman problem (DTSP). The DTSP can be modelled as a sequence of static sub-problems, each of which is an instance of the TSP. We present a method for automatically setting the values of the DPSO parameters without three parameters, which can be defined based on the size of the problem, the size of the particle swarm, the number of iterations, and the particle neighbourhood size. We show that the diversity of parameter values has a positive effect on the quality of the generated results. We compare the performance of the proposed heterogeneous DPSO with two ant colony optimization (ACO) algorithms. The proposed algorithm outperforms the base DPSO and is competitive with the ACO.

Some optimal control problems need metaheuristics in searching for the optimal solution, especially when the process has certain characteristics like the Photobioreactor for Algae Growth (distributed parameter, nonlinearities, etc.). Particle Swarm Optimization (PSO) algorithms within control structures are a realistic approach; their task is often to predict the optimal control values working with a process model (PM). Owing to numerous numerical integrations, there is a big computational effort that is reflected in a large controller execution time. The authors propose to replace the PSO predictor with a machine learning model that has “learned” the quasi-optimal behavior of the couple (PSO, PM); the training data is obtained through closed-loop simulations over the control horizon. The new controller should preserve the process’s quasi-optimal control. In identical conditions, the process evolutions must also be quasi-optimal. The multiple Linear Regression and the Regression Neural Networks were considered as predicting models. The paper first proposes algorithms for collecting and aggregating data sets for the learning process. Algorithms for constructing the machine learning models, implementing the controllers, and closed-loop simulations are also proposed. The simulations prove that the two machine learning predictors have learned the PSO predictor’s behavior such that the process evolves almost identically. The resulting controllers’ execution time drastically decreased while keeping their optimality.

In wireless sensor networks (WSNs), each sensor node can estimate the global parameter from the local data in distributed manner. This paper proposed a robust diffusion estimation algorithm based on minimum error entropy criterion with self-adjusting step-size, which are referred to as diffusion MEE-SAS (DMEE-SAS) algorithm. The DMEE-SAS algorithm has fast speed of convergence and is robust against non-Gaussian noise in the measurements. The detailed performance analysis of the DMEE-SAS algorithm is performed. By combining the DMEE-SAS with diffusion minimum error entropy (DMEE) algorithms, an Improving DMEE-SAS algorithm is proposed, in non-stationary environment where tracking is very important. The Improving DMEE-SAS algorithm can avoid insensitivity of the DMEE-SAS algorithm due to the small effective step-size near the optimal estimator, and obtain a fast convergence speed. Numerical simulations are given to verify the effectiveness and advantages of these proposed algorithms.

Prior studies have focused on the overall behavior of randomly moving particle swarms. However, the characteristics of ubiquitous special particle swarms that form in these swarms remain unknown. This study demonstrates a generalized diffusion equation for randomly moving particles that considers the velocity and location aggregation effects in a special circumstance (that is, in a moving reference frame R_u relative to a stationary reference frame R₀). This equation can be approximated as the Schrodinger equation in the microcosmic case and describes the kinetics of the total mass distribution in the macrocosmic case. The predicted density distribution of the particle swarm in the stable aggregation state is consistent with the total mass distribution of massive, relaxed galaxy clusters (at least in the range of r < r_s), preventing cuspy problems in the empirical Navarro-Frenk-White (NFW) profile. This article is helpful for inspiring people to think about the essence of universal gravitation.

Since the outbreak of the COVID-19 pandemic, patients infected with COVID-19 may experience abnormal heart rates, posing potential health risks. This study proposes a non-contact method for measuring heart rate (HR) and heart rate variability (HRV) to effectively reduce the risk of infection and assist healthcare professionals in more accurate diagnosis and treatment. In this study, except for the different image acquisition method, other research processes and methods are similar to the research methods in [15]. The image acquisition method is changed from forehead image to palm image. The new non-contact measurement performance of the proposed method can effectively not only avoid infection concerns but also obtain heart rate and HRV quickly and conveniently, providing higher accuracy for physiological parameters, root mean square error (RMSE), and mean absolute percentage error (MAPE) compared to those in recently published papers.

Magnetorheological elastomers (MREs) are a type of smart material that can change their mechanical properties in response to external magnetic fields. These unique properties make them ideal for various applications, including vibration control, noise reduction, and shock absorption. This paper presents an approach for modeling the impact behavior of MREs. The proposed model uses a combination of exponential functions arranged in a multi-layer Preisach model to capture the nonlinear behavior of MREs under impact loads. The model is trained using particle swarm optimization (PSO) and validated using experimental data from drop impact tests conducted on MRE samples under various magnetic field strengths. The results demonstrate that the proposed model can accurately predict the impact behavior of MREs, making it a useful tool for designing MRE-based devices that require precise control of their impact response. The model's response closely matches the experimental data, with a maximum prediction error of 10% or less. Furthermore, the interpolated model's response shows good agreement with the experimental data, with a maximum percentage error of less than 8.5%.

Recently, the medical image processing is extensively used in several areas. In earlier detection and treatment of these diseases is very helpful to find out the abnormality issues in that image. Here there are number of methods available for segmentation to detect the lung nodule of computer tomography (CT) image. The main result of this paper, the earlier detection of lung nodules using Pre-processing techniques of top-hat transform, median and adaptive bilateral filter was compared both filtering methods and proved the adaptive bilateral filter is suitable method for CT images. The proposed segmentation technique uses novel strip method and the image is split into number of strips 3, 4, 5 and 6. A marker- watershed method based on PSO and Fuzzy C-mean Clustering method was proposed method. Firstly, the input image was reduced noise reduction and smoothing and the filter image is using strips method and then the image is segmented by marker watershed method. Secondly, the enhanced PSO technique was used to locate the better accurate value of the clustering centers of Fuzzy C-mean Clustering. Final stage, with the accurate value of centers and the enhanced target function and the small region of the segmented object was clustered by Fuzzy C-mean. In segmentation algorithm presented in this paper gives 95% of accuracy rate to detect lung nodules when strip count is 5.

Wireless sensor networks are attractive largely because they need no wired infrastructure. But precisely this feature makes them energy constrained. Recent studies find that sensing behaviors that are otherwise deemed efficient consume comparable energy with communication. The duty cycle scheduling is perceived as contributing to achieving energy efficiency of sensing. Because of different research assumptions and objectives, various scheduling schemes have various emphases. This paper designed an adaptive sensing scheduling strategy. The objective function of the scheduling strategy includes minimizing average energy expenditure and maximizing sensing coverage (reducing event miss-rate), and it requires relatively loose assumptions. We determine the functional relationship between the variables of the objective function and the step-size parameters of the proposed strategy through the numerical fitting. We found that the objective function aggregated by the fitting functions is a bivariate multi-peak function that favors the Fibonacci tree optimization algorithm. Once the optimization of parameters is done, the strategy can be easily deployed and behaves consistently in the coming hours. We name the proposed strategy as “FTOS”. The experimental results show that the Fibonacci tree optimization algorithm gets a better optimistic effect than the comprehensive learning particle swarm optimization (CLPSO) algorithm and differential evolution (DE) algorithm. The FTOS strategy is superior to the fixed time scheduling strategy in achieving the scheduling objectives. It also outperforms other strategies with the same scheduling objectives such as LDAS, BS, DSS and PECAS.

For many engineering applications it is sufficient to use the concept of simple materials. However, higher gradients of the kinematic variables are taken into account to model materials with internal length scales as well as to describe localization effects using gradient theories in finite plasticity or fluid mechanics. In many approaches length scale parameter have been introduced that are related to a specific micro structure. An alternative approach is possible, if a thermodynamically consistent framework is used for material modelling as shown in the present contribution. However, even if sophisticated and thermodynamically consistent material models can be established there are still not yet standard experiments to determine higher order material constants. In order to contribute to this ongoing discussion system identification based on the method of self-adaptive filtering is proposed in this paper. To evaluate the effectiveness of this approach it has been applied to second-order gradient materials considering longitudinal vibrations. Based on thermodynamically consistent models that have been solved numerically it has been possible to prove that system identification based on self-adaptive filtering can be used effectively for both narrow-band and broadband signals in the field of second-order gradient materials. It has also been found that the differences identified for simple materials and gradient materials allow for condition monitoring and detection of gradient effects in the material behavior.

In this research, the concept of the instability of tension in Microgrid still becomes the focus of study and purpose. Scrutinously, First-Swing Instability occurs in the system in noted changes with properties of making the system unstable or restore to a state of stability. The latter calls itself as a phenomenon of re-synchronization. Allied to aspects of system instability, it is evident that by connecting fast electric chargers for battery-electric vehicles to the distribution system from microgrids, they increase the necessary basic electrical charges and reduce the stability of the electrical energy system. Transient electrical currents have the characteristic of severely impacting microgrids not prepared in connected states or island of the main system. The occurrences of the electromagnetic incompatibility of the inrush current, due to their unpredictability and intermittent characteristic, have complex identification studies. With the elevation of electricity demand by battery-electric vehicle chargers, concerns about the effects of the integration of the electricity grid increase proportionally. The research described in this article emphasizes the influence of fast chargers’ initialization on the power variation related to the re-synchronization phenomenon and its mitigation of the stability of electricity microgrid. An optimization algorithm based on particle swarm optimization (PSO) implements the development of virtual impedances. The PSO optimization algorithm analyzes all possible operating points and aims to maximize the stability index of microgrid, maintaining reactive energy incompatibilities at the minimum level supported. The fractional objective function facilitates the service to these goals simultaneously. The optimization algorithm is implemented in a case study and the corresponding virtual impedance is incorporated into the microgrid. Voltage levels are verified as a condition in the optimization process, comparing system effectiveness.

Although energy management of a microgrid is generally performed using a day-ahead scheduling method, its effectiveness has been questioned by the research community due to the existence of high uncertainty in renewable power generation, power demand and electricity market. As a result, real-time energy management schemes are recently developed to minimise the operating cost of a microgrid while high uncertainty presents in the network. This paper develops modified particle swarm optimisation (MPSO) algorithms to solve optimisation problems of energy management schemes for a community microgrid and proposes a scheduling approach after taking into consideration high uncertainty to effectively minimise the operational cost of the microgrid. The optimisation problems are formulated for real-time and scheduling approaches, and solution methods are developed to solve the problems. It is observed that the scheduling program demonstrates superior performance in all the cases, including uncertainty in prediction, as compared to the other energy management approaches, although solutions have significant deviations due to prediction errors.

The heterogeneous structure implies that a few nodes may be crucial in maintaining network structural and functional properties. Identifying these crucial nodes correctly and quickly is a primary issue as contemporarily may face the mushrooming of large-scale datasets. Besides, the ‘weight issue’ is always ignored in this field which edge weight may play a positive/negative role in contributing to the node importance in different weighted networks. This paper provides a novel algorithm, Weighted Expectation Algorithm (WEA), which aims to ensure accuracy and speed of computation by taking advantage of dynamic programming to better handle the task of large-scale networks. Additionally, the weight issue that edge weights may contribute differently is addressed by a simply quantitative definition. Two standard experiments show WEA can maintain the network structure in connectivity well (by the lowest average robustness 0.192) and identify the node importance better in the spreading function test of spreading dynamics (by the highest average Kendall’s tau-b 0.678). In addition, the time complexities of different algo-rithms are evaluated, and their time-consuming are tested, proving that WEA consumes a rela-tively short time.

Accurate forecasting of icing thickness has a great significance for ensuring the security and stability of power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on fireworks algorithm and weighted least square support vector machine (W-LSSVM). The method of fireworks algorithm is employed to select the proper input features with the purpose of eliminating the redundant influence. In addition, the aim of W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through the simulation experiments using real-world icing data from monitoring center of key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

This article introduces a novel nature-inspired metaheuristic algorithm called Frilled Lizard Optimization (FLO), which emulates the hunting behavior of frilled lizards in their natural habitat. FLO draws in-spiration from the sit-and-wait strategy observed in frilled lizards during hunting. The underlying theory of FLO is presented and mathematically formulated in two phases: (i) an exploration phase, simulating the frilled lizard's attack towards prey, and (ii) an exploitation phase, simulating the lizard's retreat to the top of the tree after feeding. To assess FLO's efficacy in solving optimization problems, the algorithm's performance is evaluated across fifty-two standard benchmark functions, encompassing unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. Comparative analyses with twelve existing metaheuristic algorithms are conducted. The simulation results reveal that FLO, distinguished by its adeptness in exploration, exploitation, and balancing them during search process, outperforms competing algorithms. Additionally, FLO is implemented on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems, demonstrating its effectiveness in addressing real-world optimization applications.

Improper design of friction pendulum bearings can lead to poor seismic reduction performance and may result in the failure of local vulnerable components. And the parameter design of friction pendulum bearings mainly relies on experience and verification calculations at present. This paper proposes an adaptive genetic algorithm considering the overall evolution state of the population, adjusting crossover and mutation probabilities adaptively based on individual fitness and population diversity. Compared to traditional algorithms, it exhibits better global search capabilities and convergence efficiency. Combining the improved genetic algorithm with finite element models, a parameter optimization method is proposed. The parameters of friction pendulum bearings are optimized, providing reference for the design of seismic isolation devices.

Classroom resource allocation is a challenging problem in educational institutions. The use of cloud computing can aid in the optimization of this process by allowing resource providers to allocate resources to users in a timely and efficient manner. In this paper, we propose a modified Salp Swarm Algorithm (SSA) to optimize the allocation of classroom resources. The proposed approach involves generating a population of salps representing potential solutions to the resource allocation problem and updating the positions of the salps iteratively based on a fitness function and mathematical equations. We conducted simulations of the proposed algorithm on various numbers of tasks and sources to evaluate its performance. The results indicate that the modified SSA algorithm can efficiently allocate classroom resources, achieving lower completion time of tasks (makespan) with lower costs. This paper contributes to the literature by introducing an effective approach to solve the classroom resource allocation problem.

Nature-inspired algorithms are very popular tools for solving optimization problems inspired by nature. However, there is no guarantee that optimal solution can be obtained using a randomly selected algorithm. As such, the problem can be addressed using trial and error via the use of different optimization algorithms. Therefore, the proposed study in this paper analyzes the time-complexity and efficacy of some nature-inspired algorithms which includes Artificial Bee Colony, Bat Algorithm and Particle Swarm Optimization. For each algorithm used, experiments were conducted several times with iterations and comparative analysis was made. The result obtained shows that Artificial Bee Colony outperformed other algorithms in terms of the quality of the solution, Particle Swarm Optimization is time efficient while Artificial Bee Colony yield a worst case scenario in terms of time complexity.

Nature-inspired algorithms are very popular tools for solving optimization problems inspired by nature. However, there is no guarantee that optimal solution can be obtained using a randomly selected algorithm. As such, the problem can be addressed using trial and error via the use of different optimization algorithms. Therefore, the proposed study in this paper analyzes the time-complexity and efficacy of some nature-inspired algorithms which includes Artificial Bee Colony, Bat Algorithm and Particle Swarm Optimization. For each algorithm used, experiments were conducted several times with iterations and comparative analysis was made. The result obtained shows that Artificial Bee Colony outperformed other algorithms in terms of the quality of the solution, Particle Swarm Optimization is time efficient while Artificial Bee Colony yield a worst case scenario in terms of time complexity.

Gaze tracking of high-speed moving targets is a novel application mode for low Earth orbit microsatellites. In this mode, small satellites are equipped with high-resolution narrow-field-of-view video cameras for stable gaze-tracking imaging of high-speed moving targets. This paper proposes a high-precision attitude adaptive integral sliding mode control method with a feedforward compensation disturbance observer to enhance the capability of a microsatellite attitude control system for gaze tracking of high-speed moving targets. Specifically, first, we present the attitude control system model for microsatellites and the calculation method for the desired attitude of target tracking based on image feedback. Then, an adaptive integral sliding mode attitude control algorithm with a feedforward compensation disturbance observer, which meets the requirements of high-precision tracking control, is designed. The developed algorithm utilizes the disturbance observer to observe the friction torque of the flywheel and compensates for it through feedforward control. It also employs the adaptive integral sliding mode control algorithm to reduce the impact of uncertain disturbances, decrease the steady-state error of the system, and enhance the attitude control precision. Simulation experiments demonstrated that the designed disturbance observer can successfully observe the frictional disturbance torque of the flywheel. The attitude Euler angle control precision for high-speed moving target tracking reached 0.009°, and the angular velocity control precision reached 0.005°/s, validating the effectiveness of the proposed approach.

Background and Objectives: The existing recommendations for female pelvic magnetic susceptibility weighted imaging MRI (FP-SWI) have not been optimized to capture the disease characteristics of the female pelvis. Therefore, it is imperative to explore acquisition parameters before conducting larger-scale studies. To establish optimized flip angle (FA) for acquiring FP-SWI to improve the image quality of female pelvic lesion sites. Materials and Methods: To evaluate signal quality and lesion conspicuity, regions of interest (ROIs) were manually drawn within the lesion on SWI sequences. Signal intensity was measured within the ROIs. Additionally, signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR) were calculated for SWI sequences acquired at three FA: 10°, 15°, and 20°. Finally, a qualitative assessment of anatomical detail visualization, geometric distortion extent, artifacts, and lesion clarity was performed using a four-point scale. The Wilcoxon rank sum test was employed to compare the qualitative evaluation parameters. The intra-class correlation coefficient (ICC) was calculated to determine the consistency of subjective ratings between two observers. Results: FA=10° showed significantly higher SNR than FA=15° and 20° in most anatomical regions (P&lt;0.05), while the CNR was significantly higher than FA=15° and 20° (P&lt;0.05). Compared with FA=15° and 20°, the image quality of FA=10° was significantly higher, with less distortion and ghosting, and better image contrast (P&lt;0.05). Lesions with FA=10° exhibited higher clarity compared to FA=15° and 20° (P&lt;0.05). Conclusions: The image quality of FP-SWI images at FA=10° exceeds that at FA=15° and 20°. We recommend that when conducting SWI examination of the female pelvic cavity, the FA value should be set at 10° to stabilize the SWI sequence and improve image quality.

One of the most important applications in the wireless sensor networks (WSN) is to classify mobile targets in the monitoring area. In this paper, a multi-DBN weighted voting classification algorithm is proposed on the basis of the Deep Belief Network (DBN) classifier and combined with the idea of voting method, which is implemented on the nodes of the WSN monitoring system by means of "upper training, lower transplantation" appraoch. The performance of the algorithm is verified by using real-world experimental data, and the results show that the proposed method has a higher accuracy in classifying the target signal features, achieving an average classification accuracy of 84.63% across four different types of moving targets. The experiment reveals that the multi-DBN weighted voting algorithm enhances the target classification accuracy by approximately 5% in comparison to the single DBN classifier, but the memory and computation time required for the algorithm to run are also increased at the same time. Compared to the FFNN classifier, which exhibited the highest classification accuracy among the four selected methods, the algorithm achieves an improvement of approximately 8.8% in classification accuracy. However, it incurs greater time overhead to run.

Biological systems often need to operate in complex environments where conditions can rapidly change. This is possible due to their inherent ability to sense changes and adapt their behavior in response. Here, we detail recent advances in the creation of synthetic genetic parts and circuits whose behaviors can be dynamically tuned through a variety of intra- and extra-cellular signals. We show how this capability lays the foundation for implementing control engineering schemes in living cells and allows for the creation of biological systems that are able to self-adapt, ensuring their functionality is maintained in the face of varying environmental and physiological conditions. We end by discussing some of the broader implications of this technology for the safe deployment of synthetic biology.

Amid the swift progression of the global automobile industry, the aspiration for lightweight vehicle design has surfaced as a crucial approach to boost fuel efficiency and curtail environmental impact. The objective of this study revolves around achieving holistic optimization of vehicle structure via detailed scrutiny of vehicle process characteristics, amalgamated with a Back Propagation neural network (BPNN) optimized by a genetic algorithm (GA) and a topology optimization (TO) method.The process initiates with an examination of the vehicle's technical characteristics, succeeded by an optimization protocol that couples GA with BPNN. This exhaustive optimization procedure derives the best-fit values of design parameters and identifies the globally optimal lightweight design approach. Subsequently, a comprehensive structural optimization is actualized by modifying the topological distribution of the structure.A simulation experiment of the conceptual car body beam skeleton is conducted as a conclusive step, and the anti-collision capacity of the car body beam skeleton is assessed by measuring deformation intrusion. The findings reveal that in the vehicle topology optimization, a comparative analysis of pre and post-optimization results indicates an improved topological density across diverse sections. The topological density of the vehicle's frontal structure escalates from 0.75 to 0.8. Following optimization, the stiffness assessment records a marginal increase (within the range of 0.02–0.05), implying that the lightweight design does not compromise the general rigidity of the structure.The optimized body structure manifests superior crashworthiness in the crash test: the deformation intrusion diminishes by 27% in front-end collisions. In side impacts, the deformation and intrusion at critical points are reduced by 13.15% to 10% respectively. The comprehensive method proposed herein proves to be an efficient strategy to actualize the lightweight design of vehicles.

The multiobjective optimization problem is a key research direction in the field of optimization. Based on the multivariant optimization algorithm (MOA), this paper puts forward a multiobjective multivariant optimization algorithm (MMOA). A good point set is adopted for population initialization and to ensure the homogeneity of the initial solution set and avoid prematurity; global atoms are acquired by non-dominated sorting and an external archiving strategy; a nonlinear search radius is designed to balance global and local searches and enhance the convergence precision of the algorithm. Levy Flight and Sine chaotic mapping are introduced to redesign the update formula for local atoms, increase the convergence rate of the algorithm, and boost the optimization efficiency. Comparative experiments are conducted between MMOA and NSGA-II, MOEA/D, NSWOA, MOGWO, NSMFO on multiobjective test functions and an engineering example. The simulation results show that MMOA has superior convergence and diversity to the other five algorithms.

This paper uncovers that quantum uncertain principle makes the single particle with global property have no certain path, and then wave of quantum particle can simultaneously do pass the double slits. The two subwaves after passing Young’s double slits are entanglement, they may form interference of subwaves. Consequently, we find a kind of quantum probabilistic entanglements with Wheeler's delayed choice. Quantum particles such as photons, electrons, neutrons, protons etc mean that wave of the quantum particle can simultaneously do pass through Young's double slits, rather than individual quantum particle may pass through Young's double slits at the same time. When considering wave property, we cannot consider particle property (Just as in the photoelectric effect, considering the particle nature of the system, people cannot consider wave property, otherwise the photoelectric effect cannot appear). Therefore, this paper discovers that the ability of single photon to hit electrons out in photoelectric effect is complementarily equivalent to the ability of wave of the single photon to simultaneously pass through Young's double slits in wave-particle duality. Objective criteria for distinguishing classical and quantum particles are discovered and objectively give the applicable realm of quantum mechanics for the first time. The crisis of the single particle’s simultaneously passing through Young's double slits, which has been plaguing physicists in the whole world up to now for decades, is solved, in which the studies are classified as classical and quantum particles, the classical particle and quantum particle wave cannot and can pass the Young’s slits, respectively. This paper discovers both the new physics mechanism of passing the double slits of the wave with the amplitude of 4-dimensional momentum representation wave function reflecting particle nature and the principle of self-adaptive emergence of wave-particle duality, and then using the principle, this paper gives both direct explanations to the current experiments and new predictions of new some experiments for wave-particle duality. All the deduced results here are consistent with all relevant physics experiments.

Although the behavioral mechanism studying is a difficult and complex task, it can produce an important systems optimization impact. In this work, we use, in this paper, inference system approach to represent reasoning mechanism and the operations of dynamic systems to extract mental representations from traveling salesman and convert them into cognitive structures. For this we develop an extraction automatic method to create knowledge bases and, later, data are stocked into structure based on transition maps and the performances of these created maps get improved through combining the reinforcement learning thus augment traveller's deciding capacity from historical data. These transition maps help to find best actions for obtaining useful new policies. Generated intermediate transition maps are gathered to give a global map called main map whose advantage is to improve the learning process. The main idea of this approach is to improve learning capability by using a reinforcement learning technique as exploration and exploitation strategy of the metaheuristique GRASP method and the use of the fuzze logical rules mechanism allowing concepts model to have more variability of states. The results obtained after simulation as presented in this paper are very encouraging.

Multiple sclerosis is a chronic, autoimmune disease that mainly affects the central nervous system, including the brain, spinal cord, and optic nerve. This disease can cause clinical symptoms such as cognitive decline, muscle weakness, spasms, and fatigue in patients, and the onset tends to be younger. Current medication can only prevent or alleviate symptoms, so early diagnosis of this disease can increase patients' chances of treatment. Although the use of nuclear magnetic resonance detection can improve the efficiency of early auxiliary diagnosis, it still requires experienced doctors to spend too much time and energy on comprehensive judgment. To reduce the time cost and improve the efficiency of multiple sclerosis diagnosis, this article proposes a detection and recognition algorithm for multiple sclerosis based on wavelet entropy and self-adaptive particle swarm optimization. Firstly, a triple discrete wavelet transform is performed on the brain image of multiple sclerosis, and then 10 wavelet entropies are extracted from the decomposed wavelet subbands, which can reduce the feature dimensions of the image; Then, the algorithm of self-adaptive particle swarm optimization is used to optimize the feedforward neural network, in order to obtain the optimal connection weights and thresholds during the training process. The result of the model is with an average sensitivity of 92.29±1.89, specificity of 92.54±0.67, precision of 92.48±0.59, accuracy of 92.42±0.88, and F1 score of 84.85±1.74, Matthews correlation coefficient of 92.37±0.96, and Fowlkes223 Mallows Index of 92.38±0.96. The experimental results indicate that this algorithm has a very important data support role in detecting multiple sclerosis.

This study presents an in-depth analysis and evaluation of self-healing networks as an innovative solution to combat the escalating threat of ransomware attacks. Recognizing the limitations of traditional network security methods in the face of advanced cyber threats, the research focuses on the development and implementation of self-healing networks, characterized by their dynamic, intelligent response systems. Utilizing a combination of artificial intelligence and machine learning algorithms, these networks demonstrate remarkable adaptability and resilience. Through rigorous simulations, the study examines the efficacy of self-healing networks in detecting, isolating, and recovering from ransomware attacks, with an emphasis on their ability to learn and evolve from each incident. The research highlights the strengths and limitations of these networks and discusses their potential applications in various sectors. The findings suggest that self-healing networks, with their proactive and adaptive defense mechanisms, represent a significant advancement in cybersecurity strategies, offering a robust solution against a range of cyber threats. Future work is recommended to further enhance the capabilities of self-healing networks, particularly in the areas of speed, detection accuracy, and quantum-resistant security measures.

This work aims to develop an integrated fault location and restoration approach for microgrids (MGs). This work contains two parts. Part I presents the fault location algorithm, and Part II shows the restoration algorithm. The proposed algorithms are implemented by particle swarm optimization (PSO). The fault location algorithm is based on network connection matrices, which are the modifications of bus-injection to branch-current and branch-current to bus-voltage (BCBV) matrices, to form the new system topology. The backward/forward sweep approach is used for the prefault power flow analysis. After the occurrence of fault, the voltage variation at each bus is calculated by using the Zbus modification algorithm to modify Zbus. Subsequently, the voltage error matrix is computed to search for the fault section by using PSO. After the allocation of the fault section, the multi-objective function is implemented by PSO for optimal restoration with its constraints. Finally, the IEEE 37-bus test system connected to distributed generations is utilized as the sample system for a series simulation and analysis. The outcomes demonstrated that the proposed optimal algorithm can effectively solve the fault location and restoration problem in MGs.

The weight coefficients of the diaphragm spring depend on experiences in the traditional optimization. However, this method not only cannot guarantee the optimal solution but it is also not universal. Therefore, a new optimization target function is proposed. The new function takes the minimum of average compress force changing of the spring and the minimum force of the separation as total objectives. Based on the optimization function, the result of the clutch diaphragm spring in a car is analyzed by the non-dominated sorting genetic algorithm (NSGA-II) and the solution set of Pareto is obtained. The results show that the pressing force of the diaphragm spring is improved by 4.09%by the new algorithmand the steering separation force is improved by 6.55%, which has better stability and steering portability. The problem of the weight coefficient in the traditional empirical design is solved. The pressing force of the optimized diaphragm spring varied slightly during the abrasion range of the friction film, and the manipulation became remarkably light.

Drying food involves complex physical atmospheric mechanisms with non-linear relations from the air-food interactions and those relations are strongly dependent on the moisture contents and the type of food. Such dependence makes it complex to design suitable dryers dedicated to a single drying process. To streamline the design of a novel compact food-drying machine, a heat pump dryer component design optimization algorithm was developed as a subprogram of a Computer Aided Engineering tool. The algorithm requires inputting food and air properties, the volume of the drying container and the technical specifications of the heat-pump off-the shelf components. The heat required to dehumidify the food supplied by the heat exchange process from condenser to evaporator, and the compressor’s requirements (refrigerant mass flow rate and operating pressures) are then calculated. Compressors can then be selected based in the volume and type of food to be dried. The algorithm is shown via a flow chart to guide the user through 3 different stages: Changes in drying air properties, Heat flow within dryer and Product moisture content. Example results of how different compressors are selected for different type of produces and quantities (Agaricus Blazei mushroom with 3 different moisture contents or fish from Thunnini tribe) conclude this article.

In this study, we introduce and advanced multi-feature selection technique for bacterial classifi-cation employing the Salp Swarm Algorithm (SSA). We enhance SSA’s effectiveness by incorpo-rating the Opposition-Based Learning (OBL) strategy and the Local Search (LSA) algorithm. The proposed technique encompasses three key stages, streamlining the automated categorization of bacteria based on their distinctive features. The research adopts a multi-feature selection approach bolstered by an enhanced iteration of the Salp Swarm Algorithm (SSA). Enhancements include the utilization of Opposition-Based-Learning (OBL) to increase population diversity during search and Local Search Algorithms (LSA) to tackle local optimization challenges. The ISSA algorithm is designed to optimize the multi-feature selection by increasing the number of selected feature and improving classification accuracy. This study compares its performance with several other algo-rithms across ten distinct test datasets. The comparison results show that ISSA has better perfor-mance in terms of classification accuracy on 3 datasets consisting of 19 features, with a value reaching 73.75%. Additionally, ISSA excels in determining the optimal feature count and producing a better-fit value with a classification error rate of 0,249. Thus, the ISSA technique is expected to make a significant contribution to solving feature selection problems in bacterial analysis

Cyber Physical Systems (CPS) has been a popular research area in the last decade. The dependability of CPS is still a critical issue, and rare survey has been published in this domain. CPS is a dynamic complex system, which involves various multidisciplinary technologies. To avoid human error and to simplify management, self-management CPS (SCPS) is a wise choice. And to achieve dependable self-management, systematic solution is necessary to verify the design and to guarantee the safety of self-adaptation decision, as well as to maintain the health of SCPS. This survey first recalls the concepts of dependability, and proposes a generic environment-in-loop processing flow of self-management CPS, and then analyzes the error sources and challenges of self-management through the formal feedback flow. Focus on reducing the complexity, we first survey the self-adaptive architecture approaches and applied dependability means; then we introduce a hybrid multi-role self-adaptive architecture, and discuss the supporting technologies for dependable self-management at the architecture level. Focus on dependable environment-centered adaption, we investigate the verification and validation (V&V) methods for making safe self-adaptation decision and the solutions for processing decision dependably. For system-centered adaption, the comprehensive self-healing methods are summarized. Finally, we analyze the missing pieces of the technology puzzle and the future directions. In this survey, the technical trends for dependable CPS design and maintenance are discussed, an all-in-one solution is proposed to integrate these technologies and build a dependable organic SCPS. To the best of our knowledge, this is the first comprehensive survey on dependable SCPS building and evaluation.

Machine learning (ML) is growing in popularity for various particle accelerator applications including anomaly detection such as faulty beam position monitor or RF fault identification, for non-invasive diagnostics, and for creating surrogate models. ML methods such as neural networks (NN) are useful because they can learn input-output relationships in large complex systems based on large data sets. Once they are trained, methods such as NNs give instant predictions of complex phenomenon, which makes their use as surrogate models especially appealing for speeding up large parameter space searches which otherwise require computationally expensive simulations. However, quickly time varying systems are challenging for ML-based approaches because the actual system dynamics quickly drifts away from the description provided by any fixed data set, degrading the predictive power of any ML method, and limits their applicability for real time feedback control of quickly time-varying accelerator components and beams. In contrast to ML methods, adaptive model-independent feedback algorithms are by design robust to un-modeled changes and disturbances in dynamic systems, but are usually local in nature and susceptible to local extrema. In this work, we propose that the combination of adaptive feedback and machine learning, adaptive machine learning (AML), is a way to combine the global feature learning power of ML methods such as deep neural networks with the robustness of model-independent control. We present an overview of several ML and adaptive control methods, their strengths and limitations, and an overview of AML approaches. A simple code for the adaptive control algorithm used here can be downloaded from: https://github.com/alexscheinker/ES_adaptive_optimization

High-penetration of Distributed Energy Resources (DER) in low voltage distribution grids, mainly photovoltaics (PV), might lead to overvoltage in the point of common coupling. Volt-VAr is one of the common control functions for DER power converters used to enhance the stability and the reliability of the voltage in the distribution system and, thus, fulfilling the network operator requirements. In this study, a centralized algorithm will provide local Volt-VAr control parameters to each PV inverter, based on the electrical grid characteristics where each equipment is installed. Since accurate information of grid characteristics is typically not available, the parametrization of the electrical grid is done using power meter data in DER location and a voltage sensitivity matrix. The algorithm has different optimization modes to both minimize voltage deviation and line current. In order to validate the effectiveness of the algorithm and its deployment in real infrastructure, it has been tested in an experimental setup with PV emulators in a set of 5-day tests. Volt-VAr control algorithm successfully adapted its parameters based on grid topology and PV inverter characteristics, achieving a voltage reduction up to 25% of the allowed voltage deviation.

An adaptive spatial clustering (ASC) algorithm is proposed in this present study, which employs sweep-circle techniques and a dynamic threshold setting based on the Gestalt theory to detect spatial clusters. The proposed algorithm can automatically discover clusters in one pass, rather than through the modification of the initial model (for example, a minimal spanning tree, Delaunay triangulation or Voronoi diagram). It can quickly identify arbitrarily-shaped clusters while adapting efficiently to non-homogeneous density characteristics of spatial data, without the need of prior knowledge or parameters. The proposed algorithm is also ideal for use in data streaming technology with dynamic characteristics flowing in the form of spatial clustering in large data sets.

A novel metaheuristic optimization method is proposed based on an earthquake that is a geology phenomenon. The novel Earthquake Algorithm (EA) proposed, adapts the principle of propagation of geology waves P and S through the earth material composed by random density to ensure the dynamic balance between exploration and exploitation, in order to reach the best solution to optimization complex problems by searching for the optimum into the search space. The performance and validation of the EA are compared against the Bat Algorithm (BA) and the Particle Swarm Optimization (PSO) by using 10 diverse benchmark functions. In addition, an experimental engineering application is implemented to evaluate the proposed algorithm. Early results show a feasibility of the proposed method with a clearly constancy and stability. It is important highlight the fact that the main purpose of this paper is to present a new line of research, which is opened from the novel EA.

To date, several independent methods and algorithms exist exploiting constraint-based stoichiometric models to find metabolic engineering strategies that optimize microbial production performance. Optimization procedures based on metaheuristics facilitate a straightforward adaption and expansion of engineering objectives as well as fitness functions, while being particularly suited for solving problems of high complexity. With the increasing interest in multi-scale models and a need for solving advanced engineering problems, we strive to advance genetic algorithms, which stand out due to their intuitive optimization principles and proven usefulness in this field of research. A drawback of genetic algorithms is that premature convergence to sub-optimal solutions easily occurs if the optimization parameters are not adapted to the specific problem. Here, we conducted comprehensive parameter sensitivity analyses to study their impact on finding optimal strain designs. We further demonstrate the capability of genetic algorithms to simultaneously handle (i) multiple, non-linear engineering objectives, (ii) the identification of gene target-sets according to logical gene-protein-reaction associations, (iii) minimization of the number of network perturbations, and (iv) the insertion of non-native reactions, while employing genome-scale metabolic models. This framework adds a level of sophistication in terms of strain design robustness, which is exemplarily tested on succinate overproduction in Escherichia coli.

This study aimed to learn disturbance information to effectively control multiple small unmanned surface vehicles (USVs) for marine research purposes at sea. The learned disturbance information was used to investigate the control of multiple USV swarms based on the leading–following formation technique. Numerous studies have already been conducted on swarm control using drones in the air; however, there has been a paucity of studies on swarm control in the sea. Contrary to swarm control in aviation, the fluid density of the sea is high, and the environment is constantly changing; thus, a robot system would be significantly affected by disturbances. This ultimately influences the maintenance of swarm formations and the accomplishment of missions [1,2]. Therefore, it is difficult to control numerous moving objects while maintaining a formation at sea by using the existing aerial drone swarm control technology. To solve this problem, we learned a long short-term memory (LSTM) model with time-series marine environmental data to predict maritime disturbances. Thereafter, the model was applied to a mission-based position control algorithm of each USV constituting the swarm to design a marine unmanned floating vessel swarm control system that can be applied to various marine environments. Specifically, to effectively control numerous small USVs for marine research purposes, ocean currents are learned using the LSTM algorithm, and the predicted ocean currents are used to generate a swarm USV control system for USV formations. In this study, a control system model of several small USVs equipped with two rear thrusters and a front lateral thruster was designed. The LSTM algorithm was learned using the previous ocean current data, and the velocity of the following ocean currents was predicted. The predictions were then used as a system disturbance to determine the thrust of the controller. To measure ocean currents in the sea when each USV moves, the velocity, azimuth, and position (latitude, longitude) data from the GPS mounted on the USV were used to measure the velocity and direction of the hull's movement. Further, the flow rate was measured using a flow rate sensor on a small USV. The USV movement and position were controlled using an artificial neural network-PID (ANN-PID) controller. This study entailed a comparative analysis of the designed USV model results and those generated by the simulator, including the behavior control rule of the USV swarm and the path of the actual USV swarm at sea. It was verified that the effectiveness of the USV mathematical model and behavior control rules. By comparing the movement path of the swarm USV with and without the disturbance learning algorithm and ANN-PID control algorithm applied to the designed simulator, the position error and maintenance performance of the swarm formation were analyzed, and the application results were compared.

The gradient descent algorithm has become the standard algorithm for computing the extreme values of functions, but for multivariate functions this algorithm is mostly ineffective. This is because the convergence rate of each element is inconsistent in most cases. However, in this paper, we found that the gradient sign is a self-optimizing operator, ensuring that the convergence rate is consistent across all elements. This also explains, from an optimization perspective, the success of the Fast Gradient Sign Method (FGSM) in generating adversarial samples that are indistinguishable from the normal input, but can easily fool neural networks. We also found that the fractional order gradient is also self-optimizing, and that the convergence speed of this algorithm can be controlled by adjusting the order of the gradient. Experiments suggest that this algorithm not only generates adversarial samples faster than other algorithms, but that a single source image can generate many such samples. This algorithm is also more effective than others at generating adversarial samples from simple images.

This study presents a groundbreaking approach in the field of gaming AI, focusing on the classic game” Pacman” through the lens of DRL integrated with advanced optimization techniques. The core of the research involves adapting DRL models for” Pacman”, utilizing the ESO for hyper- parameter tuning. These novel adaptations significantly enhance the AI agent’s performance, demonstrating a remarkable improvement in adaptability, responsiveness, and efficiency within the game environment. A pivotal aspect of this research is the innovative integration of metaheuristic optimization techniques into the DRL framework, a first in the domain of Atari gaming AI. This integration has proven essential in fine-tuning the DRL models, leading to a more effective and dynamic gaming experience. The study thoroughly evaluates and compares the performance of these algorithms, providing empirical support for their effectiveness and setting a new benchmark in AI-driven game development. The implications of this research extend beyond gaming AI, opening up possibilities for future exploration in several directions. Expanding DRL models to other complex gaming environments, continuous algorithmic enhancements, real-time learning adaptations, and applying these principles to robotics and autonomous vehicles are examples. The research also emphasizes ethical and responsible AI use in gaming to address fairness and addiction issues.

Background and Objectives To compare navigator-gated three-dimensional T1-weighted gradient-echo sequences (NG-3D T1W-GRE) with standard breath-hold T1W-GRE (BH T1W-GRE) for the detection of HCC nodules in patients with chronic viral hepatitis which undergo at magnetic resonance imaging (MRI) using gadoxetic acid. Methods and materials We evaluated 58 patients with hepatic nodules at least 1 cm in diameter detected by ultrasound who underwent liver MRI including NG-3D T1W-GRE sequences and breath hold T1-weighted gradient-echo sequences with different flip angles(FA) at 10-25-40° after contrast administration of gadoxetic acid at magnetic scanner operating at1.5 Tesla. Image quality and relative hepatic and nodular enhancement were evaluated by three blinded reviewers. Results In these patients, image quality of NG-3D T1W-GRE was assessed significantly better than quality of BHT1W- GRE (P < 0.005) and relative enhancement was significantly higher than that of BH- T1W-GRE ( P

In swarm-robotics foraging, the purpose of task allocation is to adjust the number of active foraging robots dynamically based on the task demands and changing environment. It is a difficult challenge to generate self-organized foraging behavior in which each robot can adapt to environmental changes. To complete the foraging task efficiently, this paper presents a novel self-organized task allocation strategy known as the dynamic response threshold model (DRTM). To adjust the behavior of the active foraging robots, the proposed DRTM newly introduces the traffic flow density, which can be used to evaluate the robot density. First, the traffic flow density and the amount of obstacle avoidance are used to adjust the threshold which determines the tendency of a robot to respond to a stimulus in the environment. Then, each individual robot uses the threshold and external stimulus to calculate the foraging probability that determines whether or not to go foraging. Simulation and physical experiments are carried out to evaluate the performance of the proposed method. The experimental results show that the DRTM is superior to and more efficient than the adaptive response threshold model (ARTM) in swarm foraging.

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

Financial statements depict the condition of a company and need to be analyzed and evaluated to assess its performance. This research aims to analyze financial statements to describe the financial condition, measure business development over time, and evaluate the achievement of the com-pany's objectives. An optimization analysis of financial ratios is performed using the Weighted Goal Programming (WGP) model, which addresses multiple objectives by applying weights based on their priorities. The Analytical Hierarchy Process was used to determine the priority weights of deviation variables from each financial ratio target. Financial ratios were selected based on their impact on profit using factor analysis. The constructed WGP model aims to minimize deviations in Return on Assets, Operating Ratios, Operating Income Ratio, Total Assets Turnover, and Current Ratio. Computational calculations to solve the WGP model are per-formed using Python, with pseudocode provided. A case study on a company in the garment and textile sector was conducted and found that the Operating Ratio, Return on Assets, Operating Income Ratio, and Current Ratio still need improvement by developing strategies to achieve the targets. Sensitivity analysis was also employed to assess the resilience of the model in response to alterations in data.

In this paper, an adaptive proportional and integral (PI) controller for speed control of electric drives is developed. The adaptive PI controller is designed based on model reference adaptive identification and the Lyapunov function so that the system stability can be proved. To identify the inertia, the viscous friction torque coefficient, and the load torque simultaneously and smoothly, sinusoidal speed reference is usually employed. A modified motion equation considering the low-pass filter for feedback speed and the Coulomb friction torque is introduced and the relationship between the identified parameters and their actual values are clarified. A high-precision digital simulation model is built based on MATLAB/Simulink. The effectiveness of the proposed method is verified by simulations under various conditions.

Self-report measurement is frequently used in human sports to assess training adaptations [1, 2]. This is a technique novel to the equestrian sport. The aim of this study was to describe how elite event riders of Germany evaluate their own fitness as well as that of their horses for the entire duration of an eventing season. Additionally, correlations with possible influencing external factors such as type of training or duration of grazing were also investigated. Short online questionnaires were used to allow eight riders to describe the training of their horses. Five criteria (general performance, ability to concentrate, general state of mind, general muscular condition and emotional wellbeing) were used to assess both, their horse's, as well as their own wellbeing. A 1-10 rating scale was used to score each criterion resulting in an average of 38 points out of 50 (maximum wellbeing) for horse (Std. dev. 0.55) and rider (Std. dev. 0.65) respectively. A total of 120 questionnaires were analysed. A correlation could be demonstrated (Spearman's correlation coefficient = 0.5) between rider and horse score, whereby it only became a linear correlation above 30 points. In addition, the horse score correlates positively with its success at competitions. While the horses were rated similarly throughout the season, the riders’ perceived welfare was higher in the middle of the season compared with the beginning and end of the season. Regularly turned-out horses resulted in higher horse scores (Linear mixed model, p=0,04, n=120). It can be concluded that the self-report measurement of fatigue and wellbeing can be a useful tool for trainers and riders to better determine the horse’s fatigue and recovery. It should be noted that external factors influence both, rider and horse assessment.

A new requirement for the manufacturing companies in Industry 4.0 is to be flexible with respect to changes in demands, requiring them to react rapidly and efficiently on the production capacities. Together with the trend to use Service-Oriented Architectures (SOA), this requirement induces a need for agile collaboration among supply chain partners, but also between different divisions or branches of the same company. In order to address this collaboration challenge, we~propose a novel pragmatic approach for the process analysis, implementation and execution. This~is achieved through sets of semantic annotations of business process models encoded into BPMN 2.0 extensions. Building blocks for such manufacturing processes are the individual available services, which are also semantically annotated according to the Everything-as-a-Service (XaaS) principles and stored into a common marketplace. The optimization of such manufacturing processes combines pattern-based semantic composition of services with their non-functional aspects. This is achieved by means of Quality-of-Service (QoS)-based Constraint Optimization Problem (COP) solving, resulting in an automatic implementation of service-based manufacturing processes. The produced solution is mapped back to the BPMN 2.0 standard formalism by means of the introduced extension elements, fully detailing the enactable optimal process service plan produced. This approach allows enacting a process instance, using just-in-time service leasing, allocation of resources and dynamic replanning in the case of failures. This proposition provides the best compromise between external visibility, control and flexibility. In this way, it provides an optimal approach for business process models' implementation, with a full service-oriented taste, by implementing user-defined QoS metrics, just-in-time execution and basic dynamic repairing capabilities. This paper presents the described approach and the technical architecture and depicts one initial industrial application in the manufacturing domain of aluminum forging for bicycle hull body forming, where the advantages stemming from the main capabilities of this approach are sketched.

The runtime environment is an important concern for self-adaptive systems (SASs). Although researchers have proposed many approaches for developing SASs that address the issue of uncertain runtime environments, the understanding of these environments varies depending on the objectives, perspectives, and assumptions of the research. Thus, the current understanding of the environment in SAS development is ambiguous and abstract. To make this understanding more concrete, we describe the landscape in this area through a systematic literature review (SLR). We examined 128 primary studies and 14 unique environment models. We investigated concepts of the environment depicted in the primary studies and the proposed environment models based on their ability to aid in understanding. This illustrates the characteristics of the SAS environment, the associated emerging environmental uncertainties, and what is expressed in the existing environment models. This paper makes explicit the implicit understanding about the environment made by the SAS research community and organizes and visualizes them.

Self-adaptive systems are capable of reconfiguring themselves while in use to reduce the risks forced by environments for which they may not have been specifically designed. Run-time validation techniques are required because complex Self-adaptive systems must consistently offer acceptable behavior for important services. The run-time testing can offer further confidence that a Self-adaptive system will continue to act as intended even when operating in unknowable circumstances. This article introduces an evolutionary framework that supports adaptive testing for Self-adaptive systems. To ensure that the adaptive systems continue to operate following its requirements and that both test plans and test cases continuously stay relevant to shifting operational conditions. The proposed approach using the SPEA2 algorithm facilitates both the execution and adaptation of run-time testing operations.

Wireless Body Area Networks are composed of sensor nodes that may be implanted in the body or worn on it. A node is composed of a sensing unit, a processor and a radio unit. One of the nodes, the sink, acts as a gateway between the body area network and other networks such as the Internet. We propose a routing protocol that constructs paths between nodes such that the final network topology is a tree rooted at the sink. The protocol's aim is to increase network lifetime and reliability, and to adapt to network conditions dynamically. Moreover, the protocol enables communications between nodes and sink both in the upstream direction, from nodes to sink, and in the downstream direction from sink to nodes. When the network tree is constructed, a node chooses its parent, i.e., next hop to sink, by using one of various criteria. Namely, these are the number of hops between parent and sink, energy level of parent, received signal strength from parent, number of current parent's children, and a fuzzy logic function that combines multiple criteria. Moreover, as time progresses the tree structure may dynamically change to adapt to conditions such as the near-depletion of a routing node's energy. Simulation results show improvements in network lifetime and energy consumption over the older version of the protocol.

This article describes the choice of an optimization algorithm for solving problems and the optimal design of an unmanned aerial vehicle propeller. To solve the problem using evolutionary algorithms, it was transformed into an unconstrained optimization problem using a penalty function. The airfoil contours were constructed using a Bezier curve. Design variables were divided into two types: those that describe in general terms the propeller geometry or operation, such as propeller diameter, number of blades, and rev/min; and those that vary with propeller radius, such as chord length, effective airfoil angle, and airfoil geometry. The objective function is the calculation of the propeller power required to achieve a given thrust. The differential evolution algorithm was used to solve this problem.

Red mud (RM), a bauxite residue, contains hazardous radioactive wastes and alkaline material and poses severe surface water and groundwater contamination risks, necessitating recycling. Pretreated RM can be used to make adsorbents for water treatment. However, its performance is affected by many factors, resulting in a nonlinear correlation and coupling relationship. This study aimed to identify the best formula for an RM adsorbent using a mathematical model that examines the relationship between 11 formulation types (e.g., pore-assisting agent, component modifier, and external binder) and nine properties (e.g., specific surface area, wetting angle, and Zeta potential, among others). This model was built using a back-propagation neural networks(BP) based on single-factor experimental data and orthogonal test data. The model trained and predicted the established network structure to obtain the optimal adsorbent formula. The RM particle adsorbents had a pH of 10.16, specific surface area(BET) of 48.92 m2·g−1, pore volume of 2.10 cm3·g−1, compressive strength(ST)) of 1.12 KPa, and 24-h immersion pulverization rate(η_m) of 3.72%. In the removal of total phosphorus in flotation tailings backwater, it exhibited a good adsorption capacity (Q)and total phosphorous removal rate(η) of 48.63 mg·g−1 and 95.13%, respectively.

Fires are complex multi-physics problems that span wide spatial scale ranges. Capturing this complexity in computationally affordable numerical simulations for process studies and “outer-loop” techniques (e.g., optimization and uncertainty quantification) is a fundamental challenge in reacting flow research. Further complications arise for propagating fires where a priori knowledge of the fire spread rate and direction is typically not available. In such cases, static mesh refinement at all possible fire locations is a computationally inefficient approach to bridging the wide range of spatial scales relevant to fire behavior. In the present study, we address this challenge by incorporating adaptive mesh refinement (AMR) in fireFoam, an OpenFOAM solver for simulations of complex fire phenomena involving pyrolyzing solid surfaces. The AMR functionality in the extended solver, called fireDyMFoam, is load balanced, models gas, solid, and liquid phases, and allows us to dynamically track regions of interest, thus avoiding inefficient over-resolution of areas far from a propagating flame. We demonstrate the AMR capability and computational efficiency for fire spread on vertical panels, showing that the AMR solver reproduces results obtained using much larger statically refined meshes, but at a substantially reduced computational cost. We then leverage the computational efficiency of the AMR solver to demonstrate an optimization framework for fire suppression based on the open-source Dakota toolkit.

This paper presents a multi-swarm PSO algorithm for the Quadratic Assignment Problem (QAP) implemented on the OpenCL platform. Our work was motivated by results of time efficiency tests performed for single-swarm algorithm implementation that showed clearly that the benefits of a parallel execution platform can be fully exploited provided the processed population is large. The described algorithm can be executed in two modes: with independent swarms or with migration. We discuss the algorithm construction as well as we report results of tests performed on several problem instances from the QAPLIB library. During the experiments the algorithm was configured to process large populations. This allowed us to collect statistical data related to values of goal function reached by individual particles. We use them to demonstrate on two test cases that although single particles seem to behave chaotically during the optimization process, when the whole population is analyzed, the probability that a particle will select a near-optimal solution grows.

This paper presents a new adaptive and optimal algorithm for the trajectory tracking control of a quadrotor using iterative learning algorithm (ILA) and enumerative learning algorithm. Ordinarily the ILA, as an adaptive method, can perform well with PID control to improve the controller’s performance for a nonlinear system. Quadrotors are considered as non-linear and unstable systems which the use of an adaptive and optimal controller can increase its stability and decrease error level. In this method, a PID controller is proposed for the outer and inner control loops of a quadrotor and the ILA is used to adapt PID control gains. Subsequently, an enumerative learning algorithm is used to optimize the learning rates of the ILA. For this purpose, at first, the dynamic model of the quadrotor is acquired. After that, the structure of the inner and outer control loops is defined. In the end, the simulation results for the trajectory tracking control of a quadrotor are demonstrated. Through simulation, it is concluded that as time increases, the performance of the suggested control method in trajectory tracking control becomes better and better and error signals convergence to zero.

We develop an optimized force-field for poly(3-hexylthiophene) (P3HT) and demonstrate its utility for predicting thermodynamic self-assembly. In particular, we consider short oligomer chains, model electrostatics and solvent implicitly, and coarsely model solvent evaporation. We quantify the performance of our model to determine what the optimal system sizes are for exploring self-assembly at combinations of state variables. We perform molecular dynamics simulations to predict the self-assembly of P3HT at ~350 combinations of temperature and solvent quality. Our structural calculations predict that the highest degrees of order are obtained with good solvents just below the melting temperature. We find our model produces the most accurate structural predictions to date, as measured by agreement with grazing incident X-ray scattering experiments.

Real-world optimization problems are often gov- erned by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Opti- mization Problems (COPs) fueled by advances in computational power. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose a novel hybrid Evolutionary Algorithm based on the Differential Evolution algorithm and Adaptive Parameter Gaining Sharing Knowledge-based algo- rithm to solve global real-world constrained parameter space. The proposed CHAGSKODE algorithm leverages the power of multiple adaptation strategies concerning the control parameters, search mechanisms, as well as uses knowledge sharing between junior and senior phases. We test our method on the benchmark functions taken from the CEC2020 special session & competition on real-world constrained optimization. Experimental results indicate that CHAGSKODE is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

Of all the renewable energy sources, solar photovoltaic (PV) power is estimated to be a popular source due to several advantages such as its free availability, absence of rotating parts, integration to building such as rooftops, and less maintenance cost. The nonlinear current-voltage (I–V) characteristics and power generated from a PV array primarily depend on solar insolation/irradiation and panel temperature. The extracted PV output power is influenced by the accuracy with which the nonlinear power–voltage (P–V) characteristic curve is traced by the maximum power point tracking (MPPT) controller. In this paper, a bio-inspired roach infestation optimization (RIO) algorithm is proposed to extract the maximum power from the PV system (PVS). To validate the usefulness of the RIO MPPT algorithm, MATLAB/Simulink simulations are performed under varying environmental conditions, for example, step changes in solar irradiance, and partial shading of the PV array. Furthermore, the search performance of the RIO algorithm is examined on different unconstrained benchmark functions, and it is that realized that the RIO algorithm has improved convergence characteristics in terms of finding the optimal solution than Particle swarm optimization (PSO). The results demonstrated that the RIO-based MPPT performs remarkably in tracking with high accuracy as the PSO-based MPPT.

A Demand-side management technique are deployed along with battery energy-storage systems (BESSs) to lower the electricity cost by mitigating the peak load of a building. Most of the existing methods rely on manual operation of the BESS, or even an elaborate building energy-management system resorting to a deterministic method that is susceptible to unforeseen growth in demand. In this study we propose a real-time optimal operating strategy for BESS based on density demand forecast and stochastic optimization. This method takes into consideration uncertainties in demand when accounting for an optimal BESS schedule, making it robust compared to the deterministic case. The proposed method is verified and tested against existing algorithms. Data obtained from a real site in South Korea is used for verification and testing. The results show that the proposed method is effective, even for the cases where the forecasted demand deviates from the observed demand

Unmanned aerial vehicles (UAV) thermal imagery offers several advantages in environmental monitoring, as it can provide a low-cost, high-resolution, and flexible solution to measure the temperature of the surface of the land. Limitations related to the maximum load of the drone lead to use of lightweight uncooled thermal cameras whose internal components are not stabilized to a constant temperature. Such cameras suffer from several unwanted effects that contribute to the increase in temperature measurement error from ±0.5 °C in laboratory conditions, to ±5 °C in unstable flight conditions. This article describes a post processing procedure, that reduces the above unwanted effects. It consists of following steps: i) devignetting using single image vignette correction algorithm, ii) georeferencing of images using EXIF data, scale-invariant feature transform (SIFT) stitching, and gradient descent optimisation, and iii) temperature calibration by minimisation of bias between overlapping thermal images using gradient descent optimisation. The solution was tested in several case studies of river areas, where natural water bodies were used as a reference temperature benchmark. In all tests, the precision of the measurements was increased. The root of the mean of the Square of Errors RMSE on average was reduced by 39.0% and Mean of the absolute value of Errors MAE by 40.5%. The proposed algorithm can be called self-calibrating, as in contrast to other known solutions is fully automatic, uses only field data and does not require any calibration equipment or additional operator effort. A Python implementation of the solution is available on GitHub.

The key links of face recognition are digital image preprocessing, facial feature extraction and pattern recognition, this article aimed at the current problem of slow speed and low recognition accuracy of face recognition , from the above three key links, on the basic of analyzing the therories of Fractional Differential Masks Operator (FDMO), Principal Component Analysis (PCA) and Support Vector Machine (SVM), design a kind of FDMO+PVA+SVM coupling algorithm that applies to face recognition to improve the speed and accuracy of it. To realize FDMO+PCA+SVM coupling algorithm, first, we should apply FDMO to face image processing binary marginalization, the purpose is getting face contour; Then, we apply PCA to get the feature of face image which is disposed by binary marainalization. At last, we can apply One-Against All of the SVM classifier and LibSVM software package to realize face recognition. Beside, the article with nine different coupling algorithm design four groups of experimental reaults on the ORL face database verified by comparative analysic FDMO+PCA+SVM coupling algorithm in the superiority of face recognition accuracy and speed.

Single particle tracking (SPT) is a powerful class of methods for studying the dynamics of biomolecules inside living cells. The techniques reveal the trajectories of individual particles, with a resolution well below the diffraction limit of light, and from them the parameters defining the motion model, such as diffusion coefficients and confinement lengths. Most existing algorithms assume these parameters are constant throughout an experiment. However, it has been demonstrated that they often vary with time as the tracked particles move through different regions in the cell or as conditions inside the cell change in response to stimuli. In this work, we propose an estimation algorithm to determine time-varying parameters of systems that discretely switch between different linear models of motion with Gaussian noise statistics, covering dynamics such as diffusion, directed motion, and Ornstein-Uhlenbeck dynamics. Our algorithm consists of three stages. In the first stage, we use a sliding window approach, combined with Expectation Maximization (EM) to determine maximum likelihood estimates of the parameters as a function of time. These results are only used to roughly estimate the number of model switches that occur in the data to guide the selection of algorithm parameters in the second stage. In the second stage, we use change detection (CD) techniques to identify where the models switch, taking advantage of the off-line nature of the analysis of SPT data to create non-causal algorithms with better precision than a purely causal approach. Finally, we apply EM to each set of data between the change points to determine final parameter estimates. We demonstrate our approach using experimental data generated in the lab under controlled conditions.

Disassembly is a pivotal technology to enable the circularity of electric vehicle batteries by applying circular economy strategies that extend the life cycle of their components, like remanufacturing and repurposing, or by using efficient recycling to reintegrate the gained materials in producing new battery systems. This paper aims to develop a multi-method self-configuring simulation model for investigating disassembly scenarios while considering the battery design as well as the configuration and layout of the disassembly station. We demonstrate the developed model in a case study using a battery of Mercedes-Benz and the automated disassembly station of the project DeMoBat at Fraunhofer IPA. Furthermore, we introduce two disassembly scenarios, the component-oriented and the accessibility-oriented disassembly, and compare them using the simulation model to determine several indicators, such as the frequency of tool change, the number and distribution of robot routes, the tool utilization, and the disassembly time.

The abundant mechanical vibration energy in bridge road environment can be converted into electric energy by using the piezoelectric energy harvest technology, which could be an efficient way to provide energy required by the wireless sensor network in the bridge condition monitoring system. An autonomous energy harvesting system has been designed based on cantilever beams for sensing and acquiring the bridge vibration energy. After the analysis of the dynamic properties of the piezoelectric cantilever beam in the energy conversion, three kinds of interface circuits were compared through simulation and experimental results. It was shown that the VD interface circuit has less power loss. Furthermore, the proposed closed loop control method based on the VD circuit was simple, adaptive, and self-powered, which is suitable for the road energy harvesting application. Finally, the energy harvesting system based on VD circuit was realized with harvested power of around 0.8mW.

A reinforcement learning algorithm is proposed to improve the accuracy of short-term load forecasting (STLF) in this article. The proposed model integrates radial basis function neural network (RBFNN), support vector regression (SVR), and adaptive annealing learning algorithm (AALA). In the proposed methodology, firstly, the initial structure of RBFNN is determined by using SVR. Then, an AALA with time-varying learning rates is used to optimize the initial parameters of SVR-RBFNN (AALA-SVR-RBFNN). In order to overcome the stagnation for searching optimal RBFNN, a particle swarm optimization (PSO) is applied to simultaneously find promising learning rates in AALA. Finally, the short-term load demands are predicted by using the optimal RBFNN. The performance of the proposed methodology is verified on the actual load dataset from Taiwan Power Company (TPC). Simulation results reveal that the proposed AALA-SVR-RBFNN can achieve a better load forecasting precision as compared to various RBFNNs.

The development of computational acoustics allows simulation of sound generation and propagation in complex environment. In particular, meshfree methods are widely used to solve acoustics problems through arbitrarily distributed field points and approximation smoothness flexibility. As a Lagrangian meshfree method, smoothed particle hydrodynamics (SPH) method reduce the difficulty in solving problems with deformable boundaries, complex topologies, or multiphase medium. The traditional SPH method has been applied in acoustic simulation. This study presents the corrective smoothed particle method (CSPM), which is a combination of SPH kernel estimate and Taylor series expansion. The CSPM is introduced as a Lagrangian approach to improve accuracy in solving acoustic wave equations in the time domain. Moreover, a boundary treatment technique based on the hybrid meshfree and finite difference time domain (FDTD) method is proposed to represent different acoustic boundaries with particles. To model sound propagation in pipes with different boundaries, soft, rigid, and absorbing boundary conditions are built with this technique. Numerical results show that the CSPM algorithm is consistent and demonstrates convergence with exact solutions. Main computational parameters are discussed, and different boundary conditions are validated to be effective for benchmark problems in computational acoustics.

Surface acoustic wave (SAW) is effective for the manipulation of fluids and particles in microscale. The current approach of integrating interdigitated transducers (IDTs) for SAW generation into microfluidic channels involves complex and laborious microfabrication steps. These steps often require the full access to clean room facilities and hours to align the transducers to the precise location. This work presents an affordable and innovative method for fabricating SAW-based microfluidic devices without the need of clean room facilities and alignment. The IDTs and microfluidic channels are fabricated in the same process and thus precisely self-aligned in accordance with the device design. With the use of the developed fabrication approach, a few types of different SAW-based microfluidic devices have been fabricated and demonstrated for particle separation and active droplet generation.

The influence of neutrosophy in the previous period is constantly growing in many areas of science and technology. Moreover, various applications of the neutrosophic approach have become more common in recent years. Our goal in this research is to utilize the neutrosophy to improve the performance of the Dai-Liao conjugate gradient (CG) method. Specifically, in this research, we propose and investigate a new neutrosophic logic system to calculate the key parameter t involved in the Dai–Liao CG iterations. Theoretical analysis and numerical experience indicate that the efficiency and robustness of the new rule for determining t. Combining the neutrosophy and the Dai-Liao conjugate gradient method, we propose and explore a new Dai-Liao CG iterations for solving large-scale unconstrained optimization models. The global convergence is established under common assumptions and the backtracking line search. Finally, by conducting numerical experiments, computational evidence demonstrates that the new fuzzy neutrosophic Dai-Liao conjugate gradient method is computationally effective and robust.

The precise prediction of air contaminant dispersion is essential to the air quality monitoring and the emergency management of the contaminant gases leakage incidents in the chemical industry park. The conventional atmospheric dispersion models can seldom give precise prediction due to inaccurate input parameters. In order to improve the prediction accuracy of dispersion model, two data assimilation methods (i.e. one is merely based on the typical particle filter while the other is a combination of particle filter and expectation-maximization algorithm) are proposed to assimilate the UAV observations into the atmospheric dispersion model. Two emission cases are taken into consideration, the difference between which is the different dimensions of state variables. To test the performances of the proposed methods, experiments corresponding to the two emission cases are designed and implemented. The results show that the particle filter can effectively estimate the model parameters and improve the accuracy of model prediction when the dimension of state variables is low. In contrast, when the dimension of state variables becomes higher, the method of particle filter combining expectation-maximization algorithm performs better in the parameter estimation accuracy and warm-up time. Therefore, the data assimilation methods are able to effectively support the air quality monitoring and emergency management in chemical industry parks.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.