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 MoreAIM: To evaluate the short-term effectiveness of Gamma knife radiosurgery as a modality of treatment of brain arteriovenous malformation. METHODS: Sixty-three patients with arteriovenous brain malformations underwent Gamma knife radiosurgery included in this prospective study between April 2017 and September 2018 with clinical and radiological with MRI follow up was done at three months and six months post-Gamma knife radiosurgery. By the end of the 12th-month post-Gamma knife radiosurgery, the patients were re-evaluated using digital subtraction angiography co-registered with M.R.I. During the 12 months follow up, CT scan or MRI was done at any time if any one of the patients᾽ condition deteriorated or developed signs and s
... Show MoreQuality control charts are limited to controlling one characteristic of a production process, and it needs a large amount of data to determine control limits to control the process. Another limitation of the traditional control chart is that it doesn’t deal with the vague data environment. The fuzzy control charts work with the uncertainty that exists in the data. Also, the fuzzy control charts investigate the random variations found between the samples. In modern industries, productivity is often of different designs and a small volume that depends on the market need for demand (short-run production) implemented in the same type of machines to the production units. In such cases, it is difficult to determine the contr
... Show MoreIn 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.
Profiles of indignation and indiscretion in pre-Islamic poetry
In 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 More