An automatic text summarization system mimics how humans summarize by picking the most ‎significant sentences in a source text. However, the complexities of the Arabic language have become ‎challenging to obtain information quickly and effectively. The main disadvantage of the ‎traditional approaches is that they are strictly constrained (especially for the Arabic language) by the ‎accuracy of sentence feature ‎functions, weighting schemes, ‎and similarity calculations. On the other hand, the meta-heuristic search approaches have a feature tha

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

       Based on the German language department’s theoretical and practical aspects as well as educational programs, the present study discusses the semantic relations in text sentences and their role in the science of translation.  Through clarifying the semantic relationship between the text sentence and the methods used to express a news item, a situation or an occurrence and through the statement of the multiple theoretical semantic structures of the text’s construction and interrelation, a translator can easily translate a text into the target language.

        It is known that language learners face multiple difficulties in writing and creating an inte

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.

This 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

The purpose of this resesrh know (the effectiveness of cooperative lerarning implementation of floral material for calligraphy and ornamentation) To achieve the aim of the research scholar put the two zeros hypotheses: in light of the findings of the present research the researcher concluded a number of conclusions, including: -
1 - Sum strategy helps the learner to be positive in all the information and regulations, monitoring and evaluation during the learning process.
2 - This strategy helps the learner to use information and knowledge and their use in various educational positions, and to achieve better education to increase its ability to develop thinking skills and positive trends towards the article.
In light of this, the

Steganography can be defined as the art and science of hiding information in the data that could be read by computer. This science cannot recognize stego-cover and the original one whether by eye or by computer when seeing the statistical samples. This paper presents a new method to hide text in text characters. The systematic method uses the structure of invisible character to hide and extract secret texts. The creation of secret message comprises four main stages such using the letter from the original message, selecting the suitable cover text, dividing the cover text into blocks, hiding the secret text using the invisible character and comparing the cover-text and stego-object. This study uses an invisible character (white space

In this paper, some commonly used hierarchical cluster techniques have been compared. A comparison was made between the agglomerative hierarchical clustering technique and the k-means technique, which includes the k-mean technique, the variant K-means technique, and the bisecting K-means, although the hierarchical cluster technique is considered to be one of the best clustering methods. It has a limited usage due to the time complexity. The results, which are calculated based on the analysis of the characteristics of the cluster algorithms and the nature of the data, showed that the bisecting K-means technique is the best compared to the rest of the other methods used.