Yu Zhang
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
Yu Zhang has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Enqiang Zhu
Institute of Computing Technology, Guangzhou University, Guangzhou, China
3 shared publications - Chanjuan Liu
Dalian University of Technology, Dalian, China
2 shared publications - Changhua Yao
School Electronic and Information Engineering, Nanjing University of Information Science and Technology, Nanjing, China
1 shared publication - Guanhua Jiang
Institution of Computing Science and Technology, Guangzhou University, Guangzhou, China, China
1 shared publication Haopeng Sun
Institute of Computing Science and Technology, Guangzhou University, Guangzhou, China
1 shared publication- Jia-Rui Wu
Key Laboratory of Automobile Materials MOE Department of Materials Science School of Materials Science and Engineering Jilin University Changchun China
1 shared publication
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2354-2363
Cohesive Group Discovery in Interaction Graphs under Explicit Density Constraints
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2354-2363
Open AccessCohesive Group Discovery in Interaction Graphs under Explicit Density Constraints
- 13 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (1) , 681-695
HyColor: An Efficient Heuristic Algorithm for Graph Coloring
The graph coloring problem (GCP) is a classic combinatorial optimization problem that aims to find the minimum number of colors assigned to the vertices of a graph such that no two adjacent vertices receive the same color. GCP has been extensively studied by researchers from various fields, including mathematics, computer science, and biological science. Due to the $\mathcal {NP}$ -hard nature, many heuristic algorithms have been proposed to solve GCP. However, existing GCP algorithms focus on either small hard graphs or large-scale sparse graphs (with up to $10^{7}$ vertices). This article presents an efficient hybrid heuristic algorithm for GCP, named HyColor, which excels in handling large-scale sparse graphs while achieving impressive results on small dense graphs. The efficiency of HyColor comes from the following three aspects: 1) a local decision strategy to improve the lower bound on the chromatic number; 2) a graph-reduction strategy to reduce the working graph; and 3) a $k$ -core and mixed degree-based greedy heuristic for efficiently coloring graphs. HyColor is evaluated against three state-of-the-art GCP algorithms across four benchmarks, comprising three large-scale sparse graph benchmarks and one small dense graph benchmark, totaling 209 instances. The results demonstrate that HyColor consistently outperforms existing heuristic algorithms in both solution accuracy and computational efficiency for the majority of instances. Notably, HyColor achieved the best solutions in 194 instances (over 93%), with 34 of these solutions significantly surpassing those of other algorithms. Furthermore, HyColor successfully determined the chromatic number and achieved optimal coloring in 128 instances.
- 13 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (1) , 681-695
HyColor: An Efficient Heuristic Algorithm for Graph Coloring
The graph coloring problem (GCP) is a classic combinatorial optimization problem that aims to find the minimum number of colors assigned to the vertices of a graph such that no two adjacent vertices receive the same color. GCP has been extensively studied by researchers from various fields, including mathematics, computer science, and biological science. Due to the $\mathcal {NP}$ -hard nature, many heuristic algorithms have been proposed to solve GCP. However, existing GCP algorithms focus on either small hard graphs or large-scale sparse graphs (with up to $10^{7}$ vertices). This article presents an efficient hybrid heuristic algorithm for GCP, named HyColor, which excels in handling large-scale sparse graphs while achieving impressive results on small dense graphs. The efficiency of HyColor comes from the following three aspects: 1) a local decision strategy to improve the lower bound on the chromatic number; 2) a graph-reduction strategy to reduce the working graph; and 3) a $k$ -core and mixed degree-based greedy heuristic for efficiently coloring graphs. HyColor is evaluated against three state-of-the-art GCP algorithms across four benchmarks, comprising three large-scale sparse graph benchmarks and one small dense graph benchmark, totaling 209 instances. The results demonstrate that HyColor consistently outperforms existing heuristic algorithms in both solution accuracy and computational efficiency for the majority of instances. Notably, HyColor achieved the best solutions in 194 instances (over 93%), with 34 of these solutions significantly surpassing those of other algorithms. Furthermore, HyColor successfully determined the chromatic number and achieved optimal coloring in 128 instances.
- 24 November 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12935, 84-488
High precision 3D measurement with few images based on deep learning
Fringe projection profiling (FPP) is a technique to obtain the three-dimensional shape of an object by projecting periodic fringes onto its surface and analyzing the modulated fringes.The goal of this technique is to quickly and accurately obtain the three-dimensional shape of an object with as few fringe patterns as possible. This paper combines the fringe analysis steps of fringe projection profiling and deep learning, the proposed DARUNet network (Dense and Residual U-Net) introduces Dense Block and Residual Block on the basis of U-Net. Only three modulated fringe patterns with different frequencies need to be captured as the input of the DARUNet network, the network outputs the numerator and denominator of the wrapped phase corresponding to each frequency. After some post-processing, the three-dimensional shape of the object can be obtained. Deep learning relies on high-quality datasets, so this paper compares two methods for temporal phase unwrapping: Multi-frequency (hierarchical) and Multi-wavelength (heterodyne).The Multi-frequency method, which demonstrated superior performance, was chosen to create a high-precision 3D measurement dataset. Experiments show that the proposed network has higher precision in predicting the wrapped phase than U-Net and its series networks, and predicting the numerator and denominator of wrapped phase by fringes is also the optimal route for 3D reconstruction technology based on deep learning, this method achieves a high level of precision with a phase error of less than 0.1 radians and a depth error of less than 0.3 mm. Therefore, the method employed in this paper enables high-precision 3D measurements using only three frames of fringe patterns.
- 24 November 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12935, 84-488
High precision 3D measurement with few images based on deep learning
Fringe projection profiling (FPP) is a technique to obtain the three-dimensional shape of an object by projecting periodic fringes onto its surface and analyzing the modulated fringes.The goal of this technique is to quickly and accurately obtain the three-dimensional shape of an object with as few fringe patterns as possible. This paper combines the fringe analysis steps of fringe projection profiling and deep learning, the proposed DARUNet network (Dense and Residual U-Net) introduces Dense Block and Residual Block on the basis of U-Net. Only three modulated fringe patterns with different frequencies need to be captured as the input of the DARUNet network, the network outputs the numerator and denominator of the wrapped phase corresponding to each frequency. After some post-processing, the three-dimensional shape of the object can be obtained. Deep learning relies on high-quality datasets, so this paper compares two methods for temporal phase unwrapping: Multi-frequency (hierarchical) and Multi-wavelength (heterodyne).The Multi-frequency method, which demonstrated superior performance, was chosen to create a high-precision 3D measurement dataset. Experiments show that the proposed network has higher precision in predicting the wrapped phase than U-Net and its series networks, and predicting the numerator and denominator of wrapped phase by fringes is also the optimal route for 3D reconstruction technology based on deep learning, this method achieves a high level of precision with a phase error of less than 0.1 radians and a depth error of less than 0.3 mm. Therefore, the method employed in this paper enables high-precision 3D measurements using only three frames of fringe patterns.
- Open Access
- 13 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 95-101
An Anonymous Authentication and Key Agreement Scheme for Multi-Server Environments
With the rapid development of information technology, wireless network communication has become the primary means for people to interact and share network resources, profoundly impacting various aspects of social life. Simultaneously, an increasing number of devices are connected to the Internet, providing convenient personalized services for specific use cases. However, in network communication, information is both public and requires the protection of personal privacy. In network communication, fast anonymous authentication schemes are important to ensure user privacy and security. This paper presents an anonymous authentication and key agreement (AKA) scheme for multi-server environments that utilizes the properties of Chebyshev chaotic map semigroups to authenticate user identity information, eliminating the need for extensive server-side storage of authentication-related data. Moreover, an analysis of the security, correctness, and performance of the scheme is conducted. The outcomes indicate that the proposed scheme not only offers anonymous mutual authentication and heightened security but also reduces computational, storage, and communication overheads.
- 13 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 95-101
Open AccessAn Anonymous Authentication and Key Agreement Scheme for Multi-Server Environments
With the rapid development of information technology, wireless network communication has become the primary means for people to interact and share network resources, profoundly impacting various aspects of social life. Simultaneously, an increasing number of devices are connected to the Internet, providing convenient personalized services for specific use cases. However, in network communication, information is both public and requires the protection of personal privacy. In network communication, fast anonymous authentication schemes are important to ensure user privacy and security. This paper presents an anonymous authentication and key agreement (AKA) scheme for multi-server environments that utilizes the properties of Chebyshev chaotic map semigroups to authenticate user identity information, eliminating the need for extensive server-side storage of authentication-related data. Moreover, an analysis of the security, correctness, and performance of the scheme is conducted. The outcomes indicate that the proposed scheme not only offers anonymous mutual authentication and heightened security but also reduces computational, storage, and communication overheads.
- Open Access
- 18 May 2023
- Published by EDP Sciences in SHS Web of Conferences
- Vol. 168, 02020
Ecological Discourse Analysis for Attitude Resources in President Xi Jinping’s Discourses
Nowadays, ecological problems arouses the universal concern of people all over the world. President Xi Jinping’s discourses can fully reflect the ecological value orientation of China’s policy. Based on the EDA paradigm and following the ecosophy view of “diversity and harmony, interaction and symbiosis”, this paper conducts an in-depth study on the attitude resources in President Xi Jinping’s discourses, and probes into the ecological idea and ecological value orientation embodied by the attitude resources. The findings are as follows: (1) In President Xi Jinping’s discourses, the judgment resources are the most, the appreciation resources the second, the affect resources the least; (2) The attitude resources of President Xi Jinping’s discourses show beneficial and ambivalent ecological value orientation, but no destructive one; (3) The attitude resources in President Xi Jinping’s discourses reflect the ecological idea of “ecological priority and harmonious coexistence”.
- 18 May 2023
- Published by EDP Sciences in SHS Web of Conferences
- Vol. 168, 02020
Open AccessEcological Discourse Analysis for Attitude Resources in President Xi Jinping’s Discourses
Nowadays, ecological problems arouses the universal concern of people all over the world. President Xi Jinping’s discourses can fully reflect the ecological value orientation of China’s policy. Based on the EDA paradigm and following the ecosophy view of “diversity and harmony, interaction and symbiosis”, this paper conducts an in-depth study on the attitude resources in President Xi Jinping’s discourses, and probes into the ecological idea and ecological value orientation embodied by the attitude resources. The findings are as follows: (1) In President Xi Jinping’s discourses, the judgment resources are the most, the appreciation resources the second, the affect resources the least; (2) The attitude resources of President Xi Jinping’s discourses show beneficial and ambivalent ecological value orientation, but no destructive one; (3) The attitude resources in President Xi Jinping’s discourses reflect the ecological idea of “ecological priority and harmonious coexistence”.
- 10 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2021-2027
Research on an Cascade Failure Model of Improved Scale-Free Network
In order to resist the cascading failure phenomenon that often occurs in real networks and to enhance the reliability of the network, combined with the improved scale-free network, a cascading failure model with adjustable parameters is constructed. In this model, combining node degree information and node betweenness information and introducing the proportional parameters of the two, are α and β respectively, redefine the initial load and set the different proportional relationship between node load and node capacity. In view of the load spread of failed nodes, the maximum load capacity allocation mechanism is quickly developed and then through the analysis of the network cascade failure, the evolution process of the load parameters is deduced, and the influence of the parameters in the model on the robustness of the network is obtained. Finally, experiments verify the effectiveness of the proposed method.
- 10 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2021-2027
Research on an Cascade Failure Model of Improved Scale-Free Network
In order to resist the cascading failure phenomenon that often occurs in real networks and to enhance the reliability of the network, combined with the improved scale-free network, a cascading failure model with adjustable parameters is constructed. In this model, combining node degree information and node betweenness information and introducing the proportional parameters of the two, are α and β respectively, redefine the initial load and set the different proportional relationship between node load and node capacity. In view of the load spread of failed nodes, the maximum load capacity allocation mechanism is quickly developed and then through the analysis of the network cascade failure, the evolution process of the load parameters is deduced, and the influence of the parameters in the model on the robustness of the network is obtained. Finally, experiments verify the effectiveness of the proposed method.
- 12 October 2021
- Published by Springer Nature
- p. 817-832
Research on the Node Importance of Urban Rail Transit Network from the Perspective of Complex Network Theory
- 12 October 2021
- Published by Springer Nature
- p. 817-832
Research on the Node Importance of Urban Rail Transit Network from the Perspective of Complex Network Theory