{'fraction_non_alphanumeric': 0.011589403973509934, 'fraction_numerical': 0.0, 'mean_word_length': 4.931372549019608, '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}}
Polynomial Discrete Time Cellular Neural Networks to solve the XOR problem

Some papers discuss different options to improve the capabilities of cellular neural networks (CNN). The principal point is that a single layer CNN can not solve problems with linearly nonseparable data. In this paper a new model called polynomial discrete time cellular neural networks is presented. This model has a very simple nonlinear term that can improve the performance of the network. The results show how it is possible to solve the XOR problem. The templates of the entire network are computed using genetic algorithm