DOCSLIB.ORG

EDRM Glossary Version 1.002, April 22, 2016

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
EDRM Glossary Version 1.002, April 22, 2016 EDRM Glossary http://www.edrm.net/resources/glossaries/glossary Version 1.002, April 22, 2016 © 2016 EDRM LLC EDRM Glossary http://www.edrm.net/resources/glossaries/glossary The EDRM Glossary is EDRM's most comprehensive listing of electronic discovery terms. It includes terms from the specialized glossaries listed below as well as terms not in those glossaries. The terms are listed in alphabetical order with definitions and attributions where available. EDRM Collection Standards Glossary The EDRM Collection Standards Glossary is a glossary of terms defined as part of the EDRM Collection Standards. EDRM Metrics Glossary The EDRM Metrics Glossary contains definitions for terms used in connection with the updated EDRM Metrics Model published in June 2013. EDRM Search Glossary The EDRM Search Glossary is a list of terms related to searching ESI. EDRM Search Guide Glossary The EDRM Search Guide Glossary is part of the EDRM Search Guide. The EDRM Search Guide focuses on the search, retrieval and production of ESI within the larger e- discovery process described in the EDRM Model. IGRM Glossary The IGRM Glossary consists of commonly used Information Governance terms. The Grossman-Cormack Glossary of Technology-Assisted Review Developed by Maura Grossman of Wachtell, Lipton, Rosen & Katz and Gordon Cormack of the University of Waterloo, the Grossman-Cormack Glossary of Technology-Assisted Review contains definitions for terms used in connect with the discovery processes referred to by various terms including Computer Assisted Review, Technology Assisted Review, and Predictive Coding. If you would like to submit a new term with definition or a new definition for an existing term, please go to our Submit a Definition page, http://www.edrm.net/23482, and complete and submit the form. We appreciate your contributions! Except where otherwise noted, content included in this document is licensed under a Creative Commons Attribution 3.0 Unported License. That means you are free to share, remix or make commercial use of the content so long as you provide attribution. To provide attribution, please cite to "EDRM (edrm.net)." If you have questions, contact us at [email protected]. © 2016 EDRM LLC i EDRM Glossary http://www.edrm.net/resources/glossaries/glossary 1 ..................................................................................................................................................... 1 A ..................................................................................................................................................... 1 B ................................................................................................................................................... 19 C ................................................................................................................................................... 38 D ................................................................................................................................................... 70 E .................................................................................................................................................... 99 F .................................................................................................................................................. 115 G ................................................................................................................................................. 134 H ................................................................................................................................................. 139 I ................................................................................................................................................... 146 J .................................................................................................................................................. 162 K ................................................................................................................................................. 166 L .................................................................................................................................................. 172 M ................................................................................................................................................ 180 N ................................................................................................................................................. 205 O ................................................................................................................................................. 216 P ................................................................................................................................................. 223 Q ................................................................................................................................................. 246 R ................................................................................................................................................. 249 S .................................................................................................................................................. 266 T .................................................................................................................................................. 296 U ................................................................................................................................................. 310 V ................................................................................................................................................. 322 W ................................................................................................................................................ 327 X ................................................................................................................................................. 334 Y .................................................................................................................................................. 334 Z .................................................................................................................................................. 334 .................................................................................................................................................... 336 © 2016 EDRM LLC ii EDRM Glossary http://www.edrm.net/resources/glossaries/glossary 1 10b(5) Securities and Exchange Commission regulation governing the rights of shareholders. Many lawsuits by shareholders are filed under Rule 10b(5). Source: Ibis Consulting, Glossary. 17a4 Securities and Exchange Commission regulation relating to data retention for financial services firms. Source: Ibis Consulting, Glossary. A Ablate To remove. Used to describe the laser-readable "pits" in the recorded layer of optical disks. Vinson & Elkins LLP Practice Support, EDD Glossary. Accept on Zero A statistical sampling procedure (an acceptance sampling procedure) that draws a random sample of objects from a population and checks each one to determine whether it is a defect. If none of the objects in the sample is found to be defective, then we can conclude with a specifiable level of confidence that there were no more than a specifiable proportion of defects in the original population. Finding zero defects in the sample does not mean that there were zero defects in the population, only that there were no more than a specifiable percentage. One application of this procedure in eDiscovery is to draw a random sample from the population of documents determined by the review to be nonresponsive. The size of the sample is determined by your specified confidence level and by the maximum acceptable percentage of responsive documents that were not retrieved. If none of the documents in the sample is found to be responsive, then we can say with confidence X% that there were no more than Y% responsive documents left behind. Source: Herb Roitblat, Search 2020: The Glossary. Source: Herb Roitblat, Predictive Coding Glossary. Accept on Zero Error A technique in which the training of a Machine Learning method is gauged by taking a Sample after each training step, and deeming the training process complete when the learning method codes a Sample with 0% Error (i.e., 100% Accuracy). © 2016 EDRM LLC 1 EDRM Glossary http://www.edrm.net/resources/glossaries/glossary Source: Maura R. Grossman and Gordon V. Cormack, EDRM page & The Grossman- Cormack Glossary of Technology-Assisted Review, with Foreword by John M. Facciola, U.S. Magistrate Judge, 2013 Fed. Cts. L. Rev. 7 (January 2013). Accuracy The fraction of Documents that are correctly coded by a search or review effort. Note that Accuracy + Error = 100%, and that Accuracy = 100% – Error. While high Accuracy is commonly advanced as evidence of an effective search or review effort, its use can be misleading because it is heavily influenced by Prevalence. Consider, for example, a Document Population containing one million Documents, of which ten thousand (or 1%) are Relevant. A search or review effort that identified 100% of the Documents as Not Relevant and therefore, found none of the Relevant Documents, would have 99% Accuracy, belying the failure of that search or review effort. Source: Maura R. Grossman and Gordon V. Cormack, EDRM page & The Grossman- Cormack Glossary of Technology-Assisted
Load more

Recommended publications
  • Completeness in Quasi-Pseudometric Spaces—A Survey
    mathematics Article Completeness in Quasi-Pseudometric Spaces—A Survey ¸StefanCobzas Faculty of Mathematics and Computer Science, Babe¸s-BolyaiUniversity, 400 084 Cluj-Napoca, Romania; [email protected] Received:17 June 2020; Accepted: 24 July 2020; Published: 3 August 2020 Abstract: The aim of this paper is to discuss the relations between various notions of sequential completeness and the corresponding notions of completeness by nets or by filters in the setting of quasi-metric spaces. We propose a new definition of right K-Cauchy net in a quasi-metric space for which the corresponding completeness is equivalent to the sequential completeness. In this way we complete some results of R. A. Stoltenberg, Proc. London Math. Soc. 17 (1967), 226–240, and V. Gregori and J. Ferrer, Proc. Lond. Math. Soc., III Ser., 49 (1984), 36. A discussion on nets defined over ordered or pre-ordered directed sets is also included. Keywords: metric space; quasi-metric space; uniform space; quasi-uniform space; Cauchy sequence; Cauchy net; Cauchy filter; completeness MSC: 54E15; 54E25; 54E50; 46S99 1. Introduction It is well known that completeness is an essential tool in the study of metric spaces, particularly for fixed points results in such spaces. The study of completeness in quasi-metric spaces is considerably more involved, due to the lack of symmetry of the distance—there are several notions of completeness all agreing with the usual one in the metric case (see [1] or [2]). Again these notions are essential in proving fixed point results in quasi-metric spaces as it is shown by some papers on this topic as, for instance, [3–6] (see also the book [7]).
    [Show full text]
  • Secondary Memory
    Secondary Memory This type of memory is also known as external memory or non-volatile. It is slower than main memory. These are used for storing data/Information permanently. CPU directly does not access these memories instead they are accessed via input-output routines. Contents of secondary memories are first transferred to main memory, and then CPU can access it. For example : Hard disk, CD-ROM, DVD etc. Electronic data is a sequence of bits. This data can either reside in : • Primary storage - main memory (RAM), relatively small, fast access, expensive (cost per MB), volatile (go away when power goes off) • Secondary storage - disks, tape, large amounts of data, slower access, cheap (cost per MB), persistent (remain even when power is off) Data storage has expanded from text and numeric files to include digital music files, photographic files, video files, and much more. These new types of files require secondary storage devices with much greater capacity than floppy disks. 1 Primary storage ( or main memory or internal memory) , often referred to simply as memory , is the only directly accessible to the CPU. Primary memory can be divided into volatile and nonvolatile memories. Primary storage (Main Memory ) has three main functions: 1-It stored all or part of the program that being executed. 2-It also holds data that are being used by the program. 3-It also stored the operating system programs that manage the operation of the computer. Limitation of Primary storage 1. Limited capacity- because the cost per bit of storage is high. 2. Volatile – data stored in it is lost when the electric power is turned off Or interrupted.
    [Show full text]
  • Computer Organization and Architecture Designing for Performance Ninth Edition
    COMPUTER ORGANIZATION AND ARCHITECTURE DESIGNING FOR PERFORMANCE NINTH EDITION William Stallings Boston Columbus Indianapolis New York San Francisco Upper Saddle River Amsterdam Cape Town Dubai London Madrid Milan Munich Paris Montréal Toronto Delhi Mexico City São Paulo Sydney Hong Kong Seoul Singapore Taipei Tokyo Editorial Director: Marcia Horton Designer: Bruce Kenselaar Executive Editor: Tracy Dunkelberger Manager, Visual Research: Karen Sanatar Associate Editor: Carole Snyder Manager, Rights and Permissions: Mike Joyce Director of Marketing: Patrice Jones Text Permission Coordinator: Jen Roach Marketing Manager: Yez Alayan Cover Art: Charles Bowman/Robert Harding Marketing Coordinator: Kathryn Ferranti Lead Media Project Manager: Daniel Sandin Marketing Assistant: Emma Snider Full-Service Project Management: Shiny Rajesh/ Director of Production: Vince O’Brien Integra Software Services Pvt. Ltd. Managing Editor: Jeff Holcomb Composition: Integra Software Services Pvt. Ltd. Production Project Manager: Kayla Smith-Tarbox Printer/Binder: Edward Brothers Production Editor: Pat Brown Cover Printer: Lehigh-Phoenix Color/Hagerstown Manufacturing Buyer: Pat Brown Text Font: Times Ten-Roman Creative Director: Jayne Conte Credits: Figure 2.14: reprinted with permission from The Computer Language Company, Inc. Figure 17.10: Buyya, Rajkumar, High-Performance Cluster Computing: Architectures and Systems, Vol I, 1st edition, ©1999. Reprinted and Electronically reproduced by permission of Pearson Education, Inc. Upper Saddle River, New Jersey, Figure 17.11: Reprinted with permission from Ethernet Alliance. Credits and acknowledgments borrowed from other sources and reproduced, with permission, in this textbook appear on the appropriate page within text. Copyright © 2013, 2010, 2006 by Pearson Education, Inc., publishing as Prentice Hall. All rights reserved. Manufactured in the United States of America.
    [Show full text]
  • STATEMENT of WORK: SGS File System
    ATTACHMENT A STATEMENT OF WORK: SGS File System DOE National Nuclear Security Administration & the DOD Maryland Office April 25, 2001 File Systems SOW April 25, 2001 Table of Contents TABLE OF CONTENTS ..................................................................................................................................2 1.0 OVERVIEW.................................................................................................................................................4 1.1 INTRODUCTION ..........................................................................................................................................4 2.0 MOTIVATION ............................................................................................................................................5 2.1 THE NEED FOR IMPROVED FILE SYSTEMS .................................................................................................5 2.2 I/O CHARACTERIZATION OF IMPORTANT APPLICATIONS...........................................................................6 2.3 CURRENT AND PROJECTED ENVIRONMENTS AT LLNL, LANL, SANDIA, AND THE DOD .........................6 2.4 SUMMARY OF FIVE TECHNOLOGY CATEGORIES ........................................................................................9 3.0 MINIMUM REQUIREMENTS (GO/NO-GO CRITERIA)..................................................................12 3.1 POSIX-LIKE INTERFACE [MANDATORY]........................................................................................12 3.2 INTEGRATION
    [Show full text]
  • Externalities and Fundamental Nonconvexities: a Reconciliation of Approaches to General Equilibrium Externality Modelling and Implications for Decentralization
    Externalities and Fundamental Nonconvexities: A Reconciliation of Approaches to General Equilibrium Externality Modelling and Implications for Decentralization Sushama Murty No 756 WARWICK ECONOMIC RESEARCH PAPERS DEPARTMENT OF ECONOMICS Externalities And Decentralization. August 18, 2006 Externalities and Fundamental Nonconvexities: A Reconciliation of Approaches to General Equilibrium Externality Modeling and Implications for Decentralization* Sushama Murty August 2006 Sushama Murty: Department of Economics, University of Warwick, [email protected] *Ithank Professors Charles Blackorby and Herakles Polemarchakis for very helpful discussions and comments. I also thank the support of Professor R. Robert Russell and the Department of Economics at University of California, Riverside, where this work began. All errors in the analysis remain mine. August 18, 2006 Externalities And Decentralization. August 18, 2006 Abstract By distinguishing between producible and nonproducible public goods, we are able to propose a general equilibrium model with externalities that distinguishes between and encompasses both the Starrett [1972] and Boyd and Conley [1997] type external effects. We show that while nonconvexities remain fundamental whenever the Starrett type external effects are present, these are not caused by the type discussed in Boyd and Conley. Secondly, we find that the notion of a “public competitive equilibrium” for public goods found in Foley [1967, 1970] allows a decentralized mechanism, based on both price and quantity signals, for economies with externalities, which is able to restore the equivalence between equilibrium and efficiency even in the presence of nonconvexities. This is in contrast to equilibrium notions based purely on price signals such as the Pigouvian taxes. Journal of Economic Literature Classification Number: D62, D50, H41.
    [Show full text]
  • Lecture Notes General Equilibrium Theory: Ss205
    LECTURE NOTES GENERAL EQUILIBRIUM THEORY: SS205 FEDERICO ECHENIQUE CALTECH 1 2 Contents 0. Disclaimer 4 1. Preliminary definitions 5 1.1. Binary relations 5 1.2. Preferences in Euclidean space 5 2. Consumer Theory 6 2.1. Digression: upper hemi continuity 7 2.2. Properties of demand 7 3. Economies 8 3.1. Exchange economies 8 3.2. Economies with production 11 4. Welfare Theorems 13 4.1. First Welfare Theorem 13 4.2. Second Welfare Theorem 14 5. Scitovsky Contours and cost-benefit analysis 20 6. Excess demand functions 22 6.1. Notation 22 6.2. Aggregate excess demand in an exchange economy 22 6.3. Aggregate excess demand 25 7. Existence of competitive equilibria 26 7.1. The Negishi approach 28 8. Uniqueness 32 9. Representative Consumer 34 9.1. Samuelsonian Aggregation 37 9.2. Eisenberg's Theorem 39 10. Determinacy 39 GENERAL EQUILIBRIUM THEORY 3 10.1. Digression: Implicit Function Theorem 40 10.2. Regular and Critical Economies 41 10.3. Digression: Measure Zero Sets and Transversality 44 10.4. Genericity of regular economies 45 11. Observable Consequences of Competitive Equilibrium 46 11.1. Digression on Afriat's Theorem 46 11.2. Sonnenschein-Mantel-Debreu Theorem: Anything goes 47 11.3. Brown and Matzkin: Testable Restrictions On Competitve Equilibrium 48 12. The Core 49 12.1. Pareto Optimality, The Core and Walrasian Equiilbria 51 12.2. Debreu-Scarf Core Convergence Theorem 51 13. Partial equilibrium 58 13.1. Aggregate demand and welfare 60 13.2. Production 61 13.3. Public goods 62 13.4. Lindahl equilibrium 63 14.
    [Show full text]
  • CSCI 120 Introduction to Computation Bits... and Pieces (Draft)
    CSCI 120 Introduction to Computation Bits... and pieces (draft) Saad Mneimneh Visiting Professor Hunter College of CUNY 1 Yes No Yes No... I am a Bit You may recall from the previous lecture that the use of electro mechanical relays, and in subsequent years, diodes and transistor, made it possible to con- struct more advanced computers, e.g. ENIAC. This is accredited to the fact that these devices could function as on/off switches. On one hand, they create the ability to encode logic into the circuits of the computer. This means that the computer can perform different tasks under different conditions, i.e. the notion of a program. For instance, one could encode the logic if A OR B then C. On the other hand, these devices allow the engineers to worry less about the values that could possibly arise in the system: the switch is either on or off. It cannot be anything in between. Therefore, this means that any errors due to fluctuation in voltage levels are greatly reduced. It would be enough to simply distinguish between high voltage and low voltage. This brings us to the question of Analog versus Digital. In simple terms, a digital system encodes information using a number of de- vices that have discrete states (e.g. on/off switches). An analog system encodes information using a device that have continuous states (e.g. measurement in an electric circuit). To build an intuition for digital versus analog, consider the problem of en- coding a number using buckets of water. One possibility is to use two kinds of buckets, full and empty.
    [Show full text]
  • "Mathematics for Computer Science" (MCS)
    “mcs” — 2016/9/28 — 23:07 — page i — #1 Mathematics for Computer Science revised Wednesday 28th September, 2016, 23:07 Eric Lehman Google Inc. F Thomson Leighton Department of Mathematics and the Computer Science and AI Laboratory, Massachussetts Institute of Technology; Akamai Technologies Albert R Meyer Department of Electrical Engineering and Computer Science and the Computer Science and AI Laboratory, Massachussetts Institute of Technology 2016, Eric Lehman, F Tom Leighton, Albert R Meyer. This work is available under the terms of the Creative Commons Attribution-ShareAlike 3.0 license. “mcs” — 2016/9/28 — 23:07 — page ii — #2 “mcs” — 2016/9/28 — 23:07 — page iii — #3 Contents I Proofs Introduction 3 0.1 References4 1 What is a Proof? 5 1.1 Propositions5 1.2 Predicates8 1.3 The Axiomatic Method8 1.4 Our Axioms9 1.5 Proving an Implication 11 1.6 Proving an “If and Only If” 13 1.7 Proof by Cases 15 1.8 Proof by Contradiction 16 1.9 Good Proofs in Practice 17 1.10 References 19 2 The Well Ordering Principle 29 2.1 Well Ordering Proofs 29 2.2 Template for Well Ordering Proofs 30 2.3 Factoring into Primes 32 2.4 Well Ordered Sets 33 3 Logical Formulas 47 3.1 Propositions from Propositions 48 3.2 Propositional Logic in Computer Programs 51 3.3 Equivalence and Validity 54 3.4 The Algebra of Propositions 56 3.5 The SAT Problem 61 3.6 Predicate Formulas 62 3.7 References 67 4 Mathematical Data Types 93 4.1 Sets 93 4.2 Sequences 98 4.3 Functions 99 4.4 Binary Relations 101 4.5 Finite Cardinality 105 “mcs” — 2016/9/28 — 23:07 — page iv — #4 Contentsiv 5 Induction 125 5.1 Ordinary Induction 125 5.2 Strong Induction 134 5.3 Strong Induction vs.
    [Show full text]
  • MTH 304: General Topology Semester 2, 2017-2018
    MTH 304: General Topology Semester 2, 2017-2018 Dr. Prahlad Vaidyanathan Contents I. Continuous Functions3 1. First Definitions................................3 2. Open Sets...................................4 3. Continuity by Open Sets...........................6 II. Topological Spaces8 1. Definition and Examples...........................8 2. Metric Spaces................................. 11 3. Basis for a topology.............................. 16 4. The Product Topology on X × Y ...................... 18 Q 5. The Product Topology on Xα ....................... 20 6. Closed Sets.................................. 22 7. Continuous Functions............................. 27 8. The Quotient Topology............................ 30 III.Properties of Topological Spaces 36 1. The Hausdorff property............................ 36 2. Connectedness................................. 37 3. Path Connectedness............................. 41 4. Local Connectedness............................. 44 5. Compactness................................. 46 6. Compact Subsets of Rn ............................ 50 7. Continuous Functions on Compact Sets................... 52 8. Compactness in Metric Spaces........................ 56 9. Local Compactness.............................. 59 IV.Separation Axioms 62 1. Regular Spaces................................ 62 2. Normal Spaces................................ 64 3. Tietze's extension Theorem......................... 67 4. Urysohn Metrization Theorem........................ 71 5. Imbedding of Manifolds..........................
    [Show full text]
  • Advanced Microeconomics General Equilibrium Theory (GET)
    Why GET? Logistics Consumption: Recap Production: Recap References Advanced Microeconomics General Equilibrium Theory (GET) Giorgio Fagiolo [email protected] http://www.lem.sssup.it/fagiolo/Welcome.html LEM, Sant’Anna School of Advanced Studies, Pisa (Italy) Introduction to the Module Why GET? Logistics Consumption: Recap Production: Recap References How do markets work? GET: Neoclassical theory of competitive markets So far we have talked about one producer, one consumer, several consumers (aggregation can be tricky) The properties of consumer and producer behaviors were derived from simple optimization problems Main assumption Consumers and producers take prices as given Consumers: prices are exogenously fixed Producers: firms in competitive markets are like atoms and cannot influence market prices with their choices (they do not have market power) Why GET? Logistics Consumption: Recap Production: Recap References How do markets work? GET: Neoclassical theory of competitive markets So far we have talked about one producer, one consumer, several consumers (aggregation can be tricky) The properties of consumer and producer behaviors were derived from simple optimization problems Main assumption Consumers and producers take prices as given Consumers: prices are exogenously fixed Producers: firms in competitive markets are like atoms and cannot influence market prices with their choices (they do not have market power) Introduction Walrasian model Welfare theorems FOC characterization WhyWhy does GET? demandLogistics equalConsumption: supply?
    [Show full text]
  • General Topology
    General Topology Tom Leinster 2014{15 Contents A Topological spaces2 A1 Review of metric spaces.......................2 A2 The definition of topological space.................8 A3 Metrics versus topologies....................... 13 A4 Continuous maps........................... 17 A5 When are two spaces homeomorphic?................ 22 A6 Topological properties........................ 26 A7 Bases................................. 28 A8 Closure and interior......................... 31 A9 Subspaces (new spaces from old, 1)................. 35 A10 Products (new spaces from old, 2)................. 39 A11 Quotients (new spaces from old, 3)................. 43 A12 Review of ChapterA......................... 48 B Compactness 51 B1 The definition of compactness.................... 51 B2 Closed bounded intervals are compact............... 55 B3 Compactness and subspaces..................... 56 B4 Compactness and products..................... 58 B5 The compact subsets of Rn ..................... 59 B6 Compactness and quotients (and images)............. 61 B7 Compact metric spaces........................ 64 C Connectedness 68 C1 The definition of connectedness................... 68 C2 Connected subsets of the real line.................. 72 C3 Path-connectedness.......................... 76 C4 Connected-components and path-components........... 80 1 Chapter A Topological spaces A1 Review of metric spaces For the lecture of Thursday, 18 September 2014 Almost everything in this section should have been covered in Honours Analysis, with the possible exception of some of the examples. For that reason, this lecture is longer than usual. Definition A1.1 Let X be a set. A metric on X is a function d: X × X ! [0; 1) with the following three properties: • d(x; y) = 0 () x = y, for x; y 2 X; • d(x; y) + d(y; z) ≥ d(x; z) for all x; y; z 2 X (triangle inequality); • d(x; y) = d(y; x) for all x; y 2 X (symmetry).
    [Show full text]
  • Introduction to Computer Concepts
    MANAGING PUBLIC SECTOR RECORDS A Training Programme Understanding Computers: An Overview for Records and Archives Staff INTERNATIONAL INTERNATIONAL RECORDS COUNCIL ON ARCHIVES MANAGEMENT TRUST MANAGING PUBLIC SECTOR RECORDS: A STUDY PROGRAMME UNDERSTANDING COMPUTERS: AN OVERVIEW FOR RECORDS AND ARCHIVES STAFF MANAGING PUBLIC SECTOR RECORDS A STUDY PROGRAMME General Editor, Michael Roper; Managing Editor, Laura Millar UNDERSTANDING COMPUTERS: AN OVERVIEW FOR RECORDS AND ARCHIVES STAFF INTERNATIONAL RECORDS INTERNATIONAL MANAGEMENT TRUST COUNCIL ON ARCHIVES MANAGING PUBLIC SECTOR RECORDS: A STUDY PROGRAMME Understanding Computers: An Overview for Records and Archives Staff © International Records Management Trust, 1999. Reproduction in whole or in part, without the express written permission of the International Records Management Trust, is strictly prohibited. Produced by the International Records Management Trust 12 John Street London WC1N 2EB UK Printed in the United Kingdom. Inquiries concerning reproduction or rights and requests for additional training materials should be addressed to International Records Management Trust 12 John Street London WC1N 2EB UK Tel: +44 (0) 20 7831 4101 Fax: +44 (0) 20 7831 7404 E-mail: [email protected] Website: http://www.irmt.org Version 1/1999 MPSR Project Personnel Project Director Anne Thurston has been working to define international solutions for the management of public sector records for nearly three decades. Between 1970 and 1980 she lived in Kenya, initially conducting research and then as an employee of the Kenya National Archives. She joined the staff of the School of Library, Archive and Information Studies at University College London in 1980, where she developed the MA course in Records and Archives Management (International) and a post-graduate research programme.
    [Show full text]