Speeding up MadGraph5_aMC@NLO.
Ontology highlight
ABSTRACT: 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 |
REPOSITORIES: biostudies-literature
Similar Datasets
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
Project description: Not available
| S-EPMC3504542 | biostudies-literature
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
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
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
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
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
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
Project description:POPSEQ Ordered Triticum aestivum Gene Expression (POTAGE) is a web application which accelerates the process of identifying candidate genes for quantitative trait loci (QTL) in hexaploid wheat. This is achieved by leveraging several of the most commonly used data sets in wheat research. These include the Chromosome Survey Sequences, their order along the chromosomes determined by the population sequencing (POPSEQ) approach, the gene predictions and RNA-Seq expression data. POTAGE aggregates those data sets and provides an intuitive interface for biologists to explore the expression of the predicted genes and their functional annotation in a chromosomal context. The interface accelerates some of the laborious and repetitive tasks commonly undertaken in the process of identifying and prioritising genes which may underlie QTL. We illustrate the utility of POTAGE by showing how a short-list of candidate genes can quickly be identified for a QTL linked to pre-harvest sprouting - a major cause of quality and yield loss in wheat production. The candidate genes identified using POTAGE included TaMKK3, which was recently reported as a causal gene for seed dormancy in wheat, and a mutation in its barley ortholog has been shown to reduce pre-harvest sprouting. POTAGE is available at http://crobiad.agwine.adelaide.edu.au/potage .
| S-EPMC5662734 | biostudies-other
Project description:This paper adds to the tool kit of stochastic simulations based on a very simple idea. Applicable to both SSA and Tau-leap algorithms, it can notably reduce computational times. Stochastic simulations are based on computing sample paths based on the generation of random numbers with either exactly stipulated distribution functions as in SSA (Gillespie, 1977) or in the method of interval of quiescence (Shah et al., 1977) or distribution functions featuring approximations designed to promote efficiency (as in Tau-leap algorithms (Cao et al., 2006; Tian and Burrage, 2004; Peng et al., 2007; Gillespie, 2001; Ramkrishna et al., 2014) where a leap condition with the parameter epsilon is used). The usual strategy involves sequential computation of a large number of sample paths over a bounded time interval which is covered by a set of discrete time subintervals obtained by random number generation. The strategy here departs from the foregoing by parallelizing the generation of random subintervals for the set of sample paths until all sample paths have been computed for the stated time interval. The advantage of this procedure lies in the fact that the time for initiation of the random number generator has been notably reduced. Many examples are demonstrated from SSA as well as Tau-leap algorithms to establish that the advantage of the approach is much more than conceptual.
| S-EPMC4562036 | biostudies-literature