Shaofei Lu

Dr. Shaofei Lu

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
24 March 2021 in IEEE Access
Verified
Journal Article
Open access
SLShaofei Lu
Shaofei Lu
QXQinhua Xia
Qinhua Xia
XTXiaolin Tang
Xiaolin Tang
XZXuyang Zhang
Xuyang Zhang
YLYingping Lu
Yingping Lu
JSJingke She
Jingke She
The rapid development of the IoT and cloud computing has spawned a new network structure - sensor-cloud system (SCS) where sensors, sensor networks, and cloud computing are integrated to perform data sensing, collection, transmission, and decision making. The large-scale deployment of sensors creates a massive amount of data, posing new challenges in data transmission and storage. As an intermediate platform between IoT and cloud platforms, edge computing provides IoT with data collection, processing, and scheduling services. This paper proposes a hybrid data compression scheme that incorporates lossy and lossless compression in SCS based on edge computing to address the increasing challenges. Moreover, we propose a new reliable lossy compression algorithm DFan, based on the simplified Fan algorithm with a high compression ratio (CR). By introducing the data tolerable deviation, DFan transforms single-factor decision-making into multi-factor decision-making, reducing the error of lossy compression. Through experiments on IntelLab and MIT-BIH datasets, the proposed hybrid data compression scheme achieves an overall CR of 4.21× and 3.88×, respectively. The lossy CR of DFan is 6.42× and 5.1×, respectively, and the Percentage RMS Difference (PRD) caused by lossy compression is 0.27% and 0.56%, respectively. The hybrid compression scheme, high compression ratio, and reliable data restoration make this scheme attractive to the data processing of sensors in SCS.

7 February 2023 in Sensors
Verified
Journal Article
Open access
PDF file
SLShaofei Lu
Shaofei Lu
JPJingru Pei
Jingru Pei
RZRenke Zhao
Renke Zhao
XYXiaochen Yu
Xiaochen Yu
XZXuyang Zhang
Xuyang Zhang
GYGuanzhong Yang
Guanzhong Yang
Cross-chain interoperability can expand the ability of data interaction and value circulation between different blockchains, especially the value interaction and information sharing between industry consortium blockchains. However, some current public blockchain cross-chain technologies or data migration schemes between consortium blockchains need help to meet the consortium blockchain requirements for efficient two-way data interaction. The critical issue to solve in cross-chain technology is improving the efficiency of cross-chain exchange while ensuring the security of data transmission outside the consortium blockchain. In this article, we design a cross-chain architecture based on blockchain oracle technology. Then, we propose a bidirectional information cross-chain interaction approach (CCIO) based on the former architecture, we novelly improve three traditional blockchain oracle patterns, and we combine a mixture of symmetric and asymmetric keys to encrypt private information to ensure cross-chain data security. The experimental results demonstrate that the proposed CCIO approach can achieve efficient and secure two-way cross-chain data interactions and better meet the application needs of large-scale consortium blockchains.

27 December 2022 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SLShaofei Lu
Shaofei Lu
SLShen Liu
Shen Liu
YZYajun Zhu
Yajun Zhu
WLWei Liang
Wei Liang
Kuan-Ching LiKuan-Ching Li
Kuan-Ching Li
YLYingping Lu
Yingping Lu
With the development of edge computing and 5G, the demand for resources-limited devices to execute computation-intensive tasks can be effectively alleviated. The research of computation offloading lays an essential foundation for realizing mobile edge computing, and Deep Reinforcement Learning (DRL) has become an emerging technique to address the computation offloading problem. This paper utilizes a DRL-based algorithm to design a decentralized computation offloading framework aimed at minimizing the computational cost. We employ a multi-user system model with a single-edge server suitable for industrial scenarios. Then we propose a Dual-Critic Deep Deterministic Policy Gradient (DC-DDPG) algorithm based on Deep Deterministic Policy Gradient (DDPG) algorithm to tackle computation offloading and resource allocation problems for all users, respectively. DC-DDPG adopts two critic nets in both the primary net and the target net to fit the action-value of two different optimization objectives, which expedites the convergence during the training process and reduces the computational cost of the edge computation system during operation. Compared with other deep reinforcement learning methods such as Deep Q-Network (DQN) and DDPG, numerical results demonstrate that the proposed DC-DDPG algorithm has a faster convergence speed and performs significantly better than other DRL-based algorithms in terms of system computational cost in computing-intensive tasks, which is more suitable for industrial intelligent manufacturing scenarios with large data volume.

17 May 2023 in Electronics
Verified
Journal Article
Open access
PDF file
SLShaofei Lu
Shaofei Lu
XZXuyang Zhang
Xuyang Zhang
RZRenke Zhao
Renke Zhao
LCLizhi Chen
Lizhi Chen
JLJunyi Li
Junyi Li
GYGuanzhong Yang
Guanzhong Yang
With the rise in blockchain technology, consortium blockchains have garnered increasing attention in practical applications due to their decentralization and immutability. However, the performance of current consortium blockchains remains a significant obstacle to large-scale commercial adoption. The consensus algorithm, as a fundamental component of blockchain technology, plays a critical role in ensuring both security and efficiency. Unfortunately, most existing consensus algorithms for consortium blockchains are vote-based consensus algorithms, and the performance of vote-based consensus algorithms is largely limited by the performance of the leader node. Therefore, we present P-Raft: a high-performance consensus algorithm that builds upon the Raft algorithm and leverages node server performance evaluations. The primary objectives of this article included enhancing the efficiency of Leader processing, promoting the utilization of the consortium blockchain, and ensuring the robustness of Leader election. Specifically designed to meet the service requirements of consortium blockchain’s consensus mechanism, the P-Raft incorporated the Yasa model, which evaluated the instant machine performance of each node. The performance of each node is then associated with the election timeout, ensuring that nodes with superior performance are more likely to be chosen as Leaders. Additionally, we implemented a leader verification mechanism based on the Bohen-Lynn-Shacham (BLS) signature, which prevented malicious Byzantine nodes from becoming Leaders without receiving enough votes. Empirical findings show that the P-Raft can swiftly designate high-performing nodes as Leaders, thereby greatly improving service efficiency in the consensus process and the overall performance of the consensus mechanism. Ultimately, P-Raft is better equipped to meet the demands of consortium blockchain applications for large-scale transactions.

1 January 2024 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
JWJiawei Wang
Jiawei Wang
YLYuquan Le
Yuquan Le
DCDa Cao
Da Cao
SLShaofei Lu
Shaofei Lu
ZQZhe Quan
Zhe Quan
MWMeng Wang
Meng Wang
Given the fact descriptions of legal cases, the legal judgment prediction (LJP) problem aims to determine three judgment tasks of law articles, charges, and the term of penalty. Most existing studies have considered task dependencies while neglecting the prior dependencies of labels among different tasks. Therefore, how to make better use of the information on the relation dependencies among tasks and labels becomes a crucial issue. To this end, we transform the text classification problem into a node classification framework based on graph reasoning and supervised contrastive learning (SCL) techniques, named GraSCL. Specifically, we first design a graph reasoning network to model the potential dependency structures and facilitate relational learning under various graph topologies. Then, we introduce the SCL method for the LJP task to further leverage the label relation on the graph. To accommodate the node classification settings, we extend the traditional SCL method to novel variants for SCL at the node level, which allows the GraSCL framework to be trained efficiently even with small batches. Furthermore, to recognize the importance of hard negative samples in contrastive learning, we introduce a simple yet effective technique called online hard negative mining (OHNM) to enhance our SCL approach. This technique complements our SCL method and enables us to control the number and complexity of negative samples, leading to further improvements in the model’s performance. Finally, extensive experiments are conducted on two well-known benchmarks, demonstrating the effectiveness and rationality of our proposed SCL approach as compared to the state-of-the-art competitors.

26 July 2022 in Expert Systems with Applications
Verified
Journal Article
Closed access
SCShiyu Chen
Shiyu Chen
YZYawen Zeng
Yawen Zeng
DCDa Cao
Da Cao
SLShaofei Lu
Shaofei Lu