Related papers: The Arithmetic Cosine Transform: Exact and Approxi…
The metaplectic transform (MT), a generalization of the Fourier transform sometimes called the linear canonical transform, is a tool used ubiquitously in modern optics, for example, when calculating the transformations of light beams in…
We introduce a numerical method for the approximation of functions which are analytic on compact intervals, except at the endpoints. This method is based on variable transforms using particular parametrized exponential and…
Atomic probe tomography (APT), based on the work of Erwin Mueller, is able to generate three-dimensional chemical maps in atomic resolution. The required instruments for APT have evolved over the last 20 years from an experimental to an…
The Argand diagram is used to display some characteristics of the Riemann Zeta function. The zeros of the Zeta function on the complex plane give rise to an infinite sequence of closed loops, all passing through the origin of the diagram.…
Transfer learning is a crucial technique for handling a small amount of data that is potentially related to other abundant data. However, most of the existing methods are focused on classification tasks using images and language datasets.…
Approximate Bayesian computation (ABC) is a family of computational techniques in Bayesian statistics. These techniques allow to fi t a model to data without relying on the computation of the model likelihood. They instead require to…
In this document, as far as the authors know, an approximation to the zeros of the Riemann zeta function has been obtained for the first time using only derivatives of constant functions, which was possible only because a fractional…
We give a spectral interpretation of the critical zeros of the Riemann zeta function as an absorption spectrum, while eventual noncritical zeros appear as resonances. We give a geometric interpretation of the explicit formulas of number…
Two multiplierless pruned 8-point discrete cosine transform (DCT) approximation are presented. Both transforms present lower arithmetic complexity than state-of-the-art methods. The performance of such new methods was assessed in the image…
The correct treatment of the close-to-boson character of excitons is known to be a major problem. In a previous work, we have proposed a ``commutation technique'' to include this close-to-boson character in their interactions. We here…
We research relations between optimal transport theory (OTT) and approximate Bayesian computation (ABC) possibly connected to relevant metrics defined on probability measures. Those of ABC are computational methods based on Bayesian…
The aim of our present work here is to present few results in the theory of Mellin transforms using the method that S. Ramanujan used in proving his Master Theorem. Further applications of our results for some number-theoretic functions…
In this paper, we introduce low-complexity multidimensional discrete cosine transform (DCT) approximations. Three dimensional DCT (3D DCT) approximations are formalized in terms of high-order tensor theory. The formulation is extended to…
Autonomous manipulation in robot arms is a complex and evolving field of study in robotics. This paper proposes work stands at the intersection of two innovative approaches in the field of robotics and machine learning. Inspired by the…
The modified Mellin transform ${\cal Z}_k(s) = \int_1^\infty |\zeta({1\over2}+ix|^{2k}x^{-s}{\rm d} x$ ($k\ge1$ is a fixed integer, $s = \sigma + it$) is used to obtain estimates for $$…
Our previous work dealt with the zeta function for the interacting particle system (IPS) including quantum cellular automaton (QCA) as a typical model in the study of ``IPS/Zeta Correspondence". On the other hand, the absolute zeta function…
The special affine Fourier transform (SAFT) is a promising tool for analyzing non-stationary signals with more degrees of freedom. However, the SAFT fails in obtaining the local features of non-transient signals due to its global kernel and…
In the present paper, we construct an algorithm for the evaluation of real Riemann zeta function $\zeta(s)$ for all real $s$, $s>1$, in polynomial time and linear space on Turing machines in Ko-Friedman model. The algorithms is based on a…
We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits…
The modified zeta functions $\sum_{n \in K} n^{-s}$, where $K \subset \N$, converge absolutely for $\Re s > 1/2$. These generalise the Riemann zeta function which is known to have a meromorphic continuation to all of $\C$ with a single pole…