In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the production of the inverted S-box with the S-box. Compared to the methods in the literature, the need to store the S-box is eliminated. Also, the fabr

Abstract: Word sense disambiguation (WSD) is a significant field in computational linguistics as it is indispensable for many language understanding applications. Automatic processing of documents is made difficult because of the fact that many of the terms it contain ambiguous. Word Sense Disambiguation (WSD) systems try to solve these ambiguities and find the correct meaning. Genetic algorithms can be active to resolve this problem since they have been effectively applied for many optimization problems. In this paper, genetic algorithms proposed to solve the word sense disambiguation problem that can automatically select the intended meaning of a word in context without any additional resource. The proposed algorithm is evaluated on a col

As s widely use of exchanging private information in various communication applications, the issue to secure it became top urgent. In this research, a new approach to encrypt text message based on genetic algorithm operators has been proposed. The proposed approach follows a new algorithm of generating 8 bit chromosome to encrypt plain text after selecting randomly crossover point. The resulted child code is flipped by one bit using mutation operation. Two simulations are conducted to evaluate the performance of the proposed approach including execution time of encryption/decryption and throughput computations. Simulations results prove the robustness of the proposed approach to produce better performance for all evaluation metrics with res

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun

The support vector machine, also known as SVM, is a type of supervised learning model that can be used for classification or regression depending on the datasets. SVM is used to classify data points by determining the best hyperplane between two or more groups. Working with enormous datasets, on the other hand, might result in a variety of issues, including inefficient accuracy and time-consuming. SVM was updated in this research by applying some non-linear kernel transformations, which are: linear, polynomial, radial basis, and multi-layer kernels. The non-linear SVM classification model was illustrated and summarized in an algorithm using kernel tricks. The proposed method was examined using three simulation datasets with different sample

The aim of this paper is to evaluate the rate of contamination in soils by using accurate numerical method as a suitable tool to evaluate the concentration of heavy metals in soil. In particular, 2D –interpolation methods are applied in the models of the spread the metals in different direction.The paper illustrates the importance of the numerical method in different applications, especially nvironment contamination. Basically, there are many roles for approximating functions. Thus, the approximating of function namely the analytical expression may be expressed; the most common type being is polynomials, which are the easy implemented and simplest methods of approximation. In this paper the divided difference formula is used and extended

Numerical simulations are carried out to assess the quality of the circular and square apodize apertures in observing extrasolar planets. The logarithmic scale of the normalized point spread function of these apertures showed sharp decline in the radial frequency components reaching to 10-36 and 10-34 respectively and demonstrating promising results. This decline is associated with an increase in the full width of the point spread function. A trade off must be done between this full width and the radial frequency components to overcome the problem of imaging extrasolar planets.

Journal of Physics: Conference Series PAPER • THE FOLLOWING ARTICLE ISOPEN ACCESS Estimate the Rate of Contamination in Baghdad Soils By Using Numerical Method Luma Naji Mohammed Tawfiq1, Nadia H Al-Noor2 and Taghreed H Al-Noor1 Published under licence by IOP Publishing Ltd Journal of Physics: Conference Series, Volume 1294, Issue 3 Citation Luma Naji Mohammed Tawfiq et al 2019 J. Phys.: Conf. Ser. 1294 032020 DOI 10.1088/1742-6596/1294/3/032020 DownloadArticle PDF References Download PDF 135 Total downloads 88 total citations on Dimensions. Turn on MathJax Share this article Share this content via email Share on Facebook (opens new window) Share on Twitter (opens new window) Share on Mendeley (opens new window) Hide article and author