نتایج جستجو برای: hercynian early kimmerian cover berberian
تعداد نتایج: 791353 فیلتر نتایج به سال:
UFSMFW 2202 is an early black oat cultivar with high dry matter and grain yield potential. When used in rotation systems, the cycle has immediate advantage of allowing anticipated sowing subsequent crop. Initially, recommended for North Northwest Rio Grande do Sul.
Geopersia is published biannually by the College of Science, University of Tehran, Iran. The College of Science published Journal of Science, which covered all fields of basic science, from 1968 to 2010. It was then decided that the College’s journals should be more specialized, and hence publication of Geopersia was launched. Articles printed in Geopersia will be available online too. Aims an...
به منظور مطالعات میکروبیواستراتیگرافی و پالئواکولوژی (بر اساس داده های ژئوشیمیایی)و همچنین میکروفاسیس سازند کژدمی، مقطع کوه رحمت واقع در شمال شرق شیراز مورد مطالعه قرار گرفته است. بطور کلی این سازند با ضخامت 66/89 متر بوده که در جهت عمود بر امتداد لایه ها 76 نمونه برداشت شده و 82 مقطع میکروسکوپی از آن تهیه و مورد مطالعه قرار گرفته است. در این تحقیق مطالعات میکروبیواستراتیگرافی از دو منظر، فرامی...
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable solution for the grand coalition. We study the computation of the nucleolus of a number of cooperative games, including fractional matching games and fractional edge cover games on general weighted graphs, as well as verte...
In this work the central area of Corsica island was studied in order to reconstruct tectono-metamorphic history continental and oceanic high pressure units that occupy structurally deeper levels tectonic stacking Alpine their stratigraphic structural relationship with European margin (Hercynian Corsica). The study includes geological mapping, mesoscale microscale analysis, acquisition chemical ...
Motivated by the need for succinct representations of all “small” transversals (or hitting sets) of a hypergraph of fixed rank, we study the complexity of computing such a representation. Next, the existence of a minimal hitting set of at least a given size arises as a subproblem. We give one algorithm for hypergraphs of any fixed rank, and we largely improve an earlier algorithm (by H. Fernau,...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید