相关论文: The automatic computation for SUSY processes

Biological systems are often modelled at different levels of abstraction depending on the particular aims/resources of a study. Such different models often provide qualitatively concordant predictions over specific parametrisations, but it…

It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…

The quantum symmetric simple exclusion process (QSSEP) is a recent extension of the symmetric simple exclusion process, designed to model quantum coherent fluctuating effects in noisy diffusive systems. It models stochastic nearest-neighbor…

In this article, we propose a new class of priors for Bayesian inference with multiple Gaussian graphical models. We introduce fully Bayesian treatments of two popular procedures, the group graphical lasso and the fused graphical lasso, and…

A numerical program is presented which facilitates the computation of the full set of one-gluon loop diagrams (including ghost loop contributions), with M attached external gluon lines in all possible ways. The feasibility of such a task…

A full account is given of the procedure used by the authors to construct an SO(10) supersymmetric grand unified model of the fermion mass matrices. Various features of the model which gives remarkably accurate results for the quark and…

We use an "equation-free", coarse-grained computational approach to accelerate molecular dynamics-based computations of demixing (segregation) of dissimilar particles subject to an upward gas flow (gas-fluidized beds). We explore the…

One-to-one reversible automata are introduced. Their applicability to a modelling of the quantum mechanical measurement process is discussed.

L\"uscher's local bosonic algorithm for Monte Carlo simulations of quantum field theories with fermions is applied to the simulation of a possibly supersymmetric Yang-Mills theory with a Majorana fermion in the adjoint representation.…

This paper presents a well-scaling parallel algorithm for the computation of Morse-Smale (MS) segmentations, including the region separators and region boundaries. The segmentation of the domain into ascending and descending manifolds,…

A phase-space generation algorithm, capable to efficiently integrate the squared amplitude of any scattering process, is presented. The algorithm has been implemented in a Monte Carlo program, PHEGAS, which, using HELAC, a helicity…

As an alternative to the popular balanced truncation method, the cross Gramian matrix induces a class of balancing model reduction techniques. Besides the classical computation of the cross Gramian by a Sylvester matrix equation, an…

Gaussian processes (GPs) are crucial in machine learning for quantifying uncertainty in predictions. However, their associated covariance matrices, defined by kernel functions, are typically dense and large-scale, posing significant…

In this presentation, we describe the GoSam (Golem/Samurai) framework for the automated computation of multi-particle scattering amplitudes at the one-loop level. The amplitudes are generated analytically in terms of Feynman diagrams, and…

Gaussian processes are a powerful framework for uncertainty-aware function approximation and sequential decision-making. Unfortunately, their classical formulation does not scale gracefully to large amounts of data and modern hardware for…

A central task in many applications is reasoning about processes that change over continuous time. Continuous-Time Bayesian Networks is a general compact representation language for multi-component continuous-time processes. However, exact…

This paper is the first in the series devoted to evaluation of the partition function in statistical models on graphs with loops in terms of the Berezin/fermion integrals. The paper focuses on a representation of the determinant of a square…

Bayesian methods for learning Gaussian graphical models offer a principled framework for quantifying model uncertainty and incorporating prior knowledge. However, their scalability is constrained by the computational cost of jointly…

The category of crossed complexes gives an algebraic model of CW-complexes and cellular maps. Free crossed resolutions of groups contain information on a presentation of the group as well as higher homological information. We relate this to…

Fuzzy structures such as fuzzy automata, fuzzy transition systems, weighted social networks and fuzzy interpretations in fuzzy description logics have been widely studied. For such structures, bisimulation is a natural notion for…