The study was conducted at the fields of the Department of Horticulture and Landscape Gardening, College of Agriculture, University of Baghdad " Abu Ghraib" during the growing seasons 2013-2014 to Evaluate the Vegetative growth , yield traits and genetic parameter of some tomato mutants. Results showed significantly increased of plant height in M6-2 mutant 245cm in Comparison with M6- 3 130 cm . M6-4 mutant significantly increasing of floral clusters 13 . Mutant M6-3 showed significantly increasing the average of, fruit weight 125.9g and plant yield 7.17 kg.plant-1 as comparison with M6-2 which showed decreasing of average of fruit weight and plant yield 79.40g and 4.38 kg.plant-1 respectively. Also results showed the highest Genetic variat

The role of transmembrane protease serine 2(TMPRSS2) in prostate carcinogenesis relies on overexpression of ETS transcription factors. The aim of this article was to investigate the association of TMPRSS2 polymorphism (rs12329760 (C\T)) with prostate cancer (PCa) in sample of Iraqi patients. One hundred and two individuals were involved in this study for the period from February – 2019 to February – 2020. The sample type was formalin fixed paraffin embedded tissue samples (FFPE), which involved  fifty-six samples of pre-diagnosed patients with prostate cancer, aged between 48 and 86 years, and forty-six samples were found to be controls (healthy group) dependent on Prostate Gland integrity, which is the same age as in a group o

Because of vulnerable threats and attacks against database during transmission from sender to receiver, which is one of the most global security concerns of network users, a lightweight cryptosystem using Rivest Cipher 4 (RC4) algorithm is proposed. This cryptosystem maintains data privacy by performing encryption of data in cipher form and transfers it over the network and again performing decryption to original data. Hens, ciphers represent encapsulating system for database tables

Recently, Image enhancement techniques can be represented as one of the most significant topics in the field of digital image processing. The basic problem in the enhancement method is how to remove noise or improve digital image details. In the current research a method for digital image de-noising and its detail sharpening/highlighted was proposed. The proposed approach uses fuzzy logic technique to process each pixel inside entire image, and then take the decision if it is noisy or need more processing for highlighting. This issue is performed by examining the degree of association with neighboring elements based on fuzzy algorithm. The proposed de-noising approach was evaluated by some standard images after corrupting them with impulse

Features is the description of the image contents which could be corner, blob or edge. Corners are one of the most important feature to describe image, therefore there are many algorithms to detect corners such as Harris, FAST, SUSAN, etc. Harris is a method for corner detection and it is an efficient and accurate feature detection method. Harris corner detection is rotation invariant but it isn’t scale invariant. This paper presents an efficient harris corner detector invariant to scale, this improvement done by using gaussian function with different scales. The experimental results illustrate that it is very useful to use Gaussian linear equation to deal with harris weakness.

Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.

Implementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.

In this paper, we derive and prove the stability bounds of the momentum coefficient µ and the learning rate ? of the back propagation updating rule in Artificial Neural Networks .The theoretical upper bound of learning rate ? is derived and its practical approximation is obtained