نتایج جستجو برای: orthogonal group

تعداد نتایج: 1023774  

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد شاهرود - دانشکده علوم انسانی 1393

the present study was conducted to investigate the role of summary in teaching grammar process on pre-university students. to this end, 48 male pre-university students in semnan were participants. they were math class that we called experimental group and science class as control group. in order to make sure there was no significant difference in proficiency level of two groups. a pre-test wa...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه رازی - دانشکده کشاورزی 1388

هدف از انجام این تحقیق ارزیابی اثر تکرارهای مکرر hcg بر روی ویژگیهای جسم زرد و فولیکولهای موجود بر سطح تخمدان و غلظت پروژسترون میش های سنجابی سوپراووله شده با ecg می باشد. تعداد 40 راس میش سنجابی بوسیله اسفنج آغشته به پروژسترون به مدت 12 روز جهت همزمان سازی فحلی مورد درمان قرار گرفتند . سوپراوولاسیون در این دامها بوسیله ecg، 2روز قبل از خروج اسفنج القاء شد. در روز خروج اسفنج (روز صفر) میش ها بص...

2004
Wen Tsai Steven G Gilmour Roger Mead WEN TSAI STEVEN G GILMOUR

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...

Journal: :Australasian J. Combinatorics 2008
Ramadan A. El-Shanawany Mahmoud Shibl Higazy

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).

2014
Jigar Patel Hitesh Patel Chandresh Patel

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...

2014
Sangmo Kang Da-Eun Kim Kuk-Kyeom Kim Jun-Oh Kim

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...

2008
Jean-Bernard Zuber

The large N limit of some matrix integrals over the orthogonal group O(N) and its relation with those pertaining to the unitary group U(N) are reexamined. It is proved that limN→∞ N −2 ∫ DO expN Tr JO is half the corresponding function in U(N), with a similar relation for limN→∞ ∫ DO expN Tr (AOBO), for A and B both symmetric or both skew symmetric. Large N limit of integrals over the orthogona...

Journal: :Revista brasileira de ortopedia 2010
Edgard Novaes de França Bisneto Emygdio José Leomil de Paula Marcelo Rosa de Resende Rames Mattar Júnior Arnaldo Valdir Zumiotti

OBJECTIVE To compare the results from surgical treatment between volar plates with angular stability and orthogonal plates in unstable distal radius fractures, in patients aged over 60 years. METHODS The patients were divided into two groups that were treated with volar plates or orthogonal plates. Clinical and radiographic results were analyzed prospectively. RESULTS The study groups prese...

Journal: :Discussiones Mathematicae Graph Theory 2006
Dalibor Froncek Uwe Leck

An orthogonal double cover (ODC) of the complete graph Kn by some graph G is a collection of n spanning subgraphs of Kn, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every edge of Kn is contained in exactly two of the subgraphs. A necessary condition for such an ODC to exist is that G has exactly n− 1 edges. We show that for any given positive integer d, al...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید