In this article, we study the notion of closed Rickart modules. A right R-module M is said to be closed Rickart if, for each , is a closed submodule of M. Closed Rickart modules is a proper generalization of Rickart modules. Many properties of closed Rickart modules are investigated. Also, we provide some characterizations of closed Rickart modules. A necessary and sufficient condition is provided to ensure that this property is preserved under direct sums. Several connections between closed Rickart modules and other classes of modules are given. It is shown that every closed Rickart module is -nonsingular module. Examples which delineate this concept and some results are provided.
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
... Show MoreThe Video effect on Youths Value
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
... Show MoreIn 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 study the effect of group homomorphism on the chain of level subgroups of fuzzy groups. We prove a necessary and sufficient conditions under which the chains of level subgroups of homomorphic images of an a arbitrary fuzzy group can be obtained from that of the fuzzy groups . Also, we find the chains of level subgroups of homomorphic images and pre-images of arbitrary fuzzy groups
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.
We dealt with the nature of the points under the influence of periodic function chaotic functions associated functions chaotic and sufficient conditions to be a very chaotic functions Palace
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 Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show MoreIn 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
... Show More