相关论文: RGIsearch: A C++ program for the determination of …
The automated repair of C++ compilation errors presents a significant challenge, the resolution of which is critical for developer productivity. Progress in this domain is constrained by two primary factors: the scarcity of large-scale,…
Here practical aspects of conducting research via computer simulations are discussed. The following issues are addressed: software engineering, object-oriented software development, programming style, macros, make files, scripts, libraries,…
Physical systems differring in their microscopic details often display strikingly similar behaviour when probed at macroscopic scales. Those universal properties, largely determining their physical characteristics, are revealed by the…
This paper investigates the problem of determining a binary-valued function through a sequence of strategically selected queries. The focus is an algorithm called Generalized Binary Search (GBS). GBS is a well-known greedy algorithm for…
In this paper we employ the Renormalization Group (RG) method to study higher order corrections to the long-time asymptotics of a class of nonlinear integral equations with a generalized heat kernel and with time-dependent coefficients.…
Perturbative renormalization group theory is developed as a unified tool for global asymptotic analysis. With numerous examples, we illustrate its application to ordinary differential equation problems involving multiple scales, boundary…
The perturbative renormalization group(RG) equation is applied to resum divergent series of perturbative wave functions of quantum anharmonic oscillator. It is found that the resummed series gives the cumulant of the naive perturbation…
Presented here is a matrix inversion method utilizing quantum searching algorithm. In this method, huge Hilbert space as a whole spanned by myriad of eigen states is searched and evaluated efficiently by sequential reduction in dimension…
The Renormalisation Group (RG) is a systematic procedure used to regularise divergences appearing as artefacts when constructing solutions to a large class of differential problems, whether perturbatively or not. This paper is devoted to…
Refined Algebraic Quantization and Group Averaging are powerful methods for quantizing constrained systems. They give constructive algorithms for generating observables and the physical inner product. This work outlines the current status…
We propose a simple and effective method to estimate the uncertainty of closed-source deep neural network image classification models. Given a base image, our method creates multiple transformed versions and uses them to query the top-1…
We propose a homomorphic search protocol based on quantum homomorphic encryption, in which a client Alice with limited quantum ability can give her encrypted data to a powerful but untrusted quantum server and let the server search for her…
A practical approach is presented which allows the use of a non-invariant regularization scheme for the computation of quantum corrections in perturbative quantum field theory. The theoretical control of algebraic renormalization over…
We introduce a regularized Generalized Covariance (RGCov) estimator as an extension of the GCov estimator to high dimensional setting that results either from high-dimensional data or a large number of nonlinear transformations used in the…
Revisionist integral deferred correction (RIDC) methods are a family of parallel--in--time methods to solve systems of initial values problems. The approach is able to bootstrap lower order time integrators to provide high order…
Tomographic reconstruction, despite its revolutionary impact on a wide range of applications, suffers from its ill-posed nature in that there is no unique solution because of limited and noisy measurements. Therefore, in the absence of…
The R package (R Core Team (2016)) genMOSS is specifically designed for the Bayesian analysis of genome-wide association study data. The package implements the mode oriented stochastic search (MOSS) procedure as well as a simple moving…
The unfolding program TRUEE is a software package for the numerical solution of inverse problems. The algorithm was first applied in the FORTRAN77 program RUN. RUN is an event-based unfolding algorithm which makes use of the Tikhonov…
Invariant random subgroups (IRS) are conjugacy invariant probability measures on the space of subgroups in a given group G. They can be regarded both as a generalization of normal subgroups as well as a generalization of lattices. As such,…
As quantum computing hardware systems continue to advance, the research and development of performant, scalable, and extensible software architectures, languages, models, and compilers is equally as important in order to bring this novel…