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
Thu Sep 13 2018
Journal Name
Baghdad Science Journal
On Soft Turning Points
...Show More Authors

The soft sets were known since 1999, and because of their wide applications and their great flexibility to solve the problems, we used these concepts to define new types of soft limit points, that we called soft turning points.Finally, we used these points to define new types of soft separation axioms and we study their properties.

View Publication Preview PDF
Scopus (18)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Sun May 17 2020
Journal Name
Iraqi Journal Of Science
On Semiannahilator Supplement Submodules
...Show More Authors

Let R be associative; ring; with an identity and let D be unitary left R- module; . In this work we present semiannihilator; supplement submodule as a generalization of R-a- supplement submodule, Let U and V be submodules of an R-module D if D=U+V and whenever Y≤ V and D=U+Y, then annY≪R;. We also introduce the the concept of semiannihilator -supplemented ;modules and semiannihilator weak; supplemented modules, and we give some basic properties of this conseptes.

Scopus (2)
Scopus Crossref
Publication Date
Thu Dec 08 2022
Journal Name
Aequationes Mathematicae
On graceful antimagic graphs
...Show More Authors

View Publication
Scopus (3)
Scopus Clarivate Crossref
Publication Date
Mon Apr 04 2016
Journal Name
Journal Of Advances In Mathematics
ON CJ-TOPLOGICAL SPACES
...Show More Authors

Publication Date
Fri Jan 01 1999
Journal Name
University Of Baghdad
On the Equiconvergence Theorem
...Show More Authors

Publication Date
Fri May 01 2020
Journal Name
Journal Of Physics: Conference Series
On J–Lifting Modules
...Show More Authors
Abstract<p>Let R be a ring with identity and M is a unitary left R–module. M is called J–lifting module if for every submodule N of M, there exists a submodule K of N such that <inline-formula> <tex-math><?CDATA ${\rm{M}} = {\rm{K}} \oplus \mathop {\rm{K}}\limits^\prime,\>\mathop {\rm{K}}\limits^\prime \subseteq {\rm{M}}$?></tex-math> <math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="block" overflow="scroll"> <mrow> <mi mathvariant="normal">M</mi> <mo>=</mo> <mi mathvariant="normal">K</mi></mrow></math></inline-formula></p> ... Show More
View Publication
Scopus (4)
Scopus Crossref
Publication Date
Wed Mar 10 2021
Journal Name
Baghdad Science Journal
ON G-OPEN SET
...Show More Authors

A new class of generalized open sets in a topological space, called G-open sets, is introduced and studied. This class contains all semi-open, preopen, b-open and semi-preopen sets. It is proved that the topology generated by G-open sets contains the topology generated by preopen,b-open and semi-preopen sets respectively.

View Publication Preview PDF
Crossref
Publication Date
Sun Jan 01 2017
Journal Name
International Mathematical Forum
On mildly-regular space
...Show More Authors

In this paper mildly-regular topological space was introduced via the concept of mildly g-open sets. Many properties of mildly - regular space are investigated and the interactions between mildly-regular space and certain types of topological spaces are considered. Also the concept of strong mildly-regular space was introduced and a main theorem on this space was proved.

View Publication
Crossref
Publication Date
Sun Mar 07 2010
Journal Name
Baghdad Science Journal
On Semi-?-Connected Subspace
...Show More Authors

In this paper, the concept of semi-?-open set will be used to define a new kind of strongly connectedness on a topological subspace namely "semi-?-connectedness". Moreover, we prove that semi-?-connectedness property is a topological property and give an example to show that semi-?-connectedness property is not a hereditary property. Also, we prove thate semi-?-irresolute image of a semi-?-connected space is a semi-?-connected space.

View Publication Preview PDF
Crossref
Publication Date
Sun Mar 02 2008
Journal Name
Baghdad Science Journal
On New Algebraic Systems
...Show More Authors

The purpose of this paper is to give some results theorems , propositions and corollaries concerning new algebraic systems flower , garden and farm with accustomed algebraic systems groupoid , group and ring.

View Publication Preview PDF
Crossref