Rui Xu

Rui Xu

Auto-generated profile, based on publicly available information

Rui Xu

College of Information Science and Technology, Jinan University, Guangzhou, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
26 June 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
HWHan Wang
Han Wang
QZQingfeng Zhuge
Qingfeng Zhuge
ESEdwin Hsing-Mean Sha
Edwin Hsing-Mean Sha
RXRui Xu
Rui Xu
YSYuhong Song
Yuhong Song
Predicting hard disk failure effectively and efficiently can prevent the high costs of data loss for data storage systems. Disk failure prediction based on machine learning and artificial intelligence has gained notable attention, because of its good capabilities. Improving the accuracy and performance of disk failure prediction, however, is still a challenging problem. When disk failure is about to occur, the time is limited for the prediction process, including building models and predicting. Faster training would promote the efficiency of model updates, and late predictions not only have no value but also waste resources. To improve both the prediction quality and modeling timeliness, a two-layer classification-based feature selection scheme is proposed in this paper. An attribute filter calculating the importance of attributes was designed, to remove attributes insensitive to failure identification, where importance is gained based on the idea of classification tree models. Furthermore, by determining the correlation between features based on the correlation coefficient, an attribute classification method is proposed. In experiments, the models of machine learning and artificial intelligence were applied, and they included naïve Bayesian, random forest, support vector machine, gradient boosted decision tree, convolutional neural networks, and long short-term memory. The results showed that the proposed technique could improve the prediction accuracy of ML/AI-based hard disk failure prediction models. Specifically, utilizing random forest and long short-term memory with the proposed technique showed the best accuracy. Meanwhile, the proposed scheme could reduce training and prediction latency by 75% and 83%, respectively, in the best case compared with the baseline methods.

27 June 2022 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
RXRui Xu
Rui Xu
ESEdwin Hsing-Mean Sha
Edwin Hsing-Mean Sha
QZQingfeng Zhuge
Qingfeng Zhuge
YSYuhong Song
Yuhong Song
HWHan Wang
Han Wang
LSLiang Shi
Liang Shi
Nonvolatile memory (NVM) has the potential as the medium for scratchpad memory (SPM) in embedded devices. Racetrack memory (RM), in particular, is a developing memory technology that possesses high density and read latency comparable to SRAM. The RM’s access operations, however, are based on shift operations. Multiple shift operations will lead to long access latency and high energy. In this article, SRAM is borrowed to help the shifts reduction. Thus, a novel hybrid SRAM+RM SPM is presented to make use of SRAM’s random access and RM’s high density. But, there are some challenges to the proposed architecture: 1) the large capacity of SRAM is not available due to its low density and 2) due to the drawbacks of RM mentioned above, data that are randomly accessed are not expected to be stored on RM. Therefore, a data placement scheme and an instruction scheduling strategy are presented for the proposed architecture. First, an access instruction scheduling strategy is introduced to obtain a relatively sequential access sequence to help with the shifts and SRAM size reduction; second, to help with data placement, a metric for representing the data access cost is proposed; third, a data placement strategy based on the metric is proposed; and finally, a solution for decreasing SRAM size is suggested to maximize the capacity of SPM (or minimize the size of SPM). Experiments show that the suggested scheme can significantly improve the performance of the hybrid SPM while also reducing the shifts on RM with minimal SRAM.

5 May 2025 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
KCKun Cao
Kun Cao
YCYangguang Cui
Yangguang Cui
RXRui Xu
Rui Xu
YSYuxia Sun
Yuxia Sun
Zhiquan LiuZhiquan Liu
Zhiquan Liu
CTChaohong Tan
Chaohong Tan
In recent years, federated learning (FL) has gained increasing attention in industrial Internet-of-Things (IIoT) domains due to its privacy-preserving advantages. However, prior works commonly adopt a one-size-fits-all strategy for FL computation resource management and reward allocation, disregarding the time-varying participant states across different FL training rounds. Consequently, these methods fail to ensure the sustainability and active participation of IIoT devices in realistic FL deployments. To bridge this gap, we propose a personalized FL methodology for green IIoT systems powered by renewable energy sources. We first establish an incentive model along with its preference parameter-solving scheme to accurately characterize the incentive preferences of individual FL participants. Subsequently, a personalized participant scheduling approach is developed to accommodate dynamic resource usage patterns and diverse incentive preferences among FL participants. Our technique integrates empirical insights into conventional proximal policy optimization methods to accelerate policy learning within reinforcement learning frameworks. Experimental results on an FL prototype system show that our methodology improves the FL model accuracy by 25.92% compared with representative baseline algorithms.

17 November 2023 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
YSYuhong Song
Yuhong Song
ESEdwin Hsing-Mean Sha
Edwin Hsing-Mean Sha
QZQingfeng Zhuge
Qingfeng Zhuge
RXRui Xu
Rui Xu
HWHan Wang
Han Wang

25 November 2023 in Future Generation Computer Systems
Verified
Journal Article
Closed access
KZKunpeng Zhang
Kunpeng Zhang
ESEdwin Hsing-Mean Sha
Edwin Hsing-Mean Sha
QZQingfeng Zhuge
Qingfeng Zhuge
RXRui Xu
Rui Xu