ESTIMATING TEMPORAL ASSOCIATIONS IN ELECTROCORTICOGRAPHIC (ECoG) TIME SERIES WITH FIRST ORDER PRUNING

Granger causality (GC) is a statistical technique used to estimate temporal associations in multivariate time series. Many applications and extensions of GC have been proposed since its formulation by Granger in 1969. Here we control for potentially mediating or confounding associations between time series in the context of event-related electrocorticographic (ECoG) time series. A pruning approach to remove spurious connections and simultaneously reduce the required number of estimations to fit the effective connectivity graph is proposed. Additionally, we consider the potential of adjusted GC applied to independent components as a method to explore temporal relationships between underlying source signals. Both approaches overcome limitations encountered when estimating many parameters in multivariate time-series data, an increasingly common predicament in today's brain mapping studies.

Response of a First-Order Stream in Maine to Short-Term In-Stream Acidification

An experimental short-term acidification with HCl at a first-order stream in central Maine, USA was used to study processes controlling the changes in stream chemistry and to assess the ability of stream substrate to buffer pH. The streambed exerted a strong buffering capacity against pH change by ion exchange during the 6-hour acidification. Streambed substrates had substantial cation and anion exchange capacity in the pH range of 4.1 to 6.5. The ion exchange for cations and SO42- were rapid and reversible. The speed of release of cations from stream substrates was Na1+ > Ca2+ > Mg2+ > Aln+ > Be2+, perhaps relating to charge density of these cations. Ca2+ desorption dominated neutralisation of excess H+ for the first 2 hr. As the reservoir of exchangeable Ca diminished, desorption land possibly dissolution) of Al3+ became the dominant neutralising mechanism. The exchangeable land possibly soluble) reservoir of Al was not depleted during the 6-hour acidification. Sulphate adsorption during the acidification reduced the concentration of SO42- in stream water by as much as 20 mu eq L-1 (from 70 mu eq L-1). Desorption of SO42- and adsorption of base cat ions after the artificial acidification resulted in a prolongation of the pH depression. The streambed had the capacity to buffer stream water chemistry significantly during an acidifying event affecting the entire upstream catchment.

First order thermal phase transition with 126 GeV Higgs mass

We study the strength of the electroweak phase transition in models with two light Higgs doublets and a light SU(3)c triplet by means of lattice simulations in a dimensionally reduced effective theory. In the parameter region considered the transition on the lattice is significantly stronger than indicated by a 2-loop perturbative analysis. Within some ultraviolet uncertainties, the finding applies to MSSM with a Higgs mass mh ≈ 126 GeV and shows that the parameter region useful for electroweak baryogenesis is enlarged. In particular (even though only dedicated analyses can quantify the issue), the tension between LHC constraints after the 7 TeV and 8 TeV runs and frameworks where the electroweak phase transition is driven by light stops, seems to be relaxed.

Experimental dissolution of molybdenum-sulphides at low oxygen concentrations: A first-order approximation of late Archean atmospheric conditions

The abundance of atmospheric oxygen and its evolution through Earth's history is a highly debated topic. The earliest change of the Mo concentration and isotope composition of marine sediments are interpreted to be linked to the onset of the accumulation of free O2 in Earth's atmosphere. The O2 concentration needed to dissolve significant amounts of Mo in water is not yet quantified, however. We present laboratory experiments on pulverized and surface-cleaned molybdenite (MoS2) and a hydrothermal breccia enriched in Mo-bearing sulphides using a glove box setup. Duration of an experiment was 14 days, and first signs of oxidation and subsequent dissolution of Mo compounds start to occur above an atmospheric oxygen concentration of 72 ± 20 ppmv (i.e., 2.6 to 4.6 × 10−4 present atmospheric level (PAL)). This experimentally determined value coincides with published model calculations supporting atmospheric O2 concentrations between 1 × 10−5 to 3 × 10−4 PAL prior to the Great Oxidation Event and sets an upper limit to the molecular oxygen needed to trigger Mo accumulation and Mo isotope variations recorded in sediments. In combination with the published Mo isotope composition of the rock record, this result implies an atmospheric oxygen concentration prior to 2.76 Ga of below 72 ± 20 ppmv.

Second-order Lagrangians admitting a first-order Hamiltonian formalism

Let p: E —» JV be an arbitrary fibred manifold over a connected n-dimensional manifold N oriented by a volume form v = dx1^-...^dxn, and let pk: JkE → N be the bundle of K-jets of local sections of p, with projections Plk : JkE → JlE for every k ≥ 1

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.

Hiord: A type-free higher-order logic programming language with predicate abstraction

A new formalism, called Hiord, for defining type-free higherorder logic programming languages with predicate abstraction is introduced. A model theory, based on partial combinatory algebras, is presented, with respect to which the formalism is shown sound. A programming language built on a subset of Hiord, and its implementation are discussed. A new proposal for defining modules in this framework is considered, along with several examples.

Involutivity of the Hamilton-Cartan equations of a second-order Lagrangian admitting a first-order Hamiltonian formalism

Involutivity of the Hamilton-Cartan equations of a second-order Lagrangian admitting a first-order Hamiltonian formalism

Lithologic Control on the Scaling Properties of the First-Order Streams of Drainage Networks: A Monofractal Analysis

The movement of water through the landscape can be investigated at different scales. This study dealt with the interrelation between bedrock lithology and the geometry of the overlying drainage systems. Parameters of fractal analysis, such as fractal dimension and lacunarity, were used to measure and quantify this relationship. The interrelation between bedrock lithology and the geometry of the drainage systems has been widely studied in the last decades. The quantification of this linkage has not yet been clearly established. Several studies have selected river basins or regularly shaped areas as study units, assuming them to be lithologically homogeneous. This study considered irregular distributions of rock types, establishing areas of the soil map (1:25,000) with the same lithologic information as study units. The tectonic stability and the low climatic variability of the study region allowed effective investigation of the lithologic controls on the drainage networks developed on the plutonic rocks, the metamorphic rocks, and the sedimentary materials existing in the study area. To exclude the effect of multiple in- and outflows in the lithologically homogeneous units, we focused this study on the first-order streams of the drainage networks. The geometry of the hydrologic features was quantified through traditional metrics of fluvial geomorphology and scaling parameters of fractal analysis, such as the fractal dimension, the reference density, and the lacunarity. The results demonstrate the scale invariance of both the drainage networks and the set of first-order streams at the study scale and a relationship between scaling in the lithology and the drainage network.

First order mem-circuits: modeling, nonlinear oscillations and bifurcations

This paper presents a theoretical framework intended to accommodate circuit devices described by characteristics involving more than two fundamental variables. This framework is motivated by the recent appearance of a variety of so-called mem-devices in circuit theory, and makes it possible to model the coexistence of memory effects of different nature in a single device. With a compact formalism, this setting accounts for classical devices and also for circuit elements which do not admit a two-variable description. Fully nonlinear characteristics are allowed for all devices, driving the analysis beyond the framework of Chua and Di Ventra We classify these fully nonlinear circuit elements in terms of the variables involved in their constitutive relations and the notions of the differential- and the state-order of a device. We extend the notion of a topologically degenerate configuration to this broader context, and characterize the differential-algebraic index of nodal models of such circuits. Additionally, we explore certain dynamical features of mem-circuits involving manifolds of non-isolated equilibria. Related bifurcation phenomena are explored for a family of nonlinear oscillators based on mem-devices.