The way used to estimate the fuzzy reliability differs according to the nature of the information of failure time which has been dealt in this research.The information of failure times has no probable distribution to explain it , in addition it has fuzzy quality.The research includes fuzzy reliability estimation of three periods ,the first one from 1986 to 2013,the second one from 2013 to 2033 while the third one from 2033 to 2066 .Four failure time have been chosen to identify the membership function of fuzzy trapezoid represented in the pervious years after taking in consideration the estimation of most researchers, proffional    geologists and the technician who is incharge of maintaining of Mosul Dam project. B

The research aims to find approximate solutions for two dimensions Fredholm linear integral equation. Using the two-variables of the Bernstein polynomials we find a solution to the approximate linear integral equation of the type two dimensions. Two examples have been discussed in detail.

The huge amount of documents in the internet led to the rapid need of text classification (TC). TC is used to organize these text documents. In this research paper, a new model is based on Extreme Machine learning (EML) is used. The proposed model consists of many phases including: preprocessing, feature extraction, Multiple Linear Regression (MLR) and ELM. The basic idea of the proposed model is built upon the calculation of feature weights by using MLR. These feature weights with the extracted features introduced as an input to the ELM that produced weighted Extreme Learning Machine (WELM). The results showed   a great competence of the proposed WELM compared to the ELM. 

   In this paper we obtain some statistical approximation results for a general class of maxproduct operators including the paused linear positive operators.

In contemporary cities, the expansion of the use of vehicles has led to the deterioration of the urban environment. To counter this, many concepts and strategies emerged that attempted to regulate mobility in cities and limit its effects. The concept of a "complete street" is one of the modern trends concerned with diversifying means of transportation and reducing the disadvantages of mechanical transportation methods This paper discusses the role that complete streets can play in developing the urban environment in the Alyarmok District of Baghdad, which suffers from traffic congestion and its associated problems.In this study, 104 people were surveyed in the Alyarmok region, and the linear regression method was used to analyze their op

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

        The Rivest–Shamir–Adleman (RSA) and the Diffie-Hellman (DH) key exchange are famous methods for encryption. These methods  depended on selecting the primes p and q in order  to be secure enough . This paper shows that the named methods used the primes which are found by some arithmetical function .In the other sense, no need to think about getting primes p and q and how they are secure enough, since the arithmetical function enable to build the primes in such complicated way to be secure. Moreover, this article   gives  new construction  of the  RSA  algorithm and DH key  exchange using the

primes p,qfrom areal number x.

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i