How Does the New Keynesian Monetary Model Fit in the U.S. and the Eurozone? an Indirect Inference Approach

This paper estimates a standard version of the New Keynesian monetary (NKM) model under alternative specifications of the monetary policy rule using U.S. and Eurozone data. The estimation procedure implemented is a classical method based on the indirect inference principle. An unrestricted VAR is considered as the auxiliary model. On the one hand, the estimation method proposed overcomes some of the shortcomings of using a structural VAR as the auxiliary model in order to identify the impulse response that defines the minimum distance estimator implemented in the literature. On the other hand, by following a classical approach we can further assess the estimation results found in recent papers that follow a maximum-likelihood Bayesian approach. The estimation results show that some structural parameter estimates are quite sensitive to the specification of monetary policy. Moreover, the estimation results in the U.S. show that the fit of the NKM under an optimal monetary plan is much worse than the fit of the NKM model assuming a forward-looking Taylor rule. In contrast to the U.S. case, in the Eurozone the best fit is obtained assuming a backward-looking Taylor rule, but the improvement is rather small with respect to assuming either a forward-looking Taylor rule or an optimal plan.

Scenario Cluster Lagrangian Decomposition in two stage stochastic mixed 0-1 optimization

In this paper we introduce four scenario Cluster based Lagrangian Decomposition (CLD) procedures for obtaining strong lower bounds to the (optimal) solution value of two-stage stochastic mixed 0-1 problems. At each iteration of the Lagrangian based procedures, the traditional aim consists of obtaining the solution value of the corresponding Lagrangian dual via solving scenario submodels once the nonanticipativity constraints have been dualized. Instead of considering a splitting variable representation over the set of scenarios, we propose to decompose the model into a set of scenario clusters. We compare the computational performance of the four Lagrange multiplier updating procedures, namely the Subgradient Method, the Volume Algorithm, the Progressive Hedging Algorithm and the Dynamic Constrained Cutting Plane scheme for different numbers of scenario clusters and different dimensions of the original problem. Our computational experience shows that the CLD bound and its computational effort depend on the number of scenario clusters to consider. In any case, our results show that the CLD procedures outperform the traditional LD scheme for single scenarios both in the quality of the bounds and computational effort. All the procedures have been implemented in a C++ experimental code. A broad computational experience is reported on a test of randomly generated instances by using the MIP solvers COIN-OR and CPLEX for the auxiliary mixed 0-1 cluster submodels, this last solver within the open source engine COIN-OR. We also give computational evidence of the model tightening effect that the preprocessing techniques, cut generation and appending and parallel computing tools have in stochastic integer optimization. Finally, we have observed that the plain use of both solvers does not provide the optimal solution of the instances included in the testbed with which we have experimented but for two toy instances in affordable elapsed time. On the other hand the proposed procedures provide strong lower bounds (or the same solution value) in a considerably shorter elapsed time for the quasi-optimal solution obtained by other means for the original stochastic problem.

[S_Ambrona_Insitu] Levantamiento fotogramétrico del yacimiento paleontológico “Museo in situ” de Ambrona (Soria)

[ES] Se trata de un área cubierta de unos 8 x 8 metros (la altura del techo es de unos 2,5 metros en la zona más baja) en la que se disponen varios huesos de diferentes especies entre los que destacan, por su porte, varios colmillos de elefante.

Kv7 Channels Can Function without Constitutive Calmodulin Tethering

9 p.

Elementos auxiliares en fotogrametría de objeto cercano

[ES] Este artículo incluye información del siguiente proyecto de documentación geométrica:

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.

Long-lived oscillatory incoherent electron dynamics in molecules: trans-polyacetylene oligomers

We identify an intriguing feature of the electron-vibrational dynamics of molecular systems via a computational examination of trans-polyacetylene oligomers. Here, via the vibronic interactions, the decay of an electron in the conduction band resonantly excites an electron in the valence band, and vice versa, leading to oscillatory exchange of electronic population between two distinct electronic states that lives for up to tens of picoseconds. The oscillatory structure is reminiscent of beating patterns between quantum states and is strongly suggestive of the presence of long-lived molecular electronic coherence. Significantly, however, a detailed analysis of the electronic coherence properties shows that the oscillatory structure arises from a purely incoherent process. These results were obtained by propagating the coupled dynamics of electronic and vibrational degrees of freedom in a mixed quantum-classical study of the Su-Schrieffer-Heeger Hamiltonian for polyacetylene. The incoherent process is shown to occur between degenerate electronic states with distinct electronic configurations that are indirectly coupled via a third auxiliary state by vibronic interactions. A discussion of how to construct electronic superposition states in molecules that are truly robust to decoherence is also presented

Lehiaketa motor baten direkzio piparen diseinua

[EU]Hurrengo orrialdeetan aurkezten den proiektu honetan, lehiaketa motor baten direkzio piparen diseinua proposatzen da zeinak Moto Engineering Foundation fundazioak sustatutako nazioarteko Motostudent txapelketan parte hartzeko motorrera egokituta egon beharko den. Honako helburu honekin beraz, direkzio piparen diseinu egoki bat egin ahal izateko piezak sufrituko dituen karga egoerak aurreikusi beharko ditugu hauen arabera jasan beharreko tentsio egoerak aztertu ahal izateko. Piezaren tentsioen analisia aurrera eraman beharko da beraz, diseinaturiko piezaren funtzionamendu egokia ziurtatu ahal izateko. Historian zehar existitutako diseinu modelo ezberdinak eta baita gaur egunean gehien erabilitakoak ere aurkeztu eta gero, gure kasura hobekien moldatuko zaion adibidetik ekingo zaio diseinuari, aldez aurretik eskuratutako datu eta errodamenduetatik abiatuz. Horrenbestez, oinarritzat hartutako direkzio sistema modeloa eta bestelako elementuen neurriak datutzat hartuta, tija zein norabide ardatzarena esate baterako, direkzio piparen hasierako geometria definituko da. Eskuragarri ditugun analisi metodo ezberdinak aztertu eta gure kasura hobekien moldatzen dena aukeratu eta eraikitako piezari aplikatuko zaio. Lorturiko emaitzen arabera hasiera batean planteaturiko diseinua onartu edo baztertzea erabaki beharko dugu. Beraz, gure diseinua optimizatuz joateko aukera izango dugu, baldintzak eta betebeharrak egiztatuko dituen amaierako pieza diseinua lortu arte. Bukatzeko, proiektuari itxiera emango dion atala aurkeztuko da, hala nola, proiektuaren garapenean zehar lorturiko emaitzak eta ondorioak biltzen dituen atala non lorturiko direkzio piparen funtzionamendu egokia bermatzen dituzten parametroak aurkeztuko diren. Gainera, direkzio sistemaren funtsezko atala izango diren errodamenduen kalkulu eta aukeraketa bideratuko da baita ere.

Cargador fotovoltaico para Smartphones de última generación.

[ES]Este proyecto tiene como objetivo diseñar e implementar un prototipo de un cargador fotovoltaico para teléfonos móviles de última generación. Dicho prototipo constará de un panel fotovoltaico, reguladores de tensión y corriente, un MPPT, un regulador de carga de batería, una batería auxiliar y una conexión USB para conectarlo al dispositivo a cargar. Para su realización, se llevará a cabo un estudio previo para obtener conocimientos sobre el funcionamiento de las nuevas tecnologías en esta área, su oferta en el mercado, y se hará uso de las herramientas necesarias para su diseño, implementación y pruebas posteriores.

Diseño estructural de un basculante de moto de competición

[ES]En este trabajo se plantea una propuesta de diseño estructural de un basculante de una moto de competición de 250cc y 4T adecuado a las normas de la competición MotoStudent entre universidades. En primer lugar se estudian los distintos tipos de basculante existentes y se ponderan sus ventajas e inconvenientes. Posteriormente se elige uno de los tipos en base a las características de la moto y se desarrolla. La herramienta utilizada para el desarrollo es el programa PTC Creo 2.0. Primero se realiza el diseño en CAD de la pieza y después se estudia el diseño con el método de elementos finitos y se modifica hasta alcanzar los requisitos necesarios. Finalmente se añaden elementos auxiliares necesarios y se realizan los planos de la pieza.

Diseño de sistema de suspensión progresiva Pro-Link

[ES]Mediante este trabajo se va a diseñar un mecanismo para crear un sistema de suspensión progresiva para la suspensión trasera de una motocicleta a partir de un muelle lineal. El muelle introducido en la suspensión será lineal, por lo tanto, tendrá una sola rigidez, constante y la cual delimita el muelle, pero gracias a un mecanismo diseñado especialmente para la suspensión trasera de una moto, se va conseguir que la rigidez varíe. El mecanismo utilizado para este trabajo se llama Pro-Link y la empresa que lo emplea es Honda. Para ello, se creará un esquema del mecanismo en sí y tras un análisis cinemático mediante el programa Creo Parametric, y haciendo varios cambios en el sistema para ajustarlo a la mejor progresividad posible, se obtendrá la gráfica en la que se observará la curva que marca la rigidez progresiva. Esto es, se verá la evolución de la nueva rigidez dependiendo de la oscilación vertical de la rueda. Por otra parte, gracias a un análisis dinámico del mismo programa se conseguirán las reacciones del sistema y se calcularán los elementos auxiliares de éste para el buen funcionamiento del mismo. Finalmente, se creará el diseño del triángulo y un diseño preliminar del basculante mediante el método de elementos finitos del programa.

Diseño de un mecanismo de amplificación para una garra de 1 grado de libertad.

[ES]El presente Trabajo de Fin de Grado tiene la finalidad de contribuir al desarrollo de una línea de investigación mediante la implementación de un mecanismo que amplifique el movimiento de un grado de libertad. Dicho proyecto consiste en optimizar un mecanismo ya existente formado por un músculo neumático de un grado de libertad de forma que se mejore el rango de utilización de dicho mecanismo ampliando la carrera final de éste. Para ello se llevará a cabo un análisis de distintos mecanismos multiplicadores, el diseño de la mejor opción entre todos ellos y la final fabricación de un prototipo funcional. También se llevará a cabo el diseño y fabricación de las piezas auxiliares que, si bien, no forman parte explícita del mecanismo multiplicador, son necesarias para la posterior implantación de dicho mecanismo en el mecanismo ya existente, formado por un mecanismo mecatrónico de cinemática plana 5R dotado de un músculo neumático y una ventosa.