{'fraction_non_alphanumeric': 0.010416666666666666, 'fraction_numerical': 0.0, 'mean_word_length': 5.204301075268817, '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}}
On the convexity of Chernoff bound in the context of consumption admission control in smart grids

In this paper we prove the convexity of the Chernoff bound in the context of estimating the overconsumption in a bottom-up consumption modelling framework in smart grid. We also introduce three application areas for the Chernoff bound in the context of power systems, more specifically the reliability assessment, consumption admission control and capacity sizing. The proof of convexity shows the method to be a computationally feasible tool for these three application areas.