{'fraction_non_alphanumeric': 0.010568031704095112, 'fraction_numerical': 0.0, 'mean_word_length': 5.264462809917355, '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}}
Reliability Growth Apportionment

A method is presented for apportioning reliability growth to the subsystems that make up a system in order to achieve the required reliability at least cost. Reliability growth apportionment is handled as an s-expected cost minimization problem subject to the constraint of meeting a system reliability requirement. The problem is formulated in terms of Duane's reliability growth model, and is solved using geometric programming. The method can be useful in the early stages of system design to determine subsystem reliability growth that will allow a system reliability requirement to be met, and in the latter stages of system design when reliability has fallen short of the required goal and improvements are necessary.