In thisˑ paperˑ, we apply the notion ofˑ intuitionisticˑ fuzzyˑ n-fold KU-ideal of KU-algebra. Some types of ideals such as intuitionistic fuzzy KU-ideal, intuitionisticˑ fuzzy closed idealˑ and intuitionistic fuzzy n-fold KU-ideal are studied. Also, the relations between intuitionistic fuzzy n-fold KU-ideal and intuitionistic fuzzy KU-ideal are discussed. Furthermore, aˑ fewˑ results of intuitionisticˑ fuzzyˑ n-ˑfold KU-ideals of a KU-algebra underˑ homomorphismˑ are discussed.
In this paper, we introduce the notions of Complete Pseudo Ideal, K-pseudo Ideal, Complete K-pseudo Ideal in pseudo Q-algebra. Also, we give some theorems and relationships among them are debated.
Advances in digital technology and the World Wide Web has led to the increase of digital documents that are used for various purposes such as publishing and digital library. This phenomenon raises awareness for the requirement of effective techniques that can help during the search and retrieval of text. One of the most needed tasks is clustering, which categorizes documents automatically into meaningful groups. Clustering is an important task in data mining and machine learning. The accuracy of clustering depends tightly on the selection of the text representation method. Traditional methods of text representation model documents as bags of words using term-frequency index document frequency (TFIDF). This method ignores the relationship an
... Show MoreThis dissertation depends on study of the topological structure in graph theory as well as introduce some concerning concepts, and generalization them into new topological spaces constructed using elements of graph. Thus, it is required presenting some theorems, propositions, and corollaries that are available in resources and proof which are not available. Moreover, studying some relationships between many concepts and examining their equivalence property like locally connectedness, convexity, intervals, and compactness. In addition, introducing the concepts of weaker separation axioms in α-topological spaces than the standard once like, α-feebly Hausdorff, α-feebly regular, and α-feebly normal and studying their properties. Furthermor
... Show Morein this article, we present a definition of k-generalized map independent of non-expansive map and give infinite families of non-expansive and k-generalized maps new iterative algorithms. Such algorithms are also studied in the Hilbert spaces as the potential to exist for asymptotic common fixed point.
Background: Complete analysis of facial profile should also include an evaluation of soft tissue morphology. Materials and Method:The sample consisted of 90 Iraqi adults (45 males and 45 females) aged 18-25 years from Baghdad city divided into 3 groups according to the ANB angle with 30 subjects in each group (15 males and 15 females) for class I, II and III. Lateral cephalometric radiograph was taken for each subject and 8 angular and 5 linear measurements were identified and determined, t-test, ANOVA and LSD test were used to compare between both genders and between different classes. Results:Showed that females had greater angular measurements and smaller linear measurements with more lip prominence than males in all classes, there was m
... Show MoreIn this paper the full stable Banach gamma-algebra modules, fully stable Banach gamma-algebra modules relative to ideal are introduced. Some properties and characterizations of these classes of full stability are studied.
KE Sharquie, AF Hameed, AA Noaimi, Indian Journal of Pathology and Microbiology, 2016 - Cited by 12
The research aims to find approximate solutions for two dimensions Fredholm linear integral equation. Using the two-variables of the Bernstein polynomials we find a solution to the approximate linear integral equation of the type two dimensions. Two examples have been discussed in detail.
Data security is an important component of data communication and transmission systems. Its main role is to keep sensitive information safe and integrated from the sender to the receiver. The proposed system aims to secure text messages through two security principles encryption and steganography. The system produced a novel method for encryption using graph theory properties; it formed a graph from a password to generate an encryption key as a weight matrix of that graph and invested the Least Significant Bit (LSB) method for hiding the encrypted message in a colored image within a green component. Practical experiments of (perceptibility, capacity, and robustness) were calculated using similarity measures like PSNR, MSE, and
... Show More