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.
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
Abstract
Research title: The legal ruling of advice.
This research deals with the topic of advice, as the research included the following:
Preamble: I explained in it the meaning of advice in the Qur’an and Sunnah, and that what is meant by it is a good performance of the duty, then explaining its importance, importing it, and the difference between advice and what is similar to it, from enjoining good, denial, reproach and reprimand, backbiting and the will.
The first topic: It dealt with the ruling on advice, whether it is recommended or disliked, or forbidden, because what is meant by it is to give advice to others may be an obligation in kind, or it may be desirable or dislike
... Show MoreThroughout 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.
The main goal of this paper is to introduce and study a new concept named d*-supplemented which can be considered as a generalization of W- supplemented modules and d-hollow module. Also, we introduce a d*-supplement submodule. Many relationships of d*-supplemented modules are studied. Especially, we give characterizations of d*-supplemented modules and relationship between this kind of modules and other kind modules for example every d-hollow (d-local) module is d*-supplemented and by an example we show that the converse is not true.
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.
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.
The aim of this paper is to introduces and study the concept of CSO-compact space via the notation of simply-open sets as well as to investigate their relationship to some well known classes of topological spaces and give some of his properties.
In the present paper, a simply* compact spaces was introduced it defined over simply*- open set previous knowledge and we study the relation between the simply* separation axioms and the compactness, in addition to introduce a new types of functions known as 𝛼𝑆 𝑀∗ _irresolte , 𝛼𝑆 𝑀∗ __𝑐𝑜𝑛𝑡𝑖𝑛𝑢𝑜𝑢𝑠 and 𝑅 𝑆 𝑀∗ _ continuous, which are defined between two topological spaces.
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.
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.