Search results for " Parallel"
showing 10 items of 224 documents
MetaCache-GPU: Ultra-Fast Metagenomic Classification
2021
The cost of DNA sequencing has dropped exponentially over the past decade, making genomic data accessible to a growing number of scientists. In bioinformatics, localization of short DNA sequences (reads) within large genomic sequences is commonly facilitated by constructing index data structures which allow for efficient querying of substrings. Recent metagenomic classification pipelines annotate reads with taxonomic labels by analyzing their $k$-mer histograms with respect to a reference genome database. CPU-based index construction is often performed in a preprocessing phase due to the relatively high cost of building irregular data structures such as hash maps. However, the rapidly growi…
Dendrochemical assessment of mercury releases from a pond and dredged-sediment landfill impacted by a chlor-alkali plant.
2016
International audience; Although current Hg emissions from industrial activities may be accurately monitored, evidence of past releases to the atmosphere must rely on one or more environmental proxies. We used Hg concentrations in tree cores collected from poplars and willows to investigate the historical changes of Hg emissions from a dredged sediment landfill and compared them to a nearby control location. Our results demonstrated the potential value of using dendrochemistry to record historical Hg emissions from past industrial activities.
SIMULATING SPIN MODELS ON GPU: A TOUR
2012
The use of graphics processing units (GPUs) in scientific computing has gathered considerable momentum in the past five years. While GPUs in general promise high performance and excellent performance per Watt ratios, not every class of problems is equally well suitable for exploiting the massively parallel architecture they provide. Lattice spin models appear to be prototypic examples of problems suitable for this architecture, at least as long as local update algorithms are employed. In this review, I summarize our recent experience with the simulation of a wide range of spin models on GPU employing an equally wide range of update algorithms, ranging from Metropolis and heat bath updates,…
Advances in the enumeration of foldable self-avoiding walks
2020
<font color="#336633">Self-avoiding walks (SAWs) have been studied for a long time due to their intrinsic importance and the many application fields in which they operate. A new subset of SAWs, called foldable SAWs, has recently been discovered when investigating two different SAW manipulations embedded within existing protein structure prediction (PSP) software. Since then, several attempts have been made to find out more about these walks, including counting them. However, calculating the number of foldable SAWs appeared as a tough work, and current supercomputers fail to count foldable SAWs of length exceeding ≈ 30 steps. In this article, we present new progress in this enumeration, bo…
Rodrigo de Mendoza, I Marqués del Cenete y I Conde del Cid: paralelismos entre su biografía y su pretendida genealogía = Rodrigo de Mendoza, First Ma…
2018
El Gran Cardenal de España quiso, al legitimar a sus hijos nacidos de sendas relaciones ilícitas, consolidarlos como miembros de la nobleza castellana. Así fue, por ejemplo, con su primogénito Rodrigo, I marqués del Cenete y I conde del Cid, emparentado por voluntad paterna con Rodrigo Díaz de Vivar, el Cid Campeador. Al apropiarse de esta ficticia genealogía, el prelado dotaba al mayorazgo legado a éste de un simbolismo que, a medida que el marqués fue madurando y curtiéndose en las guerras de Granada, las campañas italianas y las Germanías de Valencia, cobraba mayor verosimilitud a través de sus actos y acciones. El objeto de este trabajo es aproximarnos al perfil biográfico de Rodrigo de…
An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph
2001
International audience; In this article we characterize bipartite graphs whose associated neighborhood hypergraphs have the Helly property. We examine incidence graphs both hypergraphs and linear hypergraphs and we give a polynomial algorithm to recognize if a linear hypergraph has the Helly property.
Numerical simulation of unsteady MHD flows and applications
2009
International audience; We present a robust numerical method for solving the compressible Ideal Magneto-Hydrodynamic equations. It is based on the Residual Distribution (RD) algorithms already successfully tested in many problems. We adapted the scheme to the multi-dimensional unsteady MHD model. The constraint ∇ · B = 0 is enforced by the use a Generalized Lagrange Multiplier (GLM) technique. First, we present this complete system and the keys to get its eigensystem, as we may need it in the algorithm. Next, we introduce the numerical scheme built in order to get a compressible, unsteady and implicit solver which has good shock-capturing properties and is second-order accurate at the conve…
"Table 8" of "Inclusive production of neutral vector mesons in hadronic Z decays"
1995
Average multiplicity per hadronic event. Extrapolation to the full X range.
"Table 2" of "Inclusive production of neutral vector mesons in hadronic Z decays"
1995
Average multiplicity per hadronic event. Extrapolation to the full X range.
"Table 1" of "Production of charged pions, kaons and protons at large transverse momenta in pp and Pb-Pb collisions at sqrt(sNN) = 2.76 TeV"
2014
Invariant yields of identified pions in central and peripheral Pb-Pb collisions, together with the unscaled pp reference yields.