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.
Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.
Roof in the Iraqi houses normally flattening by a concrete panel. This concrete panel has poor thermal properties. The usage of materials with low thermal conductivity and high specific heat gives a good improvements to the thermal properties of the concrete panel, thus, the indoor room temperature improves. A Mathcad program based on a mathematical model employing complex Fourier series built for a single room building. The model input data are the ambient temperature, solar radiation, and sol-air temperature, which have been treated as a periodic function of time. While, the room construction is constant due to their materials made of it, except the roof properties are taken as a variable generated practically from the
... Show MoreBusiness incubator is a new effective mechanism in developing small projects through its introductions of a new integral system of services. It aims at supporting and developing making new projects. Hence, there is a big number of factors that are interrelated in the processes of preparation for those projects. Those factors are: organizing the incubator and the market available for the projects attached to them and the work programs which will have to be implemented. Those small projects represent more than 98% of the total work institutions in the world. Also it has become responsible for a ration reaching half of the national output of those countries. These projects have created between 40 to 80% of job opportunities availabl
... Show MoreFabrication of a photodetector consists of the conjugated polymer "MEH-PPV"- poly (2-methoxy-5-(2'-ethylhexyloxy)-1,4-phenlenevinylene) and MEH-PPV:MWCNT nanocomposite thin film. The volume ratio investigated was 0.75:0.25. MEH-PPV was dissolved in chloroform solvent and doped with MWCNTs. The spin coating method was used to achieve a facile and low cost photodetector. The absorption spectrum decreases by adding the CNTs. The PL spectrum detected recombination curve results by doping the polymer with CNTs, and AFM measurement showed an increase of roughness average from (0.168 to 2.43nm) of "MEH-PPV" and "MEH-PPV:CNTs", respectively. The doping ratio 0.25, which has a higher photoresponsivity, was evaluated at 1.70 A/W and 2.14 A/W of th
... Show MoreDegenerate parabolic partial differential equations (PDEs) with vanishing or unbounded leading coefficient make the PDE non-uniformly parabolic, and new theories need to be developed in the context of practical applications of such rather unstudied mathematical models arising in porous media, population dynamics, financial mathematics, etc. With this new challenge in mind, this paper considers investigating newly formulated direct and inverse problems associated with non-uniform parabolic PDEs where the leading space- and time-dependent coefficient is allowed to vanish on a non-empty, but zero measure, kernel set. In the context of inverse analysis, we consider the linear but ill-pose
A factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure. In this paper, the factor groups K(SL(2,121)) and K(SL(2,169)) computed for each group from the character table of rational representations.