{'fraction_non_alphanumeric': 0.009533898305084746, 'fraction_numerical': 0.0, 'mean_word_length': 6.269230769230769, '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}}
Emergent algorithms-a new method for enhancing survivability in unbounded systems

Traditional security approaches are not sufficient to deal with the protection and survivability of highly distributed information systems operating in unbounded networks. This paper discusses the need for and importance of survivability, defines unbounded network, and examines the characteristics that differentiate survivability from other software quality attributes and nonfunctional properties of systems. It introduces emergent algorithms as an approach to problem solving in unbounded networks and suggests a methodology for their development. Emergent algorithms are philosophically and methodologically different from traditional approaches. The characteristics of emergent algorithms are examined. A strategy for the development of high performance solutions using emergent algorithms is illustrated in outline form for a problem in Internet routing.