Big Data bring new opportunities to modern society and challenges to data scientists. On the one hand, Big Data hold great promises for discovering subtle population patterns and heterogeneities that are not possible with small-scale data. On the other hand, the massive sample size and high dimensionality of Big Data introduce unique computational and statistical challenges, including scalability and storage bottleneck, noise accumulation, spurious correlation, incidental endogeneity and measurement errors. These challenges are distinguished and require new computational and statistical paradigm. This paper gives overviews on the salient features of Big Data and how these features impact on paradigm change on statistical and computational methods as well as computing architectures. We also provide various new perspectives on the Big Data analysis and computation. In particular, we emphasize on

A practical and accessible introduction to the bootstrap methodnewly revised and updated Over the past decade, the application of bootstrap methods to new areas of study has expanded, resulting in theoretical and applied advances across various fields. Bootstrap Methods, Second Edition is a highly approachable guide to the multidisciplinary, real-world uses of bootstrapping and is ideal for readers who have a professional interest in its methods, but are without an advanced background in mathematics. Updated to reflect current techniques and the most up-to-date work on the topic, the Second Edition features: The addition of a second, extended bibliography devoted solely to publications from 19992007, which is a valuable collection of references on the latest research in the field A discussion of the new areas of applicability for bootstrap methods, including use in the pharmaceutical industry for estimating individual and population bioequivalence in clinical trials A revised chapter on when and why bootstrap fails and remedies for overcoming these drawbacks Added coverage on regression, censored data applications, P-value adjustment, ratio estimators, and missing data New examples and illustrations as well as extensive historical notes at the end of each chapter With a strong focus on application, detailed explanations of methodology, and complete coverage of modern developments in the field, Bootstrap Methods, Second Edition is an indispensable reference for applied statisticians, engineers, scientists, clinicians, and other practitioners who regularly use statistical methods in research. It is also suitable as a supplementary text

Deconvolution problems arise in a variety of situations in statistics. An interesting problem is to estimate the density f of a random variable X based on n i.i.d. observations from Y = X + , where is a measurement error with a known distribution. In this paper, the effect of errors in variables of nonparametric deconvolution is examined. Insights are gained by showing that the difficulty of deconvolution depends on the smoothness of error distributions: the smoother, the harder. In fact, there are two types of optimal rates of convergence according to whether the error distribution is ordinary smooth or supersmooth. It is shown that optimal rates of convergence can be achieved by deconvolution kernel density estimators.

In this paper we introduce a smooth version of local linear regression estimators and address their advantages. The MSE and MISE of the estimators are computed explicitly. It turns out that the local linear regression smoothers have nice sampling properties and high minimax efficiency-they are not only efficient in rates but also nearly efficient in constant factors. In the nonparametric regression context, the asymptotic minimax lower bound is developed via the heuristic of the" hardest onedimensional subproblem" of Donoho and Liu. Connections of the minimax risk with the modulus of continuity are made. The lower bound is also applicable for estimating conditional mean (regression) and conditional quantiles for both fixed and random design regression problems.

A decorated surface S is an oriented surface, with or without boundary, and a finite set {s 1,..., s n} of special points on the boundary, considered modulo isotopy. Let G be a split reductive group over [special characters omitted].