نتایج جستجو برای: respectively the diagonal region
تعداد نتایج: 16086716 فیلتر نتایج به سال:
Content based image retrieval CBIR has been one of the most important research area in the field of computer science. There were many CBIR techniques have been proposed in the last decade. In this paper we propose a CBIR method which is modified form of color averaging technique. In previous color averaging techniques e.g. row mean, column mean ,forward diagonal mean, backward diagonal mean, su...
Using a Generic spin basis, we present a general formalism of one-loop radiative corrections to the spin correlations in the top quark pair production at the Next Linear Collider, and calculate the O(αs) QCD corrections under the soft gluon approximation. We find that: (a) in Off-diagonal basis, the O(αs) QCD corrections to e−Le + ( e−Re + ) scattering process increase the differential cross se...
Similar to the well known Schur Horn theorem that characterizes the relationship between the diagonal entries and the eigenvalues of a Hermitian matrix the Sing Thompson theorem characterizes the relationship between the diagonal en tries and the singular values of an arbitrary matrix It is noted in this paper that based on the induction principle such a matrix can be constructed numerically by...
Let F be a field, let G be a simple graph on n vertices, and let S (G) be the class of all F -valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For each graph G, there is an associated minimum rank class, M R (G) consisting of all matrices A ∈ S (G) with rankA = mr (G), the minimum rank among all matrices in S (G)....
Let F be a field, let G be a simple graph on n vertices, and let S (G) be the class of all F -valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For each graph G, there is an associated minimum rank class, M R (G) consisting of all matrices A ∈ S (G) with rankA = mr (G), the minimum rank among all matrices in S (G)....
over a period of four years, we followed 200 male cases (female patients were excluded from this study because from early childhood, the majority of iranian girls have their ears pierced which tends to distort the ear lobe and renders the diagnosis of the crease difficult) of proved coronary artery disease (angina pectoris, coronary insufficiency, and myocardial infarction) in a private clinic ...
They can be written in vector forms respectively as E1(s, I) = (s − PxCxI) Ax(s − PxCxI) + (s − PyCyI) Ay(s − PyCyI), (4) E2(I) = (I − I0) B(I − I0), (5) where s, I and I0 are vector representations of s, I and I0. Cx and Cy are discrete backward difference matrices that are used to compute image gradients in the xand ydirections. Px, Py , Ax, Ay and B are diagonal matrices, whose i-th diagonal...
نام: سمیه نام خانوادگی: نعمتی رشته: تربیت بدنی و علوم ورزشی گرایش: آسیب شناسی و حرکات اصلاحی استاد راهنما: دکتر ناصر بهپور، دکتر مرتضی صائب استاد مشاور: دکتر کامران قریشی مقطع تحصیلی:کارشناسی ارشد تاریخ فارغ التحصیلی: // عنوان پایان نامه به فارسی: تاثیر ایستادن بر روی شیب های مختلف حین تمرینات اصلاحی بر زوایای بیومکانیکی ناحیه لومبوساکرال در دختران دارای هایپرلوردوزیس. عنوان پایان نامه ...
where T and S are diagonal m.by.m and n-by-n real matrices, respectively with diagonal entries from [0, 1]. Our goal is to characterize the above sets with respect to the inheri tance of rank r , which is meant that each matr ix f rom these sets is of rank r . It should b e noted that, for square and nonsingular A and B, nonsingulari ty o f our sets has been studied in [2]. We shall dose this s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید