Influence of the solvent on the self-assembly of a modified amyloid beta peptide fragment. II. NMR and computer simulation investigation

The conformation of a model peptide AAKLVFF based on a fragment of the amyloid beta peptide A beta 16-20, KLVFF, is investigated in methanol and water via solution NMR experiments and Molecular dynamics computer simulations. In previous work, we have shown that AAKLVFF forms peptide nanotubes in methanol and twisted fibrils in water. Chemical shift measurements were used to investigate the solubility of the peptide as a function of concentration in methanol and water. This enabled the determination of critical aggregation concentrations, The Solubility was lower in water. In dilute solution, diffusion coefficients revealed the presence of intermediate aggregates in concentrated solution, coexisting with NMR-silent larger aggregates, presumed to be beta-sheets. In water, diffusion coefficients did not change appreciably with concentration, indicating the presence mainly of monomers, coexisting with larger aggregates in more concentrated solution. Concentration-dependent chemical shift measurements indicated a folded conformation for the monomers/intermediate aggregates in dilute methanol, with unfolding at higher concentration. In water, an antiparallel arrangement of strands was indicated by certain ROESY peak correlations. The temperature-dependent solubility of AAKLVFF in methanol was well described by a van't Hoff analysis, providing a solubilization enthalpy and entropy. This pointed to the importance of solvophobic interactions in the self-assembly process. Molecular dynamics Simulations constrained by NOE values from NMR suggested disordered reverse turn structures for the monomer, with an antiparallel twisted conformation for dimers. To model the beta-sheet structures formed at higher concentration, possible model arrangements of strands into beta-sheets with parallel and antiparallel configurations and different stacking sequences were used as the basis for MD simulations; two particular arrangements of antiparallel beta-sheets were found to be stable, one being linear and twisted and the other twisted in two directions. These structures Were used to simulate Circular dichroism spectra. The roles of aromatic stacking interactions and charge transfer effects were also examined. Simulated spectra were found to be similar to those observed experimentally.(in water or methanol) which show a maximum at 215 or 218 nm due to pi-pi* interactions, when allowance is made for a 15-18 nm red-shift that may be due to light scattering effects.

Constructing the frequency and wave normal distribution of whistler-mode wave power

We introduce a new methodology that allows the construction of wave frequency distributions due to growing incoherent whistler-mode waves in the magnetosphere. The technique combines the equations of geometric optics (i.e. raytracing) with the equation of transfer of radiation in an anisotropic lossy medium to obtain spectral energy density as a function of frequency and wavenormal angle. We describe the method in detail, and then demonstrate how it could be used in an idealised magnetosphere during quiet geomagnetic conditions. For a specific set of plasma conditions, we predict that the wave power peaks off the equator at ~15 degrees magnetic latitude. The new calculations predict that wave power as a function of frequency can be adequately described using a Gaussian function, but as a function of wavenormal angle, it more closely resembles a skew normal distribution. The technique described in this paper is the first known estimate of the parallel and oblique incoherent wave spectrum as a result of growing whistler-mode waves, and provides a means to incorporate self-consistent wave-particle interactions in a kinetic model of the magnetosphere over a large volume.

What is the right balance for performance and isolation with virtualization in HPC?

The use of virtualization in high-performance computing (HPC) has been suggested as a means to provide tailored services and added functionality that many users expect from full-featured Linux cluster environments. The use of virtual machines in HPC can offer several benefits, but maintaining performance is a crucial factor. In some instances the performance criteria are placed above the isolation properties. This selective relaxation of isolation for performance is an important characteristic when considering resilience for HPC environments that employ virtualization. In this paper we consider some of the factors associated with balancing performance and isolation in configurations that employ virtual machines. In this context, we propose a classification of errors based on the concept of “error zones”, as well as a detailed analysis of the trade-offs between resilience and performance based on the level of isolation provided by virtualization solutions. Finally, a set of experiments are performed using different virtualization solutions to elucidate the discussion.

An evidence-based review on the likely economic and environmental impact of genetically modified cereals and oilseeds for UK agriculture

An evidence-based review of the potential impact that the introduction of genetically-modified (GM) cereal and oilseed crops could have for the UK was carried out. The inter-disciplinary research project addressed the key research questions using scenarios for the uptake, or not, of GM technologies. This was followed by an extensive literature review, stakeholder consultation and financial modelling. The world area of canola, oilseed rape (OSR) low in both erucic acid in the oil and glucosinolates in the meal, was 34M ha in 2012 of which 27% was GM; Canada is the lead producer but it is also grown in the USA, Australia and Chile. Farm level effects of adopting GM OSR include: lower production costs; higher yields and profits; and ease of farm management. Growing GM OSR instead of conventional OSR reduces both herbicide usage and environmental impact. Some 170M ha of maize was grown in the world in 2011 of which 28% was GM; the main producers are the USA, China and Brazil. Spain is the main EU producer of GM maize although it is also grown widely in Portugal. Insect resistant (IR) and herbicide tolerant (HT) are the GM maize traits currently available commercially. Farm level benefits of adopting GM maize are lower costs of production through reduced use of pesticides and higher profits. GM maize adoption results in less pesticide usage than on conventional counterpart crops leading to less residues in food and animal feed and allowing increasing diversity of bees and other pollinators. In the EU, well-tried coexistence measures for growing GM crops in the proximity of conventional crops have avoided gene flow issues. Scientific evidence so far seems to indicate that there has been no environmental damage from growing GM crops. They may possibly even be beneficial to the environment as they result in less pesticides and herbicides being applied and improved carbon sequestration from less tillage. A review of work on GM cereals relevant for the UK found input trait work on: herbicide and pathogen tolerance; abiotic stress such as from drought or salinity; and yield traits under different field conditions. For output traits, work has mainly focussed on modifying the nutritional components of cereals and in connection with various enzymes, diagnostics and vaccines. Scrutiny of applications submitted for field trial testing of GM cereals found around 9000 applications in the USA, 15 in Australia and 10 in the EU since 1996. There have also been many patent applications and granted patents for GM cereals in the USA for both input and output traits;an indication of the scale of such work is the fact that in a 6 week period in the spring of 2013, 12 patents were granted relating to GM cereals. A dynamic financial model has enabled us to better understand and examine the likely performance of Bt maize and HT OSR for the south of the UK, if cultivation is permitted in the future. It was found that for continuous growing of Bt maize and HT OSR, unless there was pest pressure for the former and weed pressure for the latter, the seed premia and likely coexistence costs for a buffer zone between other crops would reduce the financial returns for the GM crops compared with their conventional counterparts. When modelling HT OSR in a four crop rotation, it was found that gross margins increased significantly at the higher levels of such pest or weed pressure, particularly for farm businesses with larger fields where coexistence costs would be scaled down. The impact of the supply of UK-produced GM crops on the wider supply chain was examined through an extensive literature review and widespread stakeholder consultation with the feed supply chain. The animal feed sector would benefit from cheaper supplies of raw materials if GM crops were grown and, in the future, they might also benefit from crops with enhanced nutritional profile (such as having higher protein levels) becoming available. This would also be beneficial to livestock producers enabling lower production costs and higher margins. Whilst coexistence measures would result in increased costs, it is unlikely that these would cause substantial changes in the feed chain structure. Retailers were not concerned about a future increase in the amount of animal feed coming from GM crops. To conclude, we (the project team) feel that the adoption of currently available and appropriate GM crops in the UK in the years ahead would benefit farmers, consumers and the feed chain without causing environmental damage. Furthermore, unless British farmers are allowed to grow GM crops in the future, the competitiveness of farming in the UK is likely to decline relative to that globally.

A parallel formulation for the simulation of a generic branch predictor

A parallel formulation for the simulation of a branch prediction algorithm is presented. This parallel formulation identifies independent tasks in the algorithm which can be executed concurrently. The parallel implementation is based on the multithreading model and two parallel programming platforms: pthreads and Cilk++. Improvement in execution performance by up to 7 times is observed for a generic 2-bit predictor in a 12-core multiprocessor system.

Dynamic load balancing for the distributed mining of molecular structures

In molecular biology, it is often desirable to find common properties in large numbers of drug candidates. One family of methods stems from the data mining community, where algorithms to find frequent graphs have received increasing attention over the past years. However, the computational complexity of the underlying problem and the large amount of data to be explored essentially render sequential algorithms useless. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. This problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely, a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiverinitiated load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening data set, where we were able to show close-to linear speedup in a network of workstations. The proposed approach also allows for dynamic resource aggregation in a non dedicated computational environment. These features make it suitable for large-scale, multi-domain, heterogeneous environments, such as computational grids.

Efficient mining of discriminative molecular fragments

Frequent pattern discovery in structured data is receiving an increasing attention in many application areas of sciences. However, the computational complexity and the large amount of data to be explored often make the sequential algorithms unsuitable. In this context high performance distributed computing becomes a very interesting and promising approach. In this paper we present a parallel formulation of the frequent subgraph mining problem to discover interesting patterns in molecular compounds. The application is characterized by a highly irregular tree-structured computation. No estimation is available for task workloads, which show a power-law distribution in a wide range. The proposed approach allows dynamic resource aggregation and provides fault and latency tolerance. These features make the distributed application suitable for multi-domain heterogeneous environments, such as computational Grids. The distributed application has been evaluated on the well known National Cancer Institute’s HIV-screening dataset.

Synthesis of a systolic array genetic algorithm

The paper presents a design for a hardware genetic algorithm which uses a pipeline of systolic arrays. These arrays have been designed using systolic synthesis techniques which involve expressing the algorithm as a set of uniform recurrence relations. The final design divorces the fitness function evaluation from the hardware and can process chromosomes of different lengths, giving the design a generic quality. The paper demonstrates the design methodology by progressively re-writing a simple genetic algorithm, expressed in C code, into a form from which systolic structures can be deduced. This paper extends previous work by introducing a simplification to a previous systolic design for the genetic algorithm. The simplification results in the removal of 2N 2 + 4N cells and reduces the time complexity by 3N + 1 cycles.

Supporting ad hoc collaborations in peer-to-peer networks

Traditionally, applications and tools supporting collaborative computing have been designed only with personal computers in mind and support a limited range of computing and network platforms. These applications are therefore not well equipped to deal with network heterogeneity and, in particular, do not cope well with dynamic network topologies. Progress in this area must be made if we are to fulfil the needs of users and support the diversity, mobility, and portability that are likely to characterise group work in future. This paper describes a groupware platform called Coco that is designed to support collaboration in a heterogeneous network environment. The work demonstrates that progress in the p development of a generic supporting groupware is achievable, even in the context of heterogeneous and dynamic networks. The work demonstrates the progress made in the development of an underlying communications infrastructure, building on peer-to-peer concept and topologies to improve scalability and robustness.

Building collaborative environments for advanced computing

Synchronous collaborative systems allow geographically distributed users to form a virtual work environment enabling cooperation between peers and enriching the human interaction. The technology facilitating this interaction has been studied for several years and various solutions can be found at present. In this paper, we discuss our experiences with one such widely adopted technology, namely the Access Grid [1]. We describe our experiences with using this technology, identify key problem areas and propose our solution to tackle these issues appropriately. Moreover, we propose the integration of Access Grid with an Application Sharing tool, developed by the authors. Our approach allows these integrated tools to utilise the enhanced features provided by our underlying dynamic transport layer.

Nested parallelism for multi-core HPC systems using Java

Since its introduction in 1993, the Message Passing Interface (MPI) has become a de facto standard for writing High Performance Computing (HPC) applications on clusters and Massively Parallel Processors (MPPs). The recent emergence of multi-core processor systems presents a new challenge for established parallel programming paradigms, including those based on MPI. This paper presents a new Java messaging system called MPJ Express. Using this system, we exploit multiple levels of parallelism - messaging and threading - to improve application performance on multi-core processors. We refer to our approach as nested parallelism. This MPI-like Java library can support nested parallelism by using Java or Java OpenMP (JOMP) threads within an MPJ Express process. Practicality of this approach is assessed by porting to Java a massively parallel structure formation code from Cosmology called Gadget-2. We introduce nested parallelism in the Java version of the simulation code and report good speed-ups. To the best of our knowledge it is the first time this kind of hybrid parallelism is demonstrated in a high performance Java application. (C) 2009 Elsevier Inc. All rights reserved.

An oblivious shortest-path routing algorithm for fully connected cubic networks

Fully connected cubic networks (FCCNs) are a class of newly proposed hierarchical interconnection networks for multicomputer systems, which enjoy the strengths of constant node degree and good expandability. The shortest path routing in FCCNs is an open problem. In this paper, we present an oblivious routing algorithm for n-level FCCN with N = 8(n) nodes, and prove that this algorithm creates a shortest path from the source to the destination. At the costs of both an O(N)-parallel-step off-line preprocessing phase and a list of size N stored at each node, the proposed algorithm is carried out at each related node in O(n) time. In some cases the proposed algorithm is superior to the one proposed by Chang and Wang in terms of the length of the routing path. This justifies the utility of our routing strategy. (C) 2006 Elsevier Inc. All rights reserved.