Preferred Language
Articles
/
WBbCvYoBVTCNdQwCM6Q9
Features Selection for Intrusion Detection System Based on DNA Encoding
...Show More Authors

Intrusion detection systems detect attacks inside computers and networks, where the detection of the attacks must be in fast time and high rate. Various methods proposed achieved high detection rate, this was done either by improving the algorithm or hybridizing with another algorithm. However, they are suffering from the time, especially after the improvement of the algorithm and dealing with large traffic data. On the other hand, past researches have been successfully applied to the DNA sequences detection approaches for intrusion detection system; the achieved detection rate results were very low, on other hand, the processing time was fast. Also, feature selection used to reduce the computation and complexity lead to speed up the system. A new features selection method is proposed based on DNA encoding and on DNA keys positions. The current system has three phases, the first phase, is called pre-processing phase, which is used to extract the keys and their positions, the second phase is training phase; the main goal of this phase is to select features based on the key positions that gained from pre-processing phase, and the third phase is the testing phase, which classified the network traffic records as either normal or attack by using specific features. The performance is calculated based on the detection rate, false alarm rate, accuracy, and also on the time that include both encoding time and matching time. All these results are based on using two or three keys, and it is evaluated by using two datasets, namely, KDD Cup 99, and NSL-KDD. The achieved detection rate, false alarm rate, accuracy, encoding time, and matching time for all corrected KDD Cup records (311,029 records) by using two and three keys are equal to 96.97, 33.67, 91%, 325, 13 s, and 92.74, 7.41, 92.71%, 325 and 20 s, respectively. The results for detection rate, false alarm rate, accuracy, encoding time, and matching time for all NSL-KDD records (22,544 records) by using two and three keys are equal to 89.34, 28.94, 81.46%, 20, 1 s and 82.93, 11.40, 85.37%, 20 and 1 s, respectively. The proposed system is evaluated and compared with previous systems and these comparisons are done based on encoding time and matching time. The outcomes showed that the detection results of the present system are faster than the previous ones.

Scopus
Publication Date
Mon May 01 2017
Journal Name
2017 Second International Conference On Fog And Mobile Edge Computing (fmec)
Smart Virtual eNB (SVeNB) for 5G mobile communication
...Show More Authors

View Publication
Scopus (2)
Crossref (2)
Scopus Crossref
Publication Date
Wed Jan 01 2020
Journal Name
Iraqi Geological Journal
Reservoir modeling for mishrif formation in Nasiriyah oilfield
...Show More Authors

Scopus (6)
Scopus
Publication Date
Tue Jan 01 2019
Journal Name
Cpwr
Development of a workforce sustainability model for construction
...Show More Authors

Publication Date
Sun Jun 12 2011
Journal Name
Baghdad Science Journal
Study of optical properties for Ge - GaAs Heterojunction
...Show More Authors

View Publication Preview PDF
Crossref
Publication Date
Fri May 01 2020
Journal Name
Journal Of Physics: Conference Series
Bayesian Inference for Reliability Function of Gompertz Distribution
...Show More Authors
Abstract<p>In this paper, some Bayes estimators of the reliability function of Gompertz distribution have been derived based on generalized weighted loss function. In order to get a best understanding of the behaviour of Bayesian estimators, a non-informative prior as well as an informative prior represented by exponential distribution is considered. Monte-Carlo simulation have been employed to compare the performance of different estimates for the reliability function of Gompertz distribution based on Integrated mean squared errors. It was found that Bayes estimators with exponential prior information under the generalized weighted loss function were generally better than the estimators based o</p> ... Show More
View Publication Preview PDF
Scopus (1)
Crossref (1)
Scopus Crossref
Publication Date
Wed Jan 01 2020
Journal Name
Arab Journal Of Basic And Applied Sciences
Reliable iterative methods for 1D Swift–Hohenberg equation
...Show More Authors

View Publication
Crossref (4)
Crossref
Publication Date
Fri Apr 03 2020
Journal Name
Technology Reports Of Kansai University
Results for Some Groups of PSL (2, F)
...Show More Authors

Publication Date
Sun Dec 07 2008
Journal Name
Baghdad Science Journal
Optimal Color Model for Information Hidingin Color Images
...Show More Authors

In present work the effort has been put in finding the most suitable color model for the application of information hiding in color images. We test the most commonly used color models; RGB, YIQ, YUV, YCbCr1 and YCbCr2. The same procedures of embedding, detection and evaluation were applied to find which color model is most appropriate for information hiding. The new in this work, we take into consideration the value of errors that generated during transformations among color models. The results show YUV and YIQ color models are the best for information hiding in color images.

View Publication Preview PDF
Crossref
Publication Date
Mon Jan 01 2024
Journal Name
Iraqi Journal Of Applied Physics
Fabrication of PAN:Cellulose Membrane for Oil/Water Separation
...Show More Authors

In this study, we fabricated nanofiltration membranes using the electrospinning technique, employing pure PAN and a mixed matrix of PAN/HPMC. The PAN nanofibrous membranes with a concentration of 13wt% were prepared and blended with different concentrations of HPMC in the solvent N, N-Dimethylformamide (DMF). We conducted a comprehensive analysis of these membranes' surface morphology, chemical composition, wettability, and porosity and compared the results. The findings indicated that the inclusion of HPMC in the PAN membranes led to a reduction in surface porosity and fiber size. The contact angle decreased, indicating increased surface hydrophilicity, which can enhance flux and reduce fouling tendencies. Subsequently, we evaluated the e

... Show More
Scopus
Publication Date
Sun Jan 01 2023
Journal Name
Journal Of Discrete Mathematical Sciences And Cryptography
A4-graph for the twisted group 3D4 (3)
...Show More Authors

Assume that G is a finite group and X = tG where t is non-identity element with t3 = 1. The simple graph with node set being X such that a, b ∈ X, are adjacent if ab-1 is an involution element, is called the A4-graph, and designated by A4(G, X). In this article, the construction of A4(G, X) is analyzed for G is the twisted group of Lie type 3D4(3).

View Publication
Scopus Clarivate Crossref