A construction for generalized hadamard matrices

We prove that if p^r and p^r ? 1 are both prime powers then there is a generalized Hadamard matrix of order p^r(p^r ? 1) with elements from the elementary abelian group Z_p x?x Z_p. This result was motivated by results of Rajkundia on BIBD's. This result is then used to produce p^r ? 1 mutually orthogonal F-squares F(p^r(p^r ? 1); p^r ? 1).     

Exact two-sided Lieberman-Resnikoff sampling plans

We deal sith sampling by variables with two-way-protection in the case of aN(μσ²) distributed characteristic with unknown σ². For the sampling plan by Lieberman and Resnikoff (1955), which is based on the MVU estimator of the percent defective, we prove a formula for the OC. If the sampling parametersp ₁ (AQL),p ₂ (LQ) and α, β (type I, II errors) are given, we are able to compute the true type I and II errors of the usual (one-sided) approximation plans. Furthermore it is possible to compute exact two-sided Lieberman-Resnikoff sampling plans.     

Some p-ranks related to Hermitian varieties

We determine the p-rank of the incidence matrix of hyperplanes of PG(n, p^e) and points of a nondegenerate Hermitian variety. As a corollary, we obtain new bounds for the size of caps and the existence of ovoids in finite unitary spaces. This paper is a companion to an earlier work in which Blokhuis and this author (J. Algebraic Combin. 4 (1995), 295–316) derive the analogous p-ranks for quadrics.     

Lp-estimators in ARCH models

For ergodic ARCH processes, we introduce a one-parameter family of L_p-estimators. The construction is based on the concept of weighted M-estimators. Under weak assumptions on the error distribution, the consistency is established. The asymptotic normality is proved for the special cases p=1 and 2. To prove the asymptotic normality of the L₁-estimator, one needs the existence of a density of the squares of the errors, whereas for the L₂-estimator the existence of fourth moments is assumed. The asymptotic covariance matrix of the estimator depends on the unknown parameter which can be substituted by consistent estimators. For the L₁-estimator we construct a kernel estimator for the unknown density of the square of the errors.     

A modified Cp statistic in a system-of-equations model

A new statistic, SΓ(p), is developed for variable selection in a system-of-equations model. The standardized total mean square error in the SΓ(p)statistic is weighted by the covariance matrix of dependent variables instead of the error covariance matrix of the true model as in the original definition. The new statistic can be also used for model selection in the non-nested models. The estimate of SΓ(p), SC(p), is derived and shown to become SC_ε(p) in the similar form of C_p in a single-equation model when the covariance matrix of sampled dependent variables is replaced by the error covariance matrix under the full model.     

Growth of tuber crops and almost sure band for quantiles

Some tuber crops are governed by memoryless property of exponential distribution leading to a mixture distribution with heavy tail. Quantile-based estimators may then be appropriate than mean as a measure of central tendency. We prove almost sure representation theorems for sample quantiles in a general setup of U statistics, under slightly stronger assumption than assuming the existence of a continuously differentiable distribution function F for the kernel h. We obtain almost sure (a.s.) upper and lower estimate for F^{? 1}(p), p ∈ (0, 1) as a band for p varying. As an application, dataset arising from two varieties of potato cultivation are analyzed.     

Weakly resolvable IV.3 search designs for the pn factorial experiment

A series of weakly resolvable search designs for the pⁿ factorial experiment is given for which the mean and all main effects are estimable in the presence of any number of two-factor interactions and for which any combination of three or fewer pairs of factors that interact may be detected. The designs have N = p(p–1)n+p runs except in one case where additional runs are required for detection and one case where $\text{(p?1)}\text{2}$ additional runs are needed to estimate all (p–1)² degrees of freedom for each pair of detected interactions. The detection procedure is simple enough that computations can be carried out with hand calculations.     

Super efficient frequency estimation

In this paper we propose a modified Newton-Raphson method to obtain super efficient estimators of the frequencies of a sinusoidal signal in presence of stationary noise. It is observed that if we start from an initial estimator with convergence rate O_p(n⁻¹) and use Newton-Raphson algorithm with proper step factor modification, then it produces super efficient frequency estimator in the sense that its asymptotic variance is lower than the asymptotic variance of the corresponding least squares estimator. The proposed frequency estimator is consistent and it has the same rate of convergence, namely O_p(n^−3/2), as the least squares estimator. Monte Carlo simulations are performed to observe the performance of the proposed estimator for different sample sizes and for different models. The results are quite satisfactory. One real data set has been analyzed for illustrative purpose.     

Some aspects of the theory of estimating equations

An estimating equation for a parameter θ, based on an observation ?, is an equation g(x,θ)=0 which can be solved for θ in terms of x. An estimating equation is unbiased if the funaction g has 0 mean for every θ. For the case when the form of the frequency function p(x,θ) is completely specified up to the unknown real parameter θ, the optimality of the m.1 equation $\text{?}\text{log}\text{p}\text{?θ}\text{=0}$ in the class of all unbiased estimating equations was established by Godambe (1960). In this paper we allow the form of the frequency function p to vary assuming that $\text{x=(x}{}_1\text{,…,x}{}_{\mathrm{n}}\text{)?}\text{R}{}^{\mathrm{n}}$ and that under p, E(x_i)=θ. x₁,…, x_n are independent observations on a variate x, it is shown that among all the unbiased estimating equations for θ, $\text{x}\text{?}\text{?θ=0}$ is uniquely optimum up to a constant multiple.     

On Whiteman's and Storer's difference sets

In this paper, we prove that all Storer's difference sets are cyclic. We also prove that for p<1.8×10²⁵, Whiteman's difference sets exist if and only if (p,q)=(17,53) and (46817,140453).     

Empirical bayes rules for selecting good populations

A problem of selecting populations better than a control is considered. When the populations are uniformly distributed, empirical Bayes rules are derived for a linear loss function for both the known control parameter and the unknown control parameter cases. When the priors are assumed to have bounded supports, empirical Bayes rules for selecting good populations are derived for distributions with truncation parameters (i.e. the form of the pdf is f(x|θ)= p_i(x)c_i(θ)I_{(0, θ)}(x)). Monte Carlo studies are carried out which determine the minimum sample sizes needed to make the relative errors less than ε for given ε-values.     

Two remarks on order statistics

Let X₍₁₎,…,X_(n) be the order statistics of n iid distributed random variables. We prove that (X_(i)) have a certain Markov property for general distributions and secondly that the order statistics have monotone conditional regression dependence. Both properties are well known in the case of continuous distributions.     

On the construction of orthogonal F-squares of order n from an orthogonal array (n, k, s, 2) and an OL(s, t) set

Complete sets of orthogonal F-squares of order n = s^p, where g is a prime or prime power and p is a positive integer have been constructed by Hedayat, Raghavarao, and Seiden (1975). Federer (1977) has constructed complete sets of orthogonal F-squares of order n = 4t, where t is a positive integer. We give a general procedure for constructing orthogonal F-squares of order n from an orthogonal array (n, k, s, 2) and an OL(s, t) set, where n is not necessarily a prime or prime power. In particular, we show how to construct sets of orthogonal F-squares of order n = 2s^p, where s is a prime or prime power and p is a positive integer. These sets are shown to be near complete and approach complete sets as s and/or p become large. We have also shown how to construct orthogonal arrays by these methods. In addition, the best upper bound on the number t of orthogonal F(n, λ₁), F(n, λ₂), …, F(n, λ₁) squares is given.     

Optimal Designs for Approximating a Stochastic Process with Respect to a Minimax Criterion

We study the problem of approximating a stochastic process Y = {Y(t: t ∈ T} with known and continuous covariance function R on the basis of finitely many observations Y(t ₁,), …, Y(t _n ). Dependent on the knowledge about the mean function, we use different approximations ? and measure their performance by the corresponding maximum mean squared error sub _t∈T E(Y(t) ? ?(t))². For a compact T ? ? ^p we prove sufficient conditions for the existence of optimal designs. For the class of covariance functions on T ² = [0, 1]² which satisfy generalized Sacks/Ylvisaker regularity conditions of order zero or are of product type, we construct sequences of designs for which the proposed approximations perform asymptotically optimal.     

Second order asymptotic relations of M-estimators and R-estimators in two-sample location model

Let T_M be an M-estimator (maximum likelihood type estimator) and T_R be an R-estimator (Hodges-Lehmann's estimator) of the shift parameter Δ in the two-sample location model. The asymptotic representation of √N(T_M-T_R) up to a term of the order O_p(N^{-$\text{1}\text{4}$}) is derived which is valid if the functions Ψ and ? generating T_M and T_R, respectively, decompose into an absolutely continuous and a step-function components; the order O_p(N^{-$\text{1}\text{4}$}) cannot be improved unless the discontinuous components vanish. As a consequence, the conditions under which √N(T_M-T_R)=O_p(N^{-$\text{1}\text{4}$}) are obtained. The main tool for obtaining the results is the second order asymptotic linearity of the pertaining linear rank statistics which is proved here under the assumption that the score-generating function ? has some jump-discontinuities.     

ON TRANSITION PROBABILITIES OF SKIP-FREE MARKOV CHAINS

Consider an ergodic Markov chain X(t) in continuous time with an infinitesimal matrix Q = (q_ij) defined on a finite state space {0, 1,…, N}. In this note, we prove that if X(t) is skip-free positive (negative, respectively), i.e., q_ij, = 0 for j > i+ 1 (i > j+ 1), then the transition probability p_ij(t) = Pr[X(t)=j | X(0) =i] can be represented as a linear combination of p_0N(t) (p^(m)_(N0)(t)), 0 ≤ m ≤N, where f^(m)(t) denotes the mth derivative of a function f(t) with f⁽⁰⁾(t) =f(t). If X(t) is a birth-death process, then p_ij(t) is represented as a linear combination of p_0N^(m)(t), 0 ≤m≤N - |i-j|.     

Super-simple group divisible designs with block size 4 and index 9

A design is said to be super-simple if the intersection of any two blocks has at most two elements. In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple GDDs are useful in constructing super-simple BIBDs. The existence of super-simple (4,λ)‐GDDs has been determined for λ=2-6. In this paper, we investigate the existence of a super-simple (4,9)-GDD of group type g^u and show that such a design exists if and only if u≥4, g(u−2)≥18 and u(u−1)g²≡0 (mod 4).     

Goodness-of-Fit of the Distribution of Time-to-First-Occurrence in Recurrent Event Models

Imperfect repair models are a class of stochastic models that deal with recurrent phenomena. This article focuses on the Block, Borges, and Savits (1985) age-dependent minimal repair model (the BBS model) in which a system that fails at time t undergoes one of two types of repair: with probability p(t), a perfect repair is performed, or with probability 1-p(t), a minimal repair is performed. The goodness-of-fit problem of interest concerns the initial distribution of the failure ages. In particular, interest is on testing the null hypothesis that the hazard rate function of the time-to-first-event-occurrence, λ(·), is equal to a prespecified hazard rate function λ₀(·). This paper extends the class of hazard-based smooth goodness-of-fit tests introduced in Peña (1998a) to the case where data accrual is from a BBS model. The goodness-of-fit tests are score tests derived by reformulating Neyman's idea of smooth tests in terms of hazard functions. Omnibus as well as directional tests are developed and simulation results are presented to illustrate the sensitivities of the proposed tests for certain types of alternatives.     

Lp (1 < p ⩽ 2) solutions of one-dimensional BSDEs whose generator is weakly monotonic in y and non-Lipschitz in z

ABSTRACT

In this paper, we start with establishing the existence of a minimal (maximal) L^p (1 < p ? 2) solution to a one-dimensional backward stochastic differential equation (BSDE), where the generator g satisfies a p-order weak monotonicity condition together with a general growth condition in y and a linear growth condition in z. Then, we propose and prove a comparison theorem of L^p (1 < p ? 2) solutions to one-dimensional BSDEs with q-order (1 ? q < p) weak monotonicity and uniform continuity generators. As a consequence, an existence and uniqueness result of L^p (1 < p ? 2) solutions is also given for BSDEs whose generator g is q-order (1 ? q < p) weakly monotonic with a general growth in y and uniformly continuous in z.     

Sequential estimation of the sum of sinusoidal model parameters

Estimating the parameters of the sum of a sinusoidal model in presence of additive noise is a classical problem. It is well known to be a difficult problem when the two adjacent frequencies are not well separated or when the number of components is very large. In this paper we propose a simple sequential procedure to estimate the unknown frequencies and amplitudes of the sinusoidal signals. It is observed that if there are p components in the signal then at the k  th (k?p)$(k?p)$ stage our procedure produces strongly consistent estimators of the k   dominant sinusoids. For k>p$k>p$, the amplitude estimators converge to zero almost surely. Asymptotic distribution of the proposed estimators is also established and it is observed that it coincides with the asymptotic distribution of the least squares estimators. Numerical simulations are performed to observe the performance of the proposed estimators for different sample sizes and for different models. One ECG data and one synthesized data are analyzed for illustrative purpose.