Adaptive Algorithm Research Articles

Next-gen security in IIoT: integrating intrusion detection systems with machine learning for industry 4.0 resilience

In the dynamic landscape of Industry 4.0, characterized by the integration of smart technologies and the industrial internet of things (IIoT), ensuring robust security measures is imperative. This paper explores advanced security solutions tailored for the IIoT, focusing on the integration of intrusion detection systems (IDS) with advanced machine learning (ML) and deep learning (DL) techniques. In this paper, we present a novel intrusion detection model to fortify to fortify Industry 4.0 systems against evolving cyber threats by leveraging ML an DL algorithms for dynamic adaptation. To evaluate the performances and effectiveness of our proposed model, we use the improved Coburg intrusion detection data sets (CIDDS) and BoT-IoT datasets, showcasing notable performance attributes with an exceptional 99.99% accuracy, high recall, and precision scores. The model demonstrates computational efficiency, with rapid learning and detection phases. This research contributes to advancing next-gen security solutions for Industry 4.0, offering a promising approach to tackle contemporary cyber.

DRLAR: A deep reinforcement learning-based adaptive routing framework for network-on-chips

Adaptive routing plays a pivotal role in the overall performance of Network-on-Chips (NoCs). However, with many-core architectures supporting complex and constantly changing traffic patterns for emerging applications, this aspect presents significant challenges. Our meticulous examination and analysis of existing heuristic adaptive routing algorithms revealed three key limiting factors: single network status metric, lack of system feedback awareness, and lack of ability to customize. Reinforcement Learning (RL) methods have demonstrated promising opportunities for exploring adaptive routing design. Deep reinforcement learning (DRL) techniques, in particular, enable efficient exploration in adaptive routing design spaces where heuristic strategies may be inadequate. This paper proposes a novel deep reinforcement learning framework for adaptive routing called DRLAR that is suitable for diversified traffic patterns and resolves multi-objective optimization simultaneously. DRLAR formulates routing as an agent, which makes routing decisions based on autonomous learning using multiple network state features and system-level feedback information. We conduct extensive experiments against state-of-the-art routing algorithms to evaluate our design. The results show that DRLAR reduces packet latency by an average of 33.3%, achieving a reduction of 41.6% and 10.5% on average under heavy synthetic traffic and the PARSEC 2.1 benchmark, respectively. We also perform a cost analysis to validate the potential implementation of DRLAR on NoCs with low computational, storage, and power.

Predicting the Students Performance Using WUM and Machine Learning Technique

Abstract: This project aims to develop a predictive model for assessing students’ academic performance by integrating web usage mining (WUM) and machine learning (ML) techniques. The model leverages user-provided data such as gender, parental profession, reading score, and writing score, along with behavioural insights from online educational platform interactions. The methodology includes data preprocessing, feature extraction, and adaptive algorithm selection to enhance prediction accuracy and adaptability across various student profiles. The integration of WUM provides a robust framework for educational institutions to tailor interventions and support systems effectively.

Online boxplot derived outlier detection

AbstractOutlier detection is a widely used technique for identifying anomalous or exceptional events across various contexts. It has proven to be valuable in applications like fault detection, fraud detection, and real-time monitoring systems. Detecting outliers in real time is crucial in several industries, such as financial fraud detection and quality control in manufacturing processes. In the context of big data, the amount of data generated is enormous, and traditional batch mode methods are not practical since the entire dataset is not available. The limited computational resources further compound this issue. Boxplot is a widely used batch mode algorithm for outlier detection that involves several derivations. However, the lack of an incremental closed form for statistical calculations during boxplot construction poses considerable challenges for its application within the realm of big data. We propose an incremental/online version of the boxplot algorithm to address these challenges. Our proposed algorithm is based on an approximation approach that involves numerical integration of the histogram and calculation of the cumulative distribution function. This approach is independent of the dataset’s distribution, making it effective for all types of distributions, whether skewed or not. To assess the efficacy of the proposed algorithm, we conducted tests using simulated datasets featuring varying degrees of skewness. Additionally, we applied the algorithm to a real-world dataset concerning software fault detection, which posed a considerable challenge. The experimental results underscored the robust performance of our proposed algorithm, highlighting its efficacy comparable to batch mode methods that access the entire dataset. Our online boxplot method, leveraging dataset distribution to define whiskers, consistently achieved exceptional outlier detection results. Notably, our algorithm demonstrated computational efficiency, maintaining constant memory usage with minimal hyperparameter tuning.

PSO-optimized SSLMS adaptive filter for signal denoising of rolling bearings under small sample condition

Abstract To address the issue that the deep learning-based denoising algorithms can hardly effectively eliminate the background noise under small sample data condition, this paper proposes a new denoising method based on spectral subtraction (SS) and least mean square (LMS) adaptive filtering algorithms. To achieve the adaptive selection for the parameters of SS and LMS algorithms, particle swarm optimization (PSO) approach is employed to search and optimize the parameters in the two algorithms, which is helpful for the two algorithms to play an important role in eliminating the noise components with the different properties. Subsequently, the SS algorithm and the LMS algorithm are appropriately combined, and the SS-processed signal is input into the LMS algorithm as a desired signal to actualize the LMS adaptive filtering function. In this way, the denoising performance of both algorithms can be maximally utilized, which achieves effective noise reduction in vibration signal. The effectiveness and superiority of the proposed method are validated through simulation data and rolling bearing experiment data, respectively. The results demonstrate that the proposed method significantly diminishes noise components and retains precise and reliable fault features under small sample data condition, which provides an effective denoising method for rolling bearing vibration signals under small sample data condition in practical engineering scenarios.

Digital Steganography : A Comprehensive Study on Various Methods for Hiding Secret Data in a Cover file

This research paper offers an in-depth examination of digital steganography, with a focus on the diverse methodologies utilized for embedding secret data within cover files. Steganography, the practice of concealing information within other non-secret data, ensures the hidden message remains undetectable to unauthorized observers. This study systematically reviews both traditional and modern steganographic techniques, dissecting their fundamental mechanisms, advantages, and weaknesses. Techniques explored include Least Significant Bit (LSB) insertion, discrete cosine transform (DCT), discrete wavelet transform (DWT), and innovative methods leveraging deep learning and adaptive algorithms. Each method is assessed for its imperceptibility, robustness, and data capacity, offering a comparative analysis to underscore their respective practical applications and limitations. Additionally, the paper delves into steganalysis—methods for detecting hidden information—to provide a comprehensive perspective on the field. Through experimental evaluation and theoretical analysis, this study seeks to enhance the understanding of digital steganography, presenting insights that could inform future research and the development of more secure data hiding techniques.

A reinforcement learning-driven adaptive decomposition algorithm for multi-objective hybrid seru system scheduling considering worker transfer

The application of hybrid seru manufacturing in real-world production often necessitates the implementation of a worker transfer strategy to overcome limitations in skill levels and realize the co-optimization of production efficiency and worker workload. Therefore, this study focuses on hybrid seru system scheduling considering worker transfer (HSSWT) to minimize both the makespan and the total labor time. The presence of multiple optimization objectives and coupled subproblems results in a considerably large search space, which poses challenges that existing optimization frameworks cannot effectively address. Thus, we propose a reinforcement learning-driven adaptive decomposition algorithm (RLADA) to address this issue. First, to minimize the search space, the HSSWT is decomposed into two subproblems, each utilizing distinct search strategies to explore specific areas. Elite-driven population evolution and a lower bound-guided greedy search are proposed to solve the individual subproblems. Second, a deep Q-network has been developed to adaptively select the subproblem to optimize in each generation by dynamically dividing the objective space. Finally, to narrow the search space, the lower bound is used to filter out unpromising solutions, thereby avoiding invalid searches. Additionally, the lower bound is utilized to determine the search depth according to the optimization margin, helping to conserve computing resources. Extensive comparative results demonstrate the effectiveness of the specialized designs, and the RLADA outperforms state-of-the-art algorithms in terms of solution convergence and diversity when addressing the HSSWT.

Adaptive impact analysis in flexible multibody systems based on hierarchically refined IGA models

AbstractUsually, detailed impact simulation models within flexible multibody systems have to be set up manually rather than being generated automatically. This is because the process requires prior knowledge of the time and location of the impact, as well as the element resolution within the contact area. If the penalty method is used to determine the occurring contact forces, the corresponding penalty factor also needs to be determined manually. This work, however, presents an adaptive algorithm to simulate impacts within flexible multibody systems fully automatically using reduced isogeometric analysis models, the floating frame of reference formulation, and quasistatic contact models for an efficient but still accurate simulation. The adaptive algorithm detects impacts in the system, determines the contact locations on the bodies, refines the contact area, and determines the penalty factor, and therefore automatically simulates impacts. The work shows how to automatically simulate impacts in flexible multibody systems without user action or prior knowledge of impact location and size. The first application example simulates significant elastodynamic effects within a long flexible rod. The goal is to validate the algorithm by preserving the wave propagation and energy of the system. The second application example simulates the impacts of two flexible double pendulums. This setup is a suitable benchmark for the complete adaptive impact analysis procedure as the flexible double pendulums undergo large rigid body motions.

Combinatorial optimization methods for yarn dyeing planning

AbstractManaging yarn dyeing processes is one of the most challenging problems in the textile industry due to its computational complexity. This process combines characteristics of multidimensional knapsack, bin packing, and unrelated parallel machine scheduling problems. Multiple customer orders need to be combined as batches and assigned to different shifts of a limited number of machines. However, several practical factors such as physical attributes of customer orders, dyeing machine eligibility conditions like flotte, color type, chemical recipe, and volume capacity of dye make this problem significantly unique. Furthermore, alongside its economic aspects, minimizing the waste of natural resources during the machine changeover and energy are sustainability concerns of the problem. The contradictory nature of these two makes the planning problem multi-objective, which adds another complexity for planners. Hence, in this paper, we first propose a novel mathematical model for this scientifically highly challenging yet very practical problem from the textile industry. Then we propose Adaptive Large Neighbourhood Search (ALNS) algorithms to solve industrial-size instances of the problem. Our computational results show that the proposed algorithm provides near-optimal solutions in very short computational times. This paper provides significant contributions to flexible manufacturing research, including a mixed-integer programming model for a novel industrial problem, providing an effective and efficient adaptive large neighborhood search algorithm for delivering high-quality solutions quickly, and addressing the inefficiencies of manual scheduling in textile companies; reducing a time-consuming planning task from hours to minutes.

Synchronous detection of CO2 and CH4 gas absorption spectroscopy based on TDM and optimized adaptive Whittaker-Henderson filtering algorithm

Synchronous detection of CO2 and CH4 gas absorption spectroscopy based on TDM and optimized adaptive Whittaker-Henderson filtering algorithm

Constrained Iterative Adaptive Algorithm for the Detection and Localization of RFI Sources Based on the SMAP L-Band Microwave Radiometer

The Soil Moisture Active Passive (SMAP) satellite carries an L-band microwave radiometer. This sensor can be used to observe global soil moisture (SM) and sea surface salinity (SSS) within the protected L-band spectrum (1400–1427 MHz). Owing to the complex effects of radio frequency interference (RFI), the SM and SSS data are missing or have low accuracy. In this paper, a constrained iterative adaptive algorithm for the detection, identification, and localization of RFI sources is designed, named MICA-BEID. The algorithm synthesizes antenna temperatures for the third and fourth Stokes parameters before RFI filtering, creating a new polarization parameter called WSPDA, designed to approximate the level of RFI interference on the L-band microwave radiometer. The algorithm then utilizes the WSPDA intensity and distribution density of RFI detection samples to enhance the identification and classification of RFI sources across various intensity levels. By utilizing statistical methods such as the probability density function (PDF) and the cumulative distribution function (CDF), the algorithm dynamically adjusts adaptive parameters, including the RFI detection threshold and the maximum effective radius of RFI sources. Through the application of multiple iterative clustering methods, the algorithm can adaptively detect and identify RFI sources at various satellite orbits and intensity levels. Through extensive comparative analysis with other localization results and known RFI sources, the MICA-BEID algorithm can achieve optimal localization accuracy of approximately 1.2 km. The localization of RFI sources provides important guidance for identifying and turning off illegal RFI sources. Moreover, the localization and long-time-series characteristic analysis of RFI sources that cannot be turned off is of significant value for simulating the spatial distribution characteristics of localized RFI source intensity in local areas.

Improvement of Computer Adaptive Multistage Testing Algorithm Based on Adaptive Genetic Algorithm

Multistage testing (MST) is a portion of computational adaptive testing that adapts assessment structure at the sublevel rather than the component level. The goal of the MST algorithm is to identify bugs in computer programming, and there is a significant cost to utilising MST due to its decreased versatility during software development and maintenance. The efficiency of most algorithms drastically reduces for adaptive MST with complex feasible regions, while some modern algorithms function well while tackling computerised MST with a basic practicable range. The study offers an automated Adaptive Multistage Testing algorithm based on Adaptive Genetic Algorithm (AMST-AGA) for optimisation and scalability problems, in which constraints are successively introduced and dealt with at various evolutionary phases. In this paper, many test cases will aid in finding bugs and meeting completeness goals. Each time test cases are created, these testing scenarios must continue to pass.

Speed Sensor-less Control of Induction Motor based on Super-helical Sliding Mold

Background: With the continuous progress of technology and the development of shield enterprises, higher requirements are put forward for speed estimation and system stability in the sensorless control system of induction motors in shield machines. Method: In order to solve the problems of velocity observation error and sliding mode vibration of the induction motor velocity observation method based on sliding mold observer, an improved superhelical sliding mold observer is proposed by combining the currently known invention patents and the information based on the induction motor control. Result: The open square of the current error value is introduced into the continuous function of the sliding variable of the observer, and two different functions are used in the boundary layer to replace the sign function, which reduces the sliding mode noise and vibration problems, and the stability of the observer is proved by the Lyapunov stability theory. After that, a phase-locked loop alternative model-referenced adaptive algorithm is used as the rotational speed observation link, which solves the problem that the conventional model-referenced adaptive algorithm relies on the current-modeled magnetic chain observer. Conclusion: The improved super-helical sliding mode observer and phase-locked loop control method effectively reduce the system vibration and speed estimation error of the motor under different speeds and loading conditions, and the observed currents are smoother, which improves the stability of the system. Simulation and experimental results under different working conditions show the effectiveness of the proposed method.

Retracted: "Optimized lung tumor diagnosis system using enhanced version of crow search algorithm, Zernike moments, and support vector machine".

Retracted: "Optimized lung tumor diagnosis system using enhanced version of crow search algorithm, Zernike moments, and support vector machine".

Using Optimization Techniques in Grammatical Evolution

The Grammatical Evolution technique has been successfully applied to a wide range of problems in various scientific fields. However, in many cases, techniques that make use of Grammatical Evolution become trapped in local minima of the objective problem and fail to reach the optimal solution. One simple method to tackle such situations is the usage of hybrid techniques, where local minimization algorithms are used in conjunction with the main algorithm. However, Grammatical Evolution is an integer optimization problem and, as a consequence, techniques should be formulated that are applicable to it as well. In the current work, a modified version of the Simulated Annealing algorithm is used as a local optimization procedure in Grammatical Evolution. This approach was tested on the Constructed Neural Networks and a remarkable improvement of the experimental results was shown, both in classification data and in data fitting cases.

Enhancing Underwater Wireless Sensor Networks With Flexible Communication and Positioning

An innovative approach centred around underwater wireless communication and positioning in Underwater Wireless Sensor Networks, addressing limited coverage by proposing a dual-hop system combining optical fiber and wireless links. Time frame design and Code Division Multiplexing Access enhance multi-user signal transmission efficiency. Proof-of-concept experiments validate feasibility, with the introduction of the hybrid fish eye routing protocol further enhancing performance by intelligently combining fish-eye routing and traditional protocols for improved coverage and reliability. Moreover, the hybrid fish eye protocol incorporates adaptive routing algorithms that dynamically adjust to changes in underwater conditions, ensuring robustness and adaptability in challenging environments. Additionally, the hybrid fish eye protocol optimizes energy consumption by minimizing unnecessary transmissions, thereby prolonging the lifespan of underwater sensor networks. With full-duplex communication, precise positioning, and an extended transmission range, convergent system demonstrates significant potential for supporting high-capacity transmission among mobile nodes in forthcoming underwater scenarios

An adaptive certified space-time reduced basis method for nonsmooth parabolic partial differential equations

In this paper, a nonsmooth semilinear parabolic partial differential equation (PDE) is considered. For a reduced basis (RB) approach, a space-time formulation is used to develop a certified a-posteriori error estimator. This error estimator is adopted to the presence of the discrete empirical interpolation method (DEIM) as approximation technique for the nonsmoothness. The separability of the estimated error into an RB and a DEIM part then guides the development of an adaptive RB-DEIM algorithm, combining both offline phases into one. Numerical experiments show the capabilities of this novel approach in comparison with classical RB and RB-DEIM approaches.

Enhancing the performance of zero energy buildings with boosted coyote optimization and elman neural networks

This research paper aims to optimize electrical system modeling to minimize CO2 emissions, improve reliability, and reduce costs. It proposes integrating Elman Neural Network (ENN) and metaheuristic algorithm to evaluate environmental impact and optimize system performance. The goal is to create a mathematical model considering renewable energy sources, grid energy, CO2 emissions, and maintenance costs, and use metaheuristic algorithms to determine the optimal combination of wind turbines and photovoltaic panels. To train the ENN model and optimize the system, a three-stage approach is proposed. Quasi-random numbers are generated using Sobol techniques to create input data, which is then processed by TRNSYS for simulation. The proposed approach incorporates an ENN with Boosted version of the Coyote optimization algorithm to accurately model and predict the behavior of Hybrid Renewable Energy Systems for Zero Energy Buildings. The results demonstrate the effectiveness of the proposed approach. Our method significantly reduces energy consumption, costs, and system reliability, achieving a 25% reduction in energy consumption and 12% reduction in system cost, and is effective in optimizing hybrid solar/wind and hydrogen storage systems. The optimal system configuration significantly reduces CO2 emissions, achieves a high level of system reliability, and minimizes costs. Comparative analysis with previous studies showcases the superiority of the proposed method in achieving comprehensive optimization. In conclusion, this study combines AI techniques and metaheuristic algorithms to optimize electrical system design, considering environmental, technical, and economic factors. The proposed approach overcomes limitations in previous studies and offers an effective solution to address the optimization problem.

AIGO-DTI: Predicting Drug-Target Interactions Based on Improved Drug Properties Combined with Adaptive Iterative Algorithms.

Artificial intelligence-based methods for predicting drug-target interactions (DTIs) aim to explore reliable drug candidate targets rapidly and cost-effectively to accelerate the drug development process. However, current methods are often limited by the topological regularities of drug molecules, making them difficult to generalize to a broader chemical space. Additionally, the use of similarity to measure DTI network links often introduces noise, leading to false DTI relationships and affecting the prediction accuracy. To address these issues, this study proposes an Adaptive Iterative Graph Optimization (AIGO)-DTI prediction framework. This framework integrates atomic cluster information and enhances molecular features through the design of functional group prompts and graph encoders, optimizing the construction of DTI association networks. Furthermore, the optimization of graph structure is transformed into a node similarity learning problem, utilizing multihead similarity metric functions to iteratively update the network structure to improve the quality of DTI information. Experimental results demonstrate the outstanding performance of AIGO-DTI on multiple public data sets and label reversal data sets. Case studies, molecular docking, and existing research validate its effectiveness and reliability. Overall, the method proposed in this study can construct comprehensive and reliable DTI association network information, providing new graphing and optimization strategies for DTI prediction, which contribute to efficient drug development and reduce target discovery costs.

A brain machine interface framework for exploring proactive control of smart environments

Brain machine interfaces (BMIs) can substantially improve the quality of life of elderly or disabled people. However, performing complex action sequences with a BMI system is onerous because it requires issuing commands sequentially. Fundamentally different from this, we have designed a BMI system that reads out mental planning activity and issues commands in a proactive manner. To demonstrate this, we recorded brain activity from freely-moving monkeys performing an instructed task and decoded it with an energy-efficient, small and mobile field-programmable gate array hardware decoder triggering real-time action execution on smart devices. Core of this is an adaptive decoding algorithm that can compensate for the day-by-day neuronal signal fluctuations with minimal re-calibration effort. We show that open-loop planning-ahead control is possible using signals from primary and pre-motor areas leading to significant time-gain in the execution of action sequences. This novel approach provides, thus, a stepping stone towards improved and more humane control of different smart environments with mobile brain machine interfaces.