{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":28,"n_cols":5,"rows_kept":28,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[20,2,20,3],[21,2,21,3],[25,2,25,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466018303316"]
[null,null,"Autore",null,"Leyton Michael"]
[null,null,"Titolo",null,"A Generative Theory of Shape [[electronic resource] /] / by Michael Leyton"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001"]
[null,null,"ISBN",null,"3-540-45488-8"]
[null,null,"Edizione",null,"[1st ed. 2001.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XV, 549 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 2145"]
[null,null,"Disciplina",null,"516"]
[null,null,"Soggetti",null,"Optical data processing"]
[{"$nulls":4},"Geometry"]
[{"$nulls":4},"Application software"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Group theory"]
[{"$nulls":4},"Computer-aided engineering"]
[{"$nulls":4},"Image Processing and Computer Vision"]
[{"$nulls":4},"Computer Applications"]
[{"$nulls":4},"Computer Graphics"]
[{"$nulls":4},"Group Theory and Generalizations"]
[{"$nulls":4},"Computer-Aided Engineering (CAD, CAE) and Design"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"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."]
[null,null,null,"Sommario/riassunto","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 "]
[{"$nulls":4},"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."]