The 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 some good heuristic methods. We are suggesting some additional techniques to improve the computation time of BABT for n ≤ 80.
Background: Chronic lymphocytic leukemia (CLL) results from a progressive accumulation of long-lived, functionally incompetent, nonproliferating lymphocytes.
Angiogenesis is defined as the formation of new capillaries from pre-existing blood vessels and plays an important role in the progression of solid tumors as well as several hematologic malignancies like CLL.
Patients and methods: A retrospective cross-sectional study done on 68 patients with CLL compared with 15 control individuals (anemic patients), all recruited at the Medical City Teaching Laboratories from January 2005 to December 2008. The bone marrow biopsy (BMB) of each was re-examined histologically. Immunohistochemical (IHC) technique was performed on BMB sections ut
The aim of this research is to adopt a close range photogrammetric approach to evaluate the pavement surface condition, and compare the results with visual measurements. This research is carried out on the road of Baghdad University campus in AL-Jaderiyiah for evaluating the scaling, surface texture for Portland cement concrete and rutting, surface texture for asphalt concrete pavement. Eighty five stereo images of pavement distresses were captured perpendicular to the surface using a DSLR camera. Photogrammetric process was carried out by using ERDAS IMAGINE V.8.4. The results were modeled by using a relationship between the photogrammetric and visual techniques and selected the highest coefficient of determination (R2). The first techniqu
... Show MoreThe aim of this research is to adopt a close range photogrammetric approach to evaluate the pavement surface condition, and compare the results with visual measurements. This research is carried out on the road of Baghdad University campus in AL-Jaderiyiah for evaluating the scaling, surface texture for Portland cement concrete and rutting, surface texture for asphalt concrete pavement. Eighty five stereo images of pavement distresses were captured perpendicular to the surface using a DSLR camera. Photogrammetric process was carried out by using ERDAS IMAGINE V.8.4. The results were modeled by using a relationship between the photogrammetric and visual techniques and selected the highest coefficient of determinatio
... Show MoreThis work presents the UC@MOOC project as a pedagogical innovation to face the effects of massification that are making Moroccan universities endure many constraints for the past ten years, as well as other African universities. It aims, among its objectives, to cope with the massification factor and to overcome the language difficulties encountered by students. In this project, our top priority is to reduce academic failure then we will get to the point of responding to the training' needs. Courses are scripted and posted online which did not require many resources, so their production cost is relatively low. Audiovisual digital content also helps us to save time, and go to a hybrid teaching or even flipped classrooms in some cases. The
... Show MoreThe License Plate (LP), is a rectangular metal plate that contains numbers and letters. This plate is fixed onto the vehicle's body. It is used as a mean to identify the vehicle. The License Plate Recognition (LPR) system is a mean where a vehicle can be identified automatically using a computer system. The LPR has many applications, such as security applications for car tracking, or enforcing control on vehicles entering restricted areas (such as airports or governmental buildings). This paper is concerned with introducing a new method to recognize the Iraqi LPs using local vertical and horizontal projections, then testing its performance. The attained success rate reached 99.16%, with average recognition time around 0.012 second for re
... Show MoreChallenges facing the transition of traditional cities to smart: Studying the challenges faced by the transition of a traditional area such as Al-Kadhimiya city center to the smart style
The aim of this research is to determine the uranium concentration and its distribution in many sheep organs that live in different region of Iraq. The uranium concentration in tissue samples is measured by using fission tracks registration in CR-39 detector that caused by the bombardment of U235 with thermal neutrons from (241Am-Be) neutron source of thermal flux (5x 103 n.cm-2. s-1). The results show that the maximum uranium concentration in bronchiole tissues of the animals was found in Karbala city (3.706ppm) while the minimum concentration (0.127 ppm) was found in Al-Faluja city, also the same result in lung tissue the maximum value was found in Karbala city (2.313ppm) and the minimum concentration in Al Fluja (0.082). Otherwise,
... Show MoreTraditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).