{"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":42,"n_cols":5,"rows_kept":42,"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],[9,2,9,3],[10,2,10,3],[11,2,11,3],[12,2,12,3],[15,2,15,3],[15,4,15,5],[16,2,16,3],[16,4,16,5],[17,2,17,3],[19,2,19,3],[22,2,22,3],[23,2,23,3],[24,2,24,3],[25,2,25,3],[29,2,29,3],[30,2,30,3],[34,2,34,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA990003793140403321"]
[null,null,"Autore",null,"Humble, John William"]
[null,null,"Titolo",null,"La direzione per obiettivi : una nuova tecnica direzionale per migliorare i risultati aziendali / John W. Humble ; traduzione di Paolo Morganti"]
[null,null,"Pubbl/distr/stampa",null,"Milano, : FrancoAngeli, 1987, 2002"]
[null,null,"ISBN",null,"88-204-2286-7"]
[null,null,"Descrizione fisica",null,"226 p. : tav. ; 22 cm"]
[null,null,"Collana",null,"Formazione permanente . Sez. 1 , Problemi d'oggi ; 7"]
[null,null,"Disciplina",null,"658.401 2"]
[{"$nulls":4},"658.4"]
[null,null,"Locazione",null,"BFS"]
[null,null,"Collocazione",null,"658.4012 HUM 1 $b2881"]
[null,null,"Lingua di pubblicazione",null,"Italiano"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Trad. di Improving Business Results"]
[null,"2.","Record Nr.",null,"UNINA9910815777903321"]
[null,null,"Titolo",null,"Advances in network complexity / / edited by Matthias Dehmer, Abbe Mowshowitz and Frank Emmert-Streib"]
[null,null,"Pubbl/distr/stampa",null,"Weinheim, : Wiley-Blackwell, c2013"]
[{"$nulls":4},"Weinheim [Germany] : , : Wiley-Blackwell, , 2013"]
[null,null,"ISBN",null,"3-527-67048-3"]
[{"$nulls":4},"3-527-67046-7"]
[{"$nulls":4},"3-527-67047-5"]
[null,null,"Descrizione fisica",null,"1 online resource (xiv, 293 pages) : illustrations"]
[null,null,"Collana",null,"Quantitative and network biology ; ; vol. 4"]
[null,null,"Disciplina",null,"003.72"]
[null,null,"Soggetti",null,"System analysis"]
[{"$nulls":4},"Computational complexity"]
[{"$nulls":4},"Network analysis (Planning) - Mathematical models"]
[{"$nulls":4},"Graph theory"]
[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","Formerly CIP."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Advances in Network Complexity; Contents; Preface; List of Contributors; 1 Functional Complexity Based on Topology; 1.1 Introduction; 1.2 A Measure for the Functional Complexity of Networks; 1.2.1 Topological Equivalence of LCE-Graphs; 1.2.2 Vertex Resolution Patterns; 1.2.3 Kauffman States for Link Invariants; 1.2.4 Definition of the Complexity Measure; 1.3 Applications; 1.3.1 Creation of a Loop; 1.3.2 Networks of Information; 1.3.3 Transport Networks of Cargo; 1.3.4 Boolean Networks of Gene Regulation; 1.3.5 Topological Quantum Systems; 1.3.6 Steering Dynamics Stored in Knots and Links"]
[{"$nulls":4},"1.4 ConclusionsReferences; 2 Connections Between Artificial Intelligence and Computational Complexity and the Complexity of Graphs; 2.1 Introduction; 2.2 Representation Methods; 2.3 Searching Methods; 2.4 Turing Machines; 2.5 Fuzzy Logic and Fuzzy Graphs; 2.6 Fuzzy Optimization; 2.7 Fuzzy Systems; 2.8 Problems Related to AI; 2.9 Topology of Complex Networks; 2.10 Hierarchies; 2.10.1 Deterministic Case; 2.10.2 Nondeterministic Case; 2.10.3 Alternating Case; 2.11 Graph Entropy; 2.12 Kolmogorov Complexity; 2.13 Conclusion; References"]
[{"$nulls":4},"3 Selection-Based Estimates of Complexity Unravel Some Mechanisms and Selective Pressures Underlying the Evolution of Complexity in "]
[{"$nulls":4},"Artificial Networks3.1 Introduction; 3.2 Complexity and Evolution; 3.3 Macroscopic Quantification of Organismal Complexity; 3.4 Selection-Based Methods of Complexity; 3.5 Informational Complexity; 3.6 Fisher Geometric Model; 3.7 The Cost of Complexity; 3.8 Quantifying Phenotypic Complexity; 3.8.1 Mutation-Based Method: Mutational Phenotypic Complexity (MPC); 3.8.2 Drift Load Based Method: Effective Phenotypic Complexity (EPC)"]
[{"$nulls":4},"3.8.3 Statistical Method: Principal Component Phenotypic Complexity (PCPC)3.9 Darwinian Adaptive Neural Networks (DANN); 3.10 The Different Facets of Complexity; 3.11 Mechanistic Understanding of Phenotypic Complexity; 3.12 Selective Pressures Acting on Phenotypic Complexity; 3.13 Conclusion and Perspectives; References; 4 Three Types of Network Complexity Pyramid; 4.1 Introduction; 4.2 The First Type: The Life's Complexity Pyramid (LCP); 4.3 The Second Type: Network Model Complexity Pyramid; 4.3.1 The Level-7: Euler (Regular) Graphs; 4.3.2 The Level-6: Erd€os-R enyi Random Graph"]
[{"$nulls":4},"4.3.3 The Level-5: Small-World Network and Scale-Free Models4.3.4 The Level-4: Weighted Evolving Network Models; 4.3.5 The Bottom Three Levels of the NMCP; 4.3.5.1 The Level-3: The HUHPNM; 4.3.5.2 The Level-2: The LUHNM; 4.3.5.3 The Level-1: The LUHNM-VSG; 4.4 The Third Type: Generalized Farey Organized Network Pyramid; 4.4.1 Construction Method of the Generalized Farey Tree Network (GFTN); 4.4.2 Main Results of the GFTN; 4.4.2.1 Degree Distribution; 4.4.2.2 Clustering Coefficient; 4.4.2.3 Diameter and Small World; 4.4.2.4 Degree-Degree Correlations; 4.4.3 Weighted Property of GFTN"]
[{"$nulls":4},"4.4.4 Generalized Farey Organized Network Pyramid (GFONP)"]
[null,null,null,"Sommario/riassunto","A well-balanced overview of mathematical approaches to complex systems ranging from applications in chemistry and ecology to basic research questions on network complexity. Matthias Dehmer, Abbe Mowshowitz, and FrankEmmert-Streib, well-known pioneers in the fi eld, have edited this volume with a view to balancing classical and modern approaches to ensure broad coverage of contemporary research problems.The book is a valuable addition to the literature and a must-have for anyone dealing with network compleaity and complexity issues."]