{'fraction_non_alphanumeric': 0.01079913606911447, 'fraction_numerical': 0.004319654427645789, 'mean_word_length': 5.3561643835616435, '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}}
An Efficient Matching Algorithm using the Number of Primary Outputs for Fault Diagnosis

In this paper, we present an efficient matching algorithm using the number of primary outputs for fault diagnosis. Both positive calculations and negative calculations are used for the proposed matching algorithm. We use the weight according to the number of primary outputs for accurate fault diagnosis. Experimental results are provided for the ISCAS85 benchmark circuits.