223,394 research outputs found

    Stochastic accumulation of feature information in perception and memory

    Get PDF
    It is now well established that the time course of perceptual processing influences the first second or so of performance in a wide variety of cognitive tasks. Over the last20 years, there has been a shift from modeling the speed at which a display is processed, to modeling the speed at which different features of the display are perceived and formalizing how this perceptual information is used in decision making. The first of these models(Lamberts, 1995) was implemented to fit the time course of performance in a speeded perceptual categorization task and assumed a simple stochastic accumulation of feature information. Subsequently, similar approaches have been used to model performance in a range of cognitive tasks including identification, absolute identification, perceptual matching, recognition, visual search, and word processing, again assuming a simple stochastic accumulation of feature information from both the stimulus and representations held in memory. These models are typically fit to data from signal-to-respond experiments whereby the effects of stimulus exposure duration on performance are examined, but response times (RTs) and RT distributions have also been modeled. In this article, we review this approach and explore the insights it has provided about the interplay between perceptual processing, memory retrieval, and decision making in a variety of tasks. In so doing, we highlight how such approaches can continue to usefully contribute to our understanding of cognition

    Rapid modulation of sensory processing induced by stimulus conflict

    Get PDF
    Humans are constantly confronted with environmental stimuli that conflict with task goals and can interfere with successful behavior. Prevailing theories propose the existence of cognitive control mechanisms that can suppress the processing of conflicting input and enhance that of the relevant input. However, the temporal cascade of brain processes invoked in response to conflicting stimuli remains poorly understood. By examining evoked electrical brain responses in a novel, hemifield-specific, visual-flanker task, we demonstrate that task-irrelevant conflicting stimulus input is quickly detected in higher level executive regions while simultaneously inducing rapid, recurrent modulation of sensory processing in the visual cortex. Importantly, however, both of these effects are larger for individuals with greater incongruency-related RT slowing. The combination of neural activation patterns and behavioral interference effects suggest that this initial sensory modulation induced by conflicting stimulus inputs reflects performance-degrading attentional distraction because of their incompatibility rather than any rapid task-enhancing cognitive control mechanisms. The present findings thus provide neural evidence for a model in which attentional distraction is the key initial trigger for the temporal cascade of processes by which the human brain responds to conflicting stimulus input in the environment

    High-level programming of stencil computations on multi-GPU systems using the SkelCL library

    Get PDF
    The implementation of stencil computations on modern, massively parallel systems with GPUs and other accelerators currently relies on manually-tuned coding using low-level approaches like OpenCL and CUDA. This makes development of stencil applications a complex, time-consuming, and error-prone task. We describe how stencil computations can be programmed in our SkelCL approach that combines high-level programming abstractions with competitive performance on multi-GPU systems. SkelCL extends the OpenCL standard by three high-level features: 1) pre-implemented parallel patterns (a.k.a. skeletons); 2) container data types for vectors and matrices; 3) automatic data (re)distribution mechanism. We introduce two new SkelCL skeletons which specifically target stencil computations – MapOverlap and Stencil – and we describe their use for particular application examples, discuss their efficient parallel implementation, and report experimental results on systems with multiple GPUs. Our evaluation of three real-world applications shows that stencil code written with SkelCL is considerably shorter and offers competitive performance to hand-tuned OpenCL code

    Parallel TREE code for two-component ultracold plasma analysis

    Full text link
    The TREE method has been widely used for long-range interaction {\it N}-body problems. We have developed a parallel TREE code for two-component classical plasmas with open boundary conditions and highly non-uniform charge distributions. The program efficiently handles millions of particles evolved over long relaxation times requiring millions of time steps. Appropriate domain decomposition and dynamic data management were employed, and large-scale parallel processing was achieved using an intermediate level of granularity of domain decomposition and ghost TREE communication. Even though the computational load is not fully distributed in fine grains, high parallel efficiency was achieved for ultracold plasma systems of charged particles. As an application, we performed simulations of an ultracold neutral plasma with a half million particles and a half million time steps. For the long temporal trajectories of relaxation between heavy ions and light electrons, large configurations of ultracold plasmas can now be investigated, which was not possible in past studies
    corecore