In the manufacturing industry, orders are typically scheduled and delivered through batches, and the probability of machine failure under high-load operation is high. On this basis, we focus on a single machine batch scheduling problem with a maintenance interval (SMBSP-MI). The studied problem is expressed by three-field representation as 1|B,MI|\sum{F_j+\mu}m, and the optimization objective is to minimize total flow time and delivery costs. Firstly, 1|B,MI|\sum{F_j+\mu}m is proved to be NP-hard by Turing reduction. Secondly, shortest processing time (SPT) order is shown the optimal scheduling of SMBSP-MI, and a dynamic programming algorithm based on SPT (DPA-SPT) with the time complexity of O(n^3T_1) is proposed. A small-scale example is designed to verify the feasibility of DPA-SPT. Finally, DPA-SPT is approximated to a fully-polynomial dynamic programming approximation algorithm based on SPT (FDPAA-SPT) by intervals partitioning technique. The proposed FDPAA-SPT runs in O(\frac{n^5}{\varepsilon^2})\ time with the approximation (1+\varepsilon).

With the development of higher voltage power grid, the high and low voltage parallel loops are emerging, which lead to energy losses, even threaten the security and stability of power system. The multi-infeed HVDC configurations widely appearing in AC/DC interconnected power system make this situation even worse. Aimed at energy saving and system security, a decision optimization method for power grid operating condition with high and low voltage parallel loops is proposed in this paper. Firstly, considering hub substation distribution and power grid structure, parallel loop opening schemes are generated with GN algorithm. Then, candidate opening schemes are preliminarily selected from all these generated schemes based on a filtering index. Finally, with the influence on power system security, stability and operation economy in consideration, an evaluation model for candidate opening schemes is founded based on analytic hierarchy process (AHP). And a fuzzy evaluation algorithm is used to find the optimal scheme. Simulation results of New England 39-bus system and an actual power system validate the effectiveness and superiority of this proposed method.

Jacobian-free Newton Krylov (JFNK) is an attractive method to solve nonlinear equations in nuclear engineering systems, and has been successfully applied to steady-state neutron diffusion (k-eigenvalue) problems and multi-physics coupling problems. Preconditioning technique plays an important role in JFNK algorithm, significantly affecting computational efficiency. The key point is how to automatically construct a high-quality preconditioning matrix that can improve the convergence rate, and perform the preconditioning matrix factorization efficiently. An efficient reordering-based ILU(k) preconditioner is proposed to achieve the above objectives. In detail, the finite difference technique combined with the coloring algorithm is utilized to construct an efficient preconditioning matrix with low computational cost automatically. Furthermore, the reordering algorithm is employed for the ILU(k) to reduce the additional non-zero elements and pursue robust computational performance. A two-dimensional LRA neutron steady-state benchmark problem is used to evaluate the performance of the proposed preconditioning technique, and steady-state neutron diffusion problem with thermal-hydraulic feedback is also utilized as a supplement. The results show that coloring algorithms can efficiently and automatically construct the preconditioning matrix. The reordering-based ILU(k) preconditioner shows excellent robustness, avoiding the effect of fill-in levels k choice in incomplete LU factorization.

Recently, a layer-stacked ESN model named deep echo state Network (DeepESN) has been established. As an interactional model of recurrent neural network and deep neural network, investigations of DeepESN are of significant importance in both areas. Optimizing the structure of neural networks remains a common task in artificial neural networks, and the question of how many neurons should be used in each layer of DeepESN must be stressed. In this paper, our aim is to solve the problem of choosing the optimized size of DeepESN. Inspired by the sensitive iterative pruning algorithm, a neuronal similarity-based iterative pruning merging algorithm (NS-IPMA) is proposed to iteratively prune or merge the most similar neurons in DeepESN. Two chaotic time series prediction tasks are applied to demonstrate the effectiveness of NS-IPMA. The results show that the DeepESN pruned by NS-IPMA outperforms unpruned DeepESN with the same network size, and NS-IPMA is a feasible and superior approach to improving the generalization performance of DeepESN.

When implementing SVMs, two major problems are encountered: (a) the number of local minima increases exponentially with the number of samples and (b) the quantity of required computer storage, required for a regular quadratic programming solver, increases by an exponential mag-nitude as the problem size expands. The Kernel-Adatron family of algorithms gaining attention lately which has allowed it to handle very large classification and regression problems. Howev-er, these methods treat different types of samples (Noise, border, and core) in the same manner, which causes searches in unpromising areas and increases the number of iterations. In this work, we introduce a hybrid method to overcome these shortcomings, namely Optimal Recurrent Neu-ral Network Density Based Support Vector Machine (Opt-RNN-DBSVM). This method consists of four steps: (a) characterization of different samples, (b) elimination of samples with a low probability of being a support vector, (c) construction of an appropriate recurrent neural network based on an original energy function, and (d) solution of the system of differential equations, managing the dynamics of the RNN, using the Euler-Cauchy method involving an optimal time step. The RNN remembers the regions explored during the search process thanks to its recurrent architecture. We demonstrated that RNN-SVM converges to feasible support vectors and Opt-RNN-DBSVM has a very low time complexity compared to RNN-SVM with constant time step, and KAs-SVM. Several experiments were performed on academic data sets. We used several classification performances measures to compare Opt-RNN-DBSVM to different classification methods and the results obtained show the good performance of the proposed method.

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.

Using metaheuristics, such as the Evolutionary Algorithm (EA), within control structures is a realistic approach for certain optimal control problems. Their role is often predicting the optimal control values over a prediction horizon using a process model (PM). The big computational effort sometimes causes problems. Our work addresses a new issue: whether a machine learning (ML) algorithm could “learn” the optimal behaviour of the couple (EA, PM). A positive answer is given by proposing datasets apprehending this couple's optimal behaviour and appropriate ML models. Following a design procedure, a number of closed-loop simulations will provide the sequences of optimal control and state values, which are collected and aggregated in a data structure. For each sampling period, datasets are extracted from the aggregated data. The ML algorithm experiencing these datasets will produce a set of regression functions. Replacing the EA predictor with the ML model, new simulations are carried out, proving that the state evolution is almost identical. The execution time decreases drastically because the PM’s numerical integrations are totally avoided. The performance index equals the best-known value. In different case studies, the ML models succeeded in capturing the optimal behaviour of the couple (EA, PM) and yielded efficient controllers.

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.

Properties of spatially explicit data are often ignored or inadequately handled in machine learning for spatial domains of application. At the same time, resources that would identify these properties and investigate their influence and methods to handle them in machine learning applications are lagging behind. In this survey of the literature, we seek to identify and discuss spatial properties of data that influence the performance of machine learning. We review some of the best practices in handling such properties in spatial domains and discuss their advantages and disadvantages. We recognize two broad strands in this literature. In the first, the properties of spatial data are developed in the spatial observation matrix without amending the substance of the learning algorithm; in the other, spatial data properties are handled in the learning algorithm itself. While the latter have been far less explored, we argue they offer the most promising prospects for the future of spatial machine learning.

In the realm of smart transportation and mobility, delivery organizations are continuously refining their strategies, harnessing resources and advanced analytical techniques to streamline operations, aiming to achieve optimal solutions in terms of both efficiency and cost-effectiveness. However, a persistent challenge faced by these delivery companies revolves around the effective assignment of delivery personnel to customer orders, often grappling with suboptimal assignments that lead to inefficiencies and delays. To address this issue, we propose an architecture that uses the Munkres algorithm to optimize the task assignment problem for delivery personnel with pending orders, employing different cost functions obtained with deterministic and machine learning techniques. We compared the performance of linear and polynomial regression methods to construct different cost functions represented by matrices with orders and delivery people information. Subsequently, we applied the Munkres optimization algorithm to solve the assignment problem, which optimally assigns delivery people and orders. The results demonstrate that linear regression, used to estimate distance information, can reduce estimation errors by up to 568.52 km (1.51%) for our dataset compared to other methods. Conversely, polynomial regression proves effective in constructing a superior cost function based on time information, reducing estimation errors by up to 17,143.41 minutes (11.59%) compared to alternative methods. The proposed approach aims to enhance delivery personnel allocation within the delivery sector, optimizing the efficiency of this process.

Wearable sensors for human physiological monitoring have attracted tremendous interest from researchers in recent years. However, most of the research was only done in simple trials without any significant analytical algorithms. This study provides a way of recognizing human motion by combining textile stretch sensors based on single-walled carbon nanotubes (SWCNTs) and spandex fabric (PET/SP) and machine learning algorithms in a realistic applications. In the study, the performance of the system will be evaluated by identification rate and accuracy of the motion standardized. This research aims to provide a realistic motion sensing wearable products without unnecessary heavy and uncomfortable electronic devices.

This study aims to focus on using the Volterra series and machine learning for forecasting random and chaotic wind speed regimes, since the calm weather is mostly noticed at the local site, making the dataset selection difficult. A novel method is proposed to predict Volterra kernels up to the third order, using a forward-back propagation neural network with 12-month measurements at Fujairah site (UAE). Both daily and monthly wind speed data sets are investigated for forecasting. The three dominant hourly and daily kernels are extracted for each day and each month. Predicted future Volterra kernels are estimated from past values using both statistical analysis and individual neuro networks for each of the Volterra kernel coefficients. Due to the random nature of wind speed at the local site, a two-layer with 4 neurons per layer neuro network is used to locate the most variable and intense speed during 8-hours in the day. Forecasted wind speed is determined with errors arising from different sources such as the utilization of only 3rd-order Volterra kernels and the difficulty of machine training of the employed shallow network. Nevertheless, this work depicts a useful algorithm to forecast chaotic and random wind speed regimes. Computational time is a trade of the complexity of Volterra mathematical analysis.

Keywords: Аrtificial neural network, electric drive system, database, stability, training algorithm, technological mechanisms.

Several factors impact the durability of concrete bridge decks, including traffic loads, fatigue, temperature changes, environmental stress, and maintenance activities. Detecting problems such as corrosion, delamination, or concrete degradation early on can lower maintenance costs. Nondestructive evaluation (NDE) techniques can detect these issues at early stages. Each NDE method, meanwhile, has limitations that reduce the accuracy of the assessment. In this study, multiple NDE technologies were combined with machine learning algorithms to improve the interpretation of half-cell potential (HCP) and electrical resistivity (ER) measurements. A parametric study was performed to analyze the influence of five parameters on HCP and ER measurements, such as degree of saturation, corrosion length, delamination depth, concrete cover, and moisture condition of delamination. The results were obtained through finite element simulations and used to build two machine learning algorithms, a classification algorithm and a regression algorithm, based on the Random Forest methodology. The algorithms were tested using data collected from a bridge deck in the BEAST® facility. Both machine learning algorithms were effective in improving the interpretation of ER and HCP measurements using data from multiple NDE technologies.

Disease detection and prediction have been one of the most frequent uses of machine learning models in the last decade, and Parkinson's disease is no exception. It is common for people in their old age to have one form of disease or another depending on the circumstances in which they find themselves. This study analyzed and evaluated various supervised machine learning models to detect the presence of Parkinson's disease in elderly individuals. An extreme gradient boosting model, along with other models, such as naïve Bayes, random forest, K-nearest neighbor, and support vector machine (SVM), was implemented to determine the best outcome. The extreme gradient boosting (XGBoost) model is a powerful boosting machine learning technique, particularly in terms of speed and accuracy. The results showed that the XGBoost model, which is an optimized version of the other boosting models, is capable of projecting the presence of Parkinson's disease with very high accuracy compared to other algorithms. The implemented classification algorithm extreme gradient boosting method achieved approximately 98 % accuracy, 97.5 % precision, 100.0 % recall, and 98.7% f1-score which are high compared with the results found in the existing literature.

Cracking in a wide array of industrial components and structures pose a significant threat to their integrity. Detecting cracks using ultrasonic inspection techniques is a widespread activity for economic reasons but there are limitations to the techniques due to the morphology of cracks, such as fatigue cracks. In addition to detection there is a need to measure the size of the cracks which are often within the volume of the material. Ultrasonic techniques are well-suited to look inside the volume of the material but achieving sufficient sensitivity to the tip of the cracks in particular is practically difficult. Without an accurate knowledge of where the tip of the crack lies there can be significant uncertainty in sizing measurements. Machine Learning (ML) techniques are being developed to aid in the inspection and monitoring tasks but presenting the ultrasonic data in a suitable way for ML is very important. Following on from recent work presenting the development of the snooker algorithm to create images termed parameter-spaces, this paper presents how these images can be input into neural network based ML systems to automatically size these critical cracks.

A swarm based nature-inspired optimization algorithm namely fruit fly optimization algorithm (FOA) has simple structure and ease of implementation. However, FOA has a low success rate and a slow convergence because FOA generates new positions around the best location using fixed search radius. Several improved FOAs have been proposed. But their exploration ability is questionable. To make the search process to transit from the exploration phase to the exploitation phase smoothly, this paper proposes a new FOA constructed from a cooperation of the multileader and the probabilistic random walk strategies (CPFOA). It has two population types working together. CPFOA's performance is evaluated by 18 well-known standard benchmark, and 30 CEC’2017 functions. The results showed that CPFOA outperforms both the original FOA and its variants in terms of convergence speed and performance accuracy. The results base on CEC’2017 show that CPFOA can achieve a very promising accuracy when compared with the well-known competitive algorithms. CPFOA is applied to optimize two applications; the MLPs classifying real datasets and extracting parameters of T-S fuzzy system for modelling Box and Jenkins gas furnace data set. CPFOA can find parameters having a very high quality compared with the best known competitive algorithms.

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.

We extend Ziv and Lempel's model of finite-state encoders to the realm of lossy compression of individual sequences. In particular, the model of the encoder includes a finite-state reconstruction codebook followed by an information lossless finite-state encoder that compresses the reconstruction codeword with no additional distortion. We first derive two different lower bounds to the compression ratio that depend on the number of states of the lossless encoder. Both bounds are asymptotically achievable by conceptually simple coding schemes. We then show that when the number of states of the lossless encoder is large enough in terms of the reconstruction block-length, the performance can be improved, sometimes significantly so. In particular, the improved performance is achievable using a random-coding ensemble that is universal, not only in terms of the source sequence, but also in terms of the distortion measure.

Material Extrusion is a popular additive manufacturing technology due to its low cost, wide market availability, ability to construct complex parts, safety, and cleanliness. However, optimizing the process parameters to obtain the best possible mechanical properties has not been extensively studied. This paper aims to develop ensemble learning-based models to predict the ultimate tensile strength, Young's modulus, and strain at break of PLA and PLA-CF 3D-printed parts, using printing temperature, printing speed, and layer thickness as process parameters. Additionally, the study investigates the impact of process parameters and material selection on the mechanical properties of the printed parts and uses Genetic Algorithms for multi-objective optimization according to user specifications. The results indicate that process parameters and material selection significantly influence the mechanical properties of the printed parts. The Genetic Algorithm successfully identifies optimal parameter values for the desired mechanical properties. Moreover, this work is the first to model Process-Structure-Properties relationships for an additive manufacturing process and to use a multi-objective optimization approach for multiple mechanical properties, utilizing ensemble learning-based algorithms and Genetic Algorithms.

Researchers are always looking to find ways to use energy more efficiently while keeping people comfortable at home. They've tried different methods like fuzzy logic and genetic algorithms to do this. In this paper, we introduce a novel model that combines different techniques like data smoothing, optimization, machine learning, and control algorithms to reach this goal in smart homes. The proposed model is made up of three main parts: smoothing, optimization, and control. The smoothing part uses the Kalman filter to get rid of any unnecessary noise and make sure the data used to predict energy use is clean and smooth. The optimization part uses both genetic with firefly algorithms and artificial neural networks to minimize the gap between the actual environmental conditions and the conditions users find comfortable. It adjusts the comfort settings in real-time using machine learning. The control part uses Mamdani fuzzy logic to make sure energy is delivered in the best way possible to the systems that control temperature, lighting, etc., making the home comfortable and saving energy at the same time. Comparative analyses demonstrate the superiority of the proposed model over existing algorithms, including the Particle Swarm Optimization (PSO) algorithm. Additionally, the paper discusses the importance of adaptive controllers in addressing issues associated with incorrect PID controller selection and highlights the benefits of using the FA-GA in energy optimization and comfort improvement. Overall, the proposed model offers an effective solution for efficient energy consumption optimization and enhanced user comfort in diverse settings through the integration of advanced algorithms and optimization modules.

The fast and reliable processing of medical images is of paramount importance to adequately generate data to feed machine learning algorithms that can prevent and diagnose health issues. Here we benchmark different compressed sensing techniques applied to magnetic resonance imaging as a means to reduce the acquisition time spent in the collection of data and signals that form the image. We show that by using these techniques, it is possible to reduce the number of signals needed and, therefore, substantially decrease the time to acquire the measurements. To this end, we have considered and compared different algorithms: the Iterative Re-Weighted Least Squares, the Iterative Soft Thresholding Algorithm, the Iterative Hard Thresholding Algorithm, the Primal Dual Algorithm and the Log-Barrier Algorithm. We have implemented such algorithms in different analysis programs that have been used to perform the reconstruction of the images and found that the Iterative Soft Thresholding Algorithm gives the optimal results. We found that the images obtained with this algorithm have less quality than the original ones, but the quality is good enough to distinguish each body structure and detect any health problems.

In this brief paper a quantum algorithm to calculate the Hamming distance of two binary strings of equal length (or messages in theory information) is presented. The algorithm calculates the Hamming weight of two binary strings in one query of an oracle. To calculate the hamming distance of these two strings we only have to calculate the Hamming weight of the xor operation of both strings. To test the algorithms the quantum computer prototype that IBM has given open access to on the cloud has been used to test the results.

A three-phase multilevel inverter (MLI) synthesized with 31-levels in the output voltage is used to provide ac supply to a three-phase, squirrel-cage induction motor. The gating angles required for thirty power switches in MLI are optimized by both Genetic Algorithm (GA) and Gray Wolf Op-timization (GWO). In the optimization technique, the optimal angles are determined by solving the trigonometric equations from the Fourier analysis for targeting minimum total harmonic distortion (THD) at the MLI output. Simulation model and experimental prototype are developed for performance analysis and validation. The results obtained demonstrate that the MLI is effec-tively able to produce 31-levels of three-phase ac output voltages with THD not exceeding 5% when loaded with a resistive load and a three-phase induction motor. The voltages and currents are measured and recorded for different loads and operating conditions, including the amount of energy consumed by the loads, as well as frequency analysis, which shows the absence of most of the triple harmonics that have a negative impact on the efficiency of the inverter.

Upper confidence bound multi-armed bandit algorithms (UCB) typically rely on concentration in- equalities (such as Hoeffding’s inequality) for the creation of the upper confidence bound. Intu- itively, the tighter the bound is, the more likely the respective arm is or isn’t judged appropriately for selection. Hence we derive and utilise an optimal inequality. Usually the sample mean (and sometimes the sample variance) of previous rewards are the information which are used in the bounds which drive the algorithm, but intuitively the more infor- mation that taken from the previous rewards, the tighter the bound could be. Hence our inequality explicitly considers the values of each and every past reward into the upper bound expression which drives the method. We show how this UCB method fits into the broader scope of other information theoretic UCB algorithms, but unlike them is free from assumptions about the distribution of the data, We conclude by reporting some already established regret information, and give some numerical simulations to demonstrate the method’s effectiveness.

The agricultural sector in Palestine has a significant role in its economy. However, the production of this sector is affected by different kinds of plant diseases, specifically leaf diseases. Automatic agricultural leaf disease detection is essential for the early diagnosis and controls the overall health of fields. Image segmentation techniques, clustering, and deep learning are often used to detect diseased leaves. This study proposes a novel hybrid approach based on image classification. The hybrid approach combines the k-means clustering algorithm with Convolutional Neural Network (CNN), where k-means is used to detect the leaf’s infected area, then CNN is used for specifying the disease. We used the PlantVillage dataset for experimental verification as it contains several crops with different kinds of challenging diseases. We also examined the selection of optimal k-value using the Silhouette coefficient, Elbow method, and Kneedle Algorithm. The Silhouette technique was analyzed using three distance metrics; Euclidean, Manhattan, and Cosine. Its scores for the three-distance metrics were low, near-zero, and failed to produce the optimum k value. Besides, the Elbow method was complicated to use in image segmentation in terms of executing and visualizing the k value in its graph plot. Based on verification results, the Kneedle Algorithm produced better results in the consistency of choosing the optimal k value and showed superiority over other approaches. Therefore, the processed images were segmented with the k-means clustering algorithm with a Kneedle algorithm-based k value. Finally, a Convolutional Neural Network (CNN) is trained to classify the type of disease based on analyzing and testing leaf images. The hybrid model achieved high accuracy of 93.79% in disease identification, confirming the proposed model’s robustness.

Wireless Sensor Networks are critical for modern applications ranging from environmental monitoring to smart city infrastructures. This research proposes a novel optimization learning and deployment strategy for Wireless Sensor Networks (WSNs) by 3D WUSN model is uniformly distributed M sensor nodes across diverse terrains, with clusters representing 20% of sensors, showcasing its ability to balance power consumption and extend network longevity, grounded in fuzzy clustering based protocol using the Fuzzy C-Means (FCM) method, called FCM-3DWUSN. Comparative analysis against established models including LEACH-C, K-Means and LEACH emphasized FCM-3DWUSN's outperformed performance, with average power consumption such as 134.990, 341.790, 143.895, and 192.984; respectively. The experimental result shows that FCM protocol in the 3D WUSN model can reduce energy consumption and improve the network lifetime to gather data and send the information.

：An effective technology for predicting the end-point phosphorous content of basic oxygen furnace (BOF) can provide theoretical instruction to improve the quality of steel via controlling the hardness and toughness. Given the slightly inadequate prediction accuracy in the existing prediction model, a novel hybrid method was suggested to more accurately predict the end-point phosphorus content by integrating an enhanced sparrow search algorithm (ESSA) and a multi-strategy with a deep extreme learning machine (DELM) as ESSA-DELM in this study. To begin with, the input weights and hidden biases of DELM were randomly selected, resulting in that DELM inevitably had a set of non-optimal or unnecessary weights and biases. Therefore, the ESSA was used to optimize the DELM in this work. For the ESSA, the Trigonometric substitution mechanism and Cauchy mutation were introduced to avoid trapping in local optima and improve the global exploration capacity in SSA. Finally, to evaluate the prediction efficiency of ESSSA-DELM, the proposed model was tested on process data of the converter from the Baogang steel plant. The efficacy of ESSA-DELM was more superior to that of other DELM-based hybrid prediction models and conventional models. The result demonstrated that the hit rate of end-point phosphorus content within ±0.003%, ±0.002%, and ±0.001% was 91.67%, 83.33%, and 63.55%, respectively. The proposed ESSA-DELM model could possess better prediction accuracy compared with other models, which could guide field operations.

The paper proves that an odd composite integer $N$ can be factorized in at most $O( 0.125u(log_2N)^2)$ searching steps if $N$ has a divisor of the form $2^a{u} +1$ or $2^a{u}-1$ with $a > 1$ being a positive integer and $u > 1$ being an odd integer. Theorems and corollaries are proved with detail mathematical reasoning. Algorithms to factorize the kind of odd composite integers are designed and tested by factoring certain Fermat numbers. The results in the paper are helpful to factorize the related kind of odd integers as well as some big Fermat numbers

In a complex working environment, the fault signal of the gearbox is greatly affected by the outside world, and fault feature recognition is difficult, so the fault diagnosis accuracy is difficult to meet the expected requirements. To solve this problem, this paper proposes a gearbox fault diagnosis method based on an optimized stacked denoising auto encoder (SDAE) and kernel extreme learning machine (KELM). Firstly, the Particle Swarm Optimization algorithm in Adaptive Weight (SAPSO) was adopted to optimize the SDAE network structure, and the number of hidden layer nodes, learning rate, noise addition ratio and iteration times were adaptively obtained to make SDAE obtain the best network structure. Then, the best SDAE network structure was used to extract the deep feature information of weak faults in the original signal. Finally, the extracted fault features are fed into KELM for fault classification. Experimental results show that, compared with existing commonly used methods of fault diagnosis, the fault diagnosis model proposed in this paper can reduce the influence of noise in the original signal can better learn the deep-level features in the original signal and has higher diagnosis accuracy, faster diagnosis speed and good generalization in fault diagnosis.

Precipitation type is a key parameter used for better retrieval of precipitation characteristics as well as to understand the cloud-convection-precipitation coupling processes. Ice crystals and water droplets inherently exhibit different characteristics in different precipitation regimes (e.g., convection, stratiform), which reflect on satellite remote sensing measurements that help us distinguish them. The Global Precipitation Measurement (GPM) Core Observatory’s Microwave Imager (GMI) and Dual-Frequency Precipitation Radar (DPR) together provide ample information on global precipitation characteristics. As an active sensor, DPR provides an accurate precipitation type assignment, while passive sensors like GMI are traditionally only used for empirical understanding of precipitation regimes. Using collocated precipitation type flags from DPR as the “truth”, this paper employs machine learning (ML) models to train and test the predictability and accuracy of using passive GMI-only observations together with ancillary information from reanalysis and GMI surface emissivity retrieval products. Out of six ML models, four simple ones (Support Vector Machine, Neural Network, Random Forest, and Gradient Boosting) and the 1-D convolutional neural network (CNN) model are identified to produce 90% - 94% prediction accuracy globally for 5 types of precipitation (convective, stratiform, mixture, no precipitation, and other precipitation), which is much more robust than previous similar effort. One novelty of this work is to introduce data augmentation (subsampling and bootstrapping) to handle extremely unbalanced samples in each category. Careful evaluation of Impact matrices demonstrate that polarization difference (PD) and surface emissivity at high-frequency channels dominate the decision process, which are consistent with the physical understanding of polarized microwave radiative transfer over different surface types, as well as in snow and liquid clouds with different microphysical properties. Furthermore, the view-angle dependency artifact that DPR precipitation flag bears with does not propagate into the conical-viewing GMI retrievals. This work provides a new and promising way for future physics-based ML retrieval algorithm development.

Remaining service life (RSL) of pavement, as a sign of future pavement performance, has always received growing attention from pavement engineers. The RSL describes the time from the moment of pavement inspection until such a time when a major repair or reconstruction is required. The conventional approach to determining RSL involves using non-destructive tests. These tests, in addition to being costly, interfere with traffic flow and compromise users' safety. In this paper, surface distresses of pavement have been used to estimate the pavement’s RSL in order to eliminate the aforementioned problems and challenges. To implement the proposed theory, 105 flexible pavement segments were taken from Shahrood-Damghan Highway (Highway 44) in Iran. For each pavement segment, the type, severity, and extent of surface damage and pavement condition index (PCI) were determined. The pavement RSL was then estimated using non-destructive tests include Falling Weight Deflectometer (FWD) and Ground Penetrating Radar (GPR). After completing the dataset, the modeling was conducted to predict RSL using three techniques include Support Vector Regression (SVR), Support Vector Regression Optimized by Fruit Fly Optimization Algorithm (SVR-FOA), and Gene Expression Programming (GEP). All three techniques estimated the RSL of the pavement by selecting the PCI as input. The Correlation Coefficient (CC), Nash-Sutcliffe efficiency (NSE), Scattered Index (SI), and Willmott’s Index of agreement (WI) criteria were used to examine the performance of the three techniques adopted in this study. In the end, it was found that GEP with values of 0.874, 0.598, 0.601, and 0.807 for CC, SI, NSE, and WI criteria, respectively, had the highest accuracy in predicting the RSL of pavement.

It is difficult to capture the real-time online measurement data for biochemical oxygen demand (BOD) in wastewater treatment processes. An optimized extreme learning machine (ELM) based on an improved cuckoo search algorithm (ICS) is proposed in this paper for the design of soft BOD measurement model. In ICS-ELM, the input weights matrices of the extreme learning machine (ELM) and the threshold of the hidden layer are encoded as the cuckoo's nest locations. The best input weights matrices and threshold are obtained by using the strong global search ability of improved cuckoo search (ICS) algorithm. The optimal results can be used to improve the precision of forecasting based on less number of neurons of the hidden layer in ELM. Simulation results show that the soft sensor model has good real-time performance, high prediction accuracy and stronger generalization performance for BOD measurement of the effluent quality compared to other modeling methods such as back propagation (BP) network in most cases.

This paper introduces the implementation of a genetic programming (GP)-based procedure to the automatic design and tuning of process controllers. The proposed approach makes a significant contribution to the field of artificial intelligence (AI) in control engineering. Unlike other controller design methods, the GP-based program handles the entire design in the time domain, including differential operations like derivatives and integrals, without the need for intermediate inverse Laplace transformation. This approach not only simplifies the design process but also ensures that all generated controllers are implementable in physical systems. Furthermore, GP’s functions set includes various mathematical operations beyond basic arithmetic operators, such as trigonometric, exponential, and logarithmic operators. The performance and validity of the resulting controllers generated by the proposed GP-based approach are evaluated by verifying whether the generator can replicate the structure and performance of those produced by traditional controller design methods and, in some cases, achieve even better results. As a result, the GP-based approach presents a promising solution for automating the controller design process and addressing control problems in various engineering applications.

This research emphasizes a meta-heuristic Modified Ant Lion Optimizer (MALO) optimization approach for simultaneous utilization of DSTATCOM devices and distributed Photovoltaic (PV) sources with network reconfiguration in a radial power distribution scheme. In a radial power distribution network with network reconfiguration majority of the research is based on Constant Power model analysis. However, it is noticed that load models have a substantial impact on the distributed PV sources and the D-STATCOM device's optimal size and position. The effect of the Constant Power (CP) and Polynomial (ZIP) with load growth load models for the simultaneous insertion of distributed PV sources and DSTATCOM devices with network reconfiguration examined in this research work for power system planning. The penetration levels of distributed PV sources considered for the investigation are 25%, 50%, 75%, and 100%. The principal objective of this research is to reduce network total power losses, enhance the voltage magnitude profile at all buses, and reduce the overall operating cost while adhering to equality and inequality constraints. The proposed algorithm verified on 118-node test systems. The investigation is carried out for planning network upgradation to a High Voltage Distribution System(HVDS) on 317 nodes in the rural Bangalore Electricity Supply Company Limited(BESCOM) radial distribution scheme. Simulated results obtained by this method are validated with the BAT algorithm and available techniques in the literature.

In this paper, we first discuss the research status and application progress of the finite element method and the smoothed particle method. By analyzing the advantages of the smoothed particle method and the finite element method, a new coupling algorithm, namely FEM-SPH algorithm, is proposed. By the method of comparison, it shows that finite element method and SPH method in the simulation of large deformation problems each have advantages and disadvantages, the finite element method smoothed particle coupling algorithm is effective to achieve the performance of high computational efficiency and can naturally simulate large deformation problems across. In the process of calculation, the large deformation unit can be freely into an algorithm to facilitate the calculation accuracy and efficiency of three methods of numerical simulation. Through the study found, FEM-SPH algorithm not only overcome the defect of smooth particle tensile instability, but also overcomes the problem of low efficiency of finite element computation. To further test the FEM-SPH algorithm has advantages in the practical engineering, we have carried out the actual test to the example of the super high speed collision, concluded that, since the target of most of the computational domain is always finite element, smoothed particle focused only in contact with the projectile and target of local area, particle number is not much, the whole calculation process just ten minutes, computational efficiency has been greatly improved, at the same time in the simulation of large deformation, the advantage is very obvious .This provides a criterion for the actual project, depending on the specific material deformation mode and choose a more appropriate conversion algorithm.

An acrobot is a planar robot with a passive actuator in its first joint. The control problem of the acrobot tries to make it rise from the rest position to the inverted pendulum position. This control problem can be divided in the swing-up problem, when the robot has to rise itself through swinging up as a human acrobat does, and the balancing problem, when the robot has to maintain itself on the inverted pendulum position. We have developed three controllers for the swing-up problem applied to two types of motors: small and big. For small motors, we used the SARSA controller and the PD with a trajectory generator. For big motors, we propose a new controller to control the acrobot, a PWM controller. All controllers except SARSA are tuned using a Genetic Algorithm.

The fourth Industrial Revolution, well-known as “Industry 4.0”, based on the integration of information and communication technologies, has introduced significant improvements in manufacturing. However, vision systems still experience various impracticalities in dealing with the effect of complex lighting on the systems platform. Therefore, a machine vision system for automatic identification of pen parts under varying lighting conditions at a digital learning factory is proposed. The developed vision system presents a straightforward approach by effectively minimizing the environmental lighting effect on the identification process. First, the obtained information of the designed vision framework is exported to a program, where a reduction of non-uniform illumination is achieved through the implementation of Retinex image enhancement techniques. Then, the color-based Fuzzy C-means (FCM) algorithm, including improved mark watershed segmentation, is employed for pen parts object classification. Finally, the position features of the selected pen part are reported. The process applied to a total number of 210 upper pen parts (caps) and 241 lower pen parts (tubes) images under different lighting scenarios. Results indicate that average parts identification precision for cap and tube parts is different and equals to 98.64% and 95.26%, respectively. The present methodology provides a promising scheme that can be feasibly adapted for other industrial Color-based object recognition applications.

Since the discovery of graphene, due to its excellent optical, thermal, mechanical and electrical properties, it has a broad application prospect in energy, materials, biomedicine, electromagnetism and other fields. A great quantity of researches on the physical mechanism of graphene has been applied to engineering in electromagnetism and optics. To study the properties of graphene, different kinds of numerical methods have been developed for simulating the electromagnetic field effects of graphene, and equivalent boundary conditions have been employed to replace graphene in the computational domain. In this work, the numerical methods with equivalent boundary conditions are reviewed, and some examples are provided to illustrate their applicability.

Selecting a feature in data mining is one of the most challenging and important activities in pattern recognition. The issue of feature selection is to find the most important subset of the main features in a specific domain, the main purpose of which is to remove additional or unrelated features and ultimately improve the accuracy of the categorization algorithms. As a result, the issue of feature selection can be considered as an optimization problem and to solve it, meta-innovative algorithms can be used. In this paper, a new hybrid model with a combination of whale optimization algorithms and flower pollination algorithms is presented to address the problem of feature selection based on the concept of opposition-based learning. In the proposed method, we tried to solve the problem of optimization of feature selection by using natural processes of whale optimization and flower pollination algorithms, and on the other hand, we used opposition-based learning method to ensure the convergence speed and accuracy of the proposed algorithm. In fact, in the proposed method, the whale optimization algorithm uses the bait siege process, bubble attack method and bait search, creates solutions in its search space and tries to improve the solutions to the feature selection problem, and along with this algorithm, Flower pollination algorithm with two national and local search processes improves the solution of the problem selection feature in contrasting solutions with the whale optimization algorithm. In fact, we used both search space solutions and contrasting search space solutions, all possible solutions to the feature selection problem. To evaluate the performance of the proposed algorithm, experiments are performed in two stages. In the first phase, experiments were performed on 10 sets of data selection features from the UCI data repository. In the second step, we tried to test the performance of the proposed algorithm by detecting spam emails. The results obtained from the first step show that the proposed algorithm, by running on 10 UCI data sets, has been able to be more successful in terms of average selection size and classification accuracy than other basic meta-heuristic algorithms. Also, the results obtained from the second step show that the proposed algorithm has been able to perform spam emails more accurately than other similar algorithms in terms of accuracy by detecting spam emails.

Abstract: Imaging devices of less than 300,000 pixels are mostly used for sewage conduit exploration due to the petty nature of the survey industry in Korea. P articular ly , devices of less than 100,000 pixels are still widely used, and the environment for image processing is very bitter . Since the sewage conduit image s covered in this study ha ve a very low resolution (240 × 320 = 76,800 pixels), it is very difficult to detect cracks. Because most of the resolution of the sewe r conduit images are very low in Korea, this problem of low resolution was selected as the subject of study. Cracks were detected through a total of six steps of improving the crack in Step 2, finding the optimal threshold value in Step 3, and applying an algorithm to detect cracks in Step 5. Cracks were effectively detected by the optimal parameters in Steps 2 and 3 and the user algorithm in Step 5. Desp ite the very low resolution, the cracked image s showed 96.4% accuracy of detection, and the non cracked image s showed 94.5% accuracy . Moreover, the analysis was excellent in quality , also . It is believed that the findings of this study can be effectively u sed for crack detection with low resolution images.

Fetal weight estimation before delivery is important in obstetrics, which assists doctors diagnose abnormal or diseased cases. Linear regression based on ultrasound measures such as bi-parietal diameter (bpd), head circumference (hc), abdominal circumference (ac), and fetal length (fl) is common statistical method for weight estimation but the regression model requires that time points of collecting such measures must not be too far from last ultrasound scans. Therefore this research proposes a method of early weight estimation based on expectation maximization (EM) algorithm so that ultrasound measures can be taken at any time points in gestational period. In other words, gestational sample can lack some or many fetus weights, which gives facilities to practitioners because practitioners need not concern fetus weights when taking ultrasound examinations. The proposed method is called dual regression expectation maximization (DREM) algorithm. Experimental results indicate that accuracy of DREM decreases insignificantly when completion of ultrasound sample decreases significantly. So it is proved that DREM withstands missing values in incomplete sample or sparse sample.

We designed a bidirectional reflection distribution function (BRDF) measurement system to research the characteristics of space target materials. This system measures the BRDF data of an aluminum plate and gold foil. A hybrid biogeography-based optimization-firefly (BBO-Firefly) algorithm was proposed to optimize the five-parameter BRDF model. To check the performance of the hybrid BBO-Firefly algorithm, we set up a contrast experiment to optimize the BRDF parameters using the BBO algorithm, Firefly algorithm, and hybrid BBO-Firefly algorithm. The experimental results prove that the hybrid BBO-Firefly algorithm surpasses the BBO algorithm and Firefly algorithm in convergence speed and precision in the same situation and has a better optimization effect. Finally, we substitute the optimization results of the hybrid BPO-Firefly algorithm into the BRDF model to analyze the reflection characteristics of an aluminum plate and gold foil.

Among the various complex systems that we experience each day, there is the physical phenomenon of infiltration. Infiltration is considered as the dynamics of water flow in the subsurface soil that in this work is framed for the context of civil construction. This issue is approached with the use of mathematical models and stochastic techniques, however, there are hardships in collecting the samples in the field, the adoption of a scale type, the influence in soil layers interfaces, the effects of soil anisotropic characteristics and so on. In this study, methodology is proposed to deal with the soil sampling input such as the retro model, constitutive model and optimization algorithms. Additionally, an automatic calibration is set forth to fix parameters from the mathematical model submitted. Especially among the existing Optimization Algorithms there are Genetic Algorithms and the Generalized Simulated Annealing Algorithm (GSA). This work presents an overview of these optimization methods and a proposal for a more efficient and faster algorithm called GSA-HYBRID based on convergence gradient technique. The applied strategy depends on the type of case study considering its physical properties and constraints. In this sense, it is found that while Genetic Algorithms are able to replicate the optimization surface, Generalized Simulated Annealing is much more adequate in characterizing the system at an extremely low computational cost. Nevertheless, the hybrid technique GSA-HYBRID performed the fastest. Further research is necessary to implement the novel GSA-HYBRID algorithm due to its flexibility and higher speed, also, studying its application at different case studies.

Objectives: Few studies have evaluated and compared artificial intelligence (AI) models for breast cancer detection on the same database. The purpose is to compare the performances of 3 artificial intelligence algorithms on the same dataset at a free operative threshold and to evaluate how the performance is impacted by the chosen threshold. Materials: In this retrospective single-center study, a dataset of 314 2D screening mammograms performed between 2012 and 2020 was established with a prevalence of 19.6% of histologically proven cancer. Three AI constructors using CE (European conformity) marking algorithms have agreed to take part in the study by submitting the cancer-enriched cohort to their algorithm. They chose a free operative threshold to distinguish benign and malignant mammograms. The most suspicious lesion was marked and correctly located by the AI algorithm. Statistical parameters were analyzed and compared between the algorithms. Results: Regarding both sensitivity and specificity, at the chosen threshold, AI 1 had the best compromise between sensitivity (74%) and specificity (79%). AI 2 had a statistically lower sensitivity (52%; p<0.05) with a higher specificity (98.4%) than the other AI algorithms. AI 3 had a nonsignificant sensitivity difference (69.9%) but a significantly lower specificity (45.3%; p<0.001) than the other two. The performances varied depending on the chosen threshold; when the AI 2 threshold was lowered, the sensitivity increased (69.9%), while a higher specificity (86.1%) was maintained. Conclusion: Two AI algorithms stood out in terms of performance when the threshold was optimized, resulting in an acceptable sensitivity and specificity.

There are some limitations in the null test measurement in the stitching interferometry. In order to meet the null test conditions, the moving distance between the sub-apertures often deviates from the theoretical preset distance, which leads to a position deviation of sub-apertures under measurements. To overcome this problem, an algorithm for data processing is proposed. We used iterative calculation of the deviations between the sub-apertures to adjust their positions, to ensure the local validity of the linear approximation algorithm and realize the exact stitching. A cylindrical lens as an object for experimental examination of the proposed method was taken. The obtained results demonstrate the validity, reliability and feasibility of our iterative stitching algorithm.

Accurate and stable cost forecasting of substation projects is of great significance to ensure the economic construction and sustainable operation of power engineering projects. In this paper, a forecasting model based on the improved least squares support vector machine (ILSSVM) optimized by wolf pack algorithm(WPA) is proposed to improve the accuracy and stability of the cost forecasting of substation projects. Firstly, the optimal features are selected through the data inconsistency rate (DIR), which helps reduce redundant input vectors. Secondly, the wolf pack algorithm is used to optimize the parameters of the improved least square support vector machine. Lastly, the cost forecasting method of WPA-DIR-ILSSVM is established. In this paper, 88 substation projects in different regions from 2015 to 2017 are chosen to conduct the training tests to verify the validity of the model. The results indicate that the new hybrid WPA-DIR-ILSSVM model presents better accuracy, robustness and generality in cost forecasting of substation projects.

This paper presents a novel approach for individual design perception modeling using the YUKI-trained Fuzzy Inference System. The study focuses on understanding how individuals perceive design based on personality traits, particularly openness to experience. The proposed YUKI algorithm optimizes the FCM clustering algorithm, enhancing its ability to handle uncertain and imprecise data. The YUKI-trained FIS generates several Sugeno-type FIS models to predict design perception, to minimize the Root Mean Squared Error between the model prediction and the actual design perception of participants. The results demonstrate that the YUKI-trained FIS offers more accurate predictions compared to the traditional FCM-trained FIS, and the RMSE values for individual design perceptions fall within a satisfactory range of 0.84 to 1.32. The YUKI-trained FIS proves effective in clustering individuals based on their level of openness, providing insights into how personality traits influence design perception.

This study introduces an innovative optimization method to identify the optimal configuration of a sparse symmetric 2D array for applications in security, particularly multistatic imaging. Utilizing Genetic Algorithms (GA) in a sophisticated optimization process, the research focuses on achieving the most favorable antenna distribution while mitigating the common issue of secondary lobes in sparse arrays. The main objective is to determine the ideal configuration from specific design parameters, including hardware specifications such as number of radiating elements, minimum spacing, operating frequency range, and image separation distance. The study employs a cost function based on the the point spread function (PSF), the system response to a point source, with the goal of minimizing the secondary lobe levels and maximizing their separation from the main lobe. Advanced simulation algorithms based on Physical Optics (PO) are used to validate the presented methodology and results.

The Steepest Descent (or Ascent) algorithm is one of the most widely used algorithms in Science, Technology, Engineering, and Mathematics (STEM). However, this powerful mathematical tool is neither taught nor even mentioned in K12 education. We study whether it is feasible for elementary school students to learn this algorithm, while also aligning with the standard school curriculum. We also look at whether it can be used to create enriching activities connected to children’s real-life experiences, thus enhancing the integration of STEM and fostering Computational Thinking. To address these questions, we conducted an empirical study in two phases. In the first phase, we tested the feasibility with teachers. In a face-to-face professional development work-shop with 457 mathematics teachers actively participating using an online platform, we found that after a 10-minute introduction they could successfully apply the algorithm and use it in a couple of models. They were also able to complete two complex and novel tasks: selecting models and adjusting the parameters of a model that uses the steepest descent algorithm. In a second phase, we tested the feasibility with 90 fourth graders from 3 low Socioeconomic Status (SES) schools. Using the same introduction and posing the same questions, we found that they were able to understand the algorithm and successfully complete the tasks on the online platform. Additionally, we found that close to 75% of the students completed the two complex modeling tasks and performed similarly to the teachers.

The Steepest Descent (or Ascent) algorithm is one of the most widely used algorithms in Science, Technology, Engineering, and Mathematics (STEM). However, this powerful mathematical tool is neither taught nor even mentioned in K12 education. We study whether it is feasible for elementary school students to learn this algorithm, while also aligning with the standard school curriculum. We also look at whether it can be used to create enriching activities connected to children’s real-life experiences, thus enhancing the integration of STEM and fostering Computational Thinking. To address these questions, we conducted an empirical study in two phases. In the first phase, we tested the feasibility with teachers. In a face-to-face professional development work-shop with 457 mathematics teachers actively participating using an online platform, we found that after a 10-minute introduction they could successfully apply the algorithm and use it in a couple of models. They were also able to complete two complex and novel tasks: selecting models and adjusting the parameters of a model that uses the steepest descent algorithm. In a second phase, we tested the feasibility with 90 fourth graders from 3 low Socioeconomic Status (SES) schools. Using the same introduction and posing the same questions, we found that they were able to understand the algorithm and successfully complete the tasks on the online platform. Additionally, we found that close to 75% of the students completed the two complex modeling tasks and performed similarly to the teachers.

Nowadays, the selection of web services with uncertain quality of service (QoS) is gaining a lot of attention in the service-oriented computing paradigm (soc). In fact, searching for a service composition that fulfills a complex user’s request is known to be NP-Complete. The search time is mainly dependent on the number of the requested tasks, the size the available services, and the size of the QoS realizations (i.e., sample size). To handle this problem, we propose a two-stage approach that reduces the search space using heuristics for ranking the tasks’ services and a bat algorithm metaheuristic for selecting the final near optimal compositions. The fitness used by the metaheuristic aims to fulfill all the global constraints of the user. The experimental study shows that the ranking heuristics, termed “fuzzy pareto dominance” and "Zero-order stochastic dominance", are highly effective than the other heuristics and most of the existing state-of-the-art methods.

Stagnation at local optima represents a significant challenge in bio–inspired optimization algorithms, often leading to suboptimal solutions. This paper addresses this issue by proposing a hybrid model that combines the Orca Predator Algorithm with Deep Q–Learning. Orca Predator Algorithm is an optimization technique that mimics the hunting behavior of orcas. It solves complex optimization problems by exploring and exploiting search spaces efficiently. Deep Q–Learning is a reinforcement learning technique that combines Q–Learning with deep neural networks. This integration aims to turn the stagnation problem into an opportunity for more focused and effective exploitation, enhancing the optimization technique’s performance and accuracy. The proposed hybrid model leverages the biomimetic strengths of Orca Predator Algorithm to identify promising regions nearby in the search space, complemented by the fine–tuning capabilities of Deep Q–Learning to navigate these areas precisely. The practical application of this approach is evaluated using the high–dimensional Heartbeat Categorization Dataset, focusing on the feature selection problem. This dataset, comprising complex electrocardiogram signals, provided a robust platform for testing the feature selection capabilities of our hybrid model. Our experimental results are encouraging, showcasing the hybrid strategy capability to identify relevant features without significantly compromising the performance metrics of machine learning models. This analysis was performed by comparing the improved method of Orca Predator Algorithm against its native version and a set of state–of–the–art algorithms.

In this paper, we gave an attack on RSA when Euler function has small multiplicative inverse modulo "e" and the prime sum p+q is of the form p+q=2^nk_0+k_1 where n is a given positive integer and k_0 and k_1 are two suitably small unknown integers using sublattice reduction techniques and Coppersmith's methods for finding small roots of modular polynomial equations. When we compare this method with an approach using lattice based techniques, this procedure slightly improves the bound and reduces the lattice dimension.

Glioma accounts for the highest proportion of primary intracranial malignant tumors. Microenvironment enormously influences the process of glioma progression. Our study is to establish an individualized prognostic nomogram for glioma patients with microenvironment signature. Glioma samples of Chinese Glioma Genome Atlas (CGGA) were grouped by the immune and stromal score based on ESTIMATE algorithm. Microenvironment-related genes (MRGs) in glioma were analyzed by R. To determine the best prognostic correlation genes, univariate and multivariate Cox regression analysis were used to analyze MRGs. Use the selected genes (CHI3L1, SOCS3, SLC47A2, COL3A1, SRPX2 and SERPINA3), we established the prognostic risk score model (microenvironment signature) and validated it. Gene Set Enrichment Analysis (GSEA) showed that the high-risk group was mainly enriched in immune and stromal function KEGG pathways. Finally, the nomogram was constructed and evaluated. The receiver operating characteristic (ROC) curve, Calibration plots and decision curve analysis (DCA) of training and validation set indicated the excellent predictive performance of nomogram. In conclusion, the 6-gene microenvironment signature can not only provide directions for the basic research of glioma, but also can be included as an independent prognostic index in nomogram for individual prediction to guide clinical treatment.

This paper proposed a damping method for enhancing oscillatory stability performance of power systems with high penetration of renewable energy by a resilient wide-area multi-mode controller. The resilient wide-area multi-mode controller is used as an additional controller in a renewable energy system with a battery energy storage to enhance the damping of the critically weak modes. The weak modes are likely to be triggered in the event of line outages or any other disturbances, and the system may become unstable in the absence of proper corrective and preventive control. A firefly algorithm has been employed to design such a controller. Eigenvalue analysis and time-domain simulation are used to analyze the performance of the proposed controller in a realistic representative power system. From the simulation results, it is evident that the oscillatory stability performance of the renewable rich power system can be enhanced with the proposed control to keep the damping on critical modes to the industrial standards. Furthermore, renewable energy penetration can be increased significantly in the realistic representative system by introducing the proposed controller without disturbing the oscillatory stability margin.

In order to coordinate the damping performance and energy regenerative performance of energy regenerative suspension, this paper proposes a structure of vehicle semi-active energy regenerative suspension with electro-hydraulic actuator (EHA). In light of the proposed concept, a specific energy regenerative scheme is designed and the mechanical properties test is carried out. Based on the test results, the parameter identification for the system model is conducted using recursive least squares algorithm. On the basis of system principle, the nonlinear model of the semi-active energy regenerative suspension with EHA is built. Meanwhile, LQG control strategy of the system is designed. And then the influence of the main parameters of EHA on the damping performance and energy regenerative performance of suspension is analyzed. Finally, the main parameters of EHA actuator are optimized via genetic algorithm. The test results show that when sinusoidal is input at the frequency of 2Hz and the amplitude of 30mm, the spring mass acceleration RMS value of optimized EHA semi-active energy regenerative suspension is reduced by 22.23% and energy regenerative power RMS value is increased by 40.51%, which means while meeting the requirements of certain vehicle ride comfort and driving safety, energy regenerative performance is improved significantly.

The market for microfluidic chips is experiencing significant growth; however, their development is hindered by a complex design process and low efficiency. Enhancing microfluidic chips’ design quality and efficiency has emerged as an integral approach to foster their advancement. Currently, the existing structural design schemes lack careful consideration regarding the impact of chip area, microchannel length, and the number of intersections on chip design. This inadequacy leads to redundant chip structures resulting from the separation of layout and wiring design. This study proposes a structural optimization method for microfluidic chips to address these issues utilizing a simulated annealing algorithm. The simulated annealing algorithm generates an initial solution in advance using the fast sequence pair algorithm. Subsequently, an improved simulated annealing algorithm is employed to obtain the optimal solution for the device layout. During the wiring stage, an advanced wiring method is used to designate the high wiring area, thereby increasing the success rate of microfluidic chip wiring. Furthermore, the connection between layout and routing is reinforced through an improved layout adjustment method, which reduces the length of microchannels and the number of intersections. Finally, the effectiveness of the structural optimization approach is validated through six sets of test cases, successfully achieving the objective of enhancing the design quality of microfluidic chips.

SOC stock (SOCS) changes caused by land use changes are still unclear, and understanding this response is essential for many environmental policies and land management practices. In this study, we investigated the temporal-spatial and vertical distribution characteristics of SOCS on the Western Sichuan Plateau (WSP) using the sparrow search algorithm-random forest regression (SSA-RFR) models with excellent model applicability and accuracy. The temporal-spatial varia-tions in the SOCS were modeled using 1080 soil samples and a set of nine environmental covariates. We analyzed the effect of land use changes on the SOCS on the WSP. The total SOCS increased by 18.03 Tg C from 1990 to 2020. The results of this study confirmed that the SOCS in the study area has increased significantly since 2010, with an increase of 27.88 Tg C compared to the total SOCS in 2010. We found that the spatial distribution of the SOCS increased from southeast to northwest, and the vertical distribution of the SOCS in the study area decreased with increasing soil depth. Forest and grassland are the main sources of SOCS, the total SOCS in the forest and grassland accounted for 37.53 and 59.39% of the total SOC pool in 2020, respectively. Expansion of the wetlands, forest, and grassland areas could increase SOCS in the study area.

Sequence analysis program is outlined that analyzes and investigates homology between various nucleic acid or protein sequence. The dot matrix technique compares the sequences and the consensus sequence is obtained by superimposing on each other all the dot matrices. Local Alignment and Global Alignment both sequence from start to end is the best possible alignment over the entire duration between the two sequences. This method is more important to align with two closely related sequences roughly the same length. This method may not able to generate optimal results for divergent sequences and variable length sequence because between the two sequences it does not recognize very similar local region.

The k-means is one of the most popular and widely used clustering algorithm, however, it is limited to only numeric data. The k-prototypes algorithm is one of the famous algorithms for dealing with both numeric and categorical data. However, there have been no studies to accelerate k-prototypes algorithm. In this paper, we propose a new fast k-prototypes algorithm that gives the same answer as original k-prototypes. The proposed algorithm avoids distance computations using partial distance computation. Our k-prototypes algorithm finds minimum distance without distance computations of all attributes between an object and a cluster center, which allows it to reduce time complexity. A partial distance computation uses a fact that a value of the maximum difference between two categorical attributes is 1 during distance computations. If data objects have m categorical attributes, maximum difference of categorical attributes between an object and a cluster center is m. Our algorithm first computes distance with only numeric attributes. If a difference of the minimum distance and the second smallest with numeric attributes is higher than m, we can find minimum distance between an object and a cluster center without distance computations of categorical attributes. The experimental shows proposed k-prototypes algorithm improves computational performance than original k-prototypes algorithm in our dataset.

We consider the problem of scheduling $n$ jobs with identical processing times and given release as well as delivery times on $m$ uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job. This problem is well-known to have an open complexity status even if the number of jobs is fixed. We present a polynomial-time algorithm for the problem which is based on the earlier introduced algorithmic framework blesscmore (``branch less and cut more''). We extend the analysis of the so-called behavior alternatives developed earlier for the version of the problem with identical parallel machines and show how the earlier used technique for identical machines can be extended to the uniform machine environment if a special condition on the job parameters is imposed. The time complexity of the proposed algorithm is $O(\gamma m^2 n\log n)$, where $\gamma$ can be either $n$ or the maximum job delivery time $q_{\max}$. This complexity can even be reduced further by using a smaller number $\kappa<n$ in the estimation describing the number of jobs of particular types. However, this number $\kappa$ becomes only known when the algorithm has terminated.

Modern power system integrates more and more new energy and use a large number of power electronic equipment. This makes it face more challenges in online optimization and real-time control. Deep reinforcement learning(DRL) has the ability of processing big data and high-dimensional features, as well as the ability of independently learning and optimizing decision-making in complex environments. In this paper, we explore DRL based online combination optimization method of grid section for large complex power system. In our method, to improve the convergence speed of the model, we propose to discretize the output action of the unit and simplify the action space. We also design a reinforcement learning loss function with strong constraints to further improve the convergence speed of the model and facilitate the algorithm to obtain the stable solution. Moreover, to avoid the local optimal solution problem caused by the discretization of the output action, we propose to use the annealing optimization algorithm to make the granularity of the unit output finer. We verify our method on IEEE 118-bus system. The experimental results show that our model has fast convergence speed and better performance, and can obtain stable solutions.

Nowadays industrial dryers are used instead of traditional methods for drying. In designing dryers suitable for controlling the process of drying and reaching a high quality product, it is necessary to predict the instantaneous moisture loss during drying. For this purpose, ten mathematical-experimental models with a neural network model based on the kinetic data of pistachio drying are studied. The data obtained from the cabinet dryer will be evaluated at four temperatures of inlet air and different air velocities. The pistachio seeds will be placed in a thin layer on an aluminum sheet on a drying tray and weighed by a scale attached to the computer at different times. In the neural network, data are divided into three parts: educational (60%), validation (20%) and test (20%). Finally, the best mathematical-experimental model using genetic algorithm and the best neural network structure for predicting instantaneous moisture are selected based on the least squared error and the highest correlation coefficient.

In the field of maneuvering target tracking, the combined observations of azimuth and Doppler may cause weak observation or non-observation in the application of traditional target tracking algorithms. Additionally, traditional target-tracking algorithms require pre-defined multiple mathematical models to accurately capture the complex motion states of targets, while model mismatch and unavoidable measurement noise lead to significant errors in target state prediction. To address those above challenges, in recent years, the target-tracking algorithms based on neural networks, such as recurrent neural networks (RNNs), long short-term memory (LSTM) networks, and Transformer architectures, have been widely used for their unique advantages to achieve accurate predictions. To better model the nonlinear relationship between the observation time series and the target state time series, as well as the contextual relationship among time series points, we present a deep learning algorithm called recursive downsample-convolve-interact neural network (RDCINN) based on convolutional neural network (CNN) that downsamples time series into sub-sequences and extracts multi-resolution features to enable the modeling of complex relationships between time series, which overcomes the shortcomings of traditional target-tracking algorithms in using observation information inefficiently due to weak observation or non-observation. The experimental results show that our algorithm outperforms other existing algorithms in the scenario of strong maneuvering target tracking with the combined observations of azimuth and Doppler.

We generate numerically on a lattice an ensemble of stationary metrics, with spherical symmetry, which have Einstein action S_E « ħ. This is obtained through a Metropolis algorithm with weight exp(-β²S_E²) and β » ħ^-1. The squared action in the exponential allows to circumvene the problem of the non-positivity of S_E. The discretized metrics obtained exhibit a spontaneous polarization in regions of positive and negative scalar curvature. We compare this ensemble with a class of continuous metrics previously found, which satisfy the condition S_E=0 exactly, or in certain cases even the stronger condition R(x)=0 for any x. All these gravitational field configurations are of considerable interest in quantum gravity, because they represent possible vacuum fluctuations and are markedly different from Wheeler's ''spacetime foam''.

Evolutionary 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 evolutionary algorithms, careful considerations must be made to select appropriate algorithms due to the availability of various algorithmic variations. The author previously reported experimental evaluations on Evolution Strategy for reinforcement learning of neural networks, utilizing the Acrobot control task. In this study, Genetic Algorithm is adopted as another instance of major evolutionary algorithms. Experimental results demonstrate that there was no statistically significant difference between the experimental performances of GA and ES, but the priority of generations and offsprings was different; GA performed better with a greater number of generations while ES performed better with a greater number of offsprings. Eight hidden units were the best among four variations (4, 8, 16 or 32 units), which aligns with previous study using ES.

Slime Mould Algorithm (SMA) is a new swarm intelligence algorithm inspired by the oscillatory behavior of slime molds during foraging. Numerous researchers have widely applied SMA and its variants in various domains and proved its value by the experiments in literatures. In this paper a comprehensive survey on SMA is introduced, which is based on 130 articles visa Google-scholar between 2022 and July, 2023. Firstly, the theory of SMA is described. Secondly the improved SMA variants are provided and categorized according to the approach that they are applied with. Finally, it also discusses the main applications domains of SMA such as engineering optimization, energy optimization, machine learning, network, scheduling optimization, image segmentation and etc. This review presents some research suggestion for researcher who is interested in this algorithm.

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.

We present a very computationally light and fast approximation algorithm and then verify it with genetic algorithm and simulated annealing. We show that our algorithm is on par with GA and SA in terms of output produced while having a tightly bounded time complexity. Our algorithm works best when there is a strong positive correlation between the reliability of a component and its cost. We present two algorithms with the same essence. One of them is system cost bounded and the other is target reliability bounded. Our proposed algorithm works on a subsystem level redundancy instead of component level redundancy.

Driving simulators are widely used for understanding human-machine interaction, driver behavior and in driver training. The effectiveness of simulators in these process depends largely on their ability to generate realistic motion cues. Though the conventional filter-based motion cueing strategies have provided reasonable results, these methods suffer from poor workspace management. To address this issue, linear MPC-based strategies have been applied in the past. However, since the kinematics of the motion platform itself is non-linear and the required motion varies with the driving conditions, this approach tends to produce sub-optimal results. This paper presents a nonlinear MPC-based algorithm which incorporates the nonlinear kinematics of the Stewart platform within the MPC algorithm in order to increase the cueing fidelity and utilize maximum workspace. Further, adaptive weights-based tuning is used to smoothen the movement of the platform towards its physical limits. Full-track simulations were carried out and performance indicators were defined to objectively compare the response of the proposed algorithm with classical washout filter and linear MPC-based algorithms. The results indicate a better reference tracking with lower root mean square error and higher shape correlation for the proposed algorithm. Lastly, the effect of the adaptive weights-based tuning was also observed in the form of smoother actuator movements and better workspace utilization.

Variational mode decomposition (VMD) is a recently introduced adaptive signal decomposition algorithm with a solid theoretical foundation and good noise robustness compared with empirical mode decomposition (EMD). There is a lot of background noise in the vibration signal of diesel engine. To solve the problem, a denoising algorithm based on VMD and Euclidean Distance is proposed. Firstly, a multi-component, non-Gauss, and noisy simulation signal is established, and decomposed into a given number K of band-limited intrinsic mode functions by VMD. Then the Euclidean distance between the probability density function of each mode and that of the simulation signal are calculated. The signal is reconstructed using the relevant modes, which are selected on the basis of noticeable similarities between the probability density function of the simulation signal and that of each mode. Finally, the vibration signals of diesel engine connecting rod bearing faults are analyzed by the proposed method. The results show that compared with other denoising algorithms, the proposed method has better denoising effect, and the fault characteristics of vibration signals of diesel engine connecting rod bearings can be effectively enhanced.

We present a new penalized method for estimation in sparse logistic regression models with group structure. Group sparsity suggests us to consider the Group Lasso penalty. Being different from penalized log-likelihood estimation, our method can be viewed as a penalized weighted score function method. Under some mild conditions, we provide non-asymptotic oracle inequalities promoting group sparsity of predictors. A modified block coordinate descent algorithm based on a weighted score function is also employed. The net advantage of our algorithm over the existing Group Lasso-type procedures is that the tuning parameter can be pre-specified. The simulations show that this algorithm is considerably faster and more stable than competing methods. Finally, we illustrate our methodology with two real data sets.

The algorithm now known as Kadane’s algorithm for the maximum subarray problem uses many of the ideas that Kadane proposed, but it is not the algorithm that Kadane intended. This paper compares the two algorithms in question. They are both linear in time, employ just a few words of memory, and use a dynamic programming structure. The upshot is two light-weight algorithms for the maximum subarray problem.

In view of the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm all nodes participate in the consensus, the three-stage process has problems such as large communication overhead, random selection of master nodes and lack of reward and punishment mechanism. A Speculative Practical Byzantine Fault Tolerance (SP-PBFT) is proposed. Firstly, the consensus protocol was optimized, and a timeout mechanism was proposed to divide the consensus process into optimistic mode and pessimistic mode, which reduced the communication overhead under the premise of resisting Byzantine node attacks .Secondly, a node evaluation mechanism was proposed to calculate the node reputation value according to the node's historical behavior and give the corresponding reward or punishment, which reduced the possibility of malicious nodes participating in the consensus process. Finally, the Fibonacci grouping mechanism was used to reduce the number of nodes participating in the consensus process, fundamentally improving the consensus efficiency, avoiding the problem of centralization of the consensus process caused by the cumulative reputation value of nodes, and improving the enthusiasm of consensus nodes. Simulation experiments using Docker containers to simulate multiple nodes show that the SP-PBFT consensus algorithm proposed in this paper has better performance than PBFT consensus algorithm and other improved algorithms in terms of consensus delay, throughput, fault tolerance and communication complexity.

Chi-squared automatic interaction detector (CHAID) algorithm is considered to be one of the mostly used supervised learning methods as it is adaptable to solving any kind of problem at hand. We have been starkly aware of CHAID maps non-linear relationships quite well, and it can empower predictive models with stability. But we don’t know how high its accuracy is precisely. To find out the perfect scope CHAID algorithm fits into, this paper presents the analysis of the accuracy of the CHAID algorithm. We introduce the causes, applicable conditions and application scope of CHAID algorithm at first, and then highlight the difference of branching principal between the CHAID algorithm and several other common decision tree algorithms, which is our first step towards basic analysis on CHAID algorithm. We next employee an actual branching case to help us understand CHAID algorithm better. Specifically, we use vehicle customer satisfaction data to compare multiple decision tree algorithms, and cite some factors that affecting the accuracy and some corresponding countermeasures which are more conducive to us to obtain accurate results. The results show that CHAID can analyze the data very well, and detect the significantly correlated factors surely. In this paper, we learn the clear information required to understand CHAID algorithm, thereby make better choices when we need to use decision tree algorithms.

Hyper-spectral images contain a wide range of bands or wavelength due to which they are rich in information. These images are taken by specialized sensors and then investigated through various supervised or unsupervised learning algorithms. Data that is acquired by hyperspectral image contain plenty of information hence it can be used in applications where materials can be analyzed keenly, even the smallest difference can be detected on the basis of spectral signature i.e. remote sensing applications. In order to retrieve information about the concerned area, the image has to be grouped in different segments and can be analyzed conveniently. In this way, only concerned portions of the image can be studied that have relevant information and the rest that do not have any information can be discarded. Image segmentation can be done to assort all pixels in groups. Many methods can be used for this purpose but in this paper, we discussed k means clustering to assort data in AVIRIS cuprite, AVIRIS Muffet and Rosis Pavia in order to calculate the number of regions in each image and retrieved information of 1st, 10th and100th band. Clustering has been done easily and efficiently as k means algorithm is the easiest approach to retrieve information.

The electrical energy supply relies on the satisfactory operation of insulators. The ultrasound recorded from insulators in different conditions has a time series output, which can be used to classify faulty insulators. The random convolutional kernel transform (Rocket) algorithms use convolutional filters to extract various features from time series data. This paper proposes the combination of Rocket algorithms, machine learning classifiers, and empirical mode decomposition (EMD) methods, such as complete ensemble empirical mode decomposition with adaptive noise (CEEMDAN), empirical wavelet transform (EWT), and variational mode decomposition (VMD). The results show that the EMD methods combined with MiniRocket, significantly improve the accuracy of logistic regression in insulator fault diagnosis. The proposed strategy achieves respectively an accuracy of 0.992 using CEEMDAN, 0.995 with EWT, and 0.980 with VMD. These results highlight the potential of incorporating EMD methods in insulator failure detection models to enhance the safety and dependability of power systems.

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.

The clinical neurophysiological tests allow determine the type, extent, and nature of brachial plexus damage. They are crucial in decision-making regarding surgical procedures or conservative treatment. This report aimed to present an algorithm for rehabilitation procedures in patients with brachial plexus injury of various origins based on the results of neurophysiology findings for the selection of procedures supporting the process of nerve and muscle regeneration. The research group consisted of patients whose medical documentation was analyzed concerning the reason, level, and localization of damage to the brachial plexus structures, surgical and or rehabilitative treatment as well as the MRI results. Among the group of ten patients, the clinical studies showed the greatest incidence of brachial plexus injuries of the mixed (both pre- and postganglionic), all trunks, and cervical root injuries, respectively. Results of the motor evoked potentials (MEP) and electroneurography (ENG) recordings induced at levels of spinal roots and Erb's point showed a decrease of more than 40% in amplitudes on the symptomatic side in comparison to the asymptomatic side. This difference was recorded for the axillary and radial innervation and the C5, C6, and C7 root domains, ranging from 56% to 71%; the lowest decrease was recorded following electrical stimulation at Erb's point for the ulnar nerve (41.5%). The latency prolongation on the symptomatic side in CMAP and MEP tests ranged from 0.2 to 1.9 ms, the most following magnetic stimulation of the C5 cervical root for the axillary innervation. All results indicated the axonotmesis and neuropraxia type of injury in motor fibers (40%) confirmed by EMG results. The sensory conduction studies (SNCS) in distal nerve branches did not confirm the severe advancement of the brachial plexus injury (22%). The proposed algorithm of the physiotherapeutic procedures should be mainly targeted for recovery of motor dysfunction as the consequence of brachial plexus injury. Rehabilitation should incorporate the treatment supporting nerve regeneration, muscle strengthening, and maintaining functional ranges of motion of the injured extremities. The rehabilitation treatment for patients with brachial plexus injuries is an individualized process, and the selection of procedures and the effectiveness of the treatment undertaken should be confronted with results of neurophysiological tests verifying the motor neural transmission from the level of the cervical motor center to the effector, peripheral nerve function, and muscle’s motor unit activity.

Multidisciplinary Design Optimization (MDO) is the most active field in the design of current complex system engineering, which is possessed with such two difficulties as subsystem information exchange and analytical and computational complexity of systems. Therefore, an improved collaborative optimization algorithm based on ANN (artificial neural network) response surface was proposed dependent on the consistency constraint algorithm and concurrent subspace algorithm. As an optimization method with secondary structure, it satisfied only local constraints in discipline layer, but provided a coordinated mechanism for interdisciplinary conflict in system layer. Finally, it was applied in the multidisciplinary design optimization of autonomous underwater vehicle (AUV). As shown from the result, the MDO convergence stability and reliability of low resistance, low noise and high maneuvering performance of the AUV shape can be ensured by the improved collaborative optimization algorithm, thus verifying the effectiveness of the algorithm.

In reservoir operations rule curves, it is necessary to apply rule curves to guide long-term reservoir management. This paper proposes an approach to optimize the reservoir operation rule curves (RORC) using intelligent optimization techniques from the Firefly Algorithm (FA) and a unique combination method utilizing the Artificial Bees Colony and Cultural Algorithm (ABC-CA). The aim is to establish a connection with the simulation model to determine the optimal RORC for flood control. The proposed model was used to determine the Nam-Oon Reservoir (NOR) is optimal flood control RORC in Northeastern Thailand. The minimum frequency and a minimum average of ex-cess water were given as an objective function for assessing the efficiency of the search process. The evaluation of the effectiveness of flood control RORC involved expressing water scarcity and excess water situations in terms of frequency, magnitude, and duration using historical inflow data syn-thesized from 1000 events. The results demonstrate that when using the obtained RORC to simulate the NOR system for reducing flooding in long-term operations, situations of excess water were smaller than those using the current RORC. The results indicated that situations of excess water using the obtained RORC from the proposed model were smaller than those using the current RORC situations. In decreasing flood situations, the newly acquired RORC from the suggested FA and ABC-CA models performed better than the current RORC.

In view of the problem that the hot and cold loads of mushroom houses are affected by multiple factors such as environment, mushrooms, and equipment, which are difficult to accurately model, this paper proposes a short-term load prediction method based on empirical wavelet transform (EWT) and mixed autoregressive integrated moving average (ARIMA) and convolutional bi-directional short- and long-term attention mechanism (CNN-BiLSTM-Attention). The method first uses the Boruta algorithm to filter the input characteristics, and then uses the EWT method to decompose the mushroom house load data into 4 modal components. Then the Lempel-Ziv method is introduced to divide the modal components into two categories of high and low frequencies, and the CNN-BiLSTM-Attention and ARIMA prediction models are constructed separately. Finally, the two types of prediction results are superimposed and reconstructed to obtain the final load prediction value. The test results show that the Boruta algorithm can effectively filter out the characteristics of key influencing factors. Compared with the Spearman and Pearson correlation coefficient methods, the mean absolute error (MAE) of the prediction results is reduced by 14.72% and 3.75%, respectively; compared with the ensemble empirical mode decomposition (EEMD) method, the EWT method can increase the decomposition and reconstruction error by 103 orders of magnitude, which can effectively improve the prediction accuracy of the model; compared with the individual neural network model, the prediction effect of the model proposed in this paper has obvious advantages, and the MAE, root mean square error (RMSE) and mean absolute percentage error (MAPE) of the prediction results are reduced respectively. 31.06%, 26.52% and 39.27%.

The utilization of tempered blast furnace (BF) slag through the direct fiber forming process to create high-value thermal insulation materials offers a dual benefit: it efficiently harnesses the latent heat within unused slag and substantially enhances the value of blast-furnace slag utilization. However, gauging the melting properties of iron slag under high temperatures is a challenge. In this study, we explore the melting behavior of SiO2 within a high-temperature molten pool. We employ dynamic visual data (video stream) captured via a non-contact charge coupled device (CCD) video recording system to extract SiO2 contours through image processing. The change in image centroid characteristics is used to establish a convolution function relationship, and MATLAB's traversal search algorithm determines SiO2's centroid position. Given that SiO2 is proportionate to crucible pixels, the area of SiO2 is calculated through pixel statistics within these contours. Subsequently, we propose a new indirect method to process image information, yielding SiO2 volume and mass at different time points. An exponential fitting yields the melting rate function of SiO2. Finally, we compare this indirect method with shape from shading (SFS), quantitative characterization, and dimensional analysis techniques. We also discuss the strengths and limitations of each method. Our findings reveal that the indirect solution method presented here boasts straightforward calculation steps and imposes minimal image format requirements. This research provides theoretical and technical support for blast-furnace slag's direct fiber forming process.

This research presents a solution to the problem of planning the optimum area for economic crops by developed mathematical models and developed an algorithm to solve the problem of planning the optimum area by considered economic value for the maximize profit of farmers. The data were collected from farmers in 8 provinces in the northeastern region of Thailand. The 3 economic crops studied were rice, cassava and sugarcane. The solving problem methods were 1) Created mathematical models and solved the problems with Lingo V.11. 2) Improved Differential Evolution algorithms (I-DE) to solve the problems, which had 3 local search methods included (Swap, Cyclic Move and K-variable moves). The results of this study showed that in the small and medium problems instances, Lingo V.11 and DE provided equal profit outcome but DE was faster but in the large size of test instances DE generated better solution than that of Lingo v.11 when Lingo simulation time is set to 250 hours and DE simulation time has set to maximum 21.82 minutes. 2) Comparing DE and I-DE , I-DE outperforms DE in finding the better solution for all size of test instances (small, medium and large).

The literature has well established prestressing in concrete beams and its calculation procedures. However, its use in composite steel-concrete beams has increased despite main normative codes lacking a specific approach for it. Designers must, in most cases, combine the available criteria to calculate the standards of steel and reinforced concrete structures. This study aimed to formulate this optimization problem and analyze CO2 emissions for the optimal design of composite steel-concrete beams with external prestressing. The design variables for the optimization problem include cross-section of laminated or welded profiles, slab height, characteristic strength of concrete to compression, and number of tendons. We obtained a solution for the optimization problem via a genetic algorithm (GA) and a particle swarm optimization one (PSO). Comparative analysis with experimental example and with optimization problem of prestressed steel beam are performed. An parametric analysis to several spams is performed, which enabled to evaluate the factors that most impact CO2 emissions. According to results, the chosen algorithms effectively obtained solutions for the problem, and PSO usually provided better results than GA. Regarding the final solution composition, steel contributes the most to emissions, welded profiles provided better solutions than laminated ones, and laminated spans of up to 17.5m and welded ones up to 27.5m dispensed with tendons.

A model of a single-server queuing-inventory system (QIS) with catastrophes and a finite waiting room for consumer customers (c-customers) has been developed. When a catastrophe occurs, all inventory in the system's warehouse is destroyed, but c-customers in the system are still waiting for restocking. In addition to c-customers, negative customers (n-customers) are also taken into account, which displaces one c-customers (if any). The policy (?, ?) is used to replenish stocks. If upon arrival of the c-customer the inventory level is zero, then according to Bernoulli’s scheme this c-customer is either lost or joining the queue. The mathematical model of the studied QIS is constructed in the form of a two-dimensional continuous-time Markov chain (2D CTMC). Exact and approximate methods for calculating the steady-state probabilities of constructed 2D CTMCs are developed and closed-form expressions are derived for calculating the performance measures. The results of numerical experiments are presented, demonstrating the high accuracy of the developed approximate formulas, as well as the behavior of performance indicators depending on the reorder point. In addition, an optimization problem is solved to obtain the optimal reorder point to minimize the expected total cost.

Intelligent algorithms are recently used in the optimization process in chemical engineering and application of multiphase flows such as bubbling flow. This overview of modeling can be a great replacement with complex numerical methods or very time-consuming and disruptive measurement experimental process. In this study, we develop the ANFIS method for mapping inputs and outputs together and understand the behavior of the fluid flow from other output parameters of the bubble column reactor. Four inputs such as x coordinate, y coordinate, z coordinate, and air superficial velocity and one output such as pressure gradient are considered in the learning process of the ANFIS method. During the learning process, the different number of the membership function, type of membership functions and the number of inputs are examined to achieve the intelligent algorithm with high accuracy. The results show that as the number of inputs increases the accuracy of the ANFIS method rises up to almost for all cases, while the increment in the number of rules has a effect on the intelligence of artificial algorithm. This finding shows that the density of neural objects or higher input parameters enables the moded for better understanding. We also proposed a new evaluation of data in the bubble column reactor by mapping inputs and outputs and shuffle all parameters together to understand the behaviour of the multiphase flow as a function of either inputs or outputs.

Digital healthcare systems play a pivotal role in providing efficient and accessible healthcare services. However, ensuring secure authentication and key agreement mechanisms is essential to protect sensitive patient data and maintain the integrity of the system. The existing methods face limitations in terms of vulnerability to cyber attacks, scalability, and resource utilization. Furthermore, the integration of blockchain technology introduces new complexities that need to be addressed. This research proposes an optimized fuzzy logic approach combined with blockchain technology to address the authentication and key agreement challenges in digital healthcare systems. The proposed solution leverages the flexibility and adaptability of fuzzy logic algorithms to handle uncertainty and imprecision in authentication decisions. By employing fuzzy logic, the system can effectively minimize false positives and false negatives, enhancing the robustness against adversarial attacks. Moreover, the integration of blockchain technology provides a decentralized and tamper-proof infrastructure for securely storing and managing authentication and key agreement data. This ensures transparency and trust in the system, mitigating the risks of unauthorized access and data manipulation. The blockchain-based architecture also enables efficient resource utilization and scalability, allowing the system to handle authentication requests in a timely manner, even in large-scale digital healthcare environments.The proposed method is evaluated by using the NIST Special Database 302 and it shows superior performance compared to existing methods, with minimum False Rejection Rate (FRR), False Acceptance Rate (FAR), and response time. Moreover, the proposed method minimizes communication overhead during the authentication process and resists different cyber attacks including a Replay attack, Man-in-the-middle attack, Denial of Service (DoS) attack, and Impersonation attack. The proposed method achieves excellent performance in terms of security, efficiency, and resistance to various cyber-attacks, making it a promising approach for secure data sharing in P2P cloud environments.

In recent years, several industries have registered an impressive improvement in technological advances such as Internet of Things (IoT), e-commerce, vehicular networks, etc. These advances have sparked an increase in the volume of information that gets transmitted from different nodes of a computer network (CN). As a result, it is crucial to safeguard CNs against security threats and intrusions that can compromise the integrity of those systems. In this paper, we propose a machine mearning (ML) intrusion detection system (IDS) in conjunction with the Genetic Algorithm (GA) for feature selection. To assess the effectiveness of the proposed framework, we use the NSL-KDD dataset. Furthermore, we consider the following ML methods in the modelling process: decision tree (DT), support vector machine (SVM), random forest (RF), extra-trees (ET), extreme gradient boosting (XGB), and naïve Bayes (NB). The results demonstrated that using the GA algorithm has a positive impact on the performance of the selected classifiers. Moreover, the results obtained by the proposed ML methods were superior to existing methodologies.

Optimization using Genetic Algorithms (GA) is a well-known strategy in several scientific disciplines. The crossover is an essential operator of the Genetic Algorithm. It has been an active area of research to develop sustainable forms for this operand. In this work, a new crossover operand is proposed. This operand depends on giving an elicited description for the chromosome with a new structure for alleles of the parents. It is suggested that each allele has two attitudes, one attitude differs contrastingly with the other, and both of them complement the allele. Thus, in case of one attitude is good, the other should be bad. This is suitable for many systems which contain admired parameters and unadmired parameters. The proposed crossover would improve the desired attitudes and damp the undesired attitudes. The proposed crossover can be achieved in two stages: the first stage is a mating method for both attitudes in one parent to improving one attitude at the expense of the other. The second stage comes after the first improvement stage for mating between different parents. Hence, two concurrent steps for improvement would be applied. Simulation experiments for the system shows improvement in the fitness function. The proposed crossover could be helpful in different fields, especially to optimize routing algorithms and network protocols, an application that has been tested as a case study in this work.

Premature ventricular contraction (PVC) is one of the common ventricular arrhythmias, which may cause stroke or sudden cardiac death. Automatic long-term electrocardiogram (ECG) analysis algorithms could provide diagnosis suggestion even early warning for physicians, however, they are mutually-exclusive in terms of robustness, generalization and low complexity. In this study, a novel PVC recognition algorithm that combines deep learning-based heartbeat template clusterer and expert system-based heartbeat classifier is proposed. Long short-term memory-based auto-encoder (LSTM-AE) network was used to extract features from ECG heartbeats for K-means clustering. Thus, the templates were constructed and determined based on clustering results. Finally, the PVC heartbeats were recognized based on a combination of multiple rules, including template matching and rhythm characteristics. Three quantitative parameters, sensitivity (Se), positive predictive value (P+) and accuracy (ACC), were used to evaluate the performances of the proposed method on the MIT-BIH Arrhythmia database and the St. Petersburg Institute of Cardiological Technics database. Se on the two test databases was 87.51% and 87.92%, respectively; P+ was 92.47% and 93.18%, respectively; and ACC was 98.63% and 97.89%, respectively. The PVC scores on the 3rd China Physiological Signal Challenge 2020 training set and hidden test set were 36,256 and 46,706, respectively, which could rank first in the open-source codes. The results showed that the combination strategy of expert system and deep learning can provide new insights for robust and generalized PVC identification from long-term single-lead ECG recordings.

In the field of stochastic optimisation, the so-called structural bias constitutes an undesired behaviour of an algorithm that is unable to explore the search space to a uniform extent. In this paper, we investigate whether algorithms from a subclass of estimation of distribution algorithms, the compact algorithms, exhibit structural bias. Our approach, justified in our earlier publications, is based on conducting experiments on a test function whose values are uniformly distributed in its domain. For the experiment, 81 combinations of compact algorithms and strategies of dealing with infeasible solutions have been selected as test cases. We have applied two approaches for determining the presence and severity of structural bias, namely a visual and a statistical (Anderson-Darling) tests. Our results suggest that compact algorithms are more immune to structural bias than their counterparts maintaining explicit populations. Both tests indicate that strong structural bias is found only in one of the algorithms (cBFO) regardless of the choice of strategy of dealing with infeasible solutions and cPSO mirror. For other test cases, statistical and visual tests disagree on some cases classified as having mild or strong structural bias: the former one tends to make harsher decisions, thus needing further investigation.

In a wireless network, locations of base stations (BSs)/access points (APs)/sensor nodes can be modeled based on stochastic processes, e.g., a Poisson point process (PPP) or a deterministic pattern planned ahead by providers. While deterministic deployment does not provide tractable interference analysis in general, PPP yields tractable analysis for interference. However, PPP allows APs to be deployed very close to each other and gives pessimistic results compared to the field measurements. In this study, in order to address this issue, Lloyd’s algorithm, which functions as a bridge between random and structural APs deployments, is investigated for analyzing coverage probability in a network. The link distance distribution is modeled as a mixture of Weibull distributions and its parameters are obtained by using the expectation-maximization (EM) algorithm for each iteration of Lloyd’s algorithm. The link distance distribution is further utilized for calculating the coverage probability approximately by exploiting the tractability of PPP.

In the research we consider a structure-fluid interaction of oscillating piezodevice and acoustic liquid. Such problem requires finding resonance or anti-resonance frequencies of the solid structure to use them in the latter frequency-response analyses step. After finite element discretization of the issue, we need to solve a generalized eigenvalue problem (GEP). The most efficient numerical method for solving the partial GEP is the shift-and-invert Lanczos method. Each step of this algorithm requires solving a large scale system of linear algebraic equations (SLAEs) with special properties. Various ways of ordering grid nodes lead to coefficient matrices with different structure. Several methods are compared in terms of efficiency. The results of the numerical experiments are presented.

A programmable DC power supply with Real-time Digital Simulator (RTDS)-based photovoltaic (PV) Power Hardware-In-the-Loop (PHIL) simulators have been used to improve the control algorithm and reliability of PV Inverter. This paper proposes a supervisory control algorithm for PV PHIL simulator with non-RTDS device that is an alternative solution of high cost PHIL simulator. However, when such a simulator with conventional algorithm which is used in RTDS is connected to a PV inverter, the output is in the transient state and it makes it impossible to evaluate the performance of the PV Inverter. Therefore proposed algorithm controls the voltage and current target values according to the constant voltage (CV) and constant current (CC) modes to overcome the limitation of the Computing Unit, DC power supply and also uses a multi-rate system to account for the characteristics of each component of simulator. A mathematical models of a PV system, programmable DC power supply, isolated DC measurement device and Computing Unit are integrated to form a real-time processing simulator. Performance tests using a PV PHIL simulator which is applied proposed algorithm connected a PV inverter are carried out and proved superiority and utility of this method against conventional methods.

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.

The article presents a hybrid method for calculating the chemical composition of steel with the required hardness after cooling from the austenitizing temperature. Artificial neural networks and genetic algorithms were used to develop the model. Based on 550 diagrams of continuous cooling transformation (CCT) of structural steels available in the literature, a dataset of experimental data was created. Artificial neural networks were used to develop a hardness model describing the relationship between the chemical composition of the steel, the austenitizing temperature, and the hardness of the steel after cooling. A genetic algorithm was used to identify the chemical composition of the steel with the required hardness. The value of the objective function was calculated using the neural network model. The developed method for identifying the chemical composition was implemented in a computer application. Examples of calculations of mass concentrations of steel elements with the required hardness after cooling from the austenitizing temperature are presented. The model proposed in this study can be a valuable tool to support chemical composition design by reducing the number of experiments and minimizing research costs.

This work is mainly focused on improving the differential evolution algorithm with the utilization of shadowed and general type 2 fuzzy systems to dynamically adapt one of the parameters of the evolutionary method. In this case, the mutation parameter is dynamically moved during the evolution process by using a shadowed and general type-2 fuzzy systems. The main idea of this work is to make a performance comparison between using shadowed and general type 2 fuzzy systems as controllers of the mutation parameter in differential evolution. The performance is compared with the problem of optimizing fuzzy controllers for a D.C. Motor. Simulation results show that general type-2 fuzzy systems are better when higher levels of noise are considered in the controller.

This paper presents the automation of the thin-layer chromatography technique whose separation and identification of molecules present in a mixture are currently done manually and laboriously [1]. We have therefore found an interest in automating this technique. In this part, the method implemented comprises 2 steps. First we proceeded to the segmentation of the spots obtained on the chromatographic plate. We then developed a program to identify families of molecules such as coumarins, terpenes, tannins, flavonoids, polyphenols, etc. by calculating segmentation parameters such as standard deviation, entropy, average pixel intensity from an algorithm on the matlab software. Finally our results have been compared to the results obtained by the traditional identification technique in laboratories. Some similarity between the two results obtained shows the reliability and the robustness of our technique.