Estudi de la reformació amb vapor de biocombustibles per a l'obtenció d'hidrogen utilitzant suports estructurats ceràmics funcionalitzats

Donada una aplicació racional en una varietat complexa, Bellon i Viallet van definit l’entropia algebraica d’aquesta aplicació i van provar que aquest valor és un invariant biracional. Un invariant biracional equivalent és el grau asimptòtic, grau dinàmic o complexitat, definit per Boukraa i Maillard. Aquesta noció és propera a la complexitat definida per Arnold. Conjecturalment, el grau asimptòtic satisfà una recurrència lineal amb coeficients enters. Aquesta conjectura ha estat provada en el cas polinòmic en el pla afí complex per Favre i Jonsson i resta oberta en per al cas projectiu global i per al cas local. L’estudi de l’arbre valoratiu de Favre i Jonsson ha resultat clau per resoldre la conjectura en el cas polinòmic en el pla afí complex. El beneficiari ha estudiat l’arbre valoratiu global de Favre i Jonsson i ha reinterpretat algunes nocions i resultats des d’un punt de vista més geomètric. Així mateix, ha estudiat la demostració de la conjectura de Bellon – Viallet en el cas polinòmic en el pla afí complex com a primer pas per trobar una demostració en el cas local i projectiu global en estudis futurs. El projecte inclou un estudi detallat de l'arbre valoratiu global des d'un punt de vista geomètric i els primers passos de la demostració de la conjectura de Bellon - Viallet en el cas polinòmic en el pla afí complex que van efectuar Favre i Jonsson.

Aspectes geomètrics i dinàmics de transformacions racionals planes

Donada una aplicació racional en una varietat complexa, Bellon i Viallet van definit l’entropia algebraica d’aquesta aplicació i van provar que aquest valor és un invariant biracional. Un invariant biracional equivalent és el grau asimptòtic, grau dinàmic o complexitat, definit per Boukraa i Maillard. Aquesta noció és propera a la complexitat definida per Arnold. Conjecturalment, el grau asimptòtic satisfà una recurrència lineal amb coeficients enters. Aquesta conjectura ha estat provada en el cas polinòmic en el pla afí complex per Favre i Jonsson i resta oberta en per al cas projectiu global i per al cas local. L’estudi de l’arbre valoratiu de Favre i Jonsson ha resultat clau per resoldre la conjectura en el cas polinòmic en el pla afí complex. El beneficiari ha estudiat l’arbre valoratiu global de Favre i Jonsson i ha reinterpretat algunes nocions i resultats des d’un punt de vista més geomètric. Així mateix, ha estudiat la demostració de la conjectura de Bellon – Viallet en el cas polinòmic en el pla afí complex com a primer pas per trobar una demostració en el cas local i projectiu global en estudis futurs. El projecte inclou un estudi detallat de l'arbre valoratiu global des d'un punt de vista geomètric i els primers passos de la demostració de la conjectura de Bellon - Viallet en el cas polinòmic en el pla afí complex que van efectuar Favre i Jonsson.

Noeuds idéaux et noeuds réels.

La recherche de représentations idéales de noeuds conduit à la définition de nouveaux invariants, utiles à l'étude des noeuds dans les polymères

The eta invariant and equivariant index of transversally elliptic operators

We prove a formula for the multiplicities of the index of an equivariant transversally elliptic operator on a G-manifold. The formula is a sum of integrals over blowups of the strata of the group action and also involves eta invariants of associated elliptic operators. Among the applications, we obtain an index formula for basic Dirac operators on Riemannian foliations, a problem that was open for many years.

Index theory for basic Dirac operators on Riemannian foliations

In this paper we prove a formula for the analytic index of a basic Dirac-type operator on a Riemannian foliation, solving a problem that has been open for many years. We also consider more general indices given by twisting the basic Dirac operator by a representation of the orthogonal group. The formula is a sum of integrals over blowups of the strata of the foliation and also involves eta invariants of associated elliptic operators. As a special case, a Gauss-Bonnet formula for the basic Euler characteristic is obtained using two independent proofs.

Improving the accuracy of heat balance integral methods applied to thermal problems with time dependent boundary conditions

In this paper the two main drawbacks of the heat balance integral methods are examined. Firstly we investigate the choice of approximating function. For a standard polynomial form it is shown that combining the Heat Balance and Refined Integral methods to determine the power of the highest order term will either lead to the same, or more often, greatly improved accuracy on standard methods. Secondly we examine thermal problems with a time-dependent boundary condition. In doing so we develop a logarithmic approximating function. This new function allows us to model moving peaks in the temperature profile, a feature that previous heat balance methods cannot capture. If the boundary temperature varies so that at some time t & 0 it equals the far-field temperature, then standard methods predict that the temperature is everywhere at this constant value. The new method predicts the correct behaviour. It is also shown that this function provides even more accurate results, when coupled with the new CIM, than the polynomial profile. Analysis primarily focuses on a specified constant boundary temperature and is then extended to constant flux, Newton cooling and time dependent boundary conditions.

Strong isomorphism reductions in complexity theory

We give the first systematic study of strong isomorphism reductions, a notion of reduction more appropriate than polynomial time reduction when, for example, comparing the computational complexity of the isomorphim problem for different classes of structures. We show that the partial ordering of its degrees is quite rich. We analyze its relationship to a further type of reduction between classes of structures based on purely comparing for every n the number of nonisomorphic structures of cardinality at most n in both classes. Furthermore, in a more general setting we address the question of the existence of a maximal element in the partial ordering of the degrees.

Consistency and optimality

Assume that the problem Qo is not solvable in polynomial time. For theories T containing a sufficiently rich part of true arithmetic we characterize T U {ConT} as the minimal extension of T proving for some algorithm that it decides Qo as fast as any algorithm B with the property that T proves that B decides Qo. Here, ConT claims the consistency of T. Moreover, we characterize problems with an optimal algorithm in terms of arithmetical theories.

Computing hypergraph width measures exactly

Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A connection between these and tree decompositions is established. This enables us to almost seamlessly adapt the combinatorial and algorithmic results known for tree decompositions of graphs to the case of hypergraphs and obtain fast exact algorithms. As a consequence, we provide algorithms which, given a hypergraph H on n vertices and m hyperedges, compute the generalized hypertree-width of H in time O*(2n) and compute the fractional hypertree-width of H in time O(1.734601n.m).1

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs

In a seminal paper [10], Weitz gave a deterministic fully polynomial approximation scheme for counting exponentially weighted independent sets (which is the same as approximating the partition function of the hard-core model from statistical physics) in graphs of degree at most d, up to the critical activity for the uniqueness of the Gibbs measure on the innite d-regular tree. ore recently Sly [8] (see also [1]) showed that this is optimal in the sense that if here is an FPRAS for the hard-core partition function on graphs of maximum egree d for activities larger than the critical activity on the innite d-regular ree then NP = RP. In this paper we extend Weitz's approach to derive a deterministic fully polynomial approximation scheme for the partition function of general two-state anti-ferromagnetic spin systems on graphs of maximum degree d, up to the corresponding critical point on the d-regular tree. The main ingredient of our result is a proof that for two-state anti-ferromagnetic spin systems on the d-regular tree, weak spatial mixing implies strong spatial mixing. his in turn uses a message-decay argument which extends a similar approach proposed recently for the hard-core model by Restrepo et al [7] to the case of general two-state anti-ferromagnetic spin systems.

Desenvolupament de codis numèrics per a la resolució de fluxos turbulents en ordinadors paral·lels emprant discretitzacions tipus symmetry-preserving

Projecte de recerca elaborat a partir d’una estada a la University of Groningen, Holanda, entre 2007 i 2009. La simulació directa de la turbulència (DNS) és una eina clau dins de la mecànica de fluids computacional. Per una banda permet conèixer millor la física de la turbulència i per l'altra els resultats obtinguts són claus per el desenvolupament dels models de turbulència. No obstant, el DNS no és una tècnica vàlida per a la gran majoria d'aplicacions industrials degut al elevats costos computacionals. Per tant, és necessari cert grau de modelització de la turbulència. En aquest context, s'han introduïts importants millores basades en la modelització del terme convectiu (no lineal) emprant symmetry-preserving regularizations. En tracta de modificar adequadament el terme convectiu a fi de reduir la producció d'escales més i més petites (vortex-stretching) tot mantenint tots els invariants de les equacions originals. Fins ara, aquest models s'han emprat amb èxit per nombres de Rayleigh (Ra) relativament elevats. En aquest punt, disposar de resultats DNS per a configuracions més complexes i nombres de Ra més elevats és clau. En aquest contexte, s'han dut a terme simulacions DNS en el supercomputador MareNostrum d'una Differentially Heated Cavity amb Ra=1e11 i Pr=0.71 durant el primer any dels dos que consta el projecte. A més a més, s'ha adaptat el codi a fi de poder simular el fluxe al voltant d'un cub sobre una pared amb Re=10000. Aquestes simulacions DNS són les més grans fetes fins ara per aquestes configuracions i la seva correcta modelització és un gran repte degut la complexitat dels fluxes. Aquestes noves simulacions DNS estan aportant nous coneixements a la física de la turbulència i aportant resultats indispensables per al progrés de les modelitzacións tipus symmetry-preserving regularization.

Impact of normalization on miRNA microarray expression profiling.

Profiling miRNA levels in cells with miRNA microarrays is becoming a widely used technique. Although normalization methods for mRNA gene expression arrays are well established, miRNA array normalization has so far not been investigated in detail. In this study we investigate the impact of normalization on data generated with the Agilent miRNA array platform. We have developed a method to select nonchanging miRNAs (invariants) and use them to compute linear regression normalization coefficients or variance stabilizing normalization (VSN) parameters. We compared the invariants normalization to normalization by scaling, quantile, and VSN with default parameters as well as to no normalization using samples with strong differential expression of miRNAs (heart-brain comparison) and samples where only a few miRNAs are affected (by p53 overexpression in squamous carcinoma cells versus control). All normalization methods performed better than no normalization. Normalization procedures based on the set of invariants and quantile were the most robust over all experimental conditions tested. Our method of invariant selection and normalization is not limited to Agilent miRNA arrays and can be applied to other data sets including those from one color miRNA microarray platforms, focused gene expression arrays, and gene expression analysis using quantitative PCR.

Refacció d'Ontologies : creació d'un plugin per a Protégé

El projecte centra els seus esforços en la darrera activitat: el refactoring d'ontologies. En concret, les expressades en OWL, el llenguatge per a ontologies pensat pel W3C. El resultat final del projecte ha estat la implementació en Java d'un plugin per a Protégé que permet l'execució d'operacions de refactoring sobre ontologies OWL. Part principal del plugin és un framework que ofereix el marc d'execució per a les operacions implementades i permet incorporar noves operacions sense haver-lo de modificar.

Publication trends of shared decision making in 15 high impact medical journals: a full-text review with bibliometric analysis.

BACKGROUND: Shared Decision Making (SDM) is increasingly advocated as a model for medical decision making. However, there is still low use of SDM in clinical practice. High impact factor journals might represent an efficient way for its dissemination. We aimed to identify and characterize publication trends of SDM in 15 high impact medical journals. METHODS: We selected the 15 general and internal medicine journals with the highest impact factor publishing original articles, letters and editorials. We retrieved publications from 1996 to 2011 through the full-text search function on each journal website and abstracted bibliometric data. We included publications of any type containing the phrase "shared decision making" or five other variants in their abstract or full text. These were referred to as SDM publications. A polynomial Poisson regression model with logarithmic link function was used to assess the evolution across the period of the number of SDM publications according to publication characteristics. RESULTS: We identified 1285 SDM publications out of 229,179 publications in 15 journals from 1996 to 2011. The absolute number of SDM publications by journal ranged from 2 to 273 over 16 years. SDM publications increased both in absolute and relative numbers per year, from 46 (0.32% relative to all publications from the 15 journals) in 1996 to 165 (1.17%) in 2011. This growth was exponential (P < 0.01). We found fewer research publications (465, 36.2% of all SDM publications) than non-research publications, which included non-systematic reviews, letters, and editorials. The increase of research publications across time was linear. Full-text search retrieved ten times more SDM publications than a similar PubMed search (1285 vs. 119 respectively). CONCLUSION: This review in full-text showed that SDM publications increased exponentially in major medical journals from 1996 to 2011. This growth might reflect an increased dissemination of the SDM concept to the medical community.

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced