Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric
This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord
... Show MoreProfiles of indignation and indiscretion in pre-Islamic poetry
In this work we present a technique to extract the heart contours from noisy echocardiograph images. Our technique is based on improving the image before applying contours detection to reduce heavy noise and get better image quality. To perform that, we combine many pre-processing techniques (filtering, morphological operations, and contrast adjustment) to avoid unclear edges and enhance low contrast of echocardiograph images, after implementing these techniques we can get legible detection for heart boundaries and valves movement by traditional edge detection methods.
Estimating the semantic similarity between short texts plays an increasingly prominent role in many fields related to text mining and natural language processing applications, especially with the large increase in the volume of textual data that is produced daily. Traditional approaches for calculating the degree of similarity between two texts, based on the words they share, do not perform well with short texts because two similar texts may be written in different terms by employing synonyms. As a result, short texts should be semantically compared. In this paper, a semantic similarity measurement method between texts is presented which combines knowledge-based and corpus-based semantic information to build a semantic network that repre
... Show MoreThe aim of the present study is to research two morphological processes: acronym and compounding (phrasal compounds/ circumlocution) and one syntactic category which are 'existential sentences' in science fiction short stories. The present paper identifies different types and rates of existential sentences. In this respect , 'bare existential and locative’ read the high percentages and may be contrasted with other classifications of English existential sentences which have a verb other than 'be' and a definite expression. 'Phrasal compounds' vary in rates as they constitute notable percentage for those that involve 'lexical means and lexical relations' followed by 'prepositional compounds' , 'conjunctional compounds' , and those invo
... Show MoreElbow stiffness is hard to treat and commonly resulted from trauma or degenerative arthritis. This study aimed to demonstrate the effectiveness of using ultrasound therapy in management of stiff elbow joint resulted from several etiological factors. A total number of 42 patients (35 male and 7 female) allocated randomly from the Department of Physiotherapy at Al-yarmouk Teaching Hospital during 2013. Each patient examined physically by physiotherapist taking in consideration the measurement of the joint movement angle using goniometer in flexion and the extension, and the pain score using visual analogue scale (VAS). Ultrasound therapy initiated thrice weekly for two weeks. At the time of entry, the means degree of flexion and extension
... Show Moreان الغرض من هذا البحث هو المزج بين القيود الضبابية والاحتمالية. كما يهدف الى مناقشة اكثر حالات مشكلات البرمجة الضبابية شيوعا وهي عندما تكون المشكلة الضبابية تتبع دالة الانتماء مرة دالة الاتنماء المثلثية مرة اخرى، من خلال التطبيق العملي والتجريبي. فضلا عن توظيف البرمجة الخطية الضبابية في معالجة مشكلات تخطيط وجدولة الإنتاج لشركة العراق لصناعة الأثاث، وكذلك تم استخدام الطرائق الكمية للتنبؤ بالطلب واعتماده
... Show MoreIn this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons
... Show MoreFive rice (Oryza sativa L.) cultivars (N22, Amber, Moroberekan, Kinandang Patong, and Azucena) underwent path coefficient analysis across three plant spacings (15 cm × 15 cm, 20 cm × 20 cm, and 25 cm× 25 cm) in the summer of 2017 at the College of Agricultural Engineering Sciences, University of Baghdad, Al-Jadriya, Iraq. The experiment proceeded in a randomized complete block design (RCBD) with a split-plot arrangement and three replications. The main plots included three planting distances, and the subplot comprised five varieties. The traits studied were plant height, flag leaf area, number of tillers, panicle number, length and branches, grains per panicle, 1000-grain weight, and the percentage of unfilled grains. The results
... Show More