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.

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.

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

In this paper, a compression system with high synthetic architect is introduced, it is based on wavelet transform, polynomial representation and quadtree coding. The bio-orthogonal (tap 9/7) wavelet transform is used to decompose the image signal, and 2D polynomial representation is utilized to prune the existing high scale variation of image signal. Quantization with quadtree coding are followed by shift coding are applied to compress the detail band and the residue part of approximation subband. The test results indicate that the introduced system is simple and fast and it leads to better compression gain in comparison with the case of using first order polynomial approximation.

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

The current study aims at using non-hatchable artemia eggs of local origin and making use of these eggs by decapsulating and presenting them as food for the larvae of the Cyprinus carpio as a source of animal protein with high nutritional value instead of throwing them away. The results showed that the second parameter (A2) was highly significant at the level (P≤0.05) in the growth rates of the larvae that were fed on decapsulated artemia eggs alone, and it was better than the two control parameters (A1), in which the larvae were fed with feed designated for Cyprinus carpio fish. It also outperformed the third parameter (A3), in which the feed was mixed with artemia eggs with 50% decapsulation, which also outperformed the control paramete