Chen Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chen Guo has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Shengbo Chen
School of Software, Nanchang University, Nanchang, China
3 shared publications - Aoshuai Tan
Henan University
2 shared publications - Chongxiang Yao
School of Mathematics and Computer Sciences, Nanchang University, Nanchang, China
2 shared publications - Jingxiang Lv
Department of Computer Science, Jinggangshan University, China
2 shared publications Ming Leng
Department of Computer Science, Jinggangshan University, 343009, P.R.China
2 shared publications- Pengjie Tang
Department of Computer Science, Jinggangshan University, China
2 shared publications
Latest Publications
- Open Access
- 13 November 2026
- Published by MDPI AG in Behavioral Sciences
- Vol. 16 (11) , 2155
Information-Based Multivariate Decoding Reveals Neural Encoding of Attentional Interference During Visual Selective Attention
Visual attention is one of the fundamental abilities underlying human perception, learning, and goal-directed behavior, enabling individuals to prioritize information relevant to current goals while effectively suppressing irrelevant or competing stimuli. While previous studies have revealed the role of top-down attentional control mechanisms in visual processing, particularly in the anticipatory activation of brain regions during target expectation, the precise influence of this regulation on the neural decoding of targets and distractors remains underexplored. This study combines a classical visual search task with a developed multivariate decoding framework to systematically investigate the effects of distractor interference on the neural decoding of target location under conditions of prior spatial knowledge. Through multivariate decoding analysis, we compared the decoding accuracy of target locations in both T-only (only one unique shape-defined target) and T-with-D (shape-defined target with a distractor sharing the same shape) conditions. We found that distractor interference significantly reduced the precision of target location decoding and diminished the temporal generalization of target representations, indicating that interference disrupted the stability of neural decoding. Furthermore, decoding accuracy in both conditions was positively correlated with the amplitude of the N2pc component, further demonstrating the critical role of spatially selective attention in target location decoding. Although preprocessing was applied to the existing decoding methods in this study, it enhanced both the stability and decoding accuracy without affecting the overall trend of the results. Overall, these findings suggest that information-based multivariate decoding offers important empirical support for understanding the neural mechanisms of internal spatial attention under distraction.
- 13 November 2026
- Published by MDPI AG in Behavioral Sciences
- Vol. 16 (11) , 2155
Open AccessInformation-Based Multivariate Decoding Reveals Neural Encoding of Attentional Interference During Visual Selective Attention
Visual attention is one of the fundamental abilities underlying human perception, learning, and goal-directed behavior, enabling individuals to prioritize information relevant to current goals while effectively suppressing irrelevant or competing stimuli. While previous studies have revealed the role of top-down attentional control mechanisms in visual processing, particularly in the anticipatory activation of brain regions during target expectation, the precise influence of this regulation on the neural decoding of targets and distractors remains underexplored. This study combines a classical visual search task with a developed multivariate decoding framework to systematically investigate the effects of distractor interference on the neural decoding of target location under conditions of prior spatial knowledge. Through multivariate decoding analysis, we compared the decoding accuracy of target locations in both T-only (only one unique shape-defined target) and T-with-D (shape-defined target with a distractor sharing the same shape) conditions. We found that distractor interference significantly reduced the precision of target location decoding and diminished the temporal generalization of target representations, indicating that interference disrupted the stability of neural decoding. Furthermore, decoding accuracy in both conditions was positively correlated with the amplitude of the N2pc component, further demonstrating the critical role of spatially selective attention in target location decoding. Although preprocessing was applied to the existing decoding methods in this study, it enhanced both the stability and decoding accuracy without affecting the overall trend of the results. Overall, these findings suggest that information-based multivariate decoding offers important empirical support for understanding the neural mechanisms of internal spatial attention under distraction.
- 18 September 2026
- Published by Taylor & Francis in Journal of the Chinese Institute of Engineers
- p. 1-13
The non-inclusive g -extra diagnosability of the exchanged hypercube under the PMC and MM* models
1. Advances in computing and integrated-circuit technology have enabled multiprocessor systems to expand to millions of nodes. In multiprocessor systems, the interconnection network provides the un...
- 18 September 2026
- Published by Taylor & Francis in Journal of the Chinese Institute of Engineers
- p. 1-13
The non-inclusive g -extra diagnosability of the exchanged hypercube under the PMC and MM* models
1. Advances in computing and integrated-circuit technology have enabled multiprocessor systems to expand to millions of nodes. In multiprocessor systems, the interconnection network provides the un...
- 22 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. PP, 1
Construction and Post-Failure Reconstruction of Virtual Backbone Based on Regional Risk Difference in Wireless Sensor Networks
In wireless sensor networks (WSNs), virtual backbones (VBs) are widely employed to address issues such as energy constraints and broadcast storms. WSNs are typically modeled as unit disk graphs (UDGs); a VB for data transmission is determined based on the construction of a connected dominating set (CDS) in the graph. Since sensor nodes may fail due to accidental damage or energy depletion, it is necessary to construct a CDS with fault tolerance. In fact, under the influence of complex terrain, significant altitude differences, and environmental perturbations caused by multiple factors, application scenarios frequently have significant differences in failure risk between nodes in different regions. Based on this observation, we optimize the network structure by constructing different CDS types in regions with varying risk factors, introducing the concept of a regional risk difference connected dominating set (RRD-CDS) tailored for heterogeneous hazard levels. In this paper, we enhance network robustness by constructing (k,m)-CDS in high-risk regions, while reducing the number of CDS nodes by building a global (1, 1)-CDS for other regions, thereby designing the RRD-CDS algorithm. When failures cause the RRD-CDS to lose its properties as a CDS, we design a reconstruction algorithm to restore the fault tolerance of RRD-CDS. Simulation results verify the effectiveness of both the RRD-CDS construction algorithm and the RRD-CDS reconstruction algorithm.
- 22 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. PP, 1
Construction and Post-Failure Reconstruction of Virtual Backbone Based on Regional Risk Difference in Wireless Sensor Networks
In wireless sensor networks (WSNs), virtual backbones (VBs) are widely employed to address issues such as energy constraints and broadcast storms. WSNs are typically modeled as unit disk graphs (UDGs); a VB for data transmission is determined based on the construction of a connected dominating set (CDS) in the graph. Since sensor nodes may fail due to accidental damage or energy depletion, it is necessary to construct a CDS with fault tolerance. In fact, under the influence of complex terrain, significant altitude differences, and environmental perturbations caused by multiple factors, application scenarios frequently have significant differences in failure risk between nodes in different regions. Based on this observation, we optimize the network structure by constructing different CDS types in regions with varying risk factors, introducing the concept of a regional risk difference connected dominating set (RRD-CDS) tailored for heterogeneous hazard levels. In this paper, we enhance network robustness by constructing (k,m)-CDS in high-risk regions, while reducing the number of CDS nodes by building a global (1, 1)-CDS for other regions, thereby designing the RRD-CDS algorithm. When failures cause the RRD-CDS to lose its properties as a CDS, we design a reconstruction algorithm to restore the fault tolerance of RRD-CDS. Simulation results verify the effectiveness of both the RRD-CDS construction algorithm and the RRD-CDS reconstruction algorithm.
- Top Cited Papers
- 4 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (5) , 1937-1948
Detecting Faulty Substructures in Networks
The traditional, well-known system-level fault diagnosis is to precisely identify faulty nodes in a network via mutual testing between the nodes, and the diagnosability is the maximum allowed number of faulty nodes for correct diagnosis. This paper proposes a new scheme that focuses on detecting whether a given critical substructure (e.g., a specific cycle or path) contains any faulty node. If the detecting outcome is “Yes”, the entire substructure is deemed as faulty, regardless of how many faulty nodes, and where they are in the substructure. This approach is often more cost-effective and technically feasible than pinpointing every faulty node. We name the maximum allowed number of faulty nodes for this strategy to work as the Detectability of the network, as opposed to the diagnosability. We study the detectability for the hypercube$Q_{n}$ , under the PMC model. We will show that in$Q_{n}$ ($n\geq 7$ ), the detectability is$2n-1$ for the minimal bipartite subgraph$K_{1,1}$ , and$4n-5$ for the 4-node cycle$C_{4}$ . Notably, detectability consistently exceeds traditional diagnosability, tolerating more faulty nodes. We have also designed, validated, and implemented detection algorithms of$O(n\cdot 2^{n-1})$ complexity to detect faulty$K_{1,1}$ and$C_{4}$ in$Q_{n}$ . Simulations show a 100% detection rate, with effectiveness maintained even in lower-dimensional$Q_{n}$ where theoretical assumptions do not fully hold.- 4 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (5) , 1937-1948
Top Cited PapersDetecting Faulty Substructures in Networks
The traditional, well-known system-level fault diagnosis is to precisely identify faulty nodes in a network via mutual testing between the nodes, and the diagnosability is the maximum allowed number of faulty nodes for correct diagnosis. This paper proposes a new scheme that focuses on detecting whether a given critical substructure (e.g., a specific cycle or path) contains any faulty node. If the detecting outcome is “Yes”, the entire substructure is deemed as faulty, regardless of how many faulty nodes, and where they are in the substructure. This approach is often more cost-effective and technically feasible than pinpointing every faulty node. We name the maximum allowed number of faulty nodes for this strategy to work as the Detectability of the network, as opposed to the diagnosability. We study the detectability for the hypercube$Q_{n}$ , under the PMC model. We will show that in$Q_{n}$ ($n\geq 7$ ), the detectability is$2n-1$ for the minimal bipartite subgraph$K_{1,1}$ , and$4n-5$ for the 4-node cycle$C_{4}$ . Notably, detectability consistently exceeds traditional diagnosability, tolerating more faulty nodes. We have also designed, validated, and implemented detection algorithms of$O(n\cdot 2^{n-1})$ complexity to detect faulty$K_{1,1}$ and$C_{4}$ in$Q_{n}$ . Simulations show a 100% detection rate, with effectiveness maintained even in lower-dimensional$Q_{n}$ where theoretical assumptions do not fully hold. - 17 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 74 (4) , 5753-5764
Assessing Embedding Capability of Arrangement Graphs From the Perspectives of Partitioned Edge Faults
The Hamiltonian path serves as a robust tool for unicast or multicast communication in parallel and distributed systems. Embedding this path structure into large-scale systems, especially those with numerous failures, remains a formidable and pressing challenge. The arrangement graph is a topology that not only generalizes many renowned network architectures but is also a promising framework for future computer systems. Extensive research has been conducted on the fault-tolerant embedding of Hamiltonian paths in the arrangement graph or its subclasses, yet these efforts have not attained the desired fault tolerance levels. In this article, we focus on significantly improving the edge fault-tolerant embedding capabilities of arrangement graphs by adopting a novel fault model, termed the partitioned edge fault model. We first prove the existence of Hamiltonian path avoiding large-scale edge faults in arrangement graphs. Then we develop a corresponding Hamiltonian path embedding algorithm with high fault-tolerant capability for arrangement graphs. Both theoretical comparisons and experimental analyses reveal that our methods yield significant enhancements in fault tolerance over existing studies. Furthermore, building upon the generated Hamiltonian path, we devise a dual-path multicast routing strategy and evaluate its latency performance.
- 17 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 74 (4) , 5753-5764
Assessing Embedding Capability of Arrangement Graphs From the Perspectives of Partitioned Edge Faults
The Hamiltonian path serves as a robust tool for unicast or multicast communication in parallel and distributed systems. Embedding this path structure into large-scale systems, especially those with numerous failures, remains a formidable and pressing challenge. The arrangement graph is a topology that not only generalizes many renowned network architectures but is also a promising framework for future computer systems. Extensive research has been conducted on the fault-tolerant embedding of Hamiltonian paths in the arrangement graph or its subclasses, yet these efforts have not attained the desired fault tolerance levels. In this article, we focus on significantly improving the edge fault-tolerant embedding capabilities of arrangement graphs by adopting a novel fault model, termed the partitioned edge fault model. We first prove the existence of Hamiltonian path avoiding large-scale edge faults in arrangement graphs. Then we develop a corresponding Hamiltonian path embedding algorithm with high fault-tolerant capability for arrangement graphs. Both theoretical comparisons and experimental analyses reveal that our methods yield significant enhancements in fault tolerance over existing studies. Furthermore, building upon the generated Hamiltonian path, we devise a dual-path multicast routing strategy and evaluate its latency performance.
- 8 October 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 378, 727-739
The cyclic diagnosability of ( n , k )-star graphs under the PMC and MM* models
- 8 October 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 378, 727-739
The cyclic diagnosability of ( n , k )-star graphs under the PMC and MM* models
- 8 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (6) , 5550-5563
Efficient Optimization Algorithm for Virtual Backbone in Wireless Sensor Networks by Removing Redundant Dominators
Wireless sensor networks (WSNs) often utilize virtual backbones (VBs) to optimize routing and reduce energy consumption. The effectiveness of this optimization largely depends on the size of the VB, with smaller VBs offering better performance. In WSNs, VBs are typically modeled as connected dominating sets (CDSs) within unit disk graphs (UDGs). However, existing approximation algorithms for constructing the minimum connected dominating set (MCDS) often introduce redundant dominators, leading to inflated CDSs. To tackle this issue, in this paper, we propose a general CDS optimization algorithm named OP-CDS, designed specifically to minimize redundancies. Theoretical analysis shows that the size of the optimized CDS is bounded by α∙opt+δ-k+1, where α∙opt+δ represents the upper bound of the unoptimized CDS, and k denotes the number of OP-CDS iterations. Additionally, extensive simulations demonstrate that OP-CDS can effectively optimize the CDS generated by state-of-the-art algorithms with minimal time consumption.
- 8 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (6) , 5550-5563
Efficient Optimization Algorithm for Virtual Backbone in Wireless Sensor Networks by Removing Redundant Dominators
Wireless sensor networks (WSNs) often utilize virtual backbones (VBs) to optimize routing and reduce energy consumption. The effectiveness of this optimization largely depends on the size of the VB, with smaller VBs offering better performance. In WSNs, VBs are typically modeled as connected dominating sets (CDSs) within unit disk graphs (UDGs). However, existing approximation algorithms for constructing the minimum connected dominating set (MCDS) often introduce redundant dominators, leading to inflated CDSs. To tackle this issue, in this paper, we propose a general CDS optimization algorithm named OP-CDS, designed specifically to minimize redundancies. Theoretical analysis shows that the size of the optimized CDS is bounded by α∙opt+δ-k+1, where α∙opt+δ represents the upper bound of the unoptimized CDS, and k denotes the number of OP-CDS iterations. Additionally, extensive simulations demonstrate that OP-CDS can effectively optimize the CDS generated by state-of-the-art algorithms with minimal time consumption.
- 20 February 2025
- Published by Springer Nature
- p. 40-52
The Hybrid Diagnosability of Hypercube Under the $\textrm{HMM}^{*}$ (Hybrid $\textrm{MM}^{*}$) Model- 20 February 2025
- Published by Springer Nature
- p. 40-52
The Hybrid Diagnosability of Hypercube Under the $\textrm{HMM}^{*}$ (Hybrid $\textrm{MM}^{*}$) Model- Open Access
- 26 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 329-334
Audio Scene Classification Under Convolutional Neural Network
Audio scene classification is a way of supporting security monitoring applications such as audio surveillance, anomaly detection, and risk management by recognizing and categorizing environmental labels in audio data. With the significant increase in the volume of audio data generated by audio-video surveillance systems, the limitations of traditional classification methods are becoming increasingly apparent. In contrast, deep learning techniques, leveraging their advantages in data feature processing and pattern recognition, have become key technologies for solving such problems. Building upon this, this paper focuses on optimizing the audio scene classification system using a Convolutional Neural Network model and delving deeper into existing dataset information without increasing additional data volume. Additionally, the network structure is adjusted without increasing the computational burden. This model approach effectively improves the recognition accuracy in specific scenarios, as evidenced by comparison analysis with a human baseline system.
- 26 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 329-334
Open AccessAudio Scene Classification Under Convolutional Neural Network
Audio scene classification is a way of supporting security monitoring applications such as audio surveillance, anomaly detection, and risk management by recognizing and categorizing environmental labels in audio data. With the significant increase in the volume of audio data generated by audio-video surveillance systems, the limitations of traditional classification methods are becoming increasingly apparent. In contrast, deep learning techniques, leveraging their advantages in data feature processing and pattern recognition, have become key technologies for solving such problems. Building upon this, this paper focuses on optimizing the audio scene classification system using a Convolutional Neural Network model and delving deeper into existing dataset information without increasing additional data volume. Additionally, the network structure is adjusted without increasing the computational burden. This model approach effectively improves the recognition accuracy in specific scenarios, as evidenced by comparison analysis with a human baseline system.
- Open Access
- 26 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 335-341
Multi-source Fusion in Audio Scene Classification with Refined Transformers
With the rapid advancement of smart devices and Internet of Things (IoT) technologies, audio scene classification has become increasingly critical across various application domains. Deep learning models, particularly Convolutional Neural Networks (CNNs) and Transformer architectures, have garnered widespread attention for their exceptional performance in end-to-end audio classification tasks. Despite this, research on integrating multi-source information for more precise audio scene classification remains relatively scarce. In this paper, we introduce an audio classification model based on a Refined Transformer architecture, which effectively integrates environmental information from diverse sources, thereby improving the accuracy of recognition in complex audio environments. The model also achieves efficient processing of audio signals while maintaining low computational complexity. Experimental results on multiple public audio datasets demonstrate the model's effectiveness, with particularly enhanced robustness in noisy environments, showcasing its superior performance in audio scene classification tasks.
- 26 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 335-341
Open AccessMulti-source Fusion in Audio Scene Classification with Refined Transformers
With the rapid advancement of smart devices and Internet of Things (IoT) technologies, audio scene classification has become increasingly critical across various application domains. Deep learning models, particularly Convolutional Neural Networks (CNNs) and Transformer architectures, have garnered widespread attention for their exceptional performance in end-to-end audio classification tasks. Despite this, research on integrating multi-source information for more precise audio scene classification remains relatively scarce. In this paper, we introduce an audio classification model based on a Refined Transformer architecture, which effectively integrates environmental information from diverse sources, thereby improving the accuracy of recognition in complex audio environments. The model also achieves efficient processing of audio signals while maintaining low computational complexity. Experimental results on multiple public audio datasets demonstrate the model's effectiveness, with particularly enhanced robustness in noisy environments, showcasing its superior performance in audio scene classification tasks.