{'fraction_non_alphanumeric': 0.014534883720930232, 'fraction_numerical': 0.0, 'mean_word_length': 5.625, '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}}
Optimal network localization by particle swarm optimization

The practical and theoretical importance of network localization has determined a great focus from the scientific community. In recent years several schemes have been proposed to solve the localization problem under certain constraints. Here, we apply the particle swarm optimization (PSO) paradigm to the problem of constructing optimally localizable networks. Alternative solutions which yield non-optimal solutions are also discussed. Simulations are carried out to show the convergence properties of the proposed PSO algorithm. We conclude that optimal network localization can be achieved in an efficient way by using PSO.