نتایج جستجو برای: lowest 42

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

2008
Fayssal El Moufatich

Before embarking into the technicalities of the different algorithms for LCA, let us first agree on the terminology that we will be using throughout this article. Let there be a rooted tree T(E,V). A node x ∈ T is called an ancestor of a node y ∈ T if the path from the root of T to y goes through x. Also, a node v ∈ T is called to be a common ancestor of x and y if it is an ancestor of both x a...

Journal: :JAMA 2011
Kristine Yaffe Andrea Weston Neill R Graff-Radford Suzanne Satterfield Eleanor M Simonsick Steven G Younkin Linda H Younkin Lewis Kuller Hilsa N Ayonayon Jingzhong Ding Tamara B Harris

CONTEXT Lower plasma β-amyloid 42 and 42/40 levels have been associated with incident dementia, but results are conflicting and few have investigated cognitive decline among elders without dementia. OBJECTIVE To determine if plasma β-amyloid is associated with cognitive decline and if this association is modified by measures of cognitive reserve. DESIGN, SETTING, AND PARTICIPANTS We studied...

2003
Franz Baader

Computing the least common subsumer (lcs) is one of the most prominent non-standard inference in description logics. Baader, Küsters, and Molitor have shown that the lcs of concept descriptions in the description logic EL always exists and can be computed in polynomial time. In the present paper, we try to extend this result from concept descriptions to concepts defined in a (possibly cyclic) E...

2012
Yuri Lin Andrew Winslow

We care not only about the value of the minimum element, but also about the index k of the minimum element between A[i] and A[j]; given the index, it is easy to look up the actual value of the minimum element, so it is a more interesting problem to find the index of the minimum element between A[i] and A[j]. The range minimum query problem is not a tree problem, but it closely related to a tree...

2001
Franz Baader Anni-Yasmin Turhan

For Description Logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the input descriptions. This paper investigates whether the possibly exponentially large concept description representing the lcs can always be represented in a more compact way when using an appropriate (acyclic) TBox for deening this d...

2012
S. L. Vieira

The Cobb × Cobb 500 slow-feathering male is a fast early-growth broiler grown under variable feeding programs and amino acid (AA) densities. An experiment was conducted using diets with increased ideal protein densities in a feeding program of 1 to 7 d, 8 to 21 d, 22 to 35d, and 36 to 42 d. Diets had ratios between essential digestible (D) AA and DLys (DAA:DLys) as follows: TSAA, 75%; DThr, 65%...

2005
Daniel M. Kane Jonathan M. Kane

Many teachers allow students to drop the lowest score from a sequence of quizzes, tests, or homework assignments. When the number of grades is large, some teachers will even allow students to drop several of their lowest scores. A computer gradebook program would need to implement an algorithm to provide this feature (see one of many examples of computer gradebook software, for example, [4]). A...

Journal: :ADLFI. Archéologie de la France - Informations 1997

Journal: :Brain : a journal of neurology 2015
Tobias Skillbäck Bahman Y Farahmand Christoffer Rosén Niklas Mattsson Katarina Nägga Lena Kilander Dorota Religa Anders Wimo Bengt Winblad Jonathan M Schott Kaj Blennow Maria Eriksdotter Henrik Zetterberg

Progressive cognitive decline in combination with a cerebrospinal fluid biomarker pattern of low levels of amyloid-β1-42 and high levels of total tau and phosphorylated tau is typical of Alzheimer's disease. However, several neurodegenerative disorders may overlap with Alzheimer's disease both in regards to clinical symptoms and neuropathology. In a uniquely large cohort of dementia patients, w...

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

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