{'fraction_non_alphanumeric': 0.020522388059701493, 'fraction_numerical': 0.007462686567164179, 'mean_word_length': 5.62962962962963, '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}}
Quantitative evaluation of network reliability

The determination of the reliability value for technical systems whose components are subjected to random failure is known as an NP-hard problem. Hence, efforts to conceive efficient solutions on restricted classes of networks have been pursued since the 1960s. In this thesis, substantial contributions are made to improve the current state-of-the-art in exact terminal reliability. Moreover, the proposed model extensions additionally allow for considering dependent component failures.