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.
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.
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.
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
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 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 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.
Weibull Distribution is one of most important distribution and it is mainly used in reliability and in distribution of life time. The study handled two parameter and three-parameter Weibull Distribution in addition to five –parameter Bi-Weibull distribution. The latter being very new and was not mentioned before in many of the previous references. This distribution depends on both the two parameter and the three –parameter Weibull distributions by using the scale parameter (α) and the shape parameter (b) in the first and adding the location parameter (g)to the second and then joining them together to produce a distribution with five parameters.
... Show MoreA gamma T_ pure sub-module also the intersection property for gamma T_pure sub-modules have been studied in this action. Different descriptions and discuss some ownership, as Γ-module Z owns the TΓ_pure intersection property if and only if (J2 ΓK ∩ J^2 ΓF)=J^2 Γ(K ∩ F) for each Γ-ideal J and for all TΓ_pure K, and F in Z Q/P is TΓ_pure sub-module in Z/P, if P in Q.
In this paper we study the notion of preradical on some subcategories of the category of semimodules and homomorphisms of semimodules.
Since some of the known preradicals on modules fail to satisfy the conditions of preradicals, if the category of modules was extended to semimodules, it is necessary to investigate some subcategories of semimodules, like the category of subtractive semimodules with homomorphisms and the category of subtractive semimodules with ҽҟ-regular homomorphisms.