In this paper, the botnet detection problem is defined as a feature selection problem and the genetic algorithm (GA) is used to search for the best significant combination of features from the entire search space of set of features. Furthermore, the Decision Tree (DT) classifier is used as an objective function to direct the ability of the proposed GA to locate the combination of features that can correctly classify the activities into normal traffics and botnet attacks. Two datasets namely the UNSW-NB15 and the Canadian Institute for Cybersecurity Intrusion Detection System 2017 (CICIDS2017), are used as evaluation datasets. The results reveal that the proposed DT-aware GA can effectively find the relevant features from the whole features set. Thus, it obtains efficient botnet detection results in terms of F-score, precision, detection rate, and number of relevant features, when compared with DT alone.
Tench is a cyprinid fish that has undergone human-induced translocations. The natural populations of the species are on the decline due to habitat loss and spawning grounds degradation. The genetic diversity of seven natural populations was investigated to establish the genetic knowledge base for successful conservation efforts and for selective breeding. Twelve microsatellite markers, the sequencing of a 615 bp section of mtDNA (Cytb) and PCR-RFLP analysis of two nuclear markers (Act) and (RpS7) were used to analyze the genetic variation and structure among 175 individuals. All microsatellite loci were found to have moderate levels of polymorphism. The pairwise Fst values between population pairings were moderate; the populations w
... Show MoreThe study was conducted at the fields of the Department of Horticulture and Landscape Gardening,College of Agriculture, University of Baghdad during the growing seasons of 2013- 2014 .forPerformance of Evaluation Vegetative growth and yield traits and estimate some important geneticparameter on seven selected breed of tomato which (S1-S7 ) Pure line. the results found significantdifferences between breeds in all study trails except clusters flowering number .S1 significantly plantlength which reached 227.3 .Also S1,S2 and S4 were significantly increased the number fruit for plant,Fruit weight Increased in S3 ,S6 and plant yield. Increased in S1, S4 ,S5. Genetic variation valueswere low in Floral clusters , TSS and fruit firmest and medium i
... Show MoreThe study was conducted at the fields of the Department of Horticulture and Landscape Gardening, College of Agriculture, University of Baghdad " Abu Ghraib" during the growing seasons 2013-2014 to Evaluate the Vegetative growth , yield traits and genetic parameter of some tomato mutants. Results showed significantly increased of plant height in M6-2 mutant 245cm in Comparison with M6- 3 130 cm . M6-4 mutant significantly increasing of floral clusters 13 . Mutant M6-3 showed significantly increasing the average of, fruit weight 125.9g and plant yield 7.17 kg.plant-1 as comparison with M6-2 which showed decreasing of average of fruit weight and plant yield 79.40g and 4.38 kg.plant-1 respectively. Also results showed the highest Genetic variat
... Show MoreIn this paper, the process of comparison between the tree regression model and the negative binomial regression. As these models included two types of statistical methods represented by the first type "non parameter statistic" which is the tree regression that aims to divide the data set into subgroups, and the second type is the "parameter statistic" of negative binomial regression, which is usually used when dealing with medical data, especially when dealing with large sample sizes. Comparison of these methods according to the average mean squares error (MSE) and using the simulation of the experiment and taking different sample
... Show MoreTraditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons
... Show MoreCredit card fraud has become an increasing problem due to the growing reliance on electronic payment systems and technological advances that have improved fraud techniques. Numerous financial institutions are looking for the best ways to leverage technological advancements to provide better services to their end users, and researchers used various protection methods to provide security and privacy for credit cards. Therefore, it is necessary to identify the challenges and the proposed solutions to address them. This review provides an overview of the most recent research on the detection of fraudulent credit card transactions to protect those transactions from tampering or improper use, which includes imbalance classes, c
... Show More