相关论文: FIESTA 3: cluster-parallelizable multiloop numeric…

Clustering analysis of functional data, which comprises observations that evolve continuously over time or space, has gained increasing attention across various scientific disciplines. Practical applications often involve functional data…

We present selected examples demonstrating an alternative approach to contour deformation for numerically computing loop integrals in the Minkowski regime. This method focuses on identifying singular hypersurfaces (varieties of the…

Standard approaches to tackle high-dimensional supervised classification problem often include variable selection and dimension reduction procedures. The novel methodology proposed in this paper combines clustering of variables and feature…

We propose a novel approach to the problem of multilevel clustering, which aims to simultaneously partition data in each group and discover grouping patterns among groups in a potentially large hierarchically structured corpus of data. Our…

We present a new parallel PM N-body code named PMFAST that is freely available to the public. PMFAST is based on a two-level mesh gravity solver where the gravitational forces are separated into long and short range components. The…

We report on the new functionality of the open-source Mathematica package FeynCalc relevant for multiloop calculations. In particular, we focus on such tasks as topology identification by means of the Pak algorithm, search for equivalent…

In this paper, we study systematically scalar one-loop two-, three-, and four-point Feynman integrals with complex internal masses. Our analytic results presented in this report are valid for both real and complex internal masses. The…

We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated representations of combinatorial constrained problems. This new format is able to deal with mono/multi optimization, many types of variables, cost…

A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery…

A wide range of (multivariate) temporal (1D) and spatial (2D) data analysis tasks, such as grouping vehicle sensor trajectories, can be formulated as clustering with given metric constraints. Existing metric-constrained clustering…

A comprehensive study is performed of two-loop Feynman diagrams with three external legs which, due to the exchange of massless gauge-bosons, give raise to infrared and collinear divergencies. Their relevance in assembling realistic…

Fast Iterative Shrinking-Threshold Algorithm (FISTA) is a popular fast gradient descent method (FGM) in the field of large scale convex optimization problems. However, it can exhibit undesirable periodic oscillatory behaviour in some…

We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…

We combine parallelization and cluster Monte Carlo for hard sphere systems and present a parallelized event chain algorithm for the hard disk system in two dimensions. For parallelization we use a spatial partitioning approach into…

We bring together topological data analysis, applied category theory, and machine learning to study multiparameter hierarchical clustering. We begin by introducing a procedure for flattening multiparameter hierarchical clusterings. We…

We evaluate the three-loop five-point pentagon-box-box massless integral family in the dimensional regularization scheme, via canonical differential equation. We use tools from computational algebraic geometry to enable the necessary…

Event datasets in the financial domain are often constructed based on actual application scenarios, and their event types are weakly reusable due to scenario constraints; at the same time, the massive and diverse new financial big data…

NIFTy, "Numerical Information Field Theory", is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing…

Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs: (1) generation of fault-span, the set of states reachable in the presence of faults, and (2) resolving deadlock…

Parametric Feynman integrals with the regions of integration defined by some polynomials are considered in this paper. It is shown that integrals with irregular integration regions can be converted to standard parametric integrals, for…