Learning the new vocabulary of a new lesson by high school students before starting to teachthe whole of lesson in every session is the main concern of the writer of this study as anEnglish teacher. So the purpose of the present study is introducing some practical classroomtasks (such as, working with oxford dictionary for looking up the definitions, synonyms,antonyms and examples of new words,...

Two major obstacles to using problem-based learning methods with writing in elementary school classrooms are the time it takes to design the learning environment and the time required for students to interact at their own pace with ill-structured problems used to spur student writing. This study examined whether game elements could be used along with Problem Based Learning (PBL) in a digital le...

Grid computing facilitates the resource sharing through the administrative domains which are geographically distributed. Scheduling in a distributed heterogeneous environment is intrinsically very hard because of the heterogeneous nature of resource collection. Makespan and tardiness are two different measures of scheduling, and many of the previous researches concentrated much on reduction of ...

The present article describes an approach for assessment of efficacy independent work students, studying natural sciences, using the digital technologies. Tasks were fulfilled in Moodle electronic medium and consisted answering questions closed-type questionnaire, as well writing answers to Tests. We assessed time required a student write answer one question, number correctness terms used level...

This paper addresses the problem of scheduling non-preemptive moldable tasks to minimize the stretch of the tasks in an online non-clairvoyant setting. To the best of the authors’ knowledge, this problem has never been studied before. To tackle this problem, first the sequential sub-problem is studied through the lens of the approximation theory. An algorithm, called DASEDF, is proposed and, th...

We study the offline and online versions of the well known problem of scheduling a set of n independent multiprocessor tasks with prespecified processor allocations on a set of identical processors in order to minimize the makespan. Recently, in [13], it has been proven that in the case when all tasks have unit processing time the problem cannot be approximated within a factor of m 1 2 ε, neith...