Supramolecular parallel beta-sheet and amyloid-like fibril forming peptides using delta-aminovaleric acid residue

Four terminally blocked tripeptides containing delta-aminovaleric acid residue self-assemble to form supramolecular beta-sheet structures as are revealed from their FT-IR data. Single crystal X-ray diffraction studies of two representative peptides also show that they form parallel beta-sheet structures. Self-aggregation of these beta-sheet forming peptides leads to the formation of fibrillar structures, as is evident from scanning electron microscopic (SEM) and transmission electron microscopic (TEM) images. These peptide fibrils bind to a physiological dye, Congo red and exhibit a typical green-gold birefringence under polarized light, showing close resemblance to neurodegenerative disease causing amyloid fibrils. (c) 2005 Elsevier Ltd. All rights reserved.

Studies on the parallel synthesis and evaluation of new heterocyclic extractants for the partitioning of minor actinides

Multiple parallel synthesis and evaluation have been combined in order to identify new nitrogen heterocycles for the partitioning of minor actinides(III) such as americium(III) from lanthanides such as europium(Ill). An array of triazine-containing molecules was made using multiple parallel syntheses from diketones and amide hydrazides. An excess of each of the resulting purified reagents was dissolved in 1,1,2,2-tetrachloroethane containing 2-bromodecanoic acid, and equilibrated with an aqueous solution containing the radiotracers Eu-152 and Am-241 in nitric acid ([Eu] + [Am] < 400 nanomol dm(-3)). Gamma counting of the organic and aqueous phases led to the identification of several new reagents for the selective extraction of americium(III). In particular, 6-(2-pyridyl)-2-(5,6-dialkyl-1,2,4-triazaphenyl)pyridines were found to be effective reagents for the separation of americium(III) from europium(III), (SFAm/Eu was ca. 30 in [HNO3] = 0.013 mol/L).

2D parallel interpenetration of [M-2(bpp)(4)X-4] [M, Fe(II)/Co(II); bpp, 4,4 '-trimethylenedipyridine; X, SCN-SeCN- and N-3(-)] complexes: pseudohalide-dependent conformation of bpp

Three coordination complexes of Co(II)/Fe(II) with 4,4'-trimethylenedipyridine (bpp) and pseudohalides (SCN-, SeCN- and N-3(-)) have been synthesized. The complexes have been characterized by X-ray single crystal structure determination. They are isomorphous having 2D layers in which two independent wavy nets display parallel interwoven structures. Pseudohalide binds metal centers through N terminal and occupies the trans axial positions of the octahedral metal coordination environment. Pseudohalide remains pendant on both sides of the polymeric layer and help the stacking through hydrogen bonding. The conformation of bpp in the interpenetrated nets is observed to be dependent on the choice of pseudohalide. (C) 2008 Elsevier Inc. All rights reserved.

Parallel and distributed computing with Java

The Java language first came to public attention in 1995. Within a year, it was being speculated that Java may be a good language for parallel and distributed computing. Its core features, including being objected oriented and platform independence, as well as having built-in network support and threads, has encouraged this view. Today, Java is being used in almost every type of computer-based system, ranging from sensor networks to high performance computing platforms, and from enterprise applications through to complex research-based.simulations. In this paper the key features that make Java a good language for parallel and distributed computing are first discussed. Two Java-based middleware systems, namely MPJ Express, an MPI-like Java messaging system, and Tycho, a wide-area asynchronous messaging framework with an integrated virtual registry are then discussed. The paper concludes by highlighting the advantages of using Java as middleware to support distributed applications.

Hierarchical composite regular parallel architecture

The design space of emerging heterogenous multi-core architectures with re-configurability element makes it feasible to design mixed fine-grained and coarse-grained parallel architectures. This paper presents a hierarchical composite array design which extends the curret design space of regular array design by combining a sequence of transformations. This technique is applied to derive a new design of a pipelined parallel regular array with different dataflow between phases of computation.

Linear hashtable motion estimation algorithm for distributed video processing

This paper presents a parallel Linear Hashtable Motion Estimation Algorithm (LHMEA). Most parallel video compression algorithms focus on Group of Picture (GOP). Based on LHMEA we proposed earlier [1][2], we developed a parallel motion estimation algorithm focus inside of frame. We divide each reference frames into equally sized regions. These regions are going to be processed in parallel to increase the encoding speed significantly. The theory and practice speed up of parallel LHMEA according to the number of PCs in the cluster are compared and discussed. Motion Vectors (MV) are generated from the first-pass LHMEA and used as predictors for second-pass Hexagonal Search (HEXBS) motion estimation, which only searches a small number of Macroblocks (MBs). We evaluated distributed parallel implementation of LHMEA of TPA for real time video compression.

Parallel Monte Carlo approach for integration of the rendering equation

This paper is addressed to the numerical solving of the rendering equation in realistic image creation. The rendering equation is integral equation describing the light propagation in a scene accordingly to a given illumination model. The used illumination model determines the kernel of the equation under consideration. Nowadays, widely used are the Monte Carlo methods for solving the rendering equation in order to create photorealistic images. In this work we consider the Monte Carlo solving of the rendering equation in the context of the parallel sampling scheme for hemisphere. Our aim is to apply this sampling scheme to stratified Monte Carlo integration method for parallel solving of the rendering equation. The domain for integration of the rendering equation is a hemisphere. We divide the hemispherical domain into a number of equal sub-domains of orthogonal spherical triangles. This domain partitioning allows to solve the rendering equation in parallel. It is known that the Neumann series represent the solution of the integral equation as a infinity sum of integrals. We approximate this sum with a desired truncation error (systematic error) receiving the fixed number of iteration. Then the rendering equation is solved iteratively using Monte Carlo approach. At each iteration we solve multi-dimensional integrals using uniform hemisphere partitioning scheme. An estimate of the rate of convergence is obtained using the stratified Monte Carlo method. This domain partitioning allows easy parallel realization and leads to convergence improvement of the Monte Carlo method. The high performance and Grid computing of the corresponding Monte Carlo scheme are discussed.

Parallel Monte Carlo sampling scheme for sphere and hemisphere

The sampling of certain solid angle is a fundamental operation in realistic image synthesis, where the rendering equation describing the light propagation in closed domains is solved. Monte Carlo methods for solving the rendering equation use sampling of the solid angle subtended by unit hemisphere or unit sphere in order to perform the numerical integration of the rendering equation. In this work we consider the problem for generation of uniformly distributed random samples over hemisphere and sphere. Our aim is to construct and study the parallel sampling scheme for hemisphere and sphere. First we apply the symmetry property for partitioning of hemisphere and sphere. The domain of solid angle subtended by a hemisphere is divided into a number of equal sub-domains. Each sub-domain represents solid angle subtended by orthogonal spherical triangle with fixed vertices and computable parameters. Then we introduce two new algorithms for sampling of orthogonal spherical triangles. Both algorithms are based on a transformation of the unit square. Similarly to the Arvo's algorithm for sampling of arbitrary spherical triangle the suggested algorithms accommodate the stratified sampling. We derive the necessary transformations for the algorithms. The first sampling algorithm generates a sample by mapping of the unit square onto orthogonal spherical triangle. The second algorithm directly compute the unit radius vector of a sampling point inside to the orthogonal spherical triangle. The sampling of total hemisphere and sphere is performed in parallel for all sub-domains simultaneously by using the symmetry property of partitioning. The applicability of the corresponding parallel sampling scheme for Monte Carlo and Quasi-D/lonte Carlo solving of rendering equation is discussed.