| Part I GeneralElements1.1 Top Systems Conferences/Journals1.2 How to Read a Research Paper1.3 How to Write a Research Paper1.3.1 Abstract1.3.2 Introduction1.3.3 Background Information/Problem Statement1.3.4 Your Approach1.3.5 Implementation1.3.6 Performance Evaluation1.3.7 Related Work1.3.8 Conclusions1.3.9 Acknowledgement1.3.10 References1.3.11 Most Common Mistakes in Paper Writing 1.4 How to Give a Presentation 1.4.1 General Approach1.4.2 Understanding the Paper1.4.3 Adapting the Paper for Presentation1.4.4 Slides1.4.5 The Dry-Run1.4.6 To Memorize or not to Memorize? 1.4.7 You Are on the Stage1.4.8 Interacting with the Audience and Dealing with Questions1.5 Final Words: On Being a Scientist References2 Rules of Thumb 2.1 Rules of Thumb2.2 Further ReadingsReferencesPart Ⅱ Design3 Bloom Filters3.1 Introduction3.2 Standard Bloom Filters 3.2.1 Basic Idea of Bloom Filters3.2.2 False Positive Rate Estimation3.2.3 Optimal Number of Hash Functions3.2.4 Another Method of Implementing3.3 Counting Bloom Filters3.4 Compressed Bloom Filters3.5 D-left Counting Bloom Filters3.5.1 D-left Hashing3.5.2 D-left Counting Bloom Filters3.5.3 Performance3.6 Spectral Bloom Filters3.6.1 Basic Principle of SBF3.6.2 SBF Frequency Query Optimization3.7 Dynamic Counting Bloom Filters 3.8 Case Studies3.8.1 Case Study 1: Summary Cache 3.8.2 Case Study 2: IP Traceback3.9 Conclusion.References4 Distributed Hash Tables4.1 Introduction4.2 An Overview of DHT4.3 The Overlay Network of DHT4.4 Chord: An Implementation of DHT.4.4.1 Topology of Chord4.4.2 Key Lookup in Chord4.4.3 Dynamic Updates and Failure Recovery 4.5 Case Study 1: Cooperative Domain Name System (CoDoNS)4.5.1 Background and Motivation4.5.2 Overview of the System4.5.3 DHT in CoDoNS4.5.4 Evaluation4.6 Case Study 2: Cooperative File System (CFS)4.6.1 Background and Motivation.4.6.2 Overview of the System4.6.3 DHT in CFS4.6.4 EvaluationReferences5 Locality Sensitive Hashing5.1 Introduction 5.1.1 Basic Idea of LSH 5.1.2 The Origin of LSH5.2 Overview.5.2.1 The Definition5.2.2 Properties of LSH5.2.3 Several LSH Families5.2.4 Approximate Nearest Neighbor 5.3 Case Study 1: Large-Scale Sequence Comparison5.3.1 Theory5.3.2 Algorithm Complexity 5.3.3 Implementation Details5.3.4 Results5.4 Case Study 2: Image Retrieval5.4.1 Motivation5.4.2 The Problems of Existing Approaches5.4.3 The System5.4.4 ResultsReferences 6 XOR Operations6.1 Introduction6.2 XOR Operation6.2.1 Truth Table6.2.2 Set Diagrams6.3 XOR Properties6.4 Compress with XOR6.4.1 Case Study 1: XOR-linked list6.4.2 Case Study 2: XOR swap algorithm.6.5 Fault Tolerance6.5.1 Case Study 3: Hamming (7,4) code6.5.2 Hamming Codes with Additional Parity 6.5.3 Case Study 4: RAID6.6 Case Study 5: Feistel Cipher6.7 Case Study 6: Kademlia6.7.1 XOR Metric in Kademlia6.7.2 Routing Table in Kademlia6.7.3 Kademlia Protocol6.8 Conclusion.References7 Adaptation8 Optimistic Replication.9 Reputation and Trust10 Moving AveragePart Ⅲ ImplementationPart Ⅳ Evalution |
内容加载中，请稍后...
商品评论（0条）