منابع مشابه
on the comparison of keyword and semantic-context methods of learning new vocabulary meaning
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
15 صفحه اولA note on partial list coloring
Let G be a simple graph with n vertices and list chromatic number χl(G) = χl. Suppose that 0 ≤ t ≤ χl and each vertex of G is assigned a list of t colors. Albertson, Grossman and Haas [1] conjectured that at least tn χl vertices of G can be colored from these lists. In this paper we find some new results in partial list coloring which help us to show that the conjecture is true for at least hal...
متن کاملthe effects of cognitive strategies- note making and underlining- on iranian efl learners’ reading comprehension
هدف از انجام این مطالعه ، بررسی اثرات استفاده از استراتژی های شناختی یعنی "نت برداری" و "زیر خط کردن" بر روی عملکرد درک مطلب زبان آموزان ایرانی می باشد. به این منظور، 60 زبان آموز دختر سال چهارم دبیرستان از طریق آزمون پیشرفت زبان انگلیسی (نلسون)، از یک جامعه آماری بزرگتر انتخاب شدند. سپس به صورت تصادفی به سه گروه که هر گروه شامل ?0 دانش آموز همسان بود، تقسیم شدند: دو گروه آزمایش(گروه "نت برداری...
15 صفحه اولA Note on a List Colouring of Hypergraphs
In the note we present two results. The first of them gives a sufficient condition for a colouring of a hypergraph from an assigned list. It generalises the analogous fact for graphs. The second result states that for every k ≥ 3 and every l ≥ 2, a distance between the list chromatic number and the chromatic number can be arbitrarily large in the class of k−uniform hypergraphs with the chromati...
متن کاملA note on list improper coloring of plane graphs
A list-assignment L to the vertices of G is an assignment of a set L(v) of colors to vertex v for every v ∈ V (G). An (L, d)-coloring is a mapping φ that assigns a color φ(v) ∈ L(v) to each vertex v ∈ V (G) such that at most d neighbors of v receive color φ(v). A graph is called (k, d)-choosable, if G admits an (L, d)-coloring for every list assignment L with |L(v)| ≥ k for all v ∈ V (G). In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 1919
ISSN: 0035-8711,1365-2966
DOI: 10.1093/mnras/79.7.511