Desenvolupament d'un widget FlexViewer per a Meteoclimatic

Desenvolupament en Adobe Flex d'un widget pel motor ArcGIS FlexViewer que consulta i mostra dades meteorològiques georeferenciades del servei Meteoclimatic, a fi de donar informació a un futur sistema de vigilància epidemiològica.

Estat de l'art en el desenvolupament d'aplicacions mòbils multiplataforma

L'objectiu d'aquest projecte és aprofundir en les noves tecnologies que permeten desenvolupar aplicacions multiplataforma per a dispositius mòbils i fer un estudi comparatiu entre algunes d'elles. També es realitza un estudi comparatiu entre les aplicacions generades amb aquestes tecnologies multiplataforma i les generades amb codi natiu del propi sistema.

Structuring OER Using Learning Trajectories

The Wikiwijs program in the Netherlands is experimenting in structuring a repository with digital learning materials by labelling these materials with the learning goals and subjects handled by it. This makes it possible to create an interdependent arrangement of learning materials as building blocks for a curriculum. Such arrangements are called learning trajectories. A datamodel is presented in which the entities involved and their relationships are depicted. A first implementation of this is realized and published in September 2010.

On AUV control architecture

This paper surveys control architectures proposed in the literature and describes a control architecture that is being developed for a semi-autonomous underwater vehicle for intervention missions (SAUVIM) at the University of Hawaii. Conceived as hybrid, this architecture has been organized in three layers: planning, control and execution. The mission is planned with a sequence of subgoals. Each subgoal has a related task supervisor responsible for arranging a set of pre-programmed task modules in order to achieve the subgoal. Task modules are the key concept of the architecture. They are the main building blocks and can be dynamically re-arranged by the task supervisor. In our architecture, deliberation takes place at the planning layer while reaction is dealt through the parallel execution of the task modules. Hence, the system presents both a hierarchical and an heterarchical decomposition, being able to show a predictable response while keeping rapid reactivity to the dynamic environment

Contribution to Asterisk Open Source Project

With this final master thesis we are going to contribute to the Asterisk open source project. Asterisk is an open source project that started with the main objective of develop an IP telephony platform, completely based on Software (so not hardware dependent) and under an open license like GPL. This project was started on 1999 by the software engineer Mark Spencer at Digium. The main motivation of that open source project was that the telecommunications sector is lack of open solutions, and most of the available solutions are based on proprietary standards, which are close and not compatible between them. Behind the Asterisk project there is a company, Digum, which is the project leading since the project was originated in its laboratories. This company has some of its employees fully dedicated to contribute to the Asterisk project, and also provide the whole infrastructure required by the open source project. But the business of Digium isn't based on licensing of products due to the open source nature of Asterisk, but it's based on offering services around Asteriskand designing and selling some hardware components to be used with Asterisk. The Asterisk project has grown up a lot since its birth, offering in its latest versions advanced functionalities for managing calls and compatibility with some hardware that previously was exclusive of proprietary solutions. Due to that, Asterisk is becoming a serious alternative to all these proprietaries solutions because it has reached a level of maturity that makes it very stable. In addition, as it is open source, it can be fully customized to a givenrequirement, which could be impossible with the proprietaries solutions. Due to the bigness that is reaching the project, every day there are more companies which develop value added software for telephony platforms, that are seriously evaluating the option of make their software fully compatible withAsterisk platforms. All these factors make Asterisk being a consolidated project but in constant evolution, trying to offer all those functionalities offered by proprietaries solutions. This final master thesis will be divided mainly in two blocks totally complementaries. In the first block we will analyze Asterisk as an open source project and Asterisk as a telephony platform (PBX). As a result of this analysis we will generate a document, written in English because it is Asterisk project's official language, which could be used by future contributors as an starting point on joining Asterisk. On the second block we will proceed with a development contribution to the Asterisk project. We will have several options in the form that we do the contribution, such as solving bugs, developing new functionalities or start an Asterisk satellite project. The type of contribution will depend on the needs of the project on that moment.

Implementation of zonal control algorithms in adaptive optical systems with sparse control matrices

Miralls deformables més i més grans, amb cada cop més actuadors estan sent utilitzats actualment en aplicacions d'òptica adaptativa. El control dels miralls amb centenars d'actuadors és un tema de gran interès, ja que les tècniques de control clàssiques basades en la seudoinversa de la matriu de control del sistema es tornen massa lentes quan es tracta de matrius de dimensions tan grans. En aquesta tesi doctoral es proposa un mètode per l'acceleració i la paral.lelitzacó dels algoritmes de control d'aquests miralls, a través de l'aplicació d'una tècnica de control basada en la reducció a zero del components més petits de la matriu de control (sparsification), seguida de l'optimització de l'ordenació dels accionadors de comandament atenent d'acord a la forma de la matriu, i finalment de la seva posterior divisió en petits blocs tridiagonals. Aquests blocs són molt més petits i més fàcils de fer servir en els càlculs, el que permet velocitats de càlcul molt superiors per l'eliminació dels components nuls en la matriu de control. A més, aquest enfocament permet la paral.lelització del càlcul, donant una com0onent de velocitat addicional al sistema. Fins i tot sense paral. lelització, s'ha obtingut un augment de gairebé un 40% de la velocitat de convergència dels miralls amb només 37 actuadors, mitjançant la tècnica proposada. Per validar això, s'ha implementat un muntatge experimental nou complet , que inclou un modulador de fase programable per a la generació de turbulència mitjançant pantalles de fase, i s'ha desenvolupat un model complert del bucle de control per investigar el rendiment de l'algorisme proposat. Els resultats, tant en la simulació com experimentalment, mostren l'equivalència total en els valors de desviació després de la compensació dels diferents tipus d'aberracions per als diferents algoritmes utilitzats, encara que el mètode proposat aquí permet una càrrega computacional molt menor. El procediment s'espera que sigui molt exitós quan s'aplica a miralls molt grans.

Desenvolupament d'un node sensor sense fils autoalimentat. Mòdul piezo-magnètic

En aquest projecte es pretén implementar un dispositiu capaç de ser auto-suficient i no dependre de cap tipus de pila, bateria o fil elèctric que l’abasteixi d’energia elèctrica. El dispositiu recol·lectarà la energia magnètica generada per la corrent elèctrica a un fil i la transformarà en energia elèctrica, que serà emmagatzemada per el seu posterior ús. A demès, aquest projecte s’ha desenvolupat en col·laboració amb un segon projecte, dintre del qual s’implementarà una xarxa de sensors, mitjançant el protocol MIWI. Aquest projecte es divideix en tres grans blocs. El primer bloc del projecte serà una introducció teòrica de tots els coneixements relacionats amb el concepte d’energy harvesting i els mecanismes físic implicats. Al segon bloc podrem veure com s’han realitzat els càlculs, simulacions i posada en marxa, dels diferents elements que formaran el dispositiu recol·lector d’energia. Per últim en el tercer bloc veurem el prototip ja implementat. Es valoraran els resultats obtinguts, i es veuran els temps que necessitarà per alimentar al microcontrolador.

Algorithmic aspects of bio-inspired string operations

We present building blocks for algorithms for the efficient reduction of square factor, i.e. direct repetitions in strings. So the basic problem is this: given a string, compute all strings that can be obtained by reducing factors of the form zz to z. Two types of algorithms are treated: an offline algorithm is one that can compute a data structure on the given string in advance before the actual search for the square begins; in contrast, online algorithms receive all input only at the time when a request is made. For offline algorithms we treat the following problem: Let u and w be two strings such that w is obtained from u by reducing a square factor zz to only z. If we further are given the suffix table of u, how can we derive the suffix table for w without computing it from scratch? As the suffix table plays a key role in online algorithms for the detection of squares in a string, this derivation can make the iterated reduction of squares more efficient. On the other hand, we also show how a suffix array, used for the offline detection of squares, can be adapted to the new string resulting from the deletion of a square. Because the deletion is a very local change, this adaption is more eficient than the computation of the new suffix array from scratch.

Avoiding transcription factor competition at promoter level increases the chances of obtaining oscillations

Background: The ultimate goal of synthetic biology is the conception and construction of genetic circuits that are reliable with respect to their designed function (e.g. oscillators, switches). This task remains still to be attained due to the inherent synergy of the biological building blocks and to an insufficient feedback between experiments and mathematical models. Nevertheless, the progress in these directions has been substantial. Results: It has been emphasized in the literature that the architecture of a genetic oscillator must include positive (activating) and negative (inhibiting) genetic interactions in order to yield robust oscillations. Our results point out that the oscillatory capacity is not only affected by the interaction polarity but by how it is implemented at promoter level. For a chosen oscillator architecture, we show by means of numerical simulations that the existence or lack of competition between activator and inhibitor at promoter level affects the probability of producing oscillations and also leaves characteristic fingerprints on the associated period/amplitude features. Conclusions: In comparison with non-competitive binding at promoters, competition drastically reduces the region of the parameters space characterized by oscillatory solutions. Moreover, while competition leads to pulse-like oscillations with long-tail distribution in period and amplitude for various parameters or noisy conditions, the non-competitive scenario shows a characteristic frequency and confined amplitude values. Our study also situates the competition mechanism in the context of existing genetic oscillators, with emphasis on the Atkinson oscillator.

Multiple non-collinear TF-map alignments of promoter regions

Background: The analysis of the promoter sequence of genes with similar expression patterns isa basic tool to annotate common regulatory elements. Multiple sequence alignments are on thebasis of most comparative approaches. The characterization of regulatory regions from coexpressedgenes at the sequence level, however, does not yield satisfactory results in manyoccasions as promoter regions of genes sharing similar expression programs often do not shownucleotide sequence conservation.Results: In a recent approach to circumvent this limitation, we proposed to align the maps ofpredicted transcription factors (referred as TF-maps) instead of the nucleotide sequence of tworelated promoters, taking into account the label of the corresponding factor and the position in theprimary sequence. We have now extended the basic algorithm to permit multiple promotercomparisons using the progressive alignment paradigm. In addition, non-collinear conservationblocks might now be identified in the resulting alignments. We have optimized the parameters ofthe algorithm in a small, but well-characterized collection of human-mouse-chicken-zebrafishorthologous gene promoters.Conclusion: Results in this dataset indicate that TF-map alignments are able to detect high-levelregulatory conservation at the promoter and the 3'UTR gene regions, which cannot be detectedby the typical sequence alignments. Three particular examples are introduced here to illustrate thepower of the multiple TF-map alignments to characterize conserved regulatory elements inabsence of sequence similarity. We consider this kind of approach can be extremely useful in thefuture to annotate potential transcription factor binding sites on sets of co-regulated genes fromhigh-throughput expression experiments.

On iterative performance of LDPC and Root-LDPC codes over block-fading channels

This paper presents our investigation on iterativedecoding performances of some sparse-graph codes on block-fading Rayleigh channels. The considered code ensembles are standard LDPC codes and Root-LDPC codes, first proposed in and shown to be able to attain the full transmission diversity. We study the iterative threshold performance of those codes as a function of fading gains of the transmission channel and propose a numerical approximation of the iterative threshold versus fading gains, both both LDPC and Root-LDPC codes.Also, we show analytically that, in the case of 2 fading blocks,the iterative threshold root of Root-LDPC codes is proportional to (α1 α2)1, where α1 and α2 are corresponding fading gains.From this result, the full diversity property of Root-LDPC codes immediately follows.

Mining and exploiting domain-specific corpora in the PANACEA platform

The objective of the PANACEA ICT-2007.2.2 EU project is to build a platform that automates the stages involved in the acquisition,production, updating and maintenance of the large language resources required by, among others, MT systems. The development of a Corpus Acquisition Component (CAC) for extracting monolingual and bilingual data from the web is one of the most innovative building blocks of PANACEA. The CAC, which is the first stage in the PANACEA pipeline for building Language Resources, adopts an efficient and distributed methodology to crawl for web documents with rich textual content in specific languages and predefined domains. The CAC includes modules that can acquire parallel data from sites with in-domain content available in more than one language. In order to extrinsically evaluate the CAC methodology, we have conducted several experiments that used crawled parallel corpora for the identification and extraction of parallel sentences using sentence alignment. The corpora were then successfully used for domain adaptation of Machine Translation Systems.

Memoritzar avui dia a l’aula de música : nous recursos en base a la investigació contemporània de la memòria

Aquest projecte final vol ser un acostament senzill, però amb voluntat de rigorositat respecte a la capacitat mnemònica en el context de l’ensenyament i l’aprenentatge musical. Bàsicament està estructurat en dos grans blocs. D’una banda el marc teòric, el qual proporciona una visió general del funcionament de la memòria a nivell neurològic, psicològic i musical, i dels tipus de memòria existents dels quals ens podem servir per a memoritzar. De l’altra faig una recerca sobre quin paper juga la memòria musical tant en músics formats com en nens que comencen a aprendre música. Els musics formats són representats per una mostra d’alumnes de quart curs i graduats de quatre conservatoris superiors diferents, als que a través d’un qüestionari se’ls demana informació per conèixer de primera mà la seva opinió, vivències i coneixements sobre com utilitzen la memòria. Els nens en formació s’investiguen a través d’un estudi de cas amb la intenció de comprovar què suposa dissenyar activitats d’aprenentatge orientades a facilitar la capacitat de la memòria de les persones que estan començant a aprendre música.

Contribución al diseño de GNSS-SDR, un receptor GNSS de código abierto

[ANGLÈS] This project introduces GNSS-SDR, an open source Global Navigation Satellite System software-defined receiver. The lack of reconfigurability of current commercial-of-the-shelf receivers and the advent of new radionavigation signals and systems make software receivers an appealing approach to design new architectures and signal processing algorithms. With the aim of exploring the full potential of this forthcoming scenario with a plurality of new signal structures and frequency bands available for positioning, this paper describes the software architecture design and provides details about its implementation, targeting a multiband, multisystem GNSS receiver. The result is a testbed for GNSS signal processing that allows any kind of customization, including interchangeability of signal sources, signal processing algorithms, interoperability with other systems, output formats, and the offering of interfaces to all the intermediate signals, parameters and variables. The source code release under the GNU General Public License (GPL) secures practical usability, inspection, and continuous improvement by the research community, allowing the discussion based on tangible code and the analysis of results obtained with real signals. The source code is complemented by a development ecosystem, consisting of a website (http://gnss-sdr.org), as well as a revision control system, instructions for users and developers, and communication tools. The project shows in detail the design of the initial blocks of the Signal Processing Plane of the receiver: signal conditioner, the acquisition block and the receiver channel, the project also extends the functionality of the acquisition and tracking modules of the GNSS-SDR receiver to track the new Galileo E1 signals available. Each section provides a theoretical analysis, implementation details of each block and subsequent testing to confirm the calculations with both synthetically generated signals and with real signals from satellites in space.

Clúster de alta disponibilidad y balanceo de carga sobre un servidor web

El present projecte neix degut a la necessitat de dotar a un pàgina web de una estructura sòlida així com una millor resposta als usuaris. El projecte es pot fraccionar en 2 blocs, els quals son: -La creació de un clúster de alta disponibilitat de manera que assegurem que en cas de fallida de un dels servidors físics la web seguirà sent visible per al públic. -La creació de un clúster de balanceig de càrrega que s’encarrega de redirigir les peticions per a veure la web al node del clúster que sigui més ociós en aquell.