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 algorith

Background: The pandemic crisis prompted the world to adopt unexpected approaches to continue life as normally as possible. The education sector, including professors, students, and the overall teaching system, has been particularly affected. Objective: This study seeks to evaluate the benefits, challenges, and strategies related to COVID-19 from the perspectives of college students, particularly those in higher education in Iraq. Method: The online survey questionnaire was distributed via Google Forms and specifically aimed at undergraduate dental students. Results: A total of 348 students participated in the survey. There was a significant correlation (P > 0.01) between student satisfaction with hybrid learning and their experi

Sara and other kid's Agony: - Back to Innocence to Save Iraq

The background subtraction is a leading technique adopted for detecting the moving objects in video surveillance systems. Various background subtraction models have been applied to tackle different challenges in many surveillance environments. In this paper, we propose a model of pixel-based color-histogram and Fuzzy C-means (FCM) to obtain the background model using cosine similarity (CS) to measure the closeness between the current pixel and the background model and eventually determine the background and foreground pixel according to a tuned threshold. The performance of this model is benchmarked on CDnet2014 dynamic scenes dataset using statistical metrics. The results show a better performance against the state-of the art

This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)

Sufficient high-quality data are unavailable to describe the management approach and guideline of COVID-19 disease in pediatric and adolescent population which may be due to mild presentation in most of cases and less severe complications than older ages.

World Health Organization was concerned with the establishment of an approved guideline to manage the increasing number of COVID-19 patients worldwide aiming to prevent or lessen COVID-19 global burden.

The clinical features have a wide spectrum starting from uncomplicated mild illness, mild-moderate pneumonia, severe pneumonia, acute respiratory distress syndrome, sepsis, septic shock, and multisystem inflammatory syndrome in children.

Many important definitions

A three-stage learning algorithm for deep multilayer perceptron (DMLP) with effective weight initialisation based on sparse auto-encoder is proposed in this paper, which aims to overcome difficulties in training deep neural networks with limited training data in high-dimensional feature space. At the first stage, unsupervised learning is adopted using sparse auto-encoder to obtain the initial weights of the feature extraction layers of the DMLP. At the second stage, error back-propagation is used to train the DMLP by fixing the weights obtained at the first stage for its feature extraction layers. At the third stage, all the weights of the DMLP obtained at the second stage are refined by error back-propagation. Network structures an