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...

We study extremal questions on induced matchings in certain natural graph classes. We argue that these questions should be asked for twinless graphs, that is graphs not containing two vertices with the same neighborhood. We show that planar twinless graphs always contain an induced matching of size at least n/40 while there are planar twinless graphs that do not contain an induced matching of s...

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...

Graph product is a fundamental tool with rich applications in both graph theory and theoretical computer science. It is usually studied in the form f(G∗H) where G and H are graphs, ∗ is a graph product and f is a graph property. For example, if f is the independence number and ∗ is the disjunctive product, then the product is known to be multiplicative: f(G∗H) = f(G)f(H). In this paper, we stud...

We suggest the use of the refractive-index changes associated with the intersubband transitions in quantum wells for phase matching in nonlinear materials. An improvement in the conversion efficiency of mid-IR second-harmonic generation by almost 2 orders of magnitude over non-phase-matched bulk GaAs is predicted. We also show that the linear phase contributions of intersubband transitions used...

All graphs in this paper are understood to be finite, undirected, without loops or multiple edges. The graph G' = (V', E') is called an induced subgraph of G = (V, E) if V' ~ V and uv E E' if and only if {u, v} ~ V', uv E E. The following two problems about induced matchings have been formulated by Erdos and Nesetril at a seminar in Prague at the end of 1985: 1. Determine f(k, d), the maximum n...