{"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":57,"n_cols":5,"rows_kept":57,"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,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[20,2,20,3],[21,2,21,3],[24,2,24,3],[27,2,27,3],[27,4,27,5],[28,2,28,3],[28,4,28,5],[29,2,29,3],[30,2,30,3],[33,2,33,3],[34,2,34,3],[35,2,35,3],[36,2,36,3],[37,2,37,3],[49,2,49,3],[50,2,50,3],[54,2,54,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465505603316"]
[null,null,"Titolo",null,"Computing and Combinatorics [[electronic resource] ] : Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997. Proceedings. / / edited by Tao Jiang, D.T. Lee"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997"]
[null,null,"ISBN",null,"3-540-69522-2"]
[null,null,"Edizione",null,"[1st ed. 1997.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 524 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 1276"]
[null,null,"Disciplina",null,"004"]
[null,null,"Soggetti",null,"Computers"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Computer communication systems"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Discrete Mathematics"]
[{"$nulls":4},"Algorithm Analysis and Problem Complexity"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Computer Graphics"]
[{"$nulls":4},"Computer Communication Networks"]
[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,"Nota di contenuto",null,"Conflict-free access to templates of trees and hypercubes in parallel memory systems -- Many-to-one packet routing via matchings -- A multi-tree generating routing scheme using acyclic orientations -- An algorithm for Heilbronn's problem -- Optimal multiresolution polygonal approximation -- Constructing a strongly convex superhull of points -- Fast range searching with Delaunay Triangulations -- Resolution of Hartmanis' conjecture for NL-hard sparse sets -- Can large fanin circuits perform reliable computations in the presence of noise? -- On set systems with restricted intersections modulo a composite number -- Size and variable ordering of OBDDs representing threshold functions -- The performance of neighbor-joining algorithms of phylogeny reconstruction -- Inferring "]
[{"$nulls":4},"evolutionary trees with strong combinatorial evidence -- Parsimony is hard to beat! -- On the complexity of computing evolutionary trees -- Computable invariance -- Subclasses of computable real valued functions -- Computability on continuous, lower semi-continuous and upper semi-continuous real functions -- Contrast-optimal k out of n secret sharing schemes in visual cryptography -- A Rabin-type scheme based on y 2 ? x 3 + bx 2 mod n -- Optimal bidding algorithms against cheating in multiple-object auctions -- Spring algorithms and symmetry -- Generalized vertex-rankings of partial k-trees -- A selected tour of the theory of identification matrices -- Efficient domination on permutation graphs and trapezoid graphs -- On physical mapping algorithms: An error-tolerant test for the consecutive ones property -- The median problem for breakpoints in comparative genomics -- Fast algorithms for aligning sequences with restricted affine gap penalties -- A matrix representation of phylogenetic trees -- Edge and node searching problems on trees -- Construction of nearly optimal multiway trees -- Optimal algorithms for circle partitioning -- Hexagonal routing of multiterminal nets -- Design and analysis of parallel set-term unification -- On modularity of completeness in order-sorted term rewriting systems -- A three-valued quantificational logic of context -- A compact storage scheme for fast wavelet-based subregion retrieval -- A declustering algorithm for minimising spatial join cost -- Fixed topology steiner trees and spanning forests with applications in network communications -- A branch-and-bound algorithm for computing node weighted steiner minimum trees -- A complete characterization of repetitive morphisms over the two-letter alphabet -- An algorithm for identifying spliced languages -- The shapes of trees -- Tally languages accepted by alternating multitape finite automata -- Independent spanning trees of chordal rings -- Rearrangeable graphs -- Projective torus networks -- On the 100% rule of sensitivity analysis in linear programming -- Enumerating triangulations for products of two simplices and for arbitrary configurations of points -- Tree structure genetic algorithm with a nourishment mechanism -- An approach to scalability of parallel matrix multiplication algorithms -- Limited acceleration mechanism for cell loss free flow control in ATM networks -- They are just butterflies -- Mutual search -- Eigenvalues, eigenvectors, and graph partitioning -- Corrigendum: Exact learning of subclasses of CDNF formulas with membership queries."]
[null,null,null,"Sommario/riassunto","This book constitutes the refereed proceedings of the Third Annual International Computing and Combinatorics Conference, COCOON'97, held in Shanghai, China, in August 1997. The volume presents 53 revised full papers selected from a total of 106 submissions. The papers are organized in sections on parallel and distributed computing, computational geometry, complexity, computational biology, computability, cryptography and computational finance, graph algorithms, algorithms, rewriting and logic, algorithms and applications, automata languages and complexity, and mathematical programming and genetic algorithms."]
[null,"2.","Record Nr.",null,"UNINA9910484560303321"]
[null,null,"Titolo",null,"Trust and Trustworthy Computing : Third International Conference, TRUST 2010, Berlin, Germany, June 21-23, 2010, Proceedings / / edited by Alessandro Acquisti, Sean W. Smith, Ahmad-Reza Sadeghi"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010"]
[null,null,"ISBN",null,"1-280-38747-5"]
[{"$nulls":4},"9786613565396"]
[{"$nulls":4},"3-642-13869-1"]
[null,null,"Edizione",null,"[1st ed. 2010.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XIII, 441 p. 84 illus.)"]
[null,null,"Collana",null,"Security and Cryptology, , 2946-1863 ; ; 6101"]
[null,null,"Disciplina",null,"005.8"]
[null,null,"Soggetti",null,"Computer networks"]
[{"$nulls":4},"Cryptography"]
[{"$nulls":4},"Data encryption (Computer science)"]
[{"$nulls":4},"Computer programming"]
[{"$nulls":4},"Electronic data processing - Management"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computers and civilization"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"Cryptology"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"IT Operations"]
[{"$nulls":4},"Computers and Society"]
[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,"Technical Strand—Full Papers -- Beyond Kernel-Level Integrity Measurement: Enabling Remote Attestation for the Android Platform -- SBAP: Software-Based Attestation for Peripherals -- Key Attestation from Trusted Execution Environments -- Anonymous Authentication with TLS and DAA -- Group-Based Attestation: Enhancing Privacy and Management in Remote Attestation -- Towards a Trusted Mobile Desktop -- Application of Trusted Computing in Automation to Prevent Product Piracy -- Lagrangian E-Voting: Verifiability on Demand and Strong Privacy -- ?TSS – A Simplified Trusted Software Stack -- Requirements for an Integrity-Protected Hypervisor on the x86 "]
[{"$nulls":4},"Hardware Virtualized Architecture -- A DAA Scheme Using Batch Proof and Verification -- A Pairing-Based DAA Scheme Further Reducing TPM Resources -- An Anonymous Attestation Scheme with Optional Traceability -- Introducing the Trusted Virtual Environment Module: A New Mechanism for Rooting Trust in Cloud Computing -- SegSlice: Towards a New Class of Secure Programming Primitives for Trustworthy Platforms -- Technical Strand—Short Papers -- Escrowed Data and the Digital Envelope -- Engineering Attestable Services -- Dynamic Enforcement of Platform Integrity -- An Improved Memory Integrity Protection Scheme -- Robust Combiners for Software Hardening -- The PUF Promise -- Socio-Economic Strand -- Privacy Requirements Engineering for Trustworthy e-Government Services -- Can Competitive Insurers Improve Network Security? -- Nudge: Intermediaries’ Role in Interdependent Network Security -- How the Public Views Strategies Designed to Reduce the Threat of Botnets -- Axiomatic and Behavioural Trust -- The Leap of Faith from Online to Offline: An Exploratory Study of Couchsurfing.org -- The Role of Soft Information in Trust Building: Evidence from OnlineSocial Lending -- Software on the Witness Stand: What Should It Take for Us to Trust It? -- Workshop on Trust in the Cloud -- Token-Based Cloud Computing -- Workshop on Security Hardware -- Oblivious Transfer Based on Physical Unclonable Functions."]
[null,null,null,"Sommario/riassunto","This volume contains the proceedings of the Third International Conference on Trust and Trustworthy Computing (TRUST), held at the Ritz-Carlton hotel in Berlin, Germany, June 21–23, 2010. TRUST is a rapidly growing forum for research on the technical and soc- economic aspects of trustworthy infrastructures. TRUST provides an interdis- plinary forum for researchers, practitioners, and decision makers to explore new ideas and discuss experiences in building, designing, using, and understanding trustworthy computing systems. The third edition of TRUST welcomed manuscripts in two di?erent tracks: a Technical Strand and a Socio-economic Strand. We assembled an engaging program with 21 peer-reviewed technical papers and nine peer-reviewed soc- economic papers; eight keynotes from industry, academia, and government; and panel discussions on privacy and standards. In addition, this year, TRUST was co-located with four workshops: Trust in Cloud, Hardware Security, Emerging and Future Risks, and Anonymous Signatures. We would like to thank numerous individuals for their e?ort and contri- tion to the conference and for making TRUST 2010 possible: the Organizing Committee members—Nadine Palacios and Marcel Winandy—for their trem- dous help with all aspects of the organization;the Technicaland Socio-economic Program Committee members, whose names are listed on the following pages, together with the names of external reviewers who helped us in the process of selecting manuscripts to be included in the conference proceedings; the keynote and invited speakers; and the invited panel speakers."]