نتایج جستجو برای: rank

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

Journal: :Journal of Machine Learning Research 2016
Justin Bedo Cheng Soon Ong

We study the problem of rank aggregation: given a set of ranked lists, we want to form a consensus ranking. Furthermore, we consider the case of extreme lists: i.e., only the rank of the best or worst elements are known. We impute missing ranks by the average value and generalise Spearman’s ρ to extreme ranks. Our main contribution is the derivation of a non-parametric estimator for rank aggreg...

2016
GABRIEL CONANT

We show that if G is a stable group of finite weight with no infinite, infinite-index, chains of definable subgroups, then G is superstable of finite U rank. Combined with recent work of Palaćın and Sklinos, we conclude that (Z,+, 0) has no proper stable expansions of finite weight. A corollary of this result is that if P ⊆ Zn is definable in a finite dp-rank expansion of (Z,+, 0), and (Z,+, 0,...

2013
VINCENT GUINGONA CAMERON DONNAY

In this paper, we study VC-density over indiscernible sequences (denoted VCind-density). We answer an open question in [1], showing that VCind-density is always integer valued. We also show that VCind-density and dp-rank coincide in the natural way.

2006
AMÍLCAR PACHECO

Let k be a field of characteristic q, C a smooth connected curve defined over k with function field K := k(C). Let A/K be a non constant abelian variety defined over K of dimension d. We assume that q = 0 or > 2d + 1. Let p 6= q be a prime number and C → C a finite geometrically Galois and étale cover defined over k with function field K ′ := k(C). Let (τ , B) be the K /k-trace of A/K. We give ...

2017
Stéphane Ploix Didier Maquin José Ragot

This communication deals with the problem of state estimation for a class of non linear singular systems. Sufficient conditions for the existence of such observers are provided and the design of an observer is examined. Assuming that the measurement matrix is full row rank involves many calculation simplifications ; therefore special emphasis in the computational aspect of the observer matrices...

Journal: :journal of research in health sciences 0
m yavarian gr farsheedfar m karimi m almoazzez cl harteveld pc giordano

background: the classical supportive therapy for î² -thalassemia major consists of regular blood transfusion, iron-chelation therapy and specific treatment of the related complications. a balance between the maintenance of the highest possible level of haemoglobin and lowest possible level of iron accumulation in heart and liver give the best chance of survival and the best quality of life. met...

ژورنال: :مجله دانشگاه علوم پزشکی بابل 0
نریمان نظامی، n nezami, آدرس: تبریز، دانشگاه علوم پزشکی، دانشکده پیراپزشکی، کمیته تحقیقات دانشجویی، تلفن: 4419757-0411 , e-mail: [email protected] مهرداد اصغری m asghari جاوید صفا، j safa محمدمهدی باقری اصل، mm bagheri asl ،بهزاد سالاری، b salari سونا قرشی s ghorashi

سابقه و هدف: استئوپروتگرین (osteo protegrin, opg)، گلیکوپروتئینی از خانواده بزرگ گیرنده فاکتور نکروز تومور آلفا می باشد. با در نظر گرفتن نقش محتمل opg در بیماری های قلبی- عروقی و شیوع بالای این بیماری در بیماران مبتلا به نفروپاتی دیابتیک نوع 2 و نیز تأثیرات ضد آترواسکلروتیک استاتین ها، این مطالعه به منظور بررسی تأثیر لووستاتین بر میزان استئوپروتگرین سرم و لیگاند محلول فعال کننده گیرنده عامل هست...

Journal: :international journal of group theory 0
francesco de giovanni dipartimento di matematica e applicazioni - university of napoli "federico ii" marco trombetti dipartimento di matematica e applicazooni - university of napoli "federico ii"

a result of dixon‎, ‎evans and smith shows that if $g$ is a locally (soluble-by-finite) group whose proper subgroups are (finite rank)-by-abelian‎, ‎then $g$ itself has this property‎, ‎i.e‎. ‎the commutator subgroup of $g$ has finite rank‎. ‎it is proved here that if $g$ is a locally (soluble-by-finite) group whose proper subgroups have minimax commutator subgroup‎, ‎then also the commutator s...

2014
V. Kalofolias E. Gallopoulos

An algorithm is described for the nonnegative rank factorization (NRF) of some completely positive (CP) matrices whose rank is equal to their CP-rank. The algorithm can compute the symmetric NRF of any nonnegative symmetric rank-r matrix that contains a diagonal principal submatrix of that rank and size with leading cost O(rm) operations in the dense case. The algorithm is based on geometric co...

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

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