Zhulou Cao

Dr. Zhulou Cao

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 February 2017 in Electronics Letters
Verified
Journal Article
Open access
PDF file
BZBowen Zhao
Bowen Zhao
ZCZhulou Cao
Zhulou Cao
SWSicheng Wang
Sicheng Wang
Lung vessel segmentation of computed tomography (CT) images is important in clinical practise and challenging due to difficulties associated with minor size and blurred edges of lung vessels. A vessel segmentation method is proposed for lung images based on a random forest classifier and sparse auto‐encoder features. First, the multi‐scale representations of lung images are obtained using the Gaussian pyramid. Second, a sparse auto‐encoder of three layers is trained using randomly selected patches of these images. Next, the trained weight of the sparse auto‐encoder is used as the convolution kernel to extract features of different scale images. Finally, a random forest classifier is exploited to segment the vessels. The proposed method was evaluated on the original and noise‐added VESSEL12 dataset that is publicly available. Comparison with some classical methods and existing machine learning methods shows that the proposed method reaches the state‐of‐the‐art accuracy. The results also show that a shallow neural network is a powerful feature extraction tool.

2 August 2023 in Symmetry
Verified
Journal Article
Open access
PDF file
JSJiaqi Song
Jiaqi Song
XQXingqin Qi
Xingqin Qi
ZCZhulou Cao
Zhulou Cao
Graph burning was introduced to simulate the spreading of news/information/rumors in social networks. The symmetric undirected graph is considered here. That is, vertex u can spread the information to vertex v, and symmetrically vertex v can also spread information to vertex u. When it is modeled as a graph burning process, a vertex can be set on fire directly or burned by its neighbor. Thus, the task is to find the minimum sequence of vertices chosen as sources of fire to burn the entire graph. This problem has been proved to be NP-hard. In this paper, from a new perspective, we introduce a generalized model called the Independent Cascade Graph Burning model, where a vertex v can be burned by one of its burning neighbors u only if the influence that u gives to v is larger than a given threshold β≥0. We determine the graph burning number with this new Independent Cascade Graph Burning model for several graphs and operation graphs and also discuss its upper and lower bounds.

28 July 2023 in Europhysics Letters
Verified
Journal Article
Closed access
AHAolin Han
Aolin Han
XQXingQin Qi
XingQin Qi
ZCZhulou Cao
Zhulou Cao
Dismantling a network by removing the minimum vertices is a challenging problem in complex networks. While most existing methods focus on efficiency, they overlook the importance of abruptness during the dismantling process. Gradual changes in the largest connected component size can alert the target and render the attack ineffective. To overcome this issue, we propose a new dismantling method based on tree decomposition and a new metric quantifying the abruptness of the dismantling process. Our method involves applying tree decomposition to the network using the min fill-in method, identifying the most critical edge in the decomposed tree, and removing the vertices contained in the edge. Experimental results on eight real networks demonstrate that our proposed method significantly outperforms classical methods in abruptness and efficiency.

6 November 2023 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
JWJianliang Wu
Jianliang Wu
XQXingqin Qi
Xingqin Qi
ZCZhulou Cao
Zhulou Cao

1 June 2025 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
MWMing-Wei Wu
Ming-Wei Wu
XQXing-Qin Qi
Xing-Qin Qi
ZCZhulou Cao
Zhulou Cao
The network dismantling problem focuses on finding and removing the minimum set of vertices to decrease network’s connectivity significantly. Spectral-based methods have attracted considerable attention. However, these methods tend to divide the network into many communities, thereby ignoring the vertices that do not belong to any of these communities. These vertices are typically weak in terms of robustness. This paper proposes a new spectral-based method that divides the network into communities and a set of weak vertices. The proposed method employs the second smallest eigenvector of the Laplacian matrix to detect weak vertices, then removes the identified vertices greedily until the size of the largest connected components of the remaining network reaches the target level. The experimental results of real networks demonstrate that the proposed method performs better than state-of-the-art methods.

1 May 2026 in Europhysics Letters
Verified
Journal Article
Closed access
YWYuhao Wang
Yuhao Wang
XQXingQin Qi
XingQin Qi
ZCZhulou Cao
Zhulou Cao
Developing robust network systems that can sustain functionality after random failures or malicious attacks is a vital problem in complex networks. Many works have focused on improving the robustness of the network. However, these works are based on link manipulation, including swapping links, adding links, and reinforcing links. In this paper, we propose a method that reinforces nodes to improve the robustness of networks. In the proposed method, all nodes vote for their neighbors in each turn, and the voting ability of neighbors of the elected node will decrease in subsequent turns. Experimental results on multiple real-world networks demonstrate that our method significantly outperforms traditional centrality-based protection strategies in enhancing network robustness, achieving an optimal balance between defense effectiveness and resource efficiency.