{'fraction_non_alphanumeric': 0.016293279022403257, 'fraction_numerical': 0.0, 'mean_word_length': 5.3896103896103895, '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}}
A simple recursive algorithm for diagnosis of abrupt changes in random signals

We address the problem of detecting and isolating abrupt changes in random signals. An asymptotic optimal solution to this problem, which has been proposed in previous works, involve the number of computations at time t which grows to infinity with t. We propose another more realistic criterion, establish a new simple recursive change detection/isolation algorithm, and investigate its statistical properties.