A Veron | Search PubMed

PubMed2003

Isotopic tracing of landfill leachates and pollutant lead mobility in soil and groundwater.

Here we provide evidence of the capability of stable lead isotopes to trace landfill leachate in a shallow groundwater. The municipal landfill we have investigated is located in southeastern France. It has no bottom liner, and wastes are placed directly on the ground. Stable lead isotopes allow the characterization of this landfill leachate signature (206Pb/207Pb = 1.189 +/- 0.004) that is clearly different from that of the local atmosphere (206Pb/207Pb = 1.150 +/- 0.006) and crustal lead (206Pb/207Pb = 1.200 +/- 0.005). Piezometers located in the direct vicinity of the landfill generally display this contaminant imprint. The landfill plume is monitored up to 1000 m downgradient of the landfill, in very good agreement with evaluation from chloride concentration. Meanwhile, 206Pb/207Pb ratios measured at a piezometer located 4600 m downgradient of the landfill suggest a contamination by the landfill plume. This result shows that the complexity of a pollutant plume dispersion in this shallow groundwater system requires several independent tracers to clearly resolve origin and transport pathways for contaminants. Furthermore, seasonal rainfall variation for this Mediterranean mixed Quaternary alluvion reservoir and the use of KCl fertilizers might favor an efficient remobilization of atmospheric lead in plowed soils and its transfer into groundwater as shown by lead isotope systematics.

Agriculture↗

PubMed1993

Protein topology prediction through parallel constraint logic programming.

In this paper, two programs are described (CBS1e and CBS2e). These are implemented in the parallel constraint logic programming language ElipSys. These predict protein alpha/beta-sheet and beta-sheet topologies from secondary structure assignments and topological folding rules (constraints). These programs illustrate how recent developments in logic programming environments can be applied to solve large-scale combinatorial problems in molecular biology. We demonstrate that parallel constraint logic programming is able to overcome some of the important limitations of more established logic programming languages i.e. Prolog. This is particularly the case in providing features that enhance the declarative nature of the program and also in addressing directly the problems of scaling-up logic programs to solve scientifically realistic problems. Moreover, we show that for large topological problems CBS1e was approximately 60 times faster than an equivalent Prolog implementation (CBS1) on a sequential device with further performance enhancements possible on parallel computer architectures. CBS2e is an extension of CBS1e that addresses the important problem of integrating the use of uncertain (weighted) protein folding constraints with categorical ones, through the use of a cost function that is minimized. CBS2e achieves this with a relatively minor reduction of performance. These results significantly extend the range and complexity of protein structure prediction methods that can reasonably be addressed using AI languages.

Artificial Intelligence↗