نتایج جستجو برای: discourse completion tasks
تعداد نتایج: 258052 فیلتر نتایج به سال:
1 Recently, Hadoop, an open source implementation of MapReduce, has become very popular due to its characteristics such as simple programming syntax, and its support for distributed computing and fault tolerance. Although Hadoop is able to automatically reschedule failed tasks, it is powerless to deal with tasks with poor performance. Managing such tasks is vital as they lower the whole job's p...
This study sought to examine the type and frequency of tasks in the Iranian high school English course books (Prospect 1, 2, 3 & English Book 1, 2, 3). The corpus was analyzed based on Nunan’s (1999) framework composed of five main task types, namely cognitive, interpersonal, linguistics, affective, and creative. To this end, the whole content of the aforementioned course books went through con...
Recently, there is a revival of interest in low-rank matrix completion-based unsupervised learning through the lens dual-graph regularization, which has significantly improved performance multidisciplinary machine tasks such as recommendation systems, genotype imputation and image inpainting. While regularization contributes major part success, computational costly hyper-parameter tunning usual...
Four experiments examined a distinction between kinds of repetition priming which involve either the identification of the form or meaning of a stimulus or the production of a response on the basis of a cue. Patients with Alzheimer's disease had intact priming on picture-naming and category-exemplar identification tasks and impaired priming on word-stem completion and category-exemplar producti...
Among possible criteria for distinguishing separate memory systems for implicit and explicit memory is that of substantial differences in either the form or rate of forgetting. Prior literature has claimed both differential forgetting and equivalent forgetting for implicit and explicit tasks. Existing experimental data for word-stem completion and explicit control tasks were reviewed and shown ...
Task partition is a NP-Hard problem on multi-core processor. To achieve a good MCT (maximum completion time) goal, this paper presents a novel task partitioning method for multi-core processor based on the cohesion and coupling properties of tasks. First, the relations between the cohesion and coupling are analyzed and the computation method of coupling cost based on cohesion is designed with t...
Experience from an operational Map-Reduce cluster reveals that outliers signi cantly prolong job completion. e causes for outliers include run-time contention for processor, memory and other resources, disk failures, varying bandwidth and congestion along network paths and, imbalance in task workload. We present Mantri, a system that monitors tasks and culls outliers using causeand resource-aw...
A flexible task model (FTM) is proposed for modeling the relationship between grid tasks. We investigate the problem of scheduling grid computing tasks under FTM using light-trails in WDM networks to supporting the data communication between the tasks. Simulation results show that our proposed task scheduling algorithm under FTM significantly reduces the total task completion time.
We consider a broad class of communication tasks, which we call isotropic, in a hypercube and in a wraparound mesh of processors. These tasks are characterized by a type of symmetry with respect to origin node. WVe show that executing such tasks in a minimum number of steps is equivalent to a matrix decomposition problem. We use this property to obtain minimum completion time algorithms. For a ...
The authors report on a project in which a new experiential form of professional learning combined ethical thinking processes with a collaborative meeting technology known as the Zing team learning system (ZTLS). A new software program called Working Wisely was built by the completion of the project. The ZTLS in combination with Working Wisely facilitates communities of practice (Fleer, Edwards...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید