{'fraction_non_alphanumeric': 0.011164274322169059, 'fraction_numerical': 0.0, 'mean_word_length': 5.1568627450980395, '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}}
A Scheme to Construct Genetic Feasible Group for the Plane Arrays Optimization

For the problem of optimum design of the sparse circular aperture arrays with multiple constraints, an new approach to build the initial feasible solution which meet multiple design constraints are presented in this paper. This approach can meet the multiple design constrains of the engineering design. The initial group formed by this method is always feasible group for the genetic algorithms. It has provided the necessity and the feasibility for the application of GA, at last, the correctness and effectiveness of the algorithm are verified.