Background:Fractures of patella constitute 1% of all fractures. Various techniques have been described for internal fixation of patella fractures. Superiority of one technique over the other has long been debated. Objective:We reviewed a series of seventy patients with transverse or comminuted fractures of patella treated with cerclage and tension band wiring technique to assess if it had any advantages over k. wires and tension band wiring technique. Type of the study:Retrospective study.Methods; Seventy patients with displaced patella fracture, with a mean age of 47 years (range 13-75) were divided into two groups :group A 36 patients were treated with cerclageand tensi

Background: Fractures of patella constitute 1% of all fractures. Various techniques have been described for internal fixation of patella fractures. Superiority of one technique over the other has long been debated. Objective: We reviewed a series of seventy patients with transverse or comminuted fractures of patella treated with cerclage and tension band wiring technique to assess if it had any advantages over k. wires and tension band wiring technique. Type of the study: Retrospective study. Methods; Seventy patients with displaced patella fracture, with a mean age of 47 years (range 13-75) were divided into two groups :group A 36 patients were treated with cerclage and tension bands technique ,and group B 34 patients were fixed by 2 K.

The study aimed to identify the use of the electronic concept maps method in learning some of the skills of the floor exercises in the artistic gymnastics for third graders ,as well as to identify the best group between the two research groups (experimental And the officer to learn and retain some of the skills of the floor exercises in the artistic gymnastics of the research subject , and the experimental method was used and included the sample research on students of the collage of Physical Education and Sports Sciences/University of Baghdad, third grade, and has selected (10) Students for each group of The experimental and controlling groups randomly by lottery and after the completion of the period of implementation of the experiment wh

There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that

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

This work bases on encouraging a generous and conceivable estimation for modified an algorithm for vehicle travel times on a highway from the eliminated traffic information using set aside camera image groupings. The strategy for the assessment of vehicle travel times relies upon the distinctive verification of traffic state. The particular vehicle velocities are gotten from acknowledged vehicle positions in two persistent images by working out the distance covered all through elapsed past time doing mollification between the removed traffic flow data and cultivating a plan to unequivocally predict vehicle travel times. Erbil road data base is used to recognize road locales around road segments which are projected into the commended camera

The cuneiform images need many processes in order to know their contents
and by using image enhancement to clarify the objects (symbols) founded in the
image. The Vector used for classifying the symbol called symbol structural vector
(SSV) it which is build from the information wedges in the symbol.
The experimental tests show insome numbersand various relevancy including
various drawings in online method. The results are high accuracy in this research,
and methods and algorithms programmed using a visual basic 6.0. In this research
more than one method was applied to extract information from the digital images
of cuneiform tablets, in order to identify most of signs of Sumerian cuneiform.

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti