{'fraction_non_alphanumeric': 0.011969532100108813, 'fraction_numerical': 0.0, 'mean_word_length': 5.814814814814815, '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}}
Decontamination strategies optimized for speed of reducing dangerous levels

We consider several scenarios of placement of endangered personnel or equipment in a contaminated zone where the contamination density is known and the contamination spatial effect decreases with the distance. A typical example is radiation contamination, where the radiation effect attenuates with the square of distance (geometric attenuation) and exponentially with distance due to air absorption. We assume that the decontamination means are characterized by the decontaminated area and linear speed. When the contamination density is known, algorithms for various scenarios can be determined for minimizing the total dose received by the rescued personnel. We exemplify the conditions for establishing the algorithm for optimal decontamination for several situations and show that, in general, evacuation paths should not be along lines.