The very fast developments of web and data collection technologies have enabled non-experts to collect and disseminate geospatial datasets through web applications. This new type of spatial data is usually known as collaborative mapping or volunteered geographic information VGI. There are various countries around the world could benefit from collaborative mapping data because it is cost free data, easy to access and it provides more customised data. However, there is a concern about its quality because the data collectors may lack the sufficient experience and training about geospatial data production. Most previous studies which have outlined and analysed VGI quality focused on positional and linear features. The current research has been

In many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an

In this research two algorithms are applied, the first is Fuzzy C Means (FCM) algorithm and the second is hard K means (HKM) algorithm to know which of them is better than the others these two algorithms are applied on a set of data collected  from the Ministry of Planning on the water turbidity of five areas in Baghdad to know which of these areas are less turbid in clear water to see which months during the year are less turbid in clear water in the specified area.

A substantial matter to confidential messages' interchange through the internet is transmission of information safely. For example, digital products' consumers and producers are keen for knowing those products are genuine and must be distinguished from worthless products. Encryption's science can be defined as the technique to embed the data in an images file, audio or videos in a style which should be met the safety requirements. Steganography is a portion of data concealment science that aiming to be reached a coveted security scale in the interchange of private not clear commercial and military data. This research offers a novel technique for steganography based on hiding data inside the clusters that resulted from fuzzy clustering. T

The administration on the basis of the activities designed to evaluate the performance of activities in terms of cost, time and quality by identifying activities that add value and those that are no add value and  enables the administration of making up their own continuous improvement in production, through lower costs and reduce the time and improve the quality   and reduce the incidence of spoilage and waste, y based search Ally premise that (the continuous improvement of the adoption of management style on the basis of the activities helps management in decision-making wise to reduce  costs) to prove the hypothesis has sought research to achieve its goal of  Alkadivh and Alkoppelan     &nb

In this thesis, we introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we studied some pawlak's concepts and generalization rough set theory, we introduce a new types for approximation rough digraphs depending on supra open digraphs. In addition, we present two various standpoints to define generalized membership relations, and state the implication between it, to classify the digraphs and help for measure exactness and roughness of digraphs. On the other hand, we define several kinds of fuzzy digraphs. We also introduce a topological space, which is induced by reflexive graph and tolerance graphs, such that the graph may be infinite. Furthermore, we offered some properties of th