Zhenglong Xiang

Dr. Zhenglong Xiang

orcid

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
1 October 2019 in Information Sciences
Verified
Journal Article
Closed access
ZXZhenglong Xiang
Zhenglong Xiang
DJDaomin Ji
Daomin Ji
HZHeng Zhang
Heng Zhang
HWHongrun Wu
Hongrun Wu
YLYuanxiang Li
Yuanxiang Li

3 February 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
HWHongrun Wu
Hongrun Wu
YMYutao Ma
Yutao Ma
ZXZhenglong Xiang
Zhenglong Xiang
CYChen Yang
Chen Yang
KHKeqing He
Keqing He

1 May 2020 in Knowledge-Based Systems
Verified
Journal Article
Closed access
ZXZhenglong Xiang
Zhenglong Xiang
XSXiangjun Shao
Xiangjun Shao
HWHongrun Wu
Hongrun Wu
DJDaomin Ji
Daomin Ji
FYFei Yu
Fei Yu
YLYuanxiang Li
Yuanxiang Li

10 December 2019 in Information
Verified
Journal Article
Open access
PDF file
ZXZhenglong Xiang
Zhenglong Xiang
HWHongrun Wu
Hongrun Wu
FYFei Yu
Fei Yu
The test oracle problem exists widely in modern complex software testing, and metamorphic testing (MT) has become a promising testing technique to alleviate this problem. The inference of efficient metamorphic relations (MRs) is the core problem of metamorphic testing. Studies have proven that the combination of simple metamorphic relations can construct more efficient metamorphic relations. In most previous studies, metamorphic relations have been mainly manually inferred by experts with professional knowledge, which is an inefficient technique and hinders the application. In this paper, a genetic algorithm-based approach is proposed to construct composite metamorphic relations automatically for the program to be tested. We use a set of relation sequences to represent a particular class of MRs and turn the problem of inferring composite MRs into a problem of searching for suitable sequences. We then dynamically implement multiple executions of the program and use a genetic algorithm to search for the optimal set of relation sequences. We conducted empirical studies to evaluate our approach using scientific functions in the GNU scientific library (abbreviated as GSL). From the empirical results, our approach can automatically infer high-quality composite MRs, on average, five times more than basic MRs. More importantly, the inferred composite MRs can increase the fault detection capabilities by at least 30 % more than the original metamorphic relations.

19 February 2023 in Journal of Computational Science
Verified
Journal Article
Closed access
MZMingJie Zhang
MingJie Zhang
DWDingwen Wang
Dingwen Wang
HWHongrun Wu
Hongrun Wu
YLYuanxiang Li
Yuanxiang Li
ZXZhenglong Xiang
Zhenglong Xiang

4 March 2020 in Information
Verified
Journal Article
Open access
PDF file
ZXZhenglong Xiang
Zhenglong Xiang
XDXialei Dong
Xialei Dong
YLYuan-xiang Li
Yuan-xiang Li
FYFei Yu
Fei Yu
XXXing Xu
Xing Xu
HWHongrun Wu
Hongrun Wu
Most of the existing research papers study the emotion recognition of Minnan songs from the perspectives of music analysis theory and music appreciation. However, these investigations do not explore any possibility of carrying out an automatic emotion recognition of Minnan songs. In this paper, we propose a model that consists of four main modules to classify the emotion of Minnan songs by using the bimodal data—song lyrics and audio. In the proposed model, an attention-based Long Short-Term Memory (LSTM) neural network is applied to extract lyrical features, and a Convolutional Neural Network (CNN) is used to extract the audio features from the spectrum. Then, two kinds of extracted features are concatenated by multimodal compact bilinear pooling, and finally, the concatenated features are input to the classifying module to determine the song emotion. We designed three experiment groups to investigate the classifying performance of combinations of the four main parts, the comparisons of proposed model with the current approaches and the influence of a few key parameters on the performance of emotion recognition. The results show that the proposed model exhibits better performance over all other experimental groups. The accuracy, precision and recall of the proposed model exceed 0.80 in a combination of appropriate parameters.