Uncovering the functional constraints underlying the genomic organisation of the Odorant-Binding Protein genes

Animal olfactory systems have a critical role for the survival and reproduction of individuals. In insects, the odorant-binding proteins (OBPs) are encoded by a moderately sized gene family, and mediate the first steps of the olfactory processing. Most OBPs are organized in clusters of a few paralogs, which are conserved over time. Currently, the biological mechanism explaining the close physical proximity among OBPs is not yet established. Here, we conducted a comprehensive study aiming to gain insights into the mechanisms underlying the OBP genomic organization. We found that the OBP clusters are embedded within large conserved arrangements. These organizations also include other non-OBP genes, which often encode proteins integral to plasma membrane. Moreover, the conservation degree of such large clusters is related to the following: 1) the promoter architecture of the confined genes, 2) a characteristic transcriptional environment, and 3) the chromatin conformation of the chromosomal region. Our results suggest that chromatin domains may restrict the location of OBP genes to regions having the appropriate transcriptional environment, leading to the OBP cluster structure. However, the appropriate transcriptional environment for OBP and the other neighbor genes is not dominated by reduced levels of expression noise. Indeed, the stochastic fluctuations in the OBP transcript abundance may have a critical role in the combinatorial nature of the olfactory coding process.

Consequences of lineage-specific gene loss on functional evolution of surviving paralogs: ALDH1A and retinoic acid signaling in vertebrate genomes

Genome duplications increase genetic diversity and may facilitate the evolution of gene subfunctions. Little attention, however, has focused on the evolutionary impact of lineage-specific gene loss. Here, we show that identifying lineage-specific gene loss after genome duplication is important for understanding the evolution of gene subfunctions in surviving paralogs and for improving functional connectivity among human and model organism genomes. We examine the general principles of gene loss following duplication, coupled with expression analysis of the retinaldehyde dehydrogenase Aldh1a gene family during retinoic acid signaling in eye development as a case study. Humans have three ALDH1A genes, but teleosts have just one or two. We used comparative genomics and conserved syntenies to identify loss of ohnologs (paralogs derived from genome duplication) and to clarify uncertain phylogenies. Analysis showed that Aldh1a1 and Aldh1a2 form a clade that is sister to Aldh1a3-related genes. Genome comparisons showed secondarily loss of aldh1a1 in teleosts, revealing that Aldh1a1 is not a tetrapod innovation and that aldh1a3 was recently lost in medaka, making it the first known vertebrate with a single aldh1a gene. Interestingly, results revealed asymmetric distribution of surviving ohnologs between co-orthologous teleost chromosome segments, suggesting that local genome architecture can influence ohnolog survival. We propose a model that reconstructs the chromosomal history of the Aldh1a family in the ancestral vertebrate genome, coupled with the evolution of gene functions in surviving Aldh1a ohnologs after R1, R2, and R3 genome duplications. Results provide evidence for early subfunctionalization and late subfunction-partitioning and suggest a mechanistic model based on altered regulation leading to heterochronic gene expression to explain the acquisition or modification of subfunctions by surviving ohnologs that preserve unaltered ancestral developmental programs in the face of gene loss.

A Multi-state model for the analysis of functional decline and mortality of frail elderly patients

L’objectiu d’aquest estudi, que correspon a un projecte de recerca sobre la pèrdua funcional i la mortalitat de persones grans fràgils, és construir un procés de supervivència predictiu que tingui en compte l’evolució funcional i nutricional dels pacients al llarg del temps. En aquest estudi ens enfrontem a l’anàlisi de dades de supervivència i mesures repetides però els mètodes estadístics habituals per al tractament conjunt d’aquest tipus de dades no són apropiats en aquest cas. Com a alternativa utilitzem els models de supervivència multi-estats per avaluar l’associació entre mortalitat i recuperació, o no, dels nivells funcionals i nutricionals considerats normals. Després d’estimar el model i d’identificar els factors pronòstics de mortalitat és possible obtenir un procés predictiu que permet fer prediccions de la supervivència dels pacients en funció de la seva història concreta fins a un determinat moment. Això permet realitzar un pronòstic més precís de cada grup de pacients, la qual cosa pot ser molt útil per als professionals sanitaris a l’hora de prendre decisions clíniques.

RADIC II: a fault tolerant architecture with flexible dynamic redundancy

The demand for computational power has been leading the improvement of the High Performance Computing (HPC) area, generally represented by the use of distributed systems like clusters of computers running parallel applications. In this area, fault tolerance plays an important role in order to provide high availability isolating the application from the faults effects. Performance and availability form an undissociable binomial for some kind of applications. Therefore, the fault tolerant solutions must take into consideration these two constraints when it has been designed. In this dissertation, we present a few side-effects that some fault tolerant solutions may presents when recovering a failed process. These effects may causes degradation of the system, affecting mainly the overall performance and availability. We introduce RADIC-II, a fault tolerant architecture for message passing based on RADIC (Redundant Array of Distributed Independent Fault Tolerance Controllers) architecture. RADIC-II keeps as maximum as possible the RADIC features of transparency, decentralization, flexibility and scalability, incorporating a flexible dynamic redundancy feature, allowing to mitigate or to avoid some recovery side-effects.

System analysis of a Peer-to-Peer Video-on-Demand architecture: Kangaroo

Architectural design and deployment of Peer-to-Peer Video-on-Demand (P2PVoD) systems which support VCR functionalities is attracting the interest of an increasing number of research groups within the scientific community; especially due to the intrinsic characteristics of such systems and the benefits that peers could provide at reducing the server load. This work focuses on the performance analysis of a P2P-VoD system considering user behaviors obtained from real traces together with other synthetic user patterns. The experiments performed show that it is feasible to achieve a performance close to the best possible. Future work will consider monitoring the physical characteristics of the network in order to improve the design of different aspects of a VoD system.

A functional equation related to the product in a quadratic number field

"Vegeu el resum a l'inici del document del fitxer adjunt."

Refined asymptotics for the subcritical Keller-Segel system and related functional inequalities

We analyze the rate of convergence towards self-similarity for the subcritical Keller-Segel system in the radially symmetric two-dimensional case and in the corresponding one-dimensional case for logarithmic interaction. We measure convergence in Wasserstein distance. The rate of convergence towards self-similarity does not degenerate as we approach the critical case. As a byproduct, we obtain a proof of the logarithmic Hardy-Littlewood-Sobolev inequality in the one dimensional and radially symmetric two dimensional case based on optimal transport arguments. In addition we prove that the onedimensional equation is a contraction with respect to Fourier distance in the subcritical case.

Genomics of wine yeast: functional analysis of new and variable genes

Projecte de recerca elaborat a partir d’una estada a l’Institut National de la Recherche Agronomique, França, entre 2007 i 2009. Saccharomyces cerevisiae ha estat el llevat utilitzat durant mil.lenis en l'elaboració de vins. Tot i així, es té poc coneixement sobre les pressions de selecció que han actuat en la modelització del genoma dels llevats vínics. S’ha seqüenciat el genoma d'una soca vínica comercial, EC1118, obtenint 31 supercontigs que cobreixen el 97% del genoma de la soca de referència, S288c. S’ha trobat que el genoma de la soca vínica es diferencia bàsicament en la possessió de 3 regions úniques que contenen 34 gens implicats en funcions claus per al procés fermentatiu. A banda, s’han dut a terme estudis de filogènia i synteny (ordre dels gens) que mostren que una d'aquestes tres regions és pròxima a una espècie relacionada amb el gènere Saccharomyces, mentre que les altres dos regions tenen un origen no-Saccharomyces. S’ha identificat mitjançant PCR i seqüenciació a Zygosaccharomyces bailii, una espècie contaminant de les fermentacions víniques, com a espècie donadora d'una de les dues regions. Les hibridacions naturals entre soques de diferents espècies dins del grup Saccharomyces sensu stricto ja han estat descrites. El treball és el primer que presenta hibridacions entre espècies Saccharomyces i no-Saccharomyces (Z. bailii, en aquest cas). També s’assenyala que les noves regions es troben freqüent i diferencialment presents entre els clades de S. cerevisiae, trobant-se de manera gairebé exclusiva en el grup de les soques víniques, suggerint que es tracta d'una adquisició recent de transferència gènica. En general, les dades demostren que el genoma de les soques víniques pateix una constant remodelació mitjançant l'adquisició de gens exògens. Els resultats suggereixen que aquests processos estan afavorits per la proximitat ecològica i estan implicats en l'adaptació molecular de les soques víniques a les condicions d'elevada concentració en sucres, poc nitrogen i elevades concentracions en etanol.

Anàlisi, disseny i implementació d'una aplicació B2B.

Aquest projecte es una mostra de les diferents etapes que es necessiten per desenvolupar una aplicació feta en arquitectura J2EE. Els requeriments funcional que he decidit implementar són bàsics dintre d'una botiga virtual.

Generador de Comunitats Virtuals

La Diputació de Barcelona planteja la possibilitat de fer un projecte per a generar comunitats virtuals (GCV), definit en diversos mòduls. L'abast del projecte i l'anàlisi funcional general s'especifica en el document Anàlisi funcional del GCV. En aquest informe es presenta el disseny i la construcció del projecte respecte al mòdul 'Fòrum' i el mòdul 'Notícies'. Com a llenguatge de desenvolupament, s'ha fet servir Java amb l'arquitectura J2EE. En l'apartat de disseny arquitectònic s'especifiquen les eines emprades amb més detall.

Anàlisi, disseny i implementació d'una aplicació fent servir l'arquitectura J2EE

Aplicació basada en l'arquitectura J2EE. Amb la utilització del framework Struts 2, s'ha desenvolupat una aplicació web tenint com a base el patró Model - Vista - Controlador. Es detallen les diferents fases (estudi inicial, anàlisi funcional, disseny i implementació) per tal de realitzar el projecte: 'Accés i consulta de la informació relacionada amb un centre mèdic'.

VLSI architecture for an Underwater Robot Vision System

It is well known that image processing requires a huge amount of computation, mainly at low level processing where the algorithms are dealing with a great number of data-pixel. One of the solutions to estimate motions involves detection of the correspondences between two images. For normalised correlation criteria, previous experiments shown that the result is not altered in presence of nonuniform illumination. Usually, hardware for motion estimation has been limited to simple correlation criteria. The main goal of this paper is to propose a VLSI architecture for motion estimation using a matching criteria more complex than Sum of Absolute Differences (SAD) criteria. Today hardware devices provide many facilities for the integration of more and more complex designs as well as the possibility to easily communicate with general purpose processors

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

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

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more