A novel method for Network Intrusion Detection System (NIDS) has been proposed, based on the concept of how DNA sequence detects disease as both domains have similar conceptual method of detection. Three important steps have been proposed to apply DNA sequence for NIDS: convert the network traffic data into a form of DNA sequence using Cryptography encoding method; discover patterns of Short Tandem Repeats (STR) sequence for each network traffic attack using Teiresias algorithm; and conduct classification process depends upon STR sequence based on Horspool algorithm. 10% KDD Cup 1999 data set is used for training phase. Correct KDD Cup 1999 data set is used for testing phase to evaluate the proposed method. The current experiment results sh

Fungi produce a series of toxic compounds on corn, especially Fumonisin B1 (FB1) toxin produced by Fusarium spp. and promoting cancer activity in humans and animals. This study aimed to the isolation and identification of fungi associated with local corn seeds and the detection for the presence of FB1 by using ELISA technique. Thirty samples of corn ears were collected from silos and markets in Baghdad city during the period from November 2018 to March 2019. The present study found that Fusarium was the dominant isolate among fungi in terms of the relative density 57.07%, followed by Aspergillus 31.17%, Rhizopus 3.36%, Alternaria 2.88%, Mucor 2.16%, Penicillium 1.92%, Trichothecium 0.96%, and Helminthosporium 0.48%. FB1 was detected in a

A novel technique Sumudu transform Adomian decomposition method (STADM), is employed to handle some kinds of nonlinear time-fractional equations. We demonstrate that this method finds the solution without discretization or restrictive assumptions. This method is efficient, simple to implement, and produces good results. The fractional derivative is described in the Caputo sense. The solutions are obtained using STADM, and the results show that the suggested technique is valid and applicable and provides a more refined convergent series solution. The MATLAB software carried out all the computations and graphics. Moreover, a graphical representation was made for the solution of some examples. For integer and fractional order problems, solutio

Carbon nanotubes were prepared by an arc-discharge method,
under different values of pressure of oxygen gas. The structure of
multi-walled carbon nanotubes powders has been characterized by
low-angle X-ray diffraction .The morphology of carbon nanotube
powder was examined by transmission electron microscope. The
capacitance-voltage and current- voltage (dark and illumination
current) characterization were measured under different values of
pressure (10-3, 10-4, 10-5) mbar of oxygen gas

In the framework of correlation method so-called coherent density fluctuation model (CDFM) the nucleon momentum distributions (NMD) of the ground state for some even mass nuclei of fp-shell like 50Cr, 52Cr and 54Cr isotopes are examined. Nucleon momentum distributions are expressed in terms of the fluctuation function (|f(x)|2) which is evaluated by means of the nucleon density distributions (NDD) of the nuclei and determined from theory and experiment. The main characteristic feature of the NMD obtained by CDFM is the existence of high-momentum components, for momenta k ≥ 2 fm−1. For completeness, also elastic electron scattering form factors, F(q) are evaluated within the same framework.

     In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm).  And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restr

The primary components of successful engineering projects are time, cost, and quality. The use of the ring footing ensures the presence of these elements. This investigation aims to find the optimum number of geogrid reinforcement layers under ring footing subjected to inclined loading. For this purpose, experimental models were used. The parameters were studied to find the optimum geogrid layers number, including the optimum geogrid layers spacing and the optimum geogrid layers number. The optimum geogrid layers spacing value is 0.5B. And as the load inclination angle increased, the tilting and the tilting improvement percent for the load inclination angles (5°,10°,15°) are (40%,28%, and 5%) respectively. The reduction percent of the

 In this work, plasma parameters such as (electron temperature (Te), electron density (ne), plasma frequency (fp) and Debye length (λD)) were studied using spectral analysis techniques. The spectrum of the plasma was recorded with different energy values, SnO2 and ZnO anesthetized at a different ratio (X = 0.2, 0.4 and 0.6) were recorded. Spectral study of this mixing in the air. The results showed electron density and electron temperature increase in zinc oxide: tin oxide alloy targets. It was located  that  The intensity of the lines increases in different laser peak powers when the laser peak power increases and then decreases when the force continues to increase.

     Solving problems via artificial intelligence techniques has widely prevailed in different aspects. Implementing artificial intelligence optimization algorithms for NP-hard problems is still challenging. In this manuscript, we work on implementing the Naked Mole-Rat Algorithm (NMRA) to solve the n-queens problems and overcome the challenge of applying NMRA to a discrete space set. An improvement of NMRA is applied using the aspect of local search in the Variable Neighborhood Search algorithm (VNS) with 2-opt and 3-opt. Introducing the Naked Mole Rat algorithm based on variable neighborhood search (NMRAVNS) to solve N-queens problems with different sizes. Finding the best solution or set of solutions within a plausible amount of t