Ruolei Zeng

Mr. Ruolei Zeng

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
28 April 2025 in Agriculture
Verified
Journal Article
Open access
PDF file
RZRuolei Zeng
Ruolei Zeng
JLJialu Li
Jialu Li
ZLZihan Li
Zihan Li
QZQingchuan Zhang
Qingchuan Zhang
Crop yield prediction is critical for agricultural decision making and food security. Traditional models struggle to capture the complex interactions among meteorological, soil, and agricultural factors. This study introduces Crossformer, a Transformer-based model with a Local Perception Unit (LPU) for local dependencies and a Cross-Window Attention Mechanism for global dependencies. Experiments on winter wheat, rice, and corn datasets show that Crossformer outperforms CNN, LSTM, and Transformer in Test Loss, R2, MSE, and MAE. For instance, on the corn dataset, Crossformer achieves a Test Loss of 0.0271 and an R2 of 0.9863, compared to 0.7999 and 0.1634 for LSTM, respectively, demonstrating a substantial improvement in predictive performance. Interpretability analysis highlights the importance of temperature and precipitation in yield prediction, aligning with agricultural insights. The results demonstrate Crossformer’s potential for precision agriculture.

3 August 2020 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
CZChengcheng Zhou
Chengcheng Zhou
QLQian Liu
Qian Liu
RZRuolei Zeng
Ruolei Zeng
The last few years have seen the great potential of artificial intelligence (AI) technology to efficiently and effectively deal with an incredible deluge of data generated by the Internet of Things (IoT) devices. If all the massive data is transferred to the cloud for intelligent processing, it not only brings considerable challenges to the network bandwidth but also cannot meet the needs of AI applications that require fast and real-time response. Therefore, to achieve this requirement, mobile or multiaccess edge computing (MEC) is receiving a substantial amount of interest, and its importance is gradually becoming more prominent. However, with the emerging of edge intelligence, AI also suffers from several tremendous security threats in AI model training, AI model inference, and private data. This paper provides three novel defense strategies to tackle malicious attacks in three aspects. First of all, we introduce a cloud-edge collaborative antiattack scheme to realize a reliable incremental updating of AI by ensuring the data security generated in the training phase. Furthermore, we propose an edge-enhanced defense strategy based on adaptive traceability and punishment mechanism to effectively and radically solve the security problem in the inference stage of the AI model. Finally, we establish a system model based on chaotic encryption with the three-layer architecture of MEC to effectively guarantee the security and privacy of the data during the construction of AI models. The experimental results of these three countermeasures verify the correctness of the conclusion and the feasibility of the methods.

29 October 2024
Verified
Conference Paper
Open access
MYMingzhou Yang
Mingzhou Yang
RZRuolei Zeng
Ruolei Zeng
ASArun Sharma
Arun Sharma
SSShunichi Sawamura
Shunichi Sawamura
WNWilliam Northrop
William Northrop
SSShashi Shekhar
Shashi Shekhar
Given an origin, a destination, and a directed graph in which each edge is associated with a pair of non-negative costs, the bi-objective routing problem aims to find the set of all Pareto-optimal paths. This problem is societally important due to several applications, such as route finding that considers both vehicle travel time and energy consumption. The problem is challenging due to the potentially large number of candidate Pareto-optimal paths to be enumerated during the search, making existing compute-on-demand methods inefficient due to their high time complexity. One way forward is the introduction of precomputation algorithms. However, the large size of the Pareto-optimal set makes it infeasible to precompute and store all-pair solutions. In addition, generalizing traditional single-objective hierarchical algorithms to bi-objective cases is nontrivial because of the non-comparability of candidate paths and the need to accommodate multiple Pareto-optimal paths for each node pair. To overcome these limitations, we propose Multi-Level Bi-Objective Routing (MBOR) algorithms using three novel ideas: boundary multigraph representation, Pareto frontier encoding, and two-dimensional cost-interval based pruning. Computational experiments using real road network data demonstrate that the proposed methods significantly outperform baseline methods in terms of online runtime and precomputation time.

2 November 2025
Verified
Conference Paper
Open access
SZShengya Zhang
Shengya Zhang
ASArun Sharma
Arun Sharma
MFMajid Farhadloo
Majid Farhadloo
MYMingzhou Yang
Mingzhou Yang
RZRuolei Zeng
Ruolei Zeng
SSShashi Shekhar
Shashi Shekhar