15 February 2023 in IEEE Transactions on Parallel and Distributed Systems
With the development of cloud computing, multi-cloud systems have become common platforms for hosting and executing workflow applications in recent years. However, the complexity of workflow scheduling increases exponentially because of the diversified billing mechanisms, heterogeneous virtual machines, and reliability of multi-cloud systems. This article focuses on a multi-objective workflow scheduling problem in multi-cloud systems (MOWSP-MCS). The makespan, cost, and reliability are considered the optimization objectives from the perspective of users. Compared with the classical multi-objective workflow scheduling in the cloud environment, MOWSP-MCS allows users to apply the backup technique to improve reliability. To solve the MOWSP-MCS, this article proposes a reliability-aware multi-objective memetic algorithm (RA-MOMA) containing a diversification strategy and intensification strategy. In the diversification strategy, several problem-specific genetic operators are introduced to construct the diversified offspring individuals. In the intensification strategy, four problem-specific neighborhood operators are designed based on the critical path and resource utilization rate to improve the quality of the individuals in the archive set. A comprehensive numerical experiment is conducted to evaluate the effectiveness of RA-MOMA. The comparisons with several related algorithms demonstrate the superiority of RA-MOMA for solving the MOWSP-MCS.
8 December 2023 in IEEE Transactions on Instrumentation and Measurement
As an essential tool in clinical medicine, brain research, and the study of neurological diseases, the electroencephalogram (EEG) is susceptible to various physiological signals, posing difficulties for subsequent research and analysis. Deep learning (DL), an end-to-end method without expert knowledge, is gaining attention in the field of EEG artifact removal. However, the existing DL methods cannot globally observe the latent relationship of EEG signals. They lack the capacity to effectively explore the feature patterns of the signals, resulting in unsatisfactory denoising performance. To address the aforementioned issues, this article proposes a transformer-based EEG denoising architecture (denoiseformer) to solve the artifact removal problem of single-channel contaminated EEG signals. First, the contaminated EEG signals are divided into multiple slices as input so that the transformer module can extract the potential pattern relationships between the slices. Then, we design a multiscale feature extraction and fusion module to obtain high-resolution features with richer and more robust information. Next, a novel attention mechanism, named slice pattern attention, is applied to extract the global information on the temporal dimension of each EEG slice. In addition, a residual variational autoencoder structure can generate superior latent codes between different EEG samples, which help the encoder to distinguish contaminated signal patterns, and hence, improve the recovery performance for artifacts. Comprehensive experiments on three types of semisimulated and one real-laboratory artifacts show our model can obtain excellent performance on two quantitative metrics (relative root-mean-square error and correlation coefficient) for artifact removal tasks in various scenarios.
16 February 2022 in IEEE Transactions on Automation Science and Engineering
Uncertainty is a practical issue in system design optimization because some characteristics of components, such as reliability and cost, cannot be determined precisely in many situations. Considering the imprecise characteristics of components, few works have focused on the multi-objective optimization for the redundancy allocation due to the challenges of comparing multi intervals. To tackle the issue, a novel angle-based bi-objective redundancy allocation algorithm is proposed in this study, introducing three original contributions: 1) An angle-based interval crowding distance (ICA) is especially designed for effective performance and reduced computational time; 2) Two techniques are applied to tackle the problem: An elite selection for mutation is presented for generating better offsprings; A penalty-guided constraint handling technique is introduced for converting the problem into an unconstrained one. 3) Since a set of optimal solutions is obtained by the proposed method and no preference on uncertainties is provided, this paper proposes a novel knee interval method to help DMs make a decision. To be specific, the proposed ICA can describe the distribution of the whole population intuitively and effectively, considering not only the angle between two compared individuals but also the angle range of the interval values. The computational results from two typical experiments demonstrate that the proposed algorithm is more efficient than other state-of-the-art algorithms, generating Pareto sets with less repeating individuals, stronger convergence, wider distribution, less imprecision, and reduced computational time.
8 June 2021 in IEEE Transactions on Cloud Computing
Workflow scheduling in cloud environments has become a significant topic in both commercial and industrial applications. However, it is still an extraordinarily challenge to generate effective and economical scheduling schemes under the deadline constraint especially for the large scale workflow applications. To address the issue, this paper investigates the cloud workflow scheduling problem with the aim of minimizing the whole cost of workflow execution whereas maintaining its execution time under a predetermined deadline. A novel knowledge-based adaptive discrete water wave optimization (KADWWO) algorithm is developed based on the problem-specific knowledge of cloud workflow scheduling. In the proposed KADWWO, a discrete propagation operator is designed based on the idle time knowledge of hourly-based cost model to adaptively explore the huge search space. The adaptive refraction operator is employed to avoid stagnation and expand the available resource pool. Meanwhile, the dynamic grouping based breaking operator is designed to exploit the excellent block structure knowledge of task allocation scheme and corresponding resource to intensify the local region and accelerate convergence. Extensive simulation experiments on the well-known scientific workflow demonstrate that the KADWWO approach outperforms several recent state-of-the-art algorithms.
20 May 2022 in IEEE Transactions on Network and Service Management
Mobile edge computing (MEC) is an emerging computing paradigm that decreases the computing time and extends the lifespan of user equipments (UEs). In MEC, the computational tasks are offloaded from UEs to the base station (BS) at the edge of the network for processing. However, MEC cannot cope with environments where there are no BS or where communication facilities have been destroyed. In this paper, we study the problem of minimizing the energy consumption of UAV equipped with MEC servers as a mobile base station to serve users. The problem involves user offloading decision, UAV location and allocation with computational resources, and is a hybrid optimization problem with continuous and discrete variables. To address this problem, we propose a hybrid nature-inspired optimization algorithm (HNIO) and its version for discrete optimization, where HNIO incorporates mutation and population diversity detection mechanisms to boost its global optimization capability, and we design a probabilistic selection-based coding strategy for the discrete optimization version. The experimental study is conducted based on ten cases with different numbers of UEs. Comparing HNIO with several other state-of-the-art optimization algorithms, it is concluded from the Friedman and Wilcoxon’s test of the experimental results that HNIO shows better precision and stability in nine out of the ten cases with higher number of UEs.
28 September 2021 in IEEE Transactions on Reliability
The multimission selective maintenance problem (MSMP) for repairable systems has received increasing attention in recent years. The problem amounts to selecting a subset of feasible maintenance actions, in view of the resource limitations. For considering the realistic case of the imperfect maintenance, this article introduces a hybrid imperfect maintenance model, which is more realistic to evaluate the system reliability. The challenge of solving such kind of problems lies not only in the reliability estimation, but also in the solution method of the maintenance selection. Such decision-making problem can be effectively formulated using the Markov decision process, but it is difficult to apply current methods for solving the engineering systems with large action decision spaces. In order to solve this issue, this work puts forth a novel hybrid algorithm for the MSMP in a large multicomponent system. In the proposed method, a discrete differential evolution algorithm is developed for searching the optimal maintenance action in large-scale discrete action spaces and the deep Q-network method is utilized to approximate the effectiveness of maintenance actions and facilitate the agent training. The experiments, based on a large-scale coal transportation system, verify the effectiveness of the proposed method compared with LSDQN and differential evolution.