Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms are proposed in this work with a discussion on the difference between them. These algorithms find the shortest route through finding the optimal rate between two nodes in the wireless networks but with bounded end-to-end delay. The Dijkstra-based algorithm is especially favorable in terms of processing time. We also present a comparison between our proposed single-constraint Dijkstra-based routing algorithm and the mesh routing algorithm (MRA) existing in the literature to clarify the merits of the former.
This prospective study involved one hundred patients with colostomies admitted at the Central Pediatric Teaching Hospital for colostomy closure over the period of two years (Jan.2000-
Jan2002).
Patients were divided in to two groups according to the technique of colostomy closure. In the first group, the closure was done by single layer of interrupted non-absorbable suture material; in the second group closure was done by double layer suturing technique. All patients were prepared by the same conventional method including fluid diet for three days
followed by two days washing enemas before operation with antimicrobial prophylaxis agents. Of these one hundred patients;(48) presented as cases of Hirschspr
This paper presents a comparative study of two learning algorithms for the nonlinear PID neural trajectory tracking controller for mobile robot in order to follow a pre-defined path. As simple and fast tuning technique, genetic and particle swarm optimization algorithms are used to tune the nonlinear PID neural controller's parameters to find the best velocities control actions of the right wheel and left wheel for the real mobile robot. Polywog wavelet activation function is used in the structure of the nonlinear PID neural controller. Simulation results (Matlab) and experimental work (LabVIEW) show that the proposed nonlinear PID controller with PSO
learning algorithm is more effective and robust than genetic learning algorithm; thi
In this work, a single pile is physically modeled and embedded in an upper liquefiable loose sand layer overlying a non-liquefiable dense layer. A laminar soil container is adopted to simulate the coupled static-dynamic loading pile response during earthquake motions: Ali Algharbi, Halabjah, El-Centro, and Kobe earthquakes. During seismic events with combined loading, the rotation along the pile, the lateral and vertical displacements at the pile head as well as the pore pressure ratio in loose sandy soil were assessed. According to the experimental findings, combined loading that ranged from 50 to 100% of axial load would alter the pile reaction by reducing the pile head peak ground acceleration, rotation of the pile, and lateral displacem
... Show MoreThis paper investigated an Iraqi dataset from Korek Telecom Company as Call Detail Recorded (CDRs) for six months falling between Sep. 2020-Feb. 2021. This data covers 18 governorates, and it falls within the period of COVID-19. The Gravity algorithm was applied into two levels of abstraction in deriving the results as the macroscopic and mesoscopic levels respectively. The goal of this study was to reveal the strength and weakness of people migration in-between the Iraqi cities. Thus, it has been clear that the relationship between each city with the others is based on and of mobile people. However, the COVID-19 effects on the people’s migration needed to be explored. Whereas the main function of the gravity model is to
... Show MoreThe issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting r
... Show MoreObjectives. This study was carried out to quantitatively evaluate and compare the sealing ability of Endoflas by using differentobturation techniques. Materials and Methods. After 42 extracted primary maxillary incisors and canines were decoronated, theircanals were instrumented with K files of size ranging from #15 to #50. In accordance with the obturation technique, the sampleswere divided into three experimental groups, namely, group I: endodontic pressure syringe, group II: modified disposable syringe,and group III: reamer technique, and two control groups. Dye extraction method was used for leakage evaluation. Data wereanalyzed using one-way ANOVA and Dunnett’s T3 post hoc tests. The level of significance was set at p<0:05. Results.
... Show MoreReal life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.
We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑
... Show MoreData generated from modern applications and the internet in healthcare is extensive and rapidly expanding. Therefore, one of the significant success factors for any application is understanding and extracting meaningful information using digital analytics tools. These tools will positively impact the application's performance and handle the challenges that can be faced to create highly consistent, logical, and information-rich summaries. This paper contains three main objectives: First, it provides several analytics methodologies that help to analyze datasets and extract useful information from them as preprocessing steps in any classification model to determine the dataset characteristics. Also, this paper provides a comparative st
... Show More