This study aimed at some of the criteria used to determine the form of the river basins, and exposed the need to modify some of its limitations. In which, the generalization of the elongation and roundness ratio coefficient criterion was modified, which was set in a range between (0-1). This range goes beyond determining the form of the basin, which gives it an elongated or rounded feature, and the ratio has been modified by making it more detailed and accurate in giving the basin a specific form, not only a general characteristic. So, we reached a standard for each of the basins' forms regarding the results of the elongation and circularity ratios. Thus, circular is (1-0.8), and square is (between 0.8-0.6), the blade or oval form is (0.6-0

Background: This study was carried out in response to the Zika virus epidemic, which constituted a public health emergency, and to the 2019 WHO calling for strengthened surveillance for the early detection of related microcephaly. The main aim of the study was to phenotype the craniofacial morphology of microcephaly using a novel approach and new measurements, and relate the characteristics to brain abnormalities in Zika-infected infants in Brazil to improve clinical surveillance.

Methods: 3D images of the face and the cranial vault of 44 Zika-infected infants and matched healthy controls were captured using a 3D stereophotogrammetry system. The CT scans of the brain of t

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

Traditionally, 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).