The Indonesian language is used as a means of communication, including written communication. Unfortunately, many mistakes are found in Indonesian language writing, such as the writing of active verbs with the prefix mem- followed by the letter P. This problem can be addressed with the spell-checking method. Spell checking is a process in computer programs to check the spelling of each word in electronic text or documents in the correct order.  To better the active verb this study used  the Jaro-Winkler Distance algorithm. Meanwhile, for system development, the Iterative Waterfall method was used. The system output is active verbs of mem- + P which is standardized according to the Great Dictionary of the In

Genetic polymorphism in a fragment of NADH (ND4),400bp long from the Mitochondrial DNA
(mtDNA) of Mediterranean fruit fly ceratitis capitata (Wiedemann, 1824) using PCR-RFLP method
with the restriction enzyme EcoRV in samples collected from three governorates in the middle of Iraq.
The purposes of this study is to establish database, discover the introduction source as well as studying
the genetic diversity for this economic pest in Iraq. The results show that there is a genetic
polymorphism of the studied gene fragment among Kut governorate as compaired with the other
studied samples according to digestion results of the restriction enzyme EcoRV.

The present study is entitled “Problems of Translating Holy Qur’an Antonyms into German: An Analytical Study”. It discusses some of the problems of translating Holy Qur’an verses that contain words so opposite in meaning to another word. The main concern of the study stresses some of the errors in translating the oppositeness of certain words of Holy Qur’an from Arabic into other languages like German, a problem that can be traced back to the fact that such words may have two opposites in meaning, one is considered and the other is completely neglected.

      The errors in translating al Qur’an Antonyms can be summarized for several reasons: literal translation, ignorance of the different view

Mutations in genes encoding proteins necessary for detoxifying oxidative stress products have been predicted to increase susceptibility to lung cancer (LC). Despite this, the association between waterpipe tobacco smoking (WP), genetic polymorphisms, and LC risk remains poorly understood. This is the first study to explore the relationship between WP tobacco smoking and these genetic factors. Previously, we investigated the association of GSTP1 SNPs (rs1695-A/G and rs1138272-C/T) with LC in Iraqi males who smoke WP. Here, we expanded our analysis to include GSTM1 (active/null) and GSTT1 (active/null) genotypes, both individually and in combination with GSTP1 SNPs. Multiplex PCR and RFLP-PCR assays were utilized to determine the genotypes of

This research introduce a study with application on Principal Component Regression obtained from some of the explainatory variables to limitate Multicollinearity problem among these variables and gain staibilty in their estimations more than those which yield from Ordinary Least Squares. But the cost that we pay in the other hand losing a little power of the estimation of the predictive regression function in explaining the essential variations. A suggested numerical formula has been proposed and applied by the researchers as optimal solution, and vererifing the its efficiency by a program written by the researchers themselves for this porpuse through some creterions: Cumulative Percentage Variance, Coefficient of Determination, Variance

The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key gene

The effectiveness of detecting and matching of image features using multiple views of a specified scene using dynamic scene analysis is considered to be a critical first step for many applications in computer vision image processing. The Scale invariant feature transform (SIFT) can be applied very successfully of typical images captured by a digital camera.
In this paper, firstly the SIFT and its variants are systematically analyzed. Then, the performances are evaluated in many situations: change in rotation, change in blurs, change in scale and change in illumination. The outcome results show that each algorithm has its advantages when compared with other algorithms

Most heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of par

Establishing coverage of the target sensing field and extending the network’s lifetime, together known as Coverage-lifetime is the key issue in wireless sensor networks (WSNs). Recent studies realize the important role of nature-inspired algorithms in handling coverage-lifetime problem with different optimization aspects. One of the main formulations is to define coverage-lifetime problem as a disjoint set covers problem. In this paper, we propose an evolutionary algorithm for solving coverage-lifetime problem as a disjoint set covers function. The main interest in this paper is to reflect both models of sensing: Boolean and probabilistic. Moreover, a heuristic operator is proposed as a local refinement operator to improve the quality