Hang Zhuang

Dr. Hang Zhuang


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
30 January 2019 in IEEE Access
Verified
Journal Article
Open access
QWQingfeng Wang
Qingfeng Wang
XZXuehai Zhou
Xuehai Zhou
CWChao Wang
Chao Wang
ZLZhiqin Liu
Zhiqin Liu
JHJun Huang
Jun Huang
JCJie-Zhi Cheng
Jie-Zhi Cheng
Data imbalance issue generally exists in most medical image analysis problems, and may be getting important with the popularization of data-hungry deep learning paradigms. We explore the cutting-edge wasserstein generative adversarial networks (WGAN) to address the data imbalance problem with over-sampling on the minority classes. The WGAN can estimate the underlying distribution of a minority class to synthesize more plausible and helpful samples for the classification model. In this paper, the WGAN-based over-sampling technique is applied to augment the data to balance for the fine-grained classification of 7 semantic attributes of lung nodules in CT images. The fine-grained classification is carried out with a normal convolutional neural network (CNN). To further illustrate the efficacy of the WGAN-based over-sampling technique, the conventional data augmentation method commonly used in many deep learning works, the generative adversarial networks (GAN) and the deep convolutional generative adversarial networks (DCGAN) are implemented for comparison. The whole schemes of the minority over-sampling and fine-grained classification are tested with the public Lung Imaging Database Consortium (LIDC) dataset. The experimental results suggest that the WGAN-based over-sampling technique can synthesize helpful samples for the minority classes to assist the training of the CNN model and to boost the fine-grained classification performance better than the conventional data augmentation method and the two schemes of the GAN and DCGAN techniques do. It may thus suggest that the WGAN technique offers an alternative methodological option for the further deep learning on imbalanced classification studies.

26 July 2018 in IEEE Access
Verified
Journal Article
Open access
HZHang Zhuang
Hang Zhuang
CWChao Wang
Chao Wang
CLChanglong Li
Changlong Li
YLYijing Li
Yijing Li
QWQingfeng Wang
Qingfeng Wang
XZXuehai Zhou
Xuehai Zhou
With the development of deep learning and artificial intelligence, deep neural networks are increasingly being applied for natural language processing tasks. However, the majority of research on natural language processing focuses on alphabetic languages. Few studies have paid attention to the characteristics of ideographic languages, such as the Chinese language. In addition, the existing Chinese processing algorithms typically regard Chinese words or Chinese characters as the basic units while ignoring the information contained within the deeper architecture of Chinese characters. In the Chinese language, each Chinese character can be split into several components, or strokes. This means that strokes are the basic units of a Chinese character, in a manner similar to the letters of an English word. Inspired by the success of character-level neural networks, we delve deeper into Chinese writing at the stroke level for Chinese language processing. We extract the basic features of strokes by considering similar Chinese characters to learn a continuous representation of Chinese characters. Furthermore, word embeddings trained at different granularities are not exactly the same. In this paper, we propose an algorithm for combining different representations of Chinese words within a single neural network to obtain a better word representation. We develop a Chinese word representation service for several natural language processing tasks, and cloud computing is introduced to deal with preprocessing challenges and the training of basic representations from different dimensions.

1 August 2014
Verified
Conference Paper
Closed access
CLChanglong Li
Changlong Li
HZHang Zhuang
Hang Zhuang
KLKun Lu
Kun Lu
MSMingming Sun
Mingming Sun
JZJinhong Zhou
Jinhong Zhou
XZXuehai Zhou
Xuehai Zhou
With the coming concept of 'big data', the ability to handle large datasets has become a critical consideration for the success of industrial organizations such as Google, Amazon, Yahoo! and Facebook. As an important Cloud Computing framework for bulk data processing, Hadoop is widely used in these organizations. However, the performance of MapReduce is seriously limited by its stiff configuration strategy. Even for a single simple job in Hadoop, a large number of tuning parameters have to be set by users. This may easily lead to performance loss due to some misconfigurations. In this paper, we present an adaptive automatic configuration tool (AACT) for Hadoop to achieve performance optimization. To achieve this goal, we propose a mathematical model which will accurately learn the relationship between system performance and configuration parameters, then configure Hadoop system based on this mathematical model. With the help of AACT, Hadoop is able to adapt the hardware and software configurations dynamically and drive the system to an optimal configuration in acceptable time. Experimental results show its efficiency and adaptability, and that it is ten times faster compared with default configuration.

20 November 2018 in BMC Medical Genomics
Verified
Journal Article
Open access
PDF file
BXBo Xu
Bo Xu
CLChanglong Li
Changlong Li
HZHang Zhuang
Hang Zhuang
JWJiali Wang
Jiali Wang
QWQingfeng Wang
Qingfeng Wang
XZXuehai Zhou
Xuehai Zhou
The clinical decision support system can effectively break the limitations of doctors’ knowledge and reduce the possibility of misdiagnosis to enhance health care. The traditional genetic data storage and analysis methods based on stand-alone environment are hard to meet the computational requirements with the rapid genetic data growth for the limited scalability. In this paper, we propose a distributed gene clinical decision support system, which is named GCDSS. And a prototype is implemented based on cloud computing technology. At the same time, we present CloudBWA which is a novel distributed read mapping algorithm leveraging batch processing strategy to map reads on Apache Spark. Experiments show that the distributed gene clinical decision support system GCDSS and the distributed read mapping algorithm CloudBWA have outstanding performance and excellent scalability. Compared with state-of-the-art distributed algorithms, CloudBWA achieves up to 2.63 times speedup over SparkBWA. Compared with stand-alone algorithms, CloudBWA with 16 cores achieves up to 11.59 times speedup over BWA-MEM with 1 core. GCDSS is a distributed gene clinical decision support system based on cloud computing techniques. In particular, we incorporated a distributed genetic data analysis pipeline framework in the proposed GCDSS system. To boost the data processing of GCDSS, we propose CloudBWA, which is a novel distributed read mapping algorithm to leverage batch processing technique in mapping stage using Apache Spark platform.

3 July 2018 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
CLChanglong Li
Changlong Li
HZHang Zhuang
Hang Zhuang
QWQingfeng Wang
Qingfeng Wang
CWChao Wang
Chao Wang
XZXuehai Zhou
Xuehai Zhou
With the development of mobile network and corresponding techniques, more and more works focus on providing efficient services based on mobile devices. Furthermore, motivated by IoT, studies of local distributed mobile devices attract attentions of both industry and academia in recent years. However, existing storage systems cannot manage data and support the QoS of mobile services well. This paper presents LKSM, a light weight key-value storage system, which can be deployed on either one node or multiple nodes. To the best of our knowledge, it is the first attempt to propose key-value store in this scenario. We carefully analyze the challenges when designing the system on mobile clusters, and further propose RDS for addressing. With the help of RDS, LKSM achieves the goal of lower latency, better scalability, and higher availability. Furthermore, based on RDS, a novel data management strategy is presented, which successfully avoid energy holes of mobile clusters and achieves the tradeoff between performance and energy. We organize LKSM using a log-structured merge-tree and implement it based on LevelDB, an open source key-value storage system proposed by Google. Experiments on physical smartphones demonstrate that LKSM presents much higher performance compared with the ported LevelDB on mobile devices.

6 January 2017 in arXiv
Verified
Preprint
Open access
PDF file
BXBo Xu
Bo Xu
CLChanglong Li
Changlong Li
HZHang Zhuang
Hang Zhuang
JWJiali Wang
Jiali Wang
QWQingfeng Wang
Qingfeng Wang
XZXuehai Zhou
Xuehai Zhou
Sequence alignment algorithms are a basic and critical component of many bioinformatics fields. With rapid development of sequencing technology, the fast growing reference database volumes and longer length of query sequence become new challenges for sequence alignment. However, the algorithm is prohibitively high in terms of time and space complexity. In this paper, we present DSA, a scalable distributed sequence alignment system that employs Spark to process sequences data in a horizontally scalable distributed environment, and leverages data parallel strategy based on Single Instruction Multiple Data (SIMD) instruction to parallelize the algorithm in each core of worker node. The experimental results demonstrate that 1) DSA has outstanding performance and achieves up to 201x speedup over SparkSW. 2) DSA has excellent scalability and achieves near linear speedup when increasing the number of nodes in cluster.