In This paper, we introduce the associated graphs of commutative KU-algebra. Firstly, we define the KU-graph which is determined by all the elements of commutative KU-algebra as vertices. Secondly, the graph of equivalence classes of commutative KU-algebra is studied and several examples are presented. Also, by using the definition of graph folding, we prove that the graph of equivalence classes and the graph folding of commutative KU-algebra are the same, where the graph is complete bipartite graph.
The aim of this paper is to introduce the notion of hyper fuzzy AT-ideals on hyper AT-algebra. Also, hyper fuzzy AT-subalgebras and fuzzy hyper AT-ideal of hyper AT-algebras are studied. We study on the fuzzy theory of hyper AT-subalgebras and hyper AT-ideal of hyper AT-algebras. Furthermore, the fuzzy set theory of the (weak, strong, s-weak) hyper fuzzy ATideals in hyper AT-algebras are applied and the relations among them are obtained.
We introduce the notion of interval value fuzzy ideal of TM-algebra as a generalization of a fuzzy ideal of TM-algebra and investigate some basic properties. Interval value fuzzy ideals and T-ideals are defined and several examples are presented. The relation between interval value fuzzy ideal and fuzzy T-ideal is studied. Abstract We introduce the notion of interval value fuzzy ideal of TM-algebra as a generalization of a fuzzy ideal of TM-algebra and investigate some basic properties. Interval value fuzzy ideals and T- ideals are defined and several examples are presented. The relation between interval value fuzzy ideal and fuzzy T-ideal is studied.
Cancer is in general not a result of an abnormality of a single gene but a consequence of changes in many genes, it is therefore of great importance to understand the roles of different oncogenic and tumor suppressor pathways in tumorigenesis. In recent years, there have been many computational models developed to study the genetic alterations of different pathways in the evolutionary process of cancer. However, most of the methods are knowledge-based enrichment analyses and inflexible to analyze user-defined pathways or gene sets. In this paper, we develop a nonparametric and data-driven approach to testing for the dynamic changes of pathways over the cancer progression. Our method is based on an expansion and refinement of the pathway bei
... Show MoreAnomaly detection is still a difficult task. To address this problem, we propose to strengthen DBSCAN algorithm for the data by converting all data to the graph concept frame (CFG). As is well known that the work DBSCAN method used to compile the data set belong to the same species in a while it will be considered in the external behavior of the cluster as a noise or anomalies. It can detect anomalies by DBSCAN algorithm can detect abnormal points that are far from certain set threshold (extremism). However, the abnormalities are not those cases, abnormal and unusual or far from a specific group, There is a type of data that is do not happen repeatedly, but are considered abnormal for the group of known. The analysis showed DBSCAN using the
... Show MoreLet be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of the minimum neighborhood dominating set of a graph is called as minimum neighborhood dominating number and it is denoted by . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the
... Show MoreIn this paper is to introduce the concept of hyper AT-algebras is a generalization of AT-algebras and study a hyper structure AT-algebra and investigate some of its properties. “Also, hyper AT-subalgebras and hyper AT-ideal of hyper AT-algebras are studied. We study on the fuzzy theory of hyper AT-ideal of hyper AT-algebras hyper AT-algebra”. “We study homomorphism of hyper AT-algebras which are a common generalization of AT-algebras.
Let A be a unital algebra, a Banach algebra module M is strongly fully stable Banach A-module relative to ideal K of A, if for every submodule N of M and for each multiplier θ : N → M such that θ(N) ⊆ N ∩ KM. In this paper, we adopt the concept of strongly fully stable Banach Algebra modules relative to an ideal which generalizes that of fully stable Banach Algebra modules and we study the properties and characterizations of strongly fully stable Banach A-module relative to ideal K of A.
Assume that G ≅ HN the Harada–Norton group. In this paper, effective investment for the graph ΓRI HN standard features to acquire meaningful algebraic results for the graph ΓRI HN and its corresponding group HN. For instance, marketing a modern methods to understand the way of create a precise small subgroups in G. Furthermore, performing a full investigation for getting particular ΓRI HN parameters.
In this paper, we define a cubic positive implicative-ideal, a cubic implicative-ideal and a cubic commutative-ideal of a semigroup in KU-algebra as a generalization of a fuzzy (positive implicative-ideal, an implicative-ideal and a commutative-ideal) of a semigroup in KU-algebra. Some relations between these types of cubic ideals are discussed. Also, some important properties of these ideals are studied. Finally, some important theories are discussed. It is proved that every cubic commutative-ideal, cubic positive implicative-ideal, and cubic implicative-ideal are a cubic ideal, but not conversely. Also, we show that if Θ is a cubic positive implicative-ideal and a cubic commutative-ideal then Θ is a cubic implicative-ideal. Some example
... Show MoreAdvances 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 More