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

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

Journal: :Cell biology education 2005
Eli Meir Judith Perry Derek Stal Susan Maruca Eric Klopfer

Diffusion and osmosis are central concepts in biology, both at the cellular and organ levels. They are presented several times throughout most introductory biology textbooks (e.g., Freeman, 2002), yet both processes are often difficult for students to understand (Odom, 1995; Zuckerman, 1994; Sanger et al., 2001; and results herein). Students have deep-rooted misconceptions about how diffusion a...

Journal: :Journal of attention disorders 2015
Nicolas Ballon Paul Brunault Samuele Cortese

OBJECTIVE To compare measures of sensation seeking in a clinical group of cocaine-dependent (CD) patients with and without a history of probable childhood ADHD and in non-cocaine-dependent (NCD) healthy volunteers. METHOD Patients (n = 75; 42 with and 33 without probable childhood ADHD) and comparisons (n = 84) were assessed with the Diagnostic Interview for Genetic Studies, the Wender Utah R...

2006
Jeffrey Adams Fokko du Cloux Marc van Leeuwen

Introduction The irreducible admissible representations of a real reductive group such as GL(n,R) have been classified by work of Langlands, Knapp, Zuckerman and Vogan. This classification is somewhat involved and requires a substantial number of prerequisites. See [13] for a reasonably accessible treatment. It is fair to say that it is difficult for a non-expert to understand any non-trivial c...

Journal: :IEICE Transactions 2013
Kenji Yasunaga

Gopalan, Klivans, and Zuckerman proposed a listdecoding algorithm for Reed-Muller codes. Their algorithm works up to a given list-decoding radius. Dumer, Kabatiansky, and Tavernier improved the complexity of the algorithm for binary Reed-Muller codes by using the well-known Plotkin construction. In this study, we propose a list-decoding algorithm for non-binary Reed-Muller codes as a generaliza...

Journal: :Archives of pediatrics & adolescent medicine 2010
Eric Tai Lori A Pollack Julie Townsend Jun Li C Brooke Steele Lisa C Richardson

Acquisition of data: Silverstein, Feinberg, Sauder, Egbert, and Stein. Analysis and interpretation of data: SilversteinandFeinberg. Drafting of the manuscript: Silverstein and Sauder. Critical revision of the manuscript for important intellectual content: Silverstein, Feinberg, Egbert, and Stein. Statistical analysis: Silverstein. Obtained funding: Silverstein and Feinberg. Administrative, tech...

Journal: :Medical History 1979
Roger Guillemin

JOSEPH MEITES, BERNARD T. DONOVAN, and SAMUEL M. McCANN (editors), Pioneers in neuroendocrinology, volume II, New York and London, Plenum Press, 1978, 8vo, pp. 422, $39.00. This series of autobiographies continues with twenty-four further essays. The individuals concerned include the three editors, Roger Guillemin, and Solly Zuckerman. These are the second generation of pioneers, whose contribu...

Journal: :Journal of embryology and experimental morphology 1967
J M Ioannou

INTRODUCTION It is widely accepted that oogenesis normally stops early in mammalian development (see Brambell, 1956; Franchi, Mandl & Zuckerman, 1962). Nevertheless, it has been claimed that mitotically active oogonia, and oocytes in early stages of meiotic prophase occur in mature specimens of Galago senegalensis (Gerard, 1920, 1932; Gerard & Herlant, 1953; Herlant, 1961; Petter-Rousseaux, 196...

2017
Alexis Descatha Susanne Schunder-Tatzber Jefferey Burgess Pascal Cassan Tatsuhiko Kubo Sylvie Rotthier Koji Wada Michel Baer

1 AP-HP, EMS (Samu92), Occupational Health Unit, Raymond Poincaré University Hospital, Garches, France, 2 University of Versailles Saint-Quentin-en-Yvelines, Versailles, France, 3 INSERM, UMS 011 UMR1168, Villejuif, France, 4 Corporate Health Management, OMV AG, Vienna, Austria, 5 Austrian Academy for Occupational Health & Prevention, Klostenreuburg, Austria, 6 Mel and Enid Zuckerman College of...

2000
Jeff Kahn Jeong Han Kim László Lovász Van H. Vu

We prove upper and lower bounds and give an approximation algorithm for the cover time of the random walk on a graph. We introduce a parameter M motivated by the well known Matthews bounds on the cover time and prove that M/2 ≤ C = O(M(ln lnn)). We give a deterministic polynomial time algorithm to approximate M within a factor of 2; this then approximates C within a factor of O((ln lnn)), impro...

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

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