{'fraction_non_alphanumeric': 0.022018348623853212, 'fraction_numerical': 0.0, 'mean_word_length': 4.808510638297872, '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 Constrained Maximization of the Trace of a Matrix

The "trace" of a rectangular matrix is defined as the trace of a square matrix obtained by appending null rows (or columns) at the bottom (or right) end. The problem of maximizing the trace of a matrix, by permutations and mergers of rows and columns with constraints on the resulting size of the matrix, is of interest in comparison of maps and image-change detection. This correspondence presents an algorithm based on dynamic propramming for efficient maximization of trace.