Download or read book Two New Algorithms for Nonparametric Analysis Given Incomplete Data written by Yunlei Zhang and published by . This book was released on 1997 with total page 268 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book American Doctoral Dissertations written by and published by . This book was released on 1997 with total page 806 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Missing Data in Longitudinal Studies written by Michael J. Daniels and published by CRC Press. This book was released on 2008-03-11 with total page 324 pages. Available in PDF, EPUB and Kindle. Book excerpt: Drawing from the authors' own work and from the most recent developments in the field, Missing Data in Longitudinal Studies: Strategies for Bayesian Modeling and Sensitivity Analysis describes a comprehensive Bayesian approach for drawing inference from incomplete data in longitudinal studies. To illustrate these methods, the authors employ

Download or read book Dissertation Abstracts International written by and published by . This book was released on 2005 with total page 884 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Mixed Effects Models for Complex Data written by Lang Wu and published by CRC Press. This book was released on 2009-11-11 with total page 431 pages. Available in PDF, EPUB and Kindle. Book excerpt: Although standard mixed effects models are useful in a range of studies, other approaches must often be used in correlation with them when studying complex or incomplete data. Mixed Effects Models for Complex Data discusses commonly used mixed effects models and presents appropriate approaches to address dropouts, missing data, measurement errors, censoring, and outliers. For each class of mixed effects model, the author reviews the corresponding class of regression model for cross-sectional data. An overview of general models and methods, along with motivating examples After presenting real data examples and outlining general approaches to the analysis of longitudinal/clustered data and incomplete data, the book introduces linear mixed effects (LME) models, generalized linear mixed models (GLMMs), nonlinear mixed effects (NLME) models, and semiparametric and nonparametric mixed effects models. It also includes general approaches for the analysis of complex data with missing values, measurement errors, censoring, and outliers. Self-contained coverage of specific topics Subsequent chapters delve more deeply into missing data problems, covariate measurement errors, and censored responses in mixed effects models. Focusing on incomplete data, the book also covers survival and frailty models, joint models of survival and longitudinal data, robust methods for mixed effects models, marginal generalized estimating equation (GEE) models for longitudinal or clustered data, and Bayesian methods for mixed effects models. Background material In the appendix, the author provides background information, such as likelihood theory, the Gibbs sampler, rejection and importance sampling methods, numerical integration methods, optimization methods, bootstrap, and matrix algebra. Failure to properly address missing data, measurement errors, and other issues in statistical analyses can lead to severely biased or misleading results. This book explores the biases that arise when naïve methods are used and shows which approaches should be used to achieve accurate results in longitudinal data analysis.

Download or read book Classification Clustering and Data Mining Applications written by David Banks and published by Springer Science & Business Media. This book was released on 2011-01-07 with total page 642 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume describes new methods with special emphasis on classification and cluster analysis. These methods are applied to problems in information retrieval, phylogeny, medical diagnosis, microarrays, and other active research areas.

Download or read book Selecting Models from Data written by P. Cheeseman and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 475 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume is a selection of papers presented at the Fourth International Workshop on Artificial Intelligence and Statistics held in January 1993. These biennial workshops have succeeded in bringing together researchers from Artificial Intelligence and from Statistics to discuss problems of mutual interest. The exchange has broadened research in both fields and has strongly encour aged interdisciplinary work. The theme ofthe 1993 AI and Statistics workshop was: "Selecting Models from Data". The papers in this volume attest to the diversity of approaches to model selection and to the ubiquity of the problem. Both statistics and artificial intelligence have independently developed approaches to model selection and the corresponding algorithms to implement them. But as these papers make clear, there is a high degree of overlap between the different approaches. In particular, there is agreement that the fundamental problem is the avoidence of "overfitting"-Le., where a model fits the given data very closely, but is a poor predictor for new data; in other words, the model has partly fitted the "noise" in the original data.

Download or read book Bayesian Nonparametric Data Analysis written by Peter Müller and published by Springer. This book was released on 2015-06-17 with total page 203 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book reviews nonparametric Bayesian methods and models that have proven useful in the context of data analysis. Rather than providing an encyclopedic review of probability models, the book’s structure follows a data analysis perspective. As such, the chapters are organized by traditional data analysis problems. In selecting specific nonparametric models, simpler and more traditional models are favored over specialized ones. The discussed methods are illustrated with a wealth of examples, including applications ranging from stylized examples to case studies from recent literature. The book also includes an extensive discussion of computational methods and details on their implementation. R code for many examples is included in online software pages.

Download or read book Data Analysis Using Regression and Multilevel Hierarchical Models written by Andrew Gelman and published by Cambridge University Press. This book was released on 2007 with total page 654 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book, first published in 2007, is for the applied researcher performing data analysis using linear and nonlinear regression and multilevel models.

Download or read book Topics in Applied Statistics written by Mingxiu Hu and published by Springer Science & Business Media. This book was released on 2013-09-14 with total page 340 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume presents 27 selected papers in topics that range from statistical applications in business and finance to applications in clinical trials and biomarker analysis. All papers feature original, peer-reviewed content. The editors intentionally selected papers that cover many topics so that the volume will serve the whole statistical community and a variety of research interests. The papers represent select contributions to the 21st ICSA Applied Statistics Symposium. The International Chinese Statistical Association (ICSA) Symposium took place between the 23rd and 26th of June, 2012 in Boston, Massachusetts. It was co-sponsored by the International Society for Biopharmaceutical Statistics (ISBS) and American Statistical Association (ASA). This is the inaugural proceedings volume to share research from the ICSA Applied Statistics Symposium.

Download or read book Analysis of Incomplete Multivariate Data written by J.L. Schafer and published by CRC Press. This book was released on 1997-08-01 with total page 470 pages. Available in PDF, EPUB and Kindle. Book excerpt: The last two decades have seen enormous developments in statistical methods for incomplete data. The EM algorithm and its extensions, multiple imputation, and Markov Chain Monte Carlo provide a set of flexible and reliable tools from inference in large classes of missing-data problems. Yet, in practical terms, those developments have had surprisingly little impact on the way most data analysts handle missing values on a routine basis. Analysis of Incomplete Multivariate Data helps bridge the gap between theory and practice, making these missing-data tools accessible to a broad audience. It presents a unified, Bayesian approach to the analysis of incomplete multivariate data, covering datasets in which the variables are continuous, categorical, or both. The focus is applied, where necessary, to help readers thoroughly understand the statistical properties of those methods, and the behavior of the accompanying algorithms. All techniques are illustrated with real data examples, with extended discussion and practical advice. All of the algorithms described in this book have been implemented by the author for general use in the statistical languages S and S Plus. The software is available free of charge on the Internet.

Download or read book Data Depth written by Regina Y. Liu and published by American Mathematical Soc.. This book was released on 2006 with total page 264 pages. Available in PDF, EPUB and Kindle. Book excerpt: The book is a collection of some of the research presented at the workshop of the same name held in May 2003 at Rutgers University. The workshop brought together researchers from two different communities: statisticians and specialists in computational geometry. The main idea unifying these two research areas turned out to be the notion of data depth, which is an important notion both in statistics and in the study of efficiency of algorithms used in computational geometry. Many of the articles in the book lay down the foundations for further collaboration and interdisciplinary research. Information for our distributors: Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).

Download or read book Methods and Applications of Longitudinal Data Analysis written by Xian Liu and published by Elsevier. This book was released on 2015-09-01 with total page 531 pages. Available in PDF, EPUB and Kindle. Book excerpt: Methods and Applications of Longitudinal Data Analysis describes methods for the analysis of longitudinal data in the medical, biological and behavioral sciences. It introduces basic concepts and functions including a variety of regression models, and their practical applications across many areas of research. Statistical procedures featured within the text include: - descriptive methods for delineating trends over time - linear mixed regression models with both fixed and random effects - covariance pattern models on correlated errors - generalized estimating equations - nonlinear regression models for categorical repeated measurements - techniques for analyzing longitudinal data with non-ignorable missing observations Emphasis is given to applications of these methods, using substantial empirical illustrations, designed to help users of statistics better analyze and understand longitudinal data. Methods and Applications of Longitudinal Data Analysis equips both graduate students and professionals to confidently apply longitudinal data analysis to their particular discipline. It also provides a valuable reference source for applied statisticians, demographers and other quantitative methodologists. - From novice to professional: this book starts with the introduction of basic models and ends with the description of some of the most advanced models in longitudinal data analysis - Enables students to select the correct statistical methods to apply to their longitudinal data and avoid the pitfalls associated with incorrect selection - Identifies the limitations of classical repeated measures models and describes newly developed techniques, along with real-world examples.

Download or read book Application of Omic Techniques to Identify New Biomarkers and Drug Targets for COVID 19 written by Paul C. Guest and published by Springer Nature. This book was released on 2023-06-28 with total page 503 pages. Available in PDF, EPUB and Kindle. Book excerpt: The COVID-19 pandemic caused by the SARS-CoV-2 virus has affected nearly every country and territory in the world. Although worldwide vaccination efforts have reduced the risk of serious disease outcomes, disparities in distribution have led to multiple waves of SARS-CoV-2 outbreaks and the emergence of variants of concern, some of which have enhanced infectivity and ability to evade existing vaccines. Hence there is an increasing interest in understanding the evolution of viruses like SARS-CoV-2, as well as improving our capacity to effectively current and manage future pandemics. This new volume reviews the most effective omic techniques for increasing our understanding of COVID-19, to improve diagnostics, prognostics, and genomic surveillance, and to facilitate development of effective treatments and vaccines. Chapters are written by an international team of experts and explore methods in the areas of genomics, transcriptomics, proteomics, and metabolomics. Techniques used to assess physiological function at the molecular level and artificial intelligence approaches used for more effective validation and translation of biomarker candidates into clinical use are also discussed. This book is an excellent resource for researchers studying biomarkers, virology, metabolic diseases, and infectious diseases, as well as clinical scientists, physicians, drug company scientists, and healthcare workers.

Download or read book Proceedings of the Seventeenth Annual ACM SIAM Symposium on Discrete Algorithms written by SIAM Activity Group on Discrete Mathematics and published by SIAM. This book was released on 2006-01-01 with total page 1264 pages. Available in PDF, EPUB and Kindle. Book excerpt: Symposium held in Miami, Florida, January 22–24, 2006.This symposium is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics.Contents Preface; Acknowledgments; Session 1A: Confronting Hardness Using a Hybrid Approach, Virginia Vassilevska, Ryan Williams, and Shan Leung Maverick Woo; A New Approach to Proving Upper Bounds for MAX-2-SAT, Arist Kojevnikov and Alexander S. Kulikov, Measure and Conquer: A Simple O(20.288n) Independent Set Algorithm, Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch; A Polynomial Algorithm to Find an Independent Set of Maximum Weight in a Fork-Free Graph, Vadim V. Lozin and Martin Milanic; The Knuth-Yao Quadrangle-Inequality Speedup is a Consequence of Total-Monotonicity, Wolfgang W. Bein, Mordecai J. Golin, Larry L. Larmore, and Yan Zhang; Session 1B: Local Versus Global Properties of Metric Spaces, Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, and Santosh Vempala; Directed Metrics and Directed Graph Partitioning Problems, Moses Charikar, Konstantin Makarychev, and Yury Makarychev; Improved Embeddings of Graph Metrics into Random Trees, Kedar Dhamdhere, Anupam Gupta, and Harald Räcke; Small Hop-diameter Sparse Spanners for Doubling Metrics, T-H. Hubert Chan and Anupam Gupta; Metric Cotype, Manor Mendel and Assaf Naor; Session 1C: On Nash Equilibria for a Network Creation Game, Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, and Liam Roditty; Approximating Unique Games, Anupam Gupta and Kunal Talwar; Computing Sequential Equilibria for Two-Player Games, Peter Bro Miltersen and Troels Bjerre Sørensen; A Deterministic Subexponential Algorithm for Solving Parity Games, Marcin Jurdzinski, Mike Paterson, and Uri Zwick; Finding Nucleolus of Flow Game, Xiaotie Deng, Qizhi Fang, and Xiaoxun Sun, Session 2: Invited Plenary Abstract: Predicting the “Unpredictable”, Rakesh V. Vohra, Northwestern University; Session 3A: A Near-Tight Approximation Lower Bound and Algorithm for the Kidnapped Robot Problem, Sven Koenig, Apurva Mudgal, and Craig Tovey; An Asymptotic Approximation Algorithm for 3D-Strip Packing, Klaus Jansen and Roberto Solis-Oba; Facility Location with Hierarchical Facility Costs, Zoya Svitkina and Éva Tardos; Combination Can Be Hard: Approximability of the Unique Coverage Problem, Erik D. Demaine, Uriel Feige, Mohammad Taghi Hajiaghayi, and Mohammad R. Salavatipour; Computing Steiner Minimum Trees in Hamming Metric, Ernst Althaus and Rouven Naujoks; Session 3B: Robust Shape Fitting via Peeling and Grating Coresets, Pankaj K. Agarwal, Sariel Har-Peled, and Hai Yu; Tightening Non-Simple Paths and Cycles on Surfaces, Éric Colin de Verdière and Jeff Erickson; Anisotropic Surface Meshing, Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, and Rephael Wenger; Simultaneous Diagonal Flips in Plane Triangulations, Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, and David R. Wood; Morphing Orthogonal Planar Graph Drawings, Anna Lubiw, Mark Petrick, and Michael Spriggs; Session 3C: Overhang, Mike Paterson and Uri Zwick; On the Capacity of Information Networks, Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert Kleinberg, and April Rasala Lehman; Lower Bounds for Asymmetric Communication Channels and Distributed Source Coding, Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, and Mihai Patrascu; Self-Improving Algorithms, Nir Ailon, Bernard Chazelle, Seshadhri Comandur, and Ding Liu; Cake Cutting Really is Not a Piece of Cake, Jeff Edmonds and Kirk Pruhs; Session 4A: Testing Triangle-Freeness in General Graphs, Noga Alon, Tali Kaufman, Michael Krivelevich, and Dana Ron; Constraint Solving via Fractional Edge Covers, Martin Grohe and Dániel Marx; Testing Graph Isomorphism, Eldar Fischer and Arie Matsliah; Efficient Construction of Unit Circular-Arc Models, Min Chih Lin and Jayme L. Szwarcfiter, On The Chromatic Number of Some Geometric Hypergraphs, Shakhar Smorodinsky; Session 4B: A Robust Maximum Completion Time Measure for Scheduling, Moses Charikar and Samir Khuller; Extra Unit-Speed Machines are Almost as Powerful as Speedy Machines for Competitive Flow Time Scheduling, Ho-Leung Chan, Tak-Wah Lam, and Kin-Shing Liu; Improved Approximation Algorithms for Broadcast Scheduling, Nikhil Bansal, Don Coppersmith, and Maxim Sviridenko; Distributed Selfish Load Balancing, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul Goldberg, Zengjian Hu, and Russell Martin; Scheduling Unit Tasks to Minimize the Number of Idle Periods: A Polynomial Time Algorithm for Offline Dynamic Power Management, Philippe Baptiste; Session 4C: Rank/Select Operations on Large Alphabets: A Tool for Text Indexing, Alexander Golynski, J. Ian Munro, and S. Srinivasa Rao; O(log log n)-Competitive Dynamic Binary Search Trees, Chengwen Chris Wang, Jonathan Derryberry, and Daniel Dominic Sleator; The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree Distributed Data Structure, Michael T. Goodrich, Michael J. Nelson, and Jonathan Z. Sun; Design of Data Structures for Mergeable Trees, Loukas Georgiadis, Robert E. Tarjan, and Renato F. Werneck; Implicit Dictionaries with O(1) Modifications per Update and Fast Search, Gianni Franceschini and J. Ian Munro; Session 5A: Sampling Binary Contingency Tables with a Greedy Start, Ivona Bezáková, Nayantara Bhatnagar, and Eric Vigoda; Asymmetric Balanced Allocation with Simple Hash Functions, Philipp Woelfel; Balanced Allocation on Graphs, Krishnaram Kenthapadi and Rina Panigrahy; Superiority and Complexity of the Spaced Seeds, Ming Li, Bin Ma, and Louxin Zhang; Solving Random Satisfiable 3CNF Formulas in Expected Polynomial Time, Michael Krivelevich and Dan Vilenchik; Session 5B: Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem, Jie Gao, Michael Langberg, and Leonard J. Schulman; Finding Large Sticks and Potatoes in Polygons, Olaf Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell, and Arik Sityon; Randomized Incremental Construction of Three-Dimensional Convex Hulls and Planar Voronoi Diagrams, and Approximate Range Counting, Haim Kaplan and Micha Sharir; Vertical Ray Shooting and Computing Depth Orders for Fat Objects, Mark de Berg and Chris Gray; On the Number of Plane Graphs, Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, and Hannes Krasser; Session 5C: All-Pairs Shortest Paths for Unweighted Undirected Graphs in o(mn) Time, Timothy M. Chan; An O(n log n) Algorithm for Maximum st-Flow in a Directed Planar Graph, Glencora Borradaile and Philip Klein; A Simple GAP-Canceling Algorithm for the Generalized Maximum Flow Problem, Mateo Restrepo and David P. Williamson; Four Point Conditions and Exponential Neighborhoods for Symmetric TSP, Vladimir Deineko, Bettina Klinz, and Gerhard J. Woeginger; Upper Degree-Constrained Partial Orientations, Harold N. Gabow; Session 7A: On the Tandem Duplication-Random Loss Model of Genome Rearrangement, Kamalika Chaudhuri, Kevin Chen, Radu Mihaescu, and Satish Rao; Reducing Tile Complexity for Self-Assembly Through Temperature Programming, Ming-Yang Kao and Robert Schweller; Cache-Oblivious String Dictionaries, Gerth Stølting Brodal and Rolf Fagerberg; Cache-Oblivious Dynamic Programming, Rezaul Alam Chowdhury and Vijaya Ramachandran; A Computational Study of External-Memory BFS Algorithms, Deepak Ajwani, Roman Dementiev, and Ulrich Meyer; Session 7B: Tight Approximation Algorithms for Maximum General Assignment Problems, Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, and Maxim Sviridenko; Approximating the k-Multicut Problem, Daniel Golovin, Viswanath Nagarajan, and Mohit Singh; The Prize-Collecting Generalized Steiner Tree Problem Via A New Approach Of Primal-Dual Schema, Mohammad Taghi Hajiaghayi and Kamal Jain; 8/7-Approximation Algorithm for (1,2)-TSP, Piotr Berman and Marek Karpinski; Improved Lower and Upper Bounds for Universal TSP in Planar Metrics, Mohammad T. Hajiaghayi, Robert Kleinberg, and Tom Leighton; Session 7C: Leontief Economies Encode NonZero Sum Two-Player Games, B. Codenotti, A. Saberi, K. Varadarajan, and Y. Ye; Bottleneck Links, Variable Demand, and the Tragedy of the Commons, Richard Cole, Yevgeniy Dodis, and Tim Roughgarden; The Complexity of Quantitative Concurrent Parity Games, Krishnendu Chatterjee, Luca de Alfaro, and Thomas A. Henzinger; Equilibria for Economies with Production: Constant-Returns Technologies and Production Planning Constraints, Kamal Jain and Kasturi Varadarajan; Session 8A: Approximation Algorithms for Wavelet Transform Coding of Data Streams, Sudipto Guha and Boulos Harb; Simpler Algorithm for Estimating Frequency Moments of Data Streams, Lakshimath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, and Chandan Saha; Trading Off Space for Passes in Graph Streaming Problems, Camil Demetrescu, Irene Finocchi, and Andrea Ribichini; Maintaining Significant Stream Statistics over Sliding Windows, L.K. Lee and H.F. Ting; Streaming and Sublinear Approximation of Entropy and Information Distances, Sudipto Guha, Andrew McGregor, and Suresh Venkatasubramanian; Session 8B: FPTAS for Mixed-Integer Polynomial Optimization with a Fixed Number of Variables, J. A. De Loera, R. Hemmecke, M. Köppe, and R. Weismantel; Linear Programming and Unique Sink Orientations, Bernd Gärtner and Ingo Schurr; Generating All Vertices of a Polyhedron is Hard, Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, and Vladimir Gurvich; A Semidefinite Programming Approach to Tensegrity Theory and Realizability of Graphs, Anthony Man-Cho So and Yinyu Ye; Ordering by Weighted Number of Wins Gives a Good Ranking for Weighted Tournaments, Don Coppersmith, Lisa Fleischer, and Atri Rudra; Session 8C: Weighted Isotonic Regression under L1 Norm, Stanislav Angelov, Boulos Harb, Sampath Kannan, and Li-San Wang; Oblivious String Embeddings and Edit Distance Approximations, Tugkan Batu, Funda Ergun, and Cenk Sahinalp0898716012\\This comprehensive book not only introduces the C and C++ programming languages but also shows how to use them in the numerical solution of partial differential equations (PDEs). It leads the reader through the entire solution process, from the original PDE, through the discretization stage, to the numerical solution of the resulting algebraic system. The well-debugged and tested code segments implement the numerical methods efficiently and transparently. Basic and advanced numerical methods are introduced and implemented easily and efficiently in a unified object-oriented approach.

Download or read book Advances in Intelligent Systems Computer Science and Digital Economics written by Zhengbing Hu and published by Springer Nature. This book was released on 2020-01-23 with total page 473 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book comprises high-quality, refereed research papers presented at the 2019 International Symposium on Computer Science, Digital Economy and Intelligent Systems (CSDEIS2019): The symposium, held in Moscow, Russia, on 4–6 October 2019, was organized jointly by Moscow State Technical University and the International Research Association of Modern Education and Computer Science. The book discusses the state of the art in areas such as computer science and its technological applications; intelligent systems and intellectual approaches; and digital economics and methodological approaches. It is an excellent reference resource for researchers, undergraduate and graduate students, engineers, and management practitioners interested in computer science and its applications in engineering and management.

Download or read book COMPSTAT written by Jelke G. Bethlehem and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 544 pages. Available in PDF, EPUB and Kindle. Book excerpt: This Volume contains the Keynote, Invited and Full Contributed papers presented at COMPSTAT 2000. A companion volume (Jansen & Bethlehem, 2000) contains papers describing the Short Communications and Posters. COMPST AT is a one week conference held every two years under the auspices of the International Association of Statistical Computing, a section of the International Statistical Institute. COMPST AT 2000 is jointly organised by the Department of Methodology and Statistics of the Faculty of Social Sciences of Utrecht University, and Statistics Netherlands. It is taking place from 21-25 August 2000 at Utrecht University. Previous COMPSTATs (from 1974-1998) were in Vienna, Berlin, Leiden, Edinburgh, Toulouse, Prague, Rome, Copenhagen, Dubrovnik, Neuchatel, Vienna, Barcelona and Bristol. The conference is the main European forum for developments at the interface between statistics and computing. This was encapsulated as follows on the COMPST A T 2000 homepage http://neon. vb.cbs.nlIrsml compstat. Statistical computing provides the link between statistical theory and applied statistics. As at previous COMPSTATs, the scientific programme will range over all aspects of this link, from the development and implementation of new statistical ideas through to user experiences and software evaluation. The programme should appeal to anyone working in statistics and using computers, whether in universities, industrial companies, research institutes or as software developers. At COMPST AT 2000 there is a special interest in the interplay with official statistics. This is evident from papers in the area of computerised data collection, survey methodology, treatment of missing data, and the like.