A Parallel Processing Model of Musical Structures

Euterpe is a real-time computer system for the modeling of musical structures. It provides a formalism wherein familiar concepts of musical analysis may be readily expressed. This is verified by its application to the analysis of a wide variety of conventional forms of music: Gregorian chant, Mediaeval polyphony, Back counterpoint, and sonata form. It may be of further assistance in the real-time experiments in various techniques of thematic development. Finally, the system is endowed with sound-synthesis apparatus with which the user may prepare tapes for musical performances.

Instabilities in two-dimensional flower and chain clusters of bubbles

M.A. Fortes et al., Instabilities in two-dimensional flower and chain clusters of bubbles, Colloids and Surfaces A: Physicochemical and Engineering Aspects Volume 309, Issues 1-3, 1 November 2007, Pages 64-70 A Collection of Papers Presented at the 6th Eufoam Conference, Potsdam, Germany, 2-6 July, 2006

Cellular automata and non-static image processing for embodied robot systems on a massively parallel processor array

Huelse, M, Barr, D R W, Dudek, P: Cellular Automata and non-static image processing for embodied robot systems on a massively parallel processor array. In: Adamatzky, A et al. (eds) AUTOMATA 2008, Theory and Applications of Cellular Automata. Luniver Press, 2008, pp. 504-510. Sponsorship: EPSRC

Ion Pickup by Finite Amplitude Parallel Propagating Alfven Waves

Li, Xing; Lu, Q. M.; Li, B., 'Ion Pickup by Finite Amplitude Parallel Propagating Alfven Waves', The Astrophysical Journal Letters (2007) 661(1) pp.L105-L108 RAE2008

Mermera: Non-Coherent Distributed Shared Memory for Parallel Computing

The proliferation of inexpensive workstations and networks has prompted several researchers to use such distributed systems for parallel computing. Attempts have been made to offer a shared-memory programming model on such distributed memory computers. Most systems provide a shared-memory that is coherent in that all processes that use it agree on the order of all memory events. This dissertation explores the possibility of a significant improvement in the performance of some applications when they use non-coherent memory. First, a new formal model to describe existing non-coherent memories is developed. I use this model to prove that certain problems can be solved using asynchronous iterative algorithms on shared-memory in which the coherence constraints are substantially relaxed. In the course of the development of the model I discovered a new type of non-coherent behavior called Local Consistency. Second, a programming model, Mermera, is proposed. It provides programmers with a choice of hierarchically related non-coherent behaviors along with one coherent behavior. Thus, one can trade-off the ease of programming with coherent memory for improved performance with non-coherent memory. As an example, I present a program to solve a linear system of equations using an asynchronous iterative algorithm. This program uses all the behaviors offered by Mermera. Third, I describe the implementation of Mermera on a BBN Butterfly TC2000 and on a network of workstations. The performance of a version of the equation solving program that uses all the behaviors of Mermera is compared with that of a version that uses coherent behavior only. For a system of 1000 equations the former exhibits at least a 5-fold improvement in convergence time over the latter. The version using coherent behavior only does not benefit from employing more than one workstation to solve the problem while the program using non-coherent behavior continues to achieve improved performance as the number of workstations is increased from 1 to 6. This measurement corroborates our belief that non-coherent shared memory can be a performance boon for some applications.

Mapping Parallel Iterative Algorithms onto Workstation Networks

For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally that the performance of certain parallel applications running on a workstation network can be improved significantly if a congestion control protocol is used to enhance network performance. In this paper, we characterize and analyze the communication requirements of a large class of supercomputing applications that fall under the category of fixed-point problems, amenable to solution by parallel iterative methods. This results in a set of interface and architectural features sufficient for the efficient implementation of the applications over a large-scale distributed system. In particular, we propose a direct link between the application and network layer, supporting congestion control actions at both ends. This in turn enhances the system's responsiveness to network congestion, improving performance. Measurements are given showing the efficacy of our scheme to support large-scale parallel computations.

OS Support for Portable Bulk Synchronous Parallel Programs

Predictability -- the ability to foretell that an implementation will not violate a set of specified reliability and timeliness requirements -- is a crucial, highly desirable property of responsive embedded systems. This paper overviews a development methodology for responsive systems, which enhances predictability by eliminating potential hazards resulting from physically-unsound specifications. The backbone of our methodology is the Time-constrained Reactive Automaton (TRA) formalism, which adopts a fundamental notion of space and time that restricts expressiveness in a way that allows the specification of only reactive, spontaneous, and causal computation. Using the TRA model, unrealistic systems – possessing properties such as clairvoyance, caprice, infinite capacity, or perfect timing -- cannot even be specified. We argue that this "ounce of prevention" at the specification level is likely to spare a lot of time and energy in the development cycle of responsive systems -- not to mention the elimination of potential hazards that would have gone, otherwise, unnoticed. The TRA model is presented to system developers through the Cleopatra programming language. Cleopatra features a C-like imperative syntax for the description of computation, which makes it easier to incorporate in applications already using C. It is event-driven, and thus appropriate for embedded process control applications. It is object-oriented and compositional, thus advocating modularity and reusability. Cleopatra is semantically sound; its objects can be transformed, mechanically and unambiguously, into formal TRA automata for verification purposes, which can be pursued using model-checking or theorem proving techniques. Since 1989, an ancestor of Cleopatra has been in use as a specification and simulation language for embedded time-critical robotic processes.

Distributed Parallel Computing in Mermera: Mixing Noncoherent Shared Memories

Programmers of parallel processes that communicate through shared globally distributed data structures (DDS) face a difficult choice. Either they must explicitly program DDS management, by partitioning or replicating it over multiple distributed memory modules, or be content with a high latency coherent (sequentially consistent) memory abstraction that hides the DDS' distribution. We present Mermera, a new formalism and system that enable a smooth spectrum of noncoherent shared memory behaviors to coexist between the above two extremes. Our approach allows us to define known noncoherent memories in a new simple way, to identify new memory behaviors, and to characterize generic mixed-behavior computations. The latter are useful for programming using multiple behaviors that complement each others' advantages. On the practical side, we show that the large class of programs that use asynchronous iterative methods (AIM) can run correctly on slow memory, one of the weakest, and hence most efficient and fault-tolerant, noncoherence conditions. An example AIM program to solve linear equations, is developed to illustrate: (1) the need for concurrently mixing memory behaviors, and, (2) the performance gains attainable via noncoherence. Other program classes tolerate weak memory consistency by synchronizing in such a way as to yield executions indistinguishable from coherent ones. AIM computations on noncoherent memory yield noncoherent, yet correct, computations. We report performance data that exemplifies the potential benefits of noncoherence, in terms of raw memory performance, as well as application speed.

On Clustering Images Using Compression

The need for the ability to cluster unknown data to better understand its relationship to know data is prevalent throughout science. Besides a better understanding of the data itself or learning about a new unknown object, cluster analysis can help with processing data, data standardization, and outlier detection. Most clustering algorithms are based on known features or expectations, such as the popular partition based, hierarchical, density-based, grid based, and model based algorithms. The choice of algorithm depends on many factors, including the type of data and the reason for clustering, nearly all rely on some known properties of the data being analyzed. Recently, Li et al. proposed a new universal similarity metric, this metric needs no prior knowledge about the object. Their similarity metric is based on the Kolmogorov Complexity of objects, the objects minimal description. While the Kolmogorov Complexity of an object is not computable, in "Clustering by Compression," Cilibrasi and Vitanyi use common compression algorithms to approximate the universal similarity metric and cluster objects with high success. Unfortunately, clustering using compression does not trivially extend to higher dimensions. Here we outline a method to adapt their procedure to images. We test these techniques on images of letters of the alphabet.

From Parallel Sequence Representations to Calligraphic Control: A Conspiracy of Neural Circuits

Calligraphic writing presents a rich set of challenges to the human movement control system. These challenges include: initial learning, and recall from memory, of prescribed stroke sequences; critical timing of stroke onsets and durations; fine control of grip and contact forces; and letter-form invariance under voluntary size scaling, which entails fine control of stroke direction and amplitude during recruitment and derecruitment of musculoskeletal degrees of freedom. Experimental and computational studies in behavioral neuroscience have made rapid progress toward explaining the learning, planning and contTOl exercised in tasks that share features with calligraphic writing and drawing. This article summarizes computational neuroscience models and related neurobiological data that reveal critical operations spanning from parallel sequence representations to fine force control. Part one addresses stroke sequencing. It treats competitive queuing (CQ) models of sequence representation, performance, learning, and recall. Part two addresses letter size scaling and motor equivalence. It treats cursive handwriting models together with models in which sensory-motor tmnsformations are performed by circuits that learn inverse differential kinematic mappings. Part three addresses fine-grained control of timing and transient forces, by treating circuit models that learn to solve inverse dynamics problems.

Parallel Auditory Filtering By Sustained and Transient Channels Separates Coarticulated Vowels and Consonants

A neural model of peripheral auditory processing is described and used to separate features of coarticulated vowels and consonants. After preprocessing of speech via a filterbank, the model splits into two parallel channels, a sustained channel and a transient channel. The sustained channel is sensitive to relatively stable parts of the speech waveform, notably synchronous properties of the vocalic portion of the stimulus it extends the dynamic range of eighth nerve filters using coincidence deteectors that combine operations of raising to a power, rectification, delay, multiplication, time averaging, and preemphasis. The transient channel is sensitive to critical features at the onsets and offsets of speech segments. It is built up from fast excitatory neurons that are modulated by slow inhibitory interneurons. These units are combined over high frequency and low frequency ranges using operations of rectification, normalization, multiplicative gating, and opponent processing. Detectors sensitive to frication and to onset or offset of stop consonants and vowels are described. Model properties are characterized by mathematical analysis and computer simulations. Neural analogs of model cells in the cochlear nucleus and inferior colliculus are noted, as are psychophysical data about perception of CV syllables that may be explained by the sustained transient channel hypothesis. The proposed sustained and transient processing seems to be an auditory analog of the sustained and transient processing that is known to occur in vision.

Pressure induced anisotropy of electrical conductivity in polycrystalline molybdenum disulfide

Anisotropic specimens of MoS2 are obtained by pressing the microcrystalline powder into special die. This inelastic compression results in a rearrangement of the disulfide micro platelets observed by Atomic Force Microscopy and reflected in the macroscopic anisotropy in electrical conductivity in these samples. The conductivity measured parallel and perpendicular to the direction of applied pressure exhibits an anisotropy factor of ∼10 at 1 GPa. This behaviour of the conductivity as a function of applied pressure is explained as the result of the simultaneous influence of a rearrangement of the micro platelets in the solid and the change of the inter-grain distances.

An evaluation of orogenic kinematic evolution utilizing crystalline and magnetic anisotropy in granitoids

The Silurian-Devonian Galway Granite Complex (GGC ~425-380Ma) is defined here as a suite of granitoid plutons that comprise the Main Galway Granite Batholith and the Earlier Plutons. The Main Batholith is a composite of the Carna Pluton in the west and the Kilkieran Pluton in the east and extends from Galway City ~130km to the west. The Earlier Plutons are spatially, temporally and structurally distinct, situated northwest of the Main Batholith and include the Roundstone, Omey, Inis and Letterfrack Plutons. The majority of isotopic and structural data currently available pertain to the Kilkieran Pluton, several tectonic models have already been devised for this part of the complex. These relate emplacement of the Kilkieran Pluton to extension across a large east-west Caledonian lineament, i.e. the Skird Rocks Fault, during late Caledonian transtension. No chronological data have been published that directly and accurately date the emplacement of the Carna Pluton or any of the Earlier Plutons. There is also a lack of data pertaining to the internal structure of these intrusions. Accordingly, no previous study has established the mechanisms of emplacement for the Earlier Plutons and only limited work is available for the Carna Pluton. As a consequense of this, constituents of the GGC have not previously been placed in a context relative to each other or to regional scale Silurio-Devonian kinematics. The current work focuses on the Omey, Roundstone and Carna Plutons. Here, results of detailed field and Anisotropy of Magnetic Susceptibiliy (AMS) fabric studies are presented. This work is complemented by geological mapping that focuses on fault dynamics and contact relationships. Interpretation of AMS data is aided by rock magnetic experiment data and petrographic microstructural evaluations of representative samples. A new geological map of the the Omey Pluton demonstrates that this intrusion has a defined roof and base which are gently inclined parallel to the fold hinge of the Connemara Antiform. AMS and petrographic data show the intrusion is cross cut by NNW-SSE shear zones that extend into the country rock. These pre-date and were active during magma emplacement. It is proposed that the Omey pluton was emplaced as a discordant phacolith. Pre-existing subvertical D5 faults in the host rock were reactived during emplacement, due to regional sinistral transpression, and served as centralised ascent conduits. A central portion of the Roundstone Pluton was mapped in detail for the first time. Two facies are identified, G1 forms the majority of the pluton and coeval G2 sheets cross cut G1 at the core of the pluton. NNW-SSE D5 faults mapped in the country rock extend across the pluton. These share a geometrical relationship with the distribution of submagmatic strain in the pluton and parallel the majoity of mapped subvertical G2 dykes. These data indicate that magma ascent was controlled by NNW-SSE conduits that are inherently related to those identifed in the Omey Pluton. It is proposed that the Roundstone Pluton is a punched laccolith, the symmetry and structure of which was controlled by pre-exising host rock structures and regional sinistral transpressive stress which presided during emplacement. Field relationships show the long axis of the Carna Pluton lies parallel to mulitple NNW-SSE shear zones. These are represented on a regional scale by the Clifden-Mace Fault which cross cuts the core of this intrusion. AMS and petrographic data show concentric emplacement fabrics were tectonically overprinted as magma cooled from the magmatic state due to this faulting. It is proposed that the Clifden-Mace Fault system was active during ascent and emplacement of the magma and that pluton inflation only terminated as this controlling structure went into compression due to the onset of regional transtension. U-Pb zircon laser ablation inductively coupled mass spectrometry (LA-ICP-MS) data has been compiled from four sample sites. New geochronological data from the Roundstone Pluton (RD1 = ± 3.2Ma) represent the oldest age determination obtained from any member of the GGC and demonstrates that this pluton predates the Carna Pluton by ~10Ma and probably intruded synchronously with the Omey Pluton (~422.5 ± 1.7Ma). Chronological data from the Carna Pluton (CN2 = 412.9 ± 2.5Ma; CN3 = 409.8 ± 7.2Ma; CN4 = 409.6 ± 3.6Ma) represent the first precise magma crystallisation age for this intrusion. This work shows this pluton is 10Ma older than the Kilkieran Pluton and that the supply of magma into the Carna Pluton had terminated by ~409Ma. Chronological, magnetic and field data have been utilised to evaluate the kinematic evolution of the Caledonides of western Ireland throughout the construction of the GGC. It is proposed that the GGC was constructed during four distinct episodes. The style of emplacement and the conduits used for magma transport to the site of emplacement was dependent on the orientation of local structures relative to the regional ambiant stress field. This philosophy is used to critically evaluate and progress existing hypotheses on the transition from regional transpression to regional transtension at the end of the Caledonian Orogeny.

Conductive junctions with parallel graphene sheets.

The establishment of conductive graphene-molecule-graphene junction is investigated through first-principles electronic structure calculations and quantum transport calculations. The junction consists of a conjugated molecule connecting two parallel graphene sheets. The effects of molecular electronic states, structure relaxation, and molecule-graphene contact on the conductance of the junction are explored. A conductance as large as 0.38 conductance quantum is found achievable with an appropriately oriented dithiophene bridge. This work elucidates the designing principles of promising nanoelectronic devices based on conductive graphene-molecule-graphene junctions.