{'fraction_non_alphanumeric': 0.019891500904159132, 'fraction_numerical': 0.0, 'mean_word_length': 5.62874251497006, '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}}
Graph Model for OVSF Code Placement

The orthogonal variable-spreading-factor (OVSF)-CDMA systems can support multimedia applications with different bandwidth requirements. Code management schemes, including code placement and replacement, significantly impact the code utilization of the system. Many researches have studied these two closely related problems and are solving them independently. For replacement, the optimality concerns the minimization of the reassignment number. There is no definition about the placement optimality yet. We formally define the placement optimality for code placement schemes and presented a novel graph model, constrained independent dominating set problem (CIDP), which is proved to be NP-complete for general graphs. A unified algorithm is provided to firstly address both OVSF code placement and replacement issues at the same time which achieves placement optimality in linear time complexity. This demonstrated that OVSF code placement optimality problem is in P. Another simple and practical unified solution is presented and is shown to be reasonably effective.