Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program de nitions. Furthermore, tabling often improves computational performance. Rational term are terms with one or more in nite subterms but with a nite representation. Rational terms can be generated in Prolog by omitting the occurs check when unifying two ...

Document images undergo various degradation processes. Numerous models of these degradation processes have been proposed in the literature. In this paper we propose a model-based restoration algorithm. The restoration algorithm rst estimates the parameters of a degradation model and then uses the estimated parameters to construct a lookup table for restoring the degraded image. The estimated de...

In the high rank limit, fraction of non-zero character table entries finite simple groups Lie type goes to zero.

In this paper we propose a novel Bayesian model for unsupervised bilingual character sequence segmentation of corpora for transliteration. The system is based on a Dirichlet process model trained using Bayesian inference through blocked Gibbs sampling implemented using an efficient forward filtering/backward sampling dynamic programming algorithm. The Bayesian approach is able to overcome the o...

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...

This paper presents a two-level based character recognition method in which a dynamically selection of the most promising zoning scheme for feature extraction allows us to obtain interesting results for character recognition. The first level consists of a conventional neural network and a look-up-table that is used to suggest the best zoning scheme for a given unknown character. The information...

This paper presents a rational Haar wavelet operational method for solving the inverse Laplace transform problem and improves inherent errors from irrational Haar wavelet. The approach is thus straightforward, rather simple and suitable for computer programming. We define that $P$ is the operational matrix for integration of the orthogonal Haar wavelet. Simultaneously, simplify the formulaes of...

In this paper, we present a way of translating Korean words to Chinese using Chinese character information. A mapping table of Korean and Chinese characters is constructed and used to obtain possible combinations as translation candidates. The candidates are ranked by the combination score which accounts for the possibility of the character combination and context similarity score, which indica...

Let X be a character table of the symmetric group Sn. It is shown that unless n = 4 or n = 6, there is a unique way to assign partitions of n to the rows and columns of X so that for all λ and ν, Xλν is equal to χ(ν), the value of the irreducible character of Sn labelled by λ on elements of cycle type ν. Analogous results are proved for alternating groups, and for the Brauer character tables of...