نتایج جستجو برای: orthogonal
تعداد نتایج: 47710 فیلتر نتایج به سال:
in this paper, we propose space-time block codes based on constituent intersectant orthogonal designs. after channel model is formulated, we studied the space-time block codes from constituent intersectant orthogonal designs. at last we made simulations for the space-time block codes from complex orthogonal design and the space-time block codes from constituent intersectant orthogonal design to...
A (symmetric) nested orthogonal array is a symmetric orthogonal array OA(N, k, s, g) which contains an OA(M,k, r, g) as a subarray, where M < N and r < s. In this communication, some methods of construction of nested symmetric orthogonal arrays are given. Asymmetric nested orthogonal arrays are defined and a few methods of their construction are described.
The concept of a linear ordered orthogonal array is introduced, and its equivalent geometrical configuration is determined when its strength is 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.
چکیده ندارد.
two latin squares of order $n$ are orthogonal if in their superposition, each of the$n^{2}$ ordered pairs of symbols occurs exactly once. colbourn, zhang and zhu, in a seriesof papers, determined the integers $r$ for which there exist a pair of latin squares oforder $n$ having exactly $r$ different ordered pairs in their superposition. dukes andhowell defined the same problem for latin squares ...
In this paper we list some new orthogonal main e ects plans for three level designs for and factors in runs and compare them with designs obtained from the existing L orthogonal array We show that these new designs have better projection properties and can provide better parameter estimates for a range of possible models Additionally we study designs in other smaller run sizes when there are in...
An orthogonal double cover (ODC) of a complete graph is a collection of graphs such that every two of them share exactly one edge and every edge of the complete graph belongs to exactly two of the graphs. In this paper, we construct ODCs of Kn where all graphs are isomorphic to certain spanning subgraphs G (such as co-triangles, a star with cotriangles, and two other graph classes).
1 6 ] b y t h e a u t h o r s. T h i s a r t i c l e i s i n t e n d e d t o b e a c o u n t e r p a r t t o t h e a b s t r a c t t h e o r y o f
In order to produce any product with desired quality by machining, proper selection of process parameters is essential. This can be accomplished by Full Factorial method. The aim of the present work is to investigate the effect of process parameter on surface finish and material removal rate (MRR) to obtain the optimal setting of these process parameters and the analysis of variance is also use...
We have performed a shape optimization of the disc in an industrial double-eccentric butterfly valve using the effect analysis of design variables to enhance the valve performance. For the optimization, we select three performance quantities such as pressure drop, maximum stress, and mass (weight) as the responses and three dimensions regarding the disc shape as the design variables. Subsequent...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید