Preferred Language
Articles
/
1xaoj4cBVTCNdQwC6VXQ
Weakly (resp., Closure, Strongly) Perfect Mappings
...Show More Authors

In this paper the concepts of weakly (resp., closure, strongly) Perfect Mappings are defined and the important relationships are studied: (a) Comparison between deferent forms of perfect mappings. (b) Relationship between compositions of deferent forms of perfect mappings. (c) Investigate relationships between deferent forms of perfect mappings and their graphs mappings.

Preview PDF
Quick Preview PDF
Publication Date
Thu Apr 27 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
On Semi-p-Proper Mappings
...Show More Authors

  The aim of this paper is to introduce a new type of proper mappings called semi-p-proper mapping by using semi-p-open sets, which is weaker than the proper mapping. Some properties and characterizations of this type of mappings are given.

View Publication Preview PDF
Publication Date
Thu Sep 05 2019
Journal Name
Journal Of Al-qadisiyah For Computer Science And Mathematics
Strongly (E,F)-convexity with applications to optimization problems
...Show More Authors

In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex. 

View Publication
Crossref (1)
Crossref
Publication Date
Sat Jan 01 2011
Journal Name
Journal Of Computer Sciences
Connectedness in Graphs and Gm-Closure Spaces
...Show More Authors

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

Preview PDF
Publication Date
Mon Feb 01 2016
Journal Name
International Journal Of Mathematics Trends And Technology
Rough and Near Rough Probability in Gm-Closure Spaces
...Show More Authors

The primary aim of this paper, is to introduce the rough probability from topological view. We used the Gm-topological spaces which result from the digraph on the stochastic approximation spaces to upper and lower distribution functions, the upper and lower mathematical expectations, the upper and lower variances, the upper and lower standard deviation and the upper and lower r th moment. Different levels for those concepts are introduced, also we introduced some results based upon those concepts.

View Publication Preview PDF
Publication Date
Wed Oct 20 2021
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Zenali Iteration Method For Approximating Fixed Point of A δZA - Quasi Contractive mappings
...Show More Authors

This article will introduce a new iteration method called the zenali iteration method for the approximation of fixed points. We show that our iteration process is faster than the current leading iterations  like Mann, Ishikawa, oor, D- iterations, and *-  iteration for new contraction mappings called  quasi contraction mappings. And we  proved that all these iterations (Mann, Ishikawa, oor, D- iterations and *-  iteration) equivalent to approximate fixed points of  quasi contraction. We support our analytic proof by a numerical example, data dependence result for contraction mappings type  by employing zenali iteration also discussed.

View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Sun Nov 17 2019
Journal Name
Journal Of Interdisciplinary Mathematics
Fixed point of set-valued mappings
...Show More Authors

View Publication
Scopus (1)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
g-Closed Soft Sets in Soft Closure Spaces
...Show More Authors
Abstract<p>The aim of the present work is to define a new class of closed soft sets in soft closure spaces, namely, generalized closed soft sets (<italic>gc</italic>-soft sets, for short) which are defined over an initial universe set with a fixed set of parameters. This new class is a generalization to the class of closed soft sets. A necessary condition for a <italic>gc</italic>-soft set to be a soft closed is also obtainable. Moreover, the union and intersection of two <italic>gc</italic>-soft sets are discussed. Besides, some properties of <italic>gc</italic>-soft sets in the product soft closure spaces are also studied. Also, as an application of <jat></jat></p> ... Show More
View Publication
Scopus Crossref
Publication Date
Tue May 30 2023
Journal Name
Iraqi Journal Of Science
Strongly Essential Submodules and Modules with the se-CIP
...Show More Authors

     Let  be a ring with identity. Recall that a submodule  of a left -module  is called strongly essential if for any nonzero subset  of , there is  such that , i.e., . This paper introduces a class of submodules called se-closed, where a submodule  of  is called se-closed if it has no proper strongly essential extensions inside . We show by an example that the intersection of two se-closed submodules may not be se-closed. We say that a module  is have the se-Closed Intersection Property, briefly se-CIP, if the intersection of every two se-closed submodules of  is again se-closed in . Several characterizations are introduced and studied for each of these concepts. We prove for submodules  and  of  that a module  has the

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Sun Jan 01 2012
Journal Name
International Journal Of Computer Science Issues (ijcsi)
Near Rough and Near Exact Subgraphs in Gm-Closure spaces
...Show More Authors

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

Preview PDF
Publication Date
Thu Oct 01 2015
Journal Name
Journal Of The Faculty Of Medicine Baghdad
Bladder exstrophy closure using anterior pelvic osteotomy of superior pubic rami
...Show More Authors

Background: Bladder exstrophy is a rare and complex urogenital malformation. The current surgical approach consists of early closure followed by other procedures later on aiming for continence. Primary closure usually requires some form of osteotomy to facilitate successful bladder and abdominal wall repair. For decades, bilateral posterior iliac osteotomy has been the most commonly used technique. A new osteotomy technique, consisting of anterior pelvic ostecotomy of the superior pubic ramus, seems to be a safe and quick alternative method to obtain tension-free approximation of the symphysis pubis
Patients and methods: A prospective study between 2006 and 2013, were 10 (9 males and 1 female) newborns underwent surgery for bladder ex

... Show More
View Publication Preview PDF
Crossref