Optimizing system performance in dynamic and heterogeneous environments and the efficient management of computational tasks are crucial. This paper therefore looks at task scheduling and resource allocation algorithms in some depth. The work evaluates five algorithms: Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Firefly Algorithm (FA) and Simulated Annealing (SA) across various workloads achieved by varying the task-to-node ratio. The paper identifies Finish Time and Deadline as two key performance metrics for gauging the efficacy of an algorithm, and a comprehensive investigation of the behaviors of these algorithms across different workloads was carried out. Results from the experiment

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.

Background: Chronic myeloid leukemia is a cancer of the white blood cells characterized by the increased and unregulated growth of predominantly myeloid cells in the bone marrow. This study aimed to determine the effect of chronic myeloid leukemia on Dental caries and Oral health status including Gingivitis, Loss of attachment, Plaque index and Calculus index as well as evaluation of salivary flow rate and salivary interleukins-6 and tumor necrosis factor-?. Material and methods: Study group consisted of (75) subjects, (25) were newly diagnosed with chronic myeloid leukemia, (25) were taking medications (Glevic), and (25) were control subjects, all ag

Classifying an overlapping object is one of the main challenges faced by researchers who work in object detection and recognition. Most of the available algorithms that have been developed are only able to classify or recognize objects which are either individually separated from each other or a single object in a scene(s), but not overlapping kitchen utensil objects. In this project, Faster R-CNN and YOLOv5 algorithms were proposed to detect and classify an overlapping object in a kitchen area.  The YOLOv5 and Faster R-CNN were applied to overlapping objects where the filter or kernel that are expected to be able to separate the overlapping object in the dedicated layer of applying models. A kitchen utensil benchmark image database and

Software-defined networking (SDN) presents novel security and privacy risks, including distributed denial-of-service (DDoS) attacks. In response to these threats, machine learning (ML) and deep learning (DL) have emerged as effective approaches for quickly identifying and mitigating anomalies. To this end, this research employs various classification methods, including support vector machines (SVMs), K-nearest neighbors (KNNs), decision trees (DTs), multiple layer perceptron (MLP), and convolutional neural networks (CNNs), and compares their performance. CNN exhibits the highest train accuracy at 97.808%, yet the lowest prediction accuracy at 90.08%. In contrast, SVM demonstrates the highest prediction accuracy of 95.5%. As such, an

Survival analysis is widely applied to data that described by the length of time until the occurrence of an event under interest such as death or other important events. The purpose of this paper is to use the dynamic methodology which provides a flexible method, especially in the analysis of discrete survival time, to estimate the effect of covariate variables through time in the survival analysis on dialysis patients with kidney failure until death occurs. Where the estimations process is completely based on the Bayes approach by using two estimation methods: the maximum A Posterior (MAP) involved with Iteratively Weighted Kalman Filter Smoothing (IWKFS) and in combination with the Expectation Maximization (EM) algorithm. While the other

Choosing an appropriate impression material is a challenge for many dentists, yet an essential component to provide an excellent clinical outcome and improve productivity and profit. The purpose of present study was to compare wettability, tear strength and dimensional accuracy of three elastomeric impression materials, with the same consistencies (light-body). Three commercially available light body consistency and regular set 3M ESPE Express polyvinylsiloxane (PVS), 3M ESPE Permadyne polyether (PE), and Identium (ID), impression materials were comparedTear strength test, contact angle test and linear dimensional accuracy were evaluated for three elastic impression material. Among the three experimental groups PE impression materia

The goal of this work is to check the presence of PNS (photon number splitting) attack in quantum cryptography system based on BB84 protocol, and to get a maximum secure key length as possible. This was achieved by randomly interleaving decoy states with mean photon numbers of 5.38, 1.588 and 0.48 between the signal states with mean photon numbers of 2.69, 0.794 and 0.24. The average length for a secure key obtained from our system discarding the cases with Eavesdropping was equal to 125 with 20 % decoy states and 82 with 50% decoy states for mean photon number of 0.794 for signal states and 1.588 for decoy states.