{"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":40,"n_cols":5,"rows_kept":40,"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],[8,2,8,3],[9,2,9,3],[12,2,12,3],[20,2,20,3],[20,4,20,5],[21,2,21,3],[21,4,21,5],[22,2,22,3],[22,4,22,5],[23,2,23,3],[24,2,24,3],[25,2,25,3],[26,2,26,3],[35,2,35,3],[36,2,36,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996464552103316"]
[null,null,"Autore",null,"Katoh Naoki"]
[null,null,"Titolo",null,"Sublinear Computation Paradigm [[electronic resource] ] : Algorithmic Revolution in the Big Data Era"]
[null,null,"Pubbl/distr/stampa",null,"Singapore, : Springer Singapore Pte. Limited, 2021"]
[null,null,"ISBN",null,"981-16-4095-5"]
[null,null,"Descrizione fisica",null,"1 online resource (403 p.)"]
[null,null,"Soggetti",null,"Algorithms & data structures"]
[{"$nulls":4},"Numerical analysis"]
[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,"Nota di contenuto",null,"Intro -- Preface -- Contents -- Part I Introduction -- 1 What Is the Sublinear Computation Paradigm? -- 1.1 We Are in the Era of Big Data -- 1.2 Theory of Computational Complexity  and Polynomial-Time Algorithms -- 1.3 Polynomial-Time Algorithms and Sublinear-Time Algorithms -- 1.3.1 A Brief History of Polynomial-Time Algorithms -- 1.3.2 Emergence of Sublinear-Time Algorithms -- 1.3.3 Property Testing and Parameter Testing -- 1.4 Ways to Decrease Computational Resources -- 1.4.1 Streaming Algorithms -- 1.4.2 Compression -- 1.4.3 Succinct Data Structures"]
[{"$nulls":4},"1.5 Need for the Sublinear Computation Paradigm -- 1.5.1 Sublinear and Polynomial Computation Are Both Important -- 1.5.2 Research Project ABD -- 1.5.3 The Organization of This Book -- References -- Part II Sublinear Algorithms -- 2 Property Testing on Graphs and Games -- 2.1 Introduction -- 2.2 Basic Terms and Definitions for Property Testing -- 2.2.1 Graphs and the Three Models for Property Testing -- 2.2.2 Properties, Distances, and Testers -- 2.3 Important Known Results in Property Testing on Graphs -- 2.3.1 Results for the Dense-Graph Model -- 2.3.2 Results for the Bounded-Degree Model"]
[{"$nulls":4},"2.3.3 Results for the General-Graph Model -- 2.4 Characterization of Testability on Bounded-Degree Digraphs -- 2.4.1 Bounded-Degree Model of Digraphs -- 2.4.2 Monotone Properties and Hereditary Properties -- 2.4.3 Characterizations -- 2.4.4 An Idea to Extend the Characterizations Beyond Monotone and Hereditary -- 2.5 Testable EXPTIME-Complete Games -- 2.5.1 Definitions -- 2.5.2 Testers for Generalized Chess, Shogi, and Xiangqi -- 2.6 Summary -- References -- 3 Constant-Time Algorithms for Continuous Optimization Problems "]
[{"$nulls":4},"-- 3.1 Introduction -- 3.2 Graph Limit Theory"]
[{"$nulls":4},"3.3 Quadratic Function Minimization -- 3.3.1 Proof of Theorem 3.1 -- 3.4 Tensor Decomposition -- 3.4.1 Preliminaries -- 3.4.2 Proof of Theorem 3.2 -- 3.4.3 Proof of Lemma 3.4 -- 3.4.4 Proof of Lemma 3.5 -- References -- 4 Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs -- 4.1 Packing and Covering Semidefinite Programs -- 4.2 Applications -- 4.2.1 SDP relaxation for Robust MaxCut -- 4.2.2 Mahalanobis Distance Learning -- 4.2.3 Related Work -- 4.3 General Framework for Packing-Covering SDPs -- 4.4 Scalar Algorithms"]
[{"$nulls":4},"4.4.1 Scalar MWU Algorithm for (Packing-I)-(Covering-I) -- 4.4.2 Scalar Logarithmic Potential Algorithm For (Packing-I)-(Covering-I) -- 4.5 Matrix Algorithms -- 4.5.1 Matrix MWU Algorithm For (Covering-II)-(Packing-II) -- 4.5.2 Matrix Logarithmic Potential Algorithm For (Packing-I)-(Covering-I) -- 4.5.3 Matrix Logarithmic Potential Algorithm For (Packing-II)-(Covering-II) -- References -- 5 Almost Linear Time Algorithms for Some Problems on Dynamic Flow Networks -- 5.1 Introduction -- 5.2 Preliminaries -- 5.3 Objective Functions -- 5.3.1 Objective Functions for the 1-Sink Problem"]
[{"$nulls":4},"5.3.2 Objective Functions for k-Sink"]
[null,null,null,"Sommario/riassunto","This open access book gives an overview of cutting-edge work on a new paradigm called the “sublinear computation paradigm,” which was proposed in the large multiyear academic research project “Foundations of Innovative Algorithms for Big Data.” That project ran from October 2014 to March 2020, in Japan. To handle the unprecedented explosion of big data sets in research, industry, and other areas of society, there is an urgent need to develop novel methods and approaches for big data analysis. To meet this need, innovative changes in algorithm theory for big data are being pursued. For example, polynomial-time algorithms have thus far been regarded as “fast,” but if a quadratic-time algorithm is applied to a petabyte-scale or larger big data set, problems are encountered in terms of computational resources or running time. To deal with this critical computational and algorithmic bottleneck, linear, sublinear, and constant time algorithms are required. The sublinear computation paradigm is proposed here in order to support innovation in the big data era. A foundation of innovative algorithms has been created by developing computational procedures, data structures, and modelling techniques for big data. The project is organized into three teams that focus on sublinear algorithms, sublinear data structures, and sublinear modelling. The work has provided high-level academic research results of strong computational and algorithmic interest, which are presented in this book. The book consists of five parts: Part I, which consists of a single chapter on the concept of the sublinear computation paradigm; Parts II, III, and IV review results on sublinear algorithms, sublinear data structures, and sublinear modelling, respectively; Part V presents application results. The information presented here will inspire the researchers who work in the field of modern algorithms."]
[null,"2.","Record Nr.",null,"UNINA9910706256503321"]
[null,null,"Autore",null,"Kinkel Arthur R (Arthur Rudolph), <1907-1986, >"]
[null,null,"Titolo",null,"Geology and base-metal deposits of West Shasta copper-zinc district, Shasta County, California / / by A. R. Kinkel, Jr., W. E. Hall, and J. P. Albers; prepared in cooperation with the State of California, Department of Natural Resources, Division of Mines"]
[null,null,"Pubbl/distr/stampa",null,"Washington : , : United States Department of the Interior, Geological Survey, , 1956"]
[null,null,"Descrizione fisica",null,"1 online resource (vi, 156 pages) : illustrations, maps + + 21 plates"]
[null,null,"Collana",null,"Geological Survey professional paper ; ; 285"]
[null,null,"Soggetti",null,"Copper ores - California - Shasta County"]
[{"$nulls":4},"Geology - California - Shasta County"]
[{"$nulls":4},"Zinc ores - California - Shasta County"]
[{"$nulls":4},"Copper ores"]
[{"$nulls":4},"Geology"]
[{"$nulls":4},"Zinc ores"]
[{"$nulls":4},"Shasta County (Calif.)"]
[{"$nulls":4},"California"]
[{"$nulls":4},"California Shasta County"]
[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","Title from title screen (viewed September 26, 2014)."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (pages 151-153) and index."]