Simulación de incendios forestales y urbanos

La única forma que tienen los profesionales de aprender los procedimientos de extinción de incendios y gestión de los recursos es a través de maquetas o simulacros controlados. Este proyecto hace énfasis en la verificación de un conjunto de algoritmos de simulación y propagación de incendios facilitando la validación de los mismos por expertos. Los algoritmos validados se integrarán en un simulador interactivo dirigido al entrenamiento e instrucción del uso de los recursos para la extinción de incendios.

Reuse of software components orientated to iOS mobile devices

Within the next few pages, I will try to give a wide description of the project that I have been doing for IK4-Ikerlan. For the last six months, I have been working in developing a socket-based application for Apple devices. These devices work under the iOS operative system, which is programmed in Objective-C, a language similar to C. Although I did not have the chance to develop this application for Apple TV, I was able to create an application for iPhone and another one for iPad. The only difference between both applications was the screen resolution, but we decided to make them separately, as it would be really hard to combine both resolutions, and wallpapers, everything in the same workspace. Finally, it is necessary to add that the main goal was not to create a new application for iOS, but to translate an Android application into iOS. To achieve this, it is required to translate Java code into Objective- C, which is the language used to develop applications for all kinds of Apple devices. Fortunately, there is a tool created by Google, which helped us with this exercise. This tool is called j2ObjC, and it is still being developed.

Visualización de la información

En este proyecto se ha desarrollado una aplicación para mostrar visualmente los datos que se almacenan en el portal de Hispavista trabajos.com. Los datos se representan de manera gráfica y estadística dando al usuario la oportunidad de conocer la tendencia del mercado laboral en los últimos años.

Análisis de Plataforma de Monitorización y Diseño de Mejoras

Análisis de Pandora FMS Open Source y diseño de mejoras, en forma de módulos o sondas para extraer información de dispositivos y sistemas no soportados nativamente por la plataforma.

Antonio Machado y Lev Vigotski. Ironía o crítica como instancias modernizadoras

499 p. (Bibliogr. 443-474)

[R_Casalarreina_Condestables] Documentación geométrica del Palacio de los Condestables de Casalarreina (La Rioja)

[ES] La documentación de este proyecto ha servido como base para la realización de los siguientes proyectos y artículos:

Consumption and portfolio rules whit stochastic hyperbolic discounting

We extend the classic Merton (1969, 1971) problem that investigates the joint consumption-savings and portfolio-selection problem under capital risk by assuming sophisticated but time-inconsistent agents. We introduce stochastic hyperbolic preferences as in Harris and Laibson (2013) and find closed-form solutions for Merton's optimal consumption and portfolio selection problem in continuous time. We find that the portfolio rule remains identical to the time-consistent solution with power utility and no borrowing constraints. However,the marginal propensity to consume out of wealth is unambiguously greater than the time-consistent, exponential case and,importantly, it is also more responsive to changes in risk. These results suggest that hyperbolic discounting with sophisticated agents offers promise for contributing to explaining important aspects of asset market data.

¿Cómo determinar la asignación óptima de recursos limitados cuando existen múltiples alternativas para utilizarlos?

Duración (en horas): De 21 a 30 horas. Destinatario: Estudiante

The Linear Ordering Problem Revisited

The Linear Ordering Problem is a popular combinatorial optimisation problem which has been extensively addressed in the literature. However, in spite of its popularity, little is known about the characteristics of this problem. This paper studies a procedure to extract static information from an instance of the problem, and proposes a method to incorporate the obtained knowledge in order to improve the performance of local search-based algorithms. The procedure introduced identifies the positions where the indexes cannot generate local optima for the insert neighbourhood, and thus global optima solutions. This information is then used to propose a restricted insert neighbourhood that discards the insert operations which move indexes to positions where optimal solutions are not generated. In order to measure the efficiency of the proposed restricted insert neighbourhood system, two state-of-the-art algorithms for the LOP that include local search procedures have been modified. Conducted experiments confirm that the restricted versions of the algorithms outperform the classical designs systematically. The statistical test included in the experimentation reports significant differences in all the cases, which validates the efficiency of our proposal.

Asymptotic Hyperstability of a Class of Linear Systems under Impulsive Controls Subject to an Integral Popovian Constraint

This paper is focused on the study of the important property of the asymptotic hyperstability of a class of continuous-time dynamic systems. The presence of a parallel connection of a strictly stable subsystem to an asymptotically hyperstable one in the feed-forward loop is allowed while it has also admitted the generation of a finite or infinite number of impulsive control actions which can be combined with a general form of nonimpulsive controls. The asymptotic hyperstability property is guaranteed under a set of sufficiency-type conditions for the impulsive controls.

Sampling and learning the Mallows and Generalized Mallows models under the Cayley distance

[EN]The Mallows and Generalized Mallows models are compact yet powerful and natural ways of representing a probability distribution over the space of permutations. In this paper we deal with the problems of sampling and learning (estimating) such distributions when the metric on permutations is the Cayley distance. We propose new methods for both operations, whose performance is shown through several experiments. We also introduce novel procedures to count and randomly generate permutations at a given Cayley distance both with and without certain structural restrictions. An application in the field of biology is given to motivate the interest of this model.

Sampling and learning the Mallows and Weighted Mallows models under the Hamming distance

[EN]In this paper we deal with distributions over permutation spaces. The Mallows model is the mode l in use. The associated distance for permutations is the Hamming distance.

Sampling and learning the Mallows model under the Ulam distance

[EN]In this paper we deal with probability distributions over permutation spaces. The Probability model in use is the Mallows model. The distance for permutations that the model uses in the Ulam distance.

An R package for permutations, Mallows and Generalized Mallows models

[EN]Probability models on permutations associate a probability value to each of the permutations on n items. This paper considers two popular probability models, the Mallows model and the Generalized Mallows model. We describe methods for making inference, sampling and learning such distributions, some of which are novel in the literature. This paper also describes operations for permutations, with special attention in those related with the Kendall and Cayley distances and the random generation of permutations. These operations are of key importance for the efficient computation of the operations on distributions. These algorithms are implemented in the associated R package. Moreover, the internal code is written in C++.

Jarduera fisikoak adineko pertsona autonomoen osasunean duen eragina

294 p. : il.