Today the Genetic Algorithm (GA) tops all the standard algorithms in solving complex nonlinear equations based on the laws of nature. However, permute convergence is considered one of the most significant drawbacks of GA, which is known as increasing the number of iterations needed to achieve a global optimum. To address this shortcoming, this paper proposes a new GA based on chaotic systems. In GA processes, we use the logistic map and the Linear Feedback Shift Register (LFSR) to generate chaotic values to use instead of each step requiring random values. The Chaos Genetic Algorithm (CGA) avoids local convergence more frequently than the traditional GA due to its diversity. The concept is using chaotic sequences with LFSR to gene

     The widespread use of images, especially color images and rapid advancement of computer science, have led to an emphasis on securing these images and defending them against intruders. One of the most popular ways to protect images is to use encryption algorithms that convert data in a way that is not recognized by someone other than the intended user. The Advanced Encryption Standard algorithm (AES) is one of the most protected encryption algorithms. However, due to various types of theoretical and practical assaults, like a statistical attack, differential analysis, and brute force attack, its security is under attack.

In this paper, a modified AES coined as (M-AES) is proposed to improve the efficiency

    In data mining and machine learning methods, it is traditionally assumed that training data, test data, and the data that will be processed in the future, should have the same feature space distribution. This is a condition that will not happen in the real world. In order to overcome this challenge, domain adaptation-based methods are used. One of the existing challenges in domain adaptation-based methods is to select the most efficient features so that they can also show the most efficiency in the destination database. In this paper, a new feature selection method based on deep reinforcement learning is proposed. In the proposed method, in order to select the best and most appropriate features, the essential policies

In the present work, an image compression method have been modified by combining The Absolute Moment Block Truncation Coding algorithm (AMBTC) with a VQ-based image coding. At the beginning, the AMBTC algorithm based on Weber's law condition have been used to distinguish low and high detail blocks in the original image. The coder will transmit only mean of low detailed block (i.e. uniform blocks like background) on the channel instate of transmit the two reconstruction mean values and bit map for this block. While the high detail block is coded by the proposed fast encoding algorithm for vector quantized method based on the Triangular Inequality Theorem (TIE), then the coder will transmit the two reconstruction mean values (i.e. H&L)

Most recognition system of human facial emotions are assessed solely on accuracy, even if other performance criteria are also thought to be important in the evaluation process such as sensitivity, precision, F-measure, and G-mean. Moreover, the most common problem that must be resolved in face emotion recognition systems is the feature extraction methods, which is comparable to traditional manual feature extraction methods. This traditional method is not able to extract features efficiently. In other words, there are redundant amount of features which are considered not significant, which affect the classification performance. In this work, a new system to recognize human facial emotions from images is proposed. The HOG (Histograms of Or

Faces blurring is one of the important complex processes that is considered one of the advanced computer vision fields. The face blurring processes generally have two main steps to be done. The first step has detected the faces that appear in the frames while the second step is tracking the detected faces which based on the information extracted during the detection step. In the proposed method, an image is captured by the camera in real time, then the Viola Jones algorithm used for the purpose of detecting multiple faces in the captured image and for the purpose of reducing the time consumed to handle the entire captured image, the image background is removed and only the motion areas are processe

This work aimed to use effective, low-cost, available, and natural adsorbents like eggshells for removal of  hazardous organic dye result from widely number of  industries and study the influence of different eggshell particle size (75, 150) Mm.  The adsorbent was characterized by SEM, EDX, BET and FTIR . The initial pH of dye solutions  varying from 4 to 10 , the initial concentrations of methyl violet (MV) 2B range (20-80) mg/L, dosage range (0.5-10) g, contact time (30-180) min, and particles size of the adsorbent (75, 150) Mm were selected to be studied. Two adsorption isotherms models have been used to fit the experimental data. Langmuir and Freunlich models were found to more represent the experiments with high

Background: Odontogenic tumors are a diverse group of lesions with a variety of clinical behavior and histopathologic subtypes, from hamartomatous and benign to malignant. The study aimed to examine the clinical and pathological features of odontogenic tumors in Baghdad over the last 11 years (2011–2021). Materials and Methods: The present retrospective study analyzed all formalin-fixed, paraffin-embedded tissue blocks of patients diagnosed with an odontogenic tumor that were retrieved from archives at a teaching hospital/College of Dentistry in Baghdad University, Iraq, between 2011 and 2021. The diagnosis of each case was confirmed by examining the hematoxylin and eosin stained sections by two expert pathologists. Data from pati