in this paper, we used a shape matching algorithm to recognize farsi digits. for each sampled point on the contour of a shape, we obtain a descriptor showing the distribution of the other points of the contour, with respect to this point. based on these descriptors, we find the corresponding points of the two contours and take the sum of their distances as a dissimilarity measure between two sh...

The Generalised Randić index R−α(T ) of a tree T is the sum over the edges uv of T of (d(u)d(v))−α where d(x) is the degree of the vertex x in T . For all α > 0, we find the minimal constant βc = βc(α) such that for all trees on at least 3 vertices R−α(T ) ≤ βc(n + 1) where n = |V (T )| is the number of vertices of T . For example, when α = 1, βc = 15 56 . This bound is sharp up to the additive...

Racial diversity was found to be related racial residential segregation and strongly isolation within the nation’s metropolitan micropolitan areas at block group level. However, relationships were both complex dependent on group. assessed for all 927 as opposed just largest fifty or one hundred. level (excluding water zero population groups), not census tract level, each metro/micro area. The e...

The typical generalized linear model for a regression of a response Y on predictors (X;Z) has conditional mean function based upon a linear combination of (X;Z). We generalize these models to have a nonparametric component, replacing the linear combination T 0 X + T 0 Z by 0( T 0 X) + T 0 Z, where 0( ) is an unknown function. We call these generalized partially linear single-index models (GPLSI...

The automorphic A-chromatic index of a graph Γ is the minimum integer m for which Γ has a proper edge-coloring with m colors which is preserved by a given subgroup A of the full automorphism group of Γ. We compute the automorphic A-chromatic index of each generalized Petersen graph when A is the full automorphism group.