Objectives Computer and communication practice relies on data compression and dictionary search methods. They lean on a rapidly developing theory. Its exposition from a new viewpoint is the purpose of the book. We start from the very beginning and finish with the latest achievements of the theory, some of them in print for the first time. The book is intended for serving as both a monograph and a self-contained textbook. Information retrieval is the subject of the treatises by D. Knuth (1973) and K. Mehlhorn (1987). Data compression is the subject of source coding. It is a chapter of information theory. Its up-to-date state is presented in the books of Storer (1988), Lynch (1985), T. Bell et al. (1990). The difference between them and the present book is as follows. First. We include information retrieval into source coding instead of discussing it separately. Information-theoretic methods proved to be very effective in information search. Second. For many years the target of the source coding theory was the estimation of the maximal degree of the data compression. This target is practically bit today. The sought degree is now known for most of the sources. We believe that the next target must be the estimation of the price of approaching that degree. So, we are concerned with trade-off between complexity and quality of coding. Third. We pay special attention to universal families that contain a good com pressing map for every source in a set.

The three volume set LNCS 4232, LNCS 4233, and LNCS 4234 constitutes the refereed proceedings of the 13th International Conference on Neural Information Processing, ICONIP 2006, held in Hong Kong, China in October 2006. The 386 revised full papers presented were carefully reviewed and selected from 1175 submissions.

This volume introduces mathematicians and physicists to a crossing point of algebra, physics, differential geometry and complex analysis. The book follows the French tradition of Cartan, Chevalley and Crumeyrolle and summarizes Crumeyrolle's own work on exterior algebra and spinor structures. The depth and breadth of Crumeyrolle's research interests and influence in the field is investigated in a number of articles. Of interest to physicists is the modern presentation of Crumeyrolle's approach to Weyl spinors, and to his spinoriality groups, which are formulated with spinor operators of Kustaanheimo and Hestenes. The Dirac equation and Dirac operator are studied both from the complex analytic and differential geometric points of view, in the modern sense of Ryan and Trautman. For mathematicians and mathematical physicists whose research involves algebra, quantum mechanics and differential geometry.

Introduction I. General remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 II. Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 III. Lie algebras: some basics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Chapter 1 Operator calculus and Appell systems I. Boson calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 II. Holomorphic canonical calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 III. Canonical Appell systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 Chapter 2 Representations of Lie groups I. Coordinates on Lie groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 II. Dual representations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 III. Matrix elements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 IV. Induced representations and homogeneous spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40 General Appell systems Chapter 3 I. Convolution and stochastic processes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 II. Stochastic processes on Lie groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 III. Appell systems on Lie groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 Chapter 4 Canonical systems in several variables I. Homogeneous spaces and Cartan decompositions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54 II. Induced representation and coherent states . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62 III. Orthogonal polynomials in several variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 Chapter 5 Algebras with discrete spectrum I. Calculus on groups: review of the theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83 II. Finite-difference algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 III. q-HW algebra and basic hypergeometric functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 IV. su2 and Krawtchouk polynomials . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 V. e2 and Lommel polynomials . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 Chapter 6 Nilpotent and solvable algebras I. Heisenberg algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113 II. Type-H Lie algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118 Vll III. Upper-triangular matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 IV. Affine and Euclidean algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127 Chapter 7 Hermitian symmetric spaces I. Basic structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131 II. Space of rectangular matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 133 III. Space of skew-symmetric matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 136 IV. Space of symmetric matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143 Chapter 8 Properties of matrix elements I. Addition formulas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147 II. Recurrences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 148 III. Quotient representations and summation formulas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149 Chapter 9 Symbolic computations I. Computing the pi-matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153 II. Adjoint group . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154 III. Recursive computation of matrix elements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

In essence, this text is written as a challenge to others, to discover significant uses for Cayley number algebra in physics. I freely admit that though the reading of some sections would benefit from previous experience of certain topics in physics - particularly relativity and electromagnetism - generally the mathematics is not sophisticated. In fact, the mathematically sophisticated reader, may well find that in many places, the rather deliberate progress too slow for their liking. This text had its origin in a 90-minute lecture on complex numbers given by the author to prospective university students in 1994. In my attempt to develop a novel approach to the subject matter I looked at complex numbers from an entirely geometric perspective and, no doubt in line with innumerable other mathematicians, re-traced steps first taken by Hamilton and others in the early years of the nineteenth century. I even enquired into the possibility of using an alternative multiplication rule for complex numbers (in which argzlz2 = argzl- argz2) other than the one which is normally accepted (argzlz2 = argzl + argz2). Of course, my alternative was rejected because it didn't lead to a 'product' which had properties that we now accept as fundamental (i. e.

Class-tested and coherent, this textbook teaches classical and web information retrieval, including web search and the related areas of text classification and text clustering from basic concepts. It gives an up-to-date treatment of all aspects of the design and implementation of systems for gathering, indexing, and searching documents; methods for evaluating systems; and an introduction to the use of machine learning methods on text collections. All the important ideas are explained using examples and figures, making it perfect for introductory courses in information retrieval for advanced undergraduates and graduate students in computer science. Based on feedback from extensive classroom experience, the book has been carefully structured in order to make teaching more natural and effective. Slides and additional exercises (with solutions for lecturers) are also available through the book's supporting website to help course instructors prepare their lectures.

Spread in 133 articles divided in 20 sections the present treatises broadly discusses: Part 1: Image Processing Part 2: Radar and Satellite Image Processing Part 3: Image Filtering Part 4: Content Based Image Retrieval Part 5: Color Image Processing and Video Processing Part 6: Medical Image Processing Part 7: Biometric Part 8: Network Part 9: Mobile Computing Part 10: Pattern Recognition Part 11: Pattern Classification Part 12: Genetic Algorithm Part 13: Data Warehousing and Mining Part 14: Embedded System Part 15: Wavelet Part 16: Signal Processing Part 17: Neural Network Part 18: Nanotechnology and Quantum Computing Part 19: Image Analysis Part 20: Human Computer Interaction

The term computation gap has been defined as the difference between the computational power demanded by the application domain and the computational power of the underlying computer platform. Traditionally, closing the computation gap has been one of the major and fundamental tasks of computer architects. However, as technology advances and computers become more pervasive in the society, the domain of computer architecture has been extended. The scope of research in the computer architecture is no longer restricted to the computer hardware and organization issues. A wide spectrum of topics ranging from algorithm design to power management is becoming part of the computer architecture. Based on the aforementioned trend and to reflect recent research efforts, attempts were made to select a collection of articles that covers different aspects of contemporary computer architecture design. This volume of the Advances in Computers contains six chapters on different aspects of computer architecture. Key features: - Wide range of research topics. - Coverage of new topics such as power management, Network on Chip, Load balancing in distributed systems, and pervasive computing. - Simple writing style. · Wide range of research topics. · Coverage of new topics such as power management, Network on Chip, Load balancing in distributed systems, and pervasive computing. · Simple writing style