{'fraction_non_alphanumeric': 0.015463917525773196, 'fraction_numerical': 0.0, 'mean_word_length': 5.934523809523809, '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}}
Application of neural networks to the adaptive routing control and traffic estimation of survivable wireless communication networks

Problems of estimating and optimizing the behavior of wireless networks, based on the structure of a general stochastic model of the network's discrete-event dynamics, lead to mathematically correct, yet computationally intractable, backward recursive conditions defining the stochastic filter of network state and the optimal routing controls. The structure of the stochastic model of network dynamics, reflected in these recursive conditions, strongly parallels the recursive structure found in backpropagation (BP) neural networks. This structural resemblance has suggested the use of variations of the BP approach to compute solutions to the recursive mathematical conditions. Since the structure of the network model is not, in general, feedforward, three variations of recurrent BP algorithms are proposed to solve a partitioned version of the defining filter and optimality conditions. Foreknowledge of the random characteristics of a given network model further suggest which BP technique is appropriate to the application.