Adaptive Algorithm Research Articles

Alarm: An Adaptive Routing Algorithm Based on One-Way Delay for Infiniband

Alarm: An Adaptive Routing Algorithm Based on One-Way Delay for Infiniband

Adaptive Bitrate Algorithms via Deep Reinforcement Learning With Digital Twins Assisted Trajectory

Adaptive Bitrate Algorithms via Deep Reinforcement Learning With Digital Twins Assisted Trajectory

Predictive modelling of residual stress in turning of hard materials using radial basis function network enhanced with principal component analysis

This study proposes a hybrid machine learning (ML) model that combines a radial basis function network (RBFN) with principal component analysis (PCA) to predict residual stress (RS) in the machining process. Higher temperatures and plastic deformation can generate RS conditions in the machining of hard materials, significantly influencing the quality of machined parts, particularly their surface integrity. It is crucial to evaluate and guarantee machining conditions that ensure reliable surface integrity that yields compressive RS conditions. Incorrect parameter settings can lead to poor surface quality, resulting in tensile RS conditions that impact both the quality and lifetime of manufactured products. The methodology involved experimental machining trials for data acquisition, with conditions selected for hard material machining tests conducted using a computer numeric control (CNC) lathe under dry cutting conditions. The cutting force components were measured, and RS was evaluated using X-ray diffraction. A total of 60 trials were conducted. Data preprocessing, including normalization and removal of outliers, was executed before constructing the ML algorithm, leaving 59 valid tests for model training and testing. Separate datasets for training (70 % of the data) and testing (30 %) were randomly selected from the valid experimental tests. PCA enhanced the RBFN model’s generalization by reducing data dimensionality and providing the hidden units parameter. The eigenvectors obtained through PCA served as an efficient initial reference for RBF centroids, highlighting principal directions of variation. The PCA-RBFN model, using a multiquadric radial function, exhibited robust performance in capturing underlying patterns during training and demonstrated balanced results in the tests. In the PCA-RBFN model training stage, it exhibited a coefficient of determination (R2) of 76.66 %, a mean average error (MAE) of 72.15 MPa, and a root mean square error (RMSE) of 84.94 MPa. In the testing stage, the model showed increased metrics, indicating its ability to predict RS values accurately, with an R2 of 80.54 %, MAE of 51.25 MPa, and RMSE of 70.36 MPa. The evaluation between the training and testing stages highlighted the model’s coherence in performance, demonstrating its ability to generalize well to new data. A second comparative analysis was conducted with a conventional RBFN approach using stochastic method for centroid determination. The hybrid PCA-RBFN method exhibited lower computational effort, requiring only three iterations compared to 221,923 iterations in the conventional approach. Despite the conventional approach yielding better metrics in the training stage, it exhibited signs of overfitting, a common concern in machine learning models. The hybrid PCA-RBFN consistently outperformed it regarding generalization and fit during testing. The proposed methodology holds practical implications for the manufacturing industry, allowing the integration of a pre-trained predictive model into machine controllers or smart sensors. The hybrid PCA-RBFN’s computationally lightweight approach also supports incorporating real-time adaptive algorithms into production systems, enabling continuous real-time adjustments to the model factors and weights, thereby improving automated control.

A New Hybrid Adaptive Optimization Algorithm Based Wavelet Neural Network for Severity Level Prediction for Lung Cancer Dataset

A New Hybrid Adaptive Optimization Algorithm Based Wavelet Neural Network for Severity Level Prediction for Lung Cancer Dataset

Federated Bayesian network approach for cross-regional air pollution classification: a case study of the Beijing-Tianjin-Hebei region.

Although machine learning methods have enabled considerable progress in air quality assessment, challenges persist regarding data privacy, cross-regional data processing, and model generalization. To address these issues, we introduce an advanced federated Bayesian network (FBN) approach. By integrating federated learning, adaptive optimization algorithms, and homomorphic encryption technologies, we substantially enhanced the efficiency and security of cross-regional air quality data processing. The novelty of this research lies in the improvements implemented in federated learning for air quality data analysis, particularly in distributed model training optimization and data consistency. Through the integration of adaptive structural modification strategies and simulated annealing immune optimization algorithms, we markedly enhanced the structural learning accuracy of the Bayesian network, resulting in a 20% improvement in prediction accuracy. Moreover, employing homomorphic encryption ensured data transmission security and confidentiality. In our Beijing-Tianjin-Hebei case study, our method demonstrated a 15% improvement in air quality classification accuracy compared to conventional methods and exhibited superior interpretability in analyzing environmental factor interactions. We quantified complex air pollution patterns across regions and found that a 30% fluctuation in the air quality index correlated with NO2 concentrations. We also observed a moderate positive correlation between specific pollutant indicators in Hebei Province and Tianjin and changes in air quality. Additionally, the FBN exhibited better operational efficiency and data confidentiality than other machine learning models in handling large-scale and multisource environmental data. Our FBN approach presents a novel perspective for environmental monitoring and assessment, vital for understanding complex air pollution patterns and formulating future ecological protection policies.

Optimal control of microgrid using ALO optimization MPPT with power quality enhancement

AbstractThe paper presents a normalized, varying step size-based least mean square-based control for a standalone microgrid and Ant Lion optimization-based maximum power point tracking. This modified version of the incremental conductance algorithm addresses issues like slow dynamic response, fixed step size issues, and steady state oscillations. Comparative analysis with well-known techniques shows that Ant Lion optimizes the tracking of maximum power points more accurately, with fewer oscillations and increased efficiency. Power management and power quality are maintained through proposed adaptive voltage source converter control. The proposed voltage control shows better performance under various dynamic and steady conditions.

Triple-diode solar cell current optimization – An analytical solution based on the Lambert W function

A novel mathematical modeling approach for the Triple-Diode Model (TDM) and its parameter estimation is introduced in this paper. For the first time in the literature, this paper presents two analytical solutions for calculating the current in TDM solar cells using the Lambert W function. Additionally, a new metaheuristic algorithm, the Adaptive Evaporation Rate Water Cycle Algorithm (Adaptive ERWCA), is proposed for estimating TDM solar cell parameters. The proposed algorithm is tested using both the new analytical solutions and a well-known iterative approach for the current-voltage characteristics of the TDM solar cells model. Extensive testing is conducted on three well-known solar cells/modules and a panel under various weather conditions. The results demonstrate that the proposed analytical expressions for the current-voltage characteristics are accurate and highly effective for representing TDM solar cell current. The accuracy of the parameter estimates obtained with the application of the proposed algorithm, considering both analytical solutions and the iterative approach, is compared with existing literature results. It is shown that the proposed algorithm outperforms existing algorithms in solar cell parameter estimation across both the analytical and iterative approaches for current-voltage characteristics. Remarkably, for the RTC France solar cell, the SOLAREX MSX 60 solar module, and the PHOTOWATT-PWP 201 solar module, the obtained Root Mean Square Errors (RMSE) are 0.00075141, 0.01157153, and 0.0010578, respectively. These results are currently the best reported in the literature.

Adaptive large neighborhood search algorithm with reinforcement search strategy for solving extended cooperative multi task assignment problem of UAVs

In response to the increasing complexity of military operations, the use of multiple heterogeneous unmanned aerial vehicles (UAVs) is essential for efficiently executing complex missions. This paper introduces an extended cooperative multi-task assignment problem (ECMTAP), which involves deploying heterogeneous UAVs from different base stations to accomplish specific missions, with a focus on minimizing overall mission completion time. ECMTAP categorizes targets into various types, each associated with unique task sets including {reconnaissance}, {attack, evaluation}, and {reconnaissance, attack, evaluation}. ECMTAP requires that attack tasks follow reconnaissance tasks, and evaluation tasks follow attack tasks, adding complexity due to specific timing constraints on each task. To tackle this problem, we propose a novel algorithm, the reinforcement search strategy-based adaptive large neighborhood search (RSALNS). To enhance the search capability, RASLNS utilizes two key destroy-repair operations: the intra-target tasks adjustment strategy and the evaluation tasks adjustment strategy. The former operation dismantles and reconstructs task sequences within a target, potentially resulting in suboptimal assignment of evaluation tasks, while the latter operation reassigns these tasks based on the first operation's output. Extensive experiments validate the effectiveness of the RSALNS algorithm in solving the ECMTAP, demonstrating its capability to generate high-quality solutions efficiently.

Synchronization of heterogeneous and uncertain networks via adaptive intermittent pinning control

In the context of network synchronization, achieving a coherent solution poses a significant challenge, particularly in scenarios where the systems exhibit heterogeneous and uncertain dynamics. The ability to successfully steer the network towards synchronization under heterogeneous and uncertain dynamics is an important research subject. In this paper, synchronization of heterogeneous and uncertain networks is investigated by designing an adaptive intermittent pinning controller. Based on Lyapunov stability theory, sufficient conditions to guarantee network synchronization are obtained. Moreover, an adaptive algorithm for uncertain gain is designed and its validity is rigorously established. Finally, numerical simulations are provided to demonstrate the correctness of the obtained results.

A novel version of hierarchical genetic algorithm and its application for hyperparameters optimization in CNN models for structural delamination identification

A novel version of hierarchical genetic algorithm and its application for hyperparameters optimization in CNN models for structural delamination identification

Primary-Side Indirect Control of the Battery Charging Current in a Wireless Power Transfer Charger Using Adaptive Hill-Climbing Control Technique

This paper addresses the control task of a wireless power transfer (WPT) charger designed for electric vehicles (EVs). The challenge is to maintain a constant battery charging current when the WPT is controlled on the ground side. Indeed, the intermittent latency involved in the wireless data communication between the ground and vehicle sides leads to system instability. To overcome this issue, a new control approach has been proposed in this paper. The proposed technique ensures indirect control of the battery charging current through control of the current on the ground side. The control technique relies on an adaptive hill-climbing algorithm in conjunction with a PI-based controller. The adaptive parameter is adjusted online, during the operation of the charger, only when a new measure of the battery charging current is received on the primary side. This makes it possible to avoid the need for real-time wireless data communication. It should be noted that this aspect is crucial in ensuring the controller’s robustness and stability of the system regardless of potential delays in wireless communication and large misalignments between the coils. The validity of the proposed control technique has been confirmed through simulation. In addition, experimental validation, using a laboratory test bed, demonstrated satisfactory results.

Adaptive Synchronization and Pacing Control for Visual Interactive Simulation

Parallel and distributed computing enable the execution of large and complex simulations. Yet, the usual separation of (headless) simulation execution and (subsequent, offline) output analysis often renders the simulation endeavor long and inefficient. Recently, Visual Interactive Simulation (VIS) tools and methods that address this end-to-end efficiency are gaining relevance, offering in-situ visualization, real-time debugging, and computational steering. Here, the typically distributed computing nature of the simulation execution poses synchronization challenges between the headless simulation engine and the user-facing frontend required for Visual Interactive Simulation. To the best of our knowledge, state-of-the-art synchronization approaches fall short due to their rigidity and inability to adapt to real-time user-centric changes. This paper introduces a novel adaptive algorithm to dynamically adjust the simulation’s pacing through a buffer-based framework, informed by predictive workload analysis. Our extensive experimental evaluation across diverse synthetic scenarios illustrates our method’s effectiveness in enhancing runtime efficiency and synchronicity, significantly reducing end-to-end time while minimizing user interaction delays, thereby addressing key limitations of existing synchronization strategies.

The low-carbon vehicle routing problem with dynamic speed on steep roads

The low-carbon vehicle routing problem with dynamic speeds on steep roads (LCVRPDS-SR) considers the combined effects of dynamic speeds, steep roads, and loads on carbon emissions. Earlier low-carbon vehicle routing problems typically assumed that vehicles travel at a constant speed on flat roads. However, such models do not apply in urban or rural areas with steep roads. Although the subsequent studies further explored the effect of steep roads, their performance are still suboptimal since they fail to take into account the varying speeds on the terrain. This paper proposes an extended LCVRPDS-SR model that tackles dynamic speed decisions on steep roads for the low-carbon vehicle routing problem. The objective function is non-linear and considers only environmental factors. Then an improved adaptive large neighborhood search algorithm is presented, including a new speed optimization algorithm and several improved removal and insertion operators. Extensive experiments are conducted on the generated instances to verify the effectiveness of the model and algorithm and derive managerial insights. The significant reduction in greenhouse gas emissions is achieved when considering dynamic speeds.

Dynamic Security Rule Optimization Based on Deep Learning and Adaptive Algorithms

Compared with traditional computer network security identification techniques, deep learning algorithms are based on their own distributed network structure for storage, processing, classification, comparison, and automatic identification functions. The distribution and dynamism of cloud databases increase the difficulty of route prediction and recognition in the cloud, affecting the efficiency of cloud computing. In response to the above issues, the author proposes a dynamic path optimization process for cloud databases based on adaptive immune grouping polymorphic ant colony algorithm. By setting up two states of ant colony, reconnaissance ant and search ant, and introducing an adaptive polymorphic ant colony competition strategy, the defect of general ant colony algorithms being prone to falling into local optima is improved; On this basis, an artificial immune algorithm with fast global search capability is further integrated to improve the search ant path optimization process, improving search speed and accuracy. Simulation experiments show that the IPANT algorithm outperforms the other three algorithms, maintaining a throughput of 1000 kbps and relatively stable; The data of OSPF, SPF, and FR are not significantly different, significantly lower than IPANT. The immune polymorphic ant colony algorithm (IPANT) has the lowest time delay for packet routing and performs better than the other three algorithms, with FR and SPF having higher latency. It has been proven that this algorithm can better solve convergence speed and global optimization problems, and can quickly and reasonably find the database to be accessed in the cloud.

Multi-Environment Adaptive Fast Constant False Alarm Detection Algorithm Optimization Strategy

Multi-Environment Adaptive Fast Constant False Alarm Detection Algorithm Optimization Strategy

Research on Adaptive Intelligent Decision Algorithm in Industry 4.0 Digital Economy and Management Transformation Based on Clustering Algorithm

Research on Adaptive Intelligent Decision Algorithm in Industry 4.0 Digital Economy and Management Transformation Based on Clustering Algorithm

Design and Implementation of an Adaptive Evaluation System for Teachers’ Information-Based Teaching Ability in the Intelligent ERA

The rapid development of teacher informatization has become a major highlight in current teaching. The information system under adaptive conditions has become the key to the reform of the intelligent era. The goal of this study is to design and implement an adaptive evaluation system for teachers’ information-based teaching ability, aiming at improving ability to meet the needs of modern education. This system analyzes the level of acceptance under key learning technologies. It combines elements by learning and analyzing their impact on general forms. It aims to analyze the rule algorithm dataset in a single machine environment. By analyzing multiple sets of different datasets, it calculates the number of key technologies that appear together in the same report based on the key technology word matrix. A co-occurrence matrix is constructed. The system adopts an advanced adaptive algorithm, which can conduct personalized assessments according to the actual ability and needs of teachers, so as to provide more accurate and effective feedback, help teachers understand their own advantages and disadvantages, and formulate more targeted promotion strategies. In the process of system design, the detailed requirement analysis is carried out first, and the function and performance requirements of the system are clarified. Then, we design the architecture of the system and determine the main modules and functions of the system. The function module is designed and the system is implemented. Through the practical application and effect evaluation of the system, we find that the system has high effectiveness and practicability. It can not only help teachers understand their own level of information-based teaching ability and provide personalized suggestions for improvement, but also provide decision support for education administrators and promote the development of education based on information. We expect that this system can play a greater role in the future education practice and promote the further development of education informatization.

Confidence sharing adaptation for out-of-domain human pose and shape estimation

3D human pose and shape estimation is often impacted by distribution bias in real-world scenarios due to factors such as bone length, camera parameters, background, and occlusion. To address this issue, we propose the Confidence Sharing Adaptation (CSA) algorithm, which corrects model bias using unlabeled images from the test domain before testing. However, the lack of annotation constraints in the adaptive training process poses a significant challenge, making it susceptible to model collapse. CSA utilizes a decoupled dual-branch learning framework to provide pseudo-labels and remove noise samples based on the confidence scores of the inference results. By sharing the most confident prior knowledge between the dual-branch networks, CSA effectively mitigates distribution bias. CSA is also remarkably adaptable to severely occluded scenes, thanks to two auxiliary techniques: a self-attentive parametric regressor that ensures robustness to occlusion of local body parts and a rendered surface texture loss that regulates the relationship between occlusion of human joint positions. Evaluation results show that CSA successfully adapts to scenarios beyond the training domain and achieves state-of-the-art performance on both occlusion-specific and general benchmarks. Code and pre-trained models are available for research at https://github.com/bodymapper/csa.git

A novel robotic-assisted deep learning-enabled computer vision approach for nondestructive diagnosis of railway bolt faults

Abstract Railways play a vital role in the inland transportation system worldwide, and abnormal bolt components at the track joints are the main cause of train accidents. The detection and identification of faults in rail bolt components are of considerable research importance. To address this problem, numerous researchers have opted for computer vision-based methods to accomplish the detection and identification of the target, but the existing methods have poor detection performance diminished detection capabilities when the target position changes or some feature information is occluded, and the detection speed and accuracy are far from meeting the requirements of practical applications. Therefore, based on the construction of a dedicated dataset for bolt components, this paper uses the K-means dimensional clustering algorithm to re-cluster the dataset according to the target size characteristics, with the aim of reduce the bounding box regression error. At the same time, a novel loss function iteration method is proposed by incorporating an adaptive optimization algorithm, in order to improve the detection speed and ensure good convergence, and the model complexity is reduced based on deep model pruning. Finally, the optimized detection model is implemented on the robotic-assisted platform for testing, and the experimental results verify that the algorithm can quickly and accurately complete various fault diagnosis tasks of bolt components in practical applications. The main achievements of this study include the construction of a large-scale image dataset for novel rail bolt components and propelled the application of deep learning methods in vision-based rail bolt fault diagnosis.

Adaptive identification of linear infinite-dimensional systems

We propose an adaptive algorithm for identifying the unknown parameter (possibly vector-valued) in a linear stable single-input single-output infinite-dimensional system. We assume that the transfer function of the infinite-dimensional system can be expressed as a ratio of two infinite series in s (the Laplace variable). We also assume that certain identifiability conditions, which include a persistency of excitation condition, hold. For a fixed integer n, we propose an adaptive update law (a differential equation in time) driven by real-time input-output data for estimating the first n + 1 coefficients in the numerator and the denominator of the transfer function. We show that the estimates for the transfer function coefficients generated by the update law are close to the true values at large times provided n is sufficiently large (the estimates converge to the true values as time and n tend to infinity). The unknown parameter can be reconstructed using the transfer function coefficient estimates obtained with n large and the algebraic expressions relating the transfer function coefficients to the unknown parameter. We also provide a numerical scheme for verifying the identifiability conditions and for choosing n sufficiently large so that the value of the reconstructed parameter is close to the true value. The class of systems to which our approach is applicable includes many partial differential equations with constant/spatially-varying coefficients and distributed/boundary input and output. We illustrate the efficacy of our approach using three examples: a delay system with four unknown scalars, a 1D heat equation with two unknown scalars and a 1D wave equation with an unknown linearly-varying (in space) coefficient.