نتایج جستجو برای: index set

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

2014
Necati Cihan Camgöz Ahmet Alp Kindiroglu Lale Akarun

This paper presents a framework for spotting and recognizing continuous human gestures. Skeleton based features are extracted from normalized human body coordinates to represent gestures. These features are then used to construct spatio-temporal template based Random Decision Forest models. Finally, predictions from different models are fused at score level to improve overall recognition perfor...

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

in chapter one we will describe definitions and preliminary results to provide the global context of our own results to be presented in detail in the subsequent chapters in chapter two we consider degree-one maps of the circle and we study their rotation set. our main result in this chapter says that if the map is topologically mixing then its rotation interval is nontrivial (that is, not reduc...

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

در تحقیق حاضر، با استفاده از ترکیب تئوری dsd و روش level set جبهه تراک تعقیب شده است. نخست، با استفاده از یک کد dsd یا از طریق مراجع، روابط d-? و d ?-d-? برای مواد شدیدالانفجار و مخلوط های گازی به دست آورده شده است، سپس با استفاده از روش level set، جبهه تراک در هندسه های مختلف تعقیب شده است. برای مواد شدیدالانفجار که در آن ها انحنا نقش مهمی را در دینامیک جبهه تراک دارد، همخوانی خوبی بین نتایج ت...

2007
Dan Haran Moshe Jarden

Let R be a real closed field and L be a finite extension of R(t). We prove that Gal(L) ∼= Gal(R(t)) if L is formally real and Gal(L) is the free profinite group of rank card(R) if L is not formally real. MR Classification: 12E30 Directory: \Jarden\Diary\RealFree 3 April, 2007 * Research supported by the Minkowski Center for Geometry at Tel Aviv University, established by the Minerva Foundation....

2001
Hans Vandierendonck Koen De Bosschere

The performance of direct mapped caches is degraded by conflict misses. It has been shown that conflict misses can be reduced by using randomising set index functions, such that repeated conflicts are avoided. However, optimising the set index function requires time consuming simulations, because the design space of randomising set index functions is very large. Therefore, we developed a profil...

Journal: :تحقیقات آب و خاک ایران 0
جلیل کاکه دانشجوی دانشگاه تهران منوچهر گرجی عضو هیئت علمی دانشگاه تهران علیرضا علی محمدی فارغ التحصیل دانشگاه تهران

assessment of soil quality is one of the most useful tools for evaluation the soil management condition and different land uses. quantity indices of soil quality are most suitable methods for determination and comparison of soils quality. in this study soil quality indices and selection methods of effective soil properties were compared for evaluating the soil quality in different land uses. se...

Journal: :international journal of nonlinear analysis and applications 2015
madjid eshaghi hamidreza reisi dezaki alireza moazzen

‎let $x$ be a real normed  space, then  $c(subseteq x)$  is  functionally  convex  (briefly, $f$-convex), if  $t(c)subseteq bbb r $ is  convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$  is  functionally   closed (briefly, $f$-closed), if  $t(k)subseteq bbb r $ is  closed  for all bounded linear transformations $tin b(x,r)$. we improve the    krein-milman theorem  ...

Journal: :journal of mahani mathematical research center 0
s.n. hosseini shahid bahonar university of kerman a. ilaghi-hosseini shahid bahonar university of kerman

in this article, we have shown, for the add-point monad t, thepartial morphism category set*is isomorphic to the kleisli category sett. alsowe have proved that the category, sett, of t-algebras is isomorphic to thecategory set of pointed sets. finally we have established commutative squaresinvolving these categories.

Journal: :Computers & Mathematics with Applications 2012
Aleksandar Ilic

The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity ecc(G) of a graph G is the mean value of eccentricities of all vertices of G. The average eccentricity is deeply connected with a topological descriptor called the eccentric connectivity index, defined as a sum of products of vertex degrees and eccentricities. In this paper we analyze ext...

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

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