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.

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

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.

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

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

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.

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.

In aerospace, robotics, network engineering and mechanical engineering, there exist complex and urgent challenges that can be abstracted into mathematical optimization problems. Therefore, exploring solutions to these optimization problems is a crucial task. Metaheuristic algorithms have been applied across various fields.The Snake Optimization Algorithm (SO) is an innovative metaheuristic method recognized for its efficient solving capabilities.However, this algorithm encounters challenges such as diminished search efficiency in the later stages and a propensity to become ensnared in local optima. To mitigate these issues, this paper introduces an enhanced Snake Optimization Algorithm (ISO). ISO integrates the RIME Algorithm(RIME)and introduces two effective enhancement strategies to improve its capability to evade local optima.To assess the effectiveness of ISO,the population distribution state was first measured using three algorithms, including Star Discrepancy, and the exploration and exploitation performance was analyzed using the CEC2017 test functions. Subsequently, utilized 23 benchmark functions for testing.The evaluation outcomes indicate that ISO exhibits outstanding performance in terms of convergence velocity and robustness.Additionally, it was applied to engineering fields including UAV path planning,Robot path planning, Wireless sensor network node deployment and Pressure vessel design.In comparison to the SO algorithm, the ISO algorithm demonstrates superior stability, converges earlier, and improves its ability to solve for optimal .These findings highlight the significant potential of the ISO algorithm in diverse test functions and a wide range of interdisciplinary problems.

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.

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.

Detecting small objects in images poses significant challenges due to their limited pixel representation and the difficulty in extracting sufficient features, often leading to missed or false detections. To address these challenges and enhance detection accuracy, this paper presents an improved small object detection algorithm, CRL-YOLOv5. The proposed approach integrates the CBAM attention mechanism into the C3 module of the backbone network, which enhances the localization accuracy of small objects. Additionally, the Receptive Field Block (RFB) module is introduced to expand the model's receptive field, thereby fully leveraging contextual information. Furthermore, the network architecture is restructured to include an additional detection layer specifically for small objects, allowing for deeper feature extraction from shallow layers. When tested on the VisDrone2019 small object dataset, CRL-YOLOv5 achieved an mAP50 of 39.2%, representing a 5.4% improvement over the original YOLOv5, effectively boosting the detection precision for small objects in images.

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

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.

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.

Deep learning neural networks require an immense amount of computation, especially in the training phase of the network when networks with multiple layers of intermediate neurons need to be built. In this paper, we will focus on the PSO algorithm with the aim of significantly accelerating the DLNN training phase by taking advantage of the GPGPU architecture and the Apache Spark analytics engine for large-scale data processing tasks. PSO is a bio-inspired stochastic optimization method whose goal is to iteratively improve the solution to a (usually complex) problem by attempting to approximate a given objective. However, parallelizing an efficient PSO is not a straightforward process due to the complexity of the computations performed on the swarm of particles and the iterative execution of the algorithm until a solution close to the objective with minimal error is achieved. In the present work, two parallelizations of the PSO algorithm have been implemented , both designed for a distributed execution environment. The synchronous parallel PSO implementation ensures consistency at the cost of potential idle time due to global synchronization, while the asynchronous parallel PSO approach improves execution time by reducing the need for global synchronization, making it more suitable for large datasets and distributed environments such as Apache Spark. Both variants of PSO have been implemented to distribute the computational load supported by this algorithm –due to the costly fitness evaluation and updating of particle positions– across the different Spark cluster executor nodes to effectively achieve coarse-grained parallelism, resulting in a significant performance increase over current sequential variants of PSO.

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.

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.

This paper aims to explore the potential application of Extreme Learning Machines (ELM) in stock price prediction and optimise the ELM model by combining the Crown Porcupine Optimisation Algorithm and the Adaptive Bandwidth Kernel Function Density Estimation Algorithm. Specifically, the model's root mean square error (RMSE) on the test set is 0.018, which shows its good prediction accuracy. Meanwhile, the correlation coefficient R reaches 0.968, proving the model's effectiveness in predicting stock prices. In addition, the coefficient of determination R² of the training set and test set are 0.987 and 0.954, respectively, which are not much different, indicating that the model has good generalisation ability and is not prone to overfitting. This is crucial for practical application, as it implies that the model fits the existing data well and makes accurate predictions for future data. In terms of other evaluation metrics such as Mean Absolute Error (MAE), Root Mean Square Error (RMSE) and Mean Absolute Percentage Error (MAPE), the performance is excellent in both the training and test sets. Together, these results indicate that after optimising the ELM by introducing the crown porcupine optimisation algorithm and the adaptive bandwidth kernel function density estimation algorithm, the model can effectively capture the changing stock price pattern, thus achieving efficient and accurate stock price prediction. In summary, this study not only demonstrates the great potential of ELM in stock price prediction but also highlights the importance of improving the model performance through advanced algorithm optimisation, which provides a new way of thinking and methodology for financial market analysis. This strongly supports investors' decision-making and lays the foundation for related research.

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.

Mobile inspections conducted by intelligent tunnel robots are instrumental in broadening the inspection reach, economizing on inspection expenditures, and augmenting the operational efficiency of inspections. Despite differences from fixed surveillance, mobile-captured traffic videos have complex backgrounds and device conditions that interfere with accurate traffic event identification, warranting more research. This paper proposes an improved algorithm based on YOLOv9 and DeepSORT for intelligent event detection in edge computing mobile device using the intelligent tunnel robot. The enhancements comprise the integration of the Temporal Shift Module to boost temporal feature recognition and the establishment of logical rules for identifying diverse traffic incidents in mobile video imagery. Experimental results show that our fused algorithm achieves a 93.25% accuracy rate, an inprovement of 1.75% over the baseline. The algorithm is also applicable to inspection vehicles, drones, and autonomous vehicles, effectively enhancing the detection of traffic events and improving traffic safety.

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.

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.

YOLOv8, as an efficient object detection method, can swiftly and precisely identify objects within images. However, traditional algorithms encounter difficulties when detecting small targets in remote sensing images, such as missing information, background noise, and interactions among multiple objects in complex scenes, which may affect performance. To tackle these challenges, we propose an enhanced algorithm optimized for detecting small objects in remote sensing images, named HP-YOLOv8. Firstly, we design the C2f-D-Mixer (C2f-DM) module as a replacement for the original C2f module. This module integrates both local and global information, significantly improving the ability to detect features of small objects. Secondly, we introduce a feature fusion technique based on attention mechanisms, named Bi-Level Routing Attention in Gated Feature Pyramid Network (BGFPN). This technique utilizes an efficient feature aggregation network and reparameterization technology to optimize information interaction between different scale feature maps, and through the Bi-level Routing Attention (BRA) mechanism, it effectively captures critical feature information of small target objects. Finally, we propose the Smooth Mean Perpendicular Distance Intersection over Union (SMPDIoU) loss function. The method comprehensively considers the shape and size of detection boxes, enhances the model's focus on the attributes of detection boxes and provides a more accurate bounding box regression loss calculation method. To demonstrate our approach's efficacy, we conduct comprehensive experiments across the RSOD, NWPU VHR-10, and VisDrone2019 datasets. The experimental results show that the HP-YOLOv8 achieves 95.11%, 93.05%, and 53.49% in the [email protected] metric, and 72.03%, 65.37%, and 38.91% in the more stringent [email protected]:0.95 metric, respectively.

The combination of encryption and digital watermarking technologies is a trend to achieve full lifecycle data protection. Recently, reversible data hiding in encrypted domain (RDHED) has greatly aroused the interests of many scholars. But the fixed order of first encryption and then watermarking makes this kind of algorithms unsuitable to many applications. Commutative encryption and watermarking (CEW) technology realizes the flexible combination of encryption and watermarking, and suits more applications. However, most existing CEW schemes for vector maps are not reversible and unsuitable to high precision maps. To solve this problem, here we propose a commutative encryption and reversible watermarking (CERW) algorithm for vector maps based on virtual coordinates which are uniformly distributed on the number axis. The CERW algorithm consists of virtual interval step based encryption scheme and coordinate difference based reversible watermarking scheme. In the encryption scheme, the map coordinates are moved randomly by multiples of virtual interval step defined as distance between two adjacent virtual coordinates. In the reversible watermarking scheme, difference expansion (DE) technique is used to embed the watermark bit into the coordinate difference computed based on the relative position of a map coordinate in a virtual interval. Since the relative position of a map coordinate in a virtual interval keeps unchanged during the coordinate scrambling encryption process, the watermarking operation and the encryption operation don’t interfere with each other and the commutativity between encryption and watermarking achieves. Results show that: proposed method has high security, high capacity and good invisibility. In addition, the algorithm is not only applicable to polyline and polygon vector data, but also can be applied to sparsely distributed point data which the traditional DE watermarking algorithm often fails to watermark.

Within environmental perception, automatic navigation and object detection, computer vision is a crucial and demanding field with many applications in modern industries, such as multi-target long-term visual tracking in automated production, defect detection, and driverless robotic vehicles with sensing ability. The performance of computer vision has greatly improved recently thanks to developments in deep learning algorithms and hardware computing capabilities, which has spawned the creation of a large number of related applications. This paper presents the results of a detailed review of over 50 papers published over the course of two decades (1999–2024), with a primary focus on the technical advancement of computer vision. To elucidate the foundational principles, an examination of typical visual algorithms based on traditional correlation filtering was initially conducted. Subsequently, a comprehensive overview of the most recent advancements in deep learning-based computer vision techniques was compiled. Furthermore, a comparative analysis between conventional and novel algorithms was undertaken to discuss the future trends and directions of computer vision. Lastly, the feasibility of employing visual SLAM (Simultaneous Localization and Mapping) algorithms in the context of autonomous vehicles with sensing capability was explored. Furthermore, we explored a thorough and efficient architecture for utilizing these techniques in autonomous robotic vehicles into unmanned green and low-carbon smart factories, underlining novel advances as well as potential prospects for future research.

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.

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.

As the fast growth of information technology (IT), the safety of image transmission and the storing of images are increasingly concerned. Traditional image encryption algorithms have certain limitations in transmission and security, so there is an urgent need for a secure and reliable image encryption algorithm. A universal compression sensing (CS) image encryption (IE) algorithm based on DNA-triploid mutation (DTM) is presented in this paper. Firstly, by using CS algorithm an image is compressed while obtaining a range of chaotic sequences by iteration of chaotic map. Then DNA sequences are generated by encoding the image, and based on the DTM, new mutant DNA sequences are generated according to specific rules. Next, the chaotic sequences are operated at the DNA level to do confusion and diffusion operations on the image to ensure the security of the data. At last, DNA decoding is carried out to obtain the compressed-encrypted image. Both simulation experiments and performance tests fully show that a high level of security and reliability of the proposed algorithm in protecting image privacy is achieved.

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.

In recent years, the AHRS has become an important research area. In order to improve the orientation measurement accuracy of AHRS, this paper first expounds the algorithm principle of the AHRS. Then, aiming at the problem of poor stability of the traditional gradient descent method under high dynamics or large magnetic field interference, a gain-scheduled anti-interference AHRS orientation algorithm is designed. By using the switching architecture designed with this algorithm for gain scheduling, it can ensure stable performance while being subjected to apparent acceleration and ferromagnetic interference. Finally, experimental verification is conducted, and the experimental results show that: in the presence of interference, the roll angle error is 0.0350°, the pitch angle error is 0.0277°, and the yaw angle error is 0.9611°, thereby verifying the strong anti-interference performance of the gain-scheduled AHRS orientation algorithm proposed in this paper.

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.

Tsallis entropy has been widely used in image thresholding because of its non-extensive properties. The non-extensive parameter q contained in this entropy plays an important role in various adaptive algorithms and has been successfully applied in bi-level image thresholding. In this paper, the relationships between parameter q and pixels’ long-range correlations have been further studied within multi-threshold image segmentation. It is found that the pixels’ correlations are remarkable and stable for images generated by a known physical principle, such as infrared images and medical CT images. And the corresponding non-extensive parameter q can be evaluated by using self-adaptive Tsallis entropy algorithm. The results of this algorithm are compared with those of Shannon entropy algorithm and the original Tsallis entropy algorithm, in terms of quantitative image quality evaluation metrics PSNR (Peak Signal-to-Noise Ratio) and SSIM (Structural Similarity). Furthermore, we observed that for image series with the same background, the q values determined by the adaptive algorithm are consistently kept in a narrow range. Therefore, similar or identical scenes during imaging would produce similar strength of long-range correlations, which provides potential applications for unsupervised image processing.

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.

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.

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.

Feature selection is predominantly used in machine learning tasks, such as classification and regression. It selects a subset of features (relevant attributes of data points) from a larger set that contributes as optimally as possible to the informativeness of the model. There are exponentially many subsets of a given set, and thus, the exhaustive search is only practical for problems with at most a few dozen features. In the past, there have been attempts to reduce the search space using dynamic programming. However, models that consider similarity in pairs of features besides the quality of individual features do not provide the required optimal substructure. As a result, algorithms, which we will call suboptimal dynamic programming algorithms, find a solution that may deviate significantly from the optimal one. In this paper, we propose a dynamic programming algorithm with an iterative upgrade where the order of feature processing is inverted in each iteration. Such an alternating approach allows for improving the optimization function by using the score from the previous iteration to estimate the contribution of unprocessed features. The iterative process is proven to converge and terminate when the solution does not change in three successive iterations or when the number of iterations reaches the threshold. Results in more than 90 % of tests align with those of the exhaustive search, being competitive and often superior to the reference greedy approach. The validation was done by comparing the scores of output feature subsets and examining the accuracy of different classifiers learned on these features. In the context of feature selection, the proposed algorithm can be characterized as a filter method. However, we expect that the idea of alternating suboptimal optimization will soon be generalized to tasks beyond feature selection.

The emerging wireless energy transfer technology enables sensor nodes to maintain perpetual operation. However, maximizing the network performance while preserving short charging delay is a great challenge. In this work, a Wireless Mobile Charger (WMC) and a Directional Charger (DC) are deployed to transmit wireless energy to the sensor node to improve the network's throughput. To the best of our knowledge, this is the first work to optimize the data sensing rate and charging delay by joint scheduling of MC and DC. We prove we can transmit maximum energy to each sensor node to obtain our optimization objective. In our proposed work, a DC selects a total horizon of equipped with DCs, which selects the horizon of each specific area with based on its antenna orientation. DC's orientation is scheduled for each time slot. Furthermore, multiple MCs are used to transmit energy for sensor nodes which cannot be covered by DCs. We divided the Rechargeable Wireless Sensor Network into several zones via the Voronoi diagram. We deployed a static DC and one MC charging location in each zone to provide wireless charging service jointly. We obtain the optimal charging location of MCs in each zone by solving Mix Integral Programming for energy transmission. The optimization objective of our proposed research is to sense maximum data from each sensor node with the help of maximum energy. The lifetime of each sensor network can increase, and the end delay can be maximized with joint energy transmission. Extensive simulation results demonstrate that our RWSNs are designed significantly to improve network lifetime over the baseline method.

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.

High dimensional datasets are highly likely to have redundant, irrelevant, and noisy features that negatively affect the performance of the classification algorithms. Selecting the most relevant features and reducing the dimensions of datasets by removing the undesired features is a dimensional reduction technique called Feature Selection (FS). In this paper, we propose an FS approach based on the Black Hole Algorithms (BHO) with a mutation technique called MBHO. Generally, BHO contains two major phases. At the exploitation phase, a set of stars are modified based on some rule and according to some objective function, the best star is selected as the black hole which attracts other stars. Furthermore, when a star gets closer to the event horizon, it will be swallowed and a new one will be randomly generated in the search space which thus is the exploration phase. However, randomness may cause the algorithm to fall into the trap of local optima, and to overcome such complications, inversion mutation is used. Furthermore, we modify a widely utilized objective function in most of the proposed works for wrapper feature selection by combining two new terms that are based on the correlation among the selected subset of features and the features and the classification label. We also utilize a transfer function, known as the V2 transfer function, to convert continuous values into discrete ones to enhance search. We assess our approach via extensive evaluation experiments using fourteen benchmark datasets. We benchmark the performance of a wrapper FS approach called Binary Cuckoo Search (BCS), and three filter-based FS approaches (namely Mutual Information Maximisation (MIM), Joint Mutual Information (JMI), and minimum Redundancy Maximum Relevance (mRMR)). Our evaluation has shown that the proposed model is an effective approach for FS, in selecting better features that enhance the performance metrics on the classifiers. Thus, MBHO can be utilized as one alternative to the existing state-of-art-approaches. We release the source codes of our implementation for the community to build on with new methods and datasets.

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.

The rapid progress in renewable energy sources and the increasing complexity of energy distribution networks have highlighted the need for efficient and intelligent energy management systems. This paper presents a comparative analysis of two optimisation algorithms, P and M70, used for the optimal control of the operation of microgrids in islanded mode. The main objective is to minimise production costs while ensuring a reliable energy supply. Algorithm P prioritises the use of photovoltaic (PV) and battery storage and operates the diesel generator at minimum capacity to reduce fuel consumption and maximise the use of renewable energy sources. Algorithm M70, on the other hand, uses a heuristic approach to adaptively manage energy resources in real time. In this study, the performance of both algorithms is evaluated through simulation in different operating scenarios. The results show that both algorithms significantly improve the efficiency of the microgrid, with the M70 algorithm showing better adaptability and cost efficiency in dynamic environments. This research contributes to ongoing efforts to develop robust and scalable energy management systems for future smart grids.

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.

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.

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.

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.

The relentless advancement and integration of mechanization and intelligence within the coal mining industry, combined with the increasing depths of mining operations, necessitate significantly higher safety standards. This necessity arises due to the increasingly complex geological and coal seam conditions encountered as mining operations delve deeper into the earth. Traditionally, 3D seismic exploration technology has been fundamental in ensuring both operational efficiency and safety in the coal mining sector. However, despite its critical role, this technology still has limitations in detecting and characterizing small-scale geological structures which can pose substantial risks if not accurately identified and mitigated. To address these challenges, this paper introduces a sparsity-constrained adaptive hard thresholding algorithm designed to tackle the spectral inversion optimization problem with an norm constraint for the enhanced retrieval of reflection coefficients, thereby establishing a comprehensive workflow for enhancing seismic data resolution through compressed sensing spectral inversion. Real data validation has demonstrated that this method significantly enhances the resolution of seismic data while maintaining the amplitude integrity and fidelity of the original signals. This improvement allows for a more detailed and accurate characterization of small-scale geological features, which are critical in identifying and mitigating potential hazards within coal mining operations, thus offering robust support for the implementation of more effective safety protocols and disaster prevention strategies in coal mines.

This research aims to apply Artificial Intelligence (AI) methods, specifically Artificial Immune Systems (AIS), to design an optimal control strategy for a multivariable control plant. Two specific industrial control approaches are investigated: I-PD (Integral-Proportional Derivative) and PI-D (Proportional-Integral Derivative) control. The motivation for using these variations of PID controllers is that they are functionally implemented in modern industrial controllers, where they provide precise process control. The research results in a novel solution to the control synthesis problem for the industrial system. In particular, the research deals with the synthesis of I-P control for a two-loop system in the technological process of a distillation column. This synthesis is carried out using the AIS algorithm, which is the first application of this technique in this specific context. Methodological approaches are proposed to improve the performance of industrial multivariable control systems by effectively using optimization algorithms and establishing modified quality criteria. The numerical performance index ISE justifies the effectiveness of the AIS-based controllers in comparison with conventional PID controllers (ISE₁ = 1.865, ISE₂ = 1.56). The problem of synthesis of the multi-input multi-output (MIMO) control system is solved, considering the interconnections due to the decoupling procedure.

The Electric Fish Optimization (EFO) Algorithm is inspired by the predation behavior and communication of weak electric fish. It is a novel meta-heuristic algorithm that attracts researchers because it has few tunable parameters,high robustness,and strong global search capabilities. Nevertheless, when operating in complex environments, the EFO algorithm encounters several challenges including premature convergence, susceptibility to local optimum, and issues related to passive electric field localization stagnation. To address these challenges, this study introduces an Adaptive Electric Fish Optimization Algorithm Based on Standstill Label and Level Flight (SLLF-EFO). This hybrid approach incorporates the Golden Sine Algorithm and Good Point Set Theory to augment the EFO algorithm’s capabilities, employs a variable step size Levy flight strategy to efficiently address passive electric field localization stagnation problems, and utilizes a standstill label strategy to mitigate the algorithm’s tendency to fall into local optimum during the iterative process. By leveraging multiple solutions to optimize the EFO algorithm, this framework enhances its adaptability in complex environments. Experimental results from benchmark functions reveal that the proposed SLLF-EFO algorithm exhibits improved performance in complex settings, demonstrating enhanced search speed and optimization accuracy This comprehensive optimization not only enhances the robustness and reliability of the EFO algorithm but also provides valuable insights for its future applications.

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.

(1) Background: In most cases, passive isolation control methods are commonly used for the seismic isolation design of bridge engineering. However, for passive seismic isolation devices, due to their non-adjustable performance parameters, it is challenging to achieve a good seismic isolation effect for structures under random and variable seismic loads in the wide frequency range of 0 Hz to 20 Hz; (2) Methods: the sensitivity of the design parameters of the seismic isolation bearing was analyzed using the optimization center gradient method, and an improved genetic algorithm was employed to quickly optimize and obtain the optimal design parameters; (3) Results: the effectiveness of the three-dimensional seismic isolation bearing was validated through experiments. (4) Conclusions: The multi-factor sensitivity analysis approach used in this study for designing novel isolation bearings is applicable not only to seismic design in bridges but also serves as a reference for parameter design in isolation bearings requiring medium to high precision in seismic performance.

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.

Drug-resistant tuberculosis (DR-TB) and HIV-coinfection present a conundrum to public health globally, and the achievement of the global END TB strategy in 2035. A descriptive, retrospective review of medical records of patients diagnosed with DR-TB who received treatment was conducted. Student’s t-test was performed to assess differences between two means and ANOVA between groups. Either the Chi-square test with and without trend or Fischer’s exact test was used to test the degree of association of categorical variables. Logistic regression was used to determine predictors of DR-TB treatment outcomes. Also, a decision tree classifier, which is a supervised machine learning algorithm was used. Python version 3.8. and R version 4.1.1 software were used for data analysis. A p-value of 0.05 with a 95% confidence interval (CI) was used to determine statistical significance. A total of 456 DR-TB patients were included in the study with more male patients (n = 256, 56.1%) than female patients (n = 200, 43.9%). The overall treatment success rate was 61.4%. There was a significant decrease in the % of patients cured during the Covid-19 pandemic compared to the pre-pandemic period. Our findings showed that machine learning can be used to predict TB patients' treatment outcomes.

Snow cover products are primarily derived from the Moderate-resolution Imaging Spectrometer (MODIS) and Advanced Very High-Resolution Radiometer (AVHRR) datasets. MODIS achieves both snow/non-snow discrimination and snow cover fractional retrieval, while early AVHRR-based snow cover products only focused on snow/non-snow discrimination. The AVHRR Climate Data Record (AVHRR -CDR) provides a nearly 40-year global dataset that has a potential to fill a gap in long term snow cover fractional monitoring. Our study selects the Qinghai-Tibet Plateau as the experimental area, utilizing AVHRR-CDR surface reflectance data (AVH09C1) and calibrating with MODIS snow product MOD10A1. The snow cover percentage retrieval from the AVHRR dataset is performed using Surface reflectance at 0.64μm (SR1) and Surface reflectance at 0.86μm (SR2), along with a simulated Normalized Difference Snow Index (NDSI) model. Also, in order to detect the effects of land cover type and topography on snow inversion, we tested the accuracy of the algorithm with and without these influences, respectively (vanilla algorithm & improved algorithm). The accuracy of the AVHRR snow cover percentage data product is evaluated using MOD10A1、 ground snow-depth measurements and ERA5. Results indicate that the logic model based on NDSI has the best fitting effect, with R-square and RMSE values of 0.83 and 0.10, respectively. Meanwhile, the accuracy was improved after taking into account the effects of land cover type and topography. The model is validated using MOD10A1 snow-covered areas, showing snow cover area differences of less than 4% across 6 temporal phases. Improved algorithm results in better consistency with MOD10A1 than vanilla algorithm. Moreover, the RMSE reaches greater levels when the elevation is below 2,000 meters or above 6,000 meters, and is lower when the slope is between 16° and 20°. Using ground snow-depth measurements as ground truth, the multi-year recall rates are mostly above 0.7, with an average recall rate of 0.81. Results also show a high degree of consistency with ERA5. The validation results demonstrate that the AVHRR snow cover percentage remote sensing product proposed in this study exhibits high accuracy in the Tibetan Plateau region, also demonstrating that land cover type and topographic factors are important to the algorithm. Our study lays the foundation for the global snow cover percentage product based on AVHRR-CDR，furthermore lays a basic work for generating a long-term AVHRR-MODIS fractional snow cover dataset.

With the offshore oil-gas fields entering decline phase, high-efficiency separation of oil-gas-water mixtures becomes a significant challenge. As essential equipment for separation, the three-phase separators play a key role in Offshore Oil-Gas production. However, level control is critical in the operation of three-phase gravity separators on offshore facilities, as it directly affects the efficacy and safety of the separation process. This paper introduces an advanced deep deterministic policy gradient with adaptive learning rate weights (ALRW-DDPG) control algorithm, which improves the convergence and stability of the conventional DDPG algorithm. An adaptive learning rate weight function is meticulously designed, and an ALRW-DDPG algorithm network is constructed for simulating three-phase separator liquid level control. The effectiveness of the ALRW-DDPG algorithm is subsequently validated through simulation experiments. The results show that the ALRW-DDPG algorithm achieves a 15.38% improvement in convergence rate compared to the traditional DDPG algorithm, and the control error is significantly smaller than that of PID and DDPG algorithms.

To achieve real-time identification of soybean seedlings and weeds in soybean seedling fields on agricultural intelligent terminal devices, this article constructs a real-time evolutionary identification system ESWIM driven by computational complexity under few-shot training. Firstly, based on the identification task, high-quality image samples are collected and annotated. By analyzing the terrain, the weather during the growth period, image acquisition methods, and the status of equipment fieldwork, we obtained a suitable enhancement algorithm. This algorithm not only effectively simulates the diversity of actual images, but also solves the problem of significant imbalance in the number of targets. Then, using the computational complexity driven approach and YOLOv5n as the foundation model, a soybean seedling and weed recognition model SWIM is constructed. The model's computational space and time complexity are reduced by 45.19% and 42.86%, respectively, while mAP (0.5) increased by 0.1%. Finally, by utilizing human-computer interaction to enable real-time and effective evolution of the dataset, an evolutionary strategy is designed to rapidly iterate and update model parameters, resulting in the development of the evolutionary system ESWIM. Laboratory experiments have shown that the ESWIM system can quickly adjust the recognition system during device operation to achieve target identification tasks in different environments.

This paper presents a new semi-explicit algorithm for parameters estimation in a time-fractional generalization of dual-phase-lag heat conduction model with the Caputo fractional derivatives. It is shown that this model can be derived from a general linear constitutive relation for the heat transfer by conduction when the heat conduction relaxation kernel contains the Mittag-Leffler function. The model can be used to describe heat conduction phenomena in a material with power-law memory. The proposed algorithm of parameters estimation is based on the time integral characteristics method. The explicit representations of the thermal diffusivity and the fractional analogues of the thermal relaxation time and the thermal retardation are obtained via a Laplace transform of the temperature field and utilized in the algorithm. An implicit relation is derived for the order of fractional differentiation. In the algorithm, this relation is resolved numerically. An example illustrates the proposed technique.

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.

Meta-heuristic algorithms are methods that try to solve problems by imitating events and systems existing in nature. It can be very difficult to solve nonlinear problems with the help of known classical algorithms. In this study, a new meta-heuristic method, the Pi algorithm, is proposed. Pi is a special number that is not periodic and contains many different number combinations in its digits calculated so far. The most important part of meta-heuristic methods is the equations and parameters used to ensure the diversity of the created population. In this study, a specific Pi coefficient for each attribute was calculated with the help of the Monte-Carlo method. These coefficients were used in the Pi algorithm in other parts of the study. In the application for data clustering, experiments were made on 5 different data sets. The best accuracy rate of 95.5% was achieved. In this respect, it has been seen that the Pi algorithm works successfully as a meta-heuristic method. It can be studied on a population-based data clustering, classification, prediction, etc. It can be easily applied in all areas.

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.

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.

As waterflooding multi-layer reservoirs get into the high-water-cut stage, inter-layer conflicts become increasingly serious, leading to a worsening development effect over time. Production layers regroup is an effective approach for resolving inter-layer conflicts and improving waterflooding efficiency. At the current stage, there are limitations for most of the methods of production layers regroup. This article proposes a smart method for optimizing the layer regroup plan based on genetic algorithm. Comprehensively considering various factors that affect the regroup of layers, based on the combination principle of "smaller intra-group variance and larger inter-group variance of each influencing factor are expected ", genetic algorithm is used to calculate the fitness value of the initial combination schemes, the advantageous schemes with higher fitness values are selected as the basis of the next generation. Then crossover and mutation operations are performed to those advantageous schemes to generate new schemes. Through continuous selection and evolution, until the global optimal solution with the highest fitness value is found, the optimal combination scheme is determined. Comparative analysis with numerical simulation results demonstrates the reliability of this intelligent method, with an increased oil recovery of 4.34% for the sample reservoir. Unlike selecting a preferable plan from a limited number of predefined combination schemes, this method is an automatic optimization to solve the optimal solution of the problem. It improves both efficiency and accuracy as compared to conventional reservoir engineering methods, numerical simulation methods and most of the mathematical methods, thus could provide effective guidance for EOR strategies of waterflooding reservoirs in high-water-cut stage.

In the Internet of Things (IoT) era, Mobile Edge Computing (MEC) significantly enhances the efficiency of smart devices but is limited by battery life issues. Wireless Power Transfer (WPT) addresses this issue by providing a stable energy supply. However, effectively managing overall energy consumption remains a critical and under-addressed aspect for ensuring the network’s sustainable operation and growth. In this paper, we consider a WPT-MEC network wit user cooperation to migrate the double near-far effect for the mobile node (MD) far from the base station. We formulate the problem of maximizing long-term computation rates under a power consumption constraint as a multi-stage stochastic optimization (MSSO) problem. This approach is tailored for a sustainable WPT-MEC network, considering the dynamic and varying MEC network environment, including randomness in task arrivals and fluctuating channels. We introduce a virtual queue to transform the time-average energy constraint into a queue stability problem. Using the Lyapunov optimization technique, we decouple the stochastic optimization problem into a deterministic problem for each time slot, which can be further transformed into a convex problem and solved efficiently. Our proposed algorithm works efficiently online without requiring further system information. Rigorous mathematical analysis shows that our algorithm achieves O(1/V),O(V) trade-off between computation rate and queues stability. Extensive simulation results demonstrate that our proposed algorithm outperforms baseline schemes, achieving approximately 4% enhancement while maintain the queues stability.

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.

Systemic Lupus Erythematosus (lupus) and B-cell lymphoma (lymphoma) are serious diseases. Lupus and lymphoma co-occur at higher-than-expected rates and primarily depend on B-cells for their pathology, implicating shared inflammation-related B-cell molecular mechanisms as a potential cause of co-occurrence. We consequently implemented a novel Immune Imbalance Transcriptomics (IIT) algorithm and applied IIT to lupus, lymphoma, and healthy B-cell RNA-seq data to find shared- and contrasting mechanisms potentially targetable for treatment. We observed 8,562 genes significantly dysregulated in both lupus and lymphoma. Of those genes, we found 5,335 to have a significant immune imbalance, defined as significant dysregulation by both diseases, as determined by IIT. Gene Ontology (GO) term and pathway enrichment of IIT genes yielded immune-related “Neutrophil Degranulation” and “Adaptive Immune System”, validating that the IIT algorithm isolates biologically relevant genes in immunity and inflammation. We found that 389 IIT gene products are drug-targetable with established or repurposed drugs. Among our results, we found 40 known and 349 novel lupus targets, along with 151 known and 238 novel lymphoma targets. Known disease drug targets in our IIT results further validate that IIT isolates genes with disease-relevant mechanisms. We anticipate the IIT algorithm and shared and contrasting gene mechanisms uncovered here will contribute to the development of immune-related therapeutic options for lupus and lymphoma patients.

This study introduces a novel algorithm tailored for the precise detection of lower outliers in univariate datasets, particularly suited for scenarios with a single cluster. The approach leverages a combination of transformative techniques and advanced filtration methods to efficiently segregate anomalies from normal values. Notably, the algorithm emphasizes high precision, ensuring minimal false positives, and requires only a few parameters for configuration. Its unsupervised nature enables robust anomaly filtering without the need for extensive manual intervention. To validate its efficacy, the algorithm is rigorously tested using real-world data obtained from photovoltaic (PV) module strings with similar DC capacities, containing various anomalies. Results demonstrate the algorithm's capability to accurately identify lower outliers while maintaining computational efficiency and reliability in practical applications.

Hyperspectral imaging, a rapidly evolving technique, furnishes exhaustive information on Earth's surface reflectance over an extensive spectrum of wavelengths. We have developed a more precise method for analyzing spectral data by meticulously selecting plant leaf pixels and employing a relative reference approach. This enhanced technique correlates camera pixel values with light intensity, bypassing the need for complex equations and thereby providing clearer insights into vegetation vitality. The findings of this study not only enhance the precision of hyperspectral imaging but also bolster our capability for ecological monitoring and understanding environmental health. A novel algorithm based on the red-edge slope was established to classify images, exploiting the spectral reflectance data gleaned from the hyperspectral Liquid Crystal Tunable Filter (LCTF) camera. Compared with conventional SVM and K-means algorithms, our novel algorithm demonstrated commendable performance, achieving an overall accuracy of 90% with a Kappa Coefficient of 0.86. This comparison highlights the novel algorithm's relative strength and potential for large-scale satellite and drone imagery analysis applications. The advancements facilitated by this research are instrumental in ecological assessments, conservation efforts, and resource management strategies, signaling a leap forward in the era of environmental monitoring and analysis.

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

As an important civil and military infrastructure, airport runway pavement is faced up with threats from cluster munitions, since it is vulnerable to projectile impact with internal explosion. Aiming at the damage assessment of island airport runway pavement under impact, this work dealt with discrete modeling of rigid projectile penetration into concrete pavement and calcareous sand subgrade multi-layer structure. First, Discrete Element Method (DEM) is introduced to model concrete and calcareous sand granular material features like cohesive fracture and strain hardening due to compression, with mesoscale constitutive laws governing the normal and shear interactions between adjacent particles. Second, sequent DEM simulations of uniaxial and triaxial compression were performed to calibrate the DEM parameters for pavement concrete as well as subgrade calcareous sand. Piror to multi-layer structure investigations, penetration into sole concrete or calcareous sand is validated in terms of projectile deceleration and depth of penetration (DOP) with relative error

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.

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.

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.

Aiming at the APF algorithm in the collision-free path planning and LQR algorithm tracking process, there are problems such as unreachable target points, local optimization, low safety coefficient of autonomous lane change collision avoidance tracking control and poor stability, this paper proposes an optimized APF method, which solves the defects of the traditional artificial potential field method by adding the distance adjustment factor, the safety distance protection model and the sub-target virtual potential field, and at the same time generates the autonomous driving car collision-free path. The path tracking control system is designed based on feed-forward control and DLQR controller, in which the vehicle dynamics state space model is used as the basis, the model is linearized and discretized, and the corresponding constraint variables are set to minimize the control command objective cost function under the constraints, and the objective of the DLQR controller.The objective is to accurately determine the steering angle in order to achieve path tracking and eliminate the lateral error between the reference path and the actual path caused by external interference.Finally, the simulink model and CarSim parameter configuration joint simulation platform are built, and different obstacle scenarios and different speeds are selected for collision-free path planning and tracking motion simulation research and analysis, which verifies the accuracy and practicability of the algorithm, and shows more obvious advantages in obstacle avoidance ability, path smoothing degree, and collision avoidance safety stability. The ideas proposed in this paper are expected to be further extended and popularized to actual path planning problems, which has important practical significance and engineering value.

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.

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.

Modular inversion on large operands is a time-consuming calculation used in elliptic curve cryptography. Its hardware implementation requires extensive hardware resources such as lookup tables and registers. We investigate state-of-the-art modular inversion algorithms and evaluate the performance and cost of the algorithms and their hardware implementations. We then propose a high-radix modular inversion algorithm aimed at short execution time and low hardware cost. We present a detailed radix-8 hardware implementation based on 256-bit primes in Verilog HDL and compare its cost performance with other implementations. Our implementation on the Altera Cyclone V FPGA chip uses 1227 ALMs (Adaptive logic modules) and 1037 registers. The modular inversion calculation takes 3.67 microseconds. The AT (Area time) factor is 8.30, outperforming other implementations. We also present an implementation of elliptic curve cryptography using the proposed radix-8 modular inversion algorithm. The implementation results also show that our modular inversion algorithm is more efficient in area time than other algorithms.

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.

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.

Background. Keyword co-occurrence analysis is a crucial tool for comprehending research trends, identifying relevant studies, and gaining insight into the connections between various concepts and topics. Objective. This study focuses on analyzing the co-occurrence of keywords using FP-growth algorithm and direct search methods. Materials and methods. The methodology involved extracting bibliometric data of Energies journal for 2023-2024 from MDPI publisher platform, keyword lemmatization and keyword co-occurrence estimation. Clustering and visualization were performed using Multidendrograms and Scimago Graphica software. Results. The results showed that the FP-growth algorithm can achieve a close match with the direct search results, which facilitates data preparation for clustering. In addition, finding the co-occurrence of three or more keywords significantly reduced the number of possible combinations, which allowed the identification of specific research topics. Conclusions. This study highlights the usefulness of the FP-growth algorithm in keyword analysis and provides insights into ways to refine search queries to abstract databases for the purpose of designing and writing literature and systematic reviews.

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.

Abstract: NFinFET transistors with fin channel length 90nm and a planar MOSFET transistor with channel length 180nm and 90nm are presented with characteristic curves at various gate biases. A finalized algorithm with kink effects is effectively responsible for addressing the field effect transistors. The algorithm includes the modified conventional current-voltage formula and a nonlinear heat-associated kink solution which is simplified as a Gaussian form. Three parameters in modified model includes kN (related with channel width, channel length, and gate oxide capacitor, and proportional to the mobility of carriers)Vth(Threshold Voltage), and (the inverse of Early Voltage). Those parameters are determined to minimize the discrepancies between the measured data and the fitting values, but leave kinks located at around (VGS－Vth), which are deliberately eliminated by the Gaussian form because of the agitation of thermal kink effects. The whole fitting is made to be as close as the as-measured IDS-VDS. In the mean time, those determined parameters are physically meaningful after the analysis has been done.

This study aims to automate the optimization of a Full-Range speaker in an SUV's audio system according to the equal loudness contours principle. The input signal, and frequency responses of the amplifier and speaker were transferred to Matlab. Using ideal filter parameters, ten parametric equalizer models were created, and the speaker output was obtained using the convolution technique. The same filter settings were applied to the vehicle multimedia system, and experimental results were obtained. The simulation and experimental results were compared, showing high similarity with a Pearson correlation coefficient of 0.9295 and an RMSE of 2.29. Results were compared with the ideal contour. The Pearson correlation coefficients for simulation and experimental results were 0.6341 and 0.6715, with RMSE values of 4.88 and 2.57, showing low similarity. Consequently, each parametric equalizer filter's parameters were optimized using a genetic algorithm. The optimized parameters were applied to the vehicle multimedia system, and results were compared with the ideal contour. The Pearson correlation coefficients for simulation and experimental results were 0.965 and 0.9661, with RMSE values of 2.12 and 1.48. These results indicate that optimization aligns the speaker output closer to the ideal contour, enhancing in-vehicle audio system performance and increasing user satisfaction.

Cloud data centers play a vital role in modern computing infrastructure, offering scalable resources for diverse applications. However, managing costs and resources efficiently in these centers has become a crucial concern due to the exponential growth of cloud computing. User applications exhibit complex behavior, leading to fluctuations in system performance and increased power usage. To tackle these obstacles, we propose the consolidation of virtual machines (VMs) to optimize resource utilization and reduce operational costs. This paper introduces a novel algorithm, leveraging the Modified Artificial Feeding Birds Algorithm (ModAFBA), to manage cost optimally in cloud data centers by reducing power usage while meeting service level agreements (SLAs). The ModAFBA algorithm, inspired by bird foraging behavior, dynamically adjusts solutions based on environmental changes. Comprehensive experimental evaluation demonstrates the superiority of the proposed algorithm in terms of power usage, migration count, and SLA compliance. Through this research, we aim to advance cost management and resource optimization in cloud data centers, providing a valuable tool for cloud service providers to enhance infrastructure efficiency and achieve cost savings.

With the development of agriculture, the complexity and dynamism of orchard environments pose challenges to the perception and positioning of inter row environments for agricultural machinery. The paper proposes a method for extracting navigation lines and measuring pedestrian obstacles. The improved YOLOv5 algorithm is used to detect tree trunks between left and right rows in orchards. The experimental results show that the average angle deviation of the extracted navigation lines is less than 5 degrees, verifying its accuracy. Due to the variable posture of pedestrians and ineffective camera depth, a distance measurement algorithm based on four zone depth comparison is proposed for pedestrian obstacle distance measurement. Experimental results show that within a range of 6m, the average relative error of distance measurement does not exceed 1%, and within a range of 9m, the maximum relative error is 2.03%. The average distance measurement time is 30 milliseconds, which can accurately and quickly achieve pedestrian distance measurement in orchard environments. On the publicly available TUM RGB-D dynamic dataset, YOLOD-SLAM2 significantly reduces the RMSE index of absolute trajectory error compared to ORB-SLAM2 algorithm, which is less than 0.05 m/s. In actual orchard environments, YOLOD-SLAM2 has a higher degree of agreement between the estimated trajectory and the true trajectory when the car is traveling in straight and circular directions. The RMSE index of the absolute trajectory error is less than 0.03m/s, and the average tracking time is 47ms, indicating that the YOLOD-SLAM2 algorithm proposed in this paper can meet the accuracy and real-time requirements of agricultural machinery positioning in orchard environments.

Public transportation scheduling aims to optimize the allocation of transportation resources, enhance transportation efficiency, and increase passenger satisfaction, which is crucial for building a sustainable urban transportation system. As a complement to public transportation, shared bikes provide users with a solution for the last mile of travel, compensating for the lack of flexibility in public transportation and helping to improve its utilization rate. Due to the characteristics of shared bikes, such as peak usage periods in the morning and evening and significant fluctuations in demand across different areas, the optimization of shared bike dispatch can better meet user needs, thereby reducing vehicle vacancy rates and increasing operating revenue. Addressing this issue, this paper designs a comprehensive decision-making approach for spatio-temporal demand prediction and bike dispatch optimization. For demand prediction, we designed a T-GCN based bike demand prediction model. In terms of dispatch optimization, we considered factors such as dispatch capacity, distance restrictions, and dispatch costs, and designed an optimization solution based on genetic algorithms. Finally, this paper validates the approach using shared bike operating data, shows that T-GCN can effectively predict short-term demand for shared bikes. Meanwhile, the optimization model based on genetic algorithms provides a complete dispatch solution verifying the model’s effectiveness. The shared bike dispatch approach proposed in this paper, which combines demand prediction with resource scheduling. This scheme can also be extended to other transportation scheduling problems with uncertain demand, such as store replenishment delivery and intercity inventory dispatch.

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.

Multi-threshold image segmentation is a relevant research field in further higher-level image preprocessing and computer vision. This paper adopts the Bayesian Forecasting Evolutionary Algorithm (BFEA) for natural scenery image segmentation using multilevel thresholding. An update method for the prediction vector is designed for image segmentation. The design idea of the BFEA algorithm for multilevel thresholding is based on the basic principle of Evolutionary Computation, the probability distribution of promising solutions, and the Bayesian theorem. BFEA could effectively solve the curse of dimensionality. Extensive experiments have demonstrated that the proposed algorithm dominated the state-of-the-art population-based thresholding method in term of the quality of image, function fitness value, optimal threshold value, SSIM value, PSNR value, computation time, dimensionality issue and convergence rate. The proposed method is very effective for color image segmentation.

Muon tomography leverages cosmic muons’ exceptional penetration capabilities to reconstruct detailed tomographic images via multiple Coulomb scattering interactions, making it invaluable for detecting High-Z materials critical to homeland security. This study introduces the Slope Intercept (SI) algorithm, a novel approach for rapid and precise tomographic image reconstruction. Implemented using Geant4 simulations in a standard-sized container tomography station, SI demonstrates superior performance in speed and simplicity compared to traditional methods. While the imaging results of SI and the Point of Closest Approach (POCA) algorithm are nearly identical, the SI algorithm is simpler to implement, requires shorter CPU time, and exhibits a smaller margin of error. Its computational efficiency and simplicity make it a robust alternative to the POCA algorithm. These findings highlight SI’s suitability for applications demanding robust imaging and efficient data processing, which are crucial for advancing security measures and scientific research.

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.

Behavior analysis is a widely used non-invasive tool in the practical production routine, as the animal acts as a biosensor capable of reflecting its degree of adaptation and discomfort to some environmental challenge. Predominantly, conventional statistics use occurrence data for behavioral evaluation and well-being estimation, disregarding the temporal sequence of events. The Generalized Sequential Pattern (GSP) algorithm is a data mining method that identifies recurrent sequences that exceed a user-specified support threshold, whose potential has not yet been investigated for broiler chickens in enriched environments. Enrichment aims to increase environmental complexity with promising effects on animal welfare, stimulating priority behaviors and potentially reducing the deleterious effects of heat stress. The objective was to validate the application of the GSP algorithm to identify temporal correlations between heat stress and the behavior of broiler chickens in enriched environments through proof of concept. Video image collection was carried out automatically for 48 continuous hours, analyzing a continuous period of seven hours, from 12:00 PM to 6:00 PM, during two consecutive days of tests for chickens housed in enriched and non-enriched environments under comfort and stress temperatures. Chickens at comfort temperature showed high motivation to perform the behaviors of Preening (P), Foraging (F), Lying down (Ld), Eating (E), and Walking (W) whose sequences <{Ld,P}>; <{Ld,F}>; <{P,F,P}>; <{Ld,P,F}> and <{E,W,F}> were the only ones observed in both treatments. All other sequential patterns (comfort and stress) were distinct, suggesting that environmental enrichment alters the behavioral pattern of broiler chickens. Heat stress drastically reduced the sequential patterns found at the 20% threshold level in the tested environments. The behavior of lying laterally "Ll" is a strong indicator of heat stress in broilers and was only frequent in the non-enriched environment, which may suggest that environmental enrichment provides the animal with better opportunities to adapt to stress-inducing challenges, such as heat.

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