نتایج جستجو برای: strong strategy
تعداد نتایج: 701661 فیلتر نتایج به سال:
Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent with u2 and v1 is adjacent with v2). In this paper, we first collect the earlier results about strong product and then we present applications of ...
conclusions the identification of the beneficial cardiovascular effects of dhea (s) and a better understanding of the involved mechanisms should be helpful to develop new strategies or pharmacologic approaches for many lethal diseases in western countries. context dehydroepiandrosterone (dhea) and its sulfate ester, dehydroepiandrosterone sulfate (dhea-s) have been considered as putative anti-a...
this study intended to develop a model describing speaking strategies for efl learners by taking into account the effects of learners’ gender and proficiency on the application of strategies. accordingly, this study was planned to have two main analyses, namely qualitative and quantitative. in this respect, 30 efl learners' viewpoints were sought, and then, based on the elicited responses, a 21...
considering rapid growth and migration, higher accumulation of communities along with the high number of shopping trips in mega cities such as tehran brings environmental consequences like excessive amounts of energy use, air pollution and massive urban congestions in all urban trips ending to shopping areas. the present study has been performed in tehran, capital of iran in 2009-2010. with the...
this thesis attempts to investigate the effects of prelistening activities on enhancing iranian efl learners` listening comprehension. the present study investigated ways in which learners` background knowledge could be activated in order to enhance their l2 listening comprehension by limiting the number of possible text interpretations prior to listening. the experiments conducted in this stud...
It is known that every multigraph with an even number of edges has an even orientation (i.e., all indegrees are even). We study parity constrained graph orientations under additional constraints. We consider two types of constraints for a multigraph G = (V,E): (1) an exact conflict constraint is an edge set C ⊆ E and a vertex v ∈ V such that C should not equal the set of incoming edges at v; (2...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید