Intrusion detection systems (IDS) are useful tools that help security administrators in the developing task to secure the network and alert in any possible harmful event. IDS can be classified either as misuse or anomaly, depending on the detection methodology. Where Misuse IDS can recognize the known attack based on their signatures, the main disadvantage of these systems is that they cannot detect new attacks. At the same time, the anomaly IDS depends on normal behaviour, where the main advantage of this system is its ability to discover new attacks. On the other hand, the main drawback of anomaly IDS is high false alarm rate results. Therefore, a hybrid IDS is a combination of misuse and anomaly and acts as a solution to overcome the disadvantages of these two methods. In this paper, a new hybrid IDS is proposed based on the RNA encoding idea and applying the K-means clustering algorithm. Firstly, choosing random records for both training and testing. Secondly, propose RNA encoding by calculating all possible record values within dataset and generating RNA characters for each value, then dividing it into blocks. The third step is done by searching and extracting normal keys based on the most repeated blocks, and the same procedure is applied to extract the attack keys. Finally, the Kmeans clustering method is used to classify the testing records based on extracted keys. The proposed method is evaluated by calculating the detection rate (DR), false alarm rate (FAR), and accuracy, where the achieved DR, FAR, and accuracy are equal to 91.13%, 0.46%, and 92.02% respectively. Based on the achieved results, it can be said that the proposed hybrid IDS has high DR and accuracy results, can detect new attacks, and can solve the problem of anomaly IDS by getting a low false alarm rate result.
In Computer-based applications, there is a need for simple, low-cost devices for user authentication. Biometric authentication methods namely keystroke dynamics are being increasingly used to strengthen the commonly knowledge based method (example a password) effectively and cheaply for many types of applications. Due to the semi-independent nature of the typing behavior it is difficult to masquerade, making it useful as a biometric. In this paper, C4.5 approach is used to classify user as authenticated user or impostor by combining unigraph features (namely Dwell time (DT) and flight time (FT)) and digraph features (namely Up-Up Time (UUT) and Down-Down Time (DDT)). The results show that DT enhances the performance of digraph features by i
... Show MoreThis paper offers a systemic review of the deep learning methods to detect violence on campus, which is a critical issue in intelligent surveillance to improve the student safety and prompt cut off of violent accidents. The review reviews studies published 2018-2025, concentrating on model structure to detect fights, bullying, vandalism, and aggressive behavior on problematic campuses due to occlusion and light variations and complicated human interactions. The research design includes a comparative study of different deep learning networks, such as CNNs, RNNs, 3D CNNs, attention-based networks, transformers, graph neural networks, neuro-fuzzy, and multimodal systems and federated learning methods. The paper also assesses benchmark
... Show MoreThis research include design and implementation of an Iraqi cities database using spatial data structure for storing data in two or more dimension called k-d tree .The proposed system should allow records to be inserted, deleted and searched by name or coordinate. All the programming of the proposed system written using Delphi ver. 7 and performed on personal computer (Intel core i3).
In this article, we introduced a new concept of mappings called δZA - Quasi contractive mapping and we study the K*- iteration process for approximation of fixed points, and we proved that this iteration process is faster than the existing leading iteration processes like Noor iteration process, CR -iteration process, SP and Karahan Two- step iteration process for 𝛿𝒵𝒜 − quasi contraction mappings. We supported our analytic proof by a numerical example.
The gas-lift method is crucial for maintaining oil production, particularly from an established field when the natural energy of the reservoirs is depleted. To maximize oil production, a major field's gas injection rate must be distributed as efficiently as possible across its gas-lift network system. Common gas-lift optimization techniques may lose their effectiveness and become unable to replicate the gas-lift optimum in a large network system due to problems with multi-objective, multi-constrained & restricted gas injection rate distribution. The main objective of the research is to determine the possibility of using the genetic algorithm (GA) technique to achieve the optimum distribution for the continuous gas-lift injectio
... Show MoreThis paper presents an improved technique on Ant Colony Optimization (ACO) algorithm. The procedure is applied on Single Machine with Infinite Bus (SMIB) system with power system stabilizer (PSS) at three different loading regimes. The simulations are made by using MATLAB software. The results show that by using Improved Ant Colony Optimization (IACO) the system will give better performance with less number of iterations as it compared with a previous modification on ACO. In addition, the probability of selecting the arc depends on the best ant performance and the evaporation rate.
Number theorists believe that primes play a central role in Number theory and that solving problems related to primes could lead to the resolution of many other unsolved conjectures, including the prime k-tuples conjecture. This paper aims to demonstrate the existence of this conjecture for admissible k-tuples in a positive proportion. The authors achieved this by refining the methods of “Goldston, Pintz and Yildirim” and “James Maynard” for studying bounded gaps between primes and prime k-tuples. These refinements enabled to overcome the previous limitations and restrictions and to show that for a positive proportion of admissible k-tuples, there is the existence of the prime k-tuples conjecture holding for each “k”. The sig
... Show More