An algorithm for maximum likelihood estimation in incomplete block variance component models

In the recovery of interblock information to improve the treatment differences estimates in incomplete block designs, the parameter p is usually unknown. Many authors have worked on the problem of estimating it and of studying its properties together with the properties of the treatment differences estimates. In this paper a numerically efficient algorithm is developed which yields the maximum likelihood estimates (MLE) of all the parameters in the mixed incomplete block design model (treatment effects, ρ and variance)     

An Extended Single‐index Model with Missing Response at Random

An extended single‐index model is considered when responses are missing at random. A three‐step estimation procedure is developed to define an estimator for the single‐index parameter vector by a joint estimating equation. The proposed estimator is shown to be asymptotically normal. An algorithm for computing this estimator is proposed. This algorithm only involves one‐dimensional nonparametric smoothers, thereby avoiding the data sparsity problem caused by high model dimensionality. Some simulation studies are conducted to investigate the finite sample performances of the proposed estimators.     

The performance of alternative estimators for the probit model with first-order serial correlation 1

The purpose of the paper is to evaluate the relative performance of two generalized conditional moment (GCM) estimators in terms of their mean squared errors, for the Probit model with first-order serial correlation. The first estimator is a linearized one-step estimator described by Poirier and Ruud (1988). The second one is defined in the present paper. Monte Car10 experiments suggest that the GCM estimators outperform the ordinary Probit estimator. The two GCM estimators do almost equally well, except that the second one may be easier to calculate, especially in large samples.     

分数阶长短波方程的整体光滑解

本文研究了分数阶长短波方程组的周期初边值问题,运用一致先验估计和Galerkin方法证明了分数阶长短波方程整体光滑解的存在性和唯一性.     

Conditional entropy,entropy density,and strong law of large numbers for generalized controlled tree-indexed Markov chains

In this paper, we first introduces a tree model without degree boundedness restriction namely generalized controlled tree T, which is an extension of some known tree models, such as homogeneous tree model, uniformly bounded degree tree model, controlled tree model, etc. Then some limit properties including strong law of large numbers for generalized controlled tree-indexed non homogeneous Markov chain are obtained. Finally, we establish some entropy density properties, monotonicity of conditional entropy, and entropy properties for generalized controlled tree-indexed Markov chains.     

Time series models with asymmetric Laplace innovations

We propose autoregressive moving average (ARMA) and generalized autoregressive conditional heteroscedastic (GARCH) models driven by asymmetric Laplace (AL) noise. The AL distribution plays, in the geometric-stable class, the analogous role played by the normal in the alpha-stable class, and has shown promise in the modelling of certain types of financial and engineering data. In the case of an ARMA model we derive the marginal distribution of the process, as well as its bivariate distribution when separated by a finite number of lags. The calculation of exact confidence bands for minimum mean-squared error linear predictors is shown to be straightforward. Conditional maximum likelihood-based inference is advocated, and corresponding asymptotic results are discussed. The models are particularly suited for processes that are skewed, peaked, and leptokurtic, but which appear to have some higher order moments. A case study of a fund of real estate returns reveals that AL noise models tend to deliver a superior fit with substantially less parameters than normal noise counterparts, and provide both a competitive fit and a greater degree of numerical stability with respect to other skewed distributions.     

C14. Moments of the kolmogorov-smirnov one-sample statistic

In adaptive estimation, it is often considered that an estimator has made a mistake if the component estimator chosen for use is not the most efficient for the distribution sampled. Theoretical and simulation results point to a fallacy in this line of thought. The Monte Carlo study involves extension of the Princeton Swindle to distributions conditional on a location and scale-free statistic, and to the uniform. The results give a partial explanation for the sometimes surprising robustness of adaptive L-estimators.     

Empirical Likelihood Inference for the Rao‐Hartley‐Cochran Sampling Design

The Hartley‐Rao‐Cochran sampling design is an unequal probability sampling design which can be used to select samples from finite populations. We propose to adjust the empirical likelihood approach for the Hartley‐Rao‐Cochran sampling design. The approach proposed intrinsically incorporates sampling weights, auxiliary information and allows for large sampling fractions. It can be used to construct confidence intervals. In a simulation study, we show that the coverage may be better for the empirical likelihood confidence interval than for standard confidence intervals based on variance estimates. The approach proposed is simple to implement and less computer intensive than bootstrap. The confidence interval proposed does not rely on re‐sampling, linearization, variance estimation, design‐effects or joint inclusion probabilities.     

Modified chain sampling plans for lot inspection by variables and attributes

The purpose of acceptance sampling is to develop decision rules to accept or reject production lots based on sample data. When testing is destructive or expensive, dependent sampling procedures cumulate results from several preceding lots. This chaining of past lot results reduces the required size of the samples. A large part of these procedures only chain past lot results when defects are found in the current sample. However, such selective use of past lot results only achieves a limited reduction of sample sizes. In this article, a modified approach for chaining past lot results is proposed that is less selective in its use of quality history and, as a result, requires a smaller sample size than the one required for commonly used dependent sampling procedures, such as multiple dependent sampling plans and chain sampling plans of Dodge. The proposed plans are applicable for inspection by attributes and inspection by variables. Several properties of their operating characteristic-curves are derived, and search procedures are given to select such modified chain sampling plans by using the two-point method.     

Conditional covariance penalties for mixed models

The prediction error for mixed models can have a conditional or a marginal perspective depending on the research focus. We introduce a novel conditional version of the optimism theorem for mixed models linking the conditional prediction error to covariance penalties for mixed models. Different possibilities for estimating these conditional covariance penalties are introduced. These are bootstrap methods, cross-validation, and a direct approach called Steinian. The behavior of the different estimation techniques is assessed in a simulation study for the binomial-, the t-, and the gamma distribution and for different kinds of prediction error. Furthermore, the impact of the estimation techniques on the prediction error is discussed based on an application to undernutrition in Zambia.