{'fraction_non_alphanumeric': 0.016853932584269662, 'fraction_numerical': 0.0, 'mean_word_length': 4.94, '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}}
Candidate Ordering and Elimination in Model-Based Fault Diagnosis

A major step in model-based fault diagnosis is the generation of candidate submodules which might be responsible for the observed symptom of malfunction. After the candidates are determined, each subrnodule can then be examined in turn. It is useful to be able to choose the most likely candidate to focus on first so that the faulty parts can be located sooner. We propose here a systematic method for initial candidate ordering that takes into account the structure of the device and the discrepancy in outputs between the observed and expected values. We also give effective methods for a system to adjust its focus according to new information acquired during diagnosis. Under the single fault assumption, the average length of diagnosis (number of submodules evaluated) is O(logm), where m is the number of submodules.