El mito en el aula de Educación Infantil: Perseo y la Gorgona Medusa.

[es] En la etapa de Educación Infantil, el mito cumple una función esencial, colaborando en el desarrollo del intertexto del niño, pues es una de las bases de la cultura occidental y su conocimiento es vital para la comprensión de numerosas obras literarias (e incluso artísticas de todo tipo). Además, comparte varios rasgos con el cuento popular, lo que hace más sencilla su incorporación al aula por medio de las adaptaciones adecuadas. En el presente trabajo, tomando como base el mito heroico de Perseo y las muchas adaptaciones que de él existen, se ha planteado una propuesta didáctica que incluye una adaptación propia del mito y una serie de actividades, para acercar dicho mito al niño de forma que le resulte interesante y accesible.

Arte medioambiental y ecología. Paradigmas de comprensión, interpretación y valoración de las relaciones entre arte y ecología (1960-2015)

549 pp. (Bibliogr. pp. 501-522) (Conclusiones pp. 467-483/ Conclusions pp. 484-497)

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.

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.

Contributions to the analysis and segmentation of remote sensing hyperspectral images

142 p.

Análisis cinemático del robot antropomórfico IRB120 de ABB

[ES]En el siguiente Trabajo Fin de Grado se va a exponer el análisis cinemático y desarrollo de un modelo virtual para la implementación de las ecuaciones cinemáticas del robot IRB120 de ABB llevados a cabo durante el curso 2013/2014. Comenzando por un estudio del Estado del Arte de la robótica industrial, se plantean seguidamente las ecuaciones de localización del robot en función de las variables de entrada mediante el método matricial. Estas ecuaciones son implementadas en un modelo de MatLab para usarlas en la resolución del problema de posición directo e inverso, y son también usadas en herramientas de creación de trayectorias. Además, sus derivadas se utilizan en el cálculo de velocidades del elemento terminal. Por último, se muestra la creación del prototipo 3D del robot, así como un interfaz gráfico de control del robot para el usuario, y los trabajos de validación llevados a cabo de los mencionados modelos virtuales sobre el robot real.

Building up a frequency stabilisation based on a wavemeter for a diode laser and characterisation for a digital mirror device for artificial potentials

It has built and characterised a laser and It has learned what each of the components does. It has been able to run the laser in single-mode and stabilised it around a desired setpoint thanks to a PID controller that It has programmed. It has established a communication between the PID controller programmed in LabVIEW and Arduino Due, the DAC that It has chosen after comparing it with another candidate. It has learned some basics of how the LightCrafter 4500 DMD works. The projected light is the composition of the lights of three LED’s, each of which has a certain on-time. The mirrors chose to be in on- or off-stages depending to the amount of intensity that we want for each colour.