In this study, flow-based routing model is investigated. The aim of this study is to increase scalability of flow control, routing and network resources solutions, as well as to improve Quality of Service and performance of the whole system. A method of hierarchical routing is proposed. The goal coordination method alsoused in this paper. Two routing models (model with quadratic objective function and model with traffic engineering) were fully analyzed. The basic functions of the hierarchical routing model levels based on goal coordination method were addressed Both models’ convergence is also explained. The dependence of the coordination iterations number on the packet flow rates for both models is graphically shown. The results shows

<p>Analyzing X-rays and computed tomography-scan (CT scan) images using a convolutional neural network (CNN) method is a very interesting subject, especially after coronavirus disease 2019 (COVID-19) pandemic. In this paper, a study is made on 423 patients’ CT scan images from Al-Kadhimiya (Madenat Al Emammain Al Kadhmain) hospital in Baghdad, Iraq, to diagnose if they have COVID or not using CNN. The total data being tested has 15000 CT-scan images chosen in a specific way to give a correct diagnosis. The activation function used in this research is the wavelet function, which differs from CNN activation functions. The convolutional wavelet neural network (CWNN) model proposed in this paper is compared with regular convol

     In recent years images have been used widely by online social networks providers or numerous organizations such as governments, police departments, colleges, universities, and private companies. It held in vast databases. Thus, efficient storage of such images is advantageous and its compression is an appealing application. Image compression generally represents the significant image information compactly with a smaller size of bytes while insignificant image information (redundancy) already been removed for this reason image compression has an important role in data transfer and storage especially due to the data explosion that is increasing significantly. It is a challenging task since there are highly complex unknown correlat

We introduce some new generalizations of some definitions which are, supra closure converge to a point, supra closure directed toward a set, almost supra converges to a set, almost supra cluster point, a set supra H-closed relative, supra closure continuous functions, supra weakly continuous functions, supra compact functions, supra rigid a set, almost supra closed functions and supra perfect functions. And we state and prove several results concerning it

Fuzzy Based Clustering for Grayscale Image Steganalysis

        In our research, we introduced new concepts, namely ^*and **-light mappings, after we knew ^*and **-totally disconnected mappings through the use of -open sets.

Many examples, facts, relationships and results have been given to support our work.

Design sampling plan was and still one of most importance subjects because it give lowest cost  comparing with others, time live statistical distribution should be known to give best estimators for  parameters of sampling plan and get best sampling plan.

Research dell with design sampling plan when live time distribution follow Logistic distribution with () as location and shape parameters, using these information can help us getting (number of groups, sample size) associated with reject or accept the Lot

Experimental results for simulated data shows the least number of groups and sample size needs to reject or accept the Lot with certain probability of

   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.

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com