Objective: The aim of this study is to detect the effect of continuous exposure to Sodium Nitrite on 8-oxoguanine
DNA glycosylase (OGG1) gene which responsible on DNA repairs. DNA repair play a major role in maintaining
genomic stability when DNA exposure to damage. Genomic stability is very important for keeping body cells
healthy and to prevent many types of tumor development. Many genes are responsible for this job; one of them is
OGG1 gene.
Methodology: In current study two groups of mice were chronically exposed to sodium nitrite for six months and
eighteen months while third group was used as a control. Then sizes of OGG1 were estimated.
Results: The results exhibited in the unexposed (control) mice had two dif

A descriptive study, which was using an assessment approach, was conducted for the
determination of the impact of rheumatoid arthritis and osteoarthritis patient’s functional disability
upon their life style. The study was carried out at the Rheumatology and outpatients clinics of ALKarama
Teaching Hospital, Baghdad Teaching Hospital AL-Kindey Teaching Hospital and Specialized
surgeries Teaching Hospital for the period of October 15th 2003 through May 13th 2004 in Baghdad
City. A purposive (non-probability) sample of (245) arthritis patients which was comprised (111)
rheumatoid arthritis patients and (134) osteoarthritis patients, was selected out of the early stated
settings. The questionnaire was comprised of

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

Conducted two trials separate plants Defla first two seasons, 1998 and 1999 to test the susceptibility Altgveria three varieties including Azharha colored white and pink Qati and pink Qtmr and second seasons 1999 and 2000, two types color Azhaarhama white and pink Qati treated mind half-timbered two types of Alaoxinat IBA and NAA and three concentrations as well as repeatersAdhrt results low Almaah rooting

In this paper, a robust invisible watermarking system for digital video encoded by MPEG-4 is presented. The proposed scheme provides watermark hidden by embedding a secret message (watermark) in the sprite area allocated in reference frame (I-frame). The proposed system consists of two main units: (i) Embedding unit and (ii) Extraction unit. In the embedding unit, the system allocates the sprite blocks using motion compensation information. The allocated sprite area in each I–frame is used as hosting area for embedding watermark data. In the extraction unit, the system extracts the watermark data in order to check authentication and ownership of the video. The watermark data embedding method is Blocks average modulation applied on RGB dom

Hiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.

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

Computer systems and networks are increasingly used for many types of applications; as a result the security threats to computers and networks have also increased significantly. Traditionally, password user authentication is widely used to authenticate legitimate user, but this method has many loopholes such as password sharing, brute force attack, dictionary attack and more. The aim of this paper is to improve the password authentication method using Probabilistic Neural Networks (PNNs) with three types of distance include Euclidean Distance, Manhattan Distance and Euclidean Squared Distance and four features of keystroke dynamics including Dwell Time (DT), Flight Time (FT), mixture of (DT) and (FT), and finally Up-Up Time (UUT). The resul

The Internet of Things (IoT) is an information network that connects gadgets and sensors to allow new autonomous tasks. The Industrial Internet of Things (IIoT) refers to the integration of IoT with industrial applications. Some vital infrastructures, such as water delivery networks, use IIoT. The scattered topology of IIoT and resource limits of edge computing provide new difficulties to traditional data storage, transport, and security protection with the rapid expansion of the IIoT. In this paper, a recovery mechanism to recover the edge network failure is proposed by considering repair cost and computational demands. The NP-hard problem was divided into interdependent major and minor problems that could be solved in polynomial t