{'fraction_non_alphanumeric': 0.017241379310344827, 'fraction_numerical': 0.0, 'mean_word_length': 5.085714285714285, 'pattern_counts': {'":': 0, '<': 1, '<?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}}
On monotone and convex spline interpolation

This paper is concerned with the problem of existence of monotone and/or convex splines, having degree n and order of continuity k, which interpolate to a set of data at the knots. The interpolating splines are obtained by using Bernstein polynomials of suitable continuous piecewise linear functions; they satisfy the inequality k < n k. The theorems presented here are useful in developing algorithms for the construction of shape-preserving splines interpolating arbitrary sets of data points. Earlier results of McAllister, Passow and Roulier can be deduced from those given in this paper.