Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o

Cryptography is a major concern in communication systems. IoE technology is a new trend of smart systems based on various constrained devices. Lightweight cryptographic algorithms are mainly solved the most security concern of constrained devices and IoE systems. On the other hand, most lightweight algorithms are suffering from the trade-off between complexity and performance. Moreover, the strength of the cryptosystems, including the speed of the algorithm and the complexity of the system against the cryptanalysis. A chaotic system is based on nonlinear dynamic equations that are sensitive to initial conditions and produce high randomness which is a good choice for cryptosystems. In this work, we proposed a new five-dimensional of a chaoti

This study proposed a biometric-based digital signature scheme proposed for facial recognition. The scheme is designed and built to verify the person’s identity during a registration process and retrieve their public and private keys stored in the database. The RSA algorithm has been used as asymmetric encryption method to encrypt hashes generated for digital documents. It uses the hash function (SHA-256) to generate digital signatures. In this study, local binary patterns histograms (LBPH) were used for facial recognition. The facial recognition method was evaluated on ORL faces retrieved from the database of Cambridge University. From the analysis, the LBPH algorithm achieved 97.5% accuracy; the real-time testing was done on thirty subj

Stenography is the art of hiding the very presence of communication by embedding secret message into innocuous looking cover document, such as digital image, videos, sound files, and other computer files that contain perceptually irrelevant or redundant information as covers or carriers to hide secret messages.

In this paper, a new Least Significant Bit (LSB) nonsequential embedding technique in wave audio files is introduced. To support the immunity of proposed hiding system, and in order to recover some weak aspect inherent with the pure implementation of stego-systems, some auxiliary processes were suggested and investigated including the use of hidden text jumping process and stream ciphering algorithm. Besides, the suggested

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

The present research tackles a number of historical facts and incidents with a purely legal dimension in an important stage in the contemporary history of Iraq, especially the era of the British occupation. This resulted in innumerable social, political and legal problems, particularily the judicial legislation problems in Iraq. These legislations included a set of civil laws and in force governmental procedures that will be discussed historically by examining documents issued by the Ministries of Justice and Interior Affairs in the governments of monarchy for the period from 1921-to-1958. The data of the present paper relied on the Iraqi Library and Archives, (hence DKW). The study adopted the narrative historical methodology when inves

Mishrif Formation is the main reservoir in oil-fields (North Rumaila, South Rumaila, Majnoon, Zubair and West Qurna) which located at Basrah southern Iraq. The Inductively coupled plasma-Mass spectrometer (ICP-MS) was used for the water chemistry analysis and Scanning Electron Microprobe (SEM) for the purpose of mineralogy diagnosis. A weak acidic water of salinity six-time greater than seawater plays a role in generating the formation pressure and controlling the fluid flow. The potentiometric subsurface maps were modeled and the direction of super-pressure sites that are of a great importance in the oil exploration were marked to pay attention during future drilling.

Abstract

        The critical success factors of the means of the most modern in determining the main directions for organizations to achieve competitive advantage. and can be a critical success factors in organizations that overlap in the functional areas of the organization. that successful organizations use these factors to get to the uniqueness and distinction. as the entrance of critical success factors with the capacity Evaluative phase correction because discovery increases the perception of managers of what is important to the organization and using them to get to the Strategic Entrepreneurship. as it begins in terms of permanence of success and

In this work, we construct the projectively distinct (k, n)-arcs in PG (3, 4) over Galois field GF (4), where k 5, and we found that the complete (k, n)-arcs, where 3 n 21, moreover we prove geometrically that the maximum complete (k, n)-arc in PG (3, 4) is (85, 21)-arc. A (k, n)-arcs is a set of k points no n+ 1 of which are collinear. A (k, n)-arcs is complete if it is not contained in a (k+ 1, n)-arcs