نتایج جستجو برای: extended hildebrand approach
تعداد نتایج: 1473316 فیلتر نتایج به سال:
This work was supported by an award from NIH-NCRR (9 R01 RR14166) to BHS & NIH-NIDCD (1 R03 DC05535) to KCD. Initial support was provided by a contract from DARPA/CBS to J.G. Hildebrand. The authors also wish to thank the University of Michigan Center for Neural Communication Technology (NIH/NCRR grant P41 RR09754) for electrode supply. We would also like to thank T.A. Christensen, H. Lei, L. P...
ROLAND HILDEBRAND†, STEFANO MANCINI‡ and S IMONE SEVERINI§¶ †LJK Université Joseph Fourier, Tour IRMA, 51 rue des Mathématiques, 38400 St. Martin d’Hères, France ‡Dipartimento di Fisica, Università di Camerino, Via Madonna delle Carceri 9, 62032 Camerino, Italy §Department of Computer Science, University of York, Heslington, Y010 5DD York, United Kingdom ¶Current address: Institute for Quantum ...
Introduction Since the origin of life in the primordial soup, the survival of all organisms has depended on their ability to detect and respond to chemicals in their environment. Today, animal chemosensation— smell and taste—relies on sensory circuits that recognize diverse external chemical cues and transform them into precise patterns of neuronal activity to evoke the appropriate response (Ac...
Formation of the molecular complexes between meso-tetraphenylporphyrin (TPP) and the p-acceptors 2,3-dichloro-5,6-dicyanobenzoquinone (DDQ) and tetracyanothylene (TCNE) in chloroform solution was investigated spectrophotometrically. The formation constants of the resulting 1:1 molecular complexes were determined using the Benesi-Hildebrand and Nash methods. The TPP-DDQ pro...
A new approach to the design of collective communication operations in wormhole-routed mesh networks is described. The approach extends the concept of dominating sets in graph theory by accounting for the relative distance-insensitivity of the wormhole switching strategy and by taking advantage of a multi-port communication architecture, which allows each node to simultaneously transmit message...
A new extension of the Hildebrand solubility approach which describes drug solubility in solvent mixtures showing multiple solubility peaks, the chameleonic effect, is proposed. The experimental solubilities of oxolinic acid were measured at 25 degrees C in solvent mixtures of ethanol-water and ethanol-ethyl acetate. A plot of the mole fraction of the drug against the solubility parameter (delt...
Citation: Kleinteich J, Hildebrand F, Bahram M, Voigt AY, Wood SA, Jungblut AD, Küpper FC, Quesada A, Camacho A, Pearce DA, Convey P, Vincent WF, Zarfl C, Bork P and Dietrich DR (2017) Pole-to-Pole Connections: Similarities between Arctic and Antarctic Microbiomes and Their Vulnerability to Environmental Change. Front. Ecol. Evol. 5:137. doi: 10.3389/fevo.2017.00137 Pole-to-Pole Connections: Si...
Correspondence and reprints: Dr Joy C MacDermid, Hand and Upper Limb Centre, Clinical Research Laboratory, St Joseph’s Health Centre, PO Box 5777, London, Ontario N6A 4L6. Telephone 519-646-6100 ext 64636, fax 519-646-6049, e-mail [email protected] JC MacDermid, RS Richards, A Donner, N Bellamy, JH Roth, KA Hildebrand. Reliability of hand fellows’ measurements and classifications from radi...
Is a microRNA-328 binding site in PAX6 associated with Rolandic epilepsy? Amelia McGlade, Kenneth A. Myers, Samuel F. Berkovic, Ingrid E. Scheffer, Slav e Petrovski & Michael S. Hildebrand* Epilepsy Research Centre, Department of Medicine, University of Melbourne, Austin Health, Heidelberg, Victoria 3084, Australia Florey Institute and Department of Paediatrics, University of Melbourne, Royal C...
We prove collision bounds for the Pollard rho algorithm to solve the discrete logarithm problem in a general cyclic group G. Unlike the setting studied by Kim et al., we consider additive walks: the setting used in practice to solve the elliptic curve discrete logarithm problem. Our bounds differ from the birthday bound O. p jGj/ by a factor of p log jGj and are based on mixing time estimates f...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید