{'fraction_non_alphanumeric': 0.01129032258064516, 'fraction_numerical': 0.0, 'mean_word_length': 5.029126213592233, '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}}
Geometric computation of value set boundaries

In this paper a general algorithm to find the boundaries of value sets bounded by elliptic arcs is developed. This algorithm uses a generalized line-sweep search procedure to extract the value set boundary from a set of generalized polygons describing the image of the bounding set or the extremal segments of the plant. The advantage of this approach is that, when the uncertainty is affine, it preserves the geometric parametrizations of value set boundaries. The effectiveness of this procedure is illustrated in the computation of value sets of affine uncertain plants.