87,99 €
versandkostenfrei*

inkl. MwSt.
Versandfertig in 2-4 Wochen
44 °P sammeln
    Broschiertes Buch

The purpose of this book is to develop a generative theory of shape that has two properties we regard as fundamental to intelligence -(1) maximization of transfer: whenever possible, new structure should be described as the transfer of existing structure; and (2) maximization of recoverability: the generative operations in the theory must allow maximal inferentiability from data sets. We shall show that, if generativity satis?es these two basic criteria of - telligence, then it has a powerful mathematical structure and considerable applicability to the computational disciplines. The…mehr

Produktbeschreibung
The purpose of this book is to develop a generative theory of shape that has two properties we regard as fundamental to intelligence -(1) maximization of transfer: whenever possible, new structure should be described as the transfer of existing structure; and (2) maximization of recoverability: the generative operations in the theory must allow maximal inferentiability from data sets. We shall show that, if generativity satis?es these two basic criteria of - telligence, then it has a powerful mathematical structure and considerable applicability to the computational disciplines. The requirement of intelligence is particularly important in the gene- tion of complex shape. There are plenty of theories of shape that make the generation of complex shape unintelligible. However, our theory takes the opposite direction: we are concerned with the conversion of complexity into understandability. In this, we will develop a mathematical theory of und- standability. The issue of understandability comes down to the two basic principles of intelligence - maximization of transfer and maximization of recoverability. We shall show how to formulate these conditions group-theoretically. (1) Ma- mization of transfer will be formulated in terms of wreath products. Wreath products are groups in which there is an upper subgroup (which we will call a control group) that transfers a lower subgroup (which we will call a ?ber group) onto copies of itself. (2) maximization of recoverability is insured when the control group is symmetry-breaking with respect to the ?ber group.
  • Produktdetails
  • Lecture Notes in Computer Science Vol.2145
  • Verlag: Springer, Berlin
  • 2001
  • Seitenzahl: 576
  • Erscheinungstermin: 26. Oktober 2001
  • Englisch
  • Abmessung: 235mm x 155mm x 30mm
  • Gewicht: 822g
  • ISBN-13: 9783540427179
  • ISBN-10: 3540427171
  • Artikelnr.: 10219286
Autorenporträt
Professor Michael Leytonlehrt an der Fakultät des Center for Discrete Mathematics and Theoretical Computer Science an der Universität Rutgers. Er ist Vorsitzender der International Society for Mathematical and Computational Aesthetics und lebt in Manhattan.
Inhaltsangabe
Transfer.- Recoverability.- Mathematical Theory of Transfer, I.- Mathematical Theory of Transfer, II.- Theory of Grouping.- Robot Manipulators.- Algebraic Theory of Inheritance.- Reference Frames.- Relative Motion.- Surface Primitives.- Unfolding Groups, I.- Unfolding Groups, II.- Unfolding Groups, III.- Mechanical Design and Manufacturing.- A Mathematical Theory of Architecture.- Solid Structure.- Wreath Formulation of Splines.- Wreath Formulation of Sweep Representations.- Process Grammar.- Conservation Laws of Physics.- Music.- Against the Erlanger Program.