Leizarragaren "Kalendrera": ariera eta korapiloak

[ES] De las menos estudiadas de su época y no siempre adecuadamente valorada, la pequeña obra Kalendrera (La Rochelle, 1571) es una de las escasas joyas que nos han legado las iglesias reformadas europeas del siglo XVI. Breve y aparentemente sencillo y sin artificio, esta Kalendrera o calendario calvinista dispuesto por Joanes Leizarraga se dibuja entreverado de datos diversos y de, a su vez,sutiles carencias de información que bien merecen la atención del lector. Al objeto de iniciar un análisis más exhaustivo de sus fuentes y motivaciones, el presente artículo se propone mostrar la problemática que, tanto desde la perspectiva ideológico-religiosa como desde la estrictamente cultural, concentra el trabajo del beskoiztarra. No es preciso añadir que, para ello, se necesita en primer término comenzar por profundizar en el funcionamiento y comprensión de los mecanismos mismos del Kalendrera.

Permutationally invariant state reconstruction

Feasible tomography schemes for large particle numbers must possess, besides an appropriate data acquisition protocol, an efficient way to reconstruct the density operator from the observed finite data set. Since state reconstruction typically requires the solution of a nonlinear large-scale optimization problem, this is a major challenge in the design of scalable tomography schemes. Here we present an efficient state reconstruction scheme for permutationally invariant quantum state tomography. It works for all common state-of-the-art reconstruction principles, including, in particular, maximum likelihood and least squares methods, which are the preferred choices in today's experiments. This high efficiency is achieved by greatly reducing the dimensionality of the problem employing a particular representation of permutationally invariant states known from spin coupling combined with convex optimization, which has clear advantages regarding speed, control and accuracy in comparison to commonly employed numerical routines. First prototype implementations easily allow reconstruction of a state of 20 qubits in a few minutes on a standard computer

Aplicación de ROS: Sistema Operativo Robótico sobre Lego Mindstorms NXT

[ES]El objetivo de este Trabajo de Fin de Grado es estudiar el programa llamado ROS, un entorno para la programación de robots. Proporciona una serie de herramientas, librerías, drivers… que facilitan en gran medida la programación de sistemas robóticos. Para realizar este estudio se utilizará ROS para crear una aplicación para un robot LEGO Mindstorms NXT. Estos robots son pequeños y versátiles, y son adecuados para la investigación. La aplicación que se llevará a cabo será un seguidor de línea, un robot capaz de seguir una pista dibujada sobre una superficie de otro color. Para programar la aplicación, se utilizarán en la medida de lo posible las herramientas proporcionadas por ROS. De esta manera, se espera alcanzar una mayor comprensión de ROS y de su funcionamiento, con sus fortalezas y sus debilidades.

Extracción de servicios TS en receptor profesional de DVB-T2.

[Es]Este documento explica el procedimiento seguido para desarrollar la última etapa de un decodificador de DVB-T2, que consiste en la extracción de un archivo de vídeo desde un archivo binario resultante del resto del decodificador. Este decodificador se trata del software de un receptor desarrollado por el departamento de TSR (Tratamiento de Señal y Radiocomunicaciones) de la Escuela de Ingenieros de Bilbao en el año 2010. Dicho software es capaz de analizar la señal recibida de DVB-T2 para calcular la tasa de errores y conocer otros parámetros relevantes como el tipo de modulación utilizado. No obstante, para analizar de manera subjetiva las mejoras de DVB-T2 e incluso para determinar de qué manera afectan los errores a la calidad de la imagen es necesario visualizar el video transmitido. Por esta razón se ha comenzado un proyecto en el que el objetivo es programar un nuevo software que proporcione un archivo que contenga el video en cuestión. Este software se ha programado en lenguaje del programa Matlab, y toma el fichero resultante del receptor como entrada, para procesarlo y obtener uno nuevo con el vídeo. De modo que una vez programado y probado para su corrección, se aplica a continuación del receptor del departamento TSR. Una vez obtenido el vídeo es posible comparar la calidad de la imagen con diferentes tasas de error en la comunicación, simulando transmisiones en diferentes ámbitos cada uno con su correspondiente ruido. De esta manera, se estima con muy alta precisión el comportamiento de una transmisión real dependiendo de la climatología y otros factores que afecten a la relación señal a ruido.

Un análisis sobre la financiación colectiva: el micro-mecenazgo

[ES]Este es un Trabajo Fin de Grado interdisciplinar que aúna el Micro-mecenazgo con la Econometría. En la parte teórica, se sintetiza la literatura relacionada con el crowdfunding, los tipos y su funcionamiento, así como los factores que influyen tanto positiva como negativamente en la consecución de los proyectos llevados a cabo por esta práctica. Se analizan también las bases de datos sobre plataformas de crowdfunding disponibles en Internet y se explica la búsqueda realizada para encontrar una muestra adecuada. Mientras que en la parte empírica, se analiza el impacto de los factores elegidos sobre la probabilidad de éxito de los proyectos. Para ello se utilizan modelos econométricos no estudiados anteriormente que se explican y analizan en la parte metodológica del trabajo. De esta forma, se obtienen resultados que ayudan a conocer las características que han de tener los proyectos publicados en las plataformas de crowdfunding para conseguir la financiación exigida. Para ello, se han teniendo en cuenta los datos encontrados en diferentes plataformas de crowdfunding entre el año 2013 y el 2015.

Fiscal Integration in the European Union : assessment of different proposals

This paper explores the fiscal situation of the European Union as well as the different approaches proposed for achieving fiscal policy coordination among the member states. Furthermore, it works through the need of fiscal integration as a pressing matter in order for the European Union to achieve its aim of functioning as an efficient single market and economic unit. In order to do so, it analyzes the theoretical lines of the Modern Money Theory as a possible framework for further integration, and it evaluates the different proposals made for fiscal integration so that it can give an assessment regarding their compatibility with this theory.

Materiales vascos del legado de Wilhelm von Humboldt: la relevancia de Astarloa y el Plan de Lenguas

Este artículo es traducción del original alemán «Zum Stellenwert Astarloas und des Plan de Lenguas», publicado en B. Hurch (ed.), Die baskischen Materialien aus dem Nachlaß Wilhelm von Humboldts. Astarloa, Charpentier, Fréret, Aizpitarte und anderes. Paderborn: Schöningh, pp. 21-42. La traducción al español es obra de Oroitz Jauregi y ha sido revisada por Ricardo Gómez y Bernhard Hurch.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

The Many Lovers of Jane Austen: Irony & Parody

Master in Literature and Literary Science