In this essay, we utilize m - space to specify m_X-N-connected, m_X-N-hyper connected and m_X-N-locally connected spaces and some functions by exploiting the intelligible m_X-N-open set. Some instances and outcomes have been granted to boost our tasks.

     In this paper, we design a fuzzy neural network to solve fuzzy singularly perturbed Volterra integro-differential equation by using a High Performance Training Algorithm such as the Levenberge-Marqaurdt (TrianLM) and the sigmoid function of the hidden units which is the hyperbolic tangent activation function. A fuzzy trial solution to fuzzy singularly perturbed Volterra integro-differential equation is written as a sum of two components. The first component meets the fuzzy requirements, however, it does not have any fuzzy adjustable parameters. The second component is a feed-forward fuzzy neural network with fuzzy adjustable parameters. The proposed method is compared with the analytical solutions. We find that the proposed meth

The main aim of image compression is to reduce the its size to be able for transforming and storage, therefore many methods appeared to compress the image, one of these methods is "Multilayer Perceptron ". Multilayer Perceptron (MLP) method which is artificial neural network based on the Back-Propagation algorithm for compressing the image. In case this algorithm depends upon the number of neurons in the hidden layer only the above mentioned will not be quite enough to reach the desired results, then we have to take into consideration the standards which the compression process depend on to get the best results. We have trained a group of TIFF images with the size of (256*256)  in our research, compressed them by using MLP for each

Several authors have used ranking function for solving linear programming problem. In This paper is proposed two ranking function for solving fuzzy linear programming and compare these two approach with trapezoidal fuzzy number .The proposed approach is very easy to understand and it can applicable, also the data were chosen from general company distribution of dairy (Canon company) was proposed test approach and compare; This paper prove that the second proposed approach is better to give the results and satisfy the minimal cost using Q.M. Software

The aims of this thesis are to study the topological space; we introduce a new kind of perfect mappings, namely j-perfect mappings and j-ω-perfect mappings. Furthermore, we devoted to study the relationship between j-perfect mappings and j-ω-perfect mappings. Finally, certain theorems and characterization concerning these concepts are studied. On the other hand, we studied weakly/ strongly forms of ω-perfect mappings, namely -ω-perfect mappings, weakly -ω-perfect mappings and strongly-ω-perfect mappings; also, we investigate their fundamental properties. We devoted to study the relationship between weakly -ω-perfect mappings and strongly -ω-perfect mappings. As well as, some new generalizations of some definitions wh

     The primary purpose of this subject is to define new games in ideal spaces via set. The relationships between games that provided and the winning and losing strategy for any player were elucidated.

In this work we explain and discuss new notion of fibrewise topological spaces, calledfibrewise soft ideal topological spaces, Also, we show the notions of fibrewise closed soft ideal topological spaces, fibrewise open soft ideal topological spaces and fibrewise soft near ideal topological spaces.

In this work we define and study new concept of fibrewise topological spaces, namely fibrewise soft topological spaces, Also, we introduce the concepts of fibrewise closed soft topological spaces, fibrewise open soft topological spaces, fibrewise soft near compact spaces and fibrewise locally soft near compact spaces.

 An edge dominating set    of a graph  is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number  is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G.  The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin

In this research, the methods of Kernel estimator (nonparametric density estimator) were relied upon in estimating the two-response logistic regression, where the comparison was used between the method of Nadaraya-Watson and the method of Local Scoring algorithm, and optimal Smoothing parameter λ was estimated by the methods of Cross-validation and generalized Cross-validation, bandwidth optimal λ has a clear effect in the estimation process. It also has a key role in smoothing the curve as it approaches the real curve, and the goal of using the Kernel estimator is to modify the observations so that we can obtain estimators with characteristics close to the properties of real parameters, and based on medical data for patients with chro