نتایج جستجو برای: tidy groups

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علامه طباطبایی - دانشکده روانشناسی و علوم تربیتی 1388

the aim of this study is investigating the effect of teaching “metacognitive strategies” on the way which scientific information retrieval workes by the using of google scholar searching machine on the students of ms in the psycology & education faculty of allameh tabatabayi university in 2007-2008 academic year. the statistical community was the students of ms in psychology & education facult...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد گرمسار - دانشکده زبانهای خارجی 1389

abstract this study examines the effect of teaching lexical inferencing strategies on developing reading comprehension skill of iranian advanced efl learners. participants were female students of meraj and shokouh institudes of garmsar a quasi-experimental design using two intact advanced classes of efl students at meraj and shokouh institutes. as the first step, a general toefl proficiency te...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده ادبیات و علوم انسانی دکتر علی شریعتی 1393

this thesis attempts to measure learning styles, self efficacy and intrinsic motivation as predictors of iranian ielts reading comprehension. in order to address this issue, a quantitative study was conducted on some randomly selected intact students at ferdowsi university. these two groups were assigned as they were undergraduate (ba=91) and graduate (ma =74) students; they were all aged betwe...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد شاهرود - دانشکده علوم انسانی 1393

the present study was conducted to investigate the role of summary in teaching grammar process on pre-university students. to this end, 48 male pre-university students in semnan were participants. they were math class that we called experimental group and science class as control group. in order to make sure there was no significant difference in proficiency level of two groups. a pre-test wa...

Journal: :Neurocomputing 2014
Le-My Ha Andrey Vavilin Kang-Hyun Jo

This paper proposes a method for increasing accuracy of the scene model generation. Reconstruction of 3D scene model is strongly affected by moving objects both artificial and natural. In the proposed method context analysis is applied as a pre-filtering operation used to detect and remove objects which could negatively affect reconstruction process. Additionally, robust global rotation constra...

2011
Erdi Aker Ahmetcan Erdogan Esra Erdem Volkan Patoglu

We formalize actions and change in a housekeeping domain with multiple cleaning robots, and commonsense knowledge about this domain, in the action language C+. Geometric reasoning is lifted to high-level representation by embedding motion planning in the domain description using external predicates. With such a formalization of the domain, a plan can be computed using the causal reasoner CCALC ...

Journal: :Discrete Mathematics & Theoretical Computer Science 2013
Flavia Bonomo Guillermo Durán Luciano N. Grippo Martín Darío Safe

A graph is probe (unit) interval if its vertices can be partitioned into two sets: a set of probe vertices and a set of nonprobe vertices, so that the set of nonprobe vertices is a stable set and it is possible to obtain a (unit) interval graph by adding edges with both endpoints in the set of nonprobe vertices. Probe (unit) interval graphs form a superclass of (unit) interval graphs. Probe int...

2016

In normal conditions, the epidermis over a large part of the body produces a tidy Stratum Corneum (SC) composed of 15-20 layers or so of corneocytes with a total thickness of about 6-20 μm. This part of the epidermis is continuously renewed from the granular layer, and the outermost corneocytes gradually desquamate from the surface [1]. Corneocytes are embedded in a hydrophobic domain formed by...

Journal: :Theor. Comput. Sci. 2014
Stavros D. Nikolopoulos Leonidas Palios Charis Papadopoulos

In this paper we present an algorithm for determining the number of spanning trees of a graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by contracting the modular decomposition tree of the input graph G in a bottom-up fashion until it becomes a single node; then, the number of spanning trees of G is computed as the product...

2011
Erdi Aker Ahmetcan Erdogan Esra Erdem Volkan Patoglu

We consider a housekeeping domain with multiple cleaning robots and represent it in the action language C+. With such a formalization of the domain, a plan can be computed using the causal reasoner CCALC for each robot to tidy some part of the house. However, to find a plan that characterizes a feasible trajectory that does not collide with obstacles, we need to consider geometric reasoning as ...

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

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