musicbug的专栏

总计225M，18章，1000多页，这是第十二章 CHAPTER 12. VOLUME SCATTERING

总计225M，18章，1000多页，这是第十一章压缩包1，共两个 CHAPTER 11. TEXTURE

Acknowledgments Introduction Part I: Basics Chapter 1: Using Geographical Information Chapter 2: The Google Local Interface Chapter 3: The Google Maps API Chapter 4: The Google Web API Chapter 5: Storing and Sharing Information Part II: Instant Gratification Chapter 6:Working with Existing Address Information Chapter 7: Extending the Google API Examples Chapter 8: Discovering Overlays and Mash-ups Part III: Google Maps Hacks Chapter 9: Using Overlays Chapter 10: Overlaying Statistical Data Chapter 11: Building a Community Site Chapter 12: The Realtors and Archaeologists Toolkit Chapter 13: I Need to Get To Chapter 14: Merging with Flickr Photos Part IV: Google Earth Hacks Chapter 15: Introducing Google Earth Chapter 16: Generating Google Earth Feeds Chapter 17: History and Planning with Google Earth Appendix: Resources Index

自行车历史，动力学理论，设计。方方面面，将近500页。很难得的资料。 Contents Preface VII HUMAN POWER 1 A short history of bicycling 3 2 Human power generation 37 3 Thermal effects on power production (how bicyclists keep cool) 109 II SOME BICYCLE PHYSICS 4 Power and speed 123 5 Bicycle aerodynamics 173 6 Rolling: tires and bearings 207 7 Braking 237 8 Steering and balancing 263 9 Mechanics and mechanisms: power transmission 311 10 Materials and stresses 353 III HUMAN-POWERED VEHICLES AND MACHINES 11 Unusual human-powered machines 399 12 Human-powered vehicles in the future 431 Appendix 457 Timeline 465 Index 473

总计225M，1000多页，这是第十章 CHAPTER 10. MATERIALS BSDFs BSDF Memory Management Material Interface and Implementations Matte Plastic Additional Materials Bump Mapping Further Reading Exercises

总计225M，1000多页，这是第九章 CHAPTER 09. REFLECTION MODELS

总计225M，1000多页，这是第八章 CHAPTER 08. FILM AND THE IMAGING PIPELINE

总计225M，1000多页，这是第七章 CHAPTER 07. SAMPLING AND RECONSTRUCTION

总计225M，1000多页，这是第六章 CHAPTER 06. CAMERA MODELS

总计225M，1000多页，这是第五章 CHAPTER 05. COLOR AND RADIOMETRY

总计225M，1000多页，这是第四章 CHAPTER 04. PRIMITIVES AND INTERSECTION ACCELERATION

总计225M，1000多页，这是第三章 CHAPTER 03. SHAPES

总计225M，1000多页，这是第二章 CHAPTER 02. GEOMETRY AND TRANSFORMATIONS

总计225M，1000多页，这是 第一章 01 INTRODUCTION 1.1 LITERATE PROGRAMMING ... ...

这是我研究最小外接圆问题时搜罗到的，不敢独享。资料很不错地

图像检索的硕士论文，很详细描述相关技术渊源

本书的第二版获得2002年美国《游戏开发者》杂志的前沿奖，这是第三版，英文djvu的

线性代数,Jim Hefferon,非扫描版

迭代解稀疏线性方程组，有很多种方法。很全面 Iterative Methods for Sparse Linear Systems Preface to the Second Edition; Preface to the First Edition; Chapter 1: Background in Linear Algebra; Chapter 2: Discretization of Partial Differential Equations; Chapter 3: Sparse Matrices; Chapter 4: Basic Iterative Methods; Chapter 5: Projection Methods; Chapter 6: Krylov Subspace Methods, Part I; Chapter 7: Krylov Subspace Methods, Part II; Chapter 8: Methods Related to the Normal Equations; Chapter 9: Preconditioned Iterations; Chapter 10: Preconditioning Techniques; Chapter 11: Parallel Implementations; Chapter 12: Parallel Preconditioners; Chapter 13: Multigrid Methods; Chapter 14: Domain Decomposition Methods; Bibliography; Index.

用能量法造型。是微软研究院的论文。

Head First Design Patterns 2008版(英文，全681页，高清)

　本书介绍了35个著名数学问题的极富创造性和独具匠心的证明。其中有些证明不仅想法奇特、构思精巧，作为一个整体更是天衣无缝。难怪，西方有些虔诚的数学家将这类杰作比喻为上帝的创造。这不是一本教科书, 也不是一本专著，而是一本开阔数学视野和提高数学修养的著作。希望每一个数学爱好者都会喜欢这本书，并且从中学到许多东西。. 　　本书的英文原著第一版于1998年出版。随即受到数学界的广泛好评，并被陆续翻译成了十余种不同的文字，其中包括法文、德文、意大利文、日文、西班牙文和俄文等。...

Contents 1 Overview Anne Kao and Stephen R. Poteet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2 Extracting Product Features and Opinions from Reviews Ana-Maria Popescu and Oren Etzioni . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3 Extracting Relations from Text: From Word Sequences to Dependency Paths Razvan C. Bunescu and Raymond J. Mooney . . . . . . . . . . . . . . . . . . . . . . . . 29 4 Mining Diagnostic Text Reports by Learning to Annotate Knowledge Roles Eni Mustafaraj, Martin Hoof, and Bernd Freisleben . . . . . . . . . . . . . . . . . . 45 5 A Case Study in Natural Language Based Web Search Giovanni Marchisio, Navdeep Dhillon, Jisheng Liang, Carsten Tusk, Krzysztof Koperski, Thien Nguyen, Dan White, and Lubos Pochman . . . . 69 6 Evaluating Self-Explanations in iSTART: Word Matching, Latent Semantic Analysis, and Topic Models Chutima Boonthum, Irwin B. Levinstein, and Danielle S. McNamara . . . 91 7 Textual Signatures: Identifying Text-Types Using Latent Semantic Analysis to Measure the Cohesion of Text Structures Philip M. McCarthy, Stephen W. Briner, Vasile Rus, and Danielle S. McNamara . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 8 Automatic Document Separation: A Combination of Probabilistic Classification and Finite-State Sequence Modeling Mauritius A. R. Schmidtler, and Jan W. Amtrup . . . . . . . . . . . . . . . . . . . . 123 9 Evolving Explanatory Novel Patterns for Semantically- Based Text Mining John Atkinson . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145 10 Handling of Imbalanced Data in Text Classification: Category-Based Term Weights Ying Liu, Han Tong Loh, Kamal Youcef-Toumi, and Shu Beng Tor . . . . 171 11 Automatic Evaluation of Ontologies Janez Brank, Marko Grobelnik, and Dunja Mladeni´c . . . . . . . . . . . . . . . . . 193 12 Linguistic Computing with UNIX Tools Lothar M. Schmitt, Kiel Christianson, and Renu Gupta . . . . . . . . . . . . . . . 221 Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 259

2009年新书，非扫描 Contents List of Figures xiii List of Tables xix Introduction xxi About the Editors xxvii Contributor List xxix 1 Analysis of Text Patterns Using Kernel Methods 1 Marco Turchi, Alessia Mammone, and Nello Cristianini 1.1 Introduction . . . . . . . . . . . . . . . 1 1.2 General Overview on Kernel Methods . . . . . . . 1 1.2.1 Finding Patterns in Feature Space . . . . . . . . . . . 5 1.2.2 Formal Properties of Kernel Functions . . . . . . . . . 8 1.2.3 Operations on Kernel Functions . . . . . . . . . . . . 10 1.3 Kernels for Text . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.3.1 Vector SpaceModel . . . . . . . . . . . . . . . . . . . 11 1.3.2 Semantic Kernels . . . . . . . . . . . . . . . . . . . . . 13 1.3.3 String Kernels . . . . . . . . . . . . . . . . . . . . . . 17 1.4 Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 1.5 Conclusion and Further Reading . . . . . . . . . . . . . . . . 22 2 Detection of Bias in Media Outlets with Statistical Learning Methods 27 Blaz Fortuna, Carolina Galleguillos, and Nello Cristianini 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 2.2 Overview of the Experiments . . . . . . . . . . . . . . . . . . 29 2.3 Data Collection and Preparation . . . . . . . . . . . . . . . . 30 2.3.1 Article Extraction from HTML Pages . . . . . . . . . 31 2.3.2 Data Preparation . . . . . . . . . . . . . . . . . . . . . 31 2.3.3 Detection of Matching News Items . . . . . . . . . . . 32 2.4 News Outlet Identification . . . . . . . . . . . . . . . . . . . . 35 2.5 Topic-Wise Comparison of Term Bias . . . . . . . . . . . . . 38 2.6 News OutletsMap . . . . . . . . . . . . . . . . . . . . . . . . 40 2.6.1 Distance Based on Lexical Choices . . . . . . . . . . . 42 vii © 2009 by Taylor and Francis Group, LLC viii 2.6.2 Distance Based on Choice of Topics . . . . . . . . . . 43 2.7 RelatedWork . . . . . . . . . . . . . . . . . . . . . . . . . . . 44 2.8 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 2.9 Appendix A: Support Vector Machines . . . . . . . . . . . . . 48 2.10 Appendix B: Bag of Words and Vector Space Models . . . . . 48 2.11 Appendix C: Kernel Canonical Correlation Analysis . . . . . 49 2.12 Appendix D: Multidimensional Scaling . . . . . . . . . . . . . 50 3 Collective Classification for Text Classification 51 Galileo Namata, Prithviraj Sen, Mustafa Bilgic, and Lise Getoor 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 3.2 Collective Classification: Notation and Problem Definition . . 53 3.3 Approximate Inference Algorithms for Approaches Based on Local Conditional Classifiers . . . . . . . . . . . . . . . . . . . 53 3.3.1 Iterative Classification . . . . . . . . . . . . . . . . . . 54 3.3.2 Gibbs Sampling . . . . . . . . . . . . . . . . . . . . . . 55 3.3.3 Local Classifiers and Further Optimizations . . . . . . 55 3.4 Approximate Inference Algorithms for Approaches Based on Global Formulations . . . . . . . . . . . . . . . . . . . . . . . 56 3.4.1 Loopy Belief Propagation . . . . . . . . . . . . . . . . 58 3.4.2 Relaxation Labeling via Mean-Field Approach . . . . 59 3.5 Learning the Classifiers . . . . . . . . . . . . . . . . . . . . . 60 3.6 Experimental Comparison . . . . . . . . . . . . . . . . . . . . 60 3.6.1 Features Used . . . . . . . . . . . . . . . . . . . . . . . 60 3.6.2 Real-World Datasets . . . . . . . . . . . . . . . . . . . 60 3.6.3 Practical Issues . . . . . . . . . . . . . . . . . . . . . . 63 3.7 RelatedWork . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 3.8 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 3.9 Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . 66 4 Topic Models 71 David M. Blei and John D. Lafferty 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 4.2 Latent Dirichlet Allocation . . . . . . . . . . . . . . . . . . . 72 4.2.1 Statistical Assumptions . . . . . . . . . . . . . . . . . 73 4.2.2 Exploring a Corpus with the Posterior Distribution . . 75 4.3 Posterior Inference for LDA . . . . . . . . . . . . . . . . . . . 76 4.3.1 Mean Field Variational Inference . . . . . . . . . . . . 78 4.3.2 Practical Considerations . . . . . . . . . . . . . . . . . 81 4.4 Dynamic Topic Models and Correlated Topic Models . . . . . 82 4.4.1 The Correlated Topic Model . . . . . . . . . . . . . . 82 4.4.2 The Dynamic Topic Model . . . . . . . . . . . . . . . 84 4.5 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 89 © 2009 by Taylor and Francis Group, LLC ix 5 Nonnegative Matrix and Tensor Factorization for Discussion Tracking 95 Brett W. Bader, Michael W. Berry, and Amy N. Langville 5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 5.1.1 Extracting Discussions . . . . . . . . . . . . . . . . . . 96 5.1.2 RelatedWork . . . . . . . . . . . . . . . . . . . . . . . 96 5.2 Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 5.3 Tensor Decompositions and Algorithms . . . . . . . . . . . . 98 5.3.1 PARAFAC-ALS . . . . . . . . . . . . . . . . . . . . . 100 5.3.2 Nonnegative Tensor Factorization . . . . . . . . . . . . 100 5.4 Enron Subset . . . . . . . . . . . . . . . . . . . . . . . . . . . 102 5.4.1 TermWeighting Techniques . . . . . . . . . . . . . . . 103 5.5 Observations and Results . . . . . . . . . . . . . . . . . . . . 105 5.5.1 Nonnegative Tensor Decomposition . . . . . . . . . . . 105 5.5.2 Analysis of Three-Way Tensor . . . . . . . . . . . . . 106 5.5.3 Analysis of Four-Way Tensor . . . . . . . . . . . . . . 108 5.6 Visualizing Results of the NMF Clustering . . . . . . . . . . . 111 5.7 FutureWork . . . . . . . . . . . . . . . . . . . . . . . . . . . 116 6 Text Clustering with Mixture of von Mises-Fisher Distributions 121 Arindam Banerjee, Inderjit Dhillon, Joydeep Ghosh, and Suvrit Sra 6.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 121 6.2 RelatedWork . . . . . . . . . . . . . . . . . . . . . . . . . . . 123 6.3 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . 124 6.3.1 The von Mises-Fisher (vMF) Distribution . . . . . . . 124 6.3.2 Maximum Likelihood Estimates . . . . . . . . . . . . . 125 6.4 EMon aMixture of vMFs (moVMF) . . . . . . . . . . . . . . 126 6.5 Handling High-Dimensional Text Datasets . . . . . . . . . . . 127 6.5.1 Approximating κ . . . . . . . . . . . . . . . . . . . . . 128 6.5.2 Experimental Study of the Approximation . . . . . . . 130 6.6 Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132 6.7 Experimental Results . . . . . . . . . . . . . . . . . . . . . . . 134 6.7.1 Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . 135 6.7.2 Methodology . . . . . . . . . . . . . . . . . . . . . . . 138 6.7.3 Simulated Datasets . . . . . . . . . . . . . . . . . . . . 138 6.7.4 Classic3 Family of Datasets . . . . . . . . . . . . . . . 140 6.7.5 Yahoo News Dataset . . . . . . . . . . . . . . . . . . . 143 6.7.6 20 Newsgroup Family of Datasets . . . . . . . . . . . . 143 6.7.7 Slashdot Datasets . . . . . . . . . . . . . . . . . . . . 145 6.8 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146 6.9 Conclusions and Future Work . . . . . . . . . . . . . . . . . . 148 © 2009 by Taylor and Francis Group, LLC x 7 Constrained Partitional Clustering of Text Data: An Overview 155 Sugato Basu and Ian Davidson 7.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 155 7.2 Uses of Constraints . . . . . . . . . . . . . . . . . . . . . . . . 157 7.2.1 Constraint-Based Methods . . . . . . . . . . . . . . . 157 7.2.2 Distance-BasedMethods . . . . . . . . . . . . . . . . . 158 7.3 Text Clustering . . . . . . . . . . . . . . . . . . . . . . . . . . 159 7.3.1 Pre-Processing . . . . . . . . . . . . . . . . . . . . . . 161 7.3.2 DistanceMeasures . . . . . . . . . . . . . . . . . . . . 162 7.4 Partitional Clustering with Constraints . . . . . . . . . . . . 163 7.4.1 COP-KMeans . . . . . . . . . . . . . . . . . . . . . . . 163 7.4.2 Algorithms with Penalties – PKM, CVQE . . . . . . . 164 7.4.3 LCVQE: An Extension to CVQE . . . . . . . . . . . . 167 7.4.4 Probabilistic Penalty – PKM . . . . . . . . . . . . . . 167 7.5 Learning Distance Function with Constraints . . . . . . . . . 168 7.5.1 Generalized Mahalanobis Distance Learning . . . . . . 168 7.5.2 Kernel Distance Functions Using AdaBoost . . . . . . 169 7.6 Satisfying Constraints and Learning Distance Functions . . . 170 7.6.1 Hidden Markov Random Field (HMRF) Model . . . . 170 7.6.2 EMAlgorithm . . . . . . . . . . . . . . . . . . . . . . 173 7.6.3 Improvements to HMRF-KMeans . . . . . . . . . . . 173 7.7 Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . 174 7.7.1 Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . 174 7.7.2 Clustering Evaluation . . . . . . . . . . . . . . . . . . 175 7.7.3 Methodology . . . . . . . . . . . . . . . . . . . . . . . 176 7.7.4 Comparison of Distance Functions . . . . . . . . . . . 176 7.7.5 Experimental Results . . . . . . . . . . . . . . . . . . 177 7.8 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180 8 Adaptive Information Filtering 185 Yi Zhang 8.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 185 8.2 Standard EvaluationMeasures . . . . . . . . . . . . . . . . . 188 8.3 Standard Retrieval Models and Filtering Approaches . . . . . 190 8.3.1 Existing Retrieval Models . . . . . . . . . . . . . . . . 190 8.3.2 Existing Adaptive Filtering Approaches . . . . . . . . 192 8.4 CollaborativeAdaptive Filtering . . . . . . . . . . . . . . . . 194 8.5 Novelty and Redundancy Detection . . . . . . . . . . . . . . . 196 8.5.1 Set Difference . . . . . . . . . . . . . . . . . . . . . . . 199 8.5.2 Geometric Distance . . . . . . . . . . . . . . . . . . . 199 8.5.3 Distributional Similarity . . . . . . . . . . . . . . . . . 200 8.5.4 Summary of Novelty Detection . . . . . . . . . . . . . 201 8.6 Other Adaptive Filtering Topics . . . . . . . . . . . . . . . . 201 8.6.1 Beyond Bag ofWords . . . . . . . . . . . . . . . . . . 202 © 2009 by Taylor and Francis Group, LLC xi 8.6.2 Using Implicit Feedback . . . . . . . . . . . . . . . . . 202 8.6.3 Exploration and Exploitation Trade Off . . . . . . . . 203 8.6.4 Evaluation beyond Topical Relevance . . . . . . . . . 203 8.7 Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . 204 9 Utility-Based Information Distillation 213 Yiming Yang and Abhimanyu Lad 9.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 213 9.1.1 Related Work in Adaptive Filtering (AF) . . . . . . . 213 9.1.2 Related Work in Topic Detection and Tracking (TDT) 214 9.1.3 Limitations of Current Solutions . . . . . . . . . . . . 215 9.2 A Sample Task . . . . . . . . . . . . . . . . . . . . . . . . . . 216 9.3 Technical Cores . . . . . . . . . . . . . . . . . . . . . . . . . . 218 9.3.1 Adaptive Filtering Component . . . . . . . . . . . . . 218 9.3.2 Passage Retrieval Component . . . . . . . . . . . . . . 219 9.3.3 Novelty Detection Component . . . . . . . . . . . . . 220 9.3.4 Anti-Redundant Ranking Component . . . . . . . . . 220 9.4 EvaluationMethodology . . . . . . . . . . . . . . . . . . . . . 221 9.4.1 Answer Keys . . . . . . . . . . . . . . . . . . . . . . . 221 9.4.2 Evaluating the Utility of a Sequence of Ranked Lists . 223 9.5 Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225 9.6 Experiments and Results . . . . . . . . . . . . . . . . . . . . . 226 9.6.1 Baselines . . . . . . . . . . . . . . . . . . . . . . . . . 226 9.6.2 Experimental Setup . . . . . . . . . . . . . . . . . . . 226 9.6.3 Results . . . . . . . . . . . . . . . . . . . . . . . . . . 227 9.7 Concluding Remarks . . . . . . . . . . . . . . . . . . . . . . . 229 9.8 Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . 229 10 Text Search-Enhanced with Types and Entities 233 Soumen Chakrabarti, Sujatha Das, Vijay Krishnan, and Kriti Puniyani 10.1 Entity-Aware Search Architecture . . . . . . . . . . . . . . . . 233 10.1.1 Guessing Answer Types . . . . . . . . . . . . . . . . . 234 10.1.2 Scoring Snippets . . . . . . . . . . . . . . . . . . . . . 235 10.1.3 Efficient Indexing and Query Processing . . . . . . . . 236 10.1.4 Comparison with Prior Work . . . . . . . . . . . . . . 236 10.2 Understanding the Question . . . . . . . . . . . . . . . . . . . 236 10.2.1 Answer Type Clues in Questions . . . . . . . . . . . . 239 10.2.2 Sequential Labeling of Type Clue Spans . . . . . . . . 240 10.2.3 From Type Clue Spans to Answer Types . . . . . . . . 245 10.2.4 Experiments . . . . . . . . . . . . . . . . . . . . . . . 247 10.3 Scoring Potential Answer Snippets . . . . . . . . . . . . . . . 251 10.3.1 A ProximityModel . . . . . . . . . . . . . . . . . . . . 253 10.3.2 Learning the Proximity Scoring Function . . . . . . . 255 10.3.3 Experiments . . . . . . . . . . . . . . . . . . . . . . . 257 10.4 Indexing and Query Processing . . . . . . . . . . . . . . . . . 260 © 2009 by Taylor and Francis Group, LLC xii 10.4.1 Probability of a Query Atype . . . . . . . . . . . . . . 262 10.4.2 Pre-Generalize and Post-Filter . . . . . . . . . . . . . 262 10.4.3 Atype Subset Index Space Model . . . . . . . . . . . . 265 10.4.4 Query Time BloatModel . . . . . . . . . . . . . . . . 266 10.4.5 Choosing an Atype Subset . . . . . . . . . . . . . . . . 269 10.4.6 Experiments . . . . . . . . . . . . . . . . . . . . . . . 271 10.5 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 272 10.5.1 Summary . . . . . . . . . . . . . . . . . . . . . . . . . 272 10.5.2 Ongoing and Future Work . . . . . . . . . . . . . . . . 273 © 2009

随机过程论 第三卷 苏 基赫曼 高清扫描版

随机过程论， 第二卷，苏 基赫曼，高清扫描版

随机过程论，作者（苏）基赫曼，扫描清晰版

Chapter 1. Introduction to Web Search Engines 1 Chapter 2. Crawling, Indexing, and Query Processing 15 Chapter 3. Ranking Webpages by Popularity 25 Chapter 4. The Mathematics of Google's PageRank 31 Chapter 5. Parameters in the PageRank Model 47 Chapter 6. The Sensitivity of PageRank 57 Chapter 7. The PageRank Problem as a Linear System 71 Chapter 8. Issues in Large-Scale Implementation of PageRank 75 Chapter 9. Accelerating the Computation of PageRank 89 Chapter 10. Updating the PageRank Vector 99 Chapter 11. The HITS Method for Ranking Webpages 115 Chapter 12. Other Link Methods for Ranking Webpages Chapter 13. The Future of Web Information Retrieval Chapter 14. Resources for Web Information Retrieval Chapter 15. The Mathematics Guide Chapter 16. Glossary

Table of Contents Visual C++ Optimization with Assembly Code Preface Introduction On the CD-ROM Chapter 1 - Developing Efficient Program Code Chapter 2 - Optimizing Calculation Algorithms Chapter 3 - Developing and Using Procedures in Assembly Language Chapter 4 - Optimizing C++ Logical Structures with Assembly Language Chapter 5 - Assembly Module Interface to C++ Programs Chapter 6 - Developing and Using Assembly Subroutines Chapter 7 - Linking Assembly Modules with C++ .NET Programs Chapter 8 - Dynamic Link Libraries and Their Development in Assembly Language Chapter 9 - Basic Structures of Visual C++ .NET 2003 Inline Assembler Chapter 10 - Inline Assembler and Application Optimization. MMX and SSE Technologies Chapter 11 - Optimizing Multimedia Applications with Assembly Language Chapter 12 - Optimizing Multithread Applications with Assembly Language Chapter 13 - C++ Inline Assembler and Windows Time Functions Chapter 14 - Using Assembly Language for System Programming in Windows Chapter 15 - Optimizing Procedure-Oriented Applications and System Services Conclusion List of Figures List of Tables List of Examples

计算几何大师Bernard chazelle的论文

计算几何大师Bernard chazelle的论文

Part I Metric Searching in a Nutshell Overview 3 1. FOUNDATIONS OF METRIC SPACE SEARCHING 5 1 The Distance Searching Problem 6 2 The Metric Space 8 3 Distance Measures 9 3.1 Minkowski Distances 10 3.2 Quadratic Form Distance 11 3.3 Edit Distance 12 3.4 Tree Edit Distance 13 3.5 Jaccard’s Coefficient 13 3.6 Hausdorff Distance 14 3.7 Time Complexity 14 4 Similarity Queries 15 4.1 Range Query 15 4.2 Nearest Neighbor Query 16 4.3 Reverse Nearest Neighbor Query 17 4.4 Similarity Join 17 4.5 Combinations of Queries 18 4.6 Complex Similarity Queries 18 5 Basic Partitioning Principles 20 5.1 Ball Partitioning 20 5.2 Generalized Hyperplane Partitioning 21 5.3 Excluded Middle Partitioning 21 5.4 Extensions 21 6 Principles of Similarity Query Execution 22 6.1 Basic Strategies 22 6.2 Incremental Similarity Search 25 7 Policies for Avoiding Distance Computations 26 7.1 Explanatory Example 27 7.2 Object-Pivot Distance Constraint 28 7.3 Range-Pivot Distance Constraint 30 7.4 Pivot-Pivot Distance Constraint 31 7.5 Double-Pivot Distance Constraint 33 7.6 Pivot Filtering 34 8 Metric Space Transformations 35 8.1 Metric Hierarchies 36 8.1.1 Lower-Bounding Functions 36 8.2 User-Defined Metric Functions 38 8.2.1 Searching Using Lower-Bounding Functions 38 8.3 Embedding Metric Space 39 8.3.1 Embedding Examples 39 8.3.2 Reducing Dimensionality 40 9 Approximate Similarity Search 41 9.1 Principles 41 9.2 Generic Algorithms 44 9.3 Measures of Performance 46 9.3.1 Improvement in Efficiency 46 9.3.2 Precision and Recall 46 9.3.3 Relative Error on Distances 48 9.3.4 Position Error 49 10 Advanced Issues 50 10.1 Statistics on Metric Datasets 51 10.1.1 Distribution and Density Functions 51 10.1.2 Distance Distribution and Density 52 10.1.3 Homogeneity of Viewpoints 54 10.2 Proximity of Ball Regions 55 10.3 Performance Prediction 58 Contents ix 10.4 Tree Quality Measures 60 10.5 Choosing Reference Points 63 2. SURVEY OF EXISTING APPROACHES 67 1 Ball Partitioning Methods 67 1.1 Burkhard-Keller Tree 68 1.2 Fixed Queries Tree 69 1.3 Fixed Queries Array 70 1.4 Vantage Point Tree 72 1.4.1 Multi-Way Vantage Point Tree 74 1.5 Excluded Middle Vantage Point Forest 75 2 Generalized Hyperplane Partitioning Approaches 76 2.1 Bisector Tree 76 2.2 Generalized Hyperplane Tree 77 3 Exploiting Pre-Computed Distances 78 3.1 AESA 78 3.2 Linear AESA 79 3.3 Other Methods 80 4 Hybrid Indexing Approaches 81 4.1 Multi Vantage Point Tree 81 4.2 Geometric Near-neighbor Access Tree 82 4.3 Spatial Approximation Tree 85 4.4 M-tree 87 4.5 Similarity Hashing 88 5 Approximate Similarity Search 89 5.1 Exploiting Space Transformations 89 5.2 Approximate Nearest Neighbors with BBD Trees 90 5.3 Angle Property Technique 92 5.4 Clustering for Indexing 94 5.5 Vector Quantization Index 95 5.6 Buoy Indexing 97 5.7 Hierarchical Decomposition of Metric Spaces 97 5.7.1 Relative Error Approximation 98 5.7.2 Good Fraction Approximation 98 5.7.3 Small Chance Improvement Approximation 98 5.7.4 Proximity-Based Approximation 99 5.7.5 PAC Nearest Neighbor Search 99 x SIMILARITY SEARCH Part II Metric Searching in Large Collections of Data Overview 103 3. CENTRALIZED INDEX STRUCTURES 105 1 M-tree Family 105 1.1 The M-tree 105 1.2 Bulk-Loading Algorithm of M-tree 109 1.3 Multi-Way Insertion Algorithm 112 1.4 The Slim Tree 113 1.4.1 Slim-Down Algorithm 114 1.4.2 Generalized Slim-Down Algorithm 116 1.5 Pivoting M-tree 118 1.6 The M

总计225M，18章，1000多页，这是第十六章压缩包2，共两个 CHAPTER 16. LIGHT TRANSPORT I: SURFACE REFLECTION

总计225M，18章，1000多页，这是第十六章两个压缩包中第一个 CHAPTER 16. LIGHT TRANSPORT I: SURFACE REFLECTION

总计225M，18章，1000多页，这是第十一章压缩包2，共两个 CHAPTER 11. TEXTURE

总计225M，18章，1000多页，这是第十八章 CHAPTER 18. SUMMARY AND CONCLUSION

总计225M，18章，1000多页，这是第十七章 CHAPTER 17. LIGHT TRANSPORT II: VOLUME RENDERING

总计225M，18章，1000多页，这是第十五章 CHAPTER 15. MONTE CARLO INTEGRATION II: IMPROVING EFFICIENCY

总计225M，18章，1000多页，这是第十四章 CHAPTER 14. MONTE CARLO INTEGRATION I: BASIC CONCEPTS

总计225M，18章，1000多页，这是第十三章 CHAPTER 13. LIGHT SOURCES