共查询到20条相似文献,搜索用时 31 毫秒
1.
The problem of classifying all isomorphism classes of OA(N,k,s,t)'s is shown to be equivalent to finding all isomorphism classes of non-negative integer solutions to a system of linear equations under the symmetry group of the system of equations. A branch-and-cut algorithm developed by Margot [2002. Pruning by isomorphism in branch-and-cut. Math. Programming Ser. A 94, 71–90; 2003a. Exploiting orbits in symmetric ILP. Math. Programming Ser. B 98, 3–21; 2003b. Small covering designs by branch-and-cut. Math. Programming Ser. B 94, 207–220; 2007. Symmetric ILP: coloring and small integers. Discrete Optim., 4, 40–62] for solving integer programming problems with large symmetry groups is used to find all non-isomorphic OA(24,7,2,2)'s, OA(24,k,2,3)'s for 6?k?11, OA(32,k,2,3)'s for 6?k?11, OA(40,k,2,3)'s for 6?k?10, OA(48,k,2,3)'s for 6?k?8, OA(56,k,2,3)'s, OA(80,k,2,4)'s, OA(112,k,2,4)'s, for k=6,7, OA(64,k,2,4)'s, OA(96,k,2,4)'s for k=7,8, and OA(144,k,2,4)'s for k=8,9. Further applications to classifying covering arrays with the minimum number of runs and packing arrays with the maximum number of runs are presented. 相似文献
2.
José Antonio Moler Fernando Plo Miguel San Miguel 《Journal of statistical planning and inference》2007
We study a randomized adaptive design to assign one of the L treatments to patients who arrive sequentially by means of an urn model. At each stage n, a reward is distributed between treatments. The treatment applied is rewarded according to its response, 0?Yn?1, and 1-Yn is distributed among the other treatments according to their performance until stage n-1. Patients can be classified in K+1 levels and we assume that the effect of this level in the response to the treatments is linear. We study the asymptotic behavior of the design when the ordinary least square estimators are used as a measure of performance until stage n-1. 相似文献
3.
E-optimal designs for comparing three treatments in blocks of size three are identified, where intrablock observations are correlated according to a first order autoregressive error process with parameter ρ∈(0,1). For number of blocks b of the form b=3n+1, there are two distinct optimal designs depending on the value of ρ, with the best design being unequally replicated for large ρ. For other values of b, binary, equireplicate designs with specified within-block assignment patterns are best. In many cases, the stronger majorization optimality is established. 相似文献
4.
In Hedayat and Pesotan [1992, Two-level factorial designs for main effects and selected two-factor interactions. Statist. Sinica 2, 453–464.] the concepts of a g(n,e)-design and a g(n,e)-matrix are introduced to study designs of n factor two-level experiments which can unbiasedly estimate the mean, the n main effects and e specified two-factor interactions appearing in an orthogonal polynomial model and it is observed that the construction of a g-design is equivalent to the construction of a g -matrix. This paper deals with the construction of D-optimal g(n,1)-matrices. A standard form for a g(n,1)-matrix is introduced and some lower and upper bounds on the absolute determinant value of a D-optimal g(n,1)-matrix in the class of all g(n,1)-matrices are obtained and an approach to construct D-optimal g(n,1)-matrices is given for 2?n?8. For two specific subclasses, namely a certain class of g(n,1)-matrices within the class of g(n,1)-matrices of index one and the class C(H) of g(8t+2,1)-matrices constructed from a normalized Hadamard matrix H of order 8t+4(t?1) two techniques for the construction of the restricted D-optimal matrices are given. 相似文献
5.
We consider Bayesian density estimation for compactly supported densities using Bernstein mixtures of beta-densities equipped with a Dirichlet prior on the distribution function. We derive the rate of convergence for α-smooth densities for 0<α?2 and show that a faster rate of convergence can be obtained by using fewer terms in the mixtures than proposed before. The Bayesian procedure adapts to the unknown value of α. The modified Bayesian procedure is rate-optimal if α is at most one. This result can be extended to two dimensions. 相似文献
6.
Super-simple cyclic designs are useful on constructing codes and designs such as superimposed codes, perfect hash families and optical orthogonal codes with index two. In this paper, we show that there exists a super-simple cyclic (v,4,λ) for 7?v?41 and all admissible λ with two definite exceptions of (v,λ)=(9,3),(13,5) and one possible exception of (v,λ)=(39,18). Some useful algorithms are explained for computer search and new designs are displayed. 相似文献
7.
Consider the model where there are I independent multivariate normal treatment populations with p×1 mean vectors μi, i=1,…,I, and covariance matrix Σ. Independently the (I+1)st population corresponds to a control and it too is multivariate normal with mean vector μI+1 and covariance matrix Σ. Now consider the following two multiple testing problems. 相似文献
8.
We consider a linear regression model with regression parameter β=(β1,…,βp) and independent and identically N(0,σ2) distributed errors. Suppose that the parameter of interest is θ=aTβ where a is a specified vector. Define the parameter τ=cTβ-t where the vector c and the number t are specified and a and c are linearly independent. Also suppose that we have uncertain prior information that τ=0. We present a new frequentist 1-α confidence interval for θ that utilizes this prior information. We require this confidence interval to (a) have endpoints that are continuous functions of the data and (b) coincide with the standard 1-α confidence interval when the data strongly contradict this prior information. This interval is optimal in the sense that it has minimum weighted average expected length where the largest weight is given to this expected length when τ=0. This minimization leads to an interval that has the following desirable properties. This interval has expected length that (a) is relatively small when the prior information about τ is correct and (b) has a maximum value that is not too large. The following problem will be used to illustrate the application of this new confidence interval. Consider a 2×2 factorial experiment with 20 replicates. Suppose that the parameter of interest θ is a specified simple effect and that we have uncertain prior information that the two-factor interaction is zero. Our aim is to find a frequentist 0.95 confidence interval for θ that utilizes this prior information. 相似文献
9.
In this paper, we study a random field U?(t,x) governed by some type of stochastic partial differential equations with an unknown parameter θ and a small noise ?. We construct an estimator of θ based on the continuous observation of N Fourier coefficients of U?(t,x), and prove the strong convergence and asymptotic normality of the estimator when the noise ? tends to zero. 相似文献
10.
In this note we provide a counterexample which resolves conjectures about Hadamard matrices made in this journal. Beder [1998. Conjectures about Hadamard matrices. Journal of Statistical Planning and Inference 72, 7–14] conjectured that if H is a maximal m×n row-Hadamard matrix then m is a multiple of 4; and that if n is a power of 2 then every row-Hadamard matrix can be extended to a Hadamard matrix. Using binary integer programming we obtain a maximal 13×32 row-Hadamard matrix, which disproves both conjectures. Additionally for n being a multiple of 4 up to 64, we tabulate values of m for which we have found a maximal row-Hadamard matrix. Based on the tabulated results we conjecture that a m×n row-Hadamard matrix with m?n-7 can be extended to a Hadamard matrix. 相似文献
11.
12.
We determine a credible set A that is the “best” with respect to the variation of the prior distribution in a neighborhood Γ of the starting prior π0(θ). Among the class of sets with credibility γ under π0, the “optimally robust” set will be the one which maximizes the minimum probability of including θ as the prior varies over Γ. This procedure is also Γ-minimax with respect to the risk function, probability of non-inclusion. We find the optimally robust credible set for three neighborhood classes Γ, the ε-contamination class, the density ratio class and the density bounded class. A consequence of this investigation is that the maximum likelihood set is seen to be an optimal credible set from a robustness perspective. 相似文献
13.
We consider m×m covariance matrices, Σ1 and Σ2, which satisfy Σ2-Σ1=Δ, where Δ has a specified rank. Maximum likelihood estimators of Σ1 and Σ2 are obtained when sample covariance matrices having Wishart distributions are available and rank(Δ) is known. The likelihood ratio statistic for a test about the value of rank(Δ) is also given and some properties of its null distribution are obtained. The methods developed in this paper are illustrated through an example. 相似文献
14.
The enumeration of binary cyclic self-orthogonal codes of length 63 is used to prove that any cyclic quasi-symmetric 2-(63,15,35) design with block intersection numbers x=3 and y=7 is isomorphic to the geometric design having as blocks the three-dimensional subspaces in PG(5,2). 相似文献
15.
Joseph P.S. Kung Anna de Mier Xinyu Sun Catherine Yan 《Journal of statistical planning and inference》2009
We consider paths in the plane with (1,0), (0,1), and (a,b)-steps that start at the origin, end at height n, and stay strictly to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at most b/a, then the ordinary generating function for the number of such paths ending at height n is algebraic. Our argument is in two parts. We use a simple combinatorial decomposition to obtain an Appell relation or “umbral” generating function, in which the power zn is replaced by a power series of the form znφn(z), where φn(0)=1. Then we convert (in an explicit way) the umbral generating function to an ordinary generating function by solving a system of linear equations and a polynomial equation. This conversion implies that the ordinary generating function is algebraic. We give several concrete examples, including an alternative way to solve the tennis ball problem. 相似文献
16.
Studying the right tail of a distribution, one can classify the distributions into three classes based on the extreme value index γ. The class γ>0 corresponds to Pareto-type or heavy tailed distributions, while γ<0 indicates that the underlying distribution has a finite endpoint. The Weibull-type distributions form an important subgroup within the Gumbel class with γ=0. The tail behaviour can then be specified using the Weibull tail index. Classical estimators of this index show severe bias. In this paper we present a new estimation approach based on the mean excess function, which exhibits improved bias and mean squared error. The asserted properties are supported by simulation experiments and asymptotic results. Illustrations with real life data sets are provided. 相似文献
17.
Improving the estimators of the parameters of a probit regression model: A ridge regression approach
This paper considered the estimation of the regression parameters of a general probit regression model. Accordingly, we proposed five ridge regression (RR) estimators for the probit regression models for estimating the parameters (β) when the weighted design matrix is ill-conditioned and it is suspected that the parameter β may belong to a linear subspace defined by Hβ=h. Asymptotic properties of the estimators are studied with respect to quadratic biases, MSE matrices and quadratic risks. The regions of optimality of the proposed estimators are determined based on the quadratic risks. Some relative efficiency tables and risk graphs are provided to illustrate the numerical comparison of the estimators. We conclude that when q≥3, one would uses PRRRE; otherwise one uses PTRRE with some optimum size α. We also discuss the performance of the proposed estimators compare to the alternative ridge regression method due to Liu (1993). 相似文献
18.
This paper discusses a new perspective in fitting spatial point process models. Specifically the spatial point process of interest is treated as a marked point process where at each observed event x a stochastic process M(x;t), 0<t<r, is defined. Each mark process M(x;t) is compared with its expected value, say F(t;θ), to produce a discrepancy measure at x, where θ is a set of unknown parameters. All individual discrepancy measures are combined to define an overall measure which will then be minimized to estimate the unknown parameters. The proposed approach can be easily applied to data with sample size commonly encountered in practice. Simulations and an application to a real data example demonstrate the efficacy of the proposed approach. 相似文献
19.
20.
Consider the partially balanced one-way layout for comparing k treatments μi,1?i?k, with a control μ0. We propose a new test which is similar to the test statistics of Marcus [1976. The powers of some tests of the equality of normal means against an ordered alternative. Biometrika 63, 177–183]. By simulation we find that the proposed test has a good power performance when compared with other tests. Moreover, it can produce confidence intervals for μi-μ0,1?i?k. 相似文献