In this paper, certain types of regularity of topological spaces have been highlighted, which fall within the study of generalizations of separation axioms. One of the important axioms of separation is what is called regularity, and the spaces that have this property are not few, and the most important of these spaces are Euclidean spaces. Therefore, limiting this important concept to topology is within a narrow framework, which necessitates the use of generalized open sets to obtain more good characteristics and preserve the properties achieved in general topology. Perhaps the reader will realize through the research that our generalization preserved most of the characteristics, the most important of which is the hereditary property. Two t

It is shown that if a subset of a topological space (χ, τ) is δ-semi.closed, then it is semi.closed. By use this fact, we introduce the concept regularity of a topological space (χ, τ) via δ-semi.open sets. Many properties and results were investigated and studied. In addition we study some maps that preserve the δ-semi.regularity of spaces.

Die Forschung besteht aus zwei Kapiteln: das erste Kapitel geht es nur um die Form des Gedichts, aber das zweite Kapitel geht es um die Analyse des Gedichts, und das ist das Wesen der Arbeit, gleichzeitig enthält das zweite Kapitel auch zwei wichtige Disziplinen.

Die erste Disziplin handelt es sich um die Struktur des Gedichts, nämlich die lyrische Seite; Reim,Rhythmus,Strophe,und Versmaße, aber die zweite Disziplin handelt es sich um den Inhalt, erklärt hier sowohl das Wesen als auch das Ziel des Gedichts, denn das Gedicht besteht aus vier Strophen, die miteinander zu sehr nicht getrennt sind.

Der Dichter beschreibt in erster Strophe die Beziehung zwischen einem Paar, das genau acht Jahre zusammen gelebt hat. Die bei

Many of the key stream generators which are used in practice are LFSR-based in the sense that they produce the key stream according to a rule y = C(L(x)), where L(x) denotes an internal linear bit stream, produced by small number of parallel linear feedback shift registers (LFSRs), and C denotes some nonlinear compression function. In this paper we combine between the output sequences from the linear feedback shift registers with the sequences out from non linear key generator to get the final very strong key sequence

Let  be a commutative ring with identity, and  be a unitary left -module. In this paper we introduce the concept pseudo weakly closed submodule as a generalization of -closed submodules, where a submodule  of an -module  is called a pseudo weakly closed submodule, if for all , there exists a -closed submodule  of  with  is a submodule of  such that . Several basic properties, examples and results of pseudo weakly closed submodules are given. Furthermore the behavior of pseudo weakly closed submodules in class of multiplication modules are studied. On the other hand modules with chain conditions on pseudo weakly closed submodules are established. Also, the relationships of  pseudo weakly closed

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

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.

Vorwort :
Bernd Heinrich von Kleist wurde am 18. Oktober 1777 in Frankfurt an der Oder geboren . 1 1794 schrieb Kleist seinen ersten Aufsatz , der Aufsatz , den sichern Weg des Glücks zu finden heißt . Diese frühe Schrift bestimmet die Ideen der Aufklärung , besonders die von Vernunft und Tugend . 2
Obwohl Kleist der Sohn eines Offizier war , fand er im Militär keine Erfüllung , und im Jahre 1799 verliess er das Militär . Im Jahre 1800 verlobte er sich mit Wilhelmine von Zonge . 3
Nachdem er im Jahre 1801 die Philosophie von Kant gelesen hatte , erlebte Kleist seine erste Gemütskries . Kleist hatte immer der Vernunft den höchsten Wert gegeben , aber er fühlte , dass es etwas Anders gab .
Seine Verlobte wollte keine

      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