Downscaling of surface moisture flux and precipitation in the Ebro Valley (Spain) using analogues and analogues followed by random forests and multiple linear regression

In this paper, reanalysis fields from the ECMWF have been statistically downscaled to predict from large-scale atmospheric fields, surface moisture flux and daily precipitation at two observatories (Zaragoza and Tortosa, Ebro Valley, Spain) during the 1961-2001 period. Three types of downscaling models have been built: (i) analogues, (ii) analogues followed by random forests and (iii) analogues followed by multiple linear regression. The inputs consist of data (predictor fields) taken from the ERA-40 reanalysis. The predicted fields are precipitation and surface moisture flux as measured at the two observatories. With the aim to reduce the dimensionality of the problem, the ERA-40 fields have been decomposed using empirical orthogonal functions. Available daily data has been divided into two parts: a training period used to find a group of about 300 analogues to build the downscaling model (1961-1996) and a test period (19972001), where models' performance has been assessed using independent data. In the case of surface moisture flux, the models based on analogues followed by random forests do not clearly outperform those built on analogues plus multiple linear regression, while simple averages calculated from the nearest analogues found in the training period, yielded only slightly worse results. In the case of precipitation, the three types of model performed equally. These results suggest that most of the models' downscaling capabilities can be attributed to the analogues-calculation stage.

Ancient DNA from Hunter-Gatherer and Farmer Groups from Northern Spain Supports a Random Dispersion Model for the Neolithic Expansion into Europe

10 p.

Efficient learning of decomposable models with a bounded clique size

The learning of probability distributions from data is a ubiquitous problem in the fields of Statistics and Artificial Intelligence. During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models due to their advantageous theoretical properties. Some of these algorithms can be used to search for a maximum likelihood decomposable model with a given maximum clique size, k, which controls the complexity of the model. Unfortunately, the problem of learning a maximum likelihood decomposable model given a maximum clique size is NP-hard for k > 2. In this work, we propose a family of algorithms which approximates this problem with a computational complexity of O(k · n^2 log n) in the worst case, where n is the number of implied random variables. The structures of the decomposable models that solve the maximum likelihood problem are called maximal k-order decomposable graphs. Our proposals, called fractal trees, construct a sequence of maximal i-order decomposable graphs, for i = 2, ..., k, in k − 1 steps. At each step, the algorithms follow a divide-and-conquer strategy based on the particular features of this type of structures. Additionally, we propose a prune-and-graft procedure which transforms a maximal k-order decomposable graph into another one, increasing its likelihood. We have implemented two particular fractal tree algorithms called parallel fractal tree and sequential fractal tree. These algorithms can be considered a natural extension of Chow and Liu’s algorithm, from k = 2 to arbitrary values of k. Both algorithms have been compared against other efficient approaches in artificial and real domains, and they have shown a competitive behavior to deal with the maximum likelihood problem. Due to their low computational complexity they are especially recommended to deal with high dimensional domains.

Criterio para análisis de fatiga con tensiones aleatorias

[ES]El trabajo que aquí se presenta tiene como principal objetivo comprobar la validez del método de Osgood, que es una particularización del método de Palmgren-Miner, que se emplea cuando un punto de una pieza está sometido a tensiones aleatorias. Se quiere comprobar su validez en situaciones reales en las que no se cumplen algunas de sus hipótesis de partida. En concreto en este trabajo se va a analizar la validez del método en dos casos: cuando el registro de tensiones aplicado sobre la pieza es alterno pero no sigue una distribución Gaussiana y cuando ni es Gaussiano ni alterno. Los resultados obtenidos empleando el método de Osgood en ambos casos se compararán con el daño obtenido para el mismo registro de tensiones empleando un método de daño lineal como es el método de Palmgren-Miner. Para llevar a cabo esta comprobación se va a hacer uso del programa Excel, mediante el cual se generarán los registros de tensiones aleatorias con los que se va a trabajar.

Nonperturbative dynamical decoupling with random control

Parametric fluctuations or stochastic signals are introduced into the rectangular pulse sequence to investigate the feasibility of random dynamical decoupling. In a large parameter region, we find that the out-of-order control pulses work as well as the regular pulses for dynamical decoupling and dissipation suppression. Calculations and analysis are enabled by and based on a nonperturbative dynamical decoupling approach allowed by an exact quantum-state-diffusion equation. When the average frequency and duration of the pulse sequence take proper values, the random control sequence is robust, fault-tolerant, and insensitive to pulse strength deviations and interpulse temporal separation in the quasi-periodic sequence. This relaxes the operational requirements placed on quantum control devices to a great deal.