In this paper, we propose a fingerprint verification system using two different modules: the automatic classification of fingerprints which is based on the minutiae-matching algorithms and the verification-search technique which is based on genetic algorithms. Our experiments on a large set of fingerprint images show that our approach is highly promising. Its performance shows a great flexibili...

Little is known about people's accuracy of recognizing neutral faces as neutral. In this paper, I demonstrate the importance of knowing how well people recognize neutral faces. I contrasted human recognition scores of 100 typical, neutral front-up facial images with scores of an arguably objective judge - automated facial coding (AFC) software. I hypothesized that the software would outperform ...

Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre ∗ H(C), is regular. In this paper, we give an alternative proof of this result for second order automata. Our construction of automata for recognizing pre∗H(C) is explicit. The termination of saturation procedure used is obvious. It gives a better bound on size of the...

Give a graph class G and a nonnegative integer k, we use G+kv, G+ke, and G−ke to denote the classes of graphs that can be obtained from some graph in G by adding k vertices, adding k edges, and deleting k edges, respectively. They are called almost (unit) interval graphs if G is the class of (unit) interval graphs. Almost (unit) interval graphs are well motivated from computational biology, whe...

A methodology for recognizing ZIP codes @ostal codes) in handwritten addresses is presented. The method uses many diverse pattern recognition and image processing algorithms. Given a high-resolution image of a hand-written address block, the solution invokes routines capable of hypothesizing the location of the ZIP Code, segmenting and recognizing ZIP Code digits, locating and recognizing City ...

Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack layout of a dag is similar to a stack layout of an undirected graph, with the additional requirement...

We are interested in abstract conditions that characterize homomorphic images of affine quandles. Our main result is a two-fold characterization this class: one by property the displacement group, other corresponding mesh. As consequence, we obtain efficient algorithms for recognizing quandles, including an explicit construction covering quandle.

In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

With the rapid emergence of 3D applications and virtual environments in computer systems; the need for a new type of interaction device arises. This is because the traditional devices such as mouse, keyboard, and joystick become inefficient and cumbersome within these virtual environments. In other words, evolution of user interfaces shapes the change in the Human-Computer Interaction (HCI). In...