首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 109 毫秒
1.
Clear effects criterion is one of the important rules for selecting optimal fractional factorial designs,and it has become an active research issue in recent years.Tang et al.derived upper and lower bounds on the maximum number of clear two-factor interactions(2fi's) in 2n-(n-k) fractional factorial designs of resolutions III and IV by constructing a 2n-(n-k) design for given k,which are only restricted for the symmetrical case.This paper proposes and studies the clear effects problem for the asymmetrical case.It improves the construction method of Tang et al.for 2n-(n-k) designs with resolution III and derives the upper and lower bounds on the maximum number of clear two-factor interaction components(2fic's) in 4m2n designs with resolutions III and IV.The lower bounds are achieved by constructing specific designs.Comparisons show that the number of clear 2fic's in the resulting design attains its maximum number in many cases,which reveals that the construction methods are satisfactory when they are used to construct 4m2n designs under the clear effects criterion.  相似文献   

2.
Space-filling designs are widely used in various fields because of their nice space-filling properties.Uniform designs are one of space-filling designs, which desires the experimental points to scatter uniformly over the experimental area. For practical need, the construction and their properties of nine-level uniform designs are discussed via two code mappings in this paper. Firstly, the algorithm of constructing nine-level uniform designs is presented from an initial three-level design by the ...  相似文献   

3.
Fractional factorial split-plot (FFSP) designs have an important value of investigation for their special structures. There are two types of factors in an FFSP design: the whole-plot (WP) factors and sub-plot (SP) factors, which can form three types of two-factor interactions: WP2fi, WS2fi and SP2fi. This paper considers FFSP designs with resolutionⅢorⅣunder the clear effects criterion. It derives the upper and lower bounds on the maximum numbers of clear WP2fis and WS2fis for FFSP designs, and gives some methods for constructing the desired FFSP designs. It further examines the performance of the construction methods.  相似文献   

4.
Clear effects criterion is an important criterion for selecting fractional factorial designs[1].Tang et al.[2]derived upper and lower bounds on the maximum number of clear two-factor interactions(2fi's)in 2^n-(n-k)designs of resolution Ⅲ and Ⅳ by constructing 2^n-(n-k)designs.But the method in[2]does not perform well sometimes when the resolution is Ⅲ.This article modifies the construction method for 2^n-(n-k) designs of resolution Ⅲ in[2].The modified method is a great improvement on that used in[2].  相似文献   

5.
This paper is concerned with the uniformity of a certain kind of resolvable incomplete block (RIB for simplicity) design which is called the PRIB design here. A sufficient and necessary condition is obtained, under which a PRIB design is the most uniform in the sense of a discrete discrepancy measure, and the uniform PRIB design is shown to be connected. A construction method for such designs via a kind of U-type designs is proposed, and an existence result of these designs is given. This method sets up an important bridge between PRIB designs and U-type designs.  相似文献   

6.
Construction of optimal supersaturated designs by the packing method   总被引:5,自引:1,他引:4  
A supersaturated design is essentially a factorial design with the equal occurrence of levels property and no fully aliased factors in which the number of main effects is greater than the number of runs. It has received much recent interest because of its potential in factor screening experiments. A packing design is an important object in combinatorial design theory. In this paper, a strong link between the two apparently unrelated kinds of designs is shown. Several criteria for comparing supersaturated designs are proposed, their properties and connections with other existing criteria are discussed. A combinatorial approach, called the packing method, for constructing optimal supersaturated designs is presented, and properties of the resulting designs are also investigated. Comparisons between the new designs and other existing designs are given, which show that our construction method and the newly constructed designs have good properties.  相似文献   

7.
We study further the method of concatenating the outputs of two functions for designing an APN or a differentially 4-uniform (n, n)-function for every even n. We deduce several specific constructions of APN or differentially 4-uniform (n, n)-functions from APN and differentially 4-uniform (n/2, n/2)-functions. We also give a construction of quadratic APN functions which includes as particular cases a previous construction by the author and a more recent construction by Pott and Zhou.  相似文献   

8.
Let F be a p-adic field of characteristic 0.We study a twisted local descent construction for the metaplectic groups Sp_(2 n)(F),and also its relation to the corresponding local descent construction for odd special orthogonal groups via local theta correspondence.In consequence,we show that this descent construction gives irreducible supercuspidal genuine representations of Sp_(2n)(-F) parametrized by a simple local L-parameter φ_τ corresponding to an irreducible supercuspidal representation τ of GL_(2n)(F) of symplectic type,and the genericity of the representations constructed can be indicated by a local epsilon factor condition.In particular,this local descent construction recovers the local Shimura correspondence for supercuspidal representations.  相似文献   

9.
1 IntroductionAn rerun design for m two-level faCtors is saturated if n = m 1. Such designs haveminimum number of runs for estimating all the main effects when the interactions are negligible,and are useful for screening experiments in the initial stage of an investigation where the primarygoal is to identify the few active faCtors from a large number of potential faCtors. And whelln < in 1, such designs are called supersaturated designs, which provide more flexibility andcost saving. No…  相似文献   

10.
CONSTRUCTING UNIFORM DESIGNS WITH TWO- OR THREE-LEVEL   总被引:1,自引:0,他引:1  
When the number of runs is large, to search for uniform designs in the sense of low-discrepancy is an NP hard problem. The number of runs of most of the available uniform designs is small (≤50). In this article, the authors employ a kind of the so-called Hamming distance method to construct uniform designs with two- or three-level such that some resulting uniform designs have a large number of runs. Several infinite classes for the existence of uniform designs with the same Hamming distances between any distinct rows are also obtained simultaneously. Two measures of uniformity, the centered L2-discrepancy (CD, for short) and wrap-around L2-discrepancy (WD, for short), are employed.  相似文献   

11.
Clear effects criterion is one of the important rules for selecting optimal fractional factorial designs, and it has become an active research issue in recent years. Tang et al. derived upper and lower bounds on the maximum number of clear two-factor interactions (2fi’s) in 2 n−(n−k) fractional factorial designs of resolutions III and IV by constructing a 2 n−(n−k) design for given k, which are only restricted for the symmetrical case. This paper proposes and studies the clear effects problem for the asymmetrical case. It improves the construction method of Tang et al. for 2 n−(n−k) designs with resolution III and derives the upper and lower bounds on the maximum number of clear two-factor interaction components (2fic’s) in 4 m 2 n designs with resolutions III and IV. The lower bounds are achieved by constructing specific designs. Comparisons show that the number of clear 2fic’s in the resulting design attains its maximum number in many cases, which reveals that the construction methods are satisfactory when they are used to construct 4 m 2 n designs under the clear effects criterion. This work was supported by the National Natural Science Foundation of China (Grant Nos. 10571093, 10671099 and 10771123), the Research Foundation for Doctor Programme (Grant No. 20050055038) and the Natural Science Foundation of Shandong Province of China (Grant No. Q2007A05). Zhang’s research was also supported by the Visiting Scholar Program at Chern Institute of Mathematics.  相似文献   

12.
A Hamilton path tournament design involving n teams and n/2 stadiums, is a round robin schedule on n − 1 days in which each team plays in each stadium at most twice, and the set of games played in each stadium induce a Hamilton path on n teams. Previously, Hamilton path tournament designs were shown to exist for all even n not divisible by 4, 6, or 10. Here, we give an inductive procedure for the construction of Hamilton path tournament designs for n = 2 p ≥ 8 teams.  相似文献   

13.
Summary Recently Saha and Das [10] constructed partially balanced incomplete block (PBIB) designs of two and more associate classes by using confounded designs for 2 n factorials. Several new designs of two associate classes were obtained through those methods. This paper generalizes one of the earlier methods of construction to obtain several series ofT m -type (m≧2) PBIB designs, i.e., the designs havingm-dimensional triangular association schemes. Some more new designs of two associate classes (i.e.,T 2-type) are obtained through the generalized methods of construction.  相似文献   

14.
If there is a Hadamard design of order n, then there are at least 28n−16−9log n non-isomorphic Hadamard designs of order 2n. Mathematics Subject Classificaion 2000: 05B05  相似文献   

15.
We give a construction of a series of 2-(n, 3,q 2+q+1;q) designs of vector spaces over a finite fieldGF(q) of odd characteristic. These designs correspond to those constructed by Thomas and the author for even characteristic. As a natural generalization we give a collection ofm-dimensional subspaces which possibly become a 2-(n, m, λ; q) design.  相似文献   

16.
R. D. Baker 《Combinatorica》1982,2(2):103-109
IfP is a finite projective plane of ordern with a proper subplaneQ of orderm which is not a Baer subplane, then a theorem of Bruck [Trans. AMS 78(1955), 464–481] asserts thatnm 2+m. If the equalityn=m 2+m were to occur thenP would be of composite order andQ should be called a Bruck subplane. It can be shown that if a projective planeP contains a Bruck subplaneQ, then in factP contains a designQ′ which has the parameters of the lines in a three dimensional projective geometry of orderm. A well known scheme of Bruck suggests using such aQ′ to constructP. Bruck’s theorem readily extends to symmetric designs [Kantor, Trans. AMS 146 (1969), 1–28], hence the concept of a Bruck subdesign. This paper develops the analoque ofQ′ and shows (by example) that the analogous construction scheme can be used to find symmetric designs.  相似文献   

17.
We consider extremum problems for entire functions of exponential spherical type related to important extremum problems on the optimal point (the Chernykh point) in the sharp jackson inequality in the spaceL 2(ℝ n ) and the connection between codes and designs on the torusT n . Translated fromMatematicheskie Zametki, Vol. 68, No. 2, pp. 179–187, August, 2000.  相似文献   

18.
Let K q (n, w, t, d) be the minimum size of a code over Z q of length n, constant weight w, such that every word with weight t is within Hamming distance d of at least one codeword. In this article, we determine K q (n, 4, 3, 1) for all n ≥ 4, q = 3, 4 or q = 2 m  + 1 with m ≥ 2, leaving the only case (q, n) = (3, 5) in doubt. Our construction method is mainly based on the auxiliary designs, H-frames, which play a crucial role in the recursive constructions of group divisible 3-designs similar to that of candelabra systems in the constructions of 3-wise balanced designs. As an application of this approach, several new infinite classes of nonuniform group divisible 3-designs with block size four are also constructed.  相似文献   

19.
We present a short and direct proof (based on the Pontryagin-Thom construction) of the following Pontryagin-Steenrod-Wu theorem: (a) LetM be a connected orientable closed smooth (n + 1)-manifold,n≥3. Define the degree map deg: π n (M) →H n (M; ℤ) by the formula degf =f*[S n ], where [S n ] εH n (M; ℤ) is the fundamental class. The degree map is bijective, if there existsβ εH 2(M, ℤ/2ℤ) such thatβ ·w 2(M) ε 0. If suchβ does not exist, then deg is a 2-1 map; and (b) LetM be an orientable closed smooth (n+2)-manifold,n≥3. An elementα lies in the image of the degree map if and only ifρ 2 α ·w 2(M)=0, whereρ 2: ℤ → ℤ/2ℤ is reduction modulo 2.  相似文献   

20.
A defining set of a t-(v, k, λ) design is a partial design which is contained in a unique t-design with the given parameters. A minimal defining set is a defining set, none of whose proper partial designs is a defining set. This paper proposes a new and more efficient algorithm that finds all non-isomorphic minimal defining sets of a given t-design. The complete list of minimal defining sets of 2-(6, 3, 6) designs, 2-(7, 3, 4) designs, the full 2-(7, 3, 5) design, a 2-(10, 4, 4) design, 2-(10, 5, 4) designs, 2-(13, 3, 1) designs, 2-(15, 3, 1) designs, the 2-(25, 5, 1) design, 3-(8, 4, 2) designs, the 3-(12, 6, 2) design, and 3-(16, 8, 3) designs are given to illustrate the efficiency of the algorithm. Also, corrections to the literature are made for the minimal defining sets of four 2-(7, 3, 3) designs, two 2-(6, 3, 4) designs and the 2-(21, 5, 1) design. Moreover, an infinite class of minimal defining sets for 2-((v) || 3){v\choose3} designs, where v ≥ 5, has been constructed which helped to show that the difference between the sizes of the largest and the smallest minimal defining sets of 2-((v) || 3){v\choose3} designs gets arbitrarily large as v → ∞. Some results in the literature for the smallest defining sets of t-designs have been generalized to all minimal defining sets of these designs. We have also shown that all minimal defining sets of t-(2n, n, λ) designs can be constructed from the minimal defining sets of their restrictions when t is odd and all t-(2n, n, λ) designs are self-complementary. This theorem can be applied to 3-(8, 4, 3) designs, 3-(8, 4, 4) designs and the full 3-(8 || 4)3-{8 \choose 4} design using the previous results on minimal defining sets of their restrictions. Furthermore we proved that when n is even all (n − 1)-(2n, n, λ) designs are self-complementary.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号