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

In this paper, we introduce the concept of almost Quasi-Frobcnius fuzzy ring as a " " of Quasi-Frobenius ring. We give some properties about this concept with qoutient fuzzy ring. Also, we study the fuzzy external direct sum of fuzzy rings.

    In this paper, we formulate and study a new property, namely indeterminacy (neutrosophic) of the hollow module. We mean indeterminacy hollow module is neutrosophic hollow module B (shortly Ne(B)) such that it is not possible to specify the conditions for satisfying it.  Some concepts have been studied and introduced, for instance, the indeterminacy local module, indeterminacy divisible module, indeterminacy indecomposable module and indeterminacy hollow-lifting module. Also, we investigate that if Ne(B) is an indeterminacy divisible module with no indeterminacy zero divisors, then any indeterminacy submodule Ne(K) of Ne(B) is an indeterminacy hollow module. Further, we study the relationship between the indeterminacy of hollow an

In this research we will present the signature as a key to the biometric authentication technique. I shall use moment invariants as a tool to make a decision about any signature which is belonging to the certain person or not. Eighteen voluntaries give 108 signatures as a sample to test the proposed system, six samples belong to each person were taken. Moment invariants are used to build a feature vector stored in this system. Euclidean distance measure used to compute the distance between the specific signatures of persons saved in this system and with new sample acquired to same persons for making decision about the new signature. Each signature is acquired by scanner in jpg format with 300DPI. Matlab used to implement this system.

   In this paper, we introduce a new type of functions in bitopological spaces, namely, (1,2)*-proper functions. Also, we study the basic properties and characterizations of these functions . One of the most important of equivalent definitions to the (1,2)*-proper functions is given by using (1,2)*-cluster points of filters . Moreover we define and study (1,2)*-perfect functions and (1,2)*-compact functions in bitopological spaces and we study the relation between (1,2)*-proper functions and each of (1,2)*-closed functions , (1,2)*-perfect functions and (1,2)*-compact functions and we give an example when the converse may not be true .
 

In this paper, we introduce and study the concepts of hollow – J–lifting modules and FI – hollow – J–lifting modules as a proper generalization of both hollow–lifting and J–lifting modules . We call an R–module M as hollow – J – lifting if for every submodule N of M with is hollow, there exists a submodule K of M such that M = K Ḱ and K N in M . Several characterizations and properties of hollow –J–lifting modules are obtained . Modules related to hollow – J–lifting modules are  given .

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

      In current generation of technology, a robust security system is required based on biometric trait such as human gait, which is a smooth biometric feature to understand humans via their taking walks pattern. In this paper, a person is recognized based on his gait's style that is captured from a video motion previously recorded with a digital camera. The video package is handled via more than one phase after splitting it into a successive image (called frames), which are passes through a preprocessing step earlier than classification procedure operation. The pre-processing steps encompass converting each image into a gray image, cast off all undesirable components and ridding it from noise, discover differen

Audio classification is the process to classify different audio types according to contents. It is implemented in a large variety of real world problems, all classification applications allowed the target subjects to be viewed as a specific type of audio and hence, there is a variety in the audio types and every type has to be treatedcarefully according to its significant properties.Feature extraction is an important process for audio classification. This workintroduces several sets of features according to the type, two types of audio (datasets) were studied. Two different features sets are proposed: (i) firstorder gradient feature vector, and (ii) Local roughness feature vector, the experimentsshowed that the results are competitive to