944 resultados para Syatematic derivation of monopole solutions
Resumo:
Hydrothermal solutions were examined in a circulation system that started to develop after the 1991 volcanic eruption in the axial segment of the EPR between 9°45'N and 9°52'N. Within twelve years after this eruption, diffusion outflow of hot fluid from fractures in basaltic lavas gave way to focused seeps of hot solutions through channels of hydrothermal sulfide edifices. An example of the field Q demonstrates that from 1991 to 2003 H2S concentrations decreased from 86 to 1 mM/kg, and the Fe/H2S ratio simultaneously increased by factor 1.7. This fact can explain disappearance of microbial mats that were widespread within the fields before 1991. S isotopic composition of H2S does not depend on H2S concentration. This fact testifies rapid evolution of the hydrothermal system in the early years of its evolution. Carbon in CH4 from hot fluid sampled in 2003 is richer in 12C isotope than carbon in fluid from the hydrothermal field at 21°N EPR. It suggests that methane comes to the Q field from more than one source. Composition of particulate matter in hydrothermal solutions indicates that it was contributed by biological material. Experimental solutions with labeled substrates (t<70°C) show evidence of active processes of methane oxidation and sulfate reduction. Our results indicate that, during 12-year evolution of the hydrothermal system, composition of its solutions evolved and approached compositions of solutions in mature hydrothermal systems of the EPR.
Resumo:
Traditional schemes for abstract interpretation-based global analysis of logic programs generally focus on obtaining procedure argument mode and type information. Variable sharing information is often given only the attention needed to preserve the correctness of the analysis. However, such sharing information can be very useful. In particular, it can be used for predicting runtime goal independence, which can eliminate costly run-time checks in and-parallel execution. In this paper, a new algorithm for doing abstract interpretation in logic programs is described which concentrates on inferring the dependencies of the terms bound to program variables with increased precisión and at all points in the execution of the program, rather than just at a procedure level. Algorithms are presented for computing abstract entry and success substitutions which extensively keep track of variable aliasing and term dependence information. In addition, a new, abstract domain independent ñxpoint algorithm is presented and described in detail. The algorithms are illustrated with examples. Finally, results from an implementation of the abstract interpreter are presented.