{'fraction_non_alphanumeric': 0.018612521150592216, 'fraction_numerical': 0.02030456852791878, 'mean_word_length': 5.040816326530612, '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}}
Towards adaptive calculus of granules

An importance of the idea of granularity of knowledge for approximate reasoning has been stressed in Pawlak (1997) and Zadeh (1966, 1997). We address here the problem of synthesis of adaptive decision algorithms and we propose an approach to this problem based on the notion of a granule which we develop in the framework of rough mereology. This framework does encompass both rough and fuzzy set theories. Our approach may be applied in the problems of approximate synthesis of complex objects (solutions) in distributed systems of intelligent agents.