Some maps of the chaotic firefly algorithm were selected to select variables for data on blood diseases and blood vessels obtained from Nasiriyah General Hospital where the data were tested and tracking the distribution of Gamma and it was concluded that a Chebyshevmap method is more efficient than a Sinusoidal map method through mean square error criterion.

Genetic variation was studied in 22 local and imported samples collected from local Iraqi market by using Single sequence repeat (SSR-PCR). Six primers set were used in this study. These primers produced 33 bands. Molecular weights of these bands ranged between 100 bp to 1500 bp. The number of polymorphic bands is 24, whereas the number of monomorphic bands is 9. The results of Dendrogram of the studied samples depended on SSR-PCR results by using Jaccard coefficient for genetic similarity was distributed the samples into 10 groups. This Dendrogram revealed a higher similarity between Iraqi/Balad green bell pepper and Iraqi/Yousifia green bell pepper with 1 value. This value is the highest between samples in comparison with lowest values (0

Glutathione S-transferases (GSTs) are enzymes that included, in a more range of detoxifying reactions by conjugation of glutathione, to electrophilic material. Polymorphisms n the genes that responsible of GSTs affect, the function of the GSTs. GSTs play an active role in protection of cell against oxidative stress mechanism. Polymorphisms of GSTP1 at codon 105 amino acids forms GSTP1 important site for bind of hydrophobic electrophiles and the substitution of Ile/Val affect substrate specially catalytic activity of the enzyme and may correlate with reach to different diseases in human like diabetes mellitus type2 disease. Correlation between these polymorphisms and changes in the parameters file of diabetic patients has also bee

Background: Klebsiella pneumoniae were considered as normal flora of skin, and intestine. It can cause damage to human lungs; the danger of this bacterium is related to exposure to the hospital surroundings. materials and methods: the detection of Klebsiella pneumoniae on morphological and biochemical tests and then assured with VITEK 2 system. Resistance to antibiotics was determined by Kirby-Baeur method. And genotyping of IMP-1 in isolates was done by PCR technique, then biofilm formation was identified by Micro titer plate method. Results: The present study included a collecting of 50 specimens from different clinical specimens, (blood 40%, urine 30%, sputum 20%, wound infection 10%); 10 isolates were identified as K

Optical burst switching (OBS) network is a new generation optical communication technology. In an OBS network, an edge node first sends a control packet, called burst header packet (BHP) which reserves the necessary resources for the upcoming data burst (DB). Once the reservation is complete, the DB starts travelling to its destination through the reserved path. A notable attack on OBS network is BHP flooding attack where an edge node sends BHPs to reserve resources, but never actually sends the associated DB. As a result the reserved resources are wasted and when this happen in sufficiently large scale, a denial of service (DoS) may take place. In this study, we propose a semi-supervised machine learning approach using k-means algorithm

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

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

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