In this paper we provide a detailed characterization of the asymptotic behavior of kernel density estimators for one-sided linear processes. The conjecture that asymptotic normality for the kernel density estimator holds under short-range dependence is proved under minimal assumptions on bandwidths. We also depict the dichotomous and trichotomous phenomena for various choices of bandwidths when...

OBJECTIVE Despite the rise of high-throughput technologies, clinical data such as age, gender and medical history guide clinical management for most diseases and examinations. To improve clinical management, available patient information should be fully exploited. This requires appropriate modeling of relevant parameters. METHODS When kernel methods are used, traditional kernel functions such...

We present a theory of nonequilibrium long range charge transfer between donor and acceptor centers in a model polymer mediated by magnetic exciton (Kondo) bound states. Our model produces electron tunneling lengths easily exceeding 10 A, as observed recently in DNA and organic charge transfer systems. This long ranged tunneling is effective for weak to intermediate donor-bridge coupling, and i...

The family of general Jacobi polynomials P (α,β) n where α, β ∈ C can be characterised by complex (nonhermitian) orthogonality relations (cf. [15]). The special subclass of Jacobi polynomials P (α,β) n where α, β ∈ R are classical and the real orthogonality, quasi-orthogonality as well as related properties, such as the behaviour of the n real zeros, have been well studied. There is another spe...

In a semiorthogonal Lanczos algorithm, the orthogonality of the Lanczos vectors is allowed to deteriorate to roughly the square root of the rounding unit, after which the current vectors are reorthogonalized. A theorem of Simon 4] shows that the Rayleigh quotient | i.e., the tridiagonal matrix produced by the Lanczos recursion | contains fully accurate approximations to the Ritz values in spite...

In a semiorthogonal Lanczos algorithm, the orthogonality of the Lanczos vectors is allowed to deteriorate to roughly the square root of the rounding unit, after which the current vectors are reorthogonalized. A theorem of Simon 4] shows that the Rayleigh quotient | i.e., the tridiagonal matrix produced by the Lanczos recursion | contains fully accurate approximations to the Ritz values in spite...

Zernike polynomials are an orthogonal set over a unit circle and are often used to represent surface distortions from FEA analyses. There are several reasons why these coefficients may lose their orthogonality in an FEA analysis. The effects, their importance, and techniques for identifying and improving orthogonality are discussed. Alternative representations are presented.

One of the central issues in kernel methods [5] is the problem of kernel selection (learning). This problem has recently received considerable attention which can range from the width parameter selection of Gaussian kernels to obtaining an optimal linear combination from a set of finite candidate kernels, see [3, 4]. In the latter case, kernel learning problem is often termed multi-kernel learn...

The importance of the support vector machine and its applicability to a wide range of problems is well known. The strength of the support vector machine lies in its kernel. In our recent paper, we have shown how the Laplacian kernel overcomes some of the drawbacks of the Gaussian kernel. However this was not a total remedy for the shortcomings of the Gaussian kernel. In this paper, we design a ...