Zhifang Xiao

Zhifang Xiao

Auto-generated profile, based on publicly available information

Zhifang Xiao

Department of Computer Science, Jinggangshan University, Jiangxi Provincial Key Laboratory of Electronic Data Control and Forensics, Jian, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
4 February 2026 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
CGChen Guo
Chen Guo
GZGuoxuan Zhong
Guoxuan Zhong
ZXZhifang Xiao
Zhifang Xiao
DWDajin Wang
Dajin Wang
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.

8 October 2025 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
SQShangguan Quanhao
Shangguan Quanhao
GCGuo Chen
Guo Chen
ZXZhifang Xiao
Zhifang Xiao

15 July 2025 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
CGChen Guo
Chen Guo
QMQiuli Mo
Qiuli Mo
SPShuo Peng
Shuo Peng
ZXZhifang Xiao
Zhifang Xiao