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.
The study of homomorphisms in cubic sets is considered one of the important concepts that transfer algebraic properties between different structures, so we study a homomorphism of a cubic set of a semigroup in a KU-algebra and defined the product of two cubic sets in this structure. Firstly, we define the image and the inverse image of a cubic set in a KU-semigroup and achieve some results in this notion. Secondly, the Cartesian product of cubic subsets in a KU-semigroup is discussed and some important characteristics are proved.
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
... Show MoreA 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
... Show MoreThis 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
... Show MoreIn this article, we recalled different types of iterations as Mann, Ishikawa, Noor, CR-iteration and, Modified SP_iteration of quasi δ-contraction mappings, and we proved that all these iterations equivalent to approximate fixed points of δ-contraction mappings in Banach spaces.
We present the notion of bipolar fuzzy k-ideals with thresholds (
the research ptesents a proposed method to compare or determine the linear equivalence of the key-stream from linear or nonlinear key-stream
Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. T
... Show More