This paper presents a new application of two dimensional Principal Component Analysis (2DPCA) to the problem of online character recognition in Tamil Script. A novel set of features employing polynomial fits and quartiles in combination with conventional features are derived for each sample point of the Tamil character obtained after smoothing and resampling. These are stacked to form a matrix,...

Single character named entity (SCNE) is a name entity (NE) composed of one Chinese character, such as “ ” (zhong1, China) and “ ” e2,Russia . SCNE is very common in written Chinese text. However, due to the lack of in-depth research, SCNE is a major source of errors in named entity recognition (NER). This paper formulates the SCNE recognition within the sourcechannel model framework. Our experi...

We show that if a knot exterior satisfies certain conditions, then it has finite cyclic coverings with arbitrarily large numbers of nontrivial algebraic components in their SL2(C)-character varieties (Theorem A). As an example, these conditions hold for hyperbolic punctured torus bundles over the circle (Theorem B). We investigate in more detail the finite cyclic covers of the figure-eight knot...

We introduce a recurrent neural network language model (RNN-LM) with long shortterm memory (LSTM) units that utilizes both character-level and word-level inputs. Our model has a gate that adaptively finds the optimal mixture of the character-level and wordlevel inputs. The gate creates the final vector representation of a word by combining two distinct representations of the word. The character...

The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational character tables are also considered into account.The aim of this paper is to compute the rational character tables of the dicyclic group $T_{4n}$, the groups of order $pq$ and $pqr$. Some general properties of rational charact...

This paper is concerned with the values of Harish-Chandra characters of a class of positive-depth, toral, very supercuspidal representations of p-adic symplectic and special orthogonal groups, near the identity element. We declare two representations equivalent if their characters coincide on a specific neighbourhood of the identity (which is larger than the neighbourhood on which the Harish-Ch...

The starting point for any alignment of mammalian genomes is the computation of exact matches satisfying various criteria. Time-efficient, O(n), data structures for this computation, such as the suffix tree, require O(n log(n)) space, several times the space of the genomes themselves. Thus, any reasonable whole-genome comparative project finds itself requiring tens of Gigabytes of RAM to mainta...

Mental representations of space, time, and number are fundamental to our understanding of the world around us. It should come as no surprise that representations of each are functional early in human development, appear to share a common format, and may be maintained by overlapping cortical structures. The consequences of these similarities for early learning and behavior are poorly understood....

In this work, we propose a 3D space handwriting recognition system by combining 2D space handwriting models and 3D space ligature models based on that the most different parts between 2D space handwriting characters and 3D space handwriting characters are the shapes of ligatures. We design the ligature model not dependent on each character but dependent on the incoming and the outgoing vector. ...

MOTIVATION Sequence alignment is the problem of finding the optimal character-by-character correspondence between two sequences. It can be readily solved in O(n2) time and O(n2) space on a serial machine, or in O(n) time with O(n) space per O(n) processing elements on a parallel machine. Hirschberg's divide-and-conquer approach for finding the single best path reduces space use by a factor of n...