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

  This research aims to identify the economic design techniques and materials that can be used in the implementation of cosmetic supplements to the spaces of the dwelling. The research relied on the descriptive and analytical approach by describing and analyzing models of design techniques and materials that can be used in the production of cosmetic supplements in the interior spaces of the dwelling.
The results of the research concluded that the beautification of the spaces of the dwelling is one of the necessary and important pieces to add aesthetic touches to the internal spaces, and that the use of economic design techniques and materials contributes to the implementation of many pieces of complementary beautification of the

Our country suffered from pollution translation as a result to the wars events, so, it is necessary to measure the amount of radiation in the fields that are of indirect contact with human life and health. The main aim of the present work is to measure the concentration of alpha emitters in tomato fruits collected from different farms in Al – Basra governorate in the south of Iraq. Nuclear track detectors of type CR – 39 are used as a detection device and Can technique as a detection technique. Results show that the maximum concentration recorded is sample no.7 of site Al – Rafidhya which was equal to (6.9621 ± 0.111) ppm and sample no.1 of site Lothan with concentration equals to (4.9236 ± 0.117) ppm. The minimum concentratio

The importance of topology as a tool in preference theory is what motivates this study in which we characterize topologies generating by digraphs. In this paper, we generalized the notions of rough set concepts using two topological structures generated by out (resp. in)-degree sets of vertices on general digraph. New types of topological rough sets are initiated and studied using new types of topological sets. Some properties of topological rough approximations are studied by many propositions.

Let  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

Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in  is either a pendent vertex or a support vertex and  has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

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.

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.