Search

The brain‐computer interface (BCI) enables individuals with impairments to interact with the real world without relying on the neuromuscular pathway. BCI leverages artificial intelligence (AI) models for control. It can capture brain activity patterns associated with mental processes and convert them into commands for actuators. One promising application of BCI is in rehabilitation centres. When compared to traditional methods integrated with machine learning (ML) approaches that were initially explored in the past decade, there is a relatively limited number of studies utilizing deep learning (DL) approaches in BCI applications. A novel approach has been developed for the automatic recognition of motor imagery (MI) tasks. This article introduces the improved sparrow search algorithm with deep transfer learning‐based EEG motor imagery classification (ISSADTL‐EEGMIC) algorithm for BCIs. The presented ISSADTL‐EEGMIC algorithm primarily focuses on the automated classification of motor imagery tasks. To achieve this, the ISSADTL‐EEGMIC method first preprocesses EEG signals using the wavelet packet decomposition (WPD) technique. Additionally, it employs the neural architecture search network (NASNet) technique for feature extraction. Moreover, the ISSADTL‐EEGMIC model performs the classification process using the stacked sparse autoencoder (SSAE) model. Furthermore, hyperparameter optimization of the SSAE model is performed using the ISSA technique, which helps achieve maximum classification performance. The results from the simulation of the ISSADTL‐EEGMIC algorithm have been examined using two benchmark datasets. The experimental findings suggest that it outperforms recent approaches in terms of performance. [ABSTRACT FROM AUTHOR]

A significant challenge in high-performance computing is to ensure the even distribution of applications across computational resources, preventing issues such as resource fragmentation and network congestion. While cloud computing offers advantages, it introduces scheduling delays caused by data transmission. To address this issue, edge computing has emerged as an alternative to traditional cloud systems, aiming to minimize latency. While various methods have been proposed to address this challenge, they often prioritize one aspect at the expense of overall system performance. In this paper, we present a novel algorithm utilizing ant colony optimization to compute a fitness function and prioritize multiple objectives in scheduling. The algorithm effectively determines how to distribute applications between edge and cloud servers to enhance computational efficiency. This entails a delicate balance between scheduling delays and energy consumption in two distinct phases. Initially, the algorithm identifies applications sensitive to delays and ensures their execution on local edge servers. Subsequently, it identifies applications that require intensive computation and migrates them to the cloud layer, where cloud servers can process them. The results demonstrate that this approach reduces delay costs by 21.19% and decreases energy consumption by 13.76%. [ABSTRACT FROM AUTHOR]

In the context of cloud systems, the effectiveness of placing modules for optimal reliability and end-to-end delay (EED) is directly linked to the success of scheduling distributed scientific workflows. However, the measures used to evaluate these aspects (reliability and EED) are in conflict with each other, making it impossible to optimize both simultaneously. Thus, we introduce a scheduling algorithm for distributed scientific workflows that focuses on enhancing reliability while maintaining specific EED limits. This is particularly important given the inevitable failures of processing servers and communication links. To achieve our objective, we first develop an artificial intelligence-based model that merges an improved version of the wild horse optimization technique with a levy flight approach. This hybrid approach enhances the ability to explore new possibilities effectively. Additionally, we establish a viable strategy for sharing mapping decisions and stored information among processing servers, promoting scalability and robustness—essential qualities for large-scale distributed systems. This strategy not only boosts local search capabilities but also prevents premature convergence of the algorithm. The primary goal of this study is to pinpoint resource placements that strike a balance between global exploration and local exploitation. This entails effectively harnessing the search space and minimizing the inclination toward resources with a high likelihood of failures. Through experimentation in various system configurations, our proposed method consistently outperformed competing workflow scheduling algorithms. It achieved notably higher levels of reliability while adhering to the same EED constraints. [ABSTRACT FROM AUTHOR]

Scheduling jobs within a cloud environment is a critical area of research that necessitates meticulous analysis. It entails the challenge of optimally assigning jobs to various cloud servers, each with different capabilities, and is classified as a non-deterministic polynomial (NP) problem. Many conventional methods have been suggested to tackle this difficulty, but they often struggle to find nearly perfect solutions within a reasonable timeframe. As a result, researchers have turned to evolutionary algorithms to tackle this problem. However, relying on a single metaheuristic approach can be problematic as it may become trapped in local optima, resulting in slow convergence. Therefore, combining different metaheuristic strategies to improve the overall system enactment is essential. This paper presents a novel approach that integrates three methods to enhance exploration and exploitation, increasing search process efficiency and optimizing many-objective functions. In the initial phase, we adopt cooperative game theory with merge-and-split techniques to train computing hosts at different utilization load levels, determining the ideal utilization for each server. This approach ensures that servers operate at their highest utilization range, maximizing their profitability. In the second stage, we incorporate the mean variation of the grey wolf optimization algorithm, making significant adjustments to the encircling and hunting phases to enhance the exploitation of the search space. In the final phase, we introduce an innovative pollination operator inspired by the sunflower optimization algorithm to enrich the exploration of the search domain. By skillfully balancing exploration and exploitation, we effectively address many-objective optimization problems. To validate the performance of our proposed method, we conducted experiments using both real-world and synthesized datasets, employing CloudSim software version 5.0. The evaluation involved two sets of experiments to measure different evaluation metrics. In the first experiment, we focused on minimizing factors such as energy costs, completion time, latency, and SLA violations. The second experiment, in contrast, aimed at maximizing metrics such as service quality, bandwidth utilization, asset utilization ratio, and service provider outcomes. The results from these experiments unequivocally demonstrate the outstanding performance of our algorithm, surpassing existing state-of-the-art approaches. [ABSTRACT FROM AUTHOR]