Type 2 diabetes mellitus which abbreviate as T2DM is a complex endocrine and metabolic disorder arisingfrom genetic and environmental factors interaction which in turn induce various degrees of insulin functionalalteration on peripheral tissues. Globally, T2DM has develop into a public health problem. Therefore, Thestudy included (75) patients(37 female and 38 males) suffering from T2DM who visit al-kadhimiya teachinghospital with age range 20-80 years and (70) as healthy controls with age range 20-70 years. All studiedgroups were evaluated CMV IgG by ELISA,B. urea, S. Creatinine, cholesterol and triglyceride the resultsshowed that B.urea, S.creatinine and serum cholesterol showed a non-significant differences between studiedgroup,

Background: periodontitis is a chronic inflammatory disease causing destruction of the tooth supporting structures, initiated by dental plaque and modified by environmental and genetic risk factors. Cyclooxygenase-2 (COX-2) enzyme is responsible for the production of prostaglandin E2, an important mediator in the chronic periodontitis (CP) pathogenesis. Polymorphisms in COX-2 gene have linked to CP in different populations. Aim: To study the association between Cyclooxygenase-2 single nucleotide polymorphism rs689466 (-1195A/G SNP) and chronic periodontitis in a sample of Iraqi population. Methods: One hundred Iraqi subjects divided into two groups: case group consisted of 70 CP patient (35 males and 35 females) with age range 30-55 year

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

An Optimal Algorithm for HTML Page Building Process

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th