Field trial using bone meal amendments to remediate mine waste derived soil contaminated with zinc, lead and cadmium

Bone meal amendments are being considered as a remediation method for metal-contaminated wastes. In various forms (biogenic, geogenic or synthetic), apatite, the principal mineral constituent of bone, has shown promise as an amendment to remediate metal-contaminated soils via the formation of insoluble phosphates of Pb and possibly other metals. The efficacy of commercially available bovine bone meal in this role was investigated in a field trial at Nenthead, Cumbria with a mine waste derived soil contaminated with Zn, Pb and Cd. Two 5 m(2) plots were set up: the first as a control and the second, a treatment plot where the soil was thoroughly mixed with bone meal to a depth of 50 cm at a soil to amendment ratio of 25:1 by weight. An array of soil solution samplers (Rhizon SMS (TM)) were installed in both plots and the soil pore water was collected and analysed for Ca, Cd, Zn and Pb regularly over a period of 2 a. Concurrently with the field trial, a laboratory trial with 800 mm high and 100 mm wide leaching Columns Was conducted using identical samplers and with soil from the held site. A substantial release of Zn, Pb, Cd and Ca was observed associated with the bone meal treatment. This release was transient in the case of the leaching columns, and showed seasonal variation in the case of the field trial. It is proposed that this effect resulted from metal complexation with organic acids released during breakdown of the bone meal organic fraction and was facilitated by the relatively high soil pH of 7.6-8.0. Even after this transient release effect had subsided or when incinerated bone meal was substituted in order to eliminate the organic fraction, no detectable decrease in dissolved metals was observed and no P was detected in solution, in contrast with an earlier small column laboratory study. It is concluded that due to the relative insolubility of apatite at above-neutral pH, the rate of supply of phosphate to soil solution was insufficient to result in significant precipitation of metal phosphates and that this may limit the effectiveness of the method to more acidic soils. (c) 2008 Elsevier Ltd. All rights reserved.

The systolic array genetic algorithm, an example of systolic arrays as a reconfigurable design methodology

We advocate the use of systolic design techniques to create custom hardware for Custom Computing Machines. We have developed a hardware genetic algorithm based on systolic arrays to illustrate the feasibility of the approach. The architecture is independent of the lengths of chromosomes used and can be scaled in size to accommodate different population sizes. An FPGA prototype design can process 16 million genes per second.

Implementing a generic systolic array for genetic algorithms

We have designed a highly parallel design for a simple genetic algorithm using a pipeline of systolic arrays. The systolic design provides high throughput and unidirectional pipelining by exploiting the implicit parallelism in the genetic operators. The design is significant because, unlike other hardware genetic algorithms, it is independent of both the fitness function and the particular chromosome length used in a problem. We have designed and simulated a version of the mutation array using Xilinix FPGA tools to investigate the feasibility of hardware implementation. A simple 5-chromosome mutation array occupies 195 CLBs and is capable of performing more than one million mutations per second. I. Introduction Genetic algorithms (GAs) are established search and optimization techniques which have been applied to a range of engineering and applied problems with considerable success [1]. They operate by maintaining a population of trial solutions encoded, using a suitable encoding scheme.

Building reliable systems for space applications using swarm-array computing

Space applications demand the need for building reliable systems. Autonomic computing defines such reliable systems as self-managing systems. The work reported in this paper combines agent-based and swarm robotic approaches leading to swarm-array computing, a novel technique to achieve self-managing distributed parallel computing systems. Two swarm-array computing approaches based on swarms of computational resources and swarms of tasks are explored. FPGA is considered as the computing system. The feasibility of the two proposed approaches that binds the computing system and the task together is simulated on the SeSAm multi-agent simulator.

Building reliable systems for space applications using swarm-array computing

Space applications demand the need for building reliable systems. Autonomic computing defines such reliable systems as self-managing systems. The work reported in this paper combines agent-based and swarm robotic approaches leading to swarm-array computing, a novel technique to achieve self-managing distributed parallel computing systems. Two swarm-array computing approaches based on swarms of computational resources and swarms of tasks are explored. FPGA is considered as the computing system. The feasibility of the two proposed approaches that binds the computing system and the task together is simulated on the SeSAm multi-agent simulator.

A cluster-based implementation of a fault-tolerant parallel reduction algorithm using swarm-array computing

Recent research in multi-agent systems incorporate fault tolerance concepts. However, the research does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely ‘Intelligent Agents’. In the approach considered a task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The agents hence contribute towards fault tolerance and towards building reliable systems. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.

Self-consistent field theory for diblock copolymers grafted to a sphere

An efficient numerical self-consistent field theory (SCFT) algorithm is developed for treating structured polymers on spherical surfaces. The method solves the diffusion equations of SCFT with a pseudospectral approach that combines a spherical-harmonics expansion for the angular coordinates with a modified real-space Crank–Nicolson method for the radial direction. The self-consistent field equations are solved with Anderson-mixing iterations using dynamical parameters and an alignment procedure to prevent angular drift of the solution. A demonstration of the algorithm is provided for thin films of diblock copolymer grafted to the surface of a spherical core, in which the sequence of equilibrium morphologies is predicted as a function of diblock composition. The study reveals an array of interesting behaviors as the block copolymer pattern is forced to adapt to the finite surface area of the sphere.

Parallel pipelined array architectures for real-time histogram computation in consumer devices

The real-time parallel computation of histograms using an array of pipelined cells is proposed and prototyped in this paper with application to consumer imaging products. The array operates in two modes: histogram computation and histogram reading. The proposed parallel computation method does not use any memory blocks. The resulting histogram bins can be stored into an external memory block in a pipelined fashion for subsequent reading or streaming of the results. The array of cells can be tuned to accommodate the required data path width in a VLSI image processing engine as present in many imaging consumer devices. Synthesis of the architectures presented in this paper in FPGA are shown to compute the real-time histogram of images streamed at over 36 megapixels at 30 frames/s by processing in parallel 1, 2 or 4 pixels per clock cycle.

Classification of cortical microcircuits based on micro-electrode-array data from slices of rat barrel cortex

The bewildering complexity of cortical microcircuits at the single cell level gives rise to surprisingly robust emergent activity patterns at the level of laminar and columnar local field potentials (LFPs) in response to targeted local stimuli. Here we report the results of our multivariate data-analytic approach based on simultaneous multi-site recordings using micro-electrode-array chips for investigation of the microcircuitary of rat somatosensory (barrel) cortex. We find high repeatability of stimulus-induced responses, and typical spatial distributions of LFP responses to stimuli in supragranular, granular, and infragranular layers, where the last form a particularly distinct class. Population spikes appear to travel with about 33 cm/s from granular to infragranular layers. Responses within barrel related columns have different profiles than those in neighbouring columns to the left or interchangeably to the right. Variations between slices occur, but can be minimized by strictly obeying controlled experimental protocols. Cluster analysis on normalized recordings indicates specific spatial distributions of time series reflecting the location of sources and sinks independent of the stimulus layer. Although the precise correspondences between single cell activity and LFPs are still far from clear, a sophisticated neuroinformatics approach in combination with multi-site LFP recordings in the standardized slice preparation is suitable for comparing normal conditions to genetically or pharmacologically altered situations based on real cortical microcircuitry.

The heliospheric magnetic field

The heliospheric magnetic field (HMF) is the extension of the coronal magnetic field carried out into the solar system by the solar wind. It is the means by which the Sun interacts with planetary magnetospheres and channels charged particles propagating through the heliosphere. As the HMF remains rooted at the solar photosphere as the Sun rotates, the large-scale HMF traces out an Archimedean spiral. This pattern is distorted by the interaction of fast and slow solar wind streams, as well as the interplanetary manifestations of transient solar eruptions called coronal mass ejections. On the smaller scale, the HMF exhibits an array of waves, discontinuities, and turbulence, which give hints to the solar wind formation process. This review aims to summarise observations and theory of the small- and large-scale structure of the HMF. Solar-cycle and cycle-to-cycle evolution of the HMF is discussed in terms of recent spacecraft observations and pre-spaceage proxies for the HMF in geomagnetic and galactic cosmic ray records.