Dynamic Remapping 1995

نویسنده

  • Alexandre Pouget
چکیده

The term dynamic remapping has been used in many different ways, but one of the clearest formulations of this concept comes from the mental rotation studies by Georgopoulos et al. (1989; see also REACHING: CODING IN MOTOR CORTEX). In these experiments, monkeys were trained to move a joystick in the direction of a visual stimulus, or 90" counterclockwise from it. The brightness of the stimulus indicated which movement was required on a particular trial: a dim light corresponding to a 90" movement and a bright light to a direct movement. An analysis of reaction time suggested that, by default, the initial motor command always pointed straight at the target and then continuously rotated if the cue indicated a 90" rotation, an interpretation that was subsequently confirmed by single-unit recordings. The term remapping is also commonly used whenever a sensory input in one modality is transformed to the sensory representation in another modality. The best-known example in primates is the remapping of auditory space, which is headcentered in the early stages of auditory processing, into the retinotopic coordinates used in the superior colliculus (Jay and Sparks, 1987; Stein and Meredith, 1993). This type of remapping, equivalent to a change of coordinates, is closely related to sensorimotor transformations. It does not have to be performed over time but could be accomplished by the neuronal circuitry connecting different representations. This review is divided into three parts: In the first part, we briefly describe the types of cortical representations typically encountered in dynamic remapping. We then summarize the results from several physiological studies in which it has been possible to characterize the responses of neurons involved in temporal and spatial remappings. Finally, in the third part, we review modeling efforts to account for these processes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Remapping Algorithms for Adaptive Problems

In this paper we present fast parallel algorithms for remapping a class of irregular and adaptive problems on coarse-grained distributed memory machines. We show that the remapping of these applications, using simple index-based mapping algorithm, can be reduced to sorting a nearly sorted list of integers or merging an unsorted list of integers with a sorted list of integers. By using the algor...

متن کامل

Optimal Periodic Remapping of Bulk Synchronous Computations on Multiprogrammed Distributed Systems

For bulk synchronous computations that have nondeterministic behaviors, dynamic remapping is an effective approach to ensure parallel efficiency. There are two basic issues in remapping: when and how to remap. This paper presents a formal treatment of the first issue for dynamic computations with a priori known statistical behaviors. We have formulated the problem as two complement sequential s...

متن کامل

Automated Parallelization of Timed Petri-Net Simulations

26 Connection Machine CM-1 routing network on 16 processors of an Intel iPSC/860, and on a simulation of a slotted-ring architecture that is executed on up to 64 processors of the Intel Touchstone Delta. Signiicant performance beneets are observed, and the eeectiveness of (and need for) dynamic remapping clearly demonstrated. Acknowledgements We thank Subhas Roy for his programming contribution...

متن کامل

Optimal periodic remapping of dynamic bulk synchronous computations

Dynamic remapping is critical to the performance of bulk synchronous computations that have non-deterministic behaviors because of the need of barrier synchronization between phases. There are two basic issues in remapping: when and how to remap. This paper presents a formal analysis of the issue of when to remap for dynamic computations with a priori known statistical behaviors, with an object...

متن کامل

Optimal Dynamic Remapping of Parallel Computations

A large class of computations are characterized by a sequence of phases, with phase changes occurring unpredictably. We consider the decision problem regarding the remapping of workload to processors in a parallel computation when (i) Ihe uiility of remapping md the future behavior of the workload is uncertain, and (ii) phases exhibit stable execution requirements during a given phase, but requ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995