Software-defined networks (SDN) have a centralized control architecture that makes them a tempting target for cyber attackers. One of the major threats is distributed denial of service (DDoS) attacks. It aims to exhaust network resources to make its services unavailable to legitimate users. DDoS attack detection based on machine learning algorithms is considered one of the most used techniques in SDN security. In this paper, four machine learning techniques (Random Forest, K-nearest neighbors, Naive Bayes, and Logistic Regression) have been tested to detect DDoS attacks. Also, a mitigation technique has been used to eliminate the attack effect on SDN. RF and KNN were selected because of their high accuracy results. Three types of ne

In this research, the problem of multi- objective modal transport was formulated with mixed constraints to find the optimal solution. The foggy approach of the Multi-objective Transfer Model (MOTP) was applied. There are three objectives to reduce costs to the minimum cost of transportation, administrative cost and cost of the goods. The linear membership function, the Exponential membership function, and the Hyperbolic membership function. Where the proposed model was used in the General Company for the manufacture of grain to reduce the cost of transport to the minimum and to find the best plan to transfer the product according to the restrictions imposed on the model.

The problem of the research lies in choosing agility tests suitable to the test taker to observe the relative changes in some players. In addition to that, there are a lot of agility tests that lack special test models that coordinate gender and age. This means the youth basketball player on one hand and time and distance in applying the tests on the other. The importance of the research lies in designing agility tests for youth basketball players to achieve variations in tests a matter that will benefit coaches in their training. The subjects of the research were (30) youth basketball players from the specialized school of the National Center that sponsor gifted basketball players in Baghdad for the season 2014 – 2015. The data was colle

Longer follow-up defense , one of basketball skills that require the team collective action involving active part and consistent to acquire bouncing balls even not be a chance for members of the team striker acquisition rebounding from the target area and bring it back again , which reduces the chances of scoring, and it enables team members defender of the performance of fast attack and score points for being the increase your chances of success.In light of the foregoing, reflected the importance of research in achieving the objective basis of skill tests that require a circumstance similar to the circumstances of the game with the standard operating procedures for the registration, and that the validity judged by consistency between tests

In this paper, we deal with the problem of general matching of two images one of them has experienced geometrical transformations, to find the correspondence between two images. We develop the invariant moments for traditional techniques (moments of inertia) with new approach to enhance the performance for these methods. We test various projections directional moments, to extract the difference between Block Distance Moment (BDM) and evaluate their reliability. Three adaptive strategies are shown for projections directional moments, that are raster (vertical and horizontal) projection, Fan-Bean projection and new projection procedure that is the square projection method. Our paper started with the description of a new algorithm that is low

      It is frequently asserted that an advantage of a binary search tree implementation of a set over linked list implementation is that for reasonably well balanced binary search trees the average search time (to discover whether or not a particular element is present in the set) is O(log N) to the base 2 where N is the number of element in the set (the size of the tree).  This paper presents an experiment for measuring and comparing the obtained binary search tree time with the expected time (theoretical), this experiment proved the correctness of the hypothesis, the experiment is carried out using a program in turbo Pascal with recursion technique implementation and a statistical method  to prove th