The OpenStreetMap (OSM) project aims to establish a free geospatial database for the entire world which is editable by international volunteers. The OSM database contains a wide range of different types of geographical data and characteristics, including highways, buildings, and land use regions. The varying scientific backgrounds of the volunteers can affect the quality of the spatial data that is produced and shared on the internet as an OSM dataset. This study aims to compare the completeness and attribute accuracy of the OSM road networks with the data supplied by a digitizing process for areas in the Baghdad and Thi-Qar governorates. The analyses are primarily based on calculating the portion of the commission (extr

The OpenStreetMap (OSM) project aims to establish a free geospatial database for the entire world which is editable by international volunteers. The OSM database contains a wide range of different types of geographical data and characteristics, including highways, buildings, and land use regions. The varying scientific backgrounds of the volunteers can affect the quality of the spatial data that is produced and shared on the internet as an OSM dataset. This study aims to compare the completeness and attribute accuracy of the OSM road networks with the data supplied by a digitizing process for areas in the Baghdad and Thi-Qar governorates. The analyses are primarily based on calculating the portion of the commission (extra road) and

The emphasis of Master Production Scheduling (MPS) or tactic planning is on time and spatial disintegration of the cumulative planning targets and forecasts, along with the provision and forecast of the required resources. This procedure eventually becomes considerably difficult and slow as the number of resources, products and periods considered increases. A number of studies have been carried out to understand these impediments and formulate algorithms to optimise the production planning problem, or more specifically the master production scheduling (MPS) problem. These algorithms include an Evolutionary Algorithm called Genetic Algorithm, a Swarm Intelligence methodology called Gravitational Search Algorithm (GSA), Bat Algorithm (BAT), T

Artificial neural networks usage, as a developed technique, increased in many fields such as Auditing business. Contemporary auditor should cope with the challenges of the technology evolution in the business environment by using computerized techniques such as Artificial neural networks, This research is the first work made in the field of modern techniques of the artificial neural networks in the field of auditing; it is made by using thesample of neural networks as a sample of the artificial multi-layer Back Propagation neural networks in the field of detecting fundamental mistakes of the financial statements when making auditing. The research objectives at offering a methodology for the application of theartificial neural networks wi

In this study, the relationship between the bare soil temperature with respect to its salinity is presented, the bare soil feature is considered only by eliminating all other land features by classifying the site location by using the support vector machine algorithm, in the same time the salinity index that calculated from the spectral response from the satellite bands is calibrated using empirical salinity value calculated from field soil samples. A 2D probability density function is used to analyze the relationship between the temperature rising from the minimum temperature (from the sunrise time) due to the solar radiation duration tell the time of the satellite capturing the scene image and the calibrated salinity index is presented. T

IDENTITY CRISIS

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.