Browse
Submit Data
Databases
API
Help

Dataset Information

46 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Speeding up MadGraph5_aMC@NLO.

ABSTRACT: In this paper we will describe two new optimisations implemented in MadGraph5_aMC@NLO, both of which are designed to speed-up the computation of leading-order processes (for any model). First we implement a new method to evaluate the squared matrix element, dubbed helicity recycling, which results in factor of two speed-up. Second, we have modified the multi-channel handling of the phase-space integrator providing tremendous speed-up for VBF-like processes (up to thousands times faster).

Supplementary information

The online version contains supplementary material available at 10.1140/epjc/s10052-021-09204-7.

SUBMITTER: Mattelaer O

PROVIDER: S-EPMC8136271 | biostudies-literature | 2021

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Speeding up MadGraph5_aMC@NLO.

Mattelaer O O Ostrolenk K K

The European physical journal. C, Particles and fields 20210520 5

In this paper we will describe two new optimisations implemented in MadGraph5_aMC@NLO, both of which are designed to speed-up the computation of leading-order processes (for any model). First we implement a new method to evaluate the squared matrix element, dubbed helicity recycling, which results in factor of two speed-up. Second, we have modified the multi-channel handling of the phase-space integrator providing tremendous speed-up for VBF-like processes (up to thousands times faster).<h4>Supp ...[more]

PMID: 34035657

Similar Datasets

Speeding Up Gait in Parkinson's Disease.

Project description:BackgroundGait speed is an important outcome that relates to mobility, function, and mortality, and is altered in people with Parkinson's disease (PwPD). However, changes in gait speed may not reflect changes in other important aspects of gait.ObjectiveTo characterize which outcomes change concomitantly with walking speed in PwPD. This information can inform the choice of outcome variables for characterizing and tracking gait performance in this population.Methods67 PwPD and 40 neurotypical adults completed 2-minute overground walking bouts at comfortable and fast self-selected speeds. Eight inertial sensors were used to characterize gait and turning. We identified a subset of participants (38 per group) where the PD participant's "fast" walk was similar speed to neurotypical participants "comfortable" walk, facilitating an across-group gait comparison controlling for gait speed.ResultsWalking at fast gait speed compared to comfortable lead to significant changes in stride length, cadence, and stride time variability, but not in steps to turn, trunk ROM, and trunk and lumbar stability in PwPD. Sub-group analyses showed that despite walking at a similar speed as neurotypical adults, PwPD exhibit altered turning outcomes, lumbar stability, and stride length/cadence.ConclusionsGait speed is a critical outcome for characterizing mobility. However, in PwPD, several important outcomes do not exhibit a uniform relationship with gait speed, and remain altered compared to neurotypical adults despite "normalizing" walking speed. Given the complex relationship between gait speed and other gait quality measures, care should be taken when choosing outcome measures to characterize the breadth of gait abnormality in PwPD.

| S-EPMC7304052 | biostudies-literature

Speeding up research with the Semantic Web

Project description: Not available

| S-EPMC3504542 | biostudies-literature

Speeding up biomolecular interactions by molecular sledding.

Project description:Numerous biological processes involve association of a protein with its binding partner, an event that is preceded by a diffusion-mediated search bringing the two partners together. Often hindered by crowding in biologically relevant environments, three-dimensional diffusion can be slow and result in long bimolecular association times. Similarly, the initial association step between two binding partners often represents a rate-limiting step in biotechnologically relevant reactions. We demonstrate the practical use of an 11-a.a. DNA-interacting peptide derived from adenovirus to reduce the dimensionality of diffusional search processes and speed up associations between biological macromolecules. We functionalise binding partners with the peptide and demonstrate that the ability of the peptide to one-dimensionally diffuse along DNA results in a 20-fold reduction in reaction time. We also show that modifying PCR primers with the peptide sled enables significant acceleration of standard PCR reactions.

| S-EPMC4762599 | biostudies-literature

Speeding up quantum perceptron via shortcuts to adiabaticity.

Project description:The quantum perceptron is a fundamental building block for quantum machine learning. This is a multidisciplinary field that incorporates abilities of quantum computing, such as state superposition and entanglement, to classical machine learning schemes. Motivated by the techniques of shortcuts to adiabaticity, we propose a speed-up quantum perceptron where a control field on the perceptron is inversely engineered leading to a rapid nonlinear response with a sigmoid activation function. This results in faster overall perceptron performance compared to quasi-adiabatic protocols, as well as in enhanced robustness against imperfections in the controls.

| S-EPMC7952456 | biostudies-literature

SparkEC: speeding up alignment-based DNA error correction tools.

Project description:BackgroundIn recent years, huge improvements have been made in the context of sequencing genomic data under what is called Next Generation Sequencing (NGS). However, the DNA reads generated by current NGS platforms are not free of errors, which can affect the quality of downstream analysis. Although error correction can be performed as a preprocessing step to overcome this issue, it usually requires long computational times to analyze those large datasets generated nowadays through NGS. Therefore, new software capable of scaling out on a cluster of nodes with high performance is of great importance.ResultsIn this paper, we present SparkEC, a parallel tool capable of fixing those errors produced during the sequencing process. For this purpose, the algorithms proposed by the CloudEC tool, which is already proved to perform accurate corrections, have been analyzed and optimized to improve their performance by relying on the Apache Spark framework together with the introduction of other enhancements such as the usage of memory-efficient data structures and the avoidance of any input preprocessing. The experimental results have shown significant improvements in the computational times of SparkEC when compared to CloudEC for all the representative datasets and scenarios under evaluation, providing an average and maximum speedups of 4.9[Formula: see text] and 11.9[Formula: see text], respectively, over its counterpart.ConclusionAs error correction can take excessive computational time, SparkEC provides a scalable solution for correcting large datasets. Due to its distributed implementation, SparkEC speed can increase with respect to the number of nodes in a cluster. Furthermore, the software is freely available under GPLv3 license and is compatible with different operating systems (Linux, Windows and macOS).

| S-EPMC9639292 | biostudies-literature

Speeding up iterative applications of the BUILD supertree algorithm.

Project description:The Open Tree of Life (OToL) project produces a supertree that summarizes phylogenetic knowledge from tree estimates published in the primary literature. The supertree construction algorithm iteratively calls Aho's Build algorithm thousands of times in order to assess the compatability of different phylogenetic groupings. We describe an incrementalized version of the Build algorithm that is able to share work between successive calls to Build. We provide details that allow a programmer to implement the incremental algorithm BuildInc, including pseudo-code and a description of data structures. We assess the effect of BuildInc on our supertree algorithm by analyzing simulated data and by analyzing a supertree problem taken from the OpenTree 13.4 synthesis tree. We find that BuildInc provides up to 550-fold speedup for our supertree algorithm.

| S-EPMC10768670 | biostudies-literature

Micro Magnetic Gyromixer for Speeding up Reactions in Droplets.

Project description:We report a novel micro magnetic gyromixer designed for accelerating mixing hence reactions in droplets. The gyromixer is fabricated with magnetite-PDMS composite using soft lithography. The mixer spins and balances itself on the droplet surface through the gyroscopic effect, rapidly homogenizing the enclosed reagents by stretching and folding internal fluid streamlines to enhance mixing. We examined the capability of the gyromixer for improving biochemical reactions in droplets by monitoring the biotin-streptavidin binding as a linker in a quantum dot fluorescence resonant energy transfer (QD-FRET) sensing system. The remotely controlled gyromixer exhibits high flexibility and potential for integration in a variety of droplet-based miniaturized total analysis systems (μTAS) to reduce turnaround times.

| S-EPMC3374403 | biostudies-literature

Speeding up direct (15)N detection: hCaN 2D NMR experiment.

Project description:Experiments detecting low gyromagnetic nuclei have recently been proposed to utilize the relatively slow relaxation properties of these nuclei in comparison to (1)H. Here we present a new type of (15)N direct-detection experiment. Like the previously proposed CaN experiment (Takeuchi et al. in J Biomol NMR 47:271-282, 2010), the hCaN experiment described here sequentially connects amide (15)N resonances, but utilizes the initial high polarization and the faster recovery of the (1)H nucleus to shorten the recycling delay. This allows recording 2D (15)N-detected NMR experiments on proteins within a few hours, while still obtaining superior resolution for (13)C and (15)N, establishing sequential assignments through prolines, and at conditions where amide protons exchange rapidly. The experiments are demonstrated on various biomolecules, including the small globular protein GB1, the 22 kDa HEAT2 domain of eIF4G, and an unstructured polypeptide fragment of NFAT1, which contains many SerPro sequence repeats.

| S-EPMC3338130 | biostudies-literature

Speeding up eQTL scans in the BXD population using GPUs.

Project description:The BXD family of mouse strains are an important reference population for systems biology and genetics that have been fully sequenced and deeply phenotyped. To facilitate interactive use of genotype-phenotype relations using many massive omics data sets for this and other segregating populations, we have developed new algorithms and code that enable near-real-time whole-genome quantitative trait locus (QTL) scans for up to one million traits. By using easily parallelizable operations including matrix multiplication, vectorized operations, and element-wise operations, our method is more than 700 times faster than a R/qtl linear model genome scan using 16 threads. We used parallelization of different CPU threads as well as GPUs. We found that the speed advantage of GPUs is dependent on problem size and shape (the number of cases, number of genotypes, and number of traits). Our approach is ideal for interactive web services, such as GeneNetwork.org that need to display results in real-time. Our implementation is available as the Julia language package LiteQTL at https://github.com/senresearch/LiteQTL.jl.

| S-EPMC8664437 | biostudies-literature

Posterior-based proposals for speeding up Markov chain Monte Carlo.

Project description:Markov chain Monte Carlo (MCMC) is widely used for Bayesian inference in models of complex systems. Performance, however, is often unsatisfactory in models with many latent variables due to so-called poor mixing, necessitating the development of application-specific implementations. This paper introduces 'posterior-based proposals' (PBPs), a new type of MCMC update applicable to a huge class of statistical models (whose conditional dependence structures are represented by directed acyclic graphs). PBPs generate large joint updates in parameter and latent variable space, while retaining good acceptance rates (typically 33%). Evaluation against other approaches (from standard Gibbs/random walk updates to state-of-the-art Hamiltonian and particle MCMC methods) was carried out for widely varying model types: an individual-based model for disease diagnostic test data, a financial stochastic volatility model, a mixed model used in statistical genetics and a population model used in ecology. While different methods worked better or worse in different scenarios, PBPs were found to be either near to the fastest or significantly faster than the next best approach (by up to a factor of 10). PBPs, therefore, represent an additional general purpose technique that can be usefully applied in a wide variety of contexts.

| S-EPMC6894579 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data