نتایج جستجو برای: d tree

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

Journal: :iranian journal of pharmaceutical research 0
rahele namazi 1- department of pharmaceutical biotechnology, school of pharmacy, shahid beheshti university of medical sciences, tehran, iran. 2- students research committee, shahid beheshti university of medical sciences, tehran, iran. rezvan zabihollahi 1- hepatitis and aids department, pasteur institute of iran, tehran, iran. 2- medical school, isfahan medical sciences university, isfahan, iran. mandana behbahani department of microbial biotechnology, faculty of advanced sciences and technologies, university of isfahan, isfahan, iran. abbas rezaei medical school, isfahan medical sciences university, isfahan, iran.

avicennia marina (avicenniaceae) is a species of mangrove tree used for treatment of small pox lesions in persian folk medicine. the antiviral activity of methanol, ethanol, water, chloroform and n-hexane extracts was evaluated against hiv-1 and hsv. methanol extract had the highest antiviral activity and the most polar fraction of this extract (fraction d) inhibited hsv with ti and si values o...

2004
Patricia L. Carlson Grzegorz Bancerek

The articles [8], [5], [9], [1], [10], [11], [3], [2], [7], [4], and [6] provide the notation and terminology for this paper. We consider tree construction structures as extensions of 1-sorted structure as systems 〈 a carrier, rules 〉, where the carrier is a set and the rules constitute a relation between the carrier and the carrier∗. Let us note that there exists a tree construction structure ...

2007
Natarajan Meghanathan Sanjeev Baskiyar

This paper proposes a new coding scheme and an algorithm to determine ancestordescendant relationship among nodes in a tree without tree traversal. Each node in a tree is assigned a unique binary code. The algorithm and the binary coding approach were tested with trees of different heights and widths. The algorithm is of O(1) complexity versus O(d) for tree traversal, where d is the depth of th...

Journal: :Nuclear Physics B - Proceedings Supplements 2000

Journal: :Combinatorica 2007
Noga Alon Michael Krivelevich Benny Sudakov

We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion properties of G. As a result we show that for fixed d ≥ 2 and 0 < < 1, there exists a constant c = c(d, ) such that a random graph G(n, c/n) contains almost surely a copy of every tree T on (1− )n vertices with maximum degre...

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

در سال های اخیر روش هایی برای استفاده بهینه از منابع در شبکه های کامپیوتری به ویژه شبکه ی مراکز داده ابری که به طور عمده مبتنی بر همبندی fat-tree هستند، ارائه شده است. جلوگیری از ازدحام بر روی پیوندهای ارتباطی و استفاده بهینه از مسیرهای موجود یکی از چالش های مهم در این نوع شبکه ها محسوب شده و همواره تحقیقاتی بر روی آن صورت گرفته است که اکثر آن ها مانند ecmp تمرکزی به شرایط موجود در شبکه مثل وضع...

Journal: :IEEE Transactions on Very Large Scale Integration (VLSI) Systems 2015

Journal: :Investigative ophthalmology & visual science 1996
C L Cottriall N A McBrien

PURPOSE To determine the efficacy of the M1-selective muscarinic antagonist, pirenzepine, in preventing experimentally induced myopia in a mammalian model, the tree shrew. METHODS Tree shrews were monocularly deprived (MD) using translucent goggles or negative lenses for a period of 12 days. In two of the MD groups, tree shrews received daily subconjunctival administration of either pirenzepi...

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

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