相关论文: Software for cut-generating functions in the Gomor…

Gamma process has been extensively used to model monotone degradation data. Statistical inference for the gamma process is difficult due to the complex parameter structure involved in the likelihood function. In this paper, we derive a…

Score-based generative modelling (SGM) has proven to be a very effective method for modelling densities on finite-dimensional spaces. In this work we propose to extend this methodology to learn generative models over functional spaces. To…

We introduce a new method to treat Majorana fermions and interactions with fermion-number violation on the GRACE system which has been developed for the automatic computation of the matrix elements for the processes of the standard model.…

The design and implementation of parallel algorithms is a fundamental task in computer algebra. Combining the computer algebra system Singular and the workflow management system GPI-Space, we have developed an infrastructure for massively…

Models can be built directly from input and output data trough a process known as system identification. The Nonlinear AutoRegressive with eXogenous inputs (NARMAX) models are among the most used mathematical representations in the area and…

An information service for mathematical software is presented. Publications and software are two closely connected facets of mathematical knowledge. This relation can be used to identify mathematical software and find relevant information…

In this paper we develop a functional calculus for a countable system of generators of contraction strongly continuous semigroups. As a symbol class of such calculus we use the algebra of polynomial tempered distributions. We prove a…

We present an exact Bayesian inference method for inferring posterior distributions encoded by probabilistic programs featuring possibly unbounded loops. Our method is built on a denotational semantics represented by probability generating…

In computer algebra there are different ways of approaching the mathematical concept of functions, one of which is by defining them as solutions of differential equations. We compare different such approaches and discuss the occurring…

The construction of cut trees (also known as Gomory-Hu trees) for a given graph enables the minimum-cut size of the original graph to be obtained for any pair of vertices. Cut trees are a powerful back-end for graph management and mining,…

We introduce the notion of a robust parameterized arithmetic circuit for the evaluation of algebraic families of multivariate polynomials. Based on this notion, we present a computation model, adapted to Scientific Computing, which captures…

We have developed a software MagGene to predict magnetic structures by using genetic algorithm. Starting from an atom structure, MagGene repeatedly generates new magnetic structures and calls first-principles calculation engine to get the…

FeynMaster is a multi-tasking software for particle physics studies. By making use of already existing programs (FeynRules, QGRAF, FeynCalc), FeynMaster automatically generates Feynman rules, generates and draws Feynman diagrams, generates…

Many forms of programmable matter have been proposed for various tasks. We use an abstract model of self-organizing particle systems for programmable matter which could be used for a variety of applications, including smart paint and…

Goal models have been widely used in Computer Science to represent software requirements, business objectives, and design qualities. Existing goal modelling techniques, however, have shown limitations of expressiveness and/or tractability…

We study discrete probabilistic programs with potentially unbounded looping behaviors over an infinite state space. We present, to the best of our knowledge, the first decidability result for the problem of determining whether such a…

We develop a generating-function formulation for the symbolic reduction of multi-loop Feynman integrals. In this framework, integration-by-parts identities are rewritten as differential equations for sector-wise generating functions, so the…

We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Algebra 1(2), 1973, pp. 163-171]. Our algorithms are based on…

This paper studies algorithms for computing a Gomory-Hu tree, which is a classical data structure that compactly stores all minimum $s$-$t$ cuts of an undirected weighted graph. We consider two classes of algorithms: the original method by…

Nowadays interactive digital scientific environments have become an integral part of scientific computing in solving various scientific tasks in research, but also STEM education. We introduce SageMath or shortly Sage -- a free open…