Data partitioning for parallel spatial join processing

The cost of spatial join processing can be very high because of the large sizes of spatial objects and the computation-intensive spatial operations. While parallel processing seems a natural solution to this problem, it is not clear how spatial data can be partitioned for this purpose. Various spatial data partitioning methods are examined in this paper. A framework combining the data-partitioning techniques used by most parallel join algorithms in relational databases and the filter-and-refine strategy for spatial operation processing is proposed for parallel spatial join processing. Object duplication caused by multi-assignment in spatial data partitioning can result in extra CPU cost as well as extra communication cost. We find that the key to overcome this problem is to preserve spatial locality in task decomposition. We show in this paper that a near-optimal speedup can be achieved for parallel spatial join processing using our new algorithms.

Parallel implementation of stochastic simulation for large scale cellular processes

Experimental and theoretical studies have shown the importance of stochastic processes in genetic regulatory networks and cellular processes. Cellular networks and genetic circuits often involve small numbers of key proteins such as transcriptional factors and signaling proteins. In recent years stochastic models have been used successfully for studying noise in biological pathways, and stochastic modelling of biological systems has become a very important research field in computational biology. One of the challenge problems in this field is the reduction of the huge computing time in stochastic simulations. Based on the system of the mitogen-activated protein kinase cascade that is activated by epidermal growth factor, this work give a parallel implementation by using OpenMP and parallelism across the simulation. Special attention is paid to the independence of the generated random numbers in parallel computing, that is a key criterion for the success of stochastic simulations. Numerical results indicate that parallel computers can be used as an efficient tool for simulating the dynamics of large-scale genetic regulatory networks and cellular processes

A first-principles density-functional calculation of the electronic and vibrational structure of the key melanin monomers

We report first-principles density-functional calculations for hydroquinone (HQ), indolequinone (IQ), and semiquinone (SQ). These molecules are believed to be the basic building blocks of the eumelanins, a class of biomacromolecules with important biological functions (including photoprotection) and with the potential for certain bioengineering applications. We have used the difference of self-consistent fields method to study the energy gap between the highest occupied molecular orbital and the lowest unoccupied molecular orbital, HL. We show that HL is similar in IQ and SQ, but approximately twice as large in HQ. This may have important implications for our understanding of the observed broadband optical absorption of the eumelanins. The possibility of using this difference in HL to molecularly engineer the electronic properties of eumelanins is discussed. We calculate the infrared and Raman spectra of the three redox forms from first principles. Each of the molecules have significantly different infrared and Raman signatures, and so these spectra could be used in situ to nondestructively identify the monomeric content of macromolecules. It is hoped that this may be a helpful analytical tool in determining the structure of eumelanin macromolecules and hence in helping to determine the structure-property-function relationships that control the behavior of the eumelanins.

Scalable Visualization of Galaxies, Oceans, and Brains

One of the challenges in scientific visualization is to generate software libraries suitable for the large-scale data emerging from tera-scale simulations and instruments. We describe the efforts currently under way at SDSC and NPACI to address these challenges. The scope of the SDSC project spans data handling, graphics, visualization, and scientific application domains. Components of the research focus on the following areas: intelligent data storage, layout and handling, using an associated “Floor-Plan” (meta data); performance optimization on parallel architectures; extension of SDSC’s scalable, parallel, direct volume renderer to allow perspective viewing; and interactive rendering of fractional images (“imagelets”), which facilitates the examination of large datasets. These concepts are coordinated within a data-visualization pipeline, which operates on component data blocks sized to fit within the available computing resources. A key feature of the scheme is that the meta data, which tag the data blocks, can be propagated and applied consistently. This is possible at the disk level, in distributing the computations across parallel processors; in “imagelet” composition; and in feature tagging. The work reflects the emerging challenges and opportunities presented by the ongoing progress in high-performance computing (HPC) and the deployment of the data, computational, and visualization Grids.

Bifurcation in growth patterns for arrays of parallel Griffith, edge and sliding cracks

This paper presents the recent finding by Muhlhaus et al [1] that bifurcation of crack growth patterns exists for arrays of two-dimensional cracks. This bifurcation is a result of the nonlinear effect due to crack interaction, which is, in the present analysis, approximated by the dipole asymptotic or pseudo-traction method. The nonlinear parameter for the problem is the crack length/ spacing ratio lambda = a/h. For parallel and edge crack arrays under far field tension, uniform crack growth patterns (all cracks having same size) yield to nonuniform crack growth patterns (i.e. bifurcation) if lambda is larger than a critical value lambda(cr) (note that such bifurcation is not found for collinear crack arrays). For parallel and edge crack arrays respectively, the value of lambda(cr) decreases monotonically from (2/9)(1/2) and (2/15.096)(1/2) for arrays of 2 cracks, to (2/3)(1/2)/pi and (2/5.032)(1/2)/pi for infinite arrays of cracks. The critical parameter lambda(cr) is calculated numerically for arrays of up to 100 cracks, whilst discrete Fourier transform is used to obtain the exact solution of lambda(cr) for infinite crack arrays. For geomaterials, bifurcation can also occurs when array of sliding cracks are under compression.

A phylogenetic study of Lepidapedoides Yamaguti, 1970 (Digenea) with a key and descriptions of two new species from western Australia

Two new species of the genus Lepidapedoides are described from the aulopodid teleost Aulopus purpurissatus from south-western Australia. Both are distinguished from other Lepidapedoides spp. by their pedunculate ventral sucker. Lepidapedoides pistoris n. sp. and L. elongatrium n. sp. are distinguished by the possession of a narrow, elongate form, a long ventral sucker to ovary distance: the vitellarium reaching only to the posterior level of the cirrus-sac, the cirrus-sac length and the deep genital atrium with the metraterm entering distally to its base in L. elongatrium. A key to species of the genus is given. A character matrix is included for the genus. Poorly resolved phylogenetic trees indicate two main lineages in the genus. The two new species described here are resolved as sister taxa. The new combination Lepidapedoides freitasi (Kohn gr Fernandes, 1970) is formed for Acanthocolpoides freitasi.

Practical parallel coset enumeration

Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel procedure for coset enumeration on shared memory processors. The shared memory architecture is particularly interesting because such parallel computation is both faster and cheaper. The lower cost comes when the program requires large amounts of memory, and additional CPU's. allow us to lower the time that the expensive memory is being used. Rather than report on a suite of test cases, we take a single, typical case, and analyze the performance factors in-depth. The parallelization is achieved through a master-slave architecture. This results in an interesting phenomenon, whereby the CPU time is divided into a sequential and a parallel portion, and the parallel part demonstrates a speedup that is linear in the number of processors. We describe an early version for which only 40% of the program was parallelized, and we describe how this was modified to achieve 90% parallelization while using 15 slave processors and a master. In the latter case, a sequential time of 158 seconds was reduced to 29 seconds using 15 slaves.

Investigations into effective methods for assessing the condition of insulation in aged power transformers

This paper investigates the effective diagnostic technique(s) for assessing the condition of insulation in aged power transformers. A number of electrical, mechanical and chemical techniques were investigated. Many of these techniques are already used by the utility engineers and two comparatively new techniques are proposed in this paper. Results showing the effectiveness of these diagnostics are presented and correlation between the techniques are also presented. Finally, merits and suitability of different techniques are discussed in this paper.

Key residues characteristic of GATA N-fingers are recognized by FOG

Protein-protein interactions play significant roles in the control of gene expression. These interactions often occur between small, discrete domains within different transcription factors. In particular, zinc fingers, usually regarded as DNA-binding domains, are now also known to be involved in mediating contacts between proteins. We have investigated the interaction between the erythroid transcription factor GATA-1 and its partner, the 9 zinc finger protein, FOG (Friend of GATA). We demonstrate that this interaction represents a genuine finger-finger contact, which is dependent on zinc coordinating residues within each protein. We map the contact domains to the core of the N-terminal zinc finger of GATA-1 and the 6th zinc finger of FOG. Using a scanning substitution strategy we identify key residues within the GATA-1 N-finger which are required for FOG binding. These residues are conserved in the N-fingers of all GATA proteins known to bind FOG, but are not found in the respective C-fingers, This observation may, therefore, account for the particular specificity of FOG for N-fingers, Interestingly, the key N-finger residues are seen to form a contiguous surface, when mapped onto the structure of the N-finger of GATA-1.

MiAMP1, a novel protein from Macadamia integrifolia adopts a Greek key beta-barrel fold unique amongst plant antimicrobial proteins

MiAMP1 is a recently discovered 76 amino acid residue, highly basic protein from the nut kernel of:Macadamia integrifolia which possesses no sequence homology to any known protein and inhibits the growth of several microbial plant pathogens in vitro while having no effect on mammalian or plant cells. It is considered to be a potentially useful tool for the genetic engineering of disease resistance in transgenic crop plants and for the design of new fungicides. The three-dimensional structure of MiAMP1 was determined through homonuclear and heteronuclear (N-15) 2D NMR spectroscopy and subsequent simulated annealing calculations with the ultimate aim of understanding the structure-activity relationships of the protein. MiAMP1 is made up of eight beta-strands which are arranged in two Greek key motifs. These Greek key motifs associate to form a Greek key beta-barrel. This structure is unique amongst plant antimicrobial proteins and forms a new class which we term the beta-barrelins. Interestingly, the structure of MiAMP1 bears remarkable similarity to a yeast killer toxin from Williopsis mrakii. This toxin acts by inhibiting beta-glucan synthesis and thereby cell wall construction in sensitive strains of yeast. The structural similarity of MiAMP1 and WmKT, which originate from plant and fungal phyla respectively, may reflect a similar mode of action. (C) 1999 Academic Press.

Computational chemistry on Fujitsu vector-parallel processors: Development and performance of applications software

In this and a preceding paper, we provide an introduction to the Fujitsu VPP range of vector-parallel supercomputers and to some of the computational chemistry software available for the VPP. Here, we consider the implementation and performance of seven popular chemistry application packages. The codes discussed range from classical molecular dynamics to semiempirical and ab initio quantum chemistry. All have evolved from sequential codes, and have typically been parallelised using a replicated data approach. As such they are well suited to the large-memory/fast-processor architecture of the VPP. For one code, CASTEP, a distributed-memory data-driven parallelisation scheme is presented. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

Target similarity effects: Support for the parallel distributed processing assumptions

Recent research has begun to provide support for the assumptions that memories are stored as a composite and are accessed in parallel (Tehan & Humphreys, 1998). New predictions derived from these assumptions and from the Chappell and Humphreys (1994) implementation of these assumptions were tested. In three experiments, subjects studied relatively short lists of words. Some of the Lists contained two similar targets (thief and theft) or two dissimilar targets (thief and steal) associated with the same cue (ROBBERY). AS predicted, target similarity affected performance in cued recall but not free association. Contrary to predictions, two spaced presentations of a target did not improve performance in free association. Two additional experiments confirmed and extended this finding. Several alternative explanations for the target similarity effect, which incorporate assumptions about separate representations and sequential search, are rejected. The importance of the finding that, in at least one implicit memory paradigm, repetition does not improve performance is also discussed.

Regulation of the Hsp90-binding immunophilin, cyclophilin 40, is mediated by multiple sites for CA-binding protein (GABP)

Within steroid receptor heterocomplexes the large tetraticopeptide repeat-containing immunophilins, cyclophilin 40 (CyP40), FKBP51, and FKBP52, target a common interaction site in heat shock protein 90 (HspSO) and act coordinately with HspSO to modulate receptor activity. The reversible nature of the interaction between the immunophilins and HspSO suggests that relative cellular abundance might be a key determinant of the immunophilin component within steroid receptor complexes. To investigate CyP40 gene regulation, we have isolated a fi-kilobase (kb) 5 ' -flanking region of the human gene and demonstrated that a similar to 50 base pair (bp) sequence adjacent to the transcription start site is essential for CyP40 basal expression. Three tandemly arranged Ets sites within this critical region were identified as binding elements for the multimeric Ets-related transcription factor, GA binding protein (GABP). Functional studies of this proximal promoter sequence, in combination with mutational analysis, confirmed these sites to be crucial for basal promoter function. Furthermore, overexpression of both GABP alpha and GABP beta subunits in Cos1 cells resulted in increased endogenous CyP40 mRNA levels. Significantly, a parallel increase in FKBP52 mRNA expression was not observed, highlighting an important difference in the mode of regulation of the CyP40 and FKBP52 genes. Our results identify GABP as a key regulator of CyP40 expression. GAFF is a common target of mitogen and stress-activated pathways and may integrate these diverse extracellular signals to regulate CyP40 gene expression.

Parallel processing and image analysis in the eyes of mantis shrimps

The compound eyes of mantis shrimps, a group of tropical marine crustaceans, incorporate principles of serial and parallel processing of visual information that may be applicable to artificial imaging systems. Their eyes include numerous specializations for analysis of the spectral and polarizational properties of light, and include more photoreceptor classes for analysis of ultraviolet light, color, and polarization than occur in any other known visual system. This is possible because receptors in different regions of the eye are anatomically diverse and incorporate unusual structural features, such as spectral filters, not seen in other compound eyes. Unlike eyes of most other animals, eyes of mantis shrimps must move to acquire some types of visual information and to integrate color and polarization with spatial vision. Information leaving the retina appears to be processed into numerous parallel data streams leading into the central nervous system, greatly reducing the analytical requirements at higher levels. Many of these unusual features of mantis shrimp vision may inspire new sensor designs for machine vision

Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.