Until recently, researchers have utilized and applied various techniques for intrusion detection system (IDS), including DNA encoding and clustering that are widely used for this purpose. In addition to the other two major techniques for detection are anomaly and misuse detection, where anomaly detection is done based on user behavior, while misuse detection is done based on known attacks signatures. However, both techniques have some drawbacks, such as a high false alarm rate. Therefore, hybrid IDS takes advantage of combining the strength of both techniques to overcome their limitations. In this paper, a hybrid IDS is proposed based on the DNA encoding and clustering method. The proposed DNA encoding is done based on the UNSW-NB15 database by dividing the record's attributes into four groups, including State, Protocol, Service, and the rest of the features is Digits. Four DNA characters were used to represent each protocol attribute values. While two DNA characters are used to represent State, Service and Digits attributes values. Then, the clustering method is applied to classify the records into two clusters, either attack or normal. The current experiment results showed that the proposed system has achieved a good detection rate and accuracy results equal to 81.22% and 82.05% respectively. Also, the system achieved fast encoding and clustering time that equal 0.385 seconds and 0.00325 seconds respectively for each record.
Graphite nanoparticles were successfully synthesized using mixture of H2O2/NH4OH with three steps of oxidation. The process of oxidations were analysis by XRD and optics microscopic images which shows clear change in particle size of graphite after every steps of oxidation. The method depend on treatments the graphite with H2O2 in two steps than complete the last steps by reacting with H2O2/NH4OH with equal quantities. The process did not reduces the several sheets for graphite but dispersion the aggregates of multi-sheets carbon when removed the Van Der Waals forces through the oxidation process.
In this research, Argon gas was used to generate atmospheric plasma in the manufacture of platinum nanomaterials, to study the resultant plasma spectrum and to calculate the cellular toxicity of those manufactured nanomaterials. This research is keen on the generation of nonthermal atmospheric pressure plasma using aqueous platinum salts (H2PtCl6 6H2O) with different concentrations and exposure of cold plasma with a different time period used to produce platinum nanoparticles, to ensure typical preparation of nanoparticles. Visible UV and X-rays were performed for this purpose, and the diameter of the system probe was (1[Formula: see text]mm) with the Argon gas flow of
... Show MoreObjective(s): The study aims to assess the early detection of early detection of first degree relatives to type-II
diabetes mellitus throughout the diagnostic tests of Glycated Hemoglobin A1C. (HgbA1C), Oral Glucose Tolerance
Test (OGTT) and to find out the relationship between demographic data and early detection of first degree
relatives to type-II diabetes mellitus.
Methodology: A purposive "non-probability" sample of (200) subjects first degree relatives to type-II diabetes
mellitus was selected from National Center for Diabetes Mellitus/Al-Mustansria University and Specialist Center
for Diabetes Mellitus and Endocrine Diseases/Al-kindy. These related persons have presented the age of (40-70)
years old. A questio
Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are
LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2
Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding
... Show More