This paper presents a probabilistic spatial join on positional uncertain data designed to be a) generalist; b) accurate and c) efficient. A proposed progressive Monte Carlo algorithm is used in the refinement step and the Chebyshev inequality is applied in the filtering one in order to provide efficiency, efficacy and generality. The experiments show that the current propose is Pareto efficient...

Using techniques based on the continuous and discrete semimartingale convergence theorems, this paper investigates if numerical methods may reproduce the almost sure exponential stability of the exact solutions to stochastic delay differential equations (SDDEs). The important feature of this technique is that it enables us to study the almost sure exponential stability of numerical solutions of...

by the method of weight coefficients and techniques of real analysis, ahardy-hilbert-type inequality with a general homogeneous kernel and a bestpossible constant factor is given. the equivalent forms, the operatorexpressions with the norm, the reverses and some particular examples are alsoconsidered.

Focusing on the visual effect deficiency in the application of standard LOD algorithm for 3D landscape design, 3D landscape designing model based on terrain complexity collision and shading rendering is built in this paper. First, 3D landscape design models are devided into two categories, regular terrain and irregular terrain, and different rules are respectively adopted during model building....

-

Several authors have examined connections among 132-avoiding permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we find analogues for some of these results for permutations π avoiding 132 and 1223 (there is no occurrence πi < πj < πj+1 such that 1 ≤ i ≤ j − 2) and provide a combinatorial interpretation for such permutations in terms of lattice paths. ...

We present a Chebyshev-Davidson method to compute a few smallest positive eigenvalues and corresponding eigenvectors of the linear response eigenvalue problem. The method is actually applicable to the slightly more general linear response eigenvalue problem where purely imaginary eigenvalues may occur. For the Chebyshev filter, a tight upper bound is obtained by a computable bound estimator con...

Abstract—In Digital Signal Processing, one of the most important filter type is the FIR filter which can be designed via various methods. Window technique is the most important technique that is used to design the FIR filter. Apart from various window techniques, Dolph-Chebyshev window has the subject of importance for the design of the FIR filter in efficient way. In this paper, the design met...