In this paper, we apply the notion of a bipolar fuzzy n-fold KU-ideal of KU- algebras. We introduce the concept of a bipolar fuzzy n-fold KU-ideal and investigate several properties. Also, we give relations between a bipolar fuzzy n- fold KU-ideal and n-fold KU-ideal. The image and the pre-image of bipolar fuzzy n-fold KU-ideals in KU-algebras are defined and how the image and the pre- image of bipolar fuzzy n-fold KU-ideals in KU-algebras become bipolar fuzzy n- fold KU-ideals are studied. Moreover, the product of bipolar fuzzy n-fold KU- ideals in Cartesian product KU-algebras is given.

The notion of interval value fuzzy k-ideal of KU-semigroup was studied as a generalization of afuzzy k-ideal of KU-semigroup. Some results of this idea under homomorphism are discussed. Also, we presented some properties about the image (pre-image) for interval~ valued fuzzy~k-ideals of a KU-semigroup. Finally, the~ product of~ interval valued fuzzyk-ideals is established.

In this paper, Min-Max composition fuzzy relation equation are studied. This study is a generalization of the works of Ohsato and Sekigushi. The conditions for the existence of solutions are studied, then the resolution of equations is discussed.

To maintain the security and integrity of data, with the growth of the Internet and the increasing prevalence of transmission channels, it is necessary to strengthen security and develop several algorithms. The substitution scheme is the Playfair cipher. The traditional Playfair scheme uses a small 5*5 matrix containing only uppercase letters, making it vulnerable to hackers and cryptanalysis. In this study, a new encryption and decryption approach is proposed to enhance the resistance of the Playfair cipher. For this purpose, the development of symmetric cryptography based on shared secrets is desired. The proposed Playfair method uses a 5*5 keyword matrix for English and a 6*6 keyword matrix for Arabic to encrypt the alphabets of

In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c

The aim of this research is to compare traditional and modern methods to obtain the optimal solution using dynamic programming and intelligent algorithms to solve the problems of project management.

It shows the possible ways in which these problems can be addressed, drawing on a schedule of interrelated and sequential activities And clarifies the relationships between the activities to determine the beginning and end of each activity and determine the duration and cost of the total project and estimate the times used by each activity and determine the objectives sought by the project through planning, implementation and monitoring to maintain the budget assessed 

This study examines the validity of e-poetry as an acceptable literary genre. The
thematic, stylistic and esthetic features of a selected number of e-poems produced by
poetry generators are analyzed for this purpose. The e-poems are then compared with a
number of works written by Dada poets in order to establish the literary merit of the
former.

Optimization is essentially the art, science and mathematics of choosing the best among a given set of finite or infinite alternatives. Though currently optimization is an interdisciplinary subject cutting through the boundaries of mathematics, economics, engineering, natural sciences, and many other fields of human Endeavour it had its root in antiquity. In modern day language the problem mathematically is as follows - Among all closed curves of a given length find the one that closes maximum area. This is called the Isoperimetric problem. This problem is now mentioned in a regular fashion in any course in the Calculus of Variations. However, most problems of antiquity came from geometry and since there were no general methods to solve suc