A Spatial-temporal Model for Temperature with Seasonal Variance

We propose a spatial-temporal stochastic model for daily average surface temperature data. First, we build a model for a single spatial location, independently on the spatial information. The model includes trend, seasonality, and mean reversion, together with a seasonally dependent variance of the residuals. The spatial dependency is modelled by a Gaussian random field. Empirical fitting to data collected in 16 measurement stations in Lithuania over more than 40 years shows that our model captures the seasonality in the autocorrelation of the squared residuals, a property of temperature data already observed by other authors. We demonstrate through examples that our spatial-temporal model is applicable for prediction and classification.     

检测系统分辨力定量计算的研究

分辨力是传感器和测量仪器的重要技术参数。数字仪器的分辨力通常取决于内部模数转换器的位数,但如何确定由仪器和传感器组成的检测系统的分辨力,目前尚未见到与之相关的专门性研究成果。该文论证了检测系统的分辨力只与随机误差相关,要提高分辨力就必须减小测量结果的随机波动。通过实验提出了检测系统分辨力的定量计算公式,并证明了其置信概率大于90.9%。     

干线战术通信网的抗毁模型研究

介绍了抗毁通信网分析与设计的原理和方法、针对干线战术通信网中节点移动会导致网络拓扑结构发生变化的特点,提出了动态网络拓扑设计模型和衡量干线战术通信网的抗毁性能的数学模型—随机图模型和齐次随机图模型、计算机模拟结果验证了随机图模型和齐次随机图模型的正确性.     

Smoothing parameter selection in nonparametric regression using an improved Akaike information criterion

Many different methods have been proposed to construct nonparametric estimates of a smooth regression function, including local polynomial, (convolution) kernel and smoothing spline estimators. Each of these estimators uses a smoothing parameter to control the amount of smoothing performed on a given data set. In this paper an improved version of a criterion based on the Akaike information criterion (AIC), termed AIC_C, is derived and examined as a way to choose the smoothing parameter. Unlike plug-in methods, AIC_C can be used to choose smoothing parameters for any linear smoother, including local quadratic and smoothing spline estimators. The use of AIC_C avoids the large variability and tendency to undersmooth (compared with the actual minimizer of average squared error) seen when other 'classical' approaches (such as generalized cross-validation (GCV) or the AIC) are used to choose the smoothing parameter. Monte Carlo simulations demonstrate that the AIC_C-based smoothing parameter is competitive with a plug-in method (assuming that one exists) when the plug-in method works well but also performs well when the plug-in approach fails or is unavailable.     

A semiparametric method of multiple imputation

In this paper, we describe how to use multiple imputation semiparametrically to obtain estimates of parameters and their standard errors when some individuals have missing data. The methods given require the investigator to know or be able to estimate the process generating the missing data but requires no full distributional form for the data. The method is especially useful for non-standard problems, such as estimating the median when data are missing.     

半平面上有限级随机Dirichlet级数的增长性

证明了右半平面上有限级随机Dirichlet级数的增长性几乎必然与其在每条水平直线上的增长性相同。     

Subsampling Variance Estimation for Non-stationary Spatial Lattice Data

ABSTRACT.  Most proposed subsampling and resampling methods in the literature assume stationary data. In many empirical applications, however, the hypothesis of stationarity can easily be rejected. In this paper, we demonstrate that moment and variance estimators based on the subsampling methodology can also be employed for different types of non-stationarity data. Consistency of estimators are demonstrated under mild moment and mixing conditions. Rates of convergence are provided, giving guidance for the appropriate choice of subshape size. Results from a small simulation study on finite-sample properties are also reported.     

On Tiku's robust procedure — a Bayesian insight

Tiku's robust procedure for testing mean and variance from nonnormal universe is examined from the Bayesian viewpoint. The posterior distribution of the scale parameter is derived and then approximated by a Laguerre polynomial expansion while the posterior distribution of the location parameter is approximated by a linear combination of t-distributions. For the example with Darwin's data, the approximations appear to be extremely good.     

Convergence of Heavy-tailed Monte Carlo Markov Chain Algorithms

Abstract.  In this paper, we use recent results of Jarner & Roberts ( Ann. Appl. Probab., 12, 2002, 224) to show polynomial convergence rates of Monte Carlo Markov Chain algorithms with polynomial target distributions, in particular random-walk Metropolis algorithms, Langevin algorithms and independence samplers. We also use similar methodology to consider polynomial convergence of the Gibbs sampler on a constrained state space. The main result for the random-walk Metropolis algorithm is that heavy-tailed proposal distributions lead to higher rates of convergence and thus to qualitatively better algorithms as measured, for instance, by the existence of central limit theorems for higher moments. Thus, the paper gives for the first time a theoretical justification for the common belief that heavy-tailed proposal distributions improve convergence in the context of random-walk Metropolis algorithms. Similar results are shown to hold for Langevin algorithms and the independence sampler, while results for the mixing of Gibbs samplers on uniform distributions on constrained spaces are rather different in character.