相关论文: On a functional-difference equation of Runyon, Mor…

Dealing with NP-hard problems, kernelization is a fundamental notion for polynomial-time data reduction with performance guarantees: in polynomial time, a problem instance is reduced to an equivalent instance with size upper-bounded by a…

We propose and analyze two regularized finite difference methods for the logarithmic Klein-Gordon equation (LogKGE). Due to the blowup phenomena caused by the logarithmic nonlinearity of the LogKGE, it is difficult to construct numerical…

Aaronson and Ambainis (SICOMP `18) showed that any partial function on $N$ bits that can be computed with an advantage $\delta$ over a random guess by making $q$ quantum queries, can also be computed classically with an advantage $\delta/2$…

We study the correlation functions of the Pfaffian Schur process. Borodin and Rains [J. Stat. Phys. 121 (2005), 291-317] introduced the Pfaffian Schur process and derived its correlation functions using a Pfaffian analogue of the…

Random feature maps are used to decrease the computational cost of kernel machines in large-scale problems. The Mondrian kernel is one such example of a fast random feature approximation of the Laplace kernel, generated by a computationally…

In this paper we consider the kernel of the radially deformed Fourier transform introduced in the context of Clifford analysis in [10]. By adapting the Laplace transform method from [4], we obtain the Laplace domain expressions of the…

In this paper, a new notion, named Riemann-Liouville fractional cosine function is presented. It is proved that a Riemann-Liouville $\alpha$-order fractional cosine function is equivalent to Riemann-Liouville $\alpha$-order fractional…

We offer a solution to a functional equation using properties of the Mellin transform. A new criteria for the Riemann Hypothesis is offered as an application of our main result, through a functional relationship with the Riemann xi…

The Drell-Levy-Yan relation is employed to obtain pion and kaon elementary fragmentation functions (EFFs) from the hadron-scale parton distribution functions (DFs) of these mesons. Two different DF sets are used: that calculated using a…

Modified Klein-Gordon-Fock equations were obtained on the basis of one-dimensional chaotic dynamics. The original Lagrangians were found. The concepts of \textit{m}-exponential map and groups with broken symmetry are introduced. A system of…

The mathematical logic of a true nature of mirror symmetry expresses, in the case of the Dirac Lagrangian, the ideas of the left- and right-handed photons referring to long- and short-lived particles, respectively. Such a difference in…

This paper studies a machine learning regression problem as a multivariate approximation problem using the framework of the theory of random functions. An ab initio derivation of a regression method is proposed, starting from postulates of…

We study some thermodynamics quantities for the Klein-Gordon equation with a linear plus inverse-linear, scalar potential. We obtain the energy eigenvalues with the help of the quantization rule coming from the biconfluent Heun's equation.…

This work belongs to the framework of inverse problems with linear model. The resolution of this type of problem consists in minimizing (possibly under constraints) a function of discrepancy between the measurements and a physical model of…

We consider a system of multiscale stochastic differential equations whose slow component is drivenby a fractional Brownian motion with Hurst parameter H greater than 1/2. Under ergodic assumptions ensuring the applicability of the…

Covariate shift occurs prevalently in practice, where the input distributions of the source and target data are substantially different. Despite its practical importance in various learning problems, most of the existing methods only focus…

This research was mainly conducted to explore the possibility of formulating an efficient algorithm to find roots of nonlinear equations without using the derivative of the function. The Weerakoon-Fernando method had been taken as the base…

This paper considers the strong error analysis of the Euler and fast Euler methods for nonlinear overdamped generalized Langevin equations driven by the fractional noise. The main difficulty lies in handling the interaction between the…

Compared to basic fork-join queues, a job in (n, k) fork-join queues only needs its k out of all n sub-tasks to be finished. Since (n, k) fork-join queues are prevalent in popular distributed systems, erasure coding based cloud storages,…

We study four problems namely, Campbell's source coding problem, Arikan's guessing problem, Huieihel et al.'s memoryless guessing problem, and Bunte and Lapidoth's task partitioning problem. We observe a close relationship among these…