標(biāo)題: Titlebook: Designs 2002; Further Computationa W. D. Wallis Book 2003Latest edition Springer Science+Business Media New York 2003 algorithms.computer.c [打印本頁(yè)] 作者: Harrison 時(shí)間: 2025-3-21 18:44
書(shū)目名稱Designs 2002影響因子(影響力)
作者: 我的巨大 時(shí)間: 2025-3-21 22:30
978-1-4613-7958-4Springer Science+Business Media New York 2003作者: 最后一個(gè) 時(shí)間: 2025-3-22 01:02 作者: Cleave 時(shí)間: 2025-3-22 06:34 作者: Solace 時(shí)間: 2025-3-22 10:52 作者: 財(cái)產(chǎn) 時(shí)間: 2025-3-22 12:52
https://doi.org/10.1007/978-3-322-90425-6in one system fail to do so in the other. We define the quantity . (.) as the size of a maximum collection of pairwise orthogonal STS of order .. Special starters in the finite fields are used to improve the best known lower bounds on . (.) for prime-powers . ≡ 1 (mod 6), . < 500. Additionally, hill作者: 財(cái)產(chǎn) 時(shí)間: 2025-3-22 18:44
https://doi.org/10.1007/978-3-322-90425-6 the same parameters, two questions arise naturally:.Here we consider triple systems and latin squares. The first question leads to the ideas of a . in a triple system and of a . in a latin square. The second question leads to the ideas of a ., in particular a . defining set, in a triple system and 作者: 談判 時(shí)間: 2025-3-23 00:07 作者: dry-eye 時(shí)間: 2025-3-23 04:52 作者: 服從 時(shí)間: 2025-3-23 08:07
https://doi.org/10.1007/978-3-322-90425-6what balanced .-ary designs can be used in this construction. We settle several open existence cases for BTDs (including both suitable and unsuitable designs for our construction), and provide a number of suitable B.Ds.作者: Initial 時(shí)間: 2025-3-23 09:43 作者: micronized 時(shí)間: 2025-3-23 14:56 作者: 容易懂得 時(shí)間: 2025-3-23 20:23
https://doi.org/10.1007/978-3-322-90425-6what balanced .-ary designs can be used in this construction. We settle several open existence cases for BTDs (including both suitable and unsuitable designs for our construction), and provide a number of suitable B.Ds.作者: 我邪惡 時(shí)間: 2025-3-24 00:00 作者: Aprope 時(shí)間: 2025-3-24 05:40
https://doi.org/10.1007/978-3-322-82852-1In this paper, we investigate the existence of two self-orthogonal Latin squares with a symmetric orthogonal mate (2-SOLSSOMs). It is found that a 2-SOLSSOM(.) exists for all . ≥ 701 with at most 183 possible exceptions below this value. Also given are six MOLS of orders 45, 55, five of which give 2-SOLSSOM(45) and 2-SOLSSOM(55).作者: definition 時(shí)間: 2025-3-24 10:28 作者: nautical 時(shí)間: 2025-3-24 12:48 作者: 琺瑯 時(shí)間: 2025-3-24 14:53 作者: 躺下殘殺 時(shí)間: 2025-3-24 22:06 作者: 閃光東本 時(shí)間: 2025-3-25 00:17
Two-Stage Generalized Simulated Annealing for the Construction of Change-Over Designs,Kunert (1983) has found sufficient conditions for the optimal estimation of direct treatment effects from change-over designs. In this paper, a two-stage generalized simulated annealing algorithm uses these conditions to construct large change-over designs where .∣. and . and where . and .∣.作者: 1分開(kāi) 時(shí)間: 2025-3-25 06:30
Sets of Steiner Triple Systems of Order 9 Revisited,We determine all minimal large sets of 8 Steiner triple systems of order 9 (STS(9)); there are precisely four pairwise nonisomorphic solutions. We also classify all maximal sets of STS(9) which mutually intersect in the same number of triples (uniformly intersecting sets).作者: Fissure 時(shí)間: 2025-3-25 10:14 作者: FUSE 時(shí)間: 2025-3-25 13:31 作者: Institution 時(shí)間: 2025-3-25 17:25 作者: 放肆的你 時(shí)間: 2025-3-25 22:50 作者: 污點(diǎn) 時(shí)間: 2025-3-26 02:44
https://doi.org/10.1007/978-3-322-90425-6he profile and projections of Hadamard matrices. A summary is then given which considers inequivalence of Hadamard matrices of orders up to 44..The final two sections give algorithms for constructing orthogonal designs, short amicable and amicable sets for use in the Kharaghani array.作者: TRUST 時(shí)間: 2025-3-26 04:23
https://doi.org/10.1007/978-3-322-90425-6based on an analysis of group actions and improves on Burnside’s table of marks approach [15]. In particular, no knowledge of the full subgroup lattice of the symmetric group on the point set is needed.作者: EXALT 時(shí)間: 2025-3-26 11:47 作者: folliculitis 時(shí)間: 2025-3-26 15:32 作者: Flat-Feet 時(shí)間: 2025-3-26 20:48
https://doi.org/10.1007/978-3-322-90425-6es and defining sets of the triple system and the latin trades and critical sets of the square..We apply these ideas and construct new families of minimal defining sets for triple systems associated with .(., 3).作者: Devastate 時(shí)間: 2025-3-26 23:44
https://doi.org/10.1007/978-3-322-90425-6aper, we introduce a new construction for proportionally balanced designs when each variety occurs with one of precisely two possible frequencies, and provide some exhaustive lists of possible parameter sets, and sets of blocks for some of the corresponding designs. Two general constructions associated with this method are also discussed.作者: compassion 時(shí)間: 2025-3-27 04:27
On Minimal Defining Sets in ,(,,3),es and defining sets of the triple system and the latin trades and critical sets of the square..We apply these ideas and construct new families of minimal defining sets for triple systems associated with .(., 3).作者: sigmoid-colon 時(shí)間: 2025-3-27 08:59
Constructing a Class of Designs with Proportional Balance,aper, we introduce a new construction for proportionally balanced designs when each variety occurs with one of precisely two possible frequencies, and provide some exhaustive lists of possible parameter sets, and sets of blocks for some of the corresponding designs. Two general constructions associated with this method are also discussed.作者: conduct 時(shí)間: 2025-3-27 11:33
Combinatorial Trades: A Survey of Recent Results,ume 95, pp. 361–176) in 1999. In the short time since that survey appeared, the number of papers in the area has almost doubled. Trades are used in designs and latin squares; they also crop up in graph theory. In this paper the most recent work on trades is surveyed, with applications given.作者: AWE 時(shí)間: 2025-3-27 16:01 作者: Fretful 時(shí)間: 2025-3-27 18:30 作者: MIME 時(shí)間: 2025-3-28 02:00 作者: enlist 時(shí)間: 2025-3-28 05:45 作者: Parallel 時(shí)間: 2025-3-28 08:30 作者: 幻影 時(shí)間: 2025-3-28 13:58 作者: Hdl348 時(shí)間: 2025-3-28 15:48
New Lower Bounds on the Maximum Number of Mutually Orthogonal Steiner Triple Systems,in one system fail to do so in the other. We define the quantity . (.) as the size of a maximum collection of pairwise orthogonal STS of order .. Special starters in the finite fields are used to improve the best known lower bounds on . (.) for prime-powers . ≡ 1 (mod 6), . < 500. Additionally, hill作者: 染色體 時(shí)間: 2025-3-28 20:23
On Minimal Defining Sets in ,(,,3), the same parameters, two questions arise naturally:.Here we consider triple systems and latin squares. The first question leads to the ideas of a . in a triple system and of a . in a latin square. The second question leads to the ideas of a ., in particular a . defining set, in a triple system and 作者: Nmda-Receptor 時(shí)間: 2025-3-29 00:24
Hadamard Matrices, Orthogonal Designs and Construction Algorithms,he discret Fourier transform and the two circulants construction..Next we move to algorithms to determine the equivalence of Hadamard matrices using the profile and projections of Hadamard matrices. A summary is then given which considers inequivalence of Hadamard matrices of orders up to 44..The fi作者: MUT 時(shí)間: 2025-3-29 04:38
Constructing a Class of Designs with Proportional Balance,Test to have a certain property. They have further application in experiments where efficient achievement of the purposes demands that some of the objects of study (varieties) occur more frequently in the experiment than do others. Subsequently, Gray extended the theoretical results relating to such作者: HUSH 時(shí)間: 2025-3-29 09:17 作者: Fester 時(shí)間: 2025-3-29 12:43
Solving Isomorphism Problems for ,-Designs, for many cases where the designs are constructed with a common prescribed group of automorphisms by Kramer and Mesner’s approach [30]. The method is based on an analysis of group actions and improves on Burnside’s table of marks approach [15]. In particular, no knowledge of the full subgroup lattic作者: Rustproof 時(shí)間: 2025-3-29 17:37 作者: Picks-Disease 時(shí)間: 2025-3-29 21:35 作者: RADE 時(shí)間: 2025-3-30 00:18
Kirkman Triple Systems and Their Generalizations: A Survey,ade ago [51]. The study of various generalizations of the Kirkman Schoolgirl Problem remains a very active area of research, and much work has been done in the past ten years. This paper does not cover all of the topics discussed in Stinson’s survey; on the other hand we discuss several topics not c作者: regale 時(shí)間: 2025-3-30 08:02 作者: chance 時(shí)間: 2025-3-30 11:51
sign has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "sta978-1-4613-7958-4978-1-4613-0245-2作者: Arthropathy 時(shí)間: 2025-3-30 12:42 作者: Mirage 時(shí)間: 2025-3-30 16:58
The Hardware Abstraction Layer Design Process,oject. The goal is therefore to write code that can be reused, and in order to do that, developers need to create a hardware abstraction layer (HAL) to allow their middleware and application code to access the microcontroller hardware generically.作者: synchronous 時(shí)間: 2025-3-30 22:21
Introduction,firms are fundamentally changing. For firms in the service industry, it has become essential to incorporate digital technology into their business strategy and also to determine which backend processes, service offerings, and customer interactions should be enhanced by technology.
