Malicious software (malware) performs a malicious function that compromising a computer system’s security. Many methods have been developed to improve the security of the computer system resources, among them the use of firewall, encryption, and Intrusion Detection System (IDS). IDS can detect newly unrecognized attack attempt and raising an early alarm to inform the system about this suspicious intrusion attempt. This paper proposed a hybrid IDS for detection intrusion, especially malware, with considering network packet and host features. The hybrid IDS designed using Data Mining (DM) classification methods that for its ability to detect new, previously unseen intrusions accurately and automatically. It uses both anomaly and misuse dete

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

Excessive torque and drag can be critical limitation during drilling highly deviated oil wells. Using the modeling is regarded as an invaluable process to assist in well planning and to predict and prevent drilling problems. Identify which problems lead to excessive torque and drag to prevent cost losses and equipment damage. Proper modeling data is highly important for knowing and prediction hole problems may occur due to torque and drag and select the best method to avoid these problems related to well bore and drill string. In this study, Torque and drag well plan program from landmark worldwide programming group (Halliburton Company) used to identify hole problems.one deviated well in Zubair oil fields named, ZB-250 selected for

Excessive torque and drag can be critical limitation during drilling highly deviated oil wells. Using the modeling is regarded as an invaluable process to assist in well planning and to predict and prevent drilling problems. Identify which problems lead to excessive torque and drag to prevent cost losses and equipment damage. Proper modeling data is highly important for knowing and prediction hole problems may occur due to torque and drag and select the best method to avoid these problems related to well bore and drill string. In this study, Torque and drag well plan program from landmark worldwide programming group (Halliburton Company) used to identify hole problems.one deviated well in Zubair oil fields named, ZB-250 selected for anal

  The search is an application for one of the problems of mathematics in the computer; as providing construction and design of a major program to calculate the inverse permutations of the symmetric group Sn , where 1 ≤ n ≤ 13; using some of the methods used in the Number Theory by computer . Also the research includes design flow chart for the main program and design flow chart for the program inverse permutations and we give some illustrative examples for different symmetric groups and their inverse permutations.

Symmetric cryptography forms the backbone of secure data communication and storage by relying on the strength and randomness of cryptographic keys. This increases complexity, enhances cryptographic systems' overall robustness, and is immune to various attacks. The present work proposes a hybrid model based on the Latin square matrix (LSM) and subtractive random number generator (SRNG) algorithms for producing random keys. The hybrid model enhances the security of the cipher key against different attacks and increases the degree of diffusion. Different key lengths can also be generated based on the algorithm without compromising security. It comprises two phases. The first phase generates a seed value that depends on producing a rand