‎in this work we prove malliavin differentiability for the solution to an sde with locally lipschitz and semi-monotone drift‎. ‎to prove this formula‎, ‎we construct a sequence of sdes with globally lipschitz drifts and show that the $p$-moments of their malliavin derivatives are uniformly bounded‎.

Spectral subband centroid, which is esse ntially the first -order normalized moment, has been proposed for speech recognition and its robustness to additive noise has been demonstrated before. In this paper, we extend this concept to the use of normalized spectral subband moments (NSSM) for robust speech recognition. We show that normalized moments, if properly selected, yield comparable recogn...

Abstract Accurate predictions of inclusive scattering cross sections in the linear response regime require efficient and controllable methods to calculate spectral density a strongly-correlated many-body system. In this work we reformulate recently proposed Gaussian Integral Transform technique terms Fourier moments system Hamiltonian which can be computed efficiently on quantum computer. One m...

Voice clinicians require an objective, reliable, and relatively automatic method to assess voice change after medical, surgical, or behavioral intervention. This measure must be sensitive to a variety of voice qualities and severities, and preferably should reflect voice in continuous speech. The long-term average spectrum (LTAS) is a fast Fourier transform-generated power spectrum whose proper...

Suppose G is a graph, A(G) its adjacency matrix, and μ1(G)≤ μ2(G) ≤ ·· · ≤ μn(G) are eigenvalues of A(G). The numbers Sk(G) = n ∑ i=1 μk i (G), 0 ≤ k ≤ n− 1 are said to be the k−th spectral moment of G and the sequence S(G) = (S0(G),S1(G), · · · ,Sn−1(G)) is called the spectral moments sequence of G. For two graphs G1 and G2, we define G1 ≺S G2, if there exists an integer k, 1≤ k≤ n−1, such tha...

lexicographic ordering by spectral moments ($s$-order) among all trees is discussed in this‎ ‎paper‎. ‎for two given positive integers $p$ and $q$ with $pleqslant q$‎, ‎we denote $mathscr{t}_n^{p‎, ‎q}={t‎: ‎t$ is a tree of order $n$ with a $(p‎, ‎q)$-bipartition}‎. furthermore, ‎the last four trees‎, ‎in the $s$-order‎, ‎among $mathscr{t}_n^{p‎, ‎q},(4leqslant pleqslant q)$ are characterized‎.

 Lexicographic ordering by spectral moments ($S$-order) among all trees is discussed in this‎ ‎paper‎. ‎For two given positive integers $p$ and $q$ with $pleqslant q$‎, ‎we denote $mathscr{T}_n^{p‎, ‎q}={T‎: ‎T$ is a tree of order $n$ with a $(p‎, ‎q)$-bipartition}‎. Furthermore, ‎the last four trees‎, ‎in the $S$-order‎, ‎among $mathscr{T}_n^{p‎, ‎q},(4leqslant pleqslant q)$ are characterized‎.

This paper deals with the inverse homogenization or dehomogenization problem of recovering geometric information about the structure of a twocomponent composite medium from the effective complex permittivity of the composite. The approach is based on the reconstruction of moments of the spectral measure in the Stieltjes analytic representation of the effective property. The moments of the spect...