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
Wed Mar 30 2022
Journal Name
Iraqi Journal Of Science
On Annihilator-Extending Modules
...Show More Authors

    Throughout this work we introduce the notion of Annihilator-closed submodules, and we give some basic properties of this concept. We also introduce a generalization for the Extending modules, namely Annihilator-extending modules. Some fundamental properties are presented as well as  we discuss the relation between this concept and some other related concepts.

Scopus (1)
Scopus Crossref
Publication Date
Sun Dec 05 2010
Journal Name
Baghdad Science Journal
ON M- Hollow modules
...Show More Authors

Let R be associative ring with identity and M is a non- zero unitary left module over R. M is called M- hollow if every maximal submodule of M is small submodule of M. In this paper we study the properties of this kind of modules.

View Publication Preview PDF
Crossref
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
Sun Mar 15 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

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 Oct 01 2014
Journal Name
Journal Of Economics And Administrative Sciences
ON DISCRETE WEIBULL DISTRIBUTION
...Show More Authors

Most of the Weibull models studied in the literature were appropriate for modelling a continuous random variable which assumes the variable takes on real values over the interval [0,∞]. One of the new studies in statistics is when the variables take on discrete values. The idea was first introduced by Nakagawa and Osaki, as they introduced discrete Weibull distribution with two shape parameters q and β where      0 < q < 1 and b > 0. Weibull models for modelling discrete random variables assume only non-negative integer values. Such models are useful for modelling for example; the number of cycles to failure when components are subjected to cyclical loading. Discrete Weibull models can be obta

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

Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
On Hereditarily Codiskcyclic Operators
...Show More Authors

Many codiskcyclic operators on infinite-dimensional separable Hilbert space do not satisfy the criterion of codiskcyclic operators. In this paper, a kind of codiskcyclic operators satisfying the criterion has been characterized, the equivalence between them has been discussed and the class of codiskcyclic operators satisfying their direct summand is codiskcyclic. Finally, this kind of operators is used to prove that every codiskcyclic operator satisfies the criterion if the general kernel is dense in the space.

View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Clarivate Crossref