The main aim of this paper is to use the notion  which was introduced in [1], to offered new classes of separation axioms in ideal spaces. So, we offered new type of notions of convergence in ideal spaces via the set. Relations among several types of separation axioms that offered were explained.

The purpose of this paper is to introduce and prove some coupled coincidence fixed point theorems for self mappings satisfying -contractive condition with rational expressions on complete partially ordered metric spaces involving altering distance functions with mixed monotone property of the mapping. Our results improve and unify a multitude of coupled fixed point theorems and generalize some recent results in partially ordered metric space. An example is given to show the validity of our main result. 

  In this paper, the concept of contraction mapping on a -metric space is extended with a consideration on local contraction.  As a result, two fixed point theorems were proved for contraction on a closed ball in a complete -metric space.

The significance of the work is to introduce the new class of open sets, which is said Ǥ- -open set with some of properties. Then clarify how to calculate the boundary area for these sets using the upper and lower approximation and obtain the best accuracy.

Adsorption and ion exchange are examples of fixed-bed sorption processes that show transient behavior. This means that differential equations are needed to design them. As a result, numerical methods are commonly utilized to solve these equations. The solution frequently used in analytical methods is called the Thomas solution. Thomas gave a complete solution that adds a nonlinear equilibrium relationship that depends on second-order reaction kinetics. A computational approach was devised to solve the Thomas model. The Thomas model's validity was established by conducting three distinct sets of experiments. The first entails the adsorption of acetic acid from the air through the utilization of activated carbon. Following

This paper presents a hybrid approach for solving null values problem; it hybridizes rough set theory with intelligent swarm algorithm. The proposed approach is a supervised learning model. A large set of complete data called learning data is used to find the decision rule sets that then have been used in solving the incomplete data problem. The intelligent swarm algorithm is used for feature selection which represents bees algorithm as heuristic search algorithm combined with rough set theory as evaluation function. Also another feature selection algorithm called ID3 is presented, it works as statistical algorithm instead of intelligent algorithm. A comparison between those two approaches is made in their performance for null values estima