Data-Parallelism Dean Engelhardt and Andrew Wendelborn Department of Computer Science University of Adelaide Adelaide, SA 5005, Australia. E-mail: fdean,[email protected] Abstract In previous work, we have proposed a multithreaded execution model for describing nested data-parallelism on distributed multiprocessors in a fashion generic upon the partitioning of data aggregates within th...

BACKGROUND AND PURPOSE Motor recovery after stroke has been shown to be correlated with both the fractional anisotropy (FA) of the affected corticospinal tract (CST) and the interhemispheric resting-state functional connectivity (rsFC) of the primary motor cortex (M1). However, the role of the restoration or enhancement of the M1-M1 rsFC in motor recovery remains largely unknown. We aimed to cl...

The CM-2 is an example of a connection machine. The strengths and problems of this implementation are considered. Then important issues in the architecture and programming environment of connection machines in general are considered. These are contrasted with the same issues in MD multiprocessors and multicomputers.

At this conference many interesting talks were presented on the plausible existence of Quark Stars. Other talks dealt with the exotic new phases of quark matter at very high density. Here, I show how combining these two elements might offer a new way of tackling the Gamma Ray Burst puzzle.

Computations in geographic space are necessarily based on discrete versions of space, but much of the existing work on the foundations of GIS assumes a continuous infinitely divisible space. This is true both of quantitative approaches, using R, and qualitative approaches using systems such as the Region-Connection Calculus (RCC). This paper shows how the RCC can be modified so as to permit dis...

MPP Haskell is a parallel implementation of the Haskell functional language for the Thinking Machines Inc. CM-5 large-scale distributed-memory multiprocessor. MPP Haskell is a derivative of GUM, a message-based parallel implementation of Haskell. GUM was carefully designed to minimise performance loss from low-bandwidth and high-latency communications; as an apparent consequence MPP Haskell, wi...

A note is made on the connection between Cliiord analysis and the Weyl functional calculus for an n-tuple of bounded selfadjoint operators which do not necessarily commute with each other.

Using an effective method to measure the brain functional connectivity is an important step to study the brain functional network. The main methods for constructing an undirected brain functional network include correlation coefficient (CF), partial correlation coefficient (PCF), mutual information (MI), wavelet correlation coefficient (WCF), and coherence (CH). In this paper we demonstrate tha...

Developmental coordination disorder (DCD) and attention-deficit hyperactivity disorder (ADHD) are highly comorbid neurodevelopmental disorders; however, the neural mechanisms of this comorbidity are poorly understood. Previous research has demonstrated that children with DCD and ADHD have altered brain region communication, particularly within the motor network. The structure and function of th...

Neuroanatomy places critical constraints on the functional connectivity of the cerebral cortex. To analyze these constraints we have examined the relationship between structural features of networks (expressed as graphs) and the patterns of functional connectivity to which they give rise when implemented as dynamical systems. We selected among structurally varying graphs using as selective crit...