The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

Abstract This paper is devoted to introduce weak and strong forms of fibrewise fuzzy u-topological spaces, namely the fibrewise fuzzy q-u-topological spaces, weakly fibrewise fuzzy q-u-topological spaces and strongly fibrewise fuzzy q-utopological spaces. Also, Several characterizations and properties of this class are also given as well. Finally, we focused on studying the relationship between weakly fibrewise fuzzy q-u-topological spaces and strongly fibrewise fuzzy q-utopological spaces.

This paper is devoted to introduce weak and strong forms of fibrewise fuzzy ω-topological spaces, namely the fibrewise fuzzy -ω-topological spaces, weakly fibrewise fuzzy -ω-topological spaces and strongly fibrewise fuzzy -ω- topological spaces. Also, Several characterizations and properties of this class are also given as well. Finally, we focused on studying the relationship between weakly fibrewise fuzzy -ω-topological spaces and strongly fibrewise fuzzy -ω-topological spaces.

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results

The x-ray fluorescence (XRF) of Znpc molecule with (flow of Ar) and Znpc molecule with (grow in N2) showed two peaks at (8.5and 9.5 Kv) referring to orbital transition ) K?-shell & K?-shell) respectively. The study of x-ray diffraction (XRD) where it was observed good growth of the crystal structure as a needle by the sublimation technique with a ?-phase of (monoclinic structure ) . Using Bragg equation the value of the interdistance of the crystalline plane (d-value) were calculated. We noticed good similarity with like once in the American Standards for Testing Material (ASTM) .Powder Diffraction File (PDF) Program was used to ensure the information obtained from (ASTM) . The output of (PDF) was compared with celn program, where the val