The purpose of this research is to determine the optimal resolution necessary to divide a character space to confidently distinguish a (capital) B and an 8. The confidence level is obtained using the Hugin [1,2] software as a tool for creating Bayesian networks that represent the character space at different resolutions.

All spaces below are Tychonov. We define the pro-jective π-character p πχ(X) of a space X as the supremum of the values πχ(Y) where Y ranges over all continuous images of X. Our main result says that every space X has a π-base whose order is ≤ p πχ(X), that is every point in X is contained in at most p πχ(X)-many members of the π-base. Since p πχ(X) ≤ t(X) for compact X, this provides a signifi...

This paper proposes a “structuring search space” (SSS) method aimed to accelerate recognition of large character sets. We divide the feature space of character categories into smaller clusters and derive the centroid of each cluster as a pivot. Given an input pattern, it is compared with all the pivots and only a limited number of clusters whose pivots have higher similarity (or smaller distanc...

The main aim of this paper is to prove that the maximal operator σ∗ of the Fejér means of the two dimensional character system of the p-series field in the Kaczmarz rearrangement is bounded from the Hardy space Hα to the space Lα for α > 1/2, provided that the supremum in the maximal operator is taken over a positive cone. We also prove that the maximal operator σ∗ 0 of Fejér means of the two d...

Expedited publications must not exceed four printed pages in Neurology, including all figures, figure legends, tables, and references. This is equivalent to 24,000 characters (one space is one character as is one letter). Each table and figure within a manuscript decreases the space available for text; an accurate estimate of the character equivalence of tables and figures can be made by lookin...

In the pattern matching with d wildcards problem we are given a text T of length n and a pattern P of length m that contains d wildcard characters, each denoted by a special symbol ′?′. A wildcard character matches any other character. The goal is to establish for each m-length substring of T whether it matches P . In the streaming model variant of the pattern matching with d wildcards problem ...