{"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":41,"n_cols":5,"rows_kept":41,"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],[17,2,17,3],[18,2,18,3],[22,2,22,3],[24,2,24,3],[24,4,24,5],[25,2,25,3],[25,4,25,5],[26,2,26,3],[26,4,26,5],[27,2,27,3],[29,2,29,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[36,2,36,3],[37,2,37,3],[39,2,39,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466273403316"]
[null,null,"Titolo",null,"Distributed Computing [[electronic resource] ] : 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010, Proceedings / / edited by Nancy A. Lynch, Alexander A. Shvartsman"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010"]
[null,null,"ISBN",null,"3-642-15763-7"]
[null,null,"Edizione",null,"[1st ed. 2010.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XV, 532 p. 85 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 6343"]
[null,null,"Disciplina",null,"004.6"]
[null,null,"Soggetti",null,"Computer networks"]
[{"$nulls":4},"Software engineering"]
[{"$nulls":4},"Application software"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer programming"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Computer and Information Systems Applications"]
[{"$nulls":4},"Programming Techniques"]
[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,"The 2010 Edsger W. Dijkstra Prize in Distributed Computing -- The 2010 Edsger W. Dijkstra Prize in Distributed Computing -- Invited Lecture I: Consensus (Session 1a) -- The Power of Abstraction -- Fast Asynchronous Consensus with Optimal Resilience -- Transactions (Session 1b) -- Transactions as the Foundation of a Memory Consistency Model -- The Cost of Privatization -- A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware -- Window-Based Greedy Contention Management for Transactional Memory -- Shared Memory Services and Concurrency (Session 1c) -- Scalable Flat-Combining Based Synchronous Queues -- Fast Randomized Test-and-Set and Renaming -- Concurrent Computing and Shellable Complexes -- Brief Announcements I (Session 1d) -- Brief Announcement: Hybrid Time-Based Transactional Memory -- Brief Announcement: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency -- Brief Announcement: Fast Local-Spin Abortable Mutual Exclusion with Bounded Space -- Wireless Networks "]
[{"$nulls":4},"(Session 1e) -- What Is the Use of Collision Detection (in Wireless Networks)? -- Deploying Wireless Networks with Beeps -- Distributed Contention Resolution in Wireless Networks -- A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks -- Brief Announcements II (Session 1f) -- Brief Announcement: Simple Gradecast Based Algorithms -- Brief Announcement: Decentralized Network Bandwidth Prediction -- Brief Announcement: Synchronous Las Vegas URMT Iff Asynchronous Monte Carlo URMT -- Invited Lecture II: Best Student Paper (Session 2a) -- Foundations of Speculative Distributed Computing -- Anonymous Asynchronous Systems: The Case of Failure Detectors -- Consensus and Leader Election (Session 2b) -- The Computational Structure of Progress Conditions -- Scalable Quantum Consensus for Crash Failures -- How Much Memory Is Needed for Leader Election -- Leader Election Problem versus Pattern Formation Problem -- Mobile Agents (Session 2c) -- Rendezvous of Mobile Agents in Directed Graphs -- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids -- Exclusive Perpetual Ring Exploration without Chirality -- Drawing Maps with Advice -- Invited Lecture III: Wireless Networks (Session 3a) -- Network-Aware Distributed Algorithms: Challenges and Opportunities in Wireless Networks -- Connectivity Problem in Wireless Networks -- Computing in Wireless and Mobile Networks (Session 3b) -- Trusted Computing for Fault-Prone Wireless Networks -- Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony -- Brief Announcements III (Session 3c) -- Brief Announcement: Failure Detectors Encapsulate Fairness -- Brief Announcement: Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems - A Case Study -- Brief Announcement: On Reversible and Irreversible Conversions -- Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting -- Brief Announcement: Flash-Log – A High Throughput Log -- Brief Announcement: New Bounds for Partially Synchronous Set Agreement -- Modeling Issues and Adversity (Session 3d) -- It’s on Me! The Benefit of Altruism in BAR Environments -- Beyond Lamport’s Happened-Before: On the Role of Time Bounds in Synchronous Systems -- On the Power of Non-spoofing Adversaries -- Implementing Fault-Tolerant Services Using State Machines: Beyond Replication -- Self-stabilizing and Graph Algortihms (Session 3e) -- Low Communication Self-stabilization through Randomization -- Fast Self-stabilizing Minimum Spanning Tree Construction -- The Impact of Topology on Byzantine Containment in Stabilization -- Minimum Dominating Set Approximation in Graphs of Bounded Arboricity -- Brief Announcements IV (Session 3f) -- Brief Announcement: Sharing Memory in a Self-stabilizing Manner -- Brief Announcement: Stabilizing Consensus with the Power of Two Choices."]
[null,"2.","Record Nr.",null,"UNINA9911009160603321"]
[null,null,"Autore",null,"IAEA"]
[null,null,"Titolo",null,"Monitoring Stable Nitrogen and Oxygen Isotope Compositions of Nitrate in Atmospheric Precipitation : Final Report of a Coordinated Research Project"]
[null,null,"Pubbl/distr/stampa",null,"Vienna : , : International Atomic Energy Agency, , 2024"]
[{"$nulls":4},"©2024"]
[null,null,"ISBN",null,"9789201161246"]
[{"$nulls":4},"9789201160249"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (46 pages)"]
[null,null,"Collana",null,"IAEA TECDOC Series No Series ; ; v.2050"]
[null,null,"Soggetti",null,"Data encryption (Computer science)"]
[{"$nulls":4},"Cryptography"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Intro -- Blank Page."]
[null,null,null,"Sommario/riassunto","This book appears to be a technical manual or guide focusing on the implementation and usage of the AES (Advanced Encryption Standard) algorithm, a widely-used method for securing digital information. The mention of 'PyCryptodome' suggests that the text includes instructions or discussions related to cryptographic libraries in Python, which are essential for developers and professionals working with data encryption. The book likely aims to provide practical guidance, troubleshooting tips, and solutions for common issues encountered when implementing AES in software applications. It is intended for an audience of software developers, IT professionals, and cybersecurity experts who require a deeper understanding of data encryption techniques and their applications."]