The aim of this paper is to translate the basic properties of the classical complete normed algebra to the complete fuzzy normed algebra at this end a proof of multiplication fuzzy continuous is given. Also a proof of every fuzzy normed algebra  without identity can be embedded into fuzzy normed algebra  with identity  and  is an ideal in  is given. Moreover the proof of the resolvent set of a non zero element in complete fuzzy normed space is equal to the set of complex numbers is given. Finally basic properties of the resolvent space of a complete fuzzy normed algebra is given.

An intuitionistic fuzzy set was exhibited by Atanassov in 1986 as a generalization of the fuzzy set. So, we introduce cubic intuitionistic structures on a KU-semigroup as a generalization of the fuzzy set of a KU-semigroup. A cubic intuitionistic k-ideal and some related properties are introduced. Also, a few characterizations of a cubic intuitionistic k-ideal are discussed and new cubic intuitionistic fuzzy sets in a KU-semigroup are defined.

For the graph ⁠, the behavior associated with to the majority of the graphical properties of this graph is covered in this article. The reflection of the capabilities of on the Ly constructions is one of the key ideas addressed throughout this paper. For instance, by this technique we can comprehend the mechanism via which groups of relatively tiny structure are exist within Ly.

This dissertation studies the application of equivalence theory developed by Mona Baker in translating Persian to Arabic. Among various translation methodologies, Mona Baker’s bottom-up equivalency approach is unique in several ways. Baker’s translation approach is a multistep process. It starts with studying the smallest linguistic unit, “the word”, and then evolves above the level of words leading to the translation of the entire text. Equivalence at the word level, i.e., word for word method, is the core point of Baker’s approach.

This study evaluates the use of Baker’s approach in translation from Persian to Arabic, mainly because finding the correct equivalence is a major challenge in this translation. Additionall

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc

This study investigates the Linguistic and Conceptual equivalence of Conner’s Revised Scales when applied on a Sudanese sample. Sudanese parents and teachers completed behavior-rating scales on a stratified sample of 200 children. These instruments were based on Conner’s parent -48 and teacher-28 questionnaires. Following a reliable translation into Sudanese Arabic the test-retest reliability of the items and the internal consistency of the original Conner’s' revised scales were explored. The associations between scale scores and between parents and teachers scores were also examined. Both instruments displayed good reliability and the original Conners scales had satisfactory internal consistency. The inter-correlation sugg