Distributed Denial of Service (DDoS) attacks on Web-based services have grown in both number and sophistication with the rise of advanced wireless technology and modern computing paradigms. Detecting these attacks in the sea of communication packets is very important. There were a lot of DDoS attacks that were directed at the network and transport layers at first. During the past few years, attackers have changed their strategies to try to get into the application layer. The application layer attacks could be more harmful and stealthier because the attack traffic and the normal traffic flows cannot be told apart. Distributed attacks are hard to fight because they can affect real computing resources as well as network bandwidth. DDoS attacks

This paper is concerned with introducing and studying the new approximation operators based on a finite family of d. g. 'swhich are the core concept in this paper. In addition, we study generalization of some Pawlak's concepts and we offer generalize the definition of accuracy measure of approximations by using a finite family of d. g. 's.

An investigation of the quadrupole deformation of Kr, Sr, Zr, and Mo isotopes has been conducted using the HFB method and SLy4 Skyrme parameterization. The primary role of occupancy of single particle state 2d5/2 in the existence of the weakly bound structure around N=50 is probed. Shell gaps are performed using a few other calculations for the doubly magic number 100Sn using different Skyrme parameterizations. We explore the interplays among neutron pairing strength and neutron density profile in two dimensions, along with the deformations of 100Sn.

HR Ghanim, GA Abdulhassan, International Journal of Early Childhood Special Education, 2022

Community structures are fundamental in understanding the structure and functionality of complex networks. Different optimization algorithms, including both single-objective and multi-objective approaches, have been employed to address the challenge of community detection. Recently, multi-objective evolutionary algorithms (MOEAs) have attracted many researchers to identify communities in static networks. Many algorithms have been proposed to find a solution that achieves a trade-off between exploring new areas of the solution space and improving the quality of existing solutions. In this trade-off is crucial; whereas exploitation improves existing solutions, it may fail to find better solutions from insufficiently explored regions o