{'fraction_non_alphanumeric': 0.04655674102812803, 'fraction_numerical': 0.0038797284190106693, 'mean_word_length': 5.0, 'pattern_counts': {'":': 0, '<': 2, '<?xml version=': 0, '>': 4, '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}}
Hypersphere Mapper: a nonlinear programming approach to the hypercube embedding problem

A nonlinear programming approach is introduced for solving the hypercube embedding problem. The basic idea of the proposed approach is to approximate the discrete space of an n-dimensional hypercube, i.e. (z:z in (0,1)/sup n/), with the continuous space of an n-dimensional hypersphere, i.e. (x:x in R/sup n/ and mod mod x mod mod /sup 2/=1). The mapping problem is initially solved in the continuous domain by employing the gradient projection technique to a continuously differentiable objective function. The optimal process 'locations' from the solution of the continuous hypersphere mapping problem are then discretized onto the n-dimensional hypercube. The proposed approach can solve, directly, the problem of mapping P processes onto N nodes for the general case where P>N. In contrast, competing embedding heuristics from the literature can produce only one-to-one mappings and cannot, therefore, be directly applied when P>N.<<ETX>>