Showing papers on "Character (mathematics) published in 1999"
TL;DR: My approach to reconstructing ancestral states makes use of a Markov model of binary character evolution on phylogenies, which is a related model for investigating rates of gains and losses of characters for which the ancestral states are assumed to be known.
Abstract: A phylogeny describes the hierarchical pattern of descent of some group of species from a common ancestor. If information is available on the character states of the contemporary species, thepossibility is raised of using that information in combination with the phylogeny to reconstruct the historical events of evolution. These reconstructions can be used to retrieve a picture of theworld as the species evolved alongwhatwould become the branches of the phylogeny. This, in turn, provides a way to test hypotheses about evolution and adaptation. Methods based on the principle of parsimony reconstruct the ancestral character states to minimize the number of historical character changes required to produce the diversity observed among the contemporary species (seeMaddison et al., 1984, for a general account). An alternative to parsimony approaches makes use of the principle of maximum likelihood. Maximum likelihood solutions make the observed data most likely given somemodel of the process under investigation (see Edwards, 1972). In a phylogenetic context this means reconstructing the ancestral character states to make the character states observed among the contemporary species most probable, given some statistical model of the way evolution proceeds. Maximum likelihood solutions may or may not be the mostparsimonious solution. I restrict myself here to using maximum likelihood models to infer ancestral character states for binary discrete characters, that is, for characters that can adopt only two states, although the generalization to more than two states requires no new concepts.My approach to reconstructing ancestral states makes use of a Markov model of binary character evolution on phylogenies (Pagel, 1994). Sanderson (1993) describes a related model for investigating rates of gains and losses of characters for which the ancestral states are assumed to be known. Schluter (1995), Yang et al. (1995), and Koshi and Goldstein (1996) derive methods that are similar to the procedures I will describe here. However, Yang et al. (1995) and Koshi and Goldstein (1996) use what I shall term “global” methods for estimating ancestral characters, I argue for a “local” approach on grounds that the global method does not produce a maximum-likelihood estimate of the hypothesis of interest. Schluter (1995) reported global and local estimators in his investigation of artiodactyl ribonucleases, and Schluter et al. (1997) reported global estimators. In several recent papers, Schluter (1995; Schluter et al., 1997) called attention to the usefulness of reconstructing ancestral character states for testing ideas about adaptation and evolution, and much of what I say here owes its inspiration to these investigations. Mooers and Schluter (1999) now provide important additional examples of how maximum likelihood methods can return both more information about ancestral character states thanparsimony approaches, as well as information that is at odds with parsimony reconstructions. I intend this article to act as a primer to thosewhoare interested in usingmaximumlikelihood methods but who may not be familiar with the mathematics of the approach. Accordingly, I begin with the simplest case of estimating the ancestral state of two species.
973 citations
344 citations
Posted Content•
TL;DR: In this article, the authors studied finite dimensional representations of the quantum affine algebra, using geometry of quiver varieties introduced by the author, and obtained character formulas expressed in terms of intersection cohomologies of quivers.
Abstract: We study finite dimensional representations of the quantum affine algebra, using geometry of quiver varieties introduced by the author. As an application, we obtain character formulas expressed in terms of intersection cohomologies of quiver varieties.
318 citations
Patent•
26 Nov 1999
TL;DR: In this paper, a console is described, having display means, and game control means arranged to control images displayed on the display means and the game control mean being arranged to play a game in which one or more symbols are randomly selected as a combination of symbols and displayed on display means.
Abstract: A console is described, having display means, and game control means arranged to control images displayed on the display means, the game control means being arranged to play a game in which one or more symbols are randomly selected as a combination of symbols and displayed on the display means. If a winning combination results, the machine awards a prize. In some circumstances, the console will display an animated character to communicate information to the player. The character is independent of and appears asynchronously with respect to the game being played and is arranged to appear super imposed over any game screen currently displayed at the time the character is displayed.
294 citations
294 citations
TL;DR: In this article, the authors recognize the importance of educating for that elusive thing called character, but their efforts are often piecemeal and are often a service learning process, which is often ineffective.
Abstract: Increasingly, educators at colleges and universities are recognizing the importance of educating for that elusive thing called character. But their efforts are often piecemeal—a service learning pr...
243 citations
TL;DR: Hall as mentioned in this paper argued that the rise of the Thatcher-Reagan Right was a symptom rather than a cause of the failure of the Left to apprehend the character of the age and to develop a political critique and a moral-political vision appropriate to this character.
Abstract: ist or academic Left nor to the clever rhetoric or funding schemes of the Right. Rather, he has charged, this ascendancy is consequent to the Left's own failure to apprehend the character of the age and to develop a political critique and a moral-political vision appropriate to this character. For Hall, the rise of the Thatcher-Reagan Right was a symptom rather than a cause of this failure, just as the Left's dismissive or suspicious attitude toward
224 citations
Patent•
05 Jan 1999
TL;DR: In this article, a palm top computer system has an alphabetic input area and a numeral input area to recognize strokes that represent characters from a different character set, and strokes entered in the alphabetic input area are interpreted as alphabets and strokes in the numerals as numerals.
Abstract: To efficiently recognize characters from several character sets, a palmtop computer system is disclosed wherein more that one character input area is displayed. Each character input area is designed to recognize strokes that represent characters from a different character set. In one embodiment, the palmtop computer system has an alphabetic input area and a numeral input area. In such an embodiment, strokes entered in the alphabetic input area are interpreted as alphabetic characters and strokes entered in the numeral input area are interpreted as numerals.
211 citations
TL;DR: This article found that positional information is crucial in activating radical information during character recognition, which supports a hierarchical framework for considering the recognition of Chinese words whereby there is both a radical and a character level of representation, with the former being directly activated by featural information including positional features.
204 citations
Patent•
28 Apr 1999TL;DR: In this article, a character hypothesis is generated, which is a data set of a character, a start vector and an end vector, where the score represents a likelihood of the character being present in the handwritten input at a position starting at the start vector, and ending at the end vector.
Abstract: In a method of recognition of handwritten input, a preprocessing
module (200) of a recognizer (203) having a recognition module (202),
segments handwritten input into strokes, to provide stroke vectors. A
search module (204) generates hypothetical character strings for scoring
by the recognition module (202). A character hypothesis is generated
which is a data set of a character, a start vector and an end vector. The
recognizer (203) provides a non-cumulative score for the character
hypothesis, where the score represents a likelihood of the character being
present in the handwritten input at a position starting at the start vector
and ending at the end vector. The recognizer (203) delivers to the search
module a result that is either the score for the selected first character
hypothesis or a result that allows the search module to temporarily ignore
the hypothesis or to kill it altogether. The search module maintains or
disregards the first hypothetical character string dependent on the result.
The process is repeated for other character hypotheses and other
hypothetical character strings.
192 citations
Patent•
14 Jan 1999
TL;DR: In this paper, a method for incremental recognition of ideographic handwriting comprises in order the steps of: (1) entering in a natural stroke order at least one stroke of an ideographic character from a computer entry tablet; (2) providing the stroke to an incremental character recognizer; (3) displaying a hypothesis list of candidate characters containing the stroke; and (4) selecting a correct character from among the candidate characters on the hypothesis list if it appears thereon.
Abstract: A method for incremental recognition of ideographic handwriting comprises in order the steps of: (1) entering in a natural stroke order at least one stroke of an ideographic character from a computer entry tablet; (2) providing the at least one stroke to an incremental character recognizer, which produces a hypothesis list of at least one candidate character; (3) displaying a hypothesis list of candidate characters containing the at least one stroke; (4) selecting a correct character from among the candidate characters on the hypothesis list if it a correct character appears thereon; (5) entering in natural stroke order at least one additional stroke of the ideographic character from the computer entry tablet if no candidate character is a correct character; (6) providing the additional stroke(s) to the incremental character recognizer, which produces an updated hypothesis list; (7) displaying the updated hypothesis list of candidate characters containing every stroke; (8) selecting a correct character from among the candidate characters on the updated hypothesis list if it a correct character appears thereon; and (9) repeating steps (5) through (8) until a correct character is selected from the updated hypothesis list.
TL;DR: The methods are shown to work better than a standard multivariate analysis, which assumes the character value at each age is a distinct character, and advantages over existing methods that model covariance functions as a series of orthogonal polynomials are discussed.
Abstract: The extension of classical quantitative genetics to deal with function-valued characters (also called infinite-dimensional characters) such as growth curves, mortality curves, and reaction norms, was begun by Kirkpatrick and co-workers. In this theory, the analogs of variance components for single traits are covariance functions for function-valued traits. In the approach presented here, we employ a variety of parametric models for covariance functions that have a number of desirable properties: the functions (1) are positive definite, (2) can be estimated using procedures like those currently used for single traits, (3) have a small number of parameters, and (4) allow simple hypotheses to be easily tested. The methods are illustrated using data from a large experiment that examined the effects of spontaneous mutations on age-specific mortality rates in Drosophila melanogaster. Our methods are shown to work better than a standard multivariate analysis, which assumes the character value at each age is a distinct character. Advantages over existing methods that model covariance functions as a series of orthogonal polynomials are discussed.
Patent•
24 Jun 1999TL;DR: In this article, a character pattern is extracted from image data read from a document, listing, etc., and discriminated between a hand-written character and a typed character by a hand written/typed character discrimination unit.
Abstract: A character pattern is extracted from image data read from a document, listing, etc., and discriminated between a hand-written character and a typed character by a hand-written/typed character discrimination unit. The hand-written/typed character discrimination unit obtains, from the character pattern, N feature vectors containing a feature indicating at least the complexity and the linearity of the character pattern; and discriminating the character pattern between a hand-written character and a typed character using the feature vectors. A character recognition unit performs a character recognizing process based on the result of discriminating whether the character data is a hand-written character or a typed character. As a feature of the above described character pattern, the variance of line widths, the variance of character positions, etc. can also be used.
Patent•
15 Apr 1999
TL;DR: A character is represented in a character generator as a set of polygons and can be manipulated using three-dimensional animation techniques as discussed by the authors, where a code for a character may be used to access the set of curves defining the outline of the character.
Abstract: A character is represented in a character generator as a set of polygons The character may be manipulated using three-dimensional animation techniques A code for a character may be used to access a set of curves defining the outline of the character This set of curves is transformed into a set of polygons The set of polygons may be rendered as a three-dimensional object The set of polygons may be created by converting the curves into sets of connected line segments and then tessellating the polygon defined by the line segments Animation properties are represented using a normalized scale along a path or over time Animation may be provided in a manner that is independent of the spatial and temporal resolution of the video to which it is applied Such animation may be applied to characters defined by a set of polygons Various three-dimensional spatial transformations, lighting effects and other colorizations may be provided A user interface for editing a character string may provide two alternate displays A first display allows a user to input and view any desired portion of the character string for the purpose of editing A second display allows a user to view how the character string appears at a selected point in time during a titling effect for the purpose of animation In both displays, the text is displayed in a three-dimensional form This interface may be combined with a timeline editing interface for editing an associated video program, or other user interface, to permit layering of titling effects and adjustment of animation properties, positioning and timing
Patent•
26 Apr 1999TL;DR: In this paper, an imaginary stroke is used to link from the ending point of each actual stroke of an input handwritten character to the starting point of the subsequent actual stroke thereof to form a single line.
Abstract: In accordance with the present character recognition method, an imaginary stroke is used to link from the ending point of each actual stroke of an input handwritten character to the starting point of the subsequent actual stroke thereof to form a single line. Then a feature level is detected for specifying the position of a turn of the single line and the direction and angle of the turn at the position. According to the detected position of the turn, the detected feature level is patterned on input mesh memories which are in turn compared with a previously formed dictionary mesh memory to calculate the resemblance of the input handwritten character to each handwritten character in a dictionary database. The handwritten character in the dictionary database that has the closest, calculated resemblance is recognized as the input handwritten character. According to the present method, an imaginary stroke added to an input handwritten character also allows correct recognition of a character with each stroke written cursively.
Patent•
07 Jan 1999TL;DR: In this paper, a multi-user interactive virtual environment system is presented, where each user is provided with data to generate a respective image of the virtual environment and characters therein, including an assigned character (100) particular to that individual user, from a respective virtual camera (110) viewpoint (A, B, C) determined at least partially by the user-directed motion of their assigned character.
Abstract: A multi-user interactive virtual environment system wherein each user is provided with data to generate a respective image of the virtual environment and characters therein, including an assigned character (100) particular to that individual user, from a respective virtual camera (110) viewpoint (A, B, C) determined at least partially by the user-directed motion of their assigned character. Each character has an interaction zone of predetermined size and shape maintained about its current virtual environment location. When the respective interaction zones of two or more user-assigned characters (100, 130) overlap, their respective virtual cameras (110) are controlled to move from first- to third-person (A-C) viewpoints for as long as the overlap remains. In a refinement (Fig. 17), at least one further interaction zone at a given location within the virtual environment, and independent of any particular character within the virtual environment, takes control of all character virtual cameras as those characters enter the zone.
Journal Article•
TL;DR: The character fields of the irreducible characters of cyclotomic Hecke algebras with complex reflection groups were studied in this paper, where it was shown that the character fields can be obtained by adjoining roots of monomials in the parameters to the ground field (Corollary 4.8 and Theorem 5.2).
Abstract: Let W be a finite complex reflection group, and H = H(W,u) the corresponding generic (cyclotomic) Hecke algebra as introduced in [8] and [9]. In this paper we study the character fields of the irreducible characters of H. In the case that W is a Weyl group, hence a reflection group over the field of rational numbers, it is well known that all other complex irreducible representations of W can also be realized over Q. The corresponding situation for the associated Iwahori-Hecke algebras was investigated by Benson and Curtis [5] and Alvis and Lusztig [1]. They determined the character fields of all absolutely irreducible representations of Iwahori-Hecke algebras. It turned out that sometimes certain square roots of monomials in the parameters have to be adjoined to the ground field. Furthermore they showed that all absolutely irreducible representations can actually be realized over such an extension of the ground field [5,13]. For a complex reflection group W let k denote the character field of the reflection representation of W . It is a result of Benard [4] and Bessis [6] that again all absolutely irreducible complex representations of W can be realized over k and in particular have their character field contained in k. Here we determine the character fields of all generic cyclotomic Hecke algebras associated to complex reflection groups (under a certain assumption known to hold for all but finitely many irreducible types and conjectured to be always true). Partial results in this direction were already obtained in [8] for those complex reflection groups occurring as cyclotomic Weyl groups. Our results show that again the character fields and a splitting field for H can be obtained by adjoining roots of certain monomials in the parameters to the ground field (Corollary 4.8 and Theorem 5.2). Our methods are similar to those employed in [5, 6, 8]. As in all of the above references, we use a case-by-case analysis, handling each isomorphism
TL;DR: This article defined character education as the cultivation of virtue, and addressed seven questions: (1) What is the relationship between character and virtue, (2) What are the goals of character education, and (3) what are the psychological components of character.
Abstract: Defining character education as the cultivation of virtue, this article addresses seven questions: (1) What is the Relationship Between Character and Virtue? (2) What is the Nature of Character Education? (3)What are the Goals of Character Education? (4) What are the Psychological Components of Character? (5) What is the Content of Character? (6) What is the Comprehensive Approach to Character Development? (7) How Can Schools of Education Prepare Effective Character Educators?
Patent•
12 Nov 1999
TL;DR: In this paper, a game machine controller operates a character of a game, such as an airplane, a robot, or the like, which carries out various movements, and the controller is shaped in a form identical to the character.
Abstract: A game machine controller operates a character of a game, such as an airplane, a robot, or the like, which carries out various movements. The controller is shaped in a form identical to the character and comprises posture detecting means, whereby the controller can be moved to operate various movements of the character. Hence, even small children and the like can easily operate the character in the game without resistance.
TL;DR: Discrete, version 1.01b (Pagel, 1997), is a DOS-based program that can be used to estimate individual ancestral values, and was written to test for correlated evolution between twodiscrete characters.
Abstract: Discrete, version 1.01b (Pagel, 1997), is a DOS-based program that can be used to estimate individual ancestral values. Discrete was written to test for correlated evolution between twodiscrete characters, and producing ancestor reconstructions in such away requires several steps. First, Discrete deals with two characters at a time; therefore, for thepurposes of estimating ancestors for a single character, the states must be entered twice. For example, for a tip (tipA) in state 1 on a branch 2units long andwhose immediate ancestor is nodeA, the entry would be “tipA, nodeA, 2, 1,1.” Because two characters are input, Discrete estimates two (or four) rates: a 1 and b 1 refer to q01 and q10 for the rst character, and a 2 and b 2 refer to q01 and q10 for the second character. With this in mind:
TL;DR: This paper found that teachers shared field-invariant epistemological standards guiding their practical knowledge and that teachers' professional and moral character were interrelated and could not be separated from each other.
TL;DR: In this article, the authors explored the factors influencing Israeli teenage viewers' choice of their favorite TV character from a popular night-time serial, and found that participants were asked to choose a character fro...
Abstract: The present study explores the factors influencing Israeli teenage viewers’ choice of their favorite TV character from a popular night‐time serial. Participants were asked to choose a character fro...
TL;DR: In this article, the authors consider elements x of a finite group G with the property that χ(x) ≠ 0 for all irreducible characters χ of G. If G is solvable and x has odd order, then x must lie in the Fitting subgroup F(G).
Patent•
NEC1
TL;DR: In this article, the output of the direction indicating device is used as circumferential position information, and a specified character is selected from a chart of characters that associates the previously provided position information with the output.
Abstract: Characters are easily input using a direction indicating device. The device provides a direction indicating device which outputs a rotated direction of lowering, or the direction inclination and its strength, a display device, a key input means, a memory that stores a plurality of character sets, and a control means which selects characters a character set and characters comprising this character set which are stored in memory according to the output of the direction indicating device, and displays them on the display device, and which accepts the output of the direction indicating device as circumferential position information, and selects a specified character from a chart of characters that associates the previously provided position information with the output of the direction indicating device.
Patent•
12 Feb 1999TL;DR: In this article, a computer-implemented method for calculating word accuracy is presented, where word grouping accuracy is calculated by using the character accuracy values (250) calculated by an OCR program present in a computer system.
Abstract: The present invention is a computer-implemented method for calculating word accuracy. Word grouping accuracy values (260) are calculated (212) by using the character accuracy values (250) calculated by an OCR program present in a computer system. The present invention preferably uses these character accuracy values (250) to create a word grouping accuracy value (260). Various methods are employed to calculate the word accuracy (260), including binarizing the character accuracy values (250), modified averaging of the character accuracy values (250), and creating fuzzy visual displays of word grouping accuracy values (260). The calculated word grouping accuracy values (260) are then adjusted based upon known OCR strengths and weaknesses, and based upon comparisons to stored word lists and the application of language rules. In a system with multiple character recognition techniques, the system can compare the accuracy values (260) of different versions of the word groupings to find the most accurate version. Then, the most accurate version of the word groupings is kept.
Patent•
08 Jun 1999TL;DR: In this article, a technique to switch between upper and lowercase alphabetic characters in a wireless communication device measures the period of time in which a numeric key is held in the depressed position by the user.
Abstract: A technique to switch between upper and lowercase alphabetic characters in a wireless communication device measures the period of time in which a numeric key is held in the depressed position by the user. If a numeric key is pressed by the user for a period of time less than a predetermined threshold time (212), the selected alphabetic character is displayed in a default character case. If the selected numeric key is held in the depressed position for a period of time exceeding the predetermined threshold period, the character case is altered and the altered alphabetic character is displayed for the user (214). The user selects the desired alphabetic character by activating a selected numeric key one or more times corresponding to the desired alphabetic letter. If the selected numeric key is held in the depressed position for a period of time exceeding the threshold period during any of the button depressions (212), the system automatically changes to the altered alphabetic character case (214). The alphabetic character case is controlled on a character by character basis such that entry of a new alphabetic character uses the default character case unless the selected numeric key is again held in the depressed position for a period of time exceeding the predetermined threshold.
TL;DR: In this paper, a theory of finite-type relations between polynomial sequences is developed, which contains semi-classical sequences and in particular the so-called coherent pairs.
Patent•
04 Aug 1999TL;DR: In this paper, the authors described a method for selecting an entry from a list of entries in a vehicle navigation system. But their method is restricted to a character slot and a selection window comprising a plurality of adjacent character spaces.
Abstract: Methods and apparatus are described for selecting an entry from a list of entries in a vehicle navigation system. First and second objects are presented on the system display. The first object includes the list of entries and the second object includes a character slot and a selection window comprising a plurality of adjacent character spaces. The second object is operable to present a sequence of characters in the character slot and to enter one of the characters in each of the character spaces in response to manipulation of an input device associated with the navigation system. An arrangement of the characters is presented in the adjacent character spaces of the selection window and the character slot in response to manipulation of the input device. For each of the characters entered in the selection window, a first entry in the list of entries is highlighted, the first entry corresponding to the arrangement of characters in the selection window and the character slot. A highlighted entry is selected from the list of entries in response to a selection signal generated by actuation of the selection device.
Patent•
18 Oct 1999TL;DR: In this paper, a method of storing data in an electronic phone data book for a digital mobile phone, which includes a key input part, display, touch screen for inputting characters, character code storage for storing character and number codes, character database for storing feature data corresponding to character and numbers, and character recognition device.
Abstract: A method of storing data in an electronic phone data book for a digital mobile phone, which includes a key input part, display, touch screen for inputting characters, character code storage for storing character and number codes, character database for storing feature data corresponding to character and number codes, and character recognition device. A method of searching through the electronic phone data book includes setting the mobile phone in a search mode, generating a search mode character code corresponding to touch screen data input, determining whether the search mode character code is registered in said phone book storage and displaying a corresponding phone number if it is.
Patent•
04 Jun 1999
TL;DR: In this article, a bounding box and a corresponding character pattern are extracted for each character (hereinafter, "the character") and a final candidate for the character pattern is output based on the provided candidate(s), the provided degree(s) of similarity, the structural features and the bounding boxes.
Abstract: A method of recognizing characters of a document including ruled lines. After separating the characters from the ruled lines, a bounding box and a corresponding character pattern are extracted for each character (hereinafter, “the character”). Contour information and ground (white pel area) information are extracted as fundamental features from the character pattern. Various statistical features are extracted based on the fundamental features. Various structural features are extracted based on the fundamental features and the character pattern. On the basis of the extracted statistical features, some candidates for the character and corresponding degrees of similarity are found to provide at least such one of the candidates as has largest degree(s) of similarity and degree(s) of similarity associated with the provided candidate(s). A final candidate for the character pattern is output based on the provided candidate(s), the provided degree(s) of similarity, the structural features and the bounding box.