scispace - formally typeset
Search or ask a question

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


Book
01 Jan 1993
TL;DR: In this paper, the authors define a family of representations of these compact open subgroups, which they call "simple types" and classify the irreducible representations of "G" containing the trivial simple type by the simple modules over a classical affine Hecke algebra.
Abstract: This work gives a full description of a method for analyzing the admissible complex representations of the general linear group "G" = "Gl(N, F)" of a non-Archimedean local field "F" in terms of the structure of these representations when they are restricted to certain compact open subgroups of "G." The authors define a family of representations of these compact open subgroups, which they call "simple types." The first example of a simple type, the "trivial type," is the trivial character of an Iwahori subgroup of "G." The irreducible representations of "G" containing the trivial simple type are classified by the simple modules over a classical affine Hecke algebra. Via an isomorphism of Hecke algebras, this classification is transferred to the irreducible representations of "G" containing a given simple type. This leads to a complete classification of the irreduc-ible smooth representations of "G," including an explicit description of the supercuspidal representations as induced representations. A special feature of this work is its virtually complete reliance on algebraic methods of a ring-theoretic kind. A full and accessible account of these methods is given here.

443 citations




Patent
25 Jan 1993
TL;DR: A character string retrieval system as mentioned in this paper retrieves a character string corresponding to a retrieval key input from a text file including a plurality of characters, where the retrieval result is obtained based on the position data corresponding to the first character in said index.
Abstract: A character string retrieval system retrieves a character string corresponding to a retrieval key input thereto from a text file including a plurality of characters. The system includes an index indicating position data identifying a position of each of characters in the text file and indicating next character data identifying either a character or a character string formed of a plurality of characters arranged next to each of the characters in the text file, a selecting unit for selecting a first character from characters forming the character string corresponding to the retrieval key, a determining unit for determining, with reference to said index, whether or not a character or a character string next to the first character, selected by said selecting unit, in the retrieval key is equal to a character or a character string identified by the character data corresponding to the first character; and output unit for outputting a retrieval result when said determining unit determines that a character or a character string next to the first character in the retrieval key is equal to a character or a character string identified by the character data corresponding to the first character, the retrieval result being obtained based on the position data corresponding to the first character in said index.

216 citations


Book
25 Jun 1993
TL;DR: In this paper, the authors present a theory of volition for character and intention in the setting of a character and an intention, which is based on the concept of boundaries.
Abstract: 1. Introduction 2. Character and intention 3. Boundaries 4. Dreams 5. Miracles 6. Roles 7. Against a theory of volition Appendix.

190 citations


Journal ArticleDOI
TL;DR: Using the model of Mcdonalds, the author draws on the theories of Weber to produce a social critique as mentioned in this paper, where the authors draw on the theory of Weber for the analysis of the fast-food business.
Abstract: The fast-food business, most notably Mcdonal ds, revolutionised not only the restaurant business but also American society and ultimately, the world. Using the model of Mcdonalds, the author draws on the theories of Weber to produce a social critique. '

156 citations


Posted Content
TL;DR: In this paper, a new interpretation and proof of the quasi-particle type character formulas for integrable representations of the simply-laced affine Kac-Moody algebras was given.
Abstract: We give a new interpretation and proof of the "quasi-particle" type character formulas for integrable representations of the simply-laced affine Kac-Moody algebras through a new "semi-infinite" construction of such representations. We compare formulas of this kind to other formulas obtained using the geometry of the corresponding flag manifold and in particular give a new proof to the Gordon type identities.

152 citations


Journal ArticleDOI
TL;DR: In this paper, the authors formally define the two character types, compare their properties, and consider the consequences of the two methods for both resolution and congruence, and demonstrate that minimally connected characters increase resolution relative to maximally-connected characters.
Abstract: Multistate morphological characters have generally been treated as either «unordered» or «ordered» in phylogenetic analyses using parsimony. Because ordering relations do not apply to the states of characters treated under these methods, I prefer «maximally connected» character to «unordered» character and «minimally connected» character to «ordered» character. This paper formally defines the two character types, compares their properties, and considers the consequences of the two methods for both resolution and congruence. The results demonstrate that minimally connected characters increase resolution relative to maximally connected characters. Minimally connected characters do not, however, necessarily increase congruence among data sets

152 citations


Patent
Dan Shmuel Chevion1, Ittai Gilat1, Andre Heilper1, Oren Kagan1, Amir Kolsky1, Yoav Medan1, Eugene Walach1 
03 Aug 1993
TL;DR: In this article, a system comprising optical character recognition logic for generating, from the document image or images, character data specifying one of a plurality of possible character values for corresponding segments of the document images.
Abstract: A data entry system generates an electronically stored coded representation of a character sequence from one or more electronically stored document images. The system comprising optical character recognition logic for generating, from the document image or images, character data specifying one of a plurality of possible character values for corresponding segments of the document images. The system also has an interactive display means for generating and sequentially displaying, one or more types of composite image, each composite image comprising segments of the document image or images arranged according to the character data, and a correction mechanism responsive to a user input operation to enable the operator to correct the character data associated with displayed segments.

131 citations



Journal ArticleDOI
TL;DR: A new method for weighting characters according to their homoplasy is proposed; the method is non-iterative and does not require independent estimations of weights.

Journal ArticleDOI
TL;DR: In this paper, the authors present and prove a simple but non-obvious topological fact, which can be included in a collection of puzzles or suffested as a problem for a school mathematical tournament.
Abstract: In this paper we present and prove a simple but non-obvious topological fact. This fact is so simple and funny that can be included in a collection of puzzles or suffested as a problem for a school mathematical tournament. The aim of this article is to present a method by which this fact, in spite of its unserious character. can be applied to produce new non-trivial group-theoretic results.

Proceedings ArticleDOI
03 Nov 1993
TL;DR: This work presents a polynomial-time algorithm for determining whether a set of species, described by the characters they exhibit, has a perfect phylogeny, assuming the maximum number of possible states for a character is fixed.
Abstract: We present a polynomial-time algorithm for determining whether a set of species, described by the characters they exhibit, has a perfect phylogeny, assuming the maximum number of possible states for a character is fixed. This solves a longstanding open problem. Our result should be contrasted with the proof by Steel and Bodlaender, Fellows, and Warnow that the perfect phylogeny problem is NP-complete in general. >

Book ChapterDOI
01 Jan 1993
TL;DR: Wigner as discussed by the authors was one of the two men (Hermann Weyl was the other) who introduced a powerful new mathematical tool into quantum mechanics in its earliest years.
Abstract: Eugene Wigner is above all a theoretical physicist. However he was one of the two men (Hermann Weyl was the other) who introduced a powerful new mathematical tool into quantum mechanics in its earliest years. This is the theory of group representations, invented by Frobenius in 1896, and apparently not applied outside of pure group theory until E. Artin’s startling application to number theory in 1923. Wigner’s first application of this theory to quantum mechanics was published only four years later in 1927. Weyl’s contribution was of a completely different character and was made a few months after Wigner’s.


Patent
19 Nov 1993
TL;DR: In this paper, the authors propose a fault-tolerant communication of data embodied in a packet, which includes transmission of a starting sequence signal, the starting sequence signals including a first character string followed by a second character string.
Abstract: A system, apparatus, and method for fault-tolerant communication of data embodied in a packet. The communication includes transmission of a starting sequence signal, the starting sequence signal including a first character string followed by a second character string. Transmitting the packet of information after the starting sequence signal has been transmitted, and transmitting an ending sequence signal after the packet has been transmitted, the ending sequence signal including a third character string followed by a fourth character string. The present invention also includes receiving the starting sequence signal transmitted from the transmitting means, and comparing the first and second character strings for the starting sequence signal to first and second pre-determined character strings. A buffer is reset so that it may receive the packet if the first and second character strings match the first and second pre-determined character strings, respectively. Once the buffer is reset, the ending sequence signal is received and the third and fourth character strings of the ending sequence signal are compared to third and fourth pre-determined character strings. If the third and fourth character strings match the third and fourth pre-determined character strings, respectively, the received packet is processed. If the third and fourth character strings do not match the third and fourth pre-determined character strings, the packet is disregarded.

Journal ArticleDOI
01 Feb 1993
TL;DR: In this article, a modified proof of the inequalities of P6lya-Vinogradov and of Burgess is presented, which displays the latter as a generalization of the former.
Abstract: We give a number of estimates for character sums Z EX(a+b) aE.V bER for rather general sets X, 7 . These give, in particular, a modified proof of the inequalities of P6lya-Vinogradov and of Burgess, which displays the latter as a generalization of the former.




Patent
10 Mar 1993
TL;DR: In this article, a character size is changed so that the horizontal length of an input character string falls within the printing area and all the characters of the character string extending in all the lines fall within a printing area.
Abstract: A label printing apparatus includes a liquid crystal display unit for displaying an input character string and a message corresponding to each operation stage, a printing unit for printing a character string on each label, a storage unit for storing each data, and a CPU for performing each processing and control. Label information specifying sizes and the like of various types of labels, sheet numbers corresponding to the label information, character size information defining character sizes, and the like are stored in the storage unit. The CPU specifies label information corresponding to the sheet number and selects a maximum printable character size from a character size table as an initial value on the basis of a printing area. The character size is changed so that the horizontal length of an input character string falls within the printing area. The character size is further changed so that all the characters of the character string extending in all the lines fall within the printing area. An optimal character size is finally selected, and actual printing is performed on each label using this character size.

Journal ArticleDOI
TL;DR: Good experimental results prove the feasibility of the proposed approach for cursive Chinese character recognition, and dynamic programming is employed for stroke or character matching.
Abstract: Consecutive strokes of Chinese characters tend to be connected in fast writing, and this causes a problem for most stroke-based recognition approaches. A recognition scheme for recognizing cursive Chinese characters under the constraint of correct stroke writing orders is proposed. The recognition scheme consists of two phases: candidate character selection and detailed matching. In the former phase, an input script with N strokes is used to split the strokes of each reference character into N corresponding parts. In the latter phase, the connected input strokes are broken into multiple strokes under the guidance of candidate characters. In both phases, dynamic programming is employed for stroke or character matching. Good experimental results prove the feasibility of the proposed approach for cursive Chinese character recognition. >

Journal ArticleDOI
TL;DR: In this paper, a new q-series formula for a character of parafermion conformal field theories associated with arbitrary non-twisted affine Lie algebra is proposed, and its natural origin from a thermodynamic Bethe Ansatz analysis including chemical potentials.
Abstract: We propose a new q-series formula for a character of parafermion conformal field theories associated with arbitrary non-twisted affine Lie algebra ĝ. We show its natural origin from a thermodynamic Bethe Ansatz analysis including chemical potentials.

Journal ArticleDOI
TL;DR: DETERMINISM in philosophical discussions of determinism I believe it is fair to say that there is not ordinarily a sharp separation of a process being deterministic and a processbeing predictable.
Abstract: DETERMINISM in philosophical discussions of determinism I believe it is fair to say that there is not ordinarily a sharp separation of a process being deterministic and a process being predictable. Much of the philosophical talk about determinism proceeds as if it is understood that a deterministic process is necessarily predictable. Here is a typical quotation, taken from A. J. Ayer's essay \" Freedom and Necessity: \" \" Nevertheless, it may be said, if the postulate of determinism is valid, then the future can be explained in terms of the past: and this means that if one knew enough about the past one would be able to predict the future. \" Without attempting quite general definitions for arbitrary systems, it will still be useful to examine in somewhat more detail how we ordinarily think about these two related but different concepts of determinism in prediction. One formulation of determinism grows naturally out of the theory of differential equations. If a set of differential equations is given for a phenomenon, then we say that the phenomenon is deterministic if there is exactly one solution as a function of time of the differential equations satisfying the given initial and boundary conditions. There is no general conceptual reason, of course, for restricting ourselves to differential equations. We can easily say that a system of equations for discrete time intervals is deterministic in the same sense. Sometimes in formulating what we mean by deterministic systems we put the emphasis rather differently. For example, in asserting the claim that classical mechanics is deteministic we may formulate the condition along the following lines. The history of an isolated system of particle mechanics is determined by the masses and forces acting on the particles, together with'appropriate initial conditions. Âs is weil known, these appropriate initial conditions give for some particular instant of time the position and velocity of each of the particles. When

01 Jan 1993
TL;DR: An algorithm that automatically generates outline fonts from a grey-level image of a character obtained by a scanner by extracting contour points from the image and dividing the points into a number of segments at the corner points is presented.
Abstract: SUMMARY This paper presents an algorithm that automatically generates outline fonts from a grey-level image of a character obtained by a scanner. Our algorithm begins by extracting contour points from the image and dividing the points into a number of segments at the corner points. The next step is fitting a piecewise cubic B´ ezier curve to each segment. > > > > > >



Patent
18 Nov 1993
TL;DR: In this paper, a method for displaying a character traversing a video game playfield is presented. But the method is limited to a single player and requires a video screen display, a user-controlled graphics controller and digital memory.
Abstract: A method is provided for displaying a video game character traversing a video game playfield, for use with a system which includes a video screen display, a user-controlled graphics controller and digital memory; wherein the video game character follows a path within the playfield, the method comprising the steps of: storing multiple collision blocks that define respective path segments; dividing the playfield into multiple path blocks that comprise the path; storing character collision-type information; storing references from individual path blocks to individual collision blocks; displaying character movement through the playfield from path block to path block along the path in response to user input to the graphics controller; controlling the display of character movement by causing the character image to follow a path defined by the path segments of individual collision blocks; and changing the stored character collision-type information when the character path passes a prescribed location on the playfield.

Patent
15 Mar 1993
TL;DR: In this article, a detecting device detects a similarity condition between first and second hand-written characters initially input by the user on the input device, and hand-writing character information for the user based on the user's registered hand writing character information is registered if the similarity condition was detected.
Abstract: An information processing apparatus with a hand-writing character recognition function includes an input device having a pen and tablet for inputting a user's hand-writing character information, and a selecting device for selecting a desired block type character on the basis of the hand-writing character information, selection of the block type character (corresponding to the hand-writing character information) being effected by the hand-writing character recognition function. A detecting device detects a similarity condition between first and second hand-written characters initially input by the user on the input device, and hand-writing character information for the user based on the first and second hand-written character is registered if the similarity condition was detected. Subsequently, if the user inputs a hand-written character similar to the user's registered hand-writing character information, the input hand-written character is translated into the desired block type character.