{'fraction_non_alphanumeric': 0.0196078431372549, 'fraction_numerical': 0.004901960784313725, 'mean_word_length': 5.1893939393939394, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Fault identification algorithms in the presence of intermittent faults

The system diagnosis has been extensively studied in the literature in connection with fault-tolerant multiprocessor computer systems. An original graph-theoretical model for system diagnosis was introduced in a classic paper by Preparata, Metze, and Chien in 1967. Yang and Masson extended the model to the case when the system has some intermittent faults, and gave a characterization of diagnosability under their model. However, their proof is not constructive, that is present no diagnosis algorithm for systems. In this paper, we present two diagnosis algorithms under the model by Yang and Masson: one is a polynomial-time algorithm for system with high connectivity, and the other is a linear time algorithm for system with high degree.