Stability of monazite and disturbance of the Th-U-Pb system under experimental conditions of 250-350^{\circ}C and 200-400 MPa

This experimental study provides important data filling the gap in our knowledge on monazite stability under conditions of fluid-mediated low-temperature metamorphic alteration and post-magmatic hydrothermal alterations. The stability of monazite and maintenance of original Th-U-total Pb ages were tested experimentally under P-T conditions of 250-350 ^{\circ}C and 200-400 MPa over 20-40 days. The starting materials included the Burnet monazite + K-feldspar ± albite ± labradorite + muscovite + biotite + SiO_2 + CaF_2 and 2M Ca(OH)_2 or Na_2Si_2O_5 + H_2O fluid. In the runs with 2M Ca(OH)_2, monazite was unaltered. REE-enriched apatite formed at 350 ^{\circ}C and 400 MPa. The presence of the Na_2Si_2O_5 + H_2O fluid promoted the strong alteration of monazite, the formation of secondary REE-enriched apatite to fluorcalciobritholite, and the formation of REE-rich steacyite. Monazite alteration included the newly developed porosity, patchy zoning, and partial replacement by REE-rich steacyite. The unaltered domains of monazite maintained the composition of the Burnet monazite and its age of (or close to) ca. 1072 Ma, while the altered domains showed random dates in the intervals of 375-771 Ma (250 ^{\circ}C, 200 MPa run), 82-253 Ma (350 ^{\circ}C, 200 MPa), and 95-635 Ma (350 ^{\circ}C, 400 MPa). The compositional alteration and disturbance of the Th-U-Pb system resulted from fluid-mediated coupled dissolution-reprecipitation. In nature, such age disturbance in monazite can be attributed to post-magmatic alteration in granitic rocks or to metasomatic alteration during metamorphism. Recognition of potentially altered domains (dark patches in high-contrast BSE-imaging, developed porosity or inclusions of secondary minerals) is crucial to the application of Th-U-Pb geochronology

From coinductive proofs to exact real arithmetic: theory and applications

Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs construct and combine exact real number algorithms with respect to the binary signed digit representation of real numbers. The data type corresponding to the coinductive definition of continuous functions consists of finitely branching non-wellfounded trees describing when the algorithm writes and reads digits. We discuss several examples including the extraction of programs for polynomials up to degree two and the definite integral of continuous maps

Enclosing the behavior of a hybrid automaton up to and beyond a Zeno point

Even simple hybrid automata like the classic bouncing ball can exhibit Zeno behavior. The existence of this type of behavior has so far forced a large class of simulators to either ignore some events or risk looping indefinitely. This in turn forces modelers to either insert ad-hoc restrictions to circumvent Zeno behavior or to abandon hybrid automata. To address this problem, we take a fresh look at event detection and localization. A key insight that emerges from this investigation is that an enclosure for a given time interval can be valid independent of the occurrence of a given event. Such an event can then even occur an unbounded number of times. This insight makes it possible to handle some types of Zeno behavior. If the post-Zeno state is defined explicitly in the given model of the hybrid automaton, the computed enclosure covers the corresponding trajectory that starts from the Zeno point through a restarted evolution

Adsorption of benzene on Si(100) from first principles

Adsorption of benzene on the Si(100) surface is studied from first principles. We find that the most stable configuration is a tetra-$\sigma$-bonded structure characterized by one C-C double bond and four C-Si bonds. A similar structure, obtained by rotating the benzene molecule by 90 degrees, lies slightly higher in energy. However, rather narrow wells on the potential energy surface characterize these adsorption configurations. A benzene molecule impinging on the Si surface is most likely to be adsorbed in one of three different di-$\sigma$-bonded, metastable structures, characterized by two C-Si bonds, and eventually converts into the lowest-energy configurations. These results are consistent with recent experiments.Comment: 4 pages, RevTex, 2 PostScript gzipped figure

The RACE Project: Robustness by Autonomous Competence Enhancement

This paper reports on the aims, the approach, and the results of the European project RACE. The project aim was to enhance the behavior of an autonomous robot by having the robot learn from conceptualized experiences of previous performance, based on initial models of the domain and its own actions in it. This paper introduces the general system architecture; it then sketches some results in detail regarding hybrid reasoning and planning used in RACE, and instances of learning from the experiences of real robot task execution. Enhancement of robot competence is operationalized in terms of performance quality and description length of the robot instructions, and such enhancement is shown to result from the RACE system

Polynomial function intervals for floating-point software verification

The focus of our work is the verification of tight functional properties of numerical programs, such as showing that a floating-point implementation of Riemann integration computes a close approximation of the exact integral. Programmers and engineers writing such programs will benefit from verification tools that support an expressive specification language and that are highly automated. Our work provides a new method for verification of numerical software, supporting a substantially more expressive language for specifications than other publicly available automated tools. The additional expressivity in the specification language is provided by two constructs. First, the specification can feature inclusions between interval arithmetic expressions. Second, the integral operator from classical analysis can be used in the specifications, where the integration bounds can be arbitrary expressions over real variables. To support our claim of expressivity, we outline the verification of four example programs, including the integration example mentioned earlier. A key component of our method is an algorithm for proving numerical theorems. This algorithm is based on automatic polynomial approximation of non-linear real and real-interval functions defined by expressions. The PolyPaver tool is our implementation of the algorithm and its source code is publicly available. In this paper we report on experiments using PolyPaver that indicate that the additional expressivity does not come at a performance cost when comparing with other publicly available state-of-the-art provers. We also include a scalability study that explores the limits of PolyPaver in proving tight functional specifications of progressively larger randomly generated programs

Acumen : an open-source testbed for cyber-physical systems research

Developing Cyber-Physical Systems requires methods and tools to support simulation and verification of hybrid (both continuous and discrete) models. The Acumen modeling and simulation language is an open source testbed for exploring the design space of what rigorousbut- practical next-generation tools can deliver to developers of Cyber- Physical Systems. Like verification tools, a design goal for Acumen is to provide rigorous results. Like simulation tools, it aims to be intuitive, practical, and scalable. However, it is far from evident whether these two goals can be achieved simultaneously. This paper explains the primary design goals for Acumen, the core challenges that must be addressed in order to achieve these goals, the “agile research method” taken by the project, the steps taken to realize these goals, the key lessons learned, and the emerging language design

An ontology-based multi-level robot architecture for learning from experiences

One way to improve the robustness and flexibility of robot performance is to let the robot learn from its experiences. In this paper, we describe the architecture and knowledge-representation framework for a service robot being developed in the EU project RACE, and present examples illustrating how learning from experiences will be achieved. As a unique innovative feature, the framework combines memory records of low-level robot activities with ontology-based high-level semantic descriptions

Distributed optimization with arbitrary local solvers

With the growth of data and necessity for distributed optimization methods, solvers that work well on a single machine must be re-designed to leverage distributed computation. Recent work in this area has been limited by focusing heavily on developing highly specific methods for the distributed environment. These special-purpose methods are often unable to fully leverage the competitive performance of their well-tuned and customized single machine counterparts. Further, they are unable to easily integrate improvements that continue to be made to single machine methods. To this end, we present a framework for distributed optimization that both allows the flexibility of arbitrary solvers to be used on each (single) machine locally, and yet maintains competitive performance against other state-of-the-art special-purpose distributed methods. We give strong primal-dual convergence rate guarantees for our framework that hold for arbitrary local solvers. We demonstrate the impact of local solver selection both theoretically and in an extensive experimental comparison. Finally, we provide thorough implementation details for our framework, highlighting areas for practical performance gains