{'fraction_non_alphanumeric': 0.013125512715340444, 'fraction_numerical': 0.0, 'mean_word_length': 5.224489795918367, '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}}
Arrival rate approximation by nonnegative cubic splines

We describe an optimization method to approximate the arrival rate of data such as e-mail messages, Web site visits, changes to databases, and changes to Web sites mirrored by other servers. We model these arrival rates as non-homogeneous Poisson process based on observed arrival data. We estimate the arrival function by cubic splines using the maximum likelihood principle. A critical feature of the model is that the splines are constrained to be everywhere nonnegative. We formulate this constraint using a characterization of nonnegative polynomials by positive semidefinite matrices. We also describe versions of our model that allow for periodic arrival rate functions and input data of limited precision. We formulate the estimation problem as a convex program related to semidefinite programming and solve it with a standard nonlinear optimization package called KNITRO. We present numerical results using both an actual record of e-mail arrivals over a period of sixty weeks, and artificially generated data sets. We also present a cross-validation procedure for determining an appropriate number of spline knots to model a set of arrival observations