Huaikun Xiang

Huaikun Xiang


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 September 2020 in Molecular Therapy Nucleic Acids
Verified
Journal Article
Open access
LDLijun Dou
Lijun Dou
XLXiaoling Li
Xiaoling Li
HDHui Ding
Hui Ding
LXLei Xu
Lei Xu
HXHuaikun Xiang
Huaikun Xiang
5-Methylcytosine (m5C) is a well-known post-transcriptional modification that plays significant roles in biological processes, such as RNA metabolism, tRNA recognition, and stress responses. Traditional high-throughput techniques on identification of m5C sites are usually time consuming and expensive. In addition, the number of RNA sequences shows explosive growth in the post-genomic era. Thus, machine-learning-based methods are urgently requested to quickly predict RNA m5C modifications with high accuracy. Here, we propose a noval support-vector-machine (SVM)-based tool, called iRNA-m5C_SVM, by combining multiple sequence features to identify m5C sites in Arabidopsis thaliana. Eight kinds of popular feature-extraction methods were first investigated systematically. Then, four well-performing features were incorporated to construct a comprehensive model, including position-specific propensity (PSP) (PSNP, PSDP, and PSTP, associated with frequencies of nucleotides, dinucleotides, and trinucleotides, respectively), nucleotide composition (nucleic acid, di-nucleotide, and tri-nucleotide compositions; NAC, DNC, and TNC, respectively), electron-ion interaction pseudopotentials of trinucleotide (PseEIIPs), and general parallel correlation pseudo-dinucleotide composition (PC-PseDNC-general). Evaluated accuracies over 10-fold cross-validation and independent tests achieved 73.06% and 80.15%, respectively, which showed the best predictive performances in A. thaliana among existing models. It is believed that the proposed model in this work can be a promising alternative for further research on m5C modification sites in plant.

1 March 2020 in Molecular Therapy Nucleic Acids
Verified
Journal Article
Open access
LDLijun Dou
Lijun Dou
XLXiaoling Li
Xiaoling Li
HDHui Ding
Hui Ding
LXLei Xu
Lei Xu
HXHuaikun Xiang
Huaikun Xiang
Pseudouridine (Psi) is the most abundant RNA modification and has been found in many kinds of RNAs, including snRNA, rRNA, tRNA, mRNA, and snoRNA. Thus, sites play a significant role in basic research and drug development. Although some experimental techniques have been developed to identify Psi sites, they are expensive and time consuming, especially the post-genomic era with the explosive growth of known RNA sequences. Thus, highly accurate computational methods are urgently required to quickly detect the Psi sites on uncharacterized RNA sequences. Several predictors have been exist proposed using multifarious features, but their evaluated performances are still unsatisfactory. In this study, we first identifled sites for H. sapiens, S. cerevisiae, and M. musculus using the sequence features from the bi-profile Bayes (BPB) method based on the random forest (RF) and support vector machine (SVM) algorithms, where the performances were evaluated us- ing 5-fold cross-validation and independent tests. It was found that the SVM-based accuracies were 3.55% and 5.09% lower than the iPseU-CUU predictor for the H_990 and S_628 data- sets, respectively. Almost the same-level results were obtained for M_994 and an independent H_200 dataset, even showing a 5.0% improvement for S_200. Then, three different kinds of features, including basic Kmer, general parallel correlation pseudo-dinucleotide composition (PC-PseDNC-General), and nucleotide chemical property (NCP) and nucleotide density (ND) from the iRNA-PseU method, were combined with BPB to show their comprehensive performances, where the effective features are selected by the max-relevance-max-distance (MRMD) method. The best evaluated accuracies of the comoped bined features for the S_628 and M_994 datasets were achieved at 70.54% and 72.45%, which were 2.39% and 0.65% higher than iPseU-CUU. For the S_200 dataset, it was also improved 8% from 69% to 77%. However, there was no obvious improvement for H. sapiens, which was evaluated as approximately 63.23% and 72.0% for the H_990 and H_200 datasets, respectively. The overall performances for Psi identification using BPB features as well as the combined features were not obviously improved. Although some kinds of feature extraction methods based on the RNA sequence information have been applied to construct the predictors in previous studies, the cor- responding accuracies are generally in the range of 60%-70%. Thus, researchers need to reconsider whether there is any sequence feature in the RNA Psi modification prediction problem.

30 December 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
LZLianghong Zhu
Lianghong Zhu
HXHuaikun Xiang
Huaikun Xiang
KZKai Zhang
Kai Zhang
Recently, wireless sensor networks (WSNs) have been widely used in a variety of fields, and make people’s lives more convenient and efficient. However, WSNs are usually deployed in a harsh and insecure environment. Furthermore, sensors with limited hardware resources have a low capacity for data processing and communication. For these reasons, research on efficient and secure real-time authentication and key agreement protocols based on the characteristics of WSNs has gradually attracted the attention of academics. Although many schemes have been proposed, most of them cannot achieve all known security features with satisfactory performance, among which anonymity, N-Factor security, and forward secrecy are the most vulnerable. In order to solve these shortcomings, we propose a new lightweight and anonymous three-factor authentication scheme based on symmetric cryptographic primitives for WSNs. By using the automated security verification tool ProVerif, BAN-logic verification, and an informal security analysis, we prove that our proposed scheme is secure and realizes all known security features in WSNs. Moreover, we show that our proposed scheme is practical and efficient through the comparison of security features and performance.

1 January 2021 in Complexity
Verified
Journal Article
Open access
PDF file
HXHuaikun Xiang
Huaikun Xiang
The vulnerability of an urban road network is affected by many factors, such as internal road network layout, network structure strength, and external destructive events, which have great uncertainty and complexity. Thus, there is still no unified and definite vulnerability analysis scheme available to cities. This paper proposes an integrative vulnerability identification method for urban road networks, which mainly relates to the vulnerability connotation and characteristics analysis of urban road networks during emergency, and vulnerability comprehensive evaluation indices design based on urban road network connectivity, traffic efficiency and performance, and an empirical study on a vulnerability identification method of an urban road network. In the empirical case, a real road network and traffic operation data were used from Science and Technology Park of Shenzhen City, China. In the context of one certain emergency scenario, the stated preference survey method and maximum likelihood method are used to solve the road users’ random travel choice behavior parameters; subsequently, based on the traffic equilibrium distribution prediction, the traffic vulnerability identification methods of the road network in this region were verified before and after the emergency. The method presented here not only considers the impact of network topology changes on road network traffic function during emergency but also considers the impact of dynamic changes in road network traffic demand on vulnerability; therefore, it is closer to the actual distribution of urban road network traffic vulnerability.

1 January 2015 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
YLYunlin Luo
Yunlin Luo
NWNa Wang
Na Wang
HXHuaikun Xiang
Huaikun Xiang
JWJinhu Wang
Jinhu Wang
Road traffic impedance model is a difficult and critical point in urban traffic assignment and route guidance. The paper takes a signalized intersection as the research object. On the basis of traditional traffic wave theory including the implementation of traffic wave model and the analysis of vehicles’ gathering and dissipating, the road traffic impedance model is researched by determining the basic travel time and waiting delay time. Numerical example results have proved that the proposed model in this paper has received better calculation performance compared to existing model, especially in flat hours. The values of mean absolute percentage error (MAPE) and mean absolute deviation (MAD) are separately reduced by 3.78% and 2.62 s. It shows that the proposed model has feasibility and availability in road traffic impedance under intersection signal.

11 July 2018
Verified
Conference Paper
Closed access
HXHuaikun Xiang
Huaikun Xiang
AMAntao Ming
Antao Ming
For the intelligent and connected vehicles (ICV), under the condition of high-speed vehicle movement, it is necessary to determine the position of the vehicle itself under a certain coordinate system in real time and with high accuracy so as to realize the automatic driving function with high safety and high reliability, which is one of the important contents of current research on ICV. Based on the analysis of the traditional vehicle ranging sensors, satellite positioning, roadside beacons, and electronic map matching, it is found that these positioning technologies are difficult to realize the precise positioning function at high speed. This paper studied how to build a vehicle to vehicle (V2V) and vehicle to road (V2R) self-adaptive local wireless mobile network based on IEEE 802.11p (also known as WAVE, wireless access in the vehicular environment) technology and a high-precision positioning model of high-speed mobile vehicles under the network. Then, the network real-time differential model was established to correct the measurement error, and the corresponding real-time positioning algorithm was designed and simulated. Experimental results demonstrate the effectiveness as well as efficiency of the proposed method.