Software Defined Network (SDN) is a new technology that separate the ‎control plane from the data plane. SDN provides a choice in automation and ‎programmability faster than traditional network. It supports the ‎Quality of Service (QoS) for video surveillance application. One of most ‎significant issues in video surveillance is how to find the best path for routing the packets ‎between the source (IP cameras) and destination (monitoring center). The ‎video surveillance system requires fast transmission and reliable delivery ‎and high QoS. To improve the QoS and to achieve the optimal path, the ‎SDN architecture is used in this paper. In addition, different routing algorithms are ‎used with different steps. First, we eva

Seven fish species were collected from the drainage network at Al-Madaen region, south of
Baghdad with the aid of a cast net during the period from March to August 1993. These fishes
were infected with 22 parasite species (seven sporozoans, three ciliated protozoans, seven
monogeneans, two nematodes, one acanthocephalan and two crustaceans) and one fungus
species. Among such parasites, Chloromyxum wardi and Cystidicola sp. are reported here for
the first time in Iraq. In addition, 11 new host records are added to the list of parasites of
fishes of Iraq.

In recent years, the migration of the computational workload to computational clouds has attracted intruders to target and exploit cloud networks internally and externally. The investigation of such hazardous network attacks in the cloud network requires comprehensive network forensics methods (NFM) to identify the source of the attack. However, cloud computing lacks NFM to identify the network attacks that affect various cloud resources by disseminating through cloud networks. In this paper, the study is motivated by the need to find the applicability of current (C-NFMs) for cloud networks of the cloud computing. The applicability is evaluated based on strengths, weaknesses, opportunities, and threats (SWOT) to outlook the cloud network. T

This study aimed to investigate the incorporation of recycled waste compact discs (WCDs) powder in concrete mixes to replace the fine aggregate by 5%, 10%, 15% and 20%. Compared to the reference concrete mix, results revealed that using WCDs powder in concrete mixes improved the workability and the dry density. The results demonstrated that the compressive, flexural, and split tensile strengths values for the WCDs-modified concrete mixes showed tendency to increase above the reference mix. However, at 28 days curing age, the strengths values for WCDs-modified concrete mixes were comparable to those for the reference mix. The leaching test revealed that none of the WCDs constituents was detected in the leachant after 180 days. The

The m-consecutive-k-out-of-n: F linear and circular system consists of n sequentially connected components; the components are ordered on a line or a circle; it fails if there are at least m non-overlapping runs of consecutive-k failed components. This paper proposes the reliability and failure probability functions for both linearly and circularly m-consecutive-k-out-of-n: F systems. More precisely, the failure states of the system components are separated into two collections (the working and the failure collections); where each one is defined as a collection of finite mutual disjoint classes of the system states. Illustrative example is provided.

Background: Dimensional changes of acrylic denture bases after polymerization results in need for further adjustments or even ends with technical failure of the finished dentures. The purpose of this study was to estimate the linear dimensional changes for different palatal depths when using multiple investment materials and polymerization techniques. Materials and methods: Ninety upper complete denture bases were constructed for this study. They were divided into two main groups according to the polymerization methods: conventional water bath and experimental autoclave (short and long cycles). Each main group was further subdivided into three subgroups according to the palatal depth (shallow, medium and deep). Furthermore, for each palatal

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.