Parallelization of whole genome alignment

With the advent of High performance computing, it is now possible to achieve orders of magnitude performance and computation e ciency gains over conventional computer architectures. This thesis explores the potential of using high performance computing to accelerate whole genome alignment. A parallel technique is applied to an algorithm for whole genome alignment, this technique is explained and some experiments were carried out to test it. This technique is based in a fair usage of the available resource to execute genome alignment and how this can be used in HPC clusters. This work is a rst approximation to whole genome alignment and it shows the advantages of parallelism and some of the drawbacks that our technique has. This work describes the resource limitations of current WGA applications when dealing with large quantities of sequences. It proposes a parallel heuristic to distribute the load and to assure that alignment quality is mantained.

Speculative parallelization of multipath radiosity algorithm

In computer graphics, global illumination algorithms take into account not only the light that comes directly from the sources, but also the light interreflections. This kind of algorithms produce very realistic images, but at a high computational cost, especially when dealing with complex environments. Parallel computation has been successfully applied to such algorithms in order to make it possible to compute highly-realistic images in a reasonable time. We introduce here a speculation-based parallel solution for a global illumination algorithm in the context of radiosity, in which we have taken advantage of the hierarchical nature of such an algorithm

Deriving the hard thermal loops of QCD from classical transport theory

Classical transport theory is employed to analyze the hot quark-gluon plasma at the leading order in the coupling constant. A condition on the (covariantly conserved) color current is obtained. From this condition, the generating functional of hard thermal loops with an arbitrary number of soft external bosonic legs can be derived. Our approach, besides being more direct than alternative ones, shows that hard thermal loops are essentially classical.

Symmetric periodic orbits near heteroclinic loops at infinity for a class of polynomial vector fields

For polynomial vector fields in R3, in general, it is very difficult to detect the existence of an open set of periodic orbits in their phase portraits. Here, we characterize a class of polynomial vector fields of arbitrary even degree having an open set of periodic orbits. The main two tools for proving this result are, first, the existence in the phase portrait of a symmetry with respect to a plane and, second, the existence of two symmetric heteroclinic loops.

Exact results for Wilson loops in arbitrary representations

We compute the exact vacuum expectation value of 1/2 BPS circular Wilson loops of TeX = 4 U(N) super Yang-Mills in arbitrary irreducible representations. By localization arguments, the computation reduces to evaluating certain integrals in a Gaussian matrix model, which we do using the method of orthogonal polynomials. Our results are particularly simple for Wilson loops in antisymmetric representations; in this case, we observe that the final answers admit an expansion where the coefficients are positive integers, and can be written in terms of sums over skew Young diagrams. As an application of our results, we use them to discuss the exact Bremsstrahlung functions associated to the corresponding heavy probes.

Shifted loops and coercivity from field imprinted high energy barriers in ferritin and ferrihydrite nanoparticles

We show that the coercive field in ferritin and ferrihydrite depends on the maximum magnetic field in a hysteresis loop and that coercivity and loop shifts depend both on the maximum and cooling fields. In the case of ferritin, we show that the time dependence of the magnetization also depends on the maximum and previous cooling fields. This behavior is associated to changes in the intraparticle energy barriers imprinted by these fields. Accordingly, the dependence of the coercive and loop-shift fields with the maximum field in ferritin and ferrihydrite can be described within the frame of a uniform-rotation model considering a dependence of the energy barrier with the maximum and the cooling fields.

Solution equilibria of cytosine- and guanine-rich sequences near the promoter region of the n-myc gene that contain stable hairpins within lateral loops

Cytosine-and guanine-rich regions of DNA are capable of forming complex structures named i-motifs and G-quadruplexes, respectively. In the present study the solution equilibria at nearly physiological conditions of a 34 -bases long cytosine-rich sequence and its complementary guanin e-rich strand corresponding to the first intron of the n-mycgene were studied. Both sequences , not yet studied, contain a 12 - base tract capable of forming stable hairpins inside the i-motif and G-quadruplex structures, respectively ...

Free and fragmenting filling length

The filling length of an edge-circuit η in the Cayley 2-complex of a finite presentation of a group is the minimal integer length L such that there is a combinatorial null-homotopy of η down to a base point through loops of length at most L. We introduce similar notions in which the full-homotopy is not required to fix a base point, and in which the contracting loop is allowed to bifurcate. We exhibit a group in which the resulting filling invariants exhibit dramatically different behaviour to the standard notion of filling length. We also define the corresponding filling invariants for Riemannian manifolds and translate our results to this setting.

A note on parallelizing the parameterized expectations algorithm

The parameterized expectations algorithm (PEA) involves a long simulation and a nonlinear least squares (NLS) fit, both embedded in a loop. Both steps are natural candidates for parallelization. This note shows that parallelization can lead to important speedups for the PEA. I provide example code for a simple model that can serve as a template for parallelization of more interesting models, as well as a download link for an image of a bootable CD that allows creation of a cluster and execution of the example code in minutes, with no need to install any software.

User-friendly parallel computations with econometric examples

This paper shows how a high level matrix programming language may be used to perform Monte Carlo simulation, bootstrapping, estimation by maximum likelihood and GMM, and kernel regression in parallel on symmetric multiprocessor computers or clusters of workstations. The implementation of parallelization is done in a way such that an investigator may use the programs without any knowledge of parallel programming. A bootable CD that allows rapid creation of a cluster for parallel computing is introduced. Examples show that parallelization can lead to important reductions in computational time. Detailed discussion of how the Monte Carlo problem was parallelized is included as an example for learning to write parallel programs for Octave.

Solució paral·lelitzada d'interpolació kriging amb ajust automatitzat del variograma

El principal objectiu d'aquest treball és proporcionar una metodologia per a reduir el temps de càlcul del mètode d'interpolació kriging sense pèrdua de la qualitat del model resultat. La solució adoptada ha estat la paral·lelització de l'algorisme mitjançant MPI sobre llenguatge C. Prèviament ha estat necessari automatitzar l'ajust del variograma que millor s'adapta a la distribució espacial de la variable d'estudi. Els resultats experimentals demostren la validesa de la solució implementada, en reduir de forma significativa els temps d'execució final de tot el procés.

Desarrollo y aplicación de estrategias de control avanzado en procesos biológicos de tratamiento de efluentes contaminados

En este proyecto se ha desarrollado estrategias de control avanzadas para plantas de depuración de aguas residuales urbanas que eliminan conjuntamente materia orgánica, nitrógeno y fósforo. Las estrategias se han basado en el estudio multivariable del comportamiento del sistema, que ha producido subsidios para la utilización de lazos de control feedforward, de control predictivo y de un control de costes que automáticamente enviaba las consignas más adecuadas para los controladores de proceso. Para el desarrollo de las estrategias, se ha creado un sistema virtual de simulación (simulador) de plantas de depuradoras, basado en datos de literatura. Para el caso de una planta real, se ha desarrollado un simulador de la planta de Manresa (Catalunya). Sin embargo, el sistema de Manresa se ha utilizado exclusivamente para auxiliar los ingenieros de la planta en la tomada de decisiones de cambio de configuración para que la eliminación de fósforo se dé por la ruta biológica y no por la ruta química. La implementación de los simuladores ha permitido hacer muchas pruebas que en una planta real demandarían mucho tiempo y consumirían muchos recursos energéticos y financieros. Las estrategias de control más elaboradas han podido ahorrar hasta 150.000,00 Euros por año en relación a la operación de la planta sin el control automático. Cuanto a los estudios del modelo de la planta real, se concluyó que la eliminación biológica de fósforo puede sustituir el actual proceso químico de eliminación de fósforo, bajando los costes operacionales (costes del agente precipitante).

Estudi GPGPU dedicat al processament de neuroimatges

La tecnologia GPGPU permet paral∙lelitzar càlculs executant operacions aritmètiques en els múltiples processadors de que disposen els xips gràfics. S'ha fet servir l'entorn de desenvolupament CUDA de la companyia NVIDIA, que actualment és la solució GPGPU més avançada del mercat. L'algorisme de neuroimatge implementat pertany a un estudi VBM desenvolupat amb l'eina SPM. Es tracta concretament del procés de segmentació d'imatges de ressonància magnètica cerebrals, en els diferents teixits dels quals es composa el cervell: matèria blanca, matèria grisa i líquid cefaloraquidi. S'han implementat models en els llenguatges Matlab, C i CUDA, i s'ha fet un estudi comparatiu per plataformes hardware diferents.

Linkages of dietary patterns, international trade and land use: the case of olive oil in the European Union

Within only two decades olive oil developed from a niche product which could hardly be found in food stores outside the producing regions towards an integrated component in the diets of industrial countries. This paper discusses the impacts of the promotion of the “healthy Mediterranean diet” on land use and agro-ecosystems in the producing countries. It examines the dynamics of olive oil production, trade and consumption in the EU15 in the period 1972 to 2003 and the links between dietary patterns, trade and land use. It analyses the underlying socio-economic driving forces behind the increasing spatial disconnect between production and consumption of olive oil in the EU15 and in particular in Spain, the world largest producer during the last three decades. In the observed period olive oil consumption increased 16 fold in the non-producing EU15 countries. In the geographically limited producing regions like Spain, the 5 fold increase in export production was associated with the rapid industrialization of olive production, the conversion of vast Mediterranean landscapes to olive monocultures and a range of environmental pressures. High amounts of subsidies of the European Common Agricultural Policy and feedback loops within production and consumption systems were driving the transformation of the olive oil system. Our analysis indicates the process of change was not immediately driven by increases in demand for olive oil in non-producing countries, but rather by the institutional setting of the European Union and by concerted political interventions.

Estudi de comparació de rendiment de Benchmark multicore i multithreading amb OpenMP 2.5 i OpenMP 3.0

Estudi comparatiu amb benchmark del rendiment en dues plataformes multicore multithreading de diferents modalitats de paral·lelització de multiplicacions de matrius de nombres enters i de nombres en coma flotant mitjançant el model de memòria compartida OpenMP versió 2.5 i OpenMP versió 3.0.