{'fraction_non_alphanumeric': 0.016507384882710686, 'fraction_numerical': 0.0026064291920069507, 'mean_word_length': 5.3646408839779, '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 Algorithm for Determining the Controllers of Supervised Entities at the First Level: Brazilian Central Bank Case Study

To find controllers from the stock shares of a financial institution is an important task in the Brazilian Central Bank (BCB). The original problem is typically called Sum of Subset and suggested to be resolved by backtrack algorithm with NP-complete complexity. Currently BCB solves this problem manually which is time consuming and suffered from errors. In this study, an approximation algorithm with polynomial complexity O(n) for determining controllers was developed and implemented in BCB. This algorithm includes subroutines for determining controller at levels 1, 2, 3 and the main loops of combination. This paper describes the basic concepts and business rules currently employed in BCB, complexity analysis of the algorithm and its step by step applications at the first level. The implementation and experiment results indicate the feasibility of automation of controllers finding process. Though developed for BCB, it works equally well for all financial institutions which are controlled by stockholders in Brazil.