{'fraction_non_alphanumeric': 0.01780693533270853, 'fraction_numerical': 0.0018744142455482662, 'mean_word_length': 5.716981132075472, '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}}
Solving Uncertain Power Flow Problem by Affine Arithmetic

Uncertainty management is becoming a very challenging tool in operation scheduling of networks interested by massive distributed generators' penetration. From this point of view, self-validated computing techniques are very useful tools, allowing to intrinsically track data uncertainty effects into power system operation procedures. In this field, the use of Affine Arithmetic has been demonstrated to be one of the most promising research direction, since it prevents the typical error explosion phenomena affecting the standard range arithmetic-based computing frameworks. Starting from these considerations, the aim of this paper is to investigate the Affine Arithmetic-based Power Flow problem, which, by mean of the uncertainty bounds characterization, can provide additional information to the system operators in their decision making processes. The methodology will be tested on the 30-bus IEEE test network and the results will be validated by application of traditional sampling-based techniques.