Two experiments examined priming in the lexical decision task, an indirect test of memory. Experiment 1 manipulated type of processing during study of unrelated word pairs. Recognition of individual words benefited more from semantic than from nonsemantic processing. Repetition priming in lexical decision depended on the context in which the target appeared. Targets preceded at test by unstudie...

We present two scalar processors called PVP-SWPC and PVP-SWSW for high-speed list vector processing. Memory access latency should be tolerated for this objective. PVP-SWPC tolerates the latency by introducing slide-windowed floating-point registers and prefetch-tocache instruction. PVP-SWSW tolerates the latency by introducing slide-windowed general and floating-point registers. Owing to the sl...

PURPOSE List-mode processing is an efficient way of dealing with the sparse nature of positron emission tomography (PET) data sets and is the processing method of choice for time-of-flight (ToF) PET image reconstruction. However, the massive amount of computation involved in forward projection and backprojection limits the application of list-mode reconstruction in practice, and makes it challe...

In this paper, we present the integration of an image processing toolkit into our platformindependent medical software framework Julius. The Insight Toolkit (itk) consists of state-of-the-art segmentation and registration methods, focused on medical applications. Each processing filter of the segmentation toolkit is represented as an individual element in the user interface. The central part of...

Inverted list compression is a topic that has been studied for 50 years due to its fundamental importance in numerous applications including information retrieval, databases, and graph analytics. Typically, an inverted list compression algorithm is evaluated on its space overhead and query processing time. Earlier list compression designs mainly focused on minimizing the space overhead to reduc...

Performance properties of list scheduling algorithms under various dynamic assumptions are analyzed. The focus is on bounds for scheduling directed acyclic graphs with arbitrary precedence constrains and arbitrary task processing times subject to minimizing the makespan. New performance bounds are derived and compared with known results. key words: list scheduling, worst case analysis, on-line ...

The structural join is considered a core operation in processing and optimizing XML queries. Various techniques have been proposed for efficiently finding structural relationships between a list of potential ancestors and a list of potential descendants. This paper presents a novel algorithm for efficiently processing structural joins. Moreover, previous work which performs well usually relies ...