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

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 is concerned with introducing and studying the o-space by using out degree system (resp. i-space by using in degree system) which are the core concept in this paper. In addition, the m-lower approximations, the m-upper approximations and ospace and i-space. Furthermore, we introduce near supraopen (near supraclosed) d. g.'s. Finally, the supra-lower approximation, supraupper approximation, supra-accuracy are defined and some of its properties are investigated.

In this paper, a simple fast lossless image compression method is introduced for compressing medical images, it is based on integrates multiresolution coding along with polynomial approximation of linear based to decompose image signal followed by efficient coding. The test results indicate that the suggested method can lead to promising performance due to flexibility in overcoming the limitations or restrictions of the model order length and extra overhead information required compared to traditional predictive coding techniques.

This paper deals with founding an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to the convex polynomials by means of weighted moduli of smoothness of fractional order  , ( , ) p f t . In addition we prove some properties of weighted moduli of smoothness of fractional order.