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

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

2008
Valeria Vásquez

www.sciencemag.org (this information is current as of October 17, 2008 ): The following resources related to this article are available online at http://www.sciencemag.org/cgi/content/full/321/5893/1210 version of this article at: including high-resolution figures, can be found in the online Updated information and services, http://www.sciencemag.org/cgi/content/full/321/5893/1210/DC1 can be fo...

2008
Nuo Li

www.sciencemag.org (this information is current as of October 16, 2008 ): The following resources related to this article are available online at http://www.sciencemag.org/cgi/content/full/321/5895/1502 version of this article at: including high-resolution figures, can be found in the online Updated information and services, http://www.sciencemag.org/cgi/content/full/321/5895/1502/DC1 can be fo...

2016
Cosmin Sebastian Voican Severine Martin Céline Verstuyft Emmanuelle Corruble Gabriel Perlemuter Romain Colle

BACKGROUND Concerning the risk of antidepressant induced liver injury, it is not clear whether psychiatrists perform a liver function test (LFT) and whether an increase in aminotransferase levels should contraindicate antidepressant treatment. AIM To evaluate LFT availability, the prevalence of LFT abnormalities and the probable cause of an altered LFT in patients with a major depressive epis...

2009
Katrina Podsypanina

www.sciencemag.org (this information is current as of January 16, 2009 ): The following resources related to this article are available online at http://www.sciencemag.org/cgi/content/full/321/5897/1841 version of this article at: including high-resolution figures, can be found in the online Updated information and services, http://www.sciencemag.org/cgi/content/full/321/5897/1841/DC1 can be fo...

2008
Oleg Pikhurko

n0 = min{n ∈ N | f(n) > n + 1}, then the proof of Kahn and Kalai gives n0 ≤ 1325. On the other hand we know only that n0 ≥ 4 (Perkal [7]; Eggleston [3]). It is of interest where n0 lies. The upper bound on n0 was improved to n0 ≤ 946 (Nilli [6]), n0 ≤ 561 (Raigorodski [8]), n0 ≤ 560 (Weißbach [9]), and n0 ≤ 323 (Hinrichs [4]). In fact, we know that f(n) > n + 1 for all n ≥ 323. Here we show tha...

2005
David S. Miall

Literary reading has been a topic of inquiry among scholars of literature and educationalists for nearly three quarters of a century (Richards, 1929; Rosenblatt, 1937). Among empirical researchers, in contrast, attention to literature is quite recent, with most studies having been carried out only over the last 20 years. The literary field is fraught with controversy, however. Basic differences...

Journal: :Eur. J. Comb. 2005
Astrid Reifegerste

The number of even 321-avoiding permutations of length n is equal to the number of odd ones if n is even, and exceeds it by the n−1 2 th Catalan number otherwise. We present an involution that proves a refinement of this sign-balance property respecting the length of the longest increasing subsequence of the permutation. In addition, this yields a combinatorial proof of a recent analogous resul...

2007
Miyong T. Kim Hyun Jeong Park

Congress reveals the results of an electronic prescribing (e-prescribing) pilot project that supports the adoption of new e-prescribing standards. These standards, required by the Medicare Modernization Act of 2003, would help cut both medication errors and health care costs. The pilot project demonstrated that three initial standards are already capable of supporting e-prescribing transactions...

2002
M. H. Albert

Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in enumerating permutations which have a block structure avoiding 321, and whose blocks also have such structure (recursively). Generalizations of these results ...

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

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