In this paper, the C̆ech fuzzy soft closure spaces are defined and their basic properties are studied. Closed (respectively, open) fuzzy soft sets is defined in C̆ech fuzzy-soft closure spaces. It has been shown that for each C̆ech fuzzy soft closure space there is an associated fuzzy soft topological space. In addition, the concepts of a subspace and a sum are defined in C̆ech fuzzy soft closure space. Finally, fuzzy soft continuous (respectively, open and closed) mapping between C̆ech fuzzy soft closure spaces are introduced. Mathematics Subject Classification: 54A40, 54B05, 54C05.

The mixed-spin ferrimagnetic Ising system consists of two-dimensional sublattices A and B with spin values and respectively .By used the mean-field approximation MFA of Ising model to find magnetism( ).In order to determined the best stabile magnetism , Gibbs free energy employ a variational method based on the Bogoliubov inequality .The ground-state (Phase diagram) structure of our system can easily be determined at , we find six phases with different spins values depend on the effect of a single-ion anisotropies .these lead to determined the second , first orders transition ,and the tricritical points as well as the compensation phenomenon .

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

The issue of epistemology is one of the theological issues that were and still is a relentless pursuit of knowledge, knowing the true knowledge of certainty. Therefore, it formed a main focus because of its great importance expressing the deep desire of the human soul to explore the self and reality and answer all the questions that it may raise. Knowledge is the highest function. For man to exist.

Therefore, the establishment of epistemology was general in knowledge, a characteristic that was distinguished, as it is an ancient and renewed subject that is still being raised and raised, although there are many methods of treating it and sacred solutions to it. To finally prove its potentia

The dependence of the energy losses or the stopping power for the ion contribution in D- T hot plasma fuels upon the corresponding energies and the related penetrating factorare arrive by using by a theoretical approximation models. In this work we reach a compatible agreement between our results and the corresponding experimental results.

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).

The regressor-based adaptive control is useful for controlling robotic systems with uncertain parameters but with known structure of robot dynamics. Unmodeled dynamics could lead to instability problems unless modification of control law is used. In addition, exact calculation of regressor for robots with more than 6 degrees of freedom is hard to be calculated, and the task could be more complex for robots. Whereas the adaptive approximation control is a powerful tool for controlling robotic systems with unmodeled dynamics. The local (partitioned) approximation-based adaptive control includes representation of the uncertain matrices and vectors in the robot model as finite combinations of basis functions. Update laws for the weighting matri