This paper proposes a new method Object Detection in Skin Cancer Image, the minimum
spanning tree Detection descriptor (MST). This ObjectDetection descriptor builds on the
structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer
Images only. The Skin Cancer Image Detection of test objects relies on their distances to the
closest edge of thattree. Our experimentsshow that the Minimum Spanning Tree (MST) performs
especially well in case of Fogginessimage problems and in highNoisespaces for Skin Cancer
Image.
The proposed method of Object Detection Skin Cancer Image wasimplemented and tested on
different Skin Cancer Images. We obtained very good results . The experiment showed that the
proposedmethod obtained very good results but it requires more testing on different types of Skin
Cancer Images.
Objective: The objective of the study was to test the hypothesis, that umbilical cord blood crude serum applied topically with its high concentration of growth factors may promote an early healing for animal models with burn injury.
Methods: Fresh human umbilical cord blood UCBS was collected and screened for transmitted diseases such as hepatitis B, hepatitis C and HIV. Mice and rabbits were scalded by boiling water and chemical burning by NaOH, then treated with UCBS. In comparison with a Cetrimide treated group and a control group (without treatment). The UCBS was subjected to microbial testing to demonstrate the presence or absence of extraneous viable contaminating microorganisms.
... Show MoreAbstract
This research aims to evaluate the application of the inspectors general of global indicators offices according to the axles (leadership, strategy and planning, employees, partners and resources, process management) and through the assumption main research which states that (there is an application for global indicators to evaluate performance in the offices of the ministries under study) which are subdivided into five sub-hypotheses according to the classification and division of the five axes of the checklist.
The researchers have taken refuge in the process of assessing the performance of the check list which included global i
... Show MoreThe research aims at:- 1- Measuring the self-image of the elderly. 2- Measuring the depression of the elderly. 3- Knowing the statistically difference of the self-image to the elderly due to variables like (the gender , martial status and place of residency). 4- Knowing the statistically difference of the depression of the elderly due to (the gender , martial status and place of residency). 5- Knowing the relationship between the self-image and depression of the elderly. To reach to the aims of the research , the researcher built a tool to measure self-image and other to measure the psychological disorders for elderly , and after investigation of their validity and reliability he applied them on a random sample of elderly (their number w
... Show MorePathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable
... Show MoreEnergy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit
... Show MoreIn networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f
... Show MoreOur research sheds light on one of the most important aspects of David Grossman's play, "Ricky's Garden, גן ריקי " which is characterized by its realistic portrayal of characters. Grossman gradually moves towards the inner awareness of his characters, expressing their emotions and thoughts through conversations and emotional conflicts, referring to their past and rooted background. Grossman transformed the main subject of his play (psychological depth) into a presentation and arrangement of all the elements of the play in a way that expresses emotional nature more powerfully by each child in the garden. This is reflected in their actions and words, making Grossman's works suitable for study and always of interest to specialized resear
... Show MoreThe traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to ï¬nd the shortest tour that visits each city in a given list exactly once and then returns to the starting city. In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities. So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT). For the BABT, more than one lower and upper bounds are be derived to gain the best one. The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency of BABT compared with so
... Show More