Attempt 3 questions. (If you attempt more, only the best 3 will be counted.) All questions carry the same number of marks. Unless otherwise stated, all groups are compact (or finite), and all representations are of finite degree over C. 1. Define a group representation. What is meant by saying that a representation α is simple? Determine all simple representations of S 3. from first principles....

There is a simple formula for the absolute value of the determinant of the character table of the symmetric group Sn. It equals aP , the product of all parts of all partitions of n (see [4, Corollary 6.5]). In this paper we calculate the absolute values of the determinants of certain submatrices of the character table X of the alternating group An, including that of X itself (Section 2). We als...

0.1. Let G be a connected reductive algebraic group defined over a finite field Fq and let G(Fq) be the finite group of all Fq-rational points of G. We would like to present here a strategy for computing the character table of G(Fq) , under the assumption that p, the characteristic of Fq , is sufficiently large. We can assume that G has a simply connected derived group. Indeed, in the general c...

Document analysis often starts with robust signatures, for instance for document lookup from low-quality photographs, or similarity analysis between scanned books. Signatures based on OCR typically work well, but require good quality OCR, which is not always available and can be very costly. In this paper we describe a novel scheme for extracting discrete signatures from document images. It ope...

This paper discusses the process of implementing an off-line system for recognizing handwritten Arabic words. In order to recognize a word, its character decomposition should be known. This is done through segmentation. In our model, Arabic character recognition goes through a preprocessing stage followed by a recognition stage. Each character of the word is investigated in order to determine i...

Table 2: Confusion matrix with 93.30% rec. rate and 1.39% error rate. 9 Acknowledgments The authors thanks ELSAG S.p.A., Italy, for supplying the character database and all researchers and staa of IRST that have contributed to this work. 15 Figure 5: A random subsample of size normalized characters. Second, values of free parameters are learned through a gradient-descent based algorithm. The cl...

Despite the growing availability of big data in many fields, historical data on socioevironmental phenomena are often not available due to a lack of automated and scalable approaches for collecting, digitizing, and assembling them. We have developed a data-mining method for extracting tabulated, geocoded data from printed directories. While scanning and optical character recognition (OCR) can d...

This paper presents an automated system for storage and retrieval of bank checks in contrast with the microfilming techniques that are currently used. The bank check images are introduced into an extraction module where the filled– in information is segmented. This information is indexed via keywords derived from the MICR line and stored in a database under a hybrid structure where hash tables,...

SAS users are always interested in learning techniques related to improving data access. One way of improving information retrieval from a SAS data set or table is to create and use an index. An index consists of one or more columns that are used to uniquely identify each row within a table. Functioning as a SAS object containing the values in one or more columns in a table, an index may be def...

We present an instance based table integration algorithm. A table is a set of instances of a record which consists of fields. A field is a pair of an attribute name and a sequence of attribute values of the same type. Given tables, the algorithm calculates two numerical features for each field using character codes and then finds correspondence between fields among tables. The novelty of the al...