The increasing complexity of assaults necessitates the use of innovative intrusion detection systems (IDS) to safeguard critical assets and data. There is a higher risk of cyberattacks like data breaches and unauthorised access since cloud services have been used more frequently. The project's goal is to find out how Artificial Intelligence (AI) could enhance the IDS's ability to identify and classify network traffic and identify anomalous activities. Online dangers could be identified with IDS. An intrusion detection system, or IDS, is required to keep networks secure. We must create efficient IDS for the cloud platform as well, since it is constantly growing and permeating more aspects of our daily life. However, using standard intrusion

     In this work, the detection of zinc (Zn) ions that cause water pollution is studied using the CSNPs- Linker-alkaloids compound that was prepared by linking extracted alkaloids from Iraqi Catharanthus roseus plant with Chitosan nanoparticles (CSNPs) using maleic anhydride. This compound is characterized by an X-ray diffractometer (XRD) which shows that it has an orthorhombic structure with crystallite size in the nano dimension. Zeta Potential results show that the CSNPs-Linker-alkaloids carried a positive charge of 54.4 mV, which means it possesses high stability.  The Fourier transform infrared spectroscopy (FTIR) shows a new distinct band at 1708.93 cm-1 due to C=O esterification. Scanning electron microscope (SEM) image

The compressive residual stresses generated by shot peening, is increased in a direct proportional way with shot peening time (SPT). For each metal, there is an optimum shot peening time (O.S.T) which gives the optimum fatigue life. This paper experimentally studied to optimize shot peening time of aluminium alloy 6061-T651 as well as using of and analysis of variance (ANOVA).

Two types of fatigue test specimens’ configuration were used, one without notch (smooth) and the other with a notch radius (1,25mm), each type was shot peened at different time. The (O.S.T) was experimentally estimated  to be 8 minutes reaching the surface stresses at maximum peak of -184.94 MPa.

A response surface methodology (RSM) is presen

MCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with order

The present study considers to confirming the applicability of flow with double-sided square lid driven cavity flow by using the lattice Boltzmann equation with moment-based boundary conditions for no slip boundaries.  The boundary conditions are applied over the hydrodynamic moments of the lattice Boltzmann equations locally at each node. The investigation is carried out numerically for both single and multiple relaxation time models. To simulate two-sided lid driven-cavity flow, the top and bottom walls are moving with constant velocity while other walls are stationary. Various Reynolds numbers are used in a range of 100 and up to 5000. The present method shows the effect of the moving boundaries on the two symmetrical cavities t

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C