Yourong Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yourong Chen has a total of 151 co-authors. Here are the top co-authors by number of shared publications:
- Meng Han
Zhejiang University
14 shared publications Zhangquan Wang
10 shared publicationsBanteng Liu
Zhejiang Shuren Univ, Coll Informat Sci & Technol, Hangzhou 310015, Peoples R China
6 shared publications- Liyuan Liu
Saint Joseph’s University, Philadelphia, USA
6 shared publications Tiaojuan Ren
College of Information Science and Technology, Zhejiang Shuren University, Hangzhou, China
6 shared publications- Tiaojuan Ren
College of Information Science and Technology, Zhejiang Shuren University, Hangzhou, Zhejiang, 310015, China
6 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (20) , 47537-47557
LEAP-DAG: Block Consensus and On-Chain Pruning Algorithm for Wireless IoT Nodes
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (20) , 47537-47557
LEAP-DAG: Block Consensus and On-Chain Pruning Algorithm for Wireless IoT Nodes
- Open Access
- 11 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 201-207
A Low-Latency Multimodal Data Anchoring and Ownership Proof System on Sharded PBFT Blockchain
Trustworthy on-chain anchoring of multimodal data with ownership proof is increasingly demanded in AIGC data provenance, medical-imaging custody, and digital-rights registration. Existing solutions face three intertwined challenges: (i) heterogeneous modalities lack a unified on-chain fingerprint; (ii) single-chain throughput and consensus latency are bounded by protocol-level constants; (iii) NFT-style standards lack first-claim ownership semantics. We propose a four-layer system: a client-side multimodal encoder maps any modality into a 32-byte canonical dataHash; a content-addressed shard router distributes registration requests across N independent PBFT chains; an AssetRegistry contract provides first-claim ownership with inline data emitted via event log; and a dual-p95 measurement protocol disentangles the PBFT viewchange tail from the chain’s intrinsic commit capability. On a 4-shard × 4-node FISCO BCOS 3.6 deployment, sustained hash-only registration at 100 Hz aggregate over 5 min (30 008 tx) achieves commit \(p_{95}^{\text{clean}} = 170\) ms, leaving a 56% margin under a 399 ms application SLO; across a 10 × load sweep from 50 to 500 Hz, \(p_{95}^{\text{clean}}\) varies only within [142, 162] ms, confirming load-invariance. The four benchmarked modalities (IMAGE / TEXT / JSON / BINARY) canonicalize 1 MB inputs at p95 ≤ 14.7 ms (IMAGE 7.4 ms, TEXT 0.56 ms, JSON 14.7 ms, BINARY 0.5 ms), well within a 30 ms encoder budget; the AUDIO and MIXED modalities are implemented but not yet benchmarked, marked as future work. We additionally report a key engineering finding: in FISCO BCOS 3.6 air mode, consensus_timeout is clamped to ≥ 3 000 ms inside the binary and is absent from the runtime system_config table; this immutable lower bound motivates our dual-p95 methodology, under which the intrinsic path meets the SLO while viewchange-affected transactions do not until the constant is patched. Source code and experimental data are provided as supplementary material for reproducibility.- 11 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 201-207
Open AccessA Low-Latency Multimodal Data Anchoring and Ownership Proof System on Sharded PBFT Blockchain
Trustworthy on-chain anchoring of multimodal data with ownership proof is increasingly demanded in AIGC data provenance, medical-imaging custody, and digital-rights registration. Existing solutions face three intertwined challenges: (i) heterogeneous modalities lack a unified on-chain fingerprint; (ii) single-chain throughput and consensus latency are bounded by protocol-level constants; (iii) NFT-style standards lack first-claim ownership semantics. We propose a four-layer system: a client-side multimodal encoder maps any modality into a 32-byte canonical dataHash; a content-addressed shard router distributes registration requests across N independent PBFT chains; an AssetRegistry contract provides first-claim ownership with inline data emitted via event log; and a dual-p95 measurement protocol disentangles the PBFT viewchange tail from the chain’s intrinsic commit capability. On a 4-shard × 4-node FISCO BCOS 3.6 deployment, sustained hash-only registration at 100 Hz aggregate over 5 min (30 008 tx) achieves commit \(p_{95}^{\text{clean}} = 170\) ms, leaving a 56% margin under a 399 ms application SLO; across a 10 × load sweep from 50 to 500 Hz, \(p_{95}^{\text{clean}}\) varies only within [142, 162] ms, confirming load-invariance. The four benchmarked modalities (IMAGE / TEXT / JSON / BINARY) canonicalize 1 MB inputs at p95 ≤ 14.7 ms (IMAGE 7.4 ms, TEXT 0.56 ms, JSON 14.7 ms, BINARY 0.5 ms), well within a 30 ms encoder budget; the AUDIO and MIXED modalities are implemented but not yet benchmarked, marked as future work. We additionally report a key engineering finding: in FISCO BCOS 3.6 air mode, consensus_timeout is clamped to ≥ 3 000 ms inside the binary and is absent from the runtime system_config table; this immutable lower bound motivates our dual-p95 methodology, under which the intrinsic path meets the SLO while viewchange-affected transactions do not until the constant is patched. Source code and experimental data are provided as supplementary material for reproducibility. - Open Access
- 11 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 187-193
ZK-FPE: Blockchain-Verifiable Model Fingerprinting with Zero-Knowledge Privacy for Ownership Attribution
- 11 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 187-193
Open AccessZK-FPE: Blockchain-Verifiable Model Fingerprinting with Zero-Knowledge Privacy for Ownership Attribution
- Open Access
- 13 April 2026
- Published by Elsevier in Results in Engineering
- Vol. 30
Node efficient consensus algorithm for topology-heterogeneous large-scale IIoT based on multi-chain DAG
- 13 April 2026
- Published by Elsevier in Results in Engineering
- Vol. 30
Open AccessNode efficient consensus algorithm for topology-heterogeneous large-scale IIoT based on multi-chain DAG
- Open Access
A Multiple-Objective Memetic Algorithm for the Energy- Efficient Scheduling of Distributed Assembly Flow Shops
In this paper, a Multiple-Objective Memetic Algorithm (MOMA) is proposed to address the Energy-Efficient Distributed Assembly Permutation Flow-Shop Scheduling Problem (EEDAPFSP) by explicitly exploiting the structural and objective symmetries inherent in the scheduling process, with the dual objectives of minimizing the maximum completion time (makespan) and total energy consumption (TEC). The EEDAPFSP is a complex NP-hard optimization problem in modern sustainable manufacturing that balances production efficiency and environmental sustainability. During the global search phase, a symmetry-preserving dual-search framework is constructed, in which diverse and potential regions in the solution space are explored by symmetrically generating time-dominant product sub-sequences (TDPSs) and energy-dominant product sub-sequences (EDPSs) in the individuals of each iteration, enabling complementary exploration from time- and energy-oriented perspectives. This is accomplished through the incorporation of a variable-weight metric technique and a first product fixed strategy into an estimation distributed algorithm-based hyper-heuristic (EDAHH), so as to maintain a balanced and symmetric probabilistic modeling of decision patterns with respect to the makespan and energy consumption. In the local search phase, two problem-specific designed neighborhood structures are proposed to refine the job sequences corresponding to the TDPS and EDPS in the superior sub-population, effectively reducing both the makespan and TEC. A box-level dominance technique based on the crowding distance is proposed for Pareto archive updating. Additionally, an energy-saving strategy is embedded throughout the algorithm, incorporating three mechanisms—job processing delay, machine shutdown and restart control, and speed regulation—to further optimize TEC during both the global and local search phases. Finally, extensive computational experiments are carried out, and the results demonstrate that the MOMA achieves significantly better performance in terms of the inverted generational distance () and the quality metric compared with state-of-the-art algorithms. The resulting Pareto front of non-dominated solutions provides a comprehensive set of trade-offs between energy consumption and the makespan, offering decision makers flexible and efficient scheduling options.Open AccessA Multiple-Objective Memetic Algorithm for the Energy- Efficient Scheduling of Distributed Assembly Flow Shops
In this paper, a Multiple-Objective Memetic Algorithm (MOMA) is proposed to address the Energy-Efficient Distributed Assembly Permutation Flow-Shop Scheduling Problem (EEDAPFSP) by explicitly exploiting the structural and objective symmetries inherent in the scheduling process, with the dual objectives of minimizing the maximum completion time (makespan) and total energy consumption (TEC). The EEDAPFSP is a complex NP-hard optimization problem in modern sustainable manufacturing that balances production efficiency and environmental sustainability. During the global search phase, a symmetry-preserving dual-search framework is constructed, in which diverse and potential regions in the solution space are explored by symmetrically generating time-dominant product sub-sequences (TDPSs) and energy-dominant product sub-sequences (EDPSs) in the individuals of each iteration, enabling complementary exploration from time- and energy-oriented perspectives. This is accomplished through the incorporation of a variable-weight metric technique and a first product fixed strategy into an estimation distributed algorithm-based hyper-heuristic (EDAHH), so as to maintain a balanced and symmetric probabilistic modeling of decision patterns with respect to the makespan and energy consumption. In the local search phase, two problem-specific designed neighborhood structures are proposed to refine the job sequences corresponding to the TDPS and EDPS in the superior sub-population, effectively reducing both the makespan and TEC. A box-level dominance technique based on the crowding distance is proposed for Pareto archive updating. Additionally, an energy-saving strategy is embedded throughout the algorithm, incorporating three mechanisms—job processing delay, machine shutdown and restart control, and speed regulation—to further optimize TEC during both the global and local search phases. Finally, extensive computational experiments are carried out, and the results demonstrate that the MOMA achieves significantly better performance in terms of the inverted generational distance () and the quality metric compared with state-of-the-art algorithms. The resulting Pareto front of non-dominated solutions provides a comprehensive set of trade-offs between energy consumption and the makespan, offering decision makers flexible and efficient scheduling options. - 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (1) , 1156-1170
Multimodal Thermal and Depth Imaging for Back Acupoint Localization in Massage Robots
Accurate localization of human acupotints remains a fundamental challenge in the development of massage robot systems. While deep learning algorithms leveraging the classical Transformer architecture have improved recognition accuracy, a notable gap still exists between current performance and the robustness needed to handle complex lighting conditions and individual variability. To fill this gap, this paper focuses on the scenarios involving low-light conditions and subjects wearing close-fitting clothing. To address this issue, the paper proposes an acupoint localization algorithm tailored to the scenario by employing multimodal data fusion techniques that intergrate thermal imaging with depth map information. The algorithm is based on YOLOv8 and has been architecturally improved, referred to as YOLOv8-TCC. Specifically, a dual-branch parallel backbone network architecture is designed, incorporating the Channel Prior Convolutional Attention (CPCA) module to enhance multimodal feature representation. Next, a Cross-Modal Feature Fusion (CTF) module is introduced to facilitate information integration, while a dynamic template alignment approach is proposed to accommodate variations in body shape and posture. Experimental results show that the YOLOv8-TCC method achieves higher accuracy compared to the traditional single-modal model under varying lighting conditions. With the introduction of the CTF and CPCA modules, the average precision at Intersection over Union (AP@0.75) increased by 2.8% and 0.8%, respectively. Moreover, the success rate under the clinically meaningful 0.5 cun constraint (SR@0.5 cun) reached 95%. It is worth mentioning that our method remains effective when subjects wear light and close-fitting clothing. The proposed method exhibits strong generalizability and scalability, offering an accurate and efficient solution for practical applications.
- 17 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (1) , 1156-1170
Multimodal Thermal and Depth Imaging for Back Acupoint Localization in Massage Robots
Accurate localization of human acupotints remains a fundamental challenge in the development of massage robot systems. While deep learning algorithms leveraging the classical Transformer architecture have improved recognition accuracy, a notable gap still exists between current performance and the robustness needed to handle complex lighting conditions and individual variability. To fill this gap, this paper focuses on the scenarios involving low-light conditions and subjects wearing close-fitting clothing. To address this issue, the paper proposes an acupoint localization algorithm tailored to the scenario by employing multimodal data fusion techniques that intergrate thermal imaging with depth map information. The algorithm is based on YOLOv8 and has been architecturally improved, referred to as YOLOv8-TCC. Specifically, a dual-branch parallel backbone network architecture is designed, incorporating the Channel Prior Convolutional Attention (CPCA) module to enhance multimodal feature representation. Next, a Cross-Modal Feature Fusion (CTF) module is introduced to facilitate information integration, while a dynamic template alignment approach is proposed to accommodate variations in body shape and posture. Experimental results show that the YOLOv8-TCC method achieves higher accuracy compared to the traditional single-modal model under varying lighting conditions. With the introduction of the CTF and CPCA modules, the average precision at Intersection over Union (AP@0.75) increased by 2.8% and 0.8%, respectively. Moreover, the success rate under the clinically meaningful 0.5 cun constraint (SR@0.5 cun) reached 95%. It is worth mentioning that our method remains effective when subjects wear light and close-fitting clothing. The proposed method exhibits strong generalizability and scalability, offering an accurate and efficient solution for practical applications.
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (24) , 52378-52400
A Fast Consensus Algorithm of Large-Scale Heterogeneous Dynamic IoT Nodes for DAG-Based Blockchain
To solve issues of frequent network topology changes to slow consensus speed and low security in consensus algorithms within heterogeneous dynamic Internet of Things (IoT) systems, we propose a fast consensus algorithm of large-scale heterogeneous dynamic IoT nodes for directed acyclic graph (DAG)-based blockchain (LSHD_DAG). First, an adaptive regional division method for heterogeneous dynamic nodes is proposed, which monitors nodes’ state and counts within each region, adjusting the boundaries of adjacent regions. Second, an event-triggered main–sub DAG chain design is proposed. When transaction information pertains to a single region, the transaction is processed as a local transaction to construct a regional DAG sub chain. If transaction information involves multiple regions, it is organized into a multiregional transaction set and incorporated into the global DAG main chain. Next, a node grade identification mechanism that balances state and reputation factors is proposed. This mechanism adopts the level of participation (LOF) algorithm to classify or dynamically update node grades by considering node state and reputation evaluation results, assigning them identity permissions. Finally, a weighted voting consensus based on the main–sub DAG chain is introduced. Nearby honest nodes with stable movement are selected as consensus nodes, which perform multiregional weighted voting consensus on transactions and transaction sets. This process concludes with two-way pegging with multisignature on the main–sub DAG, ensuring secure and rapid consensus for data in heterogeneous and dynamic IoT environments. The experimental results show that no matter how the number of nodes changes, LSHD_DAG can improve transaction throughput and reduce latency and communication overhead, outperforming the credit-delegated byzantine fault tolerance (CDBFT), DAG double (DAG-D), and Avalanche.
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (24) , 52378-52400
A Fast Consensus Algorithm of Large-Scale Heterogeneous Dynamic IoT Nodes for DAG-Based Blockchain
To solve issues of frequent network topology changes to slow consensus speed and low security in consensus algorithms within heterogeneous dynamic Internet of Things (IoT) systems, we propose a fast consensus algorithm of large-scale heterogeneous dynamic IoT nodes for directed acyclic graph (DAG)-based blockchain (LSHD_DAG). First, an adaptive regional division method for heterogeneous dynamic nodes is proposed, which monitors nodes’ state and counts within each region, adjusting the boundaries of adjacent regions. Second, an event-triggered main–sub DAG chain design is proposed. When transaction information pertains to a single region, the transaction is processed as a local transaction to construct a regional DAG sub chain. If transaction information involves multiple regions, it is organized into a multiregional transaction set and incorporated into the global DAG main chain. Next, a node grade identification mechanism that balances state and reputation factors is proposed. This mechanism adopts the level of participation (LOF) algorithm to classify or dynamically update node grades by considering node state and reputation evaluation results, assigning them identity permissions. Finally, a weighted voting consensus based on the main–sub DAG chain is introduced. Nearby honest nodes with stable movement are selected as consensus nodes, which perform multiregional weighted voting consensus on transactions and transaction sets. This process concludes with two-way pegging with multisignature on the main–sub DAG, ensuring secure and rapid consensus for data in heterogeneous and dynamic IoT environments. The experimental results show that no matter how the number of nodes changes, LSHD_DAG can improve transaction throughput and reduce latency and communication overhead, outperforming the credit-delegated byzantine fault tolerance (CDBFT), DAG double (DAG-D), and Avalanche.
- Open Access
- 6 August 2025
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 11 (9) , 1-17
Beyond contrastive learning: adaptive graph representations with mutual information maximization for blockchain and structured data
- 6 August 2025
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 11 (9) , 1-17
Open AccessBeyond contrastive learning: adaptive graph representations with mutual information maximization for blockchain and structured data