Cytometry inference through adaptive atomic deconvolution

In this paper, we consider a statistical estimation problem known as atomic deconvolution. Introduced in reliability, this model has a direct application when considering biological data produced by flow cytometers. From a statistical point of view, we aim at inferring the percentage of cells expressing the selected molecule and the probability distribution function associated with its fluorescence emission. We propose here an adaptive estimation procedure based on a previous deconvolution procedure introduced by Es, Gugushvili, and Spreij [(2008), ‘Deconvolution for an atomic distribution’, Electronic Journal of Statistics, 2, 265–297] and Gugushvili, Es, and Spreij [(2011), ‘Deconvolution for an atomic distribution: rates of convergence’, Journal of Nonparametric Statistics, 23, 1003–1029]. For both estimating the mixing parameter and the mixing density automatically, we use the Lepskii method based on the optimal choice of a bandwidth using a bias-variance decomposition. We then derive some convergence rates that are shown to be minimax optimal (up to some log terms) in Sobolev classes. Finally, we apply our algorithm on the simulated and real biological data.     

Non-parametric estimation of reciprocal coordinate subtangent for right censored dependent scheme

The concept of reciprocal coordinate subtangent (RCST) has been used as a useful tool to study the monotone behavior of a continuous density function and for characterizing probability distributions. In this paper, we propose a non-parametric estimator for RCST based on the censored dependent data. Asymptotic properties of the estimator are established under suitable regularity conditions. A simulation study is carried out to examine the performance of the estimator. The usefulness of the estimator is also examined through a real data.     

高频数据瞬时波动率核估计的窗宽选择及算法研究

在瞬时波动率的各种估计量中，非参数估计量因其能准确地度量瞬时波动率，一直是学者们的研究热点。然而，这类估计量在实际应用中都面临着最优窗宽的确定问题。由于最优窗宽中往往携带一些难以估计的未知参数，使得在实际应用过程中确定最优窗宽的具体数值存在困难。本文以瞬时波动率的核估计量为例，借鉴非参数回归分析中窗宽选择的思想，构建了一种能从数据中准确计算出最优窗宽具体值的算法。理论的分析和数值上的验证表明：文中所构建的算法具有良好的稳定性、适应性和收敛速度。算法的提出为瞬时波动率的后续应用研究铺平道路。     

内核级并发通信的研究

提出了一种内核级并发消息通信机制。该机制采用对象传送协议和动态线程池技术,并通过会话控制完成数据的收发过程,将线程池设计为二级阻塞队列来暂缓线程的撤销过程,从而保证既能够快速响应客户请求,又可减少因频繁创建和撤销线程而消耗系统的资源和时间,为分布式操作系统提供了高效可靠的通信服务。     

Using local linear kernel smoothers to test the lack of fit of nonlinear regression models

Herein, we propose a data-driven test that assesses the lack of fit of nonlinear regression models. The comparison of local linear kernel and parametric fits is the basis of this test, and specific boundary-corrected kernels are not needed at the boundary when local linear fitting is used. Under the parametric null model, the asymptotically optimal bandwidth can be used for bandwidth selection. This selection method leads to the data-driven test that has a limiting normal distribution under the null hypothesis and is consistent against any fixed alternative. The finite-sample property of the proposed data-driven test is illustrated, and the power of the test is compared with that of some existing tests via simulation studies. We illustrate the practicality of the proposed test by using two data sets.     

Kernel Estimation of Rate Function for Recurrent Event Data

Abstract.  Recurrent event data are largely characterized by the rate function but smoothing techniques for estimating the rate function have never been rigorously developed or studied in statistical literature. This paper considers the moment and least squares methods for estimating the rate function from recurrent event data. With an independent censoring assumption on the recurrent event process, we study statistical properties of the proposed estimators and propose bootstrap procedures for the bandwidth selection and for the approximation of confidence intervals in the estimation of the occurrence rate function. It is identified that the moment method without resmoothing via a smaller bandwidth will produce a curve with nicks occurring at the censoring times, whereas there is no such problem with the least squares method. Furthermore, the asymptotic variance of the least squares estimator is shown to be smaller under regularity conditions. However, in the implementation of the bootstrap procedures, the moment method is computationally more efficient than the least squares method because the former approach uses condensed bootstrap data. The performance of the proposed procedures is studied through Monte Carlo simulations and an epidemiological example on intravenous drug users.     

A Semi-parametric Regression Model with Errors in Variables

Abstract.  In this paper, we consider a partial linear regression model with measurement errors in possibly all the variables. We use a method of moments and deconvolution to construct a new class of parametric estimators together with a non-parametric kernel estimator. Strong convergence, optimal rate of weak convergence and asymptotic normality of the estimators are investigated.     

Deconvolution with supersmooth distributions

Nonparametric deconvolution problems require one to recover an unknown density when the data are contaminated with errors. Optimal global rates of convergence are found under the weighted L_p-loss (1 ≤ p ≤ ∞). It appears that the optimal rates of convergence are extremely low for supersmooth error distributions. To resolve this difficulty, we examine how high the noise level can be for deconvolution to be feasible, and for the deconvolution estimate to be as good as the ordinary density estimate. It is shown that if the noise level is not too high, nonparametric Gaussian deconvolution can still be practical. Several simulation studies are also presented.     

PATTERN RECOGNITION VIA ROBUST SMOOTHING WITH APPLICATION TO LASER DATA

Nowadays airborne laser scanning is used in many territorial studies, providing point data which may contain strong discontinuities. Motivated by the need to interpolate such data and preserve their edges, this paper considers robust nonparametric smoothers. These estimators, when implemented with bounded loss functions, have suitable jump‐preserving properties. Iterative algorithms are developed here, and are equivalent to nonlinear M‐smoothers, but have the advantage of resembling the linear Kernel regression. The selection of their coefficients is carried out by combining cross‐validation and robust‐tuning techniques. Two real case studies and a simulation experiment confirm the validity of the method; in particular, the performance in building recognition is excellent.     

Confidence Intervals for Current Status Data

Abstract.  The likelihood ratio statistic for testing pointwise hypotheses about the survival time distribution in the current status model can be inverted to yield confidence intervals (CIs). One advantage of this procedure is that CIs can be formed without estimating the unknown parameters that figure in the asymptotic distribution of the maximum likelihood estimator (MLE) of the distribution function. We discuss the likelihood ratio-based CIs for the distribution function and the quantile function and compare these intervals to several different intervals based on the MLE. The quantiles of the limiting distribution of the MLE are estimated using various methods including parametric fitting, kernel smoothing and subsampling techniques. Comparisons are carried out both for simulated data and on a data set involving time to immunization against rubella. The comparisons indicate that the likelihood ratio-based intervals are preferable from several perspectives.