The exceptional performance advantages of the fiber optic gyroscope (FOG) position it as a dominant player in middle and high-end inertial navigation systems. To prevent the loss of sensor precision caused by algorithm design and simplify the complex modeling strategy in traditional methods. We gradually demonstrate the significant role of Convolutional Neural Network (CNN) in the navigation system based on FOG, and utilize the particle swarm optimization algorithm (PSO) to expedite the convergence of the network. The experimental results demonstrate that the initial alignment method based on deep learning is more accurate than the traditional method. The attitude angle error is reduced by 81.25%, 92.54% and 36.53% respectively. The research provides support for the future application of deep learning in optical navigation systems.

Real-time energy management of a converter-based microgrid is difficult to determine optimal operating points of a storage system in order to save costs and minimise energy waste. This complexity arises due to time-varying electricity prices, stochastic energy sources and power demand. Many countries have imposed real-time electricity pricing to efficiently control demand side management. This paper presents a particle swarm optimisation (PSO) for the application of real-time energy management to find optimal battery controls of a community microgrid. The modification of the PSO consists in altering the cost function to better model the battery charging/discharging operations. As optimal control is performed by formulating a cost function, it is suitably analysed and then a dynamic penalty function in order to obtain the best cost function is proposed. Several case studies with different scenarios are conducted to determine the effectiveness of the proposed cost function. The proposed cost function can reduce operational cost by 12% as compared to the original cost function over a time horizon of 96 hours. Simulation results reveal the suitability of applying the regularised PSO algorithm with the proposed cost function, which can be adjusted according to the need of the community, for real-time energy management.

This study introduces an advanced dual-mode composite attitude control framework for reusable launch vehicles (RLVs), underpinned by an enhanced particle swarm optimization (PSO) algorithm. This innovative strategy is tailored to meet the stringent demands for precision and robust anti-interference capabilities across the entire flight envelope of RLVs. The research commences with the formulation of a comprehensive attitude dynamics model and diverse heterogeneous actuator representations, meticulously crafted to reflect the distinct phases of RLV flight. Building upon this foundation, a synergistic control paradigm is engineered, integrating PID and fuzzy PID controllers, complemented by a refined fitness evaluation function. The crux of the study is the application of an upgraded PSO algorithm to fine-tune the controllers' weighting coefficients, culminating in an optimized dual-mode composite attitude control system. A series of comparative simulation analyses are meticulously executed to appraise the system's responsiveness, stability, precision, and resilience to interference. The findings unequivocally substantiate the superior performance of the proposed control system, affirming its substantial contribution to the advancement of RLV attitude control.

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

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

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.

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

The 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.

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.

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

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

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

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.

This paper proposes a new approach for multi-focus images fusion based on Region Mosaicing on Contrast Pyramids (REMCP). A density-based region growing method is developed to construct a focused region mask for multi-focus images. The segmented focused region mask is decomposed into a mask pyramid, which is then used for supervised region mosaicking on a contrast pyramid. In this way, the focus measurement and the continuity of focused regions are incorporated and the pixel level pyramid fusion is improved at the region level. Objective and subjective experiments show that the proposed REMCP is more robust to noise than compared algorithms and can fully preserves the focus information of the multi-focus images meanwhile reducing distortions of the fused images.

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

Pavement crack detection is one of the key links in highway pavement maintenance management. In the current road crack detection, the network model easily ignores the shallow geometric features of cracks and cannot extract the key feature information of cracks. Aiming at the above problems, an EC-YOLOX network model is proposed. The CFPN is constructed to cross-fuse different scale features to solve the feature scale invariance. In the strengthen feature extraction layer, ECANet is fused to enhance the ability to pay attention to key information. The WEIoU loss function is proposed, which assigns different penalty terms to the target box in the vertical and horizontal directions. In terms of data, geometric distortion constraint correction is performed on the single-point perspective pavement image. The experimental data show that the accuracy of EC-YOLOX on the self-built data set reaches 76.34% [email protected], which is 4.45% higher than that of YOLOX. The loss curve of EC-YOLOX is smoother than that of YOLOX, and the minimum training loss value is 2.136, which is 0.648 lower than the minimum loss value 2.784 of YOLOX. Many experiments have verified the effectiveness of EC-YOLOX in improving the detection effect in pavement crack detection.

Classifying network flow subsequences in an Industrial IoT gateway is an effective method for identifying Industrial IoT faults. This paper proposes a subsequence classification algorithm SSGBUL-IKNN based on unsupervised learning encoding to address the problem of low classification accuracy. Firstly, we built a network module based on unsupervised learning to encode the flow sequence of the Industrial IoT gateway. In the encoding module, a subsequence calibration algorithm controls the increasing error during the coding process. Then, the specific fault type is obtained through an improved KNN classification algorithm based on the indication distance source from the integrated coding sequences converted by multi-dimensional network flow sequences. The test result on three Industrial IoT datasets of a sewage treatment plant shows that the accuracy of SSGBUL-IKNN in this paper exceeds 92%, significantly higher than the algorithm DTW and TSF. It reaches the classification requirements of Industrial IoT fault diagnosis.

With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed: the unknown node is in the positioning unit or not. When the unknown node is on the side of the positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is not on the side of the positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.

The paper presents an error model of a measurement chain containing link performing discrete wavelet transform algorithm which is most often the last stage of measurement signal processing. The goal is to determine the uncertainty budget of the input quantities of the wavelet transform algorithm. The error model takes into account parts of analog, analog-to-digital and digital processing, describing the properties of subsequent fragments of the chain using their transmittance and processing functions. The proposed model enables the description of both deterministic and non-deterministic properties of signal errors. The proposed model was validated using an example measurement chain created for this purpose.

In this paper, we present a general version of polygonal fitting problem called Unconstrained Polygonal Fitting (UPF). Our goal is to represent a given 2D shape S with an N-vertex polygonal curve P with a known number of vertices, so that the Intersection over Union (IoU) metric between S and P is maximized without any assumption or prior knowledge of the object structure and the location of the N-vertices of P that can be placed anywhere in the 2D space. The search space of the UPF problem is a superset of the classical polygonal approximation (PA) problem, where the vertices are constrained to belong in the boundary of the given 2D shape. Therefore, the resulting solutions of the UPF may better approximate the given curve than the solutions of the PA problem. For a given number of vertices N, a Particle Swarm Optimization (PSO) method is used to maximize the IoU metric, which yields almost optimal solutions. Furthermore, the proposed method has also been implemented under the equal area principle so that the total area covered by P is equal to the area of the original 2D shape to measure how this constraint affects IoU metric. The quantitative results obtained on more than 2,800 2D shapes included in two standard datasets quantify the performance of the proposed methods and illustrate that their solutions outperform baselines from the literature.

The conventional well placement was done manually by using a numerical reservoir simulator, and it required a lengthy trial-and-error process. It required great experience and expertise to manipulate the variables and uncertainties that lie on the reservoir to determine the best placement of the well. In addition, the traditional gradient-based methods such as Line-search and Trust-region were not viable in terms of maximum results obtained. Gradient-based methods were too dependent on the surface gradient of the solution and may only converge to local optima instead of global optima. Complex reservoirs have rough surfaces with high uncertainties, which hinders the traditional gradient-based method from converging to global optima. Thus, genetic algorithms were utilized to automate the manual trial-and-error process and to overcome the limitations of the traditional gradient-based method. The objectives of this study were to analyse the effect of different initial well placement distributions, the number of random solution sizes, and the crossover rate on cumulative oil production. A synthetic reservoir model built using CMG Builder was used as the testing platform for the optimization problems. Well-placement parameterization and optimization set-up were carried out using the CMG CMOST optimization tool. The integration of CMG IMEX and CMOST optimized cumulative oil production based on the objectives of the study. The results obtained showed that the higher number of random solutions used resulted in higher cumulative oil production, with more generations needed to reach the optimum solution. It can be concluded that the larger number of random solutions used increased the probability of reaching the optimum solution, but will take more generations.

This paper presents a novel approach for the recognition of multiple sclerosis (MS) using wavelet entropy and a Particle Swarm Optimization (PSO)-based neural network. MS is a complex neurological disorder with diverse clinical manifestations, often challenging to diagnose accurately. In this study, we leverage wavelet entropy (WE) as a feature extraction method to capture intricate patterns within brain imaging data. These extracted features are then employed to train a neural network model optimized through PSO to enhance classification accuracy. Experimental results on a dataset comprising MS and healthy control subjects demonstrate the effectiveness of our proposed approach, viz., WE-PSONN, which achieves a sensitivity of 91.95±1.15, a specificity of 92.36±0.88, a precision of 92.28±0.88, an accuracy of 92.16±0.90. The combination of advanced signal processing techniques and machine learning optimization holds promise for improving the early diagnosis and management of MS, offering potential benefits to both patients and healthcare providers.

Depth-sensing technology has led to broad applications of inexpensive depth cameras that can capture human motion and scenes in 3D space. Background subtraction algorithms can be improved by fusing color and depth cues, thereby allowing many issues encountered in classical color segmentation to be solved. In this paper, we propose a new fusion method that combines depth and color information for foreground segmentation based on an advanced color-based algorithm. First, a background model and a depth model are developed. Then, based on these models, we propose a new updating strategy that can eliminate ghosting and black shadows almost completely. Extensive experiments have been performed to compare the proposed algorithm with other, conventional RGB-D algorithms. The experimental results suggest that our method extracts foregrounds with higher effectiveness and efficiency.

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assisted. It is especially relevant for sensor nodes location in UWSNs. Global Positioning System (GPS) is not suitable for using in UWSNs because of the underwater propagation problems. Hence some localization algorithms based on the precise time synchronization between sensor nodes have been proposed which are not feasible for UWSNs. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme base on the Particle Swarm Optimization (PSO) algorithm to decrease the localization error. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence in this algorithm, we use a small number of mobile beacons to help achieve location without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

Insulated Gate Bipolar Transistor (IGBT) may convey high current and sustain high breakdown voltages; it may provide high power control. In a sense, how IGBT demonstrates the capability of power control was not specifically described, and the equivalent bipolar junction transistors (BJT) activated by an applied bias to the insulated gate is intriguing. As seen in Figure 1, IGBT shows an equivalent circuit structure containing two types of BJT, (NPN-type Bipolar transistor and PNP-type Bipolar transistor), which can be modeled as diode-associated transistor. Apparently, as a bias applies to the controlling gate, the channel beneath the gate oxide gets strongly inversed and turns out to be conductive just like what happens on metal-oxide-silicon field effect transistor (MOSFET), which provides necessary igniting currents to both BJTs and thus causes high current gain flowing through them-selves from the bottom. A proposed and renewed formula provides addressing the above scenario and successfully fitting the measured data that forms the characteristic curves. Some parameters in the proposed formula, which includes size and mobility associated constant, threshold voltage, and Early-Voltage-related lambda for MOSFET, explain and explore the underlying physics. IGBT thus enjoy high input impedance and high current gain due to MOSFET (Insulated Gate) and BJT, respectively. This formula combines both merits of MOSFET and BJT in order to fit the measured data. Indeed, the formula intimately fits IGBT electrical characteristic curves, and thus may be qualified and served as a model. The new model is then advisable for designing power integrated circuit to exactly achieve power saving, power control, and power efficiency.

Deadlock is a real problem that can cause expensive, time-dependent hang-ups or failures in distributed computing systems. Some studies have been conducted with deadlock detection and resolution in generalized request computing models, most of these studies are based on the diffusing computation scheme, where forward and backward propagated probe and reply messages respectively are diffused between dependent processes. The replies carry the dependency information between processes for the initiator. Using this dependency information initiator can detect and resolve the deadlock cycle. It has been proven in the literature that a deadlock cycle length distribution is skewed with a large majority of cycles (90%) having length two. Based on this fact an improved algorithm is proposed for handling deadlock detection in distributed computing systems under the distributed request model where each process has several requests at a time. The improved algorithm depends mainly on message propagation and timeout policy. Probe and reply messages are propagated between the initiator and its successors only to detect deadlock cycles between them. Global timeout policy is used to detect potential deadlock cycles with large length distribution. The proposed algorithm can handle concurrent executions. Simulation experiments are performed to see the effectiveness of the improved algorithm. It is found that the improved algorithm compares favorably with other existing algorithms and it shows better results for several performance metrics especially in reducing deadlock latency and execution time.

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

Efficient energy extraction in photovoltaic (PV) systems relies on the effective implementation of Maximum Power Point Tracking (MPPT) methods. Conventional MPPT techniques often suffer from slow convergence speeds and suboptimal tracking performance, particularly under dynamic variation of environmental conditions. Smart optimization algorithms (SOA) using metaheuristic optimization algorithms can avoid this limitation inherent in the conventional MPPT methods. The problem of slow convergence of the SOA is avoided in this paper using a novel strategy called Swarm Size Reduction (SSR) utilized with Particle Swarm Optimization (PSO) algorithm, specifically designed to achieve short convergence time (CT) while maintaining exceptional tracking accuracy. The novelty of the proposed MPPT method introduced in this paper is the dynamic reduction of the swarm size of the PSO for improved performance of the MPPT of the PV systems. This adaptive reduction approach allows the algorithm to efficiently explore the solution space of PV systems and rapidly exploit to identify the global maximum power point (GMPP) even under fast fluctuation of uneven solar irradiance and temperature. This pioneering ultra-fast MPPT method represents a significant advancement in PV system efficiency and promotes the wider adoption of solar energy as a reliable and sustainable power source. The novel adaptive PSO algorithm also opens new possibilities for further innovations in optimization-driven applications, extending its potential impact on a diverse range of real-world challenges. The results obtained from this proposed strategy are compared with several optimization algorithms to validate its superiority.

Based on collected power generation data associated with solar irradiance, PV system conversion efficiency and cell temperature, an hourly solar PV power estimation model by a parallel artificial neural network (ANN) and particle swarm optimization (PSO) algorithm is proposed. Weight matrices related to different seasons and geographic areas for estimation power generations have been trained by real measured operation data. The parallel PSO algorithm with heuristic global optimization technique assists the ANN training process to get near optimal solutions precisely. The accuracy and reliability of estimation is audited by actual details of photovoltaic power stations in various regions and scales. The results of estimation model can not only assist the electricity dispatcher to explicitly monitor the trend of solar power generation in different areas, but also coordinate with traditional power plants to meet load demand more accurately. The presented model will bring benefits to power dispatching for larger scales of intermittent and unstable solar power generation.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

Detection of subsurface archaeological remains using a range of remote sensing methods, poses several challenges until today. Recent studies regarding the detection of archaeological proxies like those of cropmarks highlight the complexity of the phenomenon. In this work we present three different methods, and associated indices, for identifying stressed reflectance signatures indicating buried archaeological remains, based on a dataset of measured ground spectroradiometric reflectance. Several spectral profiles between the visible and near infrared part of the spectrum, were taken over a controlled environment in Cyprus during the 2011-2012 and are re-used in this study. The first two (spectral) methods are based on a suitable analysis of the spectral signatures in (1) the visible part of the spectrum, and in particular in the neighborhood of 570 nm, and (2) the red edge-near infrared part of the spectrum, in the neighborhood of 730 nm. Machine learning (decision trees) allows for the deduction of suitable wavelengths to focus on, in order to formulate the proposed indices and the associated classification criteria (decision boundaries) that can enhance the detection probability of stressed vegetation. Noise in the signal is taken into account by simulating reflectance signatures perturbed by white noise. Applying decision tree classification on the ensemble of simulations and basic statistical analysis we refine the formulation of the indices and criteria for the noisy signatures. The success rate of the proposed methods is over 90%. The third method rests on the estimation of vegetation/canopy reflectance parameters through inversion of the physical-based PROSAIL reflectance model and the associated classification through machine learning methods. The obtained results provide further insights into the formation of stress vegetation that occurred due to the presence of shallow buried archaeological remains, which are well aligned with physical-based models and existing empirical knowledge. To the best of the authors' knowledge, this is the first study demonstrating the usefulness of radiative transfer models such as PROSAIL for understanding the formation of cropmarks. Similar studies can support future research directions towards the development of regional remote sensing methods and algorithms if systematic observations are adequately dispersed in space and time.

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

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

Count data analysis presents unique challenges due to its discrete nature, often exhibiting excessive zeros and overdispersion. To address these complexities, count models, such as Poisson regression and Negative Binomial regression, have been developed, enabling modeling and prediction of count-based phenomena. Additionally, it’s important to notice that zero inflation, a phenomenon commonly observed in count data, requires specialized techniques for robust analysis. This article provides an overview of count data and count models, explores zero inflation, introduces Likelihood Ratio Tests, and explains how the Vuong Test can be used as a model selection criteria. Furthermore, we created a Vuong Test implementation from scratch using the Python programming language. This implementation enhances the accessibility and applicability of the Vuong Test in real-world scenarios, providing a valuable contribution to the academic community, since Python didn’t have an implementation of this statistical test.

This article presents the development of an innovative Maximum Power Point Tracking (MPPT) strategy, utilizing a Particle Swarm Optimization (PSO) algorithm to improve the effectiveness of PV systems and expedite convergence. The new MPPT method incorporated a unique Swarm Self-Reinforcement Mechanism (SSRM) within the PSO algorithm, targeting quick convergence and excellent tracking accuracy. This approach enables the PSO to eliminate the fitness function that has the lowest value and subsequently reinforce it in the next iteration, revolving around the global maximum power point (GMPP). By applying this novel PSO-based method, the MPPT performance of PV systems was significantly improved, facilitating the algorithm to proficiently navigate through the solution space and quickly locate the GMPP, even in rapidly changing environmental conditions. The outcomes derived from this novel approach were contrasted with other algorithmic optimization methods, validating its superior convergence speed and tracking accuracy. Different swarm sizes were examined using SSRM, and the optimal swarm size for the system employing MPPT was identified to achieve the lowest convergence time (CT). The results showcased the impressive performance capabilities of this novel strategy, resulting in a time con-traction of up to 28% compared to the conventional PSO technique, where the optimal swarm size was found to be 5. This achievement marks a significant milestone in the evolution of PSO-based MPPT techniques, and paves the way for future advancements in this exciting field.

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

Accurate prediction of mercury content emitted from fossil-fueled power stations is of utmost importance for environmental pollution assessment and hazard mitigation. In this paper, mercury content in the output gas of power stations’ boilers was predicted using an adaptive neuro-fuzzy inference system (ANFIS) method integrated with particle swarm optimization (PSO). The input parameters of the model include coal characteristics and the operational parameters of the boilers. The dataset has been collected from 82 power plants and employed to educate and examine the proposed model. To evaluate the performance of the proposed hybrid model of ANFIS-PSO model, the statistical meter of MARE% was implemented, which resulted in 0.003266 and 0.013272 for training and testing, respectively. Furthermore, relative errors between acquired data and predicted values were between -0.25% and 0.1%, which confirm the accuracy of the model to deal nonlinearity and representing the dependency of flue gas mercury content into the specifications of coal and the boiler type.

In the present study, a hybrid optimizing algorithm has been proposed using Genetic Algorithm (GA)and Particle Swarm Optimization (PSO) for Artificial Neural Network (ANN) to improve the estimation of electricity demand of the state of Tamil Nadu in India. The GA-PSO model optimizes the coefficients of factors of gross state domestic product (GSDP) , electricity consumption per capita, income growth rate and consumer price index (CPI) that affect the electricity demand. Based on historical data of 25 years from 1991 till 2015 , the simulation results of GA-PSO models are having greater accuracy and reliability than single optimization methods based on either PSO or GA. The forecasting results of ANN-GA-PSO are better than models based on single optimization such as ANN-BP, ANN-GA, ANN-PSO models. Further the paper also forecasts the electricity demand of Tamil Nadu based on two scenarios. First scenario is the "as-it-is" scenario , the second scenario is based on milestones set for achieving goals of "Vision 2023" document for the state. The present research also explores the causality between the economic growth and electricity demand in case of Tamil Nadu. The research indicates that a direct causality exists between GSDP and the electricity demand of the state.

In the present study, a hybrid optimizing algorithm has been proposed using Genetic Algorithm (GA)and Particle Swarm Optimization (PSO) for Artificial Neural Network (ANN) to improve the estimation of electricity demand of the state of Tamil Nadu in India. The GA-PSO model optimizes the coefficients of factors of gross state domestic product (GSDP) , electricity consumption per capita, income growth rate and consumer price index (CPI) that affect the electricity demand. Based on historical data of 25 years from 1991 till 2015, the simulation results of GA-PSO models are having greater accuracy and reliability than single optimization methods based on either PSO or GA. The forecasting results of ANN-GA-PSO are better than models based on single optimization such as ANN-BP, ANN-GA, ANN-PSO models. Further the paper also forecasts the electricity demand of Tamil Nadu based on two scenarios. First scenario is the “as-it-is” scenario, the second scenario is based on milestones set for achieving goals of “Vision 2023” document for the state. The present research also explores the causality between the economic growth and electricity demand in case of Tamil Nadu. The research indicates that a direct causality exists between GSDP and the electricity demand of the state.

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.

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

Diversified techniques have been applied in many research papers for the optimization of rehabilitation robotic movements in order to maintain smoothness and accuracy. Smooth and precise control is needed necessarily for upper limb rehabilitation robotic applications having five degree of freedom. The preferred parameters which are used for the controlling were validated by mathematical model and these tuning parameters were optimized. Designing optimization algorithms to control complex physical robots has been a challenging task. In this study, a number of optimization techniques will be analyzed to determine the optimal parameters of a PID controller with a dynamic model of the upper limb rehabilitation system. For determining optimal control parameters for PID, there exists a number of tuning methods such as Zeigler Nichols and fuzzy logic which are classical methods. Swarm intelligence-based optimization algorithms are inspired by the behaviors of living things in nature. Several researchers have reported the optimal design of PID controller parameters using optimization techniques. The proposed control technique has been implemented on a 5-DOF RAX hardware and before any clinical trials, six healthy subjects went for trials under strict protocol. It has been discovered that the proposed control technique rejects the external unwanted disturbances as well as keeps the system stable under extreme perturbed and harsh conditions. In this research paper mathematical models have been validated to determine the PID parameters for the optimization. The comparative study is carried out with four different cost functions since a well-designed objective function leads to better performance of the system and indicates control design expectations. These objective functions are an integral squared error (ISE) and integral absolute error (IAE). In this research work, the effects of different cost functions on optimization techniques for controller parameters were analyzed. The performance of the controller with different cost functions has examined for robustness analysis. The cost function of particle swarm optimization, Firefly, Ant Bee Colony and Ant Colony optimization were developed for the better optimization results.

Background: In today’s competitive market, predicting customer churn with high accuracy is crucial for enterprises to maintain growth and profitability. Traditional predictive models often lack in accuracy due to the complexity of customer behavior.Objective: This research aims to improve the accuracy of predicting customer churn by utilizing the Particle Swarm Optimization (PSO) algorithm for optimizing the hyperparameters of a composite deep learning model. The performance of this enhanced model is evaluated against traditional models such as LSRM_GRU, LSTM, GRU, and CNN_LSTM to demonstrate the effectiveness of PSO in hyperparameter tuning.Methods: A composite deep learning approach was employed, integrating various neural network architectures to leverage their strengths in modeling complex customer interactions. The PSO algorithm was used to optimize the model’s hyperparameters. Customer transaction and interaction data from different business operations served as the dataset for testing and analyzing the model’s performance. Evaluation metrics including accuracy, precision, recall, F1 score, and ROC AUC were utilized for a detailed comparison with established models.Findings: The PSO-enhanced composite deep learning model showed superior performance across all metrics, significantly outperforming the LSRM_GRU, LSTM, GRU, and CNN_LSTM models. Notably, improvements in ROC AUC and F1 score highlight the robustness and balanced precision-recall trade-off of the proposed model, demonstrating its effectiveness in identifying potential churners.Conclusion: The integration of PSO for hyperparameter optimization in composite deep learning models for customer churn prediction has proven to significantly enhance predictive accuracy and performance metrics over conventional models. This underscores the potential of evolutionary algorithms in improving deep learning applications. Future research should explore the scalability of this approach across various sectors and further refine predictive accuracy with evolving customer data.

P-band radar remote sensing applied during the Airborne Microwave Observatory of Subcanopy and Subsurface (AirMOSS) mission has shown great potential for estimation of root zone soil moisture. When retrieving the soil moisture profile (SMP) from P-band radar, a mathematical function describing the vertical moisture distribution is required. Because only a limited number of observations are available, the number of free parameters of the mathematical model must not exceed the number of observed data. For example, a second order polynomial that contains 3 free parameters was presumed based on in-situ SMP data. The polynomial is currently parameterized based on 3 backscatter observations provided by AirMOSS (i.e. one frequency at three polarizations of HH, VV and HV). In this paper, a more realistic, physically-based SMP model containing 3 free parameters is derived based on a solution to Richards’ equation for unsaturated flow in soils. Evaluation of the new SMP model based on both numerical simulations and measured data revealed that it exhibits greater flexibility for fitting measured and simulated SMPs than the currently applied polynomial. It is also demonstrated that the new SMP model can be reduced to a second order polynomial at the expense of fitting accuracy.

This article analyzes and compares the integration of two different maximum power point tracking (MPPT) control methods, which are tested under partial shading and fast ramp conditions. These MPPT methods are designed by Improved Particle Swarm Optimization (IPSO) and a combination technique between Neural Network and Perturb & Observe method (NN_P&O). These two methods are implemented and simulated for photovoltaic systems (PV), where various system responses, such as: voltage and power are obtained. The MPPT techniques were simulated using Matlab/Simulink environment. A comparison of the performance of IPSO and NN_P&O algorithms is carried out to confirm the best accomplishment of the two methods in terms of speed, accuracy and simplicity.

Designing high-voltage underground transmission lines poses complex challenges in heat management, trench optimization, and determining cable ampacity. This article introduces an innovative proposal that focuses on adjusting the dimensions of the thermal backfill as a primary strategy to enhance ampacity compared to the traditional approach of increasing the cross-sectional area of the cable core. The methodology employs a particle swarm optimization (PSO) technique with adaptive penalization, restart strategies, and parameter self-adaptation implemented in MATLAB. The objective of this approach is to provide more efficient solutions than traditional MATLAB PSO, demonstrating improved convergence and more accurate results with a success probability of 66.1\%. Although traditional PSO is 81\% faster, the proposed PSO stands out for its precision. Additionally, the incorporation of thermal backfill results in an 18.45\% increase in cable ampacity. Variations in the thermal resistivity of the soil, backfill, and ambient temperature are highlighted as sensitive factors affecting ampacity and backfill dimensions. This method is presented as a crucial tool in the early stages of the project and underground installation in operation with maximum ampacity, contributing to the continuous improvement of energy efficiency.

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

Waste heat recovery stands out as a promising technique to tackle both energy shortages and environmental pollution. Currently, this valuable resource, generated from processes like fuel combustion or chemical reactions, is often dissipated into the environment, despite its potential to significantly contribute to the economy. To harness this untapped potential, a travelling-wave thermo-acoustic generator has been designed and subjected to comprehensive experimental analysis. Fifty-two data corresponding to different working conditions of the system were extracted to build ANN, ANFIS and ANN-PSO models. Evaluation of performance metrics reveals that the ANN-PSO model demonstrates the highest predictive accuracy (R^2=0.9959), particularly in relation to output voltage. This research demonstrates the potential of machine learning techniques for the analysis of thermo-acoustic systems. By doing so, it is possible to get an insight into nonlinearities inherent to thermo-acoustic systems. This advancement empowers researchers to forecast the performance characteristics of alternative configurations with a heightened level of precision.

A quantum hybrid (QH) intelligent approach that blends the adaptive search capability of the quantum-behaved particle swarm optimisation (QPSO) method with the intuitionistic rationality of traditional fuzzy k-nearest neighbours (Fuzzy k-NN) algorithm (known simply as the Q-Fuzzy approach) is proposed for efficient feature selection and classification of cells in cervical smeared (CS) images. From an initial multitude of seventeen (17) features describing the geometry, colour, and texture of the CS images, the QPSO stage of our proposed technique is used to select the best subset features (i.e. global best particles) that represent a pruned down collection of seven (7) features. Using a dataset of almost 1000 images, performance evaluation of our proposed Q-Fuzzy approach assesses the impact of our feature selection on classification accuracy by way of three experimental scenarios that are compared alongside two other approaches: The All-features (i.e. classification without prior feature selection) and another hybrid technique combining the standard PSO algorithm with the Fuzzy k-NN technique (P-Fuzzy approach). In the first and second scenarios, we further divided the assessment criteria in terms of classification accuracy based on the choice of best features and those in terms of the different categories of the cervical cells. In the third scenario, we introduced new QH hybrid techniques, i.e. QPSO combined with other supervised learning methods, and compared the classification accuracy alongside our proposed Q-Fuzzy approach. Furthermore, we employed statistical approaches to establish qualitative agreement with regards to the feature selection in scenarios 1 and 3. The synergy between the QPSO and Fuzzy k-NN in the proposed Q-Fuzzy approach marginally improves classification accuracy as manifest in the reduction in number cell features, which is crucial for effective cervical cancer detection and diagnosis.

Nowadays genetic algorithm (GA) is greatly used in engineering pedagogy as an adaptive technique to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation challenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural selection and genetics concepts. GA is an intelligent use of random search supported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely used for maintaining high-quality reactions to optimize issues and problems investigation. These techniques are recognized to be somewhat of a statistical investigation process to search for a suitable solution or prevent an accurate strategy for challenges in optimization or searches. These techniques have been produced from natural selection or genetics principles. For random testing, historical information is provided with intelligent enslavement to continue moving the search out from the area of improved features for processing of the outcomes. It is a category of heuristics of evolutionary history using behavioral science-influenced methods like an annuity, gene, preference, or combination (sometimes refers to as hybridization). This method seemed to be a valuable tool to find solutions for problems optimization. In this paper, the author has explored the GAs, its role in engineering pedagogies, and the emerging areas where it is using, and its implementation.

(1) Background Diabetic Retinopathy (DR) is the primary cause of poor vision in young adults. Screening for DR is important but many patients do not attend; (2) Methods: We validated an algorithm for predicting DR and its progression by conducting a retrospective study of 11 children in a population of 120,389 T2DM (3) Results: By applying the algorithm to the population showed an AUC of 0.93 (95% CI, 0.92–0.94) for any-DR and 0.90 (95% CI, 0.89–0.91) for referable-DR(4) Conclusions: The algorithm is useful for predicting patients who could develop referable forms of DR and also for any-DR. This would allow a personalized screening plan to be drawn up for each patient.

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.

Maximum likelihood estimation (MLE) is a popular method for parameter estimation in both applied probability and statistics but MLE cannot solve the problem of incomplete data or hidden data because it is impossible to maximize likelihood function from hidden data. Expectation maximum (EM) algorithm is a powerful mathematical tool for solving this problem if there is a relationship between hidden data and observed data. Such hinting relationship is specified by a mapping from hidden data to observed data or by a joint probability between hidden data and observed data. In other words, the relationship helps us know hidden data by surveying observed data. The essential ideology of EM is to maximize the expectation of likelihood function over observed data based on the hinting relationship instead of maximizing directly the likelihood function of hidden data. Pioneers in EM algorithm proved its convergence. As a result, EM algorithm produces parameter estimators as well as MLE does. This tutorial aims to provide explanations of EM algorithm in order to help researchers comprehend it. Moreover some improvements of EM algorithm are also proposed in the tutorial such as combination of EM and third-order convergence Newton-Raphson process, combination of EM and gradient descent method, and combination of EM and particle swarm optimization (PSO) algorithm.

MAACS is a software architecture which layers multiple standard cipher algorithms together to increase the overall strength of the encrypted data stream, without modifying the standard algorithms, which have been heavily vetted from a cryptanalysis perspective and are already widely deployed. This layering technique makes the combination of algorithms significantly more resistant to traditional cryptanalysis attacks, while also addressing increased concerns over future quantum computing attacks against these algorithms. For example, concerns over published attacks against 256-bit AES and potential future attacks emanating from Grover’s algorithm and other unknowns in the quantum computing era are explored. Several approaches for evolving AES are considered. MAACS uses a concept termed "aperiodic modulation", whereby of a set of cryptographic algorithms are modified by an- other, independent software algorithm in an unpredictable, pseudo-random manner. In the MAACS reference architecture, a 256-bit ChaCha20 cryptographically secure pseudorandom number generator (CSPRNG) drives an aperiodic modulator that orchestrates encryption/decryption processes multiplexed across eight parallel 128-bit AES instances, yielding a cryptosystem with a composite strength of 1,376 bits or more in larger configurations.

The chicken poultry business is becoming a crucial sector for our nation's sustainable food supply. To increase the health of chickens in coops and maybe increase the output of chicken meat and eggs, several innovations and inventions have been developed. Therefore, the creation of an automated chicken feeding device might be highly beneficial for the expansion of the poultry sector. This equipment may take the role of a worker in the chicken feeding process, solving the industry's labor shortage and introducing a semi-automatic procedure. The main processor of the automated chicken feeding system is a Raspberry Pi 3 Model B+. The machine consists of five main components: a Raspberry Pi with an amplifier that makes noise to draw the attention of free-range chickens, a Raspberry Pi with a pi camera that counts and detects the chickens, a Raspberry Pi with a servomotor that moves the food from storage to a container, a Raspberry Pi with a load cell that controls the number of feeds to avoid waste on foods, and a Raspberry Pi with a temperature sensor that monitors the food's freshness. This enhances the coop's atmosphere while lowering labor costs, conserving food, and ensuring that the chickens are fed on time. It also regulates the temperature sensor to ensure that the chicken food is fresh and prevents food from becoming polluted by insects and chicken excrement.

We present a new method of estimating fitness of countries and complexity of products by exploiting a non-linear non-homogeneous map applied to the publicly available information on the goods exported by a country. The non homogeneous terms guarantee both convergence and stability. After a suitable rescaling of the relevant quantities, the non homogeneous terms are eventually set to zero so that this new method is parameter free. This new map reproduces the findings of the method proposed by Tacchella et al. [1], and allows for an approximate analytic solution in case of actual binarized matrices based on the Revealed Comparative Advantage (RCA) indicator. This solution is connected with a new quantity describing the neighborhood of nodes in bipartite graphs, representing in this work the relations between countries and exported products. Moreover, we define the new indicator of country net-efficiency quantifying how a country efficiently invests in capabilities able to generate innovative complex high quality products. Eventually, we demonstrate analytically the local convergence of the algorithm.

This paper describes an $\sim {\cal O}(n)$ pre-compute technique to speed up the Karatsuba algorithm for multiplying two numbers.

The algorithmic complexity vulnerability (ACV) that may lead to denial of service attacks greatly disrupts the security and availability of applications, and due to the widespread use of third-party libraries, its impact may be amplified through the software supply chain. The existing work in the field is dedicated to abstract loop or iterative patterns and fuzzing the entire application to discover algorithm complexity vulnerabilities, but they still face efficiency and effectiveness issues. Our research focuses on: (1) Proposing a representation and extraction method for code features related to algorithmic complexity vulnerabilities, helping analysts quickly understand program logic; (2) Providing a new ACV detecting model, focusing on the spatial complexity anomalies caused by deep recursion structures, and proposing a new filtering method; (3) Aiming at the difficulty of efficiently generating complex-data-type-related payloads using existing symbol execution techniques, a call-chain-guided payload construction method is proposed. We tested third-party components in the open-source Java Maven Repository, identified many unexposed vulnerabilities and 8 of them received CVE (Common Vulnerabilities & Exposures) identifiers, and demonstrated that our method can discover more algorithmic complexity vulnerabilities compared to existing tools with better performance.

This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.

This study is based on the BP neural network regression model optimised by genetic algorithm and dedicated to predicting the amount of car purchase, this study is important for all parties in the automotive industry. By plotting the violins of six indicators, including gender, age, annual salary, credit card debt, net worth, and car purchase amount, we found that, except for gender, the other data showed a trend of dense in the middle gradually decreasing to the upper and lower sides, with an overall normal distribution. The correlation analysis shows that the amount of car purchase has a high positive correlation with age (0.63), followed by annual income (0.62), the correlation between net worth and the amount of car purchase is 0.49, while the correlation between credit card debt and the amount of car purchase is low (0.03). In the experimental part, we analyse the predicted-actual values of the training and test sets in comparison and find that the model predicted values are very close to the actual values. The RMSE of the training set is 11.559 and the RMSE of the test set is 11.4835, which is not much different from each other, indicating that the model has good generalisation ability. In addition, the R2 of both the training and test sets is 1, indicating that the model fits well. The MAE of the training set is 8.2512 and the MAE of the test set is 9.578; the MBE of the training set is -4.3035 and the MBE of the test set is -2.4547.These metrics indicate that the model performs well in predicting the amount of car purchase. In conclusion, this study provides an effective and reliable method to predict the amount of car purchase, creating a useful bridge between car manufacturers, dealers and consumers.

Nowadays, the wasting of resources is one of the fundamental challenges of the industrial sector. The rectangle packing problem can be very effective in this context. Practical applications of this issue in the timing and designing of the industries and businesses are very remarkable. The purpose of this issue is to arrange a set of rectangles with specific dimensions in a rectangular page with a specific width and unlimited height without overlapping. The fundamental challenge in this issue is that this is an NP-complete issue. Therefore, it is difficult to achieve the best arrangement, which has the maximum rate of resource utilization and also has a linear running time. Many algorithms have been presented to estimate a practical solution for this issue. In the past decades, the best fit method has been one of the most useful methods for this purpose. This study presents a combinatorial algorithm based on two algorithms, including the lowest front-line strategy and the best-fit algorithm. The running results indicate that the suggested algorithm performs well, despite its simplicity. The time complexity of the suggested algorithm is O(nm), in which n is the number of input rectangles and m is the number of the created front lines.

In this study, Acısu Basin, which is upper side of one of the most important basins (Gediz) in Türkiye, was modelled using three types of hydrological models and three different calibration algorithms. Lumped (GR4J), semi-distributed (SWAT+), and fully distributed (mHM) hydrological models were built and integrated with Parameter Estimation Tool (PEST) which is a model independent calibration tool including various algorithms. Levenberg Marquardt (L-M), Shuffled Complex Evolution (SCE), and Covariance Matrix Adoption Evolution Strategy (CMA-ES) were selected as calibration algorithms. Calibration period was 1991-2000, and validation results were obtained for 2002-2005. The effect of model structure and calibration algorithm selection on discharge simulation was evaluated via comparison of 9 different model-algorithm combinations. Results have shown that mHM and CMA-ES combination showed the best discharge simulation performance according to NSE values (calibration: 0.67, validation: 0.60). Although statistically the model results were classified as acceptable, the pattern comparison of discharge value shows that all of the models miss the peak values in significant amounts. This problem may be related to the interventions made in 2000-2001 years interval and possible to overcome by changing the calibration and validation periods, increasing the number of iterations or using the naturalized gauge data.

Graph visualization has evolved significantly over time, offering various methods to effectively represent complex data structures. This study introduces a novel force-directed algorithm for 3D data visualization, specifically tailored for commonly used datasets in linked data visualization. Leveraging the power of graph theory and methods, the algorithm aims to address the challenge of creating visually appealing and easily interpretable visualizations, which often necessitate advanced user interaction. By utilizing 3D space and the Unity Engine, the research successfully visualizes data and develops interactive visualizations, overcoming limitations of basic force-directed implementations. The main contribution of presented research is in the force-directed algorithm with springs and controlled placement as a visualization technique that combines the use of springs and attractive forces to stabilize a graph in a 3D environment. The combination of these two techniques also helps prevent the formation of a single large cluster within the graph, enhancing the overall visualization quality.

The widespread adoption of electromobility constitutes one of the measures designed to reduce air pollution caused by traditional fossil fuels. However, several factors are currently impending this process, ranging from insufficient charging infrastructure, battery capacity, long queueing and charging time, to psychological factors. On top of range anxiety, the frustration of the EV drivers is further fueled by the lack the uncertainty of finding an available charging point on their route. To address this issue, we propose a solution that comes to bypass the limitations of the Reserve now function of the OCPP standard, enabling drivers to make charging reservations for the upcoming days, especially when planning a longer trip. We created an algorithm that generates reservation intervals based on the charging station's reservation and transaction history. Subsequently, we ran a series of test cases that yielded promising results, with no overlapping reservations.

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.

Information security plays a major role in the dynamics of today’s interconnected world. Despite the successful implementation and effectiveness of modern cryptographic techniques, their inherent limitations can be exploited by quantum computers. In this article we discuss Grover’s quantum searching algorithm and its impact on the security of modern symmetric ciphers. More specifically, we present its formal description and give an implementation of the algorithm using IBM’s Qiskit framework, which allows us to simulate and run the program on a real device. The developed program is modular and scalable, managing to properly run on any input state. We compare the performance of the algorithm running on the local simulator against its execution on a quantum processor from IBM’s lineup, noting the discrepancies between the results due to physical characteristics of the chip.

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

In this paper, we propose the set-membership quaternion normalized least-mean-square (SM-QNLMS) algorithm. For this purpose, first, we review the quaternion least-mean-square (QLMS) algorithm, then go into the quaternion normalized least-mean-square (QNLMS) algorithm. By having the QNLMS algorithm, we propose the SM-QNLMS algorithm in order to reduce the update rate of the QNLMS algorithm and avoid updating the system parameters when there is not enough innovation in upcoming data. Moreover, the SM-QNLMS algorithm, thanks to the time-varying step-size, has higher convergence rate as compared to the QNLMS algorithm. Finally, the proposed algorithm is utilized in wind profile prediction and quaternionic adaptive beamforming. The simulation results demonstrate that the SM-QNLMS algorithm outperforms the QNLMS algorithm and it has higher convergence speed and lower update rate.

The problem of event detection in general noisy signals arises in many applications; usually, either a functional form for the event is available, or a previous annotated sample with instances of the event that can be used to train a classification algorithm. There are situations, however, where neither functional forms nor annotated samples are available; then it is necessary to apply other strategies to separate and characterize events. In this work, we analyze 15 minute-long samples of an acoustic signal, and are interested in separating sections, or segments, of the signal which are likely to contain significative events. For that, we apply a sequential algorithm with the only assumption that an event alters the energy of the signal. The algorithm is entirely based on Bayesian methods.

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.

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.

Robotic odor source localization (OSL) is a technology that enables mobile robots or autonomous vehicles to find an odor source in unknown environments. An effective navigation algorithm that guides the robot to approach the odor source is the key to successfully locating the odor source. While traditional OSL approaches primarily utilize an Olfaction-only strategy, guiding robots to find the odor source by tracing emitted odor plumes, our work introduces a fusion navigation algorithm that combines both vision and olfaction-based techniques. This hybrid approach addresses challenges such as turbulent airflow, which disrupts olfaction sensing, and physical obstacles inside the search area, which may impede vision detection. In this work, we propose a hierarchical control mechanism that dynamically shifts the robot’s search behavior among four strategies: crosswind maneuver, Obstacle-avoid Navigation, Vision-based Navigation, and Olfaction-based Navigation. Our methodology includes a custom-trained deep-learning model for visual target detection and a moth-inspired algorithm for Olfaction-based navigation. To assess the effectiveness of our approach, we implemented the proposed algorithm on a mobile robot in a search environment with obstacles. Experimental results demonstrate that our Vision and Olfaction Fusion algorithm significantly outperforms Vision-only and Olfaction-only methods, reducing average search time by 54% and 30%, respectively.

In the past few decades, the transmission of data over an unsecure channel resulted in an increased rate of hacking. Therefore, the requirement to make multimedia data more secure is increasing day by day. Numerous algorithms are developed to improve efficiency and robustness. In this article, a novel and secure image encryption algorithm is presented. It is based on a modified chaotic logistic map (CLM) that provides the advantage of having less computational time to encrypt an input image. The encryption algorithm is based on Shannon’s idea of using substitution-permutation and one-time-pad network to achieve ideal secrecy. The CLM is used for substitution and permutation to improve randomness and increase dependency on the encryption key. Various statistical tests are conducted, such as Key Space Analysis, Complexity Analysis, Sensitivity Analysis, Strict Avalanche Criteria (SAC), Histogram Analysis, Entropy Analysis, Mean of Absolute Deviation (MAD) Analysis, Correlation Analysis, Contrast Analysis, and Homogeneity to give a comparative analysis of the proposed algorithm and verify its security. As a result of various statistical tests, it is evident that the proposed algorithm is more efficient and robust as compared to previous ones.

A number of accidents at sea are primarily caused by low visibility due to sea fog therefore, it is important to estimate sea fog intensity and visibility in real-time in the ocean environment. However, the existing estimation systems have significant costs so that it is not viable to install them at various locations, such as small vessels, minor ports, and a number of buoys. Therefore, this paper proposes an algorithm called RDCP (Reduced Dark Channel Prior) which provides the estimation at a low complexity and a low cost. For the estimation, the RDCP algorithm firstly acquires dark channels from an ocean image, then applies an optimized threshold value to the dark channels, and crops out the sky region in the ocean image. For the estimation performance evaluation, 320 raw images captured from cameras at four different ports in South Korea are used rather than artificially composed images. Considering facilities in oceans which are usually operated in the power limited environment, the processing time performance of PDCP are also examined. The experiments demonstrate that the RDCP algorithm provides reliable estimation performance in real-time.

To achieve an acceptable level of security on the web, the Completely Automatic Public Turing test to tell Computer and Human Apart (CAPTCHA) was introduced as a tool to prevent bots from doing destructive actions such as downloading or signing up. Mobile devices have small screens, and therefore, using the common CAPTCHA methods (e.g. text CAPTCHAs) in these devices raises usability issues. To introduce a reliable, secure, and usable CAPTCHA that is suitable for mobile devices, this paper introduces a hand gesture recognition CAPTCHA based on applying Genetic Algorithm (GA) principles on Multi-Layer Perceptron (MLP). The proposed method improves the performance of MLP-based hand gesture recognition. It has been trained and evaluated on 2201 videos of the IPN Hand dataset, and MSE and RMSE benchmarks report the index values of 0.0018 and 0.0424, respectively. Comparison with the related works shows a minimum of 1.79% fewer errors, and experiments produced a sensitivity of 93.42% and accuracy of 92.27% – 10.25% and 6.65% improvement compared to the MLP implementation.

By constructing a static map, the library robot can navigate and access documents autonomously, which greatly improves efficiency; however, for libraries where shelves can be moved, map changes do not allow for direct navigation, and also sensors such as radar and camera are relatively expensive, so we propose a low-cost navigation algorithm based on real-time ranging data and map matrices, and designed a mobile archive access robot. In order to obtain real-time distance data, nine near/long range sensors were mounted on the chassis and a composite digital filtering algorithm was designed based on different moving area characteristics; then the access task matrix and map matrix were designed based on the archive access task and the location characteristics of the archive shelf placement, the robot can rely on the range data to update the map matrix during the moving process, complete its own positioning, and use the task matrix The robot can use the task matrix to complete autonomous navigation and access to multiple files. Experiments show that the filtered positioning accuracy can reach 1cm, while the robot can move to the target shelf autonomously, which is more practical and less costly.

In this work we present a novel steganography algorithm, based on Fractal Transform domain, combined with the principles of Cryptography. The proposed method uses a private key, which will indicate which segment of the image will be taken and encoded with the Fractal Transform, to then insert the secret bits in the transformed coefficients, thus generating the stego image.

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.

In industrial environments, nesting consists in cutting or extracting pieces from a material sheet, with the purpose of minimizing the surface of the sheet used. This problem is present in different types of industries, such as shipping, aeronautics, woodworking, footwear, and so on. In this work, the aim is to find an acceptable solution to solve complex nesting problems. The research developed is oriented to sacrifice accuracy for speed so as to obtain robust solutions in less computational time. To achieve this, a greedy method and a genetic algorithm have been implemented, being the latter responsible for generating a sequence for the placement of the pieces, where each piece is placed in its current optimal position with the help of a representation system for both the pieces and the material sheet.

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

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

Monochromatic documents claim for much less computer bandwidth for network transmission and storage space than their color or even grayscale equivalent. The binarization of historical documents is far more complex than recent ones as paper aging, color, texture, translucidity, stains, back-to-front interference, kind and color of ink used in handwritting, printing process, digitalization process, etc. are some of the factors that affect binarization. This article presents a new binarization algorithm for historical documents. The new global filter proposed is performed in four steps: filtering the image using a bilateral filter, splitting image into the RGB components, decision-making for each RGB channel based on an adaptive binarization method inspired by Otsu's method with a choice of the threshold level, and classification of the binarized images to decide which of the RGB components best preserved the document information in the foreground. The quantitative and qualitative assessment made with 21 binarization algorithms in three sets of “real world” documents showed very good results.

In this paper, we consider the development of algorithms for the solution of first order initial value problems whose solution exhibits exponential behaviour. Method of interpolation and collocation of basis function to give system of nonlinear equations which is solved for the unknown parameters to give a continuous scheme. The discrete methods recovered from the continuous scheme are implemented in block form. The stability properties of the method is verified and numerical experiments show that our method is efficient in handling these problems

Data integrity and security are among the most essential things in this digital era performance. Digital certificates can be one solution to this problem. This research will develop the architecture of digital certificate verification and validation using blockchain. The blockchain concept for digital certificates uses three stages: requirements planning, workshop design, and implementation. Digital certificate files will be tested based on a scenario in which there could be any changes to those files, such as compressing files, changing data of files, inserting images in the file, and rotating files. This system architecture will detect any changes that could occur to the digital certificate file by using a digital signature, Keccak256 hash algorithm, and blockchain. This research shows that change detection accuracy for digital certificate files is 100%. However, there is a digital signature nature that could reduce the accuracy of change detection, and several solutions can be resolved. The average time to generate a signature using blockchain technology is 2.11 seconds, faster than 3.23 seconds when it does not use blockchain. The average time to validate a signature is 2.11 seconds without using blockchain, which is reduced to 0.22 seconds using blockchain technology. This research concludes that the architecture for digital certificate verification and validation using blockchain technology has successfully improved the security of digital certificates. Testing showed that even minor changes to a digital certificate could affect the signature, ensuring the certificate's integrity. For further research, evaluating the performance of various hash algorithms within the blockchain network is recommended.

Corrugated board, widely used in the packing industry, is a recyclable and durable material. Its strength and cushioning, influenced by geometry, environmental conditions like humidity and temperature, and paper quality, make it versatile. Double-walled (or five-ply) corrugated board, comprising two flutes and three liners, enhances these properties. This study introduces a novel approach to analyze 5-layered corrugated board, extending a previously published algorithm for single-walled boards. Our method focuses on measuring layer and overall board thickness, flute height, and center lines of each layer. Integrating image processing and genetic algorithms, the research successfully developed an algorithm for precise geometric feature identification of double-walled boards. Images were recorded using a special device with a sophisticated camera and image sensor for detailed corrugated board cross-sections. Demonstrating high accuracy, the method faced limitations only with very deformed or damaged samples. This research contributes significantly to quality control in the packaging industry and paves the way for further automated material analysis using advanced machine learning and image sensors. It emphasizes the importance of sample quality and suggests areas for algorithm refinement to enhance robustness and accuracy.

The real-time Railway Traffic Management Problem (rtRTMP) is discussed in the field of railway transportation. In this paper, rtRTMP is considered for planning shunting routes based on the use of routing methods on a spatial-temporal graph. An approach and algorithm of Spatial-Temporal Graph formation for rail yard transportation network is proposed. The idea is to construct an undirected loop-free Double Vertex Graph for determining optimal shunting routes consisting of several half-runs for several trains shunting under draw-out tracks capacity constraints. Experimental results on the rail yard simulation model are presented.

This paper is concerned with developing an efficient numerical algorithm for fast implementation of the sparse grid method for computing the $d$-dimensional integral of a given function. The new algorithm, called the MDI-SG ({\em multilevel dimension iteration sparse grid}) method, implements the sparse grid method based on a dimension iteration/reduction procedure, it does not need to store the integration points, nor does it compute the function values independently at each integration point, instead, it reuses the computation for function evaluations as much as possible by performing the function evaluations at all integration points in a cluster and iteratively along coordinate directions. It is shown numerically that the computational complexity (in terms of CPU time) of the proposed MDI-SG method is of polynomial order $O(Nd^3 )$ or better, compared to the exponential order $O(N(\log N)^{d-1})$ for the standard sparse grid method, where $N$ denotes the maximum number of integration points in each coordinate direction. As a result, the proposed MDI-SG method effectively circumvents the curse of dimensionality suffered by the standard sparse grid method for high-dimensional numerical integration.

Background Cesarean scar ectopic pregnancies are a rare form of extrauterine pregnancies, yet their incidence has increased along with the rise in the number of cesarean deliveries. As with other ectopic pregnancies, cesarean scar ectopic pregnancies pose a greater risk for maternal hemorrhage and ultimately maternal mortality. Case presentation We present a series of clinical cases of cesarean scar ectopic pregnancy diagnosed by transvaginal ultrasonography. Each patient received an individualized treatment: the rate of success depended on the particular maternal condition in each case. Due to the low frequency of this entity, there are no clear protocols for its treatment and thus there are numerous options for treatment and follow up: expectant management, medical therapy, surgical intervention, uterine artery embolization or a combined approach. Each method has different levels of success and is dependent on the surgeon’s skill and patient presentation. The transvaginal ultrasound is necessary to obtain the fine details of the gestation sac and its relation to the scar and must be followed by a meticulous abdominal scan with a full bladder. Conclusion Herein, we present a rare pathological phenomenon whose frequency is on the rise, and for which transvaginal ultrasound and flow doppler provide high diagnostic accuracy. Early diagnosis of cesarean scar ectopic pregnancies offers treatment options to that may help avoid uterine rupture and bleeding, thus preserving the uterus and future fertility.

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

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

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

The goal of this paper is to propose a dual version of the direct cosine simplex algorithm (DDCA) for general linear problems. Unlike the two-phase and the big-M methods, our technique does not involve artificial variables. Our technique solves the dual Klee-Minty problem in two iterations and solves the dual Clausen’s problem in four iterations. The utility of the proposed method is evident from the extensive computational results on test problems adapted from NETLIB. Preliminary results indicate that this dual direct cosine simplex algorithm (DDCA) reduces the number of iterations of two-phase method.

This study proposes a new algorithm termed rain cell identification and tracking (RCIT) to identify and track rain cells from high resolution weather radar data. Previous algorithms have limitations when tracking non-consequent rain cells owing to their use of maximum correlation coefficient methods and their lack of an alternative way to handle the variation stages of rain cells during their life cycles. To address these deficiencies, various methods are implemented in the new algorithm. These include the particle image velocimetry (PIV) method for motion estimation and the rain cell matching rule to obtain the stage changes of rain cells. High resolution (5-min and 1-km) radar reflectivity data from three rainy days over the German federal state North Rhine Westphalia (NRW) are used to evaluate the proposed algorithm. The performance of the new algorithm is compared with a radar reflectivity map and verified by two object-oriented methods: structure–amplitude–location (SAL) and geometric index. The verification results suggest that the performance of the new algorithm is good. Application of the RCIT algorithm to the selected cases shows that the inner structure of rainfall events in the experimental region present extreme value distributions, with most rainfall events having a short duration with less intensity. The new algorithm can effectively capture the stage changes of rain cells during their life cycles. The proposed algorithm can serve as the basis for further hydro-meteorological applications such as spatial and temporal analysis of rainfall events and short-term flood forecasting.

The EigenAnt algorithm has been proposed to find the shortest path between two nodes with a proof of convergence. Two novel features are noticeable in EigenAnt compared to the conventional ant colony optimization algorithms. Pheromone evaporation in the EigenAnt algorithm is done locally for the selected path and it does not use heuristic information in its selection phase. On the other hand, a simple version of ant colony optimization that also does not use heuristic information has been used for analyzing convergence, considering parameter impact analysis, in the problem of finding the shortest path for 1-node binary chain problems. In this paper, we propose to improve the EigenAnt algorithm by adding additional parameters in such a way as to be able to take advantage of the analysis developed for the simple ant colony optimization algorithm. We demonstrate through our analysis that since the Improved EigenAnt algorithm has one parameter more than ant colony optimization algorithms, tuning of convergence speed is decoupled from tuning of convergence features in the algorithm. Thus, IEigenAnt, which can be interpreted as having two uncorrelated intensification and diversification components, makes it possible to achieve a balance between intensification and diversification. In order to illustrate the advantages of this decoupling, we present experimental results for the routing network problem.

Telemedicine is the use of Information and Communication Technology (ICT) for clinical health care from a distance. The exchange of radiographic images and electronic patient health information/records (ePHI/R) for diagnostic purposes has the risk of confidentiality, ownership identity, and authenticity. In this paper, a data hiding technique for ePHI/R is proposed. The color information in the cover image is used for key generation, and stego-images are produced with ideal case. As a result, the whole stego-system is perfectly secure. This method includes the features of watermarking and steganography techniques. The method is applied to radiographic images. For the radiographic images, this method resembles watermarking, which is an ePHI/R data system. Experiments show promising results for the application of this method to radiographic images in ePHI/R for both transmission and storage purpose.

Algorithms, indispensable to understand Artificial Intelligence (AI), are omnipresent in social media but users’ understanding of these computational processes and the way they impact their consumption of information is often limited. There is a need for Media and Information Literacy (MIL) research investigating a) how MIL can support Algorithm Literacy (AL) as a subset of competences, and with what working definition, b) what competences users need in order to evaluate algorithms critically and interact with them effectively, and c) how to design learner-centred interventions that foster increased user understanding of algorithms and better response to disinformation spread by such processes. Based on Crossover project research, this paper looks at four scenarios of use by journalists, developers and MIL experts that mirror users’ daily interactions with social media. The results suggest several steps towards integrating AL within MIL goals, while providing a concrete definition of Algorithm-literacy that is experience-based. The competences and design considerations are organised in a conceptual framework thematically derived from the experimentation. This contribution can support AI developers and MIL educators in their co-design of algorithm-literacy interventions and guide future research on AL as part of a set of nested AI literacies within MIL.

3D Zernike moments based on 3D Zernike polynomials have been successfully applied to the field of voxelized 3D shape retrieval and have attracted more attention in biomedical image processing. As the order of 3D Zernike moments increases, both computational efficiency and numerical accuracy decrease. Due to this phenomenon, a more efficient and stable method for computing high-order 3D Zernike moments was proposed in this study. The proposed recursive formula for computing 3D Zernike radial polynomials combines the recursive calculation of spherical harmonics to develop a voxel-based algorithm for the calculation of 3D Zernike moments. The algorithm was applied to the 3D shape Michelangelo's David with a size of 150×150×150 voxels. As compared to the method without additional acceleration, the proposed method uses a group action of order sixteen orthogonal group and saving unnecessary iterations, the factor of speed-up is 56.783±3.999 when the order of Zernike moments is between 10 and 450. The proposed method also obtained an accurate reconstructed shape with the error rate (normalized mean square error) of 0.00 (4.17×10^-3) when the reconstruction was computed for all moments up to order 450.

There are many applications of anomaly detection in IoT domain. IoT technology consists of large number of interconnecting digital devices not only generating huge data continuously but also making real-time computations. Since IoT devices are highly exposed due to Internet, they frequently meet with the challenges of illegitimate accesses in the form of intrusions, anomaly, fraud, etc. Identifying these illegitimate accesses in IoT domain can be an exciting research problem. In numerous applications fuzzy clustering and rough set theory have been successfully employed. As the data generated in IoT domains are high-dimensional, the clustering methods used for lower dimensional data cannot be applied efficiently. In this article, mixed approaches consisting of nano topology and fuzzy clustering techniques are proposed for anomaly detection. First of all, the nano topology is generated to find lower dimensional apace and then a couple of well-known fuzzy clustering techniques are employed on it for the efficient anomaly detection. The effectiveness of the proposed approaches is evaluated using time-complexity analysis, experimental studies with a synthetic dataset and a real-life dataset along with comparative studies with traditional fuzzy clustering approaches namely fuzzy c-means clustering (FCM) algorithm, Gustafson-Kessel (GK) Algorithm, Gath-Geva (GG) Algorithm, Mahalanobis Distance based Fuzzy C-Means algorithm (M-FCM), and Common Mahalanobis Distance based Fuzzy C-Means algorithm (CM-FCM). Experimentally, it has been found that the proposed approaches outperform the aforesaid algorithms in terms of detection rates, accuracy rates, false alarm rates and computational times.

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

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.