The current rasearch which is entitled " The stylistic change in Kandinsky and Mondrian paintings – A Comparative Analytic study-" deals with the nature of change concept, its mechanisms and its constructive disciplines. The research has four chapters: The first chapter deals with the methodological Framework represented by the problem of the research which is concerned with the stylistic change and its role in activating formative disciplines.                                   The research aims at, finding out the stylistic change in Kandinsky and Mondrian Paintings.&

Digital change detection is the process that helps in determining the changes associated with land use and land cover properties with reference to geo-registered multi temporal remote sensing data. In this research change detection techniques have been employed to detect the changes in marshes in south of Iraq for two period the first one from 1973 to 1984 and the other from 1973 to 2014 three satellite images had been captured by land sat in different period. Preprocessing such as geo-registered, rectification and mosaic process have been done to prepare the satellite images for monitoring process. supervised classification techniques such maximum likelihood classification has been used to classify the studied area, change detection aft

Urban land uses are in a dynamic state that varies over time, the city of Karbala in Iraq has experienced functional changes over the past 100 years, as the city is characterized by the presence of significant tourist and socio-economic activity represented by religious tourism, and it occur due to various reasons such as urbanization. The purpose of this study is to apply a Markov model to analyze and predict the behavior of transforming the use of land in Karbala city over time. This can include the conversion of agricultural land, or other areas into residential, commercial, industrial land uses. The process of urbanization is typically driven by population growth, economic development, based on a set of probabilities and transitions bet

    Ni2O3 nanomaterial, a phase of nickel oxide, is synthesized by a simple chemical process. The pure raw materials used in the present process were nickel chloride hexahydrate NiCl2.6H2O and potassium hydroxide KOH by utilizing temperature at 250 oC for 2 hour.  The structural, morphological and optical properties of the synthesized specimens of Ni2O3 were investigated employing diverse techniques such as XRD, AFM, SEM and UV-Vis, respectively. The XRD technique confirms the presence of Ni2O3 nanomaterial with crystal size of 57.083 nm which indexing to the (2θ) of 31.82; this results revealed the Ni2O3 was a phase of nickel oxide with Nano structure. The synthesized Ni2O3 will be useful in manufacturng electrodes materials f

Flying Ad hoc Networks (FANETs) has developed as an innovative technology for access places without permanent infrastructure. This emerging form of networking is construct of flying nodes known as unmanned aerial vehicles (UAVs) that fly at a fast rate of speed, causing frequent changes in the network topology and connection failures. As a result, there is no dedicated FANET routing protocol that enables effective communication between these devices. The purpose of this paper is to evaluate the performance of the category of topology-based routing protocols in the FANET. In a surveillance system involving video traffic, four routing protocols with varying routing mechanisms were examined. Additionally, simulation experiments conduct

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i