This paper presents EPLSimp, an algorithm for map generalization that avoids the creation of topological inconsistencies. EPLSimp is based on Visvalingam-Whyatt’s (VW) algorithm on which least “important” points are removed first. Unlike VW’s algorithm, when a point is deleted a verification is performed in order to check if this deletion would create topological inconsistencies. This was done ...

In this talk we intend to provide for an overview of the uses we can make in financial economics of several quantum physical concepts. We introduce and briefly discuss the so called information wave function. We discuss how the information wave function can be of use in financial option pricing. We then briefly allude on how the information wave function can be used in arbitrage. We briefly dis...

This paper considers a ray-casting point-in polyhedron test. Although it is conceptually the simple extension of a well-known point-in-polygon ray-casting algorithm, various practical problems appear in 3D, especially, when the boundary of a geometric object is represented as a triangulated surface. When a larger number of points have to be tested regarding their positions on the considered geo...

This paper presents parameterized module-generators for pipelined function evaluation using lookup tables, adders, shifters and multipliers. We discuss trade-offs involved between (1) full-lookup tables, (2) bipartite (lookup-add) units, (3) lookup-multiply units, and (4) shift-and-add based CORDIC units. For lookup-multiply units we provide equations estimating approximation errors and roundin...

The algorithmic differentiation in the COCONUT Environment does not only provide point evaluations but also range enclosures of derivatives up to order 3, as well as slopes up to second order. Care is taken to ensure that rounding errors are treated correctly. The ranges of the enclosures can be tightened by combining the evaluation routines with constraint propagation. Advantages and pitfalls ...

We study the non-reversibility of molecular dynamics trajectories arising from the amplification of rounding errors. We analyse the causes of such behaviour and give arguments, indicating that this does not pose a significant problem for Hybrid Monte Carlo computations. We present data for pure SU(3) gauge theory and for QCD with dynamical fermions on small lattices to illustrate and to support...

Mean shift algorithm is widely used in 2D images. In this paper a novel 3D corresponding control points estimation using mean shift algorithm is proposed. This algorithm is not a simple extension from 2D to 3D, but computes the probability density function in each slice of the search region and connects them into a whole density function smoothed by Gaussian function. And then we calculate and ...

Recently developed recursive least squares schemes, where the square root of both the covariance and the information matrix are stored and updated, are known to be particularly suited for parallel implementation. However, when finite precision arithmetic is used, round-off errors apparently accumulate unboundedly, so that after a number of updates the computed least squares solutions turn out t...

Nakajima and Tanaka showed that the algebraic eigenvalue problem occurring in the discrete ordinate and matrix operator methods can be reduced to finding eigenvalues and eigenvectors of the product of two symmetric matrices, one of which is positive definite. Here, we show that the Cholesky decomposition of this positive definite matrix can be used to convert the eigenvalue problem into one inv...

In this paper, we apply the homotopy perturbation transform method (HPTM) to obtain the solution of linear and nonlinear Schrödinger equations. The HPTM is a combined form of the Laplace transform method with the homotopy perturbation method. This method finds the solution without any discretization or restrictive assumptions and avoids the round-off errors. The fact that this technique solves ...