Yu Zhang

Yu Zhang

Auto-generated profile, based on publicly available information

Yu Zhang

School of Computer Science, Peking University, Beijing, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 December 2021
Verified
Conference Paper
Closed access
MYMengmeng Yin
Mengmeng Yin
LWLei Wang
Lei Wang
CYChangHua Yao
ChangHua Yao
XWXinrong Wu
Xinrong Wu
YSYulong Song
Yulong Song
YZYu Zhang
Yu Zhang
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.

13 November 2025 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
Enqiang ZhuEnqiang Zhu
Enqiang Zhu
YZYu Zhang
Yu Zhang
HSHaopeng Sun
Haopeng Sun
ZWZiqi Wei
Ziqi Wei
WPWitold Pedrycz
Witold Pedrycz
JXJin Xu
Jin Xu
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.

12 October 2021
Verified
Book Chapter
Closed access
PDF file
MLMin Luo
Min Luo
LJLiudan Jiao
Liudan Jiao
YZYinghan Zhu
Yinghan Zhu
YZYu Zhang
Yu Zhang
XSXiangnan Song
Xiangnan Song

13 October 2023
Verified
Conference Paper
Open access
Enqiang ZhuEnqiang Zhu
Enqiang Zhu
YZYu Zhang
Yu Zhang
GJGuanhua Jiang
Guanhua Jiang
JWJing Wang
Jing Wang
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.

19 July 2026
Verified
Conference Paper
Open access
YZYu Zhang
Yu Zhang
YLYilong Luo
Yilong Luo
MMMingyuan Ma
Mingyuan Ma
YCYao Chen
Yao Chen
Enqiang ZhuEnqiang Zhu
Enqiang Zhu
Chanjuan LiuChanjuan Liu
Chanjuan Liu

24 November 2023
Verified
Conference Paper
Closed access
PDF file
杨张杨 张
杨 张
YZYu Zhang
Yu Zhang
JLJinlong Li
Jinlong Li
TTTao Tang
Tao Tang
YZYang Zhang
Yang Zhang
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.