We propose the use of affine arithmetic in cell-mapping methods for the robust visualization of strange attractors and show that the resulting cellular approximations converge faster than those produced by cell-mapping methods based on classical interval arithmetic.

Approximations based on dyadic centred intervals are investigated as a means for implementing exact real arithmetic. It is shown that the field operations can be implemented on these approximations with optimal or near optimal results. Bounds for the loss in quality of approximations for each of the field operations are also given. These approximations can be used as a more efficient alternativ...

This paper explores a method of performing localization on local vision mobile robots. It describes a method of processing images, extracting regions, and comparing those regions against a database of preprocessed images. Localization is achieved using the k-nearest neighbour algorithm as the basis for approximating the current position. Initial results are provided that show the potential of t...

In this paper, we use the continuous Legendre wavelets on the interval [0,1] constructed by Razzaghi M. and Yousefi S. [6] to solve the linear second kind integral equations. We use quadrature formula for the calculation of the products of any functions, which are required in the approximation for the integral equations. Then we reduced the integral equation to the solution of linear algebraic ...

Several types of nearest neighbor (NN) search have been proposed and studied in the context of spatial databases. The most common type is the point NN query, which retrieves the nearest neighbors of an input point. Such a query, however, is usually meaningless in highly dynamic environments where the query point or the database objects move/change over time. In this paper we study alternative f...

In discrete k-center and k-median clustering, we are given a set of points P in a metric space M , and the task is to output a set C ⊆ P, |C| = k, such that the cost of clustering P using C is as small as possible. For k-center, the cost is the furthest a point has to travel to its nearest center, whereas for k-median, the cost is the sum of all point to nearest center distances. In the fault-t...

in this research, structural and electronic properties of zncdn-1ten clusters (n=1-10) have been studied by formalism of density functional theory and using the projector augmented wave within local density approximation. the structural properties (such as bond length/angle and coordination number), electronic and optical properties (such as binding energy, kohn-sham spectrum and partial charge...

The notion of a rough set was originally proposed by Pawlak [Z. Pawlak, Rough sets, International Journal of Computer and Information Sciences 11 (5) (1982) 341–356]. Later on, Dubois and Prade [D. Dubois, H. Prade, Rough fuzzy sets and fuzzy rough sets, International Journal of General System 17 (2–3) (1990) 191–209] introduced rough fuzzy sets and fuzzy rough sets as a generalization of rough...