When people are cued to forget previously studied irrelevant information and study new information instead, such cuing typically leads to forgetting of the precue information. But what do people forget if, before the forget cue is provided, both irrelevant and relevant information have been encoded? Using relatively short item lists, we examined in a series of three experiments whether particip...

In list scheduling algorithm, at each scheduling step one task is scheduled to the processor on which the task achieves the earliest start time. As a result, each task is tentatively scheduled to each processor to find the destination processor. This paper presents a technique to be applied to the list scheduling algorithms which significantly reduces scheduling cost without sacrificing perform...

1.Introduction In TREC-10, we participated in two tasks: batch filtering task in the filtering task, and question answering task. In question answering task, we participated in three sub-tasks (main task, list task, and context task). In batching filtering task, we experimented a filtering technique, which unifies the results of support vector machines for subtopics subdivided by incremental cl...

A routing problem with precedence conditions and complex cost functions is considered. In this problem, we must choose a starting point, route (permutation of indices) specific trajectory for our process. This be consistent the route. addition, or index permutation defines sequence tasks. selection above satisfy defined by system ordered pairs. These pairs are called address We consider additiv...

Two experiments tested the hypothesis that the time course of retrieval from memory is different for familiarity and recall. The response-signal method was used to compare memory retrieval dynamics in yes-no recognition memory, as a measure of familiarity, with those of list discrimination, as a measure of contextual recall. Responses were always made with regard to membership in two previous s...

Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Both algorithms are naturally parallelizable but have heavy data dependencies. Based on experimental results, this paper presents a detailed analysis of the scalability, advantages and disadvantages of each algorithm. Mu...

Costs and benefits of directed forgetting are observed when a between-list instruction to forget List 1 impairs List 1 recall while enhancing List 2 recall. These effects are often ascribed to intentional inhibition of List 1. Contrary to this inhibition account, we found that a forget instruction did not produce costs unless an explicit instruction to concentrate on List 2 was used (Experiment...