نتایج جستجو برای: amygdalus lycioides charmahal o bakhtiyaridomestic resource costcomparative advantagezagros

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

ژورنال: The Iranian Journal of Botany 1988

دو رگه‌های زیر که متعلق به مناطق مختلف ایران می باشند، نامگذاری و شرح داده می‌شوند. Amygdalus x kamiaranensis, A. x iranshahrii, A. x mozaffarianii, A. x yasujensis. گونه Cotoneaster assadii از شمال ایران نامگذاری و شرح داده می‌شود. علاوه بر این گونه‌های: Alchemilla caucasica, A. kurdica, A. retinervis, Amygdalus brahuica, A. korshinskyi, A. spinosissima subsp. spinosissima, Aremonia agrimonoid...

2013
Fatih Deniz

The capability of Prunus amygdalus L. (almond) shell for dye removal from aqueous solutions was investigated and methyl orange was used as a model compound. The effects of operational parameters including pH, ionic strength, adsorbent concentration and mesh size, dye concentration, contact time, and temperature on the removal of dye were evaluated. The adsorption kinetics conformed to the pseud...

ژورنال: :تحقیقات جنگل و صنوبر ایران 0
احمد رحمانی عضو هیأت علمی مؤسسه تحقیقات جنگلها و مراتع حیدر علی دانشور عضو هیأت علمی مرکز تحقیقات منابع طبیعی و امور دام استان اصفهان حسین سردابی عضو هیأت علمی مرکز تحقیقات منابع طبیعی و امور دام استان اصفهان

اثر پنج سطح نمک بر چهار ژنوتیپ مختلف بادام در قالب آزمایشهای فاکتوریل با طرح پایه بلوک کامل تصادفی مورد بررسی قرار گرفت . شوری در 5 سطح صفر (آب مقطر)، 500، 1200، 2000 و 3000 میلی گرم در لیتر از نمکهای کلرورسدیم و کلرورکلسیم به نسبت مساوی اعمال گردید و بادام شامل گونه های a. scoparia، a. lycioides و prunus dulcis )ژنوتیپ به شماره های 1 و 2 ) بود. از شن شسته شده به عنوان بستر کاشت استفاده شد و آب...

1998
Remzi H. Arpaci-Dusseau Andrea C. Arpaci-Dusseau David E. Culler Joseph M. Hellerstein David A. Patterson

We investigate resource usage while performing streaming I/O by contrasting three architectures, a single workstation, a cluster, and an SMP, under various I/O benchmarks. We derive analytical and empiricallybased models of resource usage during data transfer, examining the I/O bus, memory bus, network, and processor of each system. By investigating each resource in detail, we assess what compr...

2006
Dezhi HAN Xiaogang ZHANG

A high performance CD mirroring server ( for short HPCMS ) has been designed and implemented in the paper. Firstly, the HPCMS can mirror the multi-CD with multi CD drives in parallel, improving the slowly mirroring speed for a single CD drive; secondly, the HPCMS enhances the utilizing efficiency of the I/O resource and the CPU resource by a parallel mirroring and compressing algorithm, instead...

Journal: :Inf. Process. Lett. 1987
Ian Parberry

We present an improved simulation of space and reversal bounded Turing machines by width and depth bounded uniform circuits. (All resource bounds hold simultaneously.) An S(n) space, R(n) reversal bounded deterministic k-tape Turing machine can be simulated by a uniform circuit of O(R(n) log2S(n)) depth and O(S(n) k) width. Our proof is cleaner, and has slightly better resource bounds than the ...

2004
Valmor João Bianchi Silviero Sansavini José Carlos Fachinello

Cultivar characterization for fruit trees certification requires fast, efficient and reliable techniques. Microsatellite markers (SSR) were used in the molecular characterization of 29 Prunus spp. rootstocks. The DNA from the rootstocks was analyzed using five pre-selected SSR primers (UDP96-005, UDP96-008, UDP96013, UDP96-18 and UDP98-414) and revealed 81 alleles, which allowed each genotype t...

2014
M. Hebblewhite E. H. Merrill T. L. McDonald

Predation is a fundamental ecological and evolutionary process that varies in space, and the avoidance o f predation risk is o f central importance in foraging theory. While there has been a recent growth of approaches to spatially model predation risk, these approaches lack an adequate mechanistic framework that can be applied to real landscapes. In this paper we show how predation risk can be...

2016
Andrew Cropper

Inductive programming approaches typically rely on an Occamist bias to select hypotheses with minimal textual complexity. This approach, however, fails to distinguish between the efficiencies of hypothesised programs, such as merge sort (O(n log n)) and bubble sort (O(n2)). We address this issue by introducing techniques to learn logic programs with minimal resource complexity. We describe an a...

1995
P. Krishnan Philip M. Long Jeffrey Scott Vitter

In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can rent the resource for $1 per unit time or buy it once and for all for $c. In this paper we study algorithms that make a sequence of single rent-to-buy decisions, using the assumption that the resource use times are ind...

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

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