Related papers: A proof algorithm associated with the dipole split…
We performed a rigorous theoretical convergence analysis of the discrete dipole approximation (DDA). We prove that errors in any measured quantity are bounded by a sum of a linear and quadratic term in the size of a dipole d, when the…
In this talk, we discuss the speed-up of numerical calculations of jet observables by replacing the usual sum over all helicity amplitudes with an integral over a parametrisation for the parton polarisations called random polarisations.…
We propose an algorithm that test membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The advantage of this algorithm over traditional ones is that the…
We describe the calculation of integrated subtraction terms in the nested soft-collinear subtraction scheme for hadron collider processes with quarks and gluons, thereby extending the results presented in Ref.$~$[1]. Although this extension…
We propose a sound and complete proof rule ProbTA for quantitative analysis of violation probability of probabilistic programs. Our approach extends the technique of trace abstraction with probability in the control-flow randomness style,…
This paper presents the design of a novel distributed algorithm d-IRA for the reachability analysis of linear hybrid automata. Recent work on iterative relaxation abstraction (IRA) is leveraged to distribute the computational problem among…
The random-phase-approximation (RPA) method with separable residual forces (SRPA) is proposed for the description of multipole electric oscillations of valence electrons in deformed alkali metal clusters. Both the deformed mean field and…
Factor analysis and principal component analysis (PCA) are used in many application areas. The first step, choosing the number of components, remains a serious challenge. Our work proposes improved methods for this important problem. One of…
This paper presents a new derivative parsing algorithm for parsing expression grammars; this new algorithm is both simpler and faster than the existing parsing expression derivative algorithm presented by Moss. This new algorithm improves…
We present an implementation of a parton shower algorithm for hadron colliders and electron-positron colliders based on the dipole factorisation formulae. The algorithm treats initial-state partons on equal footing with final-state partons.…
We study robust PCA for the fully observed setting, which is about separating a low rank matrix $\boldsymbol{L}$ and a sparse matrix $\boldsymbol{S}$ from their sum $\boldsymbol{D}=\boldsymbol{L}+\boldsymbol{S}$. In this paper, a new…
We present an algorithm which given a presentation of a group $G$ without 2-torsion, a solution to the word problem with respect to this presentation, and an acylindricity constant ${\kappa}$, outputs a collection of tracks in an…
A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, valuing a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by $\lambda^i$,…
A Distortion Contribution Analysis (DCA) obtains the distortion at the output of an analog electronic circuit as a sum of distortion contributions of its sub-circuits. Similar to a noise analysis, a DCA helps a designer to pinpoint the…
Splitting schemes are a class of powerful algorithms that solve complicated monotone inclusion and convex optimization problems that are built from many simpler pieces. They give rise to algorithms in which the simple pieces of the…
In scientific computation, it is often necessary to calculate higher-order derivatives of a function. Currently, two primary methods for higher-order automatic differentiation exist: symbolic differentiation and algorithmic automatic…
We consider the problem of Robust PCA in the fully and partially observed settings. Without corruptions, this is the well-known matrix completion problem. From a statistical standpoint this problem has been recently well-studied, and…
We propose a special-purpose class of compression algorithms for efficient compression of Prolog programs. It is a dictionary-based compression method, specially designed for the compression of Prolog code, and therefore we name it PCA…
We use a second-order analogy $\mathsf{PRA}^2$ of $\mathsf{PRA}$ to investigate the proof-theoretic strength of theorems in countable algebra, analysis, and infinite combinatorics. We compare our results with similar results in the…
We summarize our efforts to create a numerical implementation of the Local Analytical Subtraction Scheme (LASS) for obtaining NNLO QCD predictions in electron-positron collisions. We focus on the regularization of double-real radiation…