Showing papers on "Character (mathematics) published in 1995"

Naturalizing the Mind

Abstract: The representational character of sense experience introspection qualia consciousness externalism and supervenience.

Real time responsive animation with personality

Abstract: Building on principles from prior work on procedural texture synthesis (K. Perlin, 1985), we are able to create remarkably lifelike, responsively animated characters in real time. Rhythmic and stochastic noise functions are used to define time varying parameters that drive computer generated puppets. Because we are conveying just the "texture" of motion, we are able to avoid computation of dynamics and constraint solvers. The subjective impression of dynamics and other subtle influences on motion can be conveyed with great visual realism by properly tuned expressions containing pseudo random noise functions. For example, we can make a character appear to be dynamically balancing herself, to appear nervous, or to be gesturing in a particular way. Each move has an internal rhythm, and transitions between moves are temporally constrained so that "impossible" transitions are precluded. For example, if while the character is walking we specify a dance turn, the character will always step into the turn onto the correct weight bearing foot. An operator can make a character perform a properly connected sequence of actions, while conveying particular moods and attitudes, merely by pushing buttons at a high level. Potential uses of such high level "textural" approaches to computer graphic simulation include role playing games, simulated conferences, "clip animation", graphical front ends for MUDs, and synthetic performances. >

Hand held computer control device

Abstract: A compact convenient hand-held, accelerometer-based computer control devices utilized to control on-screen animated characters presented by a computer-driven display in which the movement, persona, or style of the character is controlled through movement of the device in a predetermined pattern which results in recognizable patterns of accelerations that are detected to give the on-screen character a particular persona or style determined by the user. Thus, the system requires only a series of easily learned hand movement patterns for corresponding character control. In an alternative embodiment, once a movement has been determined, the style or emotional content of the movement is specified directly from gross accelerometer output without pattern matching. In another embodiment, the outputs of two or more accelerometers are combined, with the combined waveforms constituting a language for graphical object control. In a still further embodiment, one or more patterns are detected serially as a language to direct the appropriate movement or persona for the character or icon presented on-screen. In yet another embodiment, accelerations are normalized to the local gravitational field such that the orientation of the control device is irrelevant. In an additional embodiment, since the location of the on-screen character is known, the character may be given incremental motions from this location by moving the device in the direction of the intended incremental motion, thus to direct the motion of the character in the same direction as the hand movement.

Role of Radical Awareness in the Character and Word Acquisition of Chinese Children. Technical Report No. 615.

Abstract: A total of 292 Chinese children in the first, third, or fifth grade participated in one of two experiments investigating radical awareness; that is, the insight that a component of Chinese characters, called the radical, usually provides information about the character's meaning. The technique used in the experiments was to present two-character words familiar from oral language but which the children had not seen before in print. One of the characters was written in Pinyin, the alphabetic system that Chinese children learn in the first 2 months of first grade. The children's task was to select a character to replace the Pinyin. The first experiment showed that third graders and fifth graders were able to select characters containing the correct radicals even when the characters as a whole were unfamiliar to them, which must mean that they were aware of the relationship between a radical and the meaning of a character. The second experiment showed that children were better able to use radicals to derive the meanings of new characters when the radicals were familiar and the conceptual difficulty of the words was low. Children rated as good readers by their teachers displayed more awareness of radicals than children rated as poor readers. Un total de 292 ninos chinos de primero, tercero o quinto grado participo en uno de dos experimentos que investigaron la conciencia de los radicales; es decir la comprension de que un componente de los caracteres chinos, llamado el radical, generalmente proporciona informacion acerca del significado del caracter. La tecnica utilizada en los experimentos consistio en presentar palabras de dos caracteres, familiares en la lengua oral, pero que los ninos no habian visto escritas. Uno de los caracteres fue escrito en Pinyin, el sistema alfabetico que los ninos chinos aprenden en los primeros dos meses de primer grado. La tarea de los ninos fue seleccionar un caracter para reemplazar el Pinyin. El primer experimento mostro que los ninos de tercero y quinto grado fueron capaces de seleccionar caracteres que contenian los radicales correctos, aun cuando los caracteres como totalidad no les eran familiares, lo que sugiere que eran conscientes de la relacion entre un radical y el significado de un caracter. El segundo experimento mostro que los ninos se desempenaron mejor utilizando los radicales para derivar los significados de caracteres nuevos cuando los radicales eran familiares y la dificultad conceptual de las palabras era baja. Los ninos considerados buenos lectores por los docentes demostraron mas conciencia de los radicales que los ninos considerados malos lectores. Eine gruppe von insgesamt 292 Kindern der ersten, dritten oder funften Schulstufe nahm an einem von zwei Experimenten zur Erforschung des etymologischen Bewustseins teil; darunter ist die Einsicht zu verstehen, das ein Bestandteil eines chinesischen Schriftzeichens, namlich das sinnbildliche Wurzelelement, Radikal genannt, gewohnlicherweise Informationen zur Bedeutung des Wortzeichens enthalt. Die Vorgangsweise, die bei den Experimenten angewendet wurde, war, Worter mit zwei Schriftzeichen zu prasentieren, die den Kindern vom mundlichen Sprachgebrauch her vertraut waren, aber deren Druckbild sie zuvor noch nicht gesehen hatten. Eines der Schriftzeichen war in Pinyin geschrieben, dem alphabetischen System, das Kinder in den ersten zwei Monaten auf der funften Schulstufe lernen. Die Aufgabe der Kinder war es, ein Bildzeichen herauszufinden, das das Pinyinzeichen ersetzt. Das erste Experiment zeigte, das die Kinder der dritten und funften Schulstufe imstande waren, jene Schriftzeichen auszuwahlen, die das richtige Radikal enthielten, auch wenn das Schriftzeichen als Ganzes ihnen unbekannt war, was die Schlusfolgerung nahelegt, das ihnen die Beziehung zwischen einem Radikal und der Bedeutung eines Zeichens bewust ist. Das zweite Experiment zeigte, das die Kinder besser imstande waren, die Bedeutungen von neuen Schriftzeichen abzuleiten, wenn ihnen die Radikale vertraut waren und der Schwierigkeitsgrad in der Sinnerfassung niedrig war. Jene Kinder, die von ihren Lehrern als gute Leser eingestuft wurden, zeigten mehr Bewustsein fur die sinnbildlichen Wurzelelemente als sogenannte schlechte Leser. Un total de 292 enfants de 1°, 3°, et 5° annee ont participe a l'une ou l'autre de deux experiences portant sur la conscience du radical, a savoir l'intuition qu'une composante des caracteres chinois, que l'on appelle le radical, apporte generalement une information sur la signification du caractere. La technique utilisee dans ces experiences a consiste a presenter des mots de deux caracteres, connus a l'oral, mais que les enfants n'avaient jamais vus a l'ecrit. Un des deux caracteres etait ecrit en pinyin, le systeme alphabetique que les enfants chinois apprennent dans les deux premiers mois de la 1° annee. La tâche des enfants consistait a selectionner un caractere substituable au pinyin. La premiere experience a montre que les enfants de 3° et 5° annee etaient en mesure de selectionner des caracteres contenant les radicaux corrects, meme quand les caracteres dans leur ensemble ne leur etaient pas familiers, ce qui signifierait qu'ils etaient conscients de la relation entre un radical et la signification d'un caractere. La seconde experience a montre que les enfants etaient plus en mesure d'utiliser des radicaux pour en deduire les significations des nouveaux caracteres quand les radicaux etaient familiers et que la difficulte conceptuelle des mots etait faible. Les enfants consideres comme de bons lecteurs par leurs maitres ont manifeste une plus grande conscience des radicaux que les enfants consideres comme de mauvais lecteurs.

Character recognition method and apparatus

Abstract: A character recognition apparatus and method for recognizing an unknown character by comparing strokes of the input character with stroke information stored in a dictionary. Each stroke of the input character is classified into one of plural categories according to stroke direction. The classified input strokes are rearranged into groups of strokes having the same classification. The degree of analogy between rearranged input strokes and stroke information stored in the dictionary for each group of similarly classified stroke group is calculated based on stroke length, and a maximum analogous element for each input stroke according to the calculated degree of analogy is detected. The detected maximum analogous elements are summed together, and the character whose sum is maximum is output as the identity of the unknown input character.

Generalized kazakov-migdal-kontsevich model: group theory aspects

Abstract: The Kazakov-Migdal model, if considered as a functional of external fields, can always be represented as an expansion over characters of the GL group The integration over “matter fields” can be interpreted as going over the model (the space of all highest weight representations) of GL In the case of compact unitary groups the integrals should be substituted by discrete sums over the weight lattice The D=0 version of the model is the generalized Kontsevich integral, which in the above-mentioned unitary (discrete) situation coincides with the partition function of 2D Yang-Mills theory with the target space of genus g=0 and m=0, 1, 2 holes This particular quantity is always a bilinear combination of characters and appears to be a Toda lattice τ function (This is a generalization of the classical statement that individual GL characters are always singular KP τ functions) The corresponding element of the universal Grassmannian is very simple and somewhat similar to the one arising in investigations of the c=1 string models However, in certain circumstances the formal sum over representations should be evaluated by the steepest descent method, and this procedure leads to some more-complicated elements of the Grassmannian This “Kontsevich phase,” as opposed to the simple “character phase,” deserves further investigation

The relationship between cartoon trade character recognition and attitude toward product category in young children.

Abstract: The author reviews and tests the effect of cartoon trade characters on product recognition and attitude on a sample of children three to six years of age. High levels of product and trade character...

The evolution of the character and practice of distance education

Abstract: (1995). The evolution of the character and practice of distance education. Open Learning: The Journal of Open, Distance and e-Learning: Vol. 10, No. 2, pp. 47-53.

System and method for correcting a string of characters by skipping to pseudo-syllable borders in a dictionary

Abstract: A retrieving unit retrieves an entry of a dictionary which corresponds to an input character string while comparing input characters, one by one, with entries of TRIE tables stored in a dictionary storing unit. When a character of the input character string does not coincide with any of the entries in the currently-used TRIE table, a skipping unit locates a next effective pseudo-syllable border in the input character string to find candidates of those TRIE tables which correspond to the effective pseudo-syllable border. The retrieving unit retrieves a character string consisting of those characters which follow the pseudo-syllable border thus located, while using the candidates of these TRIE tables, and retrieves an entry in the dictionary which corresponds to the input character string to thereby output it as a recognized word.

Method for correcting handwriting on a pen-based computer

Abstract: A method for correcting textual material recognized on a pen-based computer in accordance with the present invention includes the step of receiving an input on a screen of the computer system. The input is then recognized, and a bounding box defining the bounds of the input is defined. A determination of the intention and placement of the recognized input is then made according to the relationship between the bounding box of the recognized input and the bounding boxes of the already existing textual objects. When a substantial overlap is found of the recognized input with an existing textual object and the number of characters of the recognized input is less than a predetermined number, the recognized input is considered as an overwrite of the existing text. If the conditions are not met, the recognized input is considered as an insertion of a new textual object, i.e., a new word. A best potential character is determined from the recognized input if the overwrite conditions are met, and the most overlapped character of the overlapped textual object is replaced by the best potential character.

Method of producing character templates using unsegmented samples

Abstract: A method for producing, or training, a set of character templates uses as the source of training samples an image source of character images, called glyphs, that are not previously segmented or isolated for training. Also used is a labeled glyph position data structure that includes, for each glyph in the image source, a glyph image position in the image source associating an image location of the glyph with a character label paired with the glyph image position that indicates the character in the character set being trained. The labeled glyph position data is used to identify a collection of glyph sample image regions in the image source for each character in the character set; each glyph sample image region is large enough to contain a glyph and typically contains adjacent glyphs for other characters. The invention mathematically characterizes the template construction problem using unsegmented samples as an optimization problem that optimizes a function that represents the set of character templates being trained as an ideal image to be reconstructed to match the input image. The method produces all of the character templates contemporaneously by using a novel pixel scoring technique that implements an approximation of a maximum likelihood criterion subject to a constraint on the templates produced which holds that foreground pixels in adjacently positioned character images have substantially nonoverlapping foreground pixels. The character templates produced may be binary templates or arrays of pixel color probability values, and may also have substantially disjoint supports, such that adjacently imaged templates have substantially no overlapping foreground pixels.

Calculating the Probability Distributions of Ancestral States Reconstructed by Parsimony on Phylogenetic Trees

Abstract: ?Parsimony methods are often used to map a character's evolution on a phylogenetic tree by reconstructing the ancestral states at interior nodes of the tree. Although the statistical behavior of methods for reconstructing trees has been studied using stochastic models of evolu? tion, there is little comparable work on methods for reconstructing character evolution. If a discrete character were to begin with an ancestral state at the root of a phylogenetic tree and evolve with specified probabilities of change on the branches of the tree, then the terminal taxa would receive one of many possible distributions of character states. These states in terminal taxa are the data used by parsimony methods in reconstructing character evolution on trees. Given a stochastic model of character evolution that specifies probabilities of change on the branches of a known phylogenetic tree, it is possible to calculate the probabilities of various ancestral state reconstruc? tions at each node in the tree. Exact calculations for these probabilities are presented here. They can be used, for example, to calculate the probability that ancestral states would be reconstructed accurately. [Phylogeny; character evolution; ancestral states; parsimony; mapping characters; prob? ability distribution; accuracy] In phylogenetic biology it is common to trace or map a character's evolution on a phylogenetic tree using parsimony meth? ods (Farris, 1970; Fitch, 1971; Sankoff and Rousseau, 1975). Given that reconstruc? tions of ancestral states in a tree are often used in interpreting the processes of char? acter evolution (e.g., Ridley, 1983; SillenTullberg, 1988; Donoghue, 1989; Brooks and McLennan, 1991; Harvey and Pagel, 1991; Maddison and Maddison, 1992; Swofford and Maddison, 1992; Maddison, 1994), it is important to know how accu? rate they are. However, little work has fo? cused on the accuracy and statistical be? havior of methods for reconstructing character evolution (reviewed by Maddi? son, 1994), in contrast to the extensive at? tention paid to the statistical aspects of methods for reconstructing the phyloge? netic trees themselves (e.g., Felsenstein, 1988; Hendy and Penny, 1989; Huelsenbeck and Hillis, 1993; Hillis et al., 1994). Empir? ical studies with known ancestral DNA se? quences (Hillis et al., 1992) or known co? dons of extant species (Goodman, 1981) have indicated reasonable accuracy of par? simony reconstructions of character evo? lution. Theoretical work involving simulations and probability calculations has shown that accuracy is low when rates of evolution are high (Holmquist, 1979; Saitou, 1989; Tateno, 1990; Maddison and Maddison, 1992:288; Collins et al., 1994; Frumhoff and Reeve, 1994), but none of these studies have presented a general and exact method for calculating error proba? bilities for reconstructed ancestral states. In this paper, I present methods to cal? culate various probabilities that are basic to understanding the accuracy and statis? tical behavior pf parsimony reconstruc? tions of character evolution. The probabil? ities concern the possible outcomes of a parsimony reconstruction of ancestral states when the character evolves accord? ing to a stochastic model of change. The basic assumptions are that (1) the phylo? genetic tree is known, (2) the evolution of a discrete (binary or multistate) character is being considered, and (3) a stochastic model of evolutionary change is available for the character. The stochastic model specifies the probabilities of character state change on the branches of the tree. If the character were to begin with a state at the root and evolve along the branches of the tree according to the stochastic model,

A new methodology for gray-scale character segmentation and recognition

Abstract: Generally speaking, through the binarization of gray-scale images, useful information for the segmentation of touching or overlapping characters may be lost. If we analyze gray-scale images, however, specific topographic features and the variation of intensity can be observed in the character boundaries. We believe that such kinds of clues obtained from gray-scale images should be useful for efficient character segmentation. In this paper, we propose a new methodology for character segmentation and recognition which makes the best use of the characteristics of gray-scale images. In the proposed methodology, the character segmentation regions are determined by using projection profiles and topographic features extracted form gray-scale images. Then the nonlinear character segmentation path in each character segmentation region is found by using multistage graph search algorithm. Finally, in order to confirm the character segmentation paths and recognition results, recognition based segmentation method is adopted.

Document analysis—from pixels to contents

Abstract: The authors present a conceptual framework for solving the task of document analysis, which, in essence, consists in the conversion of the document's pixel representation into an equivalent knowledge network representation holding the document's content and layout. Starting on the pixel level, the formation of elementary geometric objects on which layout analysis as well as the definition of character objects is based is described. Character recognition accomplishes the mapping from geometric object to character meaning in ASCII representation. On the next level of abstraction words are formed and verified by contextual processing. Modeled knowledge about complete documents and about how their constituents are related to the application forms the highest level of abstraction. The various problems arising at each stage are discussed. The dependencies between the different levels are exemplified and technical solutions put forward. >

Page segmentation and character recognition system

Abstract: A personal imaging computer system, which is connectable to and operable with a computerized local or wide area network, identifies characters in a document on which the characters are formed. The system scans the document to obtain a gray-scale image of the document, generates a binary image from the gray-scale image by comparing the gray-scale image with the threshold, segments the binary image to locate individual characters within the binary image and to determine the shape of the individual characters, extracts gray-scale image information from the gray-scale image for each such individual character based on the location and shape of the character in the binary image, recognition-processes the extracted gray scale image information to determine the identity of the character, and stores the identity of the character.

Electronic game devices and methods

Abstract: In an electronic device, a plurality of images of each of the parts which constitute a character is contained along with a corresponding plurality of different parameters in a ROM. A parameter indicative of a character created by a controller is calculated from parameters corresponding to the respective images of the parts which constitute the character. The indication of an indicator which sets the progress of a game is controlled in accordance with the calculated character parameter. In more detail, first, the user selects images of the parts stored in the ROM and creates a character used in the game with those selected part images. The controller reads parameters corresponding to the images of the parts of the character and calculates a parameter of the character from those read parameters. A display displays an indicator which controls the progress of the game. The indicator changes at a speed corresponding to the calculated parameter. The indication of the indicator is determined by the operation of the user. Since the progress of the game is controlled in accordance with the indication of the indicator, the user himself is permitted to participate in the progress of the game.

Expressive Intention and Performance

Abstract: This paper discusses how intentions concerning the emotional character of a piece of music affect the performance of the piece. In other words, what does a performer do to generate the intended emotional character of the music? We will first present two theories on music and emotion and then turn to some empirical investigations.

Representation Theory of the W1+∞ Algebra

Abstract: We review the recent development in the representation theory of the $W_{1+\infty}$ algebra. The topics that we concern are, Quasifinite representation, Free field realizations, (Super) Matrix Generalization, Structure of subalgebras such as $W_\infty$ algebra, Determinant formula, Character formula. (Invited talk at ``Quantum Field Theory, Integrable Models and Beyond", YITP, 14-17 February 1994. To appear in Progress of Theoretical Physics Proceedings Supplement.)

Design of a linguistic postprocessor using variable memory length Markov models

Abstract: We describe a linguistic postprocessor for character recognizers. The central module of our system is a trainable variable memory length Markov model (VLMM) that predicts the next character given a variable length window of past characters. The overall system is composed of several finite state automata, including the main VLMM and a proper noun VLMM. The best model reported in the literature (Brown et al., 1992) achieves 1.75 bits per character on the Brown corpus. On that same corpus, our model, trained on 10 times less data, reaches 2.19 bits per character and is 200 times smaller (/spl sime/160,000 parameters). The model was designed for handwriting recognition applications but could also be used for other OCR problems and speech recognition.

On the Fundamental Lemma for Standard Endoscopy: Reduction to Unit Elements

Abstract: The fundamental lemma for standard endoscopy follows from the matching of unit elements in Hecke algebras. A simple form of the stable trace formula, based on the matching of unit elements, shows the fundamental lemma to be equivalent to a collection of character identities. These character identities are established by comparing them to a compact-character expansion of orbital integrals.

Bidirectional code converter

Abstract: A code conversion system that takes direction into consideration when converting characters from a source character encoding to a target character encoding is disclosed. The code conversion system is able to map a single source character or a sequence of characters to either a single target character or a sequence of target characters. By determining or resolving the direction of the characters being converted, the code conversion system can then utilize the determined or resolved direction of the characters to ensure that the correct mapping to the target character encoding is obtained.

Character-based correction arrangement with correction propagation

Abstract: A method of correcting a text in a data processing system is described. The method includes the step of locating a first incorrect character in the text. A character list of alternative characters for the first incorrect character is then shown to the user who replaces the first incorrect character with a correct character from the character list. The change of the first incorrect character is then propagated through a remainder of the text in accordance with a matching score and a language probability score of the remainder of the text with respect to the correct character to correct any subsequent incorrect character in the text.