Zhongyuan Jiang
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
Zhongyuan Jiang has a total of 109 co-authors. Here are the top co-authors by number of shared publications:
- Jianfeng Ma
Xidian University
16 shared publications Man-Gui Liang
8 shared publications- Xinghua Li
Xidian University
8 shared publications - Philip S. Yu
University of Illinois Chicago
6 shared publications - Dongchao Guo
School of Computer Science, Beijing Information Science and Technology University, Beijing 102206, China
4 shared publications Jian-Feng Ma
Xidian Univ, Sch Cyber Engn, Xian 710071, Shaanxi, Peoples R China
4 shared publications
Latest Publications
- Open Access
- 10 October 2026
- Published by Elsevier in SSRN Electronic Journal
WEBIMAGESHEPHERD: A Lightweight Framework for Robust Forgery Localization under Website Image Attacks
Advances in image editing and AIGC pose growing challenges to image forgery localization (IFL). However, existing methods mainly target offline images, overlooking manipulations arising from website delivery and platform-side processing. To address this gap, we propose WEBIMAGESHEPHERD, a lightweight framework for browser-side forgery localization. We first establish a two-level Website Image Attacks (WIA) threat model covering network-level and web-level manipulations. We then develop DS-IFDM, a lightweight dual-stream localization engine that combines RGB appearance cues and manipulation-sensitive noise representations for pixel-level localization. Experiments on five public IFL benchmarks and under diverse web-induced transformations demonstrate its effectiveness and robustness. With 4.23 million parameters and 38.6 GFLOPs, DS-IFDM offers a favorable accuracy-efficiency trade-off. Finally, we integrate WEBIMAGESHEPHERD into a Chrome extension and evaluate it on 1,444 websites containing 59,529 images, demonstrating the feasibility of browser-side forgery localization in real-world web environments. Code is available at GitHub.
- 10 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessWEBIMAGESHEPHERD: A Lightweight Framework for Robust Forgery Localization under Website Image Attacks
Advances in image editing and AIGC pose growing challenges to image forgery localization (IFL). However, existing methods mainly target offline images, overlooking manipulations arising from website delivery and platform-side processing. To address this gap, we propose WEBIMAGESHEPHERD, a lightweight framework for browser-side forgery localization. We first establish a two-level Website Image Attacks (WIA) threat model covering network-level and web-level manipulations. We then develop DS-IFDM, a lightweight dual-stream localization engine that combines RGB appearance cues and manipulation-sensitive noise representations for pixel-level localization. Experiments on five public IFL benchmarks and under diverse web-induced transformations demonstrate its effectiveness and robustness. With 4.23 million parameters and 38.6 GFLOPs, DS-IFDM offers a favorable accuracy-efficiency trade-off. Finally, we integrate WEBIMAGESHEPHERD into a Chrome extension and evaluate it on 1,444 websites containing 59,529 images, demonstrating the feasibility of browser-side forgery localization in real-world web environments. Code is available at GitHub.
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 10017-10032
TRACE: A Graph-Constrained Transformer for Communication-Efficient Distributed Routing in LEO Constellations
Large-scale Low Earth Orbit (LEO) constellations often experience high node failure rates caused by dynamic environmental factors (random failures), such as satellite maneuvers, or by cyber or physical attacks on critical nodes (targeted attacks), which pose unique challenges for routing optimization. Traditional algorithms such as Dijkstra suffer from limited parallel scalability on GPUs due to irregular neighbor distributions, while deep learning methods lack generalization ability. To address these challenges, we propose TRACE (Topology-aware Routing via Adjacent-Constraint Encoding), a graph-constrained Transformer architecture equipped with a cascaded multi-head attention decoder for distributed dynamic routing in LEO domains. To improve algorithm throughput and resilience against random failures and targeted attacks, we further design NFD (Navigator–Follower Distillation), a self-distillation framework which enables each agent to learn routing policies from Monte Carlo episodes. Furthermore, a hierarchical distributed routing architecture is developed to extend the proposed method to multi-domain scenarios. Simulation results demonstrate that TRACE with NFD achieves near-optimal routing accuracy with controllable inter-domain errors, while significantly improving throughput compared with mainstream routing algorithms.
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 10017-10032
TRACE: A Graph-Constrained Transformer for Communication-Efficient Distributed Routing in LEO Constellations
Large-scale Low Earth Orbit (LEO) constellations often experience high node failure rates caused by dynamic environmental factors (random failures), such as satellite maneuvers, or by cyber or physical attacks on critical nodes (targeted attacks), which pose unique challenges for routing optimization. Traditional algorithms such as Dijkstra suffer from limited parallel scalability on GPUs due to irregular neighbor distributions, while deep learning methods lack generalization ability. To address these challenges, we propose TRACE (Topology-aware Routing via Adjacent-Constraint Encoding), a graph-constrained Transformer architecture equipped with a cascaded multi-head attention decoder for distributed dynamic routing in LEO domains. To improve algorithm throughput and resilience against random failures and targeted attacks, we further design NFD (Navigator–Follower Distillation), a self-distillation framework which enables each agent to learn routing policies from Monte Carlo episodes. Furthermore, a hierarchical distributed routing architecture is developed to extend the proposed method to multi-domain scenarios. Simulation results demonstrate that TRACE with NFD achieves near-optimal routing accuracy with controllable inter-domain errors, while significantly improving throughput compared with mainstream routing algorithms.
- 16 February 2026
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 17 (3) , 96
Dynamic lexicon integration and update in BERT for enhanced named entity recognition in Chinese legal contracts
- 16 February 2026
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 17 (3) , 96
Dynamic lexicon integration and update in BERT for enhanced named entity recognition in Chinese legal contracts
- Open Access
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 6240-6254
ProvBench: A Benchmark of Legal Provision Recommendation for Contract Auto-Reviewing
Xiuxuan Shen, Zhongyuan Jiang, Junsan Zhang, Junxiao Han, Yao Wan, Chengjie Guo, Bingcheng Liu, Jie Wu, Renxiang Li, Philip S. Yu. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 6240-6254
Open AccessProvBench: A Benchmark of Legal Provision Recommendation for Contract Auto-Reviewing
Xiuxuan Shen, Zhongyuan Jiang, Junsan Zhang, Junxiao Han, Yao Wan, Chengjie Guo, Bingcheng Liu, Jie Wu, Renxiang Li, Philip S. Yu. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.
- Top Cited Papers
- 2 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-14
CRS-Diff: Controllable Remote Sensing Image Generation With Diffusion Model
The emergence of generative models has revolutionized the field of remote sensing (RS) image generation. Despite generating high-quality images, existing methods are limited in relying mainly on text control conditions, and thus do not always generate images accurately and stably. In this paper, we propose CRS-Diff, a new RS generative framework specifically tailored for RS image generation, leveraging the inherent advantages of diffusion models while integrating more advanced control mechanisms. Specifically, CRS-Diff can simultaneously support text-condition, metadata-condition, and image-condition control inputs, thus enabling more precise control to refine the generation process. To effectively integrate multiple condition control information, we introduce a new conditional control mechanism to achieve multi-scale feature fusion, thus enhancing the guiding effect of control conditions. To our knowledge, CRS-Diff is the first multiple-condition controllable RS generative model. Experimental results in single-condition and multiple-condition cases have demonstrated the superior ability of our CRS-Diff to generate RS images both quantitatively and qualitatively compared with previous methods. Additionally, our CRS-Diff can serve as a data engine that generates high-quality training data for downstream tasks, e.g., road extraction. The code is available at https://github.com/Sonettoo/CRS-Diff.
- 2 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-14
Top Cited PapersCRS-Diff: Controllable Remote Sensing Image Generation With Diffusion Model
The emergence of generative models has revolutionized the field of remote sensing (RS) image generation. Despite generating high-quality images, existing methods are limited in relying mainly on text control conditions, and thus do not always generate images accurately and stably. In this paper, we propose CRS-Diff, a new RS generative framework specifically tailored for RS image generation, leveraging the inherent advantages of diffusion models while integrating more advanced control mechanisms. Specifically, CRS-Diff can simultaneously support text-condition, metadata-condition, and image-condition control inputs, thus enabling more precise control to refine the generation process. To effectively integrate multiple condition control information, we introduce a new conditional control mechanism to achieve multi-scale feature fusion, thus enhancing the guiding effect of control conditions. To our knowledge, CRS-Diff is the first multiple-condition controllable RS generative model. Experimental results in single-condition and multiple-condition cases have demonstrated the superior ability of our CRS-Diff to generate RS images both quantitatively and qualitatively compared with previous methods. Additionally, our CRS-Diff can serve as a data engine that generates high-quality training data for downstream tasks, e.g., road extraction. The code is available at https://github.com/Sonettoo/CRS-Diff.
- 4 June 2024
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 15 (11) , 4959-4971
Target link protection against link-prediction-based attacks via artificial bee colony algorithm based on random walk
- 4 June 2024
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 15 (11) , 4959-4971
Target link protection against link-prediction-based attacks via artificial bee colony algorithm based on random walk
- 16 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (4) , 3347-3360
K-Backup: Load- and TCAM-Aware Multi-Backup Fast Failure Recovery in SDNs
The Proactive Recovery (PR) mechanism in Software-Defined Networking (SDN) provides good failure recovery resilience for the Beyond Fifth-Generation/Sixth-Generation (B5G/6G) delay-sensitive applications. However, PR’s fixed single backup path policy for any flow and fine-grained backup forwarding rule configuration poses severe challenges for post-recovery congestion management and limited Ternary Content Addressable Memory (TCAM) space in SDN switches. To this end, we propose K-backup, a load-and TCAM-aware multi-backup fast failure recovery scheme for SDNs. Firstly, K-backup formulates and solves the congestion-aware multi-backup path planning problem for various failure scenarios, exploiting the inherent load diversity of multi-backup paths to minimize the post-recovery maximum link utilization. Secondly, K-backup aggregates flows sharing the same backup-path-weight pair on a link into a cascading table of Fast-Failover and SELECT groups. Meanwhile, each outputted backup path is labeled, and a corresponding label-matching flow table is configured for each intermediate switch to aggregate all flows on that path. Thirdly, K-backup dynamically adjusts the backup path update period based on the network load stabilization to reduce unnecessary controller overhead. Compared with state-of-the-art, K-backup achieves the lowest controller overhead, the best load balancing performance, the near-fewest TCAM space usage, and the near-shortest recovery time.
- 16 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (4) , 3347-3360
K-Backup: Load- and TCAM-Aware Multi-Backup Fast Failure Recovery in SDNs
The Proactive Recovery (PR) mechanism in Software-Defined Networking (SDN) provides good failure recovery resilience for the Beyond Fifth-Generation/Sixth-Generation (B5G/6G) delay-sensitive applications. However, PR’s fixed single backup path policy for any flow and fine-grained backup forwarding rule configuration poses severe challenges for post-recovery congestion management and limited Ternary Content Addressable Memory (TCAM) space in SDN switches. To this end, we propose K-backup, a load-and TCAM-aware multi-backup fast failure recovery scheme for SDNs. Firstly, K-backup formulates and solves the congestion-aware multi-backup path planning problem for various failure scenarios, exploiting the inherent load diversity of multi-backup paths to minimize the post-recovery maximum link utilization. Secondly, K-backup aggregates flows sharing the same backup-path-weight pair on a link into a cascading table of Fast-Failover and SELECT groups. Meanwhile, each outputted backup path is labeled, and a corresponding label-matching flow table is configured for each intermediate switch to aggregate all flows on that path. Thirdly, K-backup dynamically adjusts the backup path update period based on the network load stabilization to reduce unnecessary controller overhead. Compared with state-of-the-art, K-backup achieves the lowest controller overhead, the best load balancing performance, the near-fewest TCAM space usage, and the near-shortest recovery time.
- 2 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (3) , 3609-3622
PSMA: Layered Deployment Scheme for Secure VNF Multiplexing Based on Primary and Secondary Multiplexing Architecture
The adoption of SDN/NFV opens avenues for efficient network slicing deployment and cost control. However, the dynamic cost reduction brought by deployment location optimization is not suitable for all scenarios. To further reduce the cost, we recommend a sharing strategy in NFV. In this paper, we introduce a two-layer VNF multiplexing architecture, named PSMA, which guarantees both efficient VNF sharing operations and secure slicing during multiplexing. Leveraging the SDN/NFV features, the proposed scheme splits data processing and key management and establish secure connections using SDN’s programmable routing. The provided framework integrates comprehensive life-cycle management and key delivery mechanisms. The article substantiates its availability through extensive simulations of VNF reuse on a randomly generated network with Virtual Network Requests (VNR). The empirical results indicate a significant cost reduction of 5% to 10%, particularly pronounced in scenarios involving a substantial number of short-lived and transitional VNFs.
- 2 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (3) , 3609-3622
PSMA: Layered Deployment Scheme for Secure VNF Multiplexing Based on Primary and Secondary Multiplexing Architecture
The adoption of SDN/NFV opens avenues for efficient network slicing deployment and cost control. However, the dynamic cost reduction brought by deployment location optimization is not suitable for all scenarios. To further reduce the cost, we recommend a sharing strategy in NFV. In this paper, we introduce a two-layer VNF multiplexing architecture, named PSMA, which guarantees both efficient VNF sharing operations and secure slicing during multiplexing. Leveraging the SDN/NFV features, the proposed scheme splits data processing and key management and establish secure connections using SDN’s programmable routing. The provided framework integrates comprehensive life-cycle management and key delivery mechanisms. The article substantiates its availability through extensive simulations of VNF reuse on a randomly generated network with Virtual Network Requests (VNR). The empirical results indicate a significant cost reduction of 5% to 10%, particularly pronounced in scenarios involving a substantial number of short-lived and transitional VNFs.
- 16 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (10) , 18663-18675
MLDR: An O(|V|/4) and Near-Optimal Routing Scheme for LEO Mega-Constellations
Low Earth Orbit (LEO) mega-constellations enable the Internet of Things (IoT) industry to realize the vision of integrated space-air-ground-sea communication networks under B5G and 6G. However, due to the high complexity of O(|V|log|V|+|E|) of Dijkstra’s algorithm, existing LEO mega-constellations suffer from excessive routing reconvergence time under frequent topology changes caused by satellite-ground station link handovers and network failures. To this end, we propose MLDR, a Manhattan-like topology-and Low ISL Delay-based Routing scheme with an ultra-low routing complexity of O(|V|4) while maintaining near-optimal routing. Firstly, for any source satellite, MLDR divides the Manhattan-like topology of LEO mega-constellations into four non-interfering Minimum Hop (MH) areas. Secondly, MLDR concurrently and non-repeatedly computes MH paths for all destinations within each MH area and installs routing tables. Thirdly, MLDR incrementally computes and updates the MH paths by more optimal MH detour paths, which select other neighboring satellites as relaying nodes. Finally, by conducting extensive simulations on real-world LEO mega-constellations, our MLDR outperforms all state-of-the-art schemes by remarkably reducing reconvergence time and achieving the highest routing optimality.
- 16 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (10) , 18663-18675
MLDR: An O(|V|/4) and Near-Optimal Routing Scheme for LEO Mega-Constellations
Low Earth Orbit (LEO) mega-constellations enable the Internet of Things (IoT) industry to realize the vision of integrated space-air-ground-sea communication networks under B5G and 6G. However, due to the high complexity of O(|V|log|V|+|E|) of Dijkstra’s algorithm, existing LEO mega-constellations suffer from excessive routing reconvergence time under frequent topology changes caused by satellite-ground station link handovers and network failures. To this end, we propose MLDR, a Manhattan-like topology-and Low ISL Delay-based Routing scheme with an ultra-low routing complexity of O(|V|4) while maintaining near-optimal routing. Firstly, for any source satellite, MLDR divides the Manhattan-like topology of LEO mega-constellations into four non-interfering Minimum Hop (MH) areas. Secondly, MLDR concurrently and non-repeatedly computes MH paths for all destinations within each MH area and installs routing tables. Thirdly, MLDR incrementally computes and updates the MH paths by more optimal MH detour paths, which select other neighboring satellites as relaying nodes. Finally, by conducting extensive simulations on real-world LEO mega-constellations, our MLDR outperforms all state-of-the-art schemes by remarkably reducing reconvergence time and achieving the highest routing optimality.
- Open Access
- 28 November 2023
- Published by Springer Nature in Research Square
Target Link Protection against Link-Prediction-Based Attacks via Artificial Bee Colony Algorithm Based on Random Walk
Link prediction is a network analysis model used to discover missing links or future relationships that may appear, which has been widely used in many real network systems to predict the potential relationship between two individuals. However, link prediction can also be used by attackers to identify sensitive links that users are unwilling to expose, which makes only removing sensitive links from the original network ineffective and leads to the disclosure of privacy. In this paper, we propose a target link protection mechanism via artificial bee colony algorithm based on random walk (RABC), which can defend the link prediction attacks based on Resource Allocation (RA) metric effectively.To enhance the local search ability of RABC, the random walk algorithm is combined with the original artificial bee colony algorithm. Then, we compare our method with other existing methods, which shows that RABC has higher efficiency while ensuring the effectiveness. Finally, extensive experiments on real social networks are conducted to demonstrate the good performance of RABC on protecting sensitive links from being detected successfully by link prediction model. Furthermore, the perturbed networks generated by RABC is transferable to defend against other link prediction attacks.
- 28 November 2023
- Published by Springer Nature in Research Square
Open AccessTarget Link Protection against Link-Prediction-Based Attacks via Artificial Bee Colony Algorithm Based on Random Walk
Link prediction is a network analysis model used to discover missing links or future relationships that may appear, which has been widely used in many real network systems to predict the potential relationship between two individuals. However, link prediction can also be used by attackers to identify sensitive links that users are unwilling to expose, which makes only removing sensitive links from the original network ineffective and leads to the disclosure of privacy. In this paper, we propose a target link protection mechanism via artificial bee colony algorithm based on random walk (RABC), which can defend the link prediction attacks based on Resource Allocation (RA) metric effectively.To enhance the local search ability of RABC, the random walk algorithm is combined with the original artificial bee colony algorithm. Then, we compare our method with other existing methods, which shows that RABC has higher efficiency while ensuring the effectiveness. Finally, extensive experiments on real social networks are conducted to demonstrate the good performance of RABC on protecting sensitive links from being detected successfully by link prediction model. Furthermore, the perturbed networks generated by RABC is transferable to defend against other link prediction attacks.