Fingerprints are commonly utilized as a key technique and for personal recognition and in identification systems for personal security affairs. The most widely used fingerprint systems utilizing the distribution of minutiae points for fingerprint matching and representation. These techniques become unsuccessful when partial fingerprint images are capture, or the finger ridges suffer from lot of cuts or injuries or skin sickness. This paper suggests a fingerprint recognition technique which utilizes the local features for fingerprint representation and matching. The adopted local features have determined using Haar wavelet subbands. The system was tested experimentally using FVC2004 databases, which consists of four datasets, each set holds 80 fingers with 8 samples per finger. The attained test results showed encouraging system capability to recognize low quality fingerprint images although with presence of partial loss in fingerprint images.
In this paper we generalize Jacobsons results by proving that any integer in is a square-free integer), belong to . All units of are generated by the fundamental unit having the forms
Our generalization build on using the conditions
This leads us to classify the real quadratic fields into the sets Jacobsons results shows that and Sliwa confirm that and are the only real quadratic fields in .
(9)
(2)
A group of acceptance sampling to testing the products was designed when the life time of an item follows a log-logistics distribution. The minimum number of groups (k) required for a given group size and acceptance number is determined when various values of Consumer’s Risk and test termination time are specified. All the results about these sampling plan and probability of acceptance were explained with tables.
(3)
Abstract
In this research we been estimated the survival function for data suffer from the disturbances and confusion of Iraq Household Socio-Economic Survey: IHSES II 2012 , to data from a five-year age groups follow the distribution of the Generalized Gamma: GG. It had been used two methods for the purposes of estimating and fitting which is the way the Principle of Maximizing Entropy: POME, and method of booting to nonparametric smoothing function for Kernel, to overcome the mathematical problems plaguing integrals contained in this distribution in particular of the integration of the incomplete gamma function, along with the use of traditional way in which is the Maximum Likelihood: ML. Where the comparison on t
... Show More
We claim that a proper subact Ṅ have been compactly packed (c.P) in generalization idea of c.P modules to S Acts. whether for all family of prime subact {Pα}(α∈λ) for some β∈λ Pβ ⊇ Ṅ when ∪(α∈λ)Pα, ⊇ N. We refer to an S-Act Ṁ as c.P. if every subact is compactly packed. We study various properties of c.P S-Acts.
MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix. In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over of length and 28 have been found.
(9)
(2)
The interests toward developing accurate automatic face emotion recognition methodologies are growing vastly, and it is still one of an ever growing research field in the region of computer vision, artificial intelligent and automation. However, there is a challenge to build an automated system which equals human ability to recognize facial emotion because of the lack of an effective facial feature descriptor and the difficulty of choosing proper classification method. In this paper, a geometric based feature vector has been proposed. For the classification purpose, three different types of classification methods are tested: statistical, artificial neural network (NN) and Support Vector Machine (SVM). A modified K-Means clustering algorithm
... Show More
(2)
(5)
(2)