1. <menuitem id="m63kj"></menuitem>
        <tbody id="m63kj"><div id="m63kj"></div></tbody>
        <bdo id="m63kj"></bdo>
      2. <tbody id="m63kj"><div id="m63kj"></div></tbody>
        1. <menuitem id="m63kj"><dfn id="m63kj"><delect id="m63kj"></delect></dfn></menuitem>
            您當前所在位置: 首頁 > 學者


            • 61瀏覽

            • 0點贊

            • 0收藏

            • 1分享

            • 52下載

            • 0評論

            • 引用


            Combinatorial constructions for optimal supersaturated designs

            劉民千 , Kai-Tai Fang a , Gennian Ge b , * , Min-Qian Liu c , Hong Qin d , a

            Discrete Mathematics 279(2004)191-202,-0001,():



            Combinatorial designs have long had substantial application in the statistical design ofexperiments, and in the theory oferror-correcting codes. Applications in experimental and theoretical computer science, communications, cryptography and networking have also emerged in recent years. In this paper, we focus on a new application of combinatorial design theory in experimental design theory. E(fNOD) criterion is used as a measure ofnon-orthogonality ofU-type designs, and a lower bound of E(fNOD) which can serve as a benchmark ofdesign optimality is obtained. A U-type design is E(fNOD)-optimal ifits E(fNOD) value achieves the lower bound. In most cases, E(fNOD)-optimal U-type designs are supersaturated. We show that a kind of E(fNOD)-optimal designs are equivalent to uniformly resolvable designs. Based on this equivalence, several new in<nite classes for the existence of E(fNOD)-optimal designs are then obtained.

            【免責聲明】以下全部內容由[劉民千]上傳于[2010年03月13日 14時31分15秒],版權歸原創者所有。本文僅代表作者本人觀點,與本網站無關。本網站對文中陳述、觀點判斷保持中立,不對所包含內容的準確性、可靠性或完整性提供任何明示或暗示的保證。請讀者僅作參考,并請自行承擔全部責任。


            全部評論 0