In this paper, we introduce a new concept named St-polyform modules, and show that the class of St-polyform modules is contained properly in the well-known classes; polyform, strongly essentially quasi-Dedekind and ?-nonsingular modules. Various properties of such modules are obtained. Another characterization of St-polyform module is given. An existence of St-polyform submodules in certain class of modules is considered. The relationships of St-polyform with some related concepts are investigated. Furthermore, we introduce other new classes which are; St-semisimple and ?-non St-singular modules, and we verify that the class of St-polyform modules lies between them.

Audio classification is the process to classify different audio types according to contents. It is implemented in a large variety of real world problems, all classification applications allowed the target subjects to be viewed as a specific type of audio and hence, there is a variety in the audio types and every type has to be treatedcarefully according to its significant properties.Feature extraction is an important process for audio classification. This workintroduces several sets of features according to the type, two types of audio (datasets) were studied. Two different features sets are proposed: (i) firstorder gradient feature vector, and (ii) Local roughness feature vector, the experimentsshowed that the results are competitive to

In this research, a new technique is suggested to reduce the long time required by the encoding process by using modified moment features on domain blocks. The modified moment features were used in accelerating the matching step of the Iterated Function System (IFS). The main disadvantage facing the fractal image compression (FIC) method is the over-long encoding time needed for checking all domain blocks and choosing the least error to get the best matched domain for each block of ranges. In this paper, we develop a method that can reduce the encoding time of FIC by reducing the size of the domain pool based on the moment features of domain blocks, followed by a comparison with threshold (the selected  threshold based on experience

 In a recent study, a special type of plane overpartitions known as k-rowed plane overpartitions has been studied. The function  denotes the number of plane overpartitions of n with a number of rows at most k. In this paper, we prove two identities modulo 8 and 16 for  the plane overpartitions with at most two rows. We completely specify the  modulo 8. Our technique is based on expanding each term of the infinite product of the generating function of the  modulus 8 and 16 and in which the proofs of the key results are dominated by an intriguing relationship between the overpartitions and the sum of divisors, which reveals a considerable link among these functions modulo powers of 2.

The palm vein recognition is one of the biometric systems that use for identification and verification processes since each person have unique characteristics for the veins. In this paper we can improvement palm vein recognition system have been made. The system based on centerline extraction of veins, and employs the concept of Difference-of Gaussian (DoG) Function to construct features vector. The tests results on our database showed that the identification rate is 100 % with the minimum error rate was 0.333.

In this article we derive two reliability mathematical expressions of two kinds of s-out of -k stress-strength model systems; and . Both stress and strength are assumed to have an Inverse Lomax distribution with unknown shape parameters and a common known scale parameter. The increase and decrease in the real values of the two reliabilities are studied according to the increase and decrease in the distribution parameters. Two estimation methods are used to estimate the distribution parameters and the reliabilities, which are Maximum Likelihood and Regression. A comparison is made between the estimators based on a simulation study by the mean squared error criteria, which revealed that the maximum likelihood estimator works the best.

In this paper, the error distribution function is estimated for the single index model by the empirical distribution function and the kernel distribution function. Refined minimum average variance estimation (RMAVE) method is used for estimating single index model. We use simulation experiments to compare the two estimation methods for error distribution function with different sample sizes, the results show that the kernel distribution function is better than the empirical distribution function.

    The attribute quality control charts are one of the main useful tools to use in control of quality product in companies. In this paper utilizing the statistical procedures to find the attribute quality control charts for through fuzzified the real data which we got it from Baghdad Soft Drink Company in Iraq, by using triangular membership function to obtain the fuzzy numbers then employing the proposed ranking function to transform to traditional sample. Then, compare between crisp and fuzzy attribute quality control.

In this paper we show that if ? Xi is monotonically T2-space then each Xi is monotonically T2-space, too. Moreover, we show that if ? Xi is monotonically normal space then each Xi is monotonically normal space, too. Among these results we give a new proof to show that the monotonically T2-space property and monotonically normal space property are hereditary property and topologically property and give an example of T2-space but not monotonically T2-space.

Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal image co