{'fraction_non_alphanumeric': 0.021834061135371178, 'fraction_numerical': 0.0034934497816593887, 'mean_word_length': 4.162162162162162, '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}}
Deriving the Upper Bound of the Number of Sensors Required to Know All Link Flows in a Traffic Network

It is demonstrated that the minimum number of sensors required to know all link flows in a traffic network can be determined only if path information is available. However, not all paths need to be enumerated but, at most, a small subset defining the rank rw of the link-path incidence matrix W. If this rank for a reduced subset of paths is already m - n, where m and n are the number of links and noncentroid nodes, respectively, we can conclude that m - n sensors are sufficient. It is also shown that the formulas providing the dependent link flows in terms of the independent link flows can be obtained by the node-based or path-based approaches with the same results only when rw = m - n. Finally, an algorithm to obtain the small subsets of linearly independent path vectors is given. The methods are shown by a parallel network example and the Ciudad Real and Cuenca networks, for which the savings in link counts with respect to the m - n bound are larger than 16%. The corresponding savings in path enumeration are larger than 80%.