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

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

2005
Tetsuro Mimura Naoto Mitsuhashi Miwa Ohnishi Sung-Kee Chung Hitoshi Yagisawa

1 Department of Biology, Faculty of Science, Kobe University, Rokkodai 1-1, Nada-ku, Kobe, 657-8501, Japan 2 Core Research for Evolutional Science and Technology (CREST), Japan Science and Technology Agency (JST), Chuou-ku, Tokyo, 113-0027, Japan 3 Department of Chemistry, Pohang University of Science and Technology, San 31 Hyoja Dong, Pohang 790-784, Korea 4 Department of Life Science, Graduat...

Journal: :Medical History 2008

Rolf Br€ uggemann and Gisela SchmidKrebs, Verortungen der Seele: locating the soul. Psychiatriemuseen in Europa /Museums of psychiatry in Europe, Frankfurt am Main, Mabuse-Verlag, 2007, pp. 206, illus., d29.90 (paperback 978-3-938304-48-8). Nicholas Coni,Medicine and warfare: Spain, 1936–1939, Routledge/Ca~nada Blanch Studies on Contemporary Spain, NewYork and London, Routledge, 2007, pp. xxv, ...

2013
Sanja Lazić Dragana Šunjka Nada Grahovac Valéria Guzsvány Ferenc Bagi Dragana Budakov

Sanja Lazić1, Dragana Šunjka1, Nada Grahovac2, Valéria Guzsvány3, Ferenc Bagi1 and Dragana Budakov1 1University of Novi Sad, Faculty of Agriculture, Trg Dositeja Obradovića 8, 21000 Novi Sad, Serbia ([email protected]) 2Institute of Field and Vegetable Crops, Maksima Gorkog 30, 21000 Novi Sad, Serbia 3University of Novi Sad, Faculty of Sciences, Trg Dositeja Obradovića 3, 21000 Novi Sad, ...

2012
E. H. Hamouda

In [6] , Nada S. and Hamouda E. defined the folding number, F (G), to be the order of the set of all folding maps of G into itself. Also they introduced a formula to compute the folding number of Pn, a path with n edges. In this paper, the concept of based folding of a based graph is introduced and the number of based folding F (Pn, v) is given. Mathematics Subject Classification: 05C30

2004
Richard M. EPAND Phan VUONG Christopher M. YIP Shohei MAEKAWA Raquel F. EPAND

Richard M. EPAND*1, Phan VUONG†, Christopher M. YIP†, Shohei MAEKAWA‡ and Raquel F. EPAND* *Department of Biochemistry, McMaster University, Hamilton L8N 3Z5, ON, Canada, †Department of Chemical Engineering and Applied Chemistry, Institute of Biomaterials and Biomedical Engineering, University of Toronto, Toronto M5S 3G9, ON, Canada, and ‡Department of Bioinformation, Department of Life Science...

2004
Kingston H. G. Mills Rae Alan Huett Rino Rappuoli Gordon Dougan Simon Clare Beatrice Arico Marzia M. Giuliani Frances Bowe Ed C. Lavelle Edel A. McNeela Christine Hale Aaron Rae H. G. Mills

10.1128/IAI.72.7.4052-4060.2004. 2004, 72(7):4052. DOI: Infect. Immun. Kingston H. G. Mills Rae, Alan Huett, Rino Rappuoli, Gordon Dougan and Aaron Hale, Simon Clare, Beatrice Arico, Marzia M. Giuliani, Frances Bowe, Ed C. Lavelle, Edel A. McNeela, Christine Heat-Labile Enterotoxin Escherichia coli and Mutants of Neisseria meningitidis Intranasal Immunization with NadA of Antibodies and Cellula...

1992
Y. IMAMURA

We study symmetries between untwisted and twisted strings on asymmetric orbifolds. We present a list of asymmetric orbifold models to possess intertwining currents which convert untwisted string states to twisted ones, and vice versa. We also present a list of heterotic strings on asymmetric orbifolds with supersymmetry between untwisted and twisted string states. Some of properties inherent in...

2008
Filip Železný Nada Lavrač

A number of recent works have been focusing on analysing the phase transition of the NP-complete ILP covering test, which have been fruitful in linking this phenomenon to plateaus during heuristic search. However, it is only a facet of the ILP complexity as it is very dependent of the search strategy. Its inherent difficulty has to be studied as a whole to design efficient learners. ILP is argu...

2002
SASO DŽEROSKI

Relational data mining is the study of methods for knowledge discovery in databases when the database contains information about several types of objects. This, of course, is usually the case when the database has more than one table. Hence, there is little doubt as to the relevance of the area. Relational data mining has its roots in inductive logic programming, an area in the intersection of ...

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

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