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

In this study an experimental work was done to study the possibility of using aluminum rubbish material as a coagulant to remove the colloidal particles from oily wastewater by dissolving this rubbish in sodium hydroxide solution. The experiments were carried out on simulated oily wastewater that was prepared at different oil concentrations and hardness levels (50, 250, 500, and 1000) ppm oil for (2000, 2500, 3000, and 3500) ppm CaCo₃ respectively. The initial turbidity values were (203, 290, 770, and 1306) NTU, while the minimum values of turbidity that have been gained from the experiments in NTU units were (1.67, 1.95, 2.10, and 4.01) at best sodium aluminate dosages in milliliters (12, 20, 24, and 28) for

Graph  is a tool that can be used to simplify and solve network problems. Domination is a typical network problem that graph theory is well suited for. A subset of nodes in any network is called dominating if every node is contained in this subset, or is connected to a node in it via an edge. Because of the importance of domination in different areas, variant types of domination have been introduced according to the purpose they are used for. In this paper, two domination parameters the first is the restrained and the second is secure domination have been chosn. The secure domination, and some types of restrained domination in one type of trees is called complete ary tree  are determined.

Implementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.

In light of accelerating environmental degradation, the transition to a green economy is an imperative for achieving sustainable development. This study provides a critical analysis of the international legal and institutional framework governing this transition, revealing a significant gap between normative developments and the institutional framework on one hand, and their practical implementation on the other. The transition faces legal obstacles, including reliance on non-binding voluntary commitments and conflicts between environmental obligations and global trade and investment rules. It also reveals a significant financing gap, as financial flows to developing countries continue to lag behind commitments, in add

In this paper we present the theoretical foundation of forward error analysis of numerical algorithms under;• Approximations in "built-in" functions.• Rounding errors in arithmetic floating-point operations.• Perturbations of data.The error analysis is based on linearization method. The fundamental tools of the forward error analysis are system of linear absolute and relative a prior and a posteriori error equations and associated condition numbers constituting optimal of possible cumulative round – off errors. The condition numbers enable simple general, quantitative bounds definitions of numerical stability. The theoretical results have been applied a Gaussian elimination, and have proved to be very effective means of both a prior