نتایج جستجو برای: o. minimum (1population)

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

Journal: :علوم باغبانی ایران 0
محمد مقدم استادیار دانشکده کشاورزی دانشگاه فردوسی مشهد رضا امید بیگی عضو هیات علمی دانشگاه تربیت مدرس اعظم سلیمی عضو هیات علمی دانشگاه تربیت معلم محمد رضا نقوی عضو هیات علمی دانشگاه تهران

the genus ocimum belonging to lamiaceae is considered as one of the most economical medicinal plants throughout the world. it is used in medicinal tea, and essential oil production, in spices, as vegetable, and also as a pot herb. the aim followed in this study was to evaluate the genetic diversity of 38 native populations collected from different geographical origins of iran along with two for...

Journal: :research in pharmaceutical sciences 0
g. asghari h. nourallahi s.a. havaie l. issa

plants produce a diverse array of secondary metabolites, many of which have antimicrobial activity. otostegia persica bioss. (labiatae) grows in south east of iran. no previous investigation on antimicrobial effects of this plant has been reported. thus, the aim of this work was to examine the antimicrobial effect of o. persica extracts with different polarity on several microorganisms. aerial ...

2015
Stephan Karl Malcolm K. Jones Lucía Gutiérrez Brioni Moore Eline Kattenberg Marcus Lacerda

1Population Health and Immunity, Walter and Eliza Hall Institute of Medical Research, Parkville, VIC 3052, Australia 2Department of Medical Biology, The University of Melbourne, Melbourne, VIC 3052, Australia 3School of Veterinary Science, The University of Queensland, Brisbane, St. Lucia, QLD 4072, Australia 4Departamento de Biomateriales y Materiales Bioinspirados, Instituto de Ciencia de Mat...

A. Ehsani, A. Hassani, M. Hashemi, M. Moradi, M. Raeisi, S.S. Naghibi,

Background: In current study, chemical composition and antibacterial activity of leaves and flowers essential oils of Origanum vulgare ssp. gracile against four food-borne pathogens including  Escherichia coli, Listeria monocytogenes, Salmonella thyphimurium and Staphylococcus aureus were examined. Methods: The different organs (leaves and flowers) of O. vulgare ssp. gracile were har...

1995
David Eppstein

We show that for any edge-weighted graph G there is an equivalent graph EG such that the minimum spanning trees of G correspond one-for-one with the spanning trees of EG. The equivalent graph can be constructed in time O(m + n log n) given a single minimum spanning tree of G. As a consequence we can count the minimum spanning trees of G in time O(m+ n), generate a random minimum spanning tree i...

Journal: :journal of food quality and hazards control 0
m. moradi a. hassani a. ehsani m. hashemi [email protected] m. raeisi s.s. naghibi

background: in current study, chemical composition and antibacterial activity of leaves and flowers essential oils of origanum vulgare ssp. gracile against four food-borne pathogens including  escherichia coli, listeria monocytogenes, salmonella thyphimurium and staphylococcus aureus were examined. methods: the different organs (leaves and flowers) of o. vulgare ssp. gracile were harvested at f...

Journal: :Networks 1991
Neal E. Young Robert E. Tarjan James B. Orlin

We use Fibonacci heaps to improve a parametric shortest path algorithm of Karp and Orlin, and we combine our algorithm and the method of Schneider and Schneider’s minimum-balance algorithm to obtain a faster minimum-balance algorithm. For a graph with n vertices and m edges, our parametric shortest path algorithm and our minimum-balance algorithm both run in O(nm + n logn) time, improved from O...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه سمنان - دانشکده کویر شناسی 1390

امروزه از مهمترین بحث هایی که بخش زیادی از زمان محققین را به خود اختصاص داده است، مباحث مربوط به آب به عنوان حیاتی ترین ماده بقای حیات انسان. تغییر در آب در دسترس می تواند واکنش جدی در پایداری آب زیست محیطی مناطق خشک و نیمه خشک ایجاد کند. لذا یکی از پر کاربردترین مباحث مربوط به هیدرولوژی بررسی هیدروگراف جریان می باشد که امکان مطالعه حجم سیلاب و میزان ذخیره حوزه پس از قطع بارندگی و نیز سهم آب زی...

Journal: :J. Algorithms 1997
Monika Henzinger

This paper presents insertions-only algorithms for maintaining the exact and/or approximate size of the minimum edge cut and the minimum vertex cut of a graph. The algorithms output the approximate or exact size k in time O(1) and a cut of size k in time linear in its size. For the minimum edge cut problem and for any 0 < 1, the amortized time per insertion is O(1= ) for a (2 + )-approximation,...

1995
Monika Rauch Henzinger

This paper presents insertions-only algorithms for maintaining the exact and/or approximate size of the minimum edge cut and the minimum vertex cut of a graph. The algorithms output the approximate or exact size k in time O(1) and a cut of size k in time linear in its size. For the minimum edge cut problem and for any 0 < 1, the amortized time per insertion is O(1== 2) for a (2 +)-approximation...

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

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