This paper is concerned with introducing and studying the o-space by using out degree system (resp. i-space by using in degree system) which are the core concept in this paper. In addition, the m-lower approximations, the m-upper approximations and ospace and i-space. Furthermore, we introduce near supraopen (near supraclosed) d. g.'s. Finally, the supra-lower approximation, supraupper approximation, supra-accuracy are defined and some of its properties are investigated.
The "Nudge" Theory is considered one of the most recent theories, which is clear in the economic, health, and educational sectors, due to the intensity of studies on it and its applications, but it has not yet been included in crime prevention studies. The use of Nudge theory appears to enrich the theory in the field of crime prevention, and to provide modern, effective, and implementable mechanisms.
The study deals with the "integrative review" approach, which is a distinctive form of research that generates new knowledge on a topic through reviewing, criticizing, and synthesizing representative literature on the topic in an integrated manner so that new frameworks and perspectives are created around it.
The study is bas
... Show MoreThis study has applied the theoretical framework of conceptual metaphor theory to the analysis of the source and target domains of metaphors that are used in two English nineteenth century sonnets, both written by contemporaneous female poets. The quantitative and qualitative results of the textual analysis have clearly revealed that Elizabeth Barrett Browning’s sonnet 23 centres around the conceptual mapping of the journey of love and life with that of possession. In contrast, Christina Rossetti’s sonnet Remember tackles the central conceptual mapping of death as a journey in relation to its further experiential connections. In addition, the application of conceptual metaphor theory in identifying the frequencies and densities of metap
... Show MoreA complete metric space is a well-known concept. Kreyszig shows that every non-complete metric space can be developed into a complete metric space , referred to as completion of .
We use the b-Cauchy sequence to form which “is the set of all b-Cauchy sequences equivalence classes”. After that, we prove to be a 2-normed space. Then, we construct an isometric by defining the function from to ; thus and are isometric, where is the subset of composed of the equivalence classes that contains constant b-Cauchy sequences. Finally, we prove that is dense in , is complete and the uniqueness of is up to isometrics
In this paper, game theory was used and applied to the transport sector in Iraq, as this sector includes two axes, the public transport axis and the second axis the private transport axis, as each of these axes includes several types of transport, namely (sea transport, air transport, land transport, transport by rail, port transport) and the travel and tourism sector, as public transport lacks this sector, as the competitive advantage matrix for the transport sector was formed and after applying the MinMax-MaxMin principle to the matrix in all its stages, it was found that there was an equilibrium point except for the last stage where the equilibrium point was not available Therefore, the use of the linear programming method was
... Show MoreIn 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.
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, a new idea to configure a special graph from the discrete topological space is given. Several properties and bounds of this topological graph are introduced. Such that if the order of the non-empty set equals two, then the topological graph is isomorphic to the complete graph. If the order equals three, then the topological graph is isomorphic to the complement of the cycle graph. Our topological graph has complete induced subgraphs with order or more. It also has a cycle subgraph. In addition, the clique number is obtained. The topological graph is proved simple, undirected, connected graph. It has no pendant vertex, no isolated vertex and no cut vertex. The minimum and maximum degrees are evaluated. So , the radius
... 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 MoreCryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to
... Show More