Seismic velocities and elastic properties of gabbroic rocks from ODP Hole 118-735B

The nearly continuous recovery of 0.5 km of generally fresh, layer 3 gabbroic rocks at Hole 735B, especially near the bottom of the section, presents scientists an unusual opportunity to study the detailed elastic properties of the lower oceanic crust. Extending compressional-wave and density shipboard measurements at room pressure, Vp and Vs were measured at pressures from 20 to 200 MPa using the pulse transmission method. All of the rocks exhibit significant increases in velocity with increasing pressure up to about 150 MPa, a feature attributed to the closing of microcrack porosity. Measured velocities reflect the mineralogical makeup and microstructures acquired during the tectonic history of Hole 735B. Most of the undeformed and unaltered gabbros are approximately 65:35 plagioclase/clinopyroxene rocks plus olivine or oxide minerals, and the observed densities and velocities are fully consistent with the Voigt-Reuss-Hill (VRH) averages of the component minerals and their proportions. Depending on their olivine content, the predominant olivine gabbros at 200 MPa have average Vp = 7.1 ± 0.2 km/s, Vs = 3.9 ± 0.1 km/s, and grain densities of 2.95 ± 0.5 g/cm3. The less abundant iron-titanium (Fe-Ti) oxide gabbros average Vp = 6.75 ± 0.15 km/s, Vs = 3.70 ± 0.1 km/s, and grain densities of 3.22 ± 0.05 g/cm3, reflecting the higher densities and lower velocities of oxide minerals compared to olivine. About 30% of the core is plastically deformed, and the densities and directionally averaged velocities of these shear-zone tectonites are generally consistent with those of the gabbros, their protoliths. Three sets of observations indicate that the shear-zone metagabbros are elastically anisotropic: (1) directional variations in Vp, both vertical and horizontal and with respect to foliation and lineation; (2) discrepancies among Vp values for the horizontal cores and the VRH averages of the component minerals and their mineral proportions, suggesting preferred crystallographic orientations of anisotropic minerals; and (3) variations of Vs of up to 7%, with polarization directions parallel and perpendicular to foliation. Optical inspection of thin sections of the same samples indicates that plagioclase feldspar, clinopyroxene, and amphibole typically display crystallographic-preferred orientations, and this, plus the elastic anisotropy of these minerals, suggests that preferred orientations are responsible for much of the observed anisotropy, particularly at high pressure. Alteration tends to be localized to brittle faults and brecciated zones, and typical alteration minerals are amphibole and secondary plagioclase, which do not significantly change the velocity-density relationships.

(Table 1) Compressional and shear wave velocities and elastic constants of DSDP Hole 83-504B basalts

Compressional and shear wave velocities at confining pressures to 6 kb, densities, and porosities were measured for 32 samples obtained from 836 to 1350 m below seafloor (BSF) in Hole 504B, the section drilled on Leg 83 of the Deep Sea Drilling Project. These data in combination with similar measurements on 28 basalt samples from the section from 274.5 to 836 m, drilled on Legs 69 and 70, provide a comprehensive set of physical property data for over 1000 m of oceanic crust. The velocities, densities, and porosities measured in the laboratory exhibit greater variability in the upper portion of the hole. In general, compressional and shear wave velocities and densities increase with depth, reaching average values at 1 kbar of Vp = 6.45 km/s, Ks = 3.45 km/s and p = 2.94 g/cm3 within the sheeted dike section. Porosities decrease with depth to values generally less than 1% near the bottom of the hole

Consolidation tests, elastic properties and grain size measurements at the consolidations samples from different Holes of IODP Expedition 302

The Integrated OceanDrilling Program's Expedition 302, the Arctic Coring Expedition (ACEX), recovered the first Cenozoic sedimentary sequence from the central Arctic Ocean. ACEX provided ground truth for basin scale geophysical interpretations and for guiding future exploration targets in this largely unexplored ocean basin. Here, we present results from a series of consolidation tests used to characterize sediment compressibility and permeability and integrate these with high-resolution measurements of bulk density, porosity and shear strength to investigate the stress history and the nature of prominent lithostratigraphic and seismostratigraphic boundaries in the ACEX record. Despite moderate sedimentation rates (10-30 m/Myr) and high permeability values (10**-15 -10**-18 m**2), consolidation and shear strength measurements both suggest an overall state of underconsolidation or overpressure. One-dimensional compaction modelling shows that to maintain such excess pore pressures, an in situ fluid source is required that exceeds the rate of fluid expulsion generated by mechanical compaction alone. Geochemical and sedimentological evidence is presented that identifes the Opal A-C/T transformation of biosiliceous rich sediments as a potential additional in situ fluid source.However, the combined rat of chemical and mechanical compaction remain too low to fully account for the observed pore pressure gradients, implying an additional diagenetic fluid source from within or below the recovered Cenozoic sediments from ACEX. Recognition of the Opal A-C/T reaction front in the ACEX record has broad reaching regional implications on slope stability and subsurface pressure evolution, and provides an important consideration for interpreting and correlating the spatially limited seismic data from the Arctic Ocean.

Lock-free Parallel Dynamic Programming

We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the order in which the dynamic program computes its subproblems. This generic approach is applied to dynamic programs for knapsack, shortest paths, and RNA structure alignment, as well as to a state-of-the-art solution for minimizing the máximum number of open stacks. Experimental results are provided on three different modern multicore architectures which show that this parallelization is effective and reasonably scalable. In particular, we obtain over 10 times speedup for 32 threads on the open stacks problem.

Elastic (stress-strain) halo associated to ion-induced nano-tracks in lithium niobate: role of crystal anisotropy

The elastic strain/stress fields (halo) around a compressed amorphous nano-track (core) caused by a single high-energy ion impact on LiNbO3 are calculated. A method is developed to approximately account for the effects of crystal anisotropy of LiNbO3 (symmetry 3m) on the stress fields for tracks oriented along the crystal axes (X, Y or Z). It only considers the zero-order (axial) harmonic contribution to the displacement field in the perpendicular plane and uses effective Poisson moduli for each particular orientation. The anisotropy is relatively small; however, it accounts for some differential features obtained for irradiations along the crystallographic axes X, Y and Z. In particular, the irradiation-induced disorder (including halo) and the associated surface swelling appear to be higher for irradiations along the X- or Y-axis in comparison with those along the Z-axis. Other irradiation effects can be explained by the model, e.g. fracture patterns or the morphology of pores after chemical etching of tracks. Moreover, it offers interesting predictions on the effect of irradiation on lattice parameters

Energy-Entropy-Momentum integration of discrete thermo-visco-elastic dynamics.

A novel time integration scheme is presented for the numerical solution of the dynamics of discrete systems consisting of point masses and thermo-visco-elastic springs. Even considering fully coupled constitutive laws for the elements, the obtained solutions strictly preserve the two laws of thermo dynamics and the symmetries of the continuum evolution equations. Moreover, the unconditional control over the energy and the entropy growth have the effect of stabilizing the numerical solution, allowing the use of larger time steps than those suitable for comparable implicit algorithms. Proofs for these claims are provided in the article as well as numerical examples that illustrate the performance of the method.

Ion Beam irradiation of copper nitride: electronic vs elastic-collision mechanism

Copper nitride is a metastable material which results very attractive because of their potential to be used in functional device. Cu3 N easily decomposes into Cu and N2 by annealing [1] or irradiation (electron, ions, laser) [2, 3]. Previous studies carried out in N-rich Cu3 N films irradiated with Cu at 42MeV evidence a very efficient sputtering of N whose yield (5×10 3 atom/ion), for a film with a thickness of just 100 nm, suggest that the origin of the sputtering has an electronic nature. This N depletion was observed to be responsible for new phase formation ( Cu2 O) and pure Cu [4]

Relational and Allegorical Semantics for Constraint Logic Programming

El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarrollado en gran medida por Peirce y Schröder. Tarski, Givant, Freyd y Scedrov demostraron que las álgebras relacionales son capaces de formalizar la lógica de primer orden, la lógica de orden superior así como la teoría de conjuntos. A partir de los resultados matemáticos de Tarski y Freyd, esta tesis desarrolla semánticas denotacionales y operacionales para la programación lógica con restricciones usando el álgebra relacional como base. La idea principal es la utilización del concepto de semántica ejecutable, semánticas cuya característica principal es el que la ejecución es posible utilizando el razonamiento estándar del universo semántico, este caso, razonamiento ecuacional. En el caso de este trabajo, se muestra que las álgebras relacionales distributivas con un operador de punto fijo capturan toda la teoría y metateoría estándar de la programación lógica con restricciones incluyendo los árboles utilizados en la búsqueda de demostraciones. La mayor parte de técnicas de optimización de programas, evaluación parcial e interpretación abstracta pueden ser llevadas a cabo utilizando las semánticas aquí presentadas. La demostración de la corrección de la implementación resulta extremadamente sencilla. En la primera parte de la tesis, un programa lógico con restricciones es traducido a un conjunto de términos relacionales. La interpretación estándar en la teoría de conjuntos de dichas relaciones coincide con la semántica estándar para CLP. Las consultas contra el programa traducido son llevadas a cabo mediante la reescritura de relaciones. Para concluir la primera parte, se demuestra la corrección y equivalencia operacional de esta nueva semántica, así como se define un algoritmo de unificación mediante la reescritura de relaciones. La segunda parte de la tesis desarrolla una semántica para la programación lógica con restricciones usando la teoría de alegorías—versión categórica del álgebra de relaciones—de Freyd. Para ello, se definen dos nuevos conceptos de Categoría Regular de Lawvere y _-Alegoría, en las cuales es posible interpretar un programa lógico. La ventaja fundamental que el enfoque categórico aporta es la definición de una máquina categórica que mejora e sistema de reescritura presentado en la primera parte. Gracias al uso de relaciones tabulares, la máquina modela la ejecución eficiente sin salir de un marco estrictamente formal. Utilizando la reescritura de diagramas, se define un algoritmo para el cálculo de pullbacks en Categorías Regulares de Lawvere. Los dominios de las tabulaciones aportan información sobre la utilización de memoria y variable libres, mientras que el estado compartido queda capturado por los diagramas. La especificación de la máquina induce la derivación formal de un juego de instrucciones eficiente. El marco categórico aporta otras importantes ventajas, como la posibilidad de incorporar tipos de datos algebraicos, funciones y otras extensiones a Prolog, a la vez que se conserva el carácter 100% declarativo de nuestra semántica. ABSTRACT The calculus of binary relations was introduced by De Morgan in 1860, to be greatly developed by Peirce and Schröder, as well as many others in the twentieth century. Using different formulations of relational structures, Tarski, Givant, Freyd, and Scedrov have shown how relation algebras can provide a variable-free way of formalizing first order logic, higher order logic and set theory, among other formal systems. Building on those mathematical results, we develop denotational and operational semantics for Constraint Logic Programming using relation algebra. The idea of executable semantics plays a fundamental role in this work, both as a philosophical and technical foundation. We call a semantics executable when program execution can be carried out using the regular theory and tools that define the semantic universe. Throughout this work, the use of pure algebraic reasoning is the basis of denotational and operational results, eliminating all the classical non-equational meta-theory associated to traditional semantics for Logic Programming. All algebraic reasoning, including execution, is performed in an algebraic way, to the point we could state that the denotational semantics of a CLP program is directly executable. Techniques like optimization, partial evaluation and abstract interpretation find a natural place in our algebraic models. Other properties, like correctness of the implementation or program transformation are easy to check, as they are carried out using instances of the general equational theory. In the first part of the work, we translate Constraint Logic Programs to binary relations in a modified version of the distributive relation algebras used by Tarski. Execution is carried out by a rewriting system. We prove adequacy and operational equivalence of the semantics. In the second part of the work, the relation algebraic approach is improved by using allegory theory, a categorical version of the algebra of relations developed by Freyd and Scedrov. The use of allegories lifts the semantics to typed relations, which capture the number of logical variables used by a predicate or program state in a declarative way. A logic program is interpreted in a _-allegory, which is in turn generated from a new notion of Regular Lawvere Category. As in the untyped case, program translation coincides with program interpretation. Thus, we develop a categorical machine directly from the semantics. The machine is based on relation composition, with a pullback calculation algorithm at its core. The algorithm is defined with the help of a notion of diagram rewriting. In this operational interpretation, types represent information about memory allocation and the execution mechanism is more efficient, thanks to the faithful representation of shared state by categorical projections. We finish the work by illustrating how the categorical semantics allows the incorporation into Prolog of constructs typical of Functional Programming, like abstract data types, and strict and lazy functions.

Dynamic response of hydro power plants for providing secondary regulation reserves considering elastic water column effects

In this paper, the dynamic response of a hydro power plant for providing secondary regulation reserve is studied in detail. Special emphasis is given to the elastic water column effects both in the penstock and the tailrace tunnel. For this purpose, a nonlinear model based on the analogy between mass and momentum conservation equations of a water conduit and those of wave propagation in transmission lines is used. The influence of the plant configuration and design parameters on the fulfilment of the Spanish Electrical System Operator requirements is analysed

Parallelizing irregular and pointer-based computations automatically: perspectives from logic and constraint programming

Irregular computations pose sorne of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures, which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence detection to task partitioning and placement. Starting in the mid 80s there has been significant progress in the development of parallelizing compilers for logic pro­gramming (and more recently, constraint programming) resulting in quite capable paralle­lizers. The typical applications of these paradigms frequently involve irregular computations, and make heavy use of dynamic data structures with pointers, since logical variables represent in practice a well-behaved form of pointers. This arguably makes the techniques used in these compilers potentially interesting. In this paper, we introduce in a tutoríal way, sorne of the problems faced by parallelizing compilers for logic and constraint programs and provide pointers to sorne of the significant progress made in the area. In particular, this work has resulted in a series of achievements in the areas of inter-procedural pointer aliasing analysis for independence detection, cost models and cost analysis, cactus-stack memory management, techniques for managing speculative and irregular computations through task granularity control and dynamic task allocation such as work-stealing schedulers), etc.

Designing a high performance parallel logic programming system

Compilation techniques such as those portrayed by the Warren Abstract Machine(WAM) have greatly improved the speed of execution of logic programs. The research presented herein is geared towards providing additional performance to logic programs through the use of parallelism, while preserving the conventional semantics of logic languages. Two áreas to which special attention is given are the preservation of sequential performance and storage efficiency, and the use of low overhead mechanisms for controlling parallel execution. Accordingly, the techniques used for supporting parallelism are efficient extensions of those which have brought high inferencing speeds to sequential implementations. At a lower level, special attention is also given to design and simulation detail and to the architectural implications of the execution model behavior. This paper offers an overview of the basic concepts and techniques used in the parallel design, simulation tools used, and some of the results obtained to date.