Asymptotic approximations to the distribution of Kendall's sample τ

This paper provides a saddlepoint approximation to the distribution of the sample version of Kendall's τ, which is a measure of association between two samples. The saddlepoint approximation is compared with the Edgeworth and the normal approximations, and with the bootstrap resampling distribution. A numerical study shows that with small sample sizes the saddlepoint approximation outperforms both the normal and the Edgeworth approximations. This paper gives also an analytical comparison between approximated and exact cumulants of the sample Kendall's τ when the two samples are independent.     

Trend smoothness achieved by penalized least squares with the smoothing parameter chosen by optimality criteria

This work presents a study about the smoothness attained by the methods more frequently used to choose the smoothing parameter in the context of splines: Cross Validation, Generalized Cross Validation, and corrected Akaike and Bayesian Information Criteria, implemented with Penalized Least Squares. It is concluded that the amount of smoothness strongly depends on the length of the series and on the type of underlying trend, while the presence of seasonality even though statistically significant is less relevant. The intrinsic variability of the series is not statistically significant and its effect is taken into account only through the smoothing parameter.     

LAN property for an ergodic Ornstein–Uhlenbeck process with Poisson jumps

In this article, we consider an ergodic Ornstein–Uhlenbeck process with jumps driven by a Brownian motion and a compensated Poisson process, whose drift and diffusion coefficients as well as its jump intensity depend on unknown parameters. Considering the process discretely observed at high frequency, we derive the local asymptotic normality property. To obtain this result, Malliavin calculus and Girsanov’s theorem are applied to write the log-likelihood ratio in terms of sums of conditional expectations, for which a central limit theorem for triangular arrays can be applied.     

Accounting for Uncertainty in Heteroscedasticity in Nonlinear Regression

Toxicologists and pharmacologists often describe toxicity of a chemical using parameters of a nonlinear regression model. Thus estimation of parameters of a nonlinear regression model is an important problem. The estimates of the parameters and their uncertainty estimates depend upon the underlying error variance structure in the model. Typically, a priori the researcher would not know if the error variances are homoscedastic (i.e., constant across dose) or if they are heteroscedastic (i.e., the variance is a function of dose). Motivated by this concern, in this paper we introduce an estimation procedure based on preliminary test which selects an appropriate estimation procedure accounting for the underlying error variance structure. Since outliers and influential observations are common in toxicological data, the proposed methodology uses M-estimators. The asymptotic properties of the preliminary test estimator are investigated; in particular its asymptotic covariance matrix is derived. The performance of the proposed estimator is compared with several standard estimators using simulation studies. The proposed methodology is also illustrated using a data set obtained from the National Toxicology Program.     

Nonparametric Bayesian inference for multivariate density functions using Feller priors

Multivariate density estimation plays an important role in investigating the mechanism of high-dimensional data. This article describes a nonparametric Bayesian approach to the estimation of multivariate densities. A general procedure is proposed for constructing Feller priors for multivariate densities and their theoretical properties as nonparametric priors are established. A blocked Gibbs sampling algorithm is devised to sample from the posterior of the multivariate density. A simulation study is conducted to evaluate the performance of the procedure.     

Construction of closed interval for process capability indices Cpu,Cpl, and Spk based on Boole’s inequality and de Morgan’s laws

ABSTRACT

Considerable effort has been spent on the development of confidence intervals for process capability indices (PCIs) based on the sampling distribution of the PCI or the transferred PCI. However, there is still no definitive way to construct a closed interval for a PCI. The aim of this study is to develop closed intervals for the PCIs C_pu, C_pl, and S_pk based on Boole's inequality and de Morgan's laws. The relationships between different sample sizes, the significance levels, and the confidence intervals of the PCIs C_pu, C_pl, and S_pk are investigated. Then, a testing model for interval estimation for the PCIs C_pu, C_pl, and S_pk is built as a powerful tool for measuring the quality performance of a product. Finally, an applied example is given to demonstrate the effectiveness and applicability of the proposed method and the testing model.     

Transductive versions of the LASSO and the Dantzig Selector

Transductive methods are useful in prediction problems when the training dataset is composed of a large number of unlabeled observations and a smaller number of labeled observations. In this paper, we propose an approach for developing transductive prediction procedures that are able to take advantage of the sparsity in the high dimensional linear regression. More precisely, we define transductive versions of the LASSO (Tibshirani, 1996) and the Dantzig Selector (Candès and Tao, 2007). These procedures combine labeled and unlabeled observations of the training dataset to produce a prediction for the unlabeled observations. We propose an experimental study of the transductive estimators that shows that they improve the LASSO and Dantzig Selector in many situations, and particularly in high dimensional problems when the predictors are correlated. We then provide non-asymptotic theoretical guarantees for these estimation methods. Interestingly, our theoretical results show that the Transductive LASSO and Dantzig Selector satisfy sparsity inequalities under weaker assumptions than those required for the “original” LASSO.     

A note on spectral estimation for ARMA processes

The standard frequency domain approximation to the Gaussian likelihood of a sample from an ARMA process is considered. The Newton-Raphson and Gauss-Newton numerical maximisation algorithms are evaluated for this approximate likelihood and the relationships between these algorithms and those of Akaike and Hannan explored. In particular it is shown that Hannan's method has certain computational advantages compared to the other spectral estimation methods considered     

城市高密度人口分布下的社区建设——以广州荔湾区为例

以广州荔湾区“六普”资料为根据，就人口高密度分布与社区建设的关系进行梳理与探讨。荔湾区“六普”数据显示，城区人口密度过高，成为影响社区生活的主要因素，给居民生命安全、公共生活质量与日常生活便利性带来负面效应。科学化与人性化人口密度干预是治理高密度人口问题的理性策略，如“跳出”社区视野，在城市“一盘棋”中均衡人口布局，在社区建设中，通过社区更新改造，增强人口承载能力，通过建构便利舒适人居环境，提升社区生活质量。