Zhuo Diao

dblp:168/4761 · DBLP profile ↗
← Back
23ranked-venue papers
4as first author
15since 2021 · last 2027
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 14 · 1 first-author · 8 since 2021Artificial intelligence and machine learning · 8 · 3 first-author · 6 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2027 Some sharp upper bounds on the eliminating feedback number of regular hypergraphs
Zhongzheng Tang, Haoyang Zou, Zhuo Diao
J. Comput. Syst. Sci.3
2026 A simple approximation algorithm for k-correlation clustering on uniform hypergraphs
Zhongzheng Tang, Zhuo Diao
Theor. Comput. Sci.3
2025 Some Combinatorial Algorithms on the Eliminating Edge Feedback Number of Hypergraphs
Zhongzheng Tang, Haoyang Zou, Zhuo Diao
TAMC3
2025 A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R
Zhongzheng Tang, Haoyang Zou, Zhuo Diao
Acta Informatica3
2025 Computing the expected value of invariants based on resistance distance for random spiro-polynomio chains
Yasir Ahmad, Xiang-Feng Pan, Umar Ali, Zhuo Diao
Discret. Appl. Math.4
2025 Meta-relation-based heterogeneous graph neural network with deep reinforcement learning for flexible job shop scheduling
Shidu Dong, Zhenfang Yuan, Ting Wen, Jianfeng Xiao, Zhuo Diao
Expert Syst. Appl.6
2024 Some Combinatorial Algorithms on the Independent Number of k-Regular Connected Hypergraphs
Zhuo Diao, Haoyang Zou
COCOA (1)1
2024 Approximation Algorithms on k-Correlation Clustering of Uniform Hypergraphs
Zhongzheng Tang, Zhuo Diao
COCOA (1)3
2024 Some Combinatorial Algorithms on the Edge Cover Number of k-Regular Connected Hypergraphs
Zhongzheng Tang, Zhuo Diao
TAMC3
2023 Some Combinatorial Algorithms on the Dominating Number of Anti-rank k Hypergraphs
Zhuo Diao, Zhongzheng Tang
COCOA (2)1
2023 On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree
Zhongzheng Tang, Haoyang Zou, Zhuo Diao
IJTCS-FAW3
2023 LE-YOLOv5: A Lightweight and Efficient Road Damage Detection Algorithm Based on Improved YOLOv5
abstract
Road damage detection is very important for road safety and timely repair. The previous detection methods mainly rely on humans or large machines, which are costly and inefficient. Existing algorithms are computationally expensive and difficult to arrange in edge detection devices. To solve this problem, we propose a lightweight and efficient road damage detection algorithm LE‐YOLOv5 based on YOLOv5. We propose a global shuffle attention module to improve the shortcomings of the SE attention module in MobileNetV3, which in turn builds a better backbone feature extraction network. It greatly reduces the parameters and GFLOPS of the model while increasing the computational speed. To construct a simple and efficient neck network, a lightweight hybrid convolution is introduced into the neck network to replace the standard convolution. Meanwhile, we introduce the lightweight coordinate attention module into the cross‐stage partial network module that was designed using the one‐time aggregation method. Specifically, we propose a parameter‐free attentional feature fusion (PAFF) module, which significantly enhances the model’s ability to capture contextual information at a long distance by guiding and enhancing correlation learning between the channel direction and spatial direction without introducing additional parameters. The K‐means clustering algorithm is used to make the anchor boxes more suitable for the dataset. Finally, we use a label smoothing algorithm to improve the generalization ability of the model. The experimental results show that the LE‐YOLOv5 proposed in this document can stably and effectively detect road damage. Compared to YOLOv5s, LE‐YOLOv5 reduces the parameters by 52.6% and reduces the GFLOPS by 57.0%. However, notably, the mean average precision (mAP) of our model improves by 5.3%. This means that LE‐YOLOv5 is much more lightweight while still providing excellent performance. We set up visualization experiments for multialgorithm comparative detection in a variety of complex road environments. The experimental results show that LE‐YOLOv5 exhibits excellent robustness and reliability in complex road environments.
Zhuo Diao, Xianfu Huang, Zhanwei Liu
Int. J. Intell. Syst.1
2022 On the Transversal Number of k-Uniform Connected Hypergraphs
Bin Chen 0020, Zhongzheng Tang, Zhuo Diao
AAIM4
2022 Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs
Zhongzheng Tang, Zhuo Diao
COCOON2
2021 On the Feedback Number of 3-Uniform Linear Extremal Hypergraphs
Zhongzheng Tang, Yucong Tang, Zhuo Diao
COCOA3
2020 Approximation Algorithms for Balancing Signed Graphs
Zhuo Diao, Zhongzheng Tang
AAIM1
2020 Packing and Covering Triangles in Dense Random Graphs
Zhongzheng Tang, Zhuo Diao
COCOA2
2018 Covering Triangles in Edge-Weighted Graphs
Xujin Chen, Zhuo Diao, Xiao-Dong Hu 0001, Zhongzheng Tang
Theory Comput. Syst.2
2016 Total Dual Integrality of Triangle Covering
Xujin Chen, Zhuo Diao, Xiao-Dong Hu 0001, Zhongzheng Tang
COCOA2
2016 Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing
Xujin Chen, Zhuo Diao
COCOON2
2016 Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles
Xujin Chen, Zhuo Diao, Xiao-Dong Hu 0001, Zhongzheng Tang
IWOCA2
2016 Network Characterizations for Excluding Braess's Paradox
Xujin Chen, Zhuo Diao, Xiao-Dong Hu 0001
Theory Comput. Syst.2
2015 Excluding Braess's Paradox in Nonatomic Selfish Routing
Xujin Chen, Zhuo Diao, Xiao-Dong Hu 0001
SAGT2