Not always obvious

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Emerging infectious diseases are not always obvious.

142 www.thelancet.com/infection Vol 9 March 2009 of patients—is supported by the observed increase in ODs seen in most of the samples that retested positive. Carry over of material from samples with high levels of toxin may also have contributed. Whatever the explanation for the above results (and in those cited in the Review), it is clear that more work is required before recommendations are m...

متن کامل

The Convergence of an Euler Approximation of an Initial Value Problem Is Not Always Obvious

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

متن کامل

Why zygosity of multiple births is not always obvious: an examination of zygosity testing requests from twins or their parents.

This paper examines why parents of twins or adult twins themselves request zygosity testing. Of 405 multiples including 8 sets of triplets, the majority (93%) were monozygotic. Age of testing ranged from 0 days to 73 years. About 50% of requests came from parents or twins who were curious about, or expressed a need to be certain of, their zygosity. Other reasons included health concerns (curren...

متن کامل

KLP Not Always Efficient

The size of the nondominated set of a vector set is greatly dependent on the size of the original vector set N and the dimension of the vector M . Theoretical analysis shows that when M = O(log N) the original set has big nondominated set which may be the original set itself, and in the case M = O(log N), a classical algorithm (KLP) for finding nondominated set has complexity of KLP higher than...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMJ

سال: 2011

ISSN: 0959-8138,1468-5833

DOI: 10.1136/bmj.d3286