Prices and the Real Exchange Rate in Hong Kong: 1985-2006

This paper has been presented at the XIII Encuentros de Economía Aplicada, Sevilla, Spain, 2010.

Las contribuciones vascas a la Hacienda Real en la Edad Moderna: Algunos contrastes provinciales

[ES]Este artículo tiene un doble objetivo. E1 primero, ofrecer una panorámica general sobre las contribuciones fiscales de las Provincias Vascas a la Corona durante el Antiguo Régimen,resaltando las diferencias que en ese orden existían entre las tres.El segundo,situar las demandas fiscales regias en el origen de las haciendas provinciales vascas,estableciendo los distintos ritmos que se siguieron en su conformación entre los siglos XVII y XVIII, hasta alcanzar una mayor homologación ya en 1a centuria siguiente.

Discursos forales y fiscalidad real. Las provincias vascas ante el "crecimiento" de la sal de 1631

[ES]La sustitución de los millones por el crecimiento en el precio de la sal que Felipe IV estableció en 1631 provocó reacciones generalizadas en toda Castilla, y en particular entre las provincias que se hallaban exentas de pagarlos. Son conocidos los violentos disturbios de Vizcaya. En cambio, poco se sabe acerca de lo sucedido en las otras dos Provincias Exentas. El presente artículo analiza, en conjunto, la actitud que tanto Vizcaya como Guipúzcoa y Álava adoptaron ante el nuevo impuesto. Aunque las tres coincidieron en rechazarlo, lo hicieron mediante discursos y métodos bien diferentes. No en vano, lejos de lo que suele pensarse no gozaban de una plena equiparación fiscal ni jurídica.

Dialog Systems based on Markov decision processes over two real tasks

In this work the state of the art of the automatic dialogue strategy management using Markov decision processes (MDP) with reinforcement learning (RL) is described. Partially observable Markov decision processes (POMDP) are also described. To test the validity of these methods, two spoken dialogue systems have been developed. The first one is a spoken dialogue system for weather forecast providing, and the second one is a more complex system for train information. With the first system, comparisons between a rule-based system and an automatically trained system have been done, using a real corpus to train the automatic strategy. In the second system, the scalability of these methods when used in larger systems has been tested.

Un proyecto de empresa pública en Guipúzcoa: la Real Fábrica de anclas de Rentería

Las Reales Fábricas no fueron originales ni exclusivas de España, sino que los diferentes estados europeos promovieron la creación y establecimiento de estas industrias públicas, a imitación y semejanza de las Manufactures Royales francesas creadas por Colbert en la segunda mitada del siglo XVII. El proyecto de crear una Real Fábrica de anclas en Guipuzcoa se inscribe dentro de la política del Despotismo Ilustrado y de las disposiciones borbónicas encaminadas a instaurar una Marina moderna y de gran alcance.

Community structure in real-world networks from a non-parametrical synchronization-based dynamical approach

[EN]This work analyzes the problem of community structure in real-world networks based on the synchronization of nonidentical coupled chaotic Rössler oscillators each one characterized by a defined natural frequency, and coupled according to a predefined network topology. The interaction scheme contemplates an uniformly increasing coupling force to simulate a society in which the association between the agents grows in time. To enhance the stability of the correlated states that could emerge from the synchronization process, we propose a parameterless mechanism that adapts the characteristic frequencies of coupled oscillators according to a dynamic connectivity matrix deduced from correlated data. We show that the characteristic frequency vector that results from the adaptation mechanism reveals the underlying community structure present in the network.

Sliding mode position control for real-time control of induction motors

A sliding mode position control for high-performance real-time applications of induction motors in developed in this work. The design also incorporates a simple flux estimator in order to avoid the flux sensors. Then, the proposed control scheme presents a low computational cost and therefore can be implemented easily in a real-time applications using a low cost DSP-processor. The stability analysis of the controller under parameter uncertainties and load disturbances in provided using Lyapunov stability theory. Finally, simulated and experimental results show that the proposed controller with the proposed observer provides a good trajectory tracking and that this scheme is robust with respect to plant parameter variations and external load disturbances.

Telemonitorización en tiempo real del Síndrome de Apneas-Hipopneas del Sueño (SAHS) mediante pulsioximetría domiciliaria

191 p.

La formación de las élites ilustradas vascas: el Real Seminario de Vergara (1776-1804).

657 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.

Documentación espacial del patrimonio: preservación de la información. Necesidades, posibilidades, estrategias y estándares

[ES] La parte práctica de esta tesis se centra en un proyecto ERASMUS realizado en el Monasterio de San Prudencio de Monte Laturce (Clavijo, La Rioja). Dicho proyecto aparece descrito en varios registros de este mismo repositorio a los que se puede acceder a través del siguiente: