Gaolin Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Gaolin Chen has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Shuming Zhou
College of Mathematics and Statistics, Fujian Normal University, Fuzhou, China
6 shared publications - Lanxiang Chen
City University of Macau
2 shared publications Min Li
2 shared publications- Min Li
Fujian Normal University
2 shared publications - Robert Huijie Deng
Singapore Management University, Singapore, Singapore
2 shared publications - Sun-Yuan Hsieh
National Cheng Kung University
2 shared publications
Latest Publications
- 4 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 33 (2) , 849-864
Local Fault Diagnosis Analysis Based on Block Pattern of Regular Diagnosable Networks
Fault diagnosability can reflect the actual self diagnosing capability of a multiprocessor system better. However, people usually focus on the overall information and neglect the important local information. In order to reflect the locality of a system at a node better, this paper proposes a novel fault diagnosis strategy, called $x$ -block local fault diagnosability ( $x$ -BLFD), where the $x$ -block condition requires more than $x$ connected fault-free nodes. Then, we characterize some important properties about the $x$ -BLFD of multiprocessors interconnected networks under the Preparata/Metze/Chien model (P/M/C), and further propose the $x$ -BLFD in an $f(x)$ -extended block network with the minimum $(x+1)$ -subnetwork degree at some node. We also establish an approximate algorithm to calculate the $x$ -BLFD of a large-scale diagnosable network at some node, and analyze the experimental performance of large-scale networks. Furthermore, we apply our proposed conclusion to obtain the $x$ -BLFD of 16 well-known networks at some node directly under P/M/C, including dual cubes, hierarchical cubic networks, DQcubes, twisted hypercubes, Bicube networks, crossed cubes, folded hypercubes, $k$ -ary $n$ -cubes, balanced hypercubes, BC graphs, $(n,k)$ -star graphs, Cayley graphs generated by transposition trees, bubble-sort star graphs, split-star networks, data center networks, and $(n,k)$ -arrangement graphs. Finally, we compare the $x$ -BLFD with the diagnosability, conditional diagnosability, pessimistic diagnosability, and $t/k$ -diagnosability by a large number of detailed numerical analysis. It can be seen that the $x$ -BLFD is greater than all the other types of fault diagnosabilities.
- 4 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 33 (2) , 849-864
Local Fault Diagnosis Analysis Based on Block Pattern of Regular Diagnosable Networks
Fault diagnosability can reflect the actual self diagnosing capability of a multiprocessor system better. However, people usually focus on the overall information and neglect the important local information. In order to reflect the locality of a system at a node better, this paper proposes a novel fault diagnosis strategy, called $x$ -block local fault diagnosability ( $x$ -BLFD), where the $x$ -block condition requires more than $x$ connected fault-free nodes. Then, we characterize some important properties about the $x$ -BLFD of multiprocessors interconnected networks under the Preparata/Metze/Chien model (P/M/C), and further propose the $x$ -BLFD in an $f(x)$ -extended block network with the minimum $(x+1)$ -subnetwork degree at some node. We also establish an approximate algorithm to calculate the $x$ -BLFD of a large-scale diagnosable network at some node, and analyze the experimental performance of large-scale networks. Furthermore, we apply our proposed conclusion to obtain the $x$ -BLFD of 16 well-known networks at some node directly under P/M/C, including dual cubes, hierarchical cubic networks, DQcubes, twisted hypercubes, Bicube networks, crossed cubes, folded hypercubes, $k$ -ary $n$ -cubes, balanced hypercubes, BC graphs, $(n,k)$ -star graphs, Cayley graphs generated by transposition trees, bubble-sort star graphs, split-star networks, data center networks, and $(n,k)$ -arrangement graphs. Finally, we compare the $x$ -BLFD with the diagnosability, conditional diagnosability, pessimistic diagnosability, and $t/k$ -diagnosability by a large number of detailed numerical analysis. It can be seen that the $x$ -BLFD is greater than all the other types of fault diagnosabilities.
- 2 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (2) , 1810-1826
Private Reachability Queries on Structured Encrypted Temporal Bipartite Graphs
A temporal bipartite graph is a graph model that incorporates time-related information into its edges, making it suitable for modeling real-world phenomena like disease outbreaks. However, this temporal information is often sensitive. To protect the privacy of graph data, researchers have explored various approaches to preserve privacy in graph queries, with reachability queries being popular and fundamental as they determine the possibility of reaching one node from others in a graph. While privacy-preserving reachability queries have been extensively studied, existing efforts often overlook the valuable attribute information present in both edges and nodes of the graphs. Moreover, reachability queries on temporal bipartite graphs have not received sufficient attention in the literature. To bridge this gap, we propose a novel approach to achieve various private r eachability q ueries on s tructured encrypted t emporal b ipartite g raphs ( ${\sf RQ}$ - ${\sf STBG}$ ) through a real-world scenario. Specifically, we construct a minimal index using hierarchical 2-hop labels and integrate structured encryption, order-revealing encryption, and garbled Bloom filters to support reachability queries with different label constraints. The proposed scheme is flexible and can cater to the query requirements of diverse users. Security analysis and experimental evaluations demonstrate that the proposed scheme achieves both preferable security and efficiency.
- 2 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 22 (2) , 1810-1826
Private Reachability Queries on Structured Encrypted Temporal Bipartite Graphs
A temporal bipartite graph is a graph model that incorporates time-related information into its edges, making it suitable for modeling real-world phenomena like disease outbreaks. However, this temporal information is often sensitive. To protect the privacy of graph data, researchers have explored various approaches to preserve privacy in graph queries, with reachability queries being popular and fundamental as they determine the possibility of reaching one node from others in a graph. While privacy-preserving reachability queries have been extensively studied, existing efforts often overlook the valuable attribute information present in both edges and nodes of the graphs. Moreover, reachability queries on temporal bipartite graphs have not received sufficient attention in the literature. To bridge this gap, we propose a novel approach to achieve various private r eachability q ueries on s tructured encrypted t emporal b ipartite g raphs ( ${\sf RQ}$ - ${\sf STBG}$ ) through a real-world scenario. Specifically, we construct a minimal index using hierarchical 2-hop labels and integrate structured encryption, order-revealing encryption, and garbled Bloom filters to support reachability queries with different label constraints. The proposed scheme is flexible and can cater to the query requirements of diverse users. Security analysis and experimental evaluations demonstrate that the proposed scheme achieves both preferable security and efficiency.
- 13 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 6351-6363
A Pruned Pendant Vertex Based Index for Shortest Distance Query Under Structured Encrypted Graph
The shortest distance query is used to determine the shortest distance between two vertices. Various graph encryption schemes have been proposed to achieve accurate, efficient and secure shortest distance queries for encrypted graphs. However, the majority of these schemes are inefficient or lack scalability due to the time-consuming index construction and large index storage. Moreover, none of them consider the trade-off between query efficiency and accuracy. To better trade off the query efficiency and accuracy, we propose a Pruned Pendant Vertex based Index for Shortest Distance Query (PPVI-SDQ) under structured encryption. The proposed scheme utilizes the structured encryption technique to encrypt a graph and build indexes. The main idea is to use the recursive method to repeatedly prune the pendant vertex, and thereby reducing the index size and construction time by minimizing the redundant data storage and graph traversal. The proposed scheme achieves accurate, efficient and secure shortest distance query with privacy-preserving for encrypted graph. The security analysis demonstrates that the proposed scheme satisfies CQA2-security. Experimental results with real datasets show that the scheme achieves the optimal accuracy and efficiency.
- 13 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 6351-6363
A Pruned Pendant Vertex Based Index for Shortest Distance Query Under Structured Encrypted Graph
The shortest distance query is used to determine the shortest distance between two vertices. Various graph encryption schemes have been proposed to achieve accurate, efficient and secure shortest distance queries for encrypted graphs. However, the majority of these schemes are inefficient or lack scalability due to the time-consuming index construction and large index storage. Moreover, none of them consider the trade-off between query efficiency and accuracy. To better trade off the query efficiency and accuracy, we propose a Pruned Pendant Vertex based Index for Shortest Distance Query (PPVI-SDQ) under structured encryption. The proposed scheme utilizes the structured encryption technique to encrypt a graph and build indexes. The main idea is to use the recursive method to repeatedly prune the pendant vertex, and thereby reducing the index size and construction time by minimizing the redundant data storage and graph traversal. The proposed scheme achieves accurate, efficient and secure shortest distance query with privacy-preserving for encrypted graph. The security analysis demonstrates that the proposed scheme satisfies CQA2-security. Experimental results with real datasets show that the scheme achieves the optimal accuracy and efficiency.
- 15 February 2023
- Published by Elsevier in Journal of Computational Science
- Vol. 67, 101972
Identifying influential nodes based on resistance distance
- 15 February 2023
- Published by Elsevier in Journal of Computational Science
- Vol. 67, 101972
Identifying influential nodes based on resistance distance
- 11 February 2023
- Published by Springer Nature
- p. 51-63
Link Prediction of Complex Networks Based on Local Path and Closeness Centrality
- 11 February 2023
- Published by Springer Nature
- p. 51-63
Link Prediction of Complex Networks Based on Local Path and Closeness Centrality
- 17 August 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 606
Evaluation of community vulnerability based on communicability and structural dissimilarity
- 17 August 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 606
Evaluation of community vulnerability based on communicability and structural dissimilarity
- Open Access
- 29 June 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-10
The Hermitian Kirchhoff Index and Robustness of Mixed Graph
Large-scale social graph data poses significant challenges for social analytic tools to monitor and analyze social networks. The information-theoretic distance measure, namely, resistance distance, is a vital parameter for ranking influential nodes or community detection. The superiority of resistance distance and Kirchhoff index is that it can reflect the global properties of the graph fairly, and they are widely used in assessment of graph connectivity and robustness. There are various measures of network criticality which have been investigated for underlying networks, while little is known about the corresponding metrics for mixed networks. In this paper, we propose the positive walk algorithm to construct the Hermitian matrix for the mixed graph and then introduce the Hermitian resistance matrix and the Hermitian Kirchhoff index which are based on the eigenvalues and eigenvectors of the Hermitian Laplacian matrix. Meanwhile, we also propose a modified algorithm, the directed traversal algorithm, to select the edges whose removal will maximize the Hermitian Kirchhoff index in the general mixed graph. Finally, we compare the results with the algebraic connectivity to verify the superiority of the proposed strategy.
- 29 June 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-10
Open AccessThe Hermitian Kirchhoff Index and Robustness of Mixed Graph
Large-scale social graph data poses significant challenges for social analytic tools to monitor and analyze social networks. The information-theoretic distance measure, namely, resistance distance, is a vital parameter for ranking influential nodes or community detection. The superiority of resistance distance and Kirchhoff index is that it can reflect the global properties of the graph fairly, and they are widely used in assessment of graph connectivity and robustness. There are various measures of network criticality which have been investigated for underlying networks, while little is known about the corresponding metrics for mixed networks. In this paper, we propose the positive walk algorithm to construct the Hermitian matrix for the mixed graph and then introduce the Hermitian resistance matrix and the Hermitian Kirchhoff index which are based on the eigenvalues and eigenvectors of the Hermitian Laplacian matrix. Meanwhile, we also propose a modified algorithm, the directed traversal algorithm, to select the edges whose removal will maximize the Hermitian Kirchhoff index in the general mixed graph. Finally, we compare the results with the algebraic connectivity to verify the superiority of the proposed strategy.
- 1 December 2020
- Published by Elsevier in Physics Letters A
- Vol. 384 (34)
Influential node detection of social networks based on network invulnerability
- 1 December 2020
- Published by Elsevier in Physics Letters A
- Vol. 384 (34)
Influential node detection of social networks based on network invulnerability
- 18 December 2019
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 63 (9) , 1397-1405
Characterization of Diagnosabilities on the Bounded PMC Model
In this paper, we propose a new digragh model for system level fault diagnosis, which is called the $(f_1,f_{2})$-bounded Preparata–Metze–Chien (PMC) model (shortly, $(f_1,f_{2})$-BPMC). The $(f_1,f_{2})$-BPMC model projects a system such that the number of faulty processors that test faulty processors with the test results $0$ does not exceed $f_{2}$$(f_2\leq f_{1})$ provided that the upper bound on the number of faulty processors is $f_{1}$. This novel testing model compromisingly generalizes PMC model (Preparata, F.P., Metze, G. and Chien R.T. (1967) On the connection assignment problem of diagnosable systems. IEEE Tran. Electron. Comput.,EC-16, 848–854) and Barsi–Grandoni–Maestrini model (Barsi, F., Grandoni, F. and Maestrini, P. (1976) A theory of diagnosability of digital systems. IEEE Trans. Comput.C-25, 585–593). Then we present some characterizations for one-step diagnosibility under the $(f_1,f_{2})$-bounded PMC model, and determine the diagnosabilities of some special regular networks. Meanwhile, we establish the characterizations of $f_1/(n-1)$-diagnosability and three configurations of $f_1/(n-1)$-diagnosable system under the $(f_1,f_{2})$-BPMC model.- 18 December 2019
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 63 (9) , 1397-1405
Characterization of Diagnosabilities on the Bounded PMC Model
In this paper, we propose a new digragh model for system level fault diagnosis, which is called the $(f_1,f_{2})$-bounded Preparata–Metze–Chien (PMC) model (shortly, $(f_1,f_{2})$-BPMC). The $(f_1,f_{2})$-BPMC model projects a system such that the number of faulty processors that test faulty processors with the test results $0$ does not exceed $f_{2}$$(f_2\leq f_{1})$ provided that the upper bound on the number of faulty processors is $f_{1}$. This novel testing model compromisingly generalizes PMC model (Preparata, F.P., Metze, G. and Chien R.T. (1967) On the connection assignment problem of diagnosable systems. IEEE Tran. Electron. Comput.,EC-16, 848–854) and Barsi–Grandoni–Maestrini model (Barsi, F., Grandoni, F. and Maestrini, P. (1976) A theory of diagnosability of digital systems. IEEE Trans. Comput.C-25, 585–593). Then we present some characterizations for one-step diagnosibility under the $(f_1,f_{2})$-bounded PMC model, and determine the diagnosabilities of some special regular networks. Meanwhile, we establish the characterizations of $f_1/(n-1)$-diagnosability and three configurations of $f_1/(n-1)$-diagnosable system under the $(f_1,f_{2})$-BPMC model.