{'fraction_non_alphanumeric': 0.019845644983461964, 'fraction_numerical': 0.0, 'mean_word_length': 5.725925925925926, '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}}
Integer programming based approach for multiple-targets trajectory identification in WSNs

Trajectory identification with multiple users and binary proximity sensors is an important problem in design and applications of smart environment. The Current approach may quickly run into numerical difficulty when the number of users increases, besides other issues such as identifiability problem when the trajectories may cross over. An integer programming based trajectory identification approach is proposed. We show that when a state-of-the-art integer programming solver is utilized, the problem with decent sizes (measured by numbers of users and sensors) can be solved efficiently. In addition, the framework is flexible to incorporate conditions that may be encountered in practical applications: such as false data, overlapping detection regions, missing values, and existence of undetected time periods.