The life insurance marketing faces many difficulties because it is not a current tangible commodity, so it needs a planning for promotional activities and data about prospective applicants according to many factors such as age and residence area ​​, marital status and profession to determine the group wich need insurance covers.                                                                    &nb

<span>One of the main difficulties facing the certified documents documentary archiving system is checking the stamps system, but, that stamps may be contains complex background and surrounded by unwanted data. Therefore, the main objective of this paper is to isolate background and to remove noise that may be surrounded stamp. Our proposed method comprises of four phases, firstly, we apply k-means algorithm for clustering stamp image into a number of clusters and merged them using ISODATA algorithm. Secondly, we compute mean and standard deviation for each remaining cluster to isolate background cluster from stamp cluster. Thirdly, a region growing algorithm is applied to segment the image and then choosing the connected regi

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.

  The great scientific progress has led to widespread Information as information accumulates in large databases is important in trying to revise and compile this vast amount of data and, where its purpose to extract hidden information or classified data under their relations with each other in order to take advantage of them for technical purposes.

      And work with data mining (DM) is appropriate in this area because of the importance of research in the (K-Means) algorithm for clustering data in fact applied with effect can be observed in variables by changing the sample size (n) and the number of clusters (K)

              In this paper, the packing problem for complete (  4)-arcs in  is partially solved. The minimum and the maximum sizes of complete (  4)-arcs in  are obtained. The idea that has been used to do this classification is based on using the algorithm introduced in Section 3 in this paper. Also, this paper establishes the connection between the projective geometry in terms of a complete ( , 4)-arc in  and the algebraic characteristics of a plane quartic curve over the field  represented by the number of its rational points and inflexion points. In addition, some sizes of complete (  6)-arcs in the projective plane of order thirteen are established, namely for  = 53, 54, 55, 56.

The purpose of this paper is use the Dynamic Programming to solve a deterministic periodic review model for inventory problem and then to find the optimal policies that the company must uses in the purchase or production  (in the practical application example the Al Aksa company purchase the generators from out side country).

Objectives: The study aims to assess the school refusal behavior of first class pupils at primary schools and identifying the relationship between the school refusal behavior and some of socio-demographic characteristics for the pupils.

Methodology:  A descriptive-analytic study was initiated from November 1^st, 2012 to April 1^st, 2013. A random sample of 411 students is selected from a probability stratified sample of 17 primary schools for both sexes in 4 sectors in Baghdad Al-Rasafa and Al-Karkh districts which are selected randomly from first class of primary school. A Self administrative questionnaire (Parents' Version) which constructed by the rese