{'fraction_non_alphanumeric': 0.014084507042253521, 'fraction_numerical': 0.0, 'mean_word_length': 6.014084507042254, '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}}
The inverse nearest neighbor problem with astrophysical applications

This paper discusses algorithmic improvements to mature astrophysics applications as part of an on-going collaboration with Astrophysicists. We present an efficient algorithm for a variation of the Inverse Nearest Neighbor problem which is a basic computation in an astrophysical N-body simulation. We obtain empirical results demonstrating the improvements, which our algorithm offers to large-scale astrophysical simulations.