{'fraction_non_alphanumeric': 0.011764705882352941, 'fraction_numerical': 0.0, 'mean_word_length': 5.774336283185841, '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}}
An effective evidence theory‐based reliability analysis algorithm for structures with epistemic uncertainty

The purpose of this article is to develop an effective method to evaluate the reliability of structures with epistemic uncertainty so as to improve the applicability of evidence theory in practical engineering problems. The main contribution of this article is to establish an approximate semianalytic algorithm, which replaces the process of solving the extreme value of performance function and greatly improve the efficiency of solving the belief measure and the plausibility measure. First, the performance function is decomposed as a combination of a series of univariate functions. Second, each univariate function is approximated as a unary quadratic function by the second‐order Taylor expansion. Finally, based on the property of the unary quadratic function, the maximum and minimum values of each univariate function are solved, and then the maximum and minimum values of performance function are obtained according to the monotonic relationship between each univariate function and their combination. As long as the first‐ and second‐order partial derivatives of the performance function with respect to each input variable are obtained, the belief measure and plausibility measure of the structure can be estimated effectively without any additional computational cost. Two numerical examples and one engineering application are investigated to demonstrate the accuracy and efficiency of the proposed method.