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.
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.
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.
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.
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.
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.
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 (
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 MoreThe 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.
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