Data clustering is a technique for clustering set of objects into known number of groups. Several approaches are widely applied to data clustering so that objects within the clusters are similar and objects in different clusters are far away from each other. K-Means, is one of the familiar center based clustering algorithms since implementation is very easy and fast convergence. However, K-Mean...

This paper presents a new feature matching algorithm for registering aerial images with large illumination distortion, similar patterns, affine transformation and low overlapping areas. In this algorithm, affine invariant regions are obtained by a K-NN graph and its corresponding adjacent graph. Then an illumination and affine invariant called Illumination Invariant MultiScale Autoconvolution (...

This paper shows how it made possible in geographical science to observe the seismic zone, clustering of highly sensitive earthquake zone and spatial data clustering during important geographical processes. This paper shows simple density based and KMean clustering technique. Density-Based clustering is done here using density estimation and by searching regions which are denser than a given th...

In this paper we propose an optimization-based framework to multiple graph matching. The framework takes as input maps computed between pairs of graphs, and outputs maps that 1) are consistent among all pairs of graphs, and 2) preserve edge connectivity between pairs of graphs. We show how to formulate this as solving a piece-wise low-rank matrix recovery problem using a generalized message pas...

k-Interval Routing Scheme (k-IRS) is a compact routing method that allows up to k interval labels to be assigned to an arc; and global k-IRS allows not more than a total of k interval labels in the whole network. A fundamental problem is to characterize the networks that admit k-IRS (or global k-IRS). Many of the problems related to single-shortest-path k-IRS have already been shown to be NP-co...

In this article, we study the periodicity, the boundedness and the global stability of the positive solutions of the following nonlinear difference equation xn+1 = Axn +Bxn−k +Cxn−l +Dxn−σ + bxn−k +hxn−l dxn−k + exn−l , n = 0,1,2, ....., where the coefficients A,B,C,D,b,d,e,h ∈ (0,∞), while k, l and σ are positive integers. The initial conditions x−σ ,...,x−l ,...,x−k, ...,x−1,x0 are arbitrary ...

Let k be a global field, k a separable closure of k, and Gk the absolute Galois group Gal(k/k) of k over k. For every σ ∈ Gk, let k σ be the fixed subfield of k under σ. Let E/k be an elliptic curve over k. We show that for each σ ∈ Gk, the Mordell-Weil group E(k σ ) has infinite rank in the following two cases. Firstly when k is a global function field of odd characteristic and E is parametriz...

This note provides new quantitative bounds for the recursive equation yn+1 = A + yn yn−k , n = 0, 1, . . . , where y−k , y−k+1, . . . , y−1, y0, A ∈ (0,∞) and k ∈ {2, 3, 4, . . .}. Issues regarding exponential convergence of solutions are also considered. In particular, it is shown that exponential convergence holds for all (A, k) for which global asymptotic stability was proven in [R.M. Abu-Sa...

This note provides new quantitative bounds for the recursive equation yn+1 = A + yn yn−k , n = 0, 1, . . . , where y−k, y−k+1, . . . , y−1, y0, A ∈ (0,∞) and k ∈ {2, 3, 4, . . .}. Issues regarding exponential convergence of solutions are also considered. In particular, it is shown that exponential convergence holds for all (A, k) for which global asymptotic stability was proven in R. M. Abu-Sar...

We prove that for non-branching metric measure spaces the local curvature condition CDloc(K, N) implies the global version of MCP(K, N). The curvature condition CD(K, N) introduced by the second author and also studied by Lott & Villani is the generalization to metric measure space of lower bounds on Ricci curvature together with upper bounds on the dimension. This paper is the following step o...