Level permutation method for constructing uniform designs under the wrap-aroundL2-discrepancy

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower bounds for wrap-around L2-discrepancy and constructions of symmetrical uniform designs

The wrap-around L2-discrepancy has been used in quasi-Monte Carlo methods, especially in experimental designs. In this paper, explicit lower bounds of the wrap-aroundL2-discrepancy of U-type designs are obtained. Sufficient conditions for U-type designs to achieve their lower bounds are given. Taking advantage of these conditions, we consider the perfect resolvable balanced incomplete block des...

متن کامل

A method for constructing generalised residual designs

A t-design rc with parameters t (u, k, A) is a finite incidence structure with u points and k points on each block such that any t-subset is contained in exactly 1 blocks. Incidence between a point P and a block d is denoted by P 1 d or d 1 P. We usually denote by b the number of blocks of 17. A block p of a t-design (t > 1) is said to be repeated x times if there exists exactly x blocks d such...

متن کامل

Constructing designs using the union method

Given a design V, other designs can be constructed by using unions of various sets of blocks as new blocks. This method of constructing designs is referred to as "the union method". In general, the constructed design has neither constant blocksize nor balance properties. Various situations in which balanced incomplete block designs (BIBD's) and group divisible designs (GDD's) can be constructed...

متن کامل

The discrepancy of permutation families∗

In this note, we show that the discrepancy of any family of ` permutations of [n] = {1, 2, . . . , n} is O( √ ` log n), improving on the O(` log n) bound due to Bohus (Random Structures & Algorithms, 1:215–220, 1990). In the case where ` ≥ n, we show that the discrepancy is Θ(min{ √ n log(2`/n), n}).

متن کامل

An algorithm for constructing mixed-level k-circulant supersaturated designs

Supersaturated design (SSD) has received much interest because of its potential in factor screening experiments. Recently, Chen and Liu [Chen, J., Liu, M.Q., 2008a. Optimal mixedlevel k-circulant supersaturated designs. J. Statist. Plann. Inference 138, 4151–4157] explored the construction of E(fNOD )-optimalmixed-level SSDs using k-cyclic generators. As an extension, this paper further studies...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Complexity

سال: 2014

ISSN: 0885-064X

DOI: 10.1016/j.jco.2013.09.003