{'fraction_non_alphanumeric': 0.017391304347826087, 'fraction_numerical': 0.0, 'mean_word_length': 5.181208053691275, '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}}
On The Performance of Gaussian Mixture Estimation Techniques for Dicrete-Time Jump Markov Linear Systems

In this article we examine the numerical performance of a new state estimation algorithm for discrete-time Gauss-Markov models, whose parameters are determined at each discrete-time instant by the state of a Markov chain. The scheme we consider is fundamentally distinct from extant methods, such as the so-called interacting multiple model algorithm (IMM) in that it is based directly upon the corresponding exact hybrid filter dynamics. Our new scheme maintains a fixed number of candidate paths in a history, each identified by an optimal subset of estimated mode probabilities. The memory requirements of our filter are fixed in time and can varied by the user to achieve a desired accuracy. Computer simulations are given to demonstrate performance of the Gaussian-mixture algorithm described, against the IMM