{'fraction_non_alphanumeric': 0.02544769085768143, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, '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}}
TRANSLATION OF STRING-AND-PIN-BASED SHORTEST PATH CONSTRUCTION INTO DATA-SCALABLE AGENT-BASED COMPUTATIONAL MODELS

From the viewpoint of strong spatial cognition in graph problems, the shortest path can be identified in one physical action using strings and pins that respectively represent graph edges and vertices. By pulling a start and an end pin, we can construct a series of stretched strings as the shortest path. We use agent-based models (ABMs) to translate this action into computational representations. Assuming that a set of strings and pins are hung on a wall with a start pin, agents are disseminated downward to a destination as gravity forces. We implemented three models: a discrete-event, an asynchronous, and an aggregated agent dissemination on top of the MASS (multi-agent spatial simulation) library. To address large-scale network environments, we blended HDFS into MASS so that a graph data set is read over a cluster system in parallel. This paper presents these ABM implementations and performance measurements over a cluster system.