Xiaomin Zhu

Dr. Xiaomin Zhu

College of Systems Engineering, National University of Defense Technology, Changsha, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 August 2018 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
HCHuangke Chen
Huangke Chen
Xiaomin ZhuXiaomin Zhu
Xiaomin Zhu
GLGuipeng Liu
Guipeng Liu
WPWitold Pedrycz
Witold Pedrycz
Scheduling workflows in cloud service environment has attracted great enthusiasm, and various approaches have been reported up to now. However, these approaches often ignored the uncertainties in the scheduling environment. Ignoring these uncertain factors often leads to the violation of workflow deadlines and increases service renting costs of executing workflows. This study devotes to improving the performance for cloud service platforms by minimizing uncertainty propagation in scheduling workflow applications that have both uncertain task execution time and data transfer time. To be specific, a novel scheduling architecture is designed to control the count of workflow tasks directly waiting on each service instance (e.g., virtual machine). Based on this architecture, we develop an unceRtainty-aware Online Scheduling Algorithm (ROSA) to schedule dynamic and multiple workflows with deadlines. The proposed ROSA skillfully integrates both the proactive and reactive strategies. Then, on the basis of real-world workflow traces, five groups of simulation experiments are carried out to compare ROSA with five typical algorithms. The comparison results reveal that ROSA performs better than the five compared algorithms with respect to costs (up to 56%), deviation (up to 70%), resource utilization (up to 37%) and fairness (up to 37).

17 March 2016 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
Xiaomin ZhuXiaomin Zhu
Xiaomin Zhu
JWJi Wang
Ji Wang
HGHui Guo
Hui Guo
DZDakai Zhu
Dakai Zhu
LYLaurence T. Yang
Laurence T. Yang
LLLing Liu
Ling Liu
Clouds are becoming an important platform for scientific workflow applications. However, with many nodes being deployed in clouds, managing reliability of resources becomes a critical issue, especially for the real-time scientific workflow execution where deadlines should be satisfied. Therefore, fault tolerance in clouds is extremely essential. The PB (primary backup) based scheduling is a popular technique for fault tolerance and has effectively been used in the cluster and grid computing. However, applying this technique for real-time workflows in a virtualized cloud is much more complicated and has rarely been studied. In this paper, we address this problem. We first establish a real-time workflow fault-tolerant model that extends the traditional PB model by incorporating the cloud characteristics. Based on this model, we develop approaches for task allocation and message transmission to ensure faults can be tolerated during the workflow execution. Finally, we propose a dynamic fault-tolerant scheduling algorithm, FASTER, for realtime workflows in the virtualized cloud. FASTER has three key features: 1) it employs a backward shifting method to make full use of the idle resources and incorporates task overlapping and VM migration for high resource utilization, 2) it applies the vertical/horizontal scaling-up technique to quickly provision resources for a burst of workflows, and 3) it uses the vertical scaling-down scheme to avoid unnecessary and ineffective resource changes due to fluctuated workflow requests. We evaluate our FASTER algorithm with synthetic workflows and workflows collected from the real scientific and business applications and compare it with six baseline algorithms. The experimental results demonstrate that FASTER can effectively improve the resource utilization and schedulability even in the presence of node failures in virtualized clouds.

6 April 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
BFBowen Fei
Bowen Fei
WBWeidong Bao
Weidong Bao
Xiaomin ZhuXiaomin Zhu
Xiaomin Zhu
DLDaqian Liu
Daqian Liu
TMTong Men
Tong Men
ZXZhenliang Xiao
Zhenliang Xiao
With the rapid development of artificial intelligence technology, the multi-UAV cooperative search has wide applications in the field of Internet of Things, such as resource exploration, emergency rescue, intelligent transportation, etc. However, the communication network in an unknown environment may be inaccessible, and the real-time information sharing among UAVs cannot be guaranteed, resulting in the failure of cooperative search. Aiming at this issue, this article is devoted to the design of the multi-UAV flight strategy to improve the cooperative search capability in an uncertain communication environment. Specifically, a new cooperative architecture oriented to a local communication network is devised to control the observation locations of multiple UAVs in the search process, and some local communication networks are established based on the distance among UAVs to meet the requirements of the search task. On this foundation, we develop a multi-UAV cooperative search model (MCSM) with communication cost and formation benefit as an optimization function to ensure the effectiveness of multi-UAV search. Moreover, in the process of model solving, an improved sparrow search algorithm (ISSA) is presented with some different search strategies to enhance the optimization capability. To verify the superiority of the proposed method, we designed several groups of simulation experiments to analyze the performance of MCSM. Experimental results illustrate that our method can not only maintain high cooperative search accuracy but also has high stability and convergence speed.

17 July 2019 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
JWJi Wang
Ji Wang
WBWeidong Bao
Weidong Bao
LSLichao Sun
Lichao Sun
Xiaomin ZhuXiaomin Zhu
Xiaomin Zhu
BCBokai Cao
Bokai Cao
PYPhilip S. Yu
Philip S. Yu
The soaring demand for intelligent mobile applications calls for deploying powerful deep neural networks (DNNs) on mobile devices. However, the outstanding performance of DNNs notoriously relies on increasingly complex models, which in turn is associated with an increase in computational expense far surpassing mobile devices’ capacity. What is worse, app service providers need to collect and utilize a large volume of users’ data, which contain sensitive information, to build the sophisticated DNN models. Directly deploying these models on public mobile devices presents prohibitive privacy risk. To benefit from the on-device deep learning without the capacity and privacy concerns, we design a private model compression framework RONA. Following the knowledge distillation paradigm, we jointly use hint learning, distillation learning, and self learning to train a compact and fast neural network. The knowledge distilled from the cumbersome model is adaptively bounded and carefully perturbed to enforce differential privacy. We further propose an elegant query sample selection method to reduce the number of queries and control the privacy loss. A series of empirical evaluations as well as the implementation on an Android mobile device show that RONA can not only compress cumbersome models efficiently but also provide a strong privacy guarantee. For example, on SVHN, when a meaningful (9.83,10−6)-differential privacy is guaranteed, the compact model trained by RONA can obtain 20× compression ratio and 19× speed-up with merely 0.97% accuracy loss.

1 August 2022 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
JTJun Tang
Jun Tang
XCXi Chen
Xi Chen
Xiaomin ZhuXiaomin Zhu
Xiaomin Zhu
FZFeng ZHU
Feng ZHU
Due to their strong risk tolerance, low manufacturing cost and good maneuverability, unmanned aerial vehicles (UAVs) have been widely used in various fields. Among related challenges, coordinated task assignment is a key scientific issue for autonomous control of UAVs. In this paper, based on the idea of fuzzy C-means (FCM) clustering and the ant colony optimization (ACO) algorithm, a cooperative multiple task reallocation problem with target precedence constraints for heterogeneous UAVs is proposed. The contributions of this research are the performance evaluation of the original algorithms in a dynamic context, consideration of changes in some attributes of the environment, and the extension of these algorithms to properly address more realistic dynamic emergent adjustment scenarios. According to the corresponding task reallocation strategy, the scenarios are divided into three categories: the complete redistribution strategy can effectively cope with scenarios where tasks have changed significantly, the partial adjustment strategy can induce partial responses to the changes of individual tasks, and group redistribution can effectively solve the problem of task target threat rating changes. The simulation results show that the dynamic reallocation model of multi-UAV tasks in dynamic emergent adjustment scenarios can achieve better performance to complete the corresponding tasks based on the proposed scheme. In addition, we deployed the developed graphical modeling and analysis software (GMAS) platform to implement the dynamic reallocation model of multi-UAV tasks in dynamic emergent scenarios, and the validity and reliability of the proposed task reallocation model were verified.

1 November 2020 in Information Sciences
Verified
Journal Article
Closed access
XZXiongtao Zhang
Xiongtao Zhang
Xiaomin ZhuXiaomin Zhu
Xiaomin Zhu
JWJi Wang
Ji Wang
HYHui Yan
Hui Yan
HCHuangke Chen
Huangke Chen
WBWeidong Bao
Weidong Bao