Today’s modern medical imaging research faces the challenge of detecting brain tumor through Magnetic Resonance Images (MRI). Normally, to produce images of soft tissue of human body, MRI images are used by experts. It is used for analysis of human organs to replace surgery. For brain tumor detection, image segmentation is required. For this purpose, the brain is partitioned into two distinct regions. This is considered to be one of the most important but difficult part of the process of detecting brain tumor. Hence, it is highly necessary that segmentation of the MRI images must be done accurately before asking the computer to do the exact diagnosis. Earlier, a variety of algorithms were developed for segmentation of MRI images by usin

 The financial markets are one of the sectors whose data is characterized by continuous movement in most of the times and it is constantly changing, so it is difficult to predict its trends , and this leads to the need of methods , means and techniques for making decisions, and that pushes investors and analysts in the financial markets to use various and different methods in order to reach at predicting the movement of the direction of the financial markets. In order to reach the goal of making decisions in different investments, where the algorithm of the support vector machine and the CART regression tree algorithm are used to classify the stock data in order to determine

IT has its impact on all aspects of life, including its planning and operations. Based on the assumption that the plan can adapt any technique as an analytical tool within broader dimensions to include society in general and meet the requirements of that society. They have neutral values, meaning and usefulness rather than being adopted as abstract goals or objectives so that the planner or the decision-maker can benefit greatly from them. This information technology is summarized in three main axes: First: Geographic Information Systems. Second: computer modeling. Third: visual simulation and the Internet. The problem of research is that the decision-making environment of the plan is surrounded by uncertain information-planning conditio

    The present study was performed to detect the molecular and the phylogenetic identification of species that belonging to the genus of Moniezia Blanchard, 1891 which affected intestines of sheep in Al-Diwaniyah city, Iraq; fifty intestine samples were sought for the infestation of Moniezia spp. from the city slaughterhouse from 1 October to 30 November 2017, this tapeworm was found to infest the intestines of 13 sheep.

    For morphological identify the genus of this tapeworm, eggs from one gravid proglottid of the thirteen worms were examined, polymerase chain reaction (PCR) and the PCR-product-based sequencing were applied on 4 Moniezia tapeworms targeti

planning is among the most significant in the field of robotics research.  As it is linked to finding a safe and efficient route in a cluttered environment for wheeled mobile robots and is considered a significant prerequisite for any such mobile robot project to be a success. This paper proposes the optimal path planning of the wheeled mobile robot with collision avoidance by using an algorithm called grey wolf optimization (GWO) as a method for finding the shortest and safe. The research goals in this study for identify the best path while taking into account the effect of the number of obstacles and design parameters on performance for the algorithm to find the best path. The simulations are run in the MATLAB environment to test the

A new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever