A smart and simple algorithm is presented in this paper for vehicle’s license plate recognition system. Based on pattern matching, this algorithm can be applied for real time detection of license plates for collecting data for surveying or for some application specific purposes. The proposed system has been prototyped using C++ and the experimental results have been shown for recognition of Alb...

Automatic Number Plate Recognition (ANPR) plays an important role in Intelligent Transport System. Number plate extraction is the major key step before the plate recognition. This paper presents a method for extraction and recognition of the vehicle number plate from the image automatically. The camera is used to capture the image automatically. The segmentation is used to segment the character...

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

A power series is introduced that is an extension to three sets of variables of the Cauchy sum for Jack symmetric functions in the Jack parameter : We conjecture that the coeecients of this series with respect to the power sum basis are nonneg-ative integer polynomials in b, the Jack parameter shifted by 1. More strongly, we make the Matchings-Jack Conjecture, that the coeecients are counting s...

A vector algorithm is an algorithm that applies a bounded number of vector operations to an input vector, regardless of the length of the input. The allowable operations are usually restricted to bit-wise operations available in processors, including shifts and binary addition with carry. This paper studies automata for which it is easy to derive a vector algorithm to compute the sequence of st...

schema matching is a critical step in many applications, such as data warehouse loading, online analytical process (olap), data mining, semantic web [2] and schema integration. this task is defined for finding the semantic correspondences between elements of two schemas. recently, schema matching has found considerable interest in both research and practice. in this paper, we present a new impr...

Automated data analysis and pattern recognition techniques are the requirements of biological and proteomicsresearch studies. The analysis of proteins consists of some stages among which the analysis of two dimensionalelectrophoresis (2-DE) images is crucial. The aim of image capturing is to generate a Photostat that can be used infuture works such as image comparison. The researchers introduce...

Let D=(V,A) be a digraphs without isolated vertices. The first Zagreb index of digraph D is defined as summation over all arcs, M1(D)=12∑uv∈A(du++dv−), where du+(resp. du−) denotes the out-degree (resp. in-degree) vertex u. In this paper, we give maximal values and set orientations unicyclic graphs with n vertices matching number m (2≤m≤⌊n2⌋).

Let α′ and μi denote the matching number of a non-empty simple graph G with n vertices ith smallest eigenvalue its Laplacian matrix, respectively. In this paper, we prove tight lower bound α′≥min⌈μ2μn(n−1)⌉,⌈12(n−1)⌉.This strengthens result Brouwer Haemers who proved that if is even 2μ2≥μn, then has perfect matching. A factor-critical for every vertex v∈V(G), G−v We also an analogue to mentione...