An efficient numerical quadrature for the calculation of the potential energy of wavefunctions expressed in the Daubechies wavelet basis. Abstract. An efficient numerical quadrature is proposed for the approximate calculation of the potential energy in the context of pseudo potential electronic structure calculations with Daubechies wavelet and scaling function basis sets. Our quadrature is als...

In this paper, the emergence of macroscopic-scale pseudo time-irreversibility is studied in closed classical many-body system pair interacting particles. First, exact continuum equations are derived to Hamiltonian dynamics without utilisation statistical mechanics. Next, it shown that momentum density field incorporates thermal degrees freedom considered scaling limit, and therefore initial con...

Boolean constraints play an important role in various constraint logic programming languages. In this paper we consider pseudo-Boolean constraints, that is equations and inequalities between pseudo-Boolean functions. A pseudoBoolean function is an integer-valued function of Boolean variables and thus a generalization of a Boolean function. Pseudo-Boolean functions occur in many application area...

background: one of the challenges of pet/mri combined systems is to derive an attenuation map to correct the pet image. for that, the pseudo-ct image could be used to correct the attenuation. until now, most existing scientific researches construct this pseudo-ct image using the registration techniques. however, these techniques suffer from the local minima of the non-rigid deformation energy f...

In this paper we discuss various problems and conjectures concered the pseudo-Smarandache squarefree function.

Charles Ashbacher [1] has posed a number of questions relating to the pseudo-Smarandache function Z(n). In this note we show that the ratio of consecutive values Z(n + 1)/Z(n) and Z(n − 1)/Z(n) are unbounded; that Z(2n)/Z(n) is unbounded; that n/Z(n) takes every integer value infinitely often; and that the series ∑ n 1/Z(n) is convergent for any α > 1.

Definition: (See Goldreich, section 3.6.4.2 .) A function generator F with unbounded inputs associates with each n bit key k ∈ {0, 1} a function Fk : {0, 1}∗ → {0, 1}. We insist that Fk(x) be computable in time polynomial in the lengths of k and x. By pseudo-random for such a generator, we mean the obvious thing: the Distinguisher adversary D is given a function f : {0, 1}∗ → {0, 1} and can que...

Definition: (See Goldreich, section 3.6.4.2 .) A function generator F with unbounded inputs associates with each n bit key k ∈ {0, 1} a function Fk : {0, 1}∗ → {0, 1}. We insist that Fk(x) be computable in time polynomial in the lengths of k and x. By pseudo-random for such a generator, we mean the obvious thing: the Distinguisher adversary D is given a function f : {0, 1}∗ → {0, 1} and can que...

In this paper we develop a pseudo function approach to obtain relative permeabilities for the numerical simulation of three-dimensional petroleum reservoirs. This approach follows the idea of an experimental approach and combines an analytical solution technique for two-phase flow with a numerical simulation technique for cross-sectional models of these three-dimensional reservoirs. The advanta...

In this paper we investigate the impact of the floating-point precision and interpolation scheme on the results of direct numerical simulations (DNS) of turbulence by pseudo-spectral codes. Three different types of floating-point precision configurations show no differences in the statistical results. This implies that single precision computations allow for increased Reynolds numbers due to th...