{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":39,"n_cols":5,"rows_kept":39,"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],[3,4,3,5],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[11,2,11,3],[12,2,12,3],[14,2,14,3],[14,4,14,5],[15,2,15,3],[15,4,15,5],[16,2,16,3],[16,4,16,5],[17,2,17,3],[18,2,18,3],[21,2,21,3],[22,2,22,3],[24,2,24,3],[26,2,26,3],[27,2,27,3],[31,2,31,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISALENTO991000903129707536"]
[null,null,"Autore",null,"Conference on Computer Applications and Quantitative Methods in Archaeology (28th : 2000 : Ljubljana, Slovenia)"]
[null,null,"Titolo"]
[{"$nulls":4},"Computing archaeology for understanding the past CAA 2000 : computer applications and quantitative methods in archaeology : proceedings of the 28th Conference, Ljubljana, April 2000 / ed. by Zoran Stancic, Tatjana Veljanovski"]
[null,null,"Pubbl/distr/stampa",null,"Oxford : Archaeopress, c2001"]
[null,null,"ISBN",null,"1841712256"]
[null,null,"Descrizione fisica",null,"VII, 368 p. : ill. ; 30 cm."]
[null,null,"Collana",null,"BAR international series ; 931."]
[null,null,"Soggetti",null,"Archeologia - Uso della statistica - Congressi"]
[{"$nulls":4},"Archeologia - Statistica - Uso nell'archeologia - Congressi"]
[{"$nulls":4},"Archeologia - Matematica - Congressi"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNINA9910779283803321"]
[null,null,"Autore",null,"Schott René"]
[null,null,"Titolo",null,"Operator calculus on graphs [[electronic resource] ] : theory and applications in computer science / / René Schott, G. Stacey Staples"]
[null,null,"Pubbl/distr/stampa",null,"London, : Imperial College Press, 2012"]
[null,null,"ISBN",null,"1-280-66906-3"]
[{"$nulls":4},"9786613645999"]
[{"$nulls":4},"1-84816-877-2"]
[null,null,"Descrizione fisica",null,"1 online resource (428 p.)"]
[null,null,"Disciplina",null,"515"]
[{"$nulls":4},"515.72"]
[null,null,"Soggetti",null,"Calculus"]
[{"$nulls":4},"Computer science - Mathematics"]
[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","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Preface; Acknowledgments; Contents; Combinatorial Algebras and Their Properties; 1. Introduction; 1.1 Notational Preliminaries; 2. Combinatorial Algebra; 2.1 Six Group and Semigroup Algebras; 2.1.1 The group of blades Bp,q; 2.1.1.1 Involutions; 2.1.1.2 The n-dimensional hypercube Qn; 2.1.2 The abelian blade group Bp,q sym; 2.1.3 The null blade semigroup; 2.1.4 The abelian null blade semigroup  sym; 2.1.5 The semigroup of idempotent blades  idem; 2.1.6 The path semigroup  n; 2.1.7 Summary; 2.1.7.1 Algebras I-IV; 2.1.7.2 Algebra V; 2.1.7.3 Algebra VI; 2.2 Clifford and Grassmann Algebras"]
[{"$nulls":4},"2.2.1 Grassmann (exterior) algebras2.2.2 Clifford algebras; 2.2.3 Operator calculus on Clifford algebras; 2.3 The Symmetric Clifford Algebra  sym; 2.4 The Idempotent-Generated Algebra  idem; 2.5 The n-Particle Zeon Algebra  nil; 2.6 Generalized Zeon Algebras; 3. Norm Inequalities on Clifford Algebras; 3.1 Norms on C p; q; 3.2 Generating Functions; 3.3 Clifford Matrices and the Clifford-Frobenius Norm; 3.4 Powers of Clifford Matrices; Combinatorics and Graph Theory; 4. Specialized Adjacency Matrices; 4.1 Essential Graph Theory; 4.2 Clifford Adjacency Matrices; 4.3 Nilpotent Adjacency Matrices"]
[{"$nulls":4},"4.3.1 Euler circuits4.3.2 Conditional branching; 4.3.3 Time-homogeneous random walks on finite graphs; 5. Random Graphs; 5.1 Preliminaries; 5.2 Cycles in Random Graphs; 5.3 Convergence of Moments; 6. Graph Theory and Quantum Probability; 6.1 Concepts; "]
[{"$nulls":4},"6.1.1 Operators as random variables; 6.1.2 Operators as adjacency matrices; 6.2 From Graphs to Quantum Random Variables; 6.2.1 Nilpotent adjacency operators in infinite spaces; 6.2.2 Decomposition of nilpotent adjacency operators; 6.3 Connected Components in Graph Processes; 6.3.1 Algebraic preliminaries; 6.3.2 Connected components"]
[{"$nulls":4},"6.3.2.1 (k, d)-components6.3.3 Second quantization of graph processes; 7. Geometric Graph Processes; 7.1 Preliminaries; 7.2 Dynamic Graph Processes; 7.2.1 Vertex degrees in Gn; 7.2.2 Energy and Laplacian energy of geometric graphs; 7.2.3 Convergence conditions and a limit theorem; 7.3 Time-Homogeneous Walks on Random Geometric Graphs; Probability on Algebraic Structures; 8. Time-Homogeneous Random Walks; 8.1  sym and Random Walks on Hypercubes; 8.2 Multiplicative Walks on C p,q; 8.2.1 Walks on directed hypercubes; 8.2.2 Random walks on directed hypercubes with loops"]
[{"$nulls":4},"8.2.3 Properties of multiplicative walks8.3 Induced Additive Walks on C p,q; 8.3.1 Variance of  N; 8.3.2 Variance of; 8.3.3 Central limit theorems; 9. Dynamic Walks in Clifford Algebras; 9.1 Preliminaries; 9.2 Expectation; 9.3 Limit Theorems; 9.3.1 Conditions for convergence; 9.3.2 Induced additive walks; 9.3.3 Central limit theorem; 10. Iterated Stochastic Integrals; 10.1 Preliminaries; 10.2 Stochastic Integrals in; 10.3 Graph-Theoretic Iterated Stochastic Integrals; 10.3.1 Functions on partitions; 10.3.2 The Clifford evolution matrix; 10.3.3 Orthogonal polynomials"]
[{"$nulls":4},"11. Partition-Dependent Stochastic Measures"]
[null,null,null,"Sommario/riassunto","This pioneering book presents a study of the interrelationships among operator calculus, graph theory, and quantum probability in a unified manner, with significant emphasis on symbolic computations and an eye toward applications in computer science. Presented in this book are new methods, built on the algebraic framework of Clifford algebras, for tackling important real world problems related, but not limited to, wireless communications, neural networks, electrical circuits, transportation, and the world wide web. Examples are put forward in Mathematica throughout the book, together with pack"]