Xing Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xing Li has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Dengqi Yang
College of Mathematics and Computer Science, Dali University, Dali 671003, China
2 shared publications - Lina Zhang
College of Mathematics and Computer Science, Dali University, Dali 671003, China
2 shared publications - Xiaowei Li
School of Mathematics and Computer Science, Dali University, Dali 671003, China
2 shared publications - Yuan He
College of Mathematics and Computer Science, Dali University, Dali 671003, China
2 shared publications - Haikun Lv
School of Mathematics and Computer Science, Dali University, Dali 671003, China
1 shared publication - Junfa Zhu
College of Mathematics and Computer Science, Dali University, Dali 671003, China
1 shared publication
Latest Publications
- Open Access
- 19 August 2026
- Published by MDPI AG in Information
- Vol. 17 (8) , 797
GAD-YOLO: A Multi-Level Feature Enhancement Network for Dense Small Traffic Object Detection in Intelligent Transportation Systems
Dense small traffic object detection is essential for intelligent transportation systems but remains challenging because distant targets contain limited visual details, densely distributed objects frequently overlap, and complex road backgrounds introduce substantial interference. To address these limitations, this study proposes GAD-YOLO, a multi-level feature enhancement network based on YOLOv9. Ghost-MSConv performs lightweight multi-receptive-field feature extraction in the backbone, Mixed Local Channel Attention combines local spatial relationships with global channel dependencies during feature refinement, and DySample performs content-adaptive point sampling during feature upsampling. In the primary experiments on a six-class traffic object dataset derived from UA-DETRAC, GAD-YOLO achieved a precision of 78.9%, a recall of 76.4%, an of 82.8%, and an of 65.5%. Compared with YOLOv9c, precision, recall, , and increased by 5.4, 0.5, 3.1, and 4.8 percentage points, respectively. Under the complexity statistics used in the primary experiments, GAD-YOLO contains 25.455 M parameters and requires 102.4 GFLOPs, compared with 25.442 M parameters and 103.2 GFLOPs for YOLOv9c. Additional experiments on the public VisDrone2019-DET benchmark were conducted to evaluate cross-dataset applicability, small-object performance, scene-density sensitivity, and standardized inference efficiency. On the VisDrone2019-DET test-dev set, GAD-YOLO improved and from 26.5% and 15.7% to 27.1% and 16.3%, respectively. A COCO-style analysis further showed that increased from 6.72% to 7.31%, while the dense-subset increased from 13.95% to 14.44%. Under an RTX 4090, batch-size-one, , FP32 inference protocol, GAD-YOLO achieved a mean latency of 9.98 ms and a throughput of 100.20 FPS. These results show that GAD-YOLO improves the primary traffic object detection task and yields modest positive performance differences on an independent public benchmark under the fixed experimental setting, while maintaining real-time inference capability.- 19 August 2026
- Published by MDPI AG in Information
- Vol. 17 (8) , 797
Open AccessGAD-YOLO: A Multi-Level Feature Enhancement Network for Dense Small Traffic Object Detection in Intelligent Transportation Systems
Dense small traffic object detection is essential for intelligent transportation systems but remains challenging because distant targets contain limited visual details, densely distributed objects frequently overlap, and complex road backgrounds introduce substantial interference. To address these limitations, this study proposes GAD-YOLO, a multi-level feature enhancement network based on YOLOv9. Ghost-MSConv performs lightweight multi-receptive-field feature extraction in the backbone, Mixed Local Channel Attention combines local spatial relationships with global channel dependencies during feature refinement, and DySample performs content-adaptive point sampling during feature upsampling. In the primary experiments on a six-class traffic object dataset derived from UA-DETRAC, GAD-YOLO achieved a precision of 78.9%, a recall of 76.4%, an of 82.8%, and an of 65.5%. Compared with YOLOv9c, precision, recall, , and increased by 5.4, 0.5, 3.1, and 4.8 percentage points, respectively. Under the complexity statistics used in the primary experiments, GAD-YOLO contains 25.455 M parameters and requires 102.4 GFLOPs, compared with 25.442 M parameters and 103.2 GFLOPs for YOLOv9c. Additional experiments on the public VisDrone2019-DET benchmark were conducted to evaluate cross-dataset applicability, small-object performance, scene-density sensitivity, and standardized inference efficiency. On the VisDrone2019-DET test-dev set, GAD-YOLO improved and from 26.5% and 15.7% to 27.1% and 16.3%, respectively. A COCO-style analysis further showed that increased from 6.72% to 7.31%, while the dense-subset increased from 13.95% to 14.44%. Under an RTX 4090, batch-size-one, , FP32 inference protocol, GAD-YOLO achieved a mean latency of 9.98 ms and a throughput of 100.20 FPS. These results show that GAD-YOLO improves the primary traffic object detection task and yields modest positive performance differences on an independent public benchmark under the fixed experimental setting, while maintaining real-time inference capability. - Open Access
- 28 July 2026
- Published by MDPI AG in Information
- Vol. 17 (8) , 730
Graph Neural Networks for Software Vulnerability Mining: A Review
Software vulnerability mining is important for improving software reliability and security. Compared with sequence-based models, graph neural networks (GNNs) can explicitly model program structures such as syntax, control flow, data flow, call relations, and dependency paths, and have therefore been widely studied for vulnerability detection, localization, explanation, and repair. This paper presents a PRISMA-informed structured topical review of 87 studies and addresses five research questions concerning program graph representation, homogeneous and heterogeneous GNN architectures, Graph–LLM integration, evaluation reliability, and future research directions. The reviewed evidence shows that graph-based methods are most effective when vulnerability mechanisms can be faithfully represented through explicit structural relations. However, their reported performance remains strongly affected by duplicated samples, random function-level splits, noisy labels, incomplete repository context, graph-construction errors, and weak explanation protocols. Homogeneous GNNs provide efficient structural message passing but may mix different semantic relations, whereas heterogeneous GNNs preserve relation types more explicitly at the cost of greater graph-quality and computational requirements. Graph–LLM systems can improve semantic reasoning, repository-level analysis, explanation generation, and repair support, but their benefits should be evaluated together with memory consumption, inference latency, deployment complexity, and verification cost. This review further proposes minimum requirements for reliable vulnerability benchmarks and verifiable explanations, and develops a strategic agenda covering leakage-resistant datasets, uncertainty-aware graph construction, repository-level evaluation, cost-effective Graph–LLM collaboration, and graph-guided autonomous vulnerability repair.
- 28 July 2026
- Published by MDPI AG in Information
- Vol. 17 (8) , 730
Open AccessGraph Neural Networks for Software Vulnerability Mining: A Review
Software vulnerability mining is important for improving software reliability and security. Compared with sequence-based models, graph neural networks (GNNs) can explicitly model program structures such as syntax, control flow, data flow, call relations, and dependency paths, and have therefore been widely studied for vulnerability detection, localization, explanation, and repair. This paper presents a PRISMA-informed structured topical review of 87 studies and addresses five research questions concerning program graph representation, homogeneous and heterogeneous GNN architectures, Graph–LLM integration, evaluation reliability, and future research directions. The reviewed evidence shows that graph-based methods are most effective when vulnerability mechanisms can be faithfully represented through explicit structural relations. However, their reported performance remains strongly affected by duplicated samples, random function-level splits, noisy labels, incomplete repository context, graph-construction errors, and weak explanation protocols. Homogeneous GNNs provide efficient structural message passing but may mix different semantic relations, whereas heterogeneous GNNs preserve relation types more explicitly at the cost of greater graph-quality and computational requirements. Graph–LLM systems can improve semantic reasoning, repository-level analysis, explanation generation, and repair support, but their benefits should be evaluated together with memory consumption, inference latency, deployment complexity, and verification cost. This review further proposes minimum requirements for reliable vulnerability benchmarks and verifiable explanations, and develops a strategic agenda covering leakage-resistant datasets, uncertainty-aware graph construction, repository-level evaluation, cost-effective Graph–LLM collaboration, and graph-guided autonomous vulnerability repair.