{'fraction_non_alphanumeric': 0.011254019292604502, 'fraction_numerical': 0.0, 'mean_word_length': 5.627659574468085, '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}}
Metaheuristic vs Adaptive Approach in Discrete-Time Hammerstein Systems Identification

This paper aims to describe two identification methods for Hammerstein systems. Both methods are design to approximate the nonlinear component by using families of simpler functions. The first algorithm combines linear least squares with PSO to approximate both linear and nonlinear component parameters, whilst the latter redesigns the unknown coefficients approximation problem into a nonlinear least squares one and uses a modified version of Gauss-Newton algorithm to solve it. A comparison between the two methods is carried out.