This paper is mainly concerned with the study of the moral aspects that prompts William Shakespeare to attempt a romance in which he has embedded the epitome of his thought, experience, and philosophy concerning certain significant aspects of human life whose absence or negligence may threaten human existence, peace, and stability. From the beginning of history man realizes the importance of prosperity on the many and various levels that touch and address his needs and desires—natural, material,  and spiritual. The Tempest, due to the dramatist's awareness of the aforementioned values, reflects the dramatist's duty as to projecting and unfolding these important aspects, rec

Irrigation scheduling techniques is one of the suggested solutions for water scarcity problem. The study aims to show the possibility of using practical and applicable irrigation scheduling program which was designed by Water Resources Department at the University of Baghdad by using Spreadsheet Formulas for Microsoft Excel program, version 2007, with some modification to generalize it and made it applicable to various climatic zone and different soil types, as a salvation for the shortage of irrigation water inside the irrigation projects. Irrigation projects which incidence of Tigris River basin will be taken as an applicable example. This program was based on water budgeting and programmed depending on scientific concepts which facili

      The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then A is called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi

The structure of this paper includes an introduction to the definition of the nano topological space, which was defined by M. L. Thivagar, who defined the lower approximation of G and the upper approximation of G, as well as defined the boundary region of G and some other important definitions that were mentioned in this paper with giving some theories on this subject. Some examples of defining nano perfect mappings are presented along with some basic theories. Also, some basic definitions were presented that form the focus of this paper, including the definition of nano  pseudometrizable space, the definition of nano compactly generated space, and the definition of completely nano para-compact. In this paper, we presented images of nan