نتایج جستجو برای: Taraz Nahid
تعداد نتایج: 101 فیلتر نتایج به سال:
several studies have been performed to evaluate the desertification in iran andother countries which led to present national and regional models. one of them is imdpamodel. this model was used as a case study in taraz nahid, saveh, iran. in this study, fivefactors including climate, soil, vegetation, irrigation, and socioeconomic ones wereevaluated. according to the region conditions for each c...
Several studies have been performed to evaluate the desertification in Iran andother countries which led to present national and regional models. One of them is IMDPAmodel. This model was used as a case study in Taraz Nahid, Saveh, Iran. In this study, fivefactors including climate, soil, vegetation, irrigation, and socioeconomic ones wereevaluated. According to the region conditions for each c...
H. Beiderbeck, D. Risse, H. Budzikiewicz, K. Taraz Institut für Organische Chemie der Universität zu Köln, Greinstr. 4, D-50939 Köln, Germany Z. Naturforsch. 54c, 1Ð5 (1999); received September 9, 1998 Pseudomonas aureofaciens, Pyoverdin, Siderophore From Pseudomonas aureofaciens a new pyoverdin was isolated and its structure was determined by various spectroscopic methods and by partial degrad...
Kühn, Osthus and Taraz showed that for each γ > 0 there exists C such that any n-vertex graph with minimum degree γn contains a planar subgraph with at least 2n−C edges. We find the optimum value of C for all γ < 1/2 and sufficiently large n.
Let G be a quasirandom graph on n vertices, and let W be a random walk on G of length αn. Must the set of edges traversed by W form a quasirandom graph? This question was asked by Böttcher, Hladký, Piguet and Taraz. Our aim in this paper is to give a positive answer to this question. We also prove a similar result for random embeddings of trees.
Coja-Oghlan and Taraz (2004) presented a graph coloring algorithm that has expected linear running time for random graphs with edge probability p satisfying np ≤ 1.01. In this work, we develop their analysis by exploiting generating function techniques. We show that, in fact, their algorithm colors Gn,p with the minimal number of colors and has expected linear running time, provided that np ≤ 1...
Öteden beri edebiyatçılar, önceden var olan bir metinden değişik tekniklere başvurmak yoluyla faydalanmaktadırlar. Günümüzde metinlerarasılık kuramı, metinler arasındaki etkileşime, edebiyatçıların birbirinden beslenme yollarına ve metindeki başka alınmış malzemelere odaklanır. Metinlerarasılık yeni kuram olmasına rağmen olgusu oldukça eskidir. Özellikle Klasik Türk şiirinde başta nazire olmak ...
42 Digital Reading Fluency and Text Presentation Medium Preference in EFL Context Jaleh Hasaskhah, Department of English Language and Literature, Guilan University, Rasht, Iran Behzad Barekat, Department of English Language and Literature, Guilan University, Rasht, Iran Nahid Farhang Asa, Department of English Language and Literature, Guilan University, Rasht, Iran InternatIonal Journal of DIgI...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید