Abstract:In this paper, we use ψ-operator in order to get a new version of local function. The concepts of maps, dense, resolvable and Housdorff have been investigated in this paper, as well as modified to be useful in general الخلاصة: استخدمنافيهذاالبحثالعمليةابسايمنأجلالحصولعلىنسخهجديدهمنالدالةالمحلية.وقدتمالتحقيقفيمفاهيمالدوال, الكثافة,المجموعاتالقابلةللحلوفضاءالهاوسدورف,وكذلكتعديلهالتكونمفيدةبشكلعام. Keywords:ψ-operator, dense, resolvable and Housdorff.
Title:Using ψ-Operator to Formulate a New Definition of Local Function
Author:Dr.Luay A.A.AL-Swidi, Dr.Asaad M.A.AL-Hosainy, Reyam Q.M.AL-Feehan
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
On fixed point theorems in fuzzy 2 metric spaces and fuzzy 3-metric spacesAlexander Decker
1) The document discusses fixed point theorems for mappings in fuzzy 2-metric and fuzzy 3-metric spaces.
2) It defines concepts like fuzzy metric spaces, Cauchy sequences, compatible mappings, and proves some fixed point theorems for compatible mappings.
3) The theorems show that under certain contractive conditions on the mappings, there exists a unique common fixed point for the mappings in a complete fuzzy 2-metric or fuzzy 3-metric space.
Generalized fixed point theorems for compatible mapping in fuzzy 3 metric spa...Alexander Decker
This document discusses generalized fixed point theorems for compatible mappings in fuzzy 3-metric spaces. It begins with introductions and preliminaries on fixed point theory, fuzzy metric spaces, and compatible mappings. It then provides new definitions of compatible mappings of types (I) and (II) in fuzzy 3-metric spaces. The main results extend, generalize, and improve previous theorems by proving common fixed point theorems for four mappings under the conditions of compatible mappings of types (I) and (II) in complete fuzzy 3-metric spaces.
Generalized fixed point theorems for compatible mapping in fuzzy 2 metric spa...Alexander Decker
This document discusses generalized fixed point theorems for compatible mappings in fuzzy 2-metric spaces. It begins with introductions and preliminaries on fixed point theory, fuzzy metric spaces, and compatible mappings. It then provides new definitions of compatible mappings of types (I) and (II) in fuzzy-2 metric spaces. The main results extend, generalize, and improve previous theorems by proving common fixed point theorems for four mappings under the condition of compatible mappings of types (I) and (II) in complete fuzzy-2 metric spaces.
P-Pseudo Symmetric Ideals in Ternary Semiringiosrjce
In this paper we introduce and study about pseudo symmetric ideals and P-pseudo symmetric ideals
in ternary semi rings. It is proved that (1) every completely P-Semiprime ideal A in a ternary semi ring T is a Ppseudo
symmetric ideal, (2) If A is a P-pseudo symmetric ideal of a ternary semi ring T then (i) A2 = {x : xn ∈ A
for some odd natural number n∈ N} is a minimal completely P-Semiprime ideal of T, (ii) A4 = {x : < x >n
A
for some odd natural number n} is the minimal P-Semiprime ideal of T containing A, (3) Every P-prime ideal Q
minimal relative to containing a P-pseudo symmetric ideal A in a ternary semi ring T is completely P-prime,
and (4) Let A be an ideal of a ternary semi ring T. Then A is completely P-prime iff A is P-prime and P-pseudo
symmetric. Further we introduced the terms pseudo symmetric ternary semi ring and P-pseudo symmetric
ternary semi ring. It is proved that (1) Every commutative ternary semi ring is a pseudo symmetric ternary semi
ring, (2) Every commutative ternary semi ring is a P-pseudo symmetric ternary semi ring, (3) Every pseudo
commutative ternary semi ring is a P-pseudo symmetric ternary semi ring and (4) If T is a ternary semiring in
which every element is a midunit then T is a P-pseudo symmetric ternary semiring
An Overview of Separation Axioms by Nearly Open Sets in Topology.IJERA Editor
Abstract: The aim of this paper is to exhibit the research on separation axioms in terms of nearly open sets viz
p-open, s-open, α-open & β-open sets. It contains the topological property carried by respective ℘ -Tk spaces (℘
= p, s, α & β; k = 0,1,2) under the suitable nearly open mappings . This paper also projects ℘ -R0 & ℘ -R1
spaces where ℘ = p, s, α & β and related properties at a glance. In general, the ℘ -symmetry of a topological
space for ℘ = p, s, α & β has been included with interesting examples & results.
On fixed point theorems in fuzzy metric spaces in integral typeAlexander Decker
This document presents several common fixed point theorems for occasionally weakly compatible mappings in fuzzy metric spaces. It begins with definitions of key concepts such as fuzzy sets, fuzzy metric spaces, occasionally weakly compatible mappings, and Cauchy sequences in fuzzy metric spaces. It then presents four main theorems that establish the existence and uniqueness of a common fixed point for self-mappings under certain contractive conditions on the mappings and using the concept of occasionally weakly compatible pairs. The proofs of the theorems are also provided.
On fixed point theorems in fuzzy 2 metric spaces and fuzzy 3-metric spacesAlexander Decker
1) The document discusses fixed point theorems for mappings in fuzzy 2-metric and fuzzy 3-metric spaces.
2) It defines concepts like fuzzy metric spaces, Cauchy sequences, compatible mappings, and proves some fixed point theorems for compatible mappings.
3) The theorems show that under certain contractive conditions on the mappings, there exists a unique common fixed point for the mappings in a complete fuzzy 2-metric or fuzzy 3-metric space.
Generalized fixed point theorems for compatible mapping in fuzzy 3 metric spa...Alexander Decker
This document discusses generalized fixed point theorems for compatible mappings in fuzzy 3-metric spaces. It begins with introductions and preliminaries on fixed point theory, fuzzy metric spaces, and compatible mappings. It then provides new definitions of compatible mappings of types (I) and (II) in fuzzy 3-metric spaces. The main results extend, generalize, and improve previous theorems by proving common fixed point theorems for four mappings under the conditions of compatible mappings of types (I) and (II) in complete fuzzy 3-metric spaces.
Generalized fixed point theorems for compatible mapping in fuzzy 2 metric spa...Alexander Decker
This document discusses generalized fixed point theorems for compatible mappings in fuzzy 2-metric spaces. It begins with introductions and preliminaries on fixed point theory, fuzzy metric spaces, and compatible mappings. It then provides new definitions of compatible mappings of types (I) and (II) in fuzzy-2 metric spaces. The main results extend, generalize, and improve previous theorems by proving common fixed point theorems for four mappings under the condition of compatible mappings of types (I) and (II) in complete fuzzy-2 metric spaces.
P-Pseudo Symmetric Ideals in Ternary Semiringiosrjce
In this paper we introduce and study about pseudo symmetric ideals and P-pseudo symmetric ideals
in ternary semi rings. It is proved that (1) every completely P-Semiprime ideal A in a ternary semi ring T is a Ppseudo
symmetric ideal, (2) If A is a P-pseudo symmetric ideal of a ternary semi ring T then (i) A2 = {x : xn ∈ A
for some odd natural number n∈ N} is a minimal completely P-Semiprime ideal of T, (ii) A4 = {x : < x >n
A
for some odd natural number n} is the minimal P-Semiprime ideal of T containing A, (3) Every P-prime ideal Q
minimal relative to containing a P-pseudo symmetric ideal A in a ternary semi ring T is completely P-prime,
and (4) Let A be an ideal of a ternary semi ring T. Then A is completely P-prime iff A is P-prime and P-pseudo
symmetric. Further we introduced the terms pseudo symmetric ternary semi ring and P-pseudo symmetric
ternary semi ring. It is proved that (1) Every commutative ternary semi ring is a pseudo symmetric ternary semi
ring, (2) Every commutative ternary semi ring is a P-pseudo symmetric ternary semi ring, (3) Every pseudo
commutative ternary semi ring is a P-pseudo symmetric ternary semi ring and (4) If T is a ternary semiring in
which every element is a midunit then T is a P-pseudo symmetric ternary semiring
An Overview of Separation Axioms by Nearly Open Sets in Topology.IJERA Editor
Abstract: The aim of this paper is to exhibit the research on separation axioms in terms of nearly open sets viz
p-open, s-open, α-open & β-open sets. It contains the topological property carried by respective ℘ -Tk spaces (℘
= p, s, α & β; k = 0,1,2) under the suitable nearly open mappings . This paper also projects ℘ -R0 & ℘ -R1
spaces where ℘ = p, s, α & β and related properties at a glance. In general, the ℘ -symmetry of a topological
space for ℘ = p, s, α & β has been included with interesting examples & results.
On fixed point theorems in fuzzy metric spaces in integral typeAlexander Decker
This document presents several common fixed point theorems for occasionally weakly compatible mappings in fuzzy metric spaces. It begins with definitions of key concepts such as fuzzy sets, fuzzy metric spaces, occasionally weakly compatible mappings, and Cauchy sequences in fuzzy metric spaces. It then presents four main theorems that establish the existence and uniqueness of a common fixed point for self-mappings under certain contractive conditions on the mappings and using the concept of occasionally weakly compatible pairs. The proofs of the theorems are also provided.
The document discusses using Plücker coordinates to determine if a set of homogeneous polynomials generate the vector space of higher degree polynomials when projected onto a quotient ring. It begins by defining Plücker coordinates and showing that for two quadratic generators, the cubic vector space has zero image if the Plücker quantity P1P3 - P22 is non-zero. It then aims to generalize this to three cubic generators and the quartic vector space.
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastavaBIOLOGICAL FORUM
ABSTRACT: In this paper our works establish a new fixed point theorem for a different type of mapping in complete fuzzy metric space. Here we define a mapping by using some proved results and obtain a result on the actuality of fixed points. We inspired by the concept of Hossein Piri and Poom Kumam [15]. They introduced the fixed point theorem for generalized F-suzuki -contraction mappings in complete b-metric space. Next Robert plebaniak [16] express his idea by result “New generalized fuzzy metric space and fixed point theorem in fuzzy metric space”. This paper also induces comparing of the outcome with existing result in the literature.
Keywords: Fuzzy set, Fuzzy metric space, Cauchy sequence Non- decreasing sequence, Fixed point, Mapping.
Fixed point theorems in random fuzzy metric space throughAlexander Decker
This document defines key concepts related to fixed point theorems in random fuzzy metric spaces. It begins by introducing fuzzy metric spaces, fuzzy 2-metric spaces, and fuzzy 3-metric spaces. It then defines random fuzzy variables and random fuzzy metric spaces. The document aims to prove some fixed point theorems in random fuzzy metric spaces, random fuzzy 2-metric spaces, and random fuzzy 3-metric spaces using rational expressions. It provides 18 definitions related to t-norms, fuzzy metric spaces, convergence of sequences, completeness, and mappings to lay the groundwork for the main results.
On Fuzzy - Semi Open Sets and Fuzzy - Semi Closed Sets in Fuzzy Topologic...IOSR Journals
Abstract: The aim of this paper is to introduce the concept of fuzzy - semi open and fuzzy - semi closed sets of a fuzzy topological space. Some characterizations are discussed, examples are given and properties are established. Also, we define fuzzy - semi interior and fuzzy - semi closure operators. And we introduce fuzzy
- t-set, -SO extremely disconnected space analyse the relations between them.
MSC 2010: 54A40, 03E72.
Homogeneous Components of a CDH Fuzzy SpaceIJECEIAES
We prove that fuzzy homogeneous components of a CDH fuzzy topological space (X,T) are clopen and also they are CDH topological subspaces of its 0-cut topological space (X,T0).
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)IJERA Editor
This paper presents some common fixed point theorems for weakly compatible mappings via an implicit relation in Fuzzy Menger spaces satisfying the common property (E.A)
A Fixed Point Theorem Using Common Property (E. A.) In PM Spacesinventionjournals
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Common fixed points of weakly reciprocally continuous maps using a gauge func...Alexander Decker
The document summarizes a mathematical research paper that proves a common fixed point theorem for weakly reciprocally continuous self-mappings on a complete metric space. The theorem establishes that if two self-mappings satisfy a contractive condition and are either compatible, A-compatible, or T-compatible, then they have a unique common fixed point. The proof constructs Cauchy sequences from the mappings and uses properties like weak reciprocal continuity, compatibility, and the contractive condition to show the sequences converge to a common fixed point.
11.common fixed points of weakly reciprocally continuous maps using a gauge f...Alexander Decker
The document presents a common fixed point theorem for weakly reciprocally continuous self-mappings on a complete metric space. It begins with definitions of various types of compatible mappings and introduces the concept of weak reciprocal continuity. The main result, Theorem 2.1, proves that if two self-mappings satisfy conditions (i) and (ii) and are either compatible, A-compatible, or T-compatible, then the mappings have a unique common fixed point. Condition (ii) is a contractive condition involving an upper semi-continuous function. The proof constructs Cauchy sequences to show the existence of the common fixed point.
Abstract Quadripartitioned single valued neutrosophic (QSVN) set is a powerful structure where we have four components Truth-T, Falsity-F, Unknown-U and Contradiction-C. And also it generalizes the concept of fuzzy, initutionstic and single valued neutrosophic set. In this paper we have proposed the concept of K-algebras on QSVN, level subset of QSVN and studied some of the results. In addition to this we have also investigated the characteristics of QSVN Ksubalgebras under homomorphism.
Contra qpi continuous functions in ideal bitopological spacesAlexander Decker
This academic article discusses contra qpI-continuous functions in ideal bitopological spaces. It begins with preliminaries on bitopological spaces, ideal topological spaces, and related concepts. It then defines contra qpI-continuous functions and establishes some of their properties, such as their relationship to contra qI-continuous functions and qpI-continuous functions. It proves several theorems about contra qpI-continuous functions and their images, including that the image of a qpI-connected space under a contra qpI-continuous function is connected. The article concludes by discussing contra qpI-irresolute mappings.
Convergence Theorems for Implicit Iteration Scheme With Errors For A Finite F...inventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
Partitioning procedures for solving mixed-variables programming problemsSSA KPI
This document presents two procedures for solving mixed-variables programming problems. The key steps are:
1. The problem is partitioned into two subproblems - a programming problem defined on the set S, and a linear programming problem defined in Rp.
2. A partitioning theorem shows that solving the programming problem on S determines whether the original problem is feasible, feasible but not optimal, or determines an optimal solution and reduces the original problem to a linear programming problem.
3. To efficiently solve the programming problem on S without computing the entire constraint set, the problem is decomposed into subproblems where only constraints determining optimality need to be identified.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Common fixed point theorems with continuously subcompatible mappings in fuzz...Alexander Decker
This document introduces the concepts of continuously subcompatible maps in fuzzy metric spaces. Continuously subcompatible maps are a weaker condition than subcompatibility and subsequential continuity. A theorem is proved that if two pairs of self-mappings (A,S) and (B,T) satisfy the continuously subcompatible condition and inequality (1), then there exists a unique point z in the fuzzy metric space such that Az = Sz = Tz = Bz = z. The concepts of fuzzy metric spaces, compatible maps, weakly compatible maps, and occasionally weakly compatible maps are also defined.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
We continue the study of the concepts of minimality and homogeneity in the fuzzy context. Concretely, we introduce two new notions of minimality in fuzzy bitopological spaces which are called minimal fuzzy open set and pairwise minimal fuzzy open set. Several relationships between such notions and a known one are given. Also, we provide results about the transformation of minimal, and pairwise minimal fuzzy open sets of a fuzzy bitopological space, via fuzzy continuous and fuzzy open mappings, and pairwise continuous and pairwise open mappings, respectively. Moreover, we present two new notions of homogeneity in the fuzzy framework. We introduce the notions of homogeneous and pairwise homogeneous fuzzy bitopological spaces. Several relationships between such notions and a known one are given. And, some connections between minimality and homogeneity are given. Finally, we show that cut bitopological spaces of a homogeneous (resp. pairwise homogeneous) fuzzy bitopological space are homogeneous (resp. pairwise homogeneous) but not conversely.
On common fixed point theorem in fuzzy metric spaceAlexander Decker
This document presents two common fixed point theorems for occasionally weakly compatible mappings in fuzzy metric spaces. It begins with definitions related to fuzzy sets, fuzzy metric spaces, and occasionally weakly compatible mappings. Theorem 4.1 proves that under certain conditions involving an implicit relation, four self-mappings have a unique common fixed point. Theorem 4.2 proves the same result using a different implicit relation. The proofs demonstrate that the mappings have unique points of coincidence which must be equal, yielding a unique common fixed point. References are provided for additional background.
Study of Color Image Processing For Capturing and Comparing Imagespaperpublications3
The document discusses color image processing techniques for capturing and comparing images. It describes several color models used in digital image processing like RGB and HSI. Pixel-by-pixel image comparison is performed by comparing the color of pixels at the same coordinates. Factors that affect comparison include pixel tolerance, color tolerance, and inclusion of mouse pointer. OpenCV is analyzed for image capturing and color detection capabilities. The conclusion discusses testing the proposed method on different images and future work in comparing algorithms and image histograms.
Abstract: Distributed computing is a situated of IT administrations that are given to a client more than a system on a rented premise and with the capacity to scale up or down their administration necessities. Generally cloud registering administrations are conveyed by an outsider supplier who possesses the foundation. It favorable circumstances to specify yet a couple incorporate versatility, strength, adaptability, productivity and outsourcing non-center exercises. Distributed computing offers an imaginative plan of action for associations to receive IT benefits without forthright speculation. Notwithstanding the potential increases accomplished from the distributed computing, the associations are moderate in tolerating it because of security issues and difficulties connected with it. Security is one of the significant issues which hamper the development of cloud. The thought of giving over vital information to another organization is troubling; such that the shoppers should be cautious in comprehension the dangers of information breaks in this new environment. This paper presents a point by point examination of the distributed computing security issues furthermore, difficulties concentrating on the distributed computing sorts and the administration conveyance sorts.Keywords: Cloud Computing, Scalability, Infrastructure, IT.
Title: Cloud Computing Security Issues and Challenges
Author: Nishant Katiyar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
The document discusses using Plücker coordinates to determine if a set of homogeneous polynomials generate the vector space of higher degree polynomials when projected onto a quotient ring. It begins by defining Plücker coordinates and showing that for two quadratic generators, the cubic vector space has zero image if the Plücker quantity P1P3 - P22 is non-zero. It then aims to generalize this to three cubic generators and the quartic vector space.
8 fixed point theorem in complete fuzzy metric space 8 megha shrivastavaBIOLOGICAL FORUM
ABSTRACT: In this paper our works establish a new fixed point theorem for a different type of mapping in complete fuzzy metric space. Here we define a mapping by using some proved results and obtain a result on the actuality of fixed points. We inspired by the concept of Hossein Piri and Poom Kumam [15]. They introduced the fixed point theorem for generalized F-suzuki -contraction mappings in complete b-metric space. Next Robert plebaniak [16] express his idea by result “New generalized fuzzy metric space and fixed point theorem in fuzzy metric space”. This paper also induces comparing of the outcome with existing result in the literature.
Keywords: Fuzzy set, Fuzzy metric space, Cauchy sequence Non- decreasing sequence, Fixed point, Mapping.
Fixed point theorems in random fuzzy metric space throughAlexander Decker
This document defines key concepts related to fixed point theorems in random fuzzy metric spaces. It begins by introducing fuzzy metric spaces, fuzzy 2-metric spaces, and fuzzy 3-metric spaces. It then defines random fuzzy variables and random fuzzy metric spaces. The document aims to prove some fixed point theorems in random fuzzy metric spaces, random fuzzy 2-metric spaces, and random fuzzy 3-metric spaces using rational expressions. It provides 18 definitions related to t-norms, fuzzy metric spaces, convergence of sequences, completeness, and mappings to lay the groundwork for the main results.
On Fuzzy - Semi Open Sets and Fuzzy - Semi Closed Sets in Fuzzy Topologic...IOSR Journals
Abstract: The aim of this paper is to introduce the concept of fuzzy - semi open and fuzzy - semi closed sets of a fuzzy topological space. Some characterizations are discussed, examples are given and properties are established. Also, we define fuzzy - semi interior and fuzzy - semi closure operators. And we introduce fuzzy
- t-set, -SO extremely disconnected space analyse the relations between them.
MSC 2010: 54A40, 03E72.
Homogeneous Components of a CDH Fuzzy SpaceIJECEIAES
We prove that fuzzy homogeneous components of a CDH fuzzy topological space (X,T) are clopen and also they are CDH topological subspaces of its 0-cut topological space (X,T0).
Fixed Point Results In Fuzzy Menger Space With Common Property (E.A.)IJERA Editor
This paper presents some common fixed point theorems for weakly compatible mappings via an implicit relation in Fuzzy Menger spaces satisfying the common property (E.A)
A Fixed Point Theorem Using Common Property (E. A.) In PM Spacesinventionjournals
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Common fixed points of weakly reciprocally continuous maps using a gauge func...Alexander Decker
The document summarizes a mathematical research paper that proves a common fixed point theorem for weakly reciprocally continuous self-mappings on a complete metric space. The theorem establishes that if two self-mappings satisfy a contractive condition and are either compatible, A-compatible, or T-compatible, then they have a unique common fixed point. The proof constructs Cauchy sequences from the mappings and uses properties like weak reciprocal continuity, compatibility, and the contractive condition to show the sequences converge to a common fixed point.
11.common fixed points of weakly reciprocally continuous maps using a gauge f...Alexander Decker
The document presents a common fixed point theorem for weakly reciprocally continuous self-mappings on a complete metric space. It begins with definitions of various types of compatible mappings and introduces the concept of weak reciprocal continuity. The main result, Theorem 2.1, proves that if two self-mappings satisfy conditions (i) and (ii) and are either compatible, A-compatible, or T-compatible, then the mappings have a unique common fixed point. Condition (ii) is a contractive condition involving an upper semi-continuous function. The proof constructs Cauchy sequences to show the existence of the common fixed point.
Abstract Quadripartitioned single valued neutrosophic (QSVN) set is a powerful structure where we have four components Truth-T, Falsity-F, Unknown-U and Contradiction-C. And also it generalizes the concept of fuzzy, initutionstic and single valued neutrosophic set. In this paper we have proposed the concept of K-algebras on QSVN, level subset of QSVN and studied some of the results. In addition to this we have also investigated the characteristics of QSVN Ksubalgebras under homomorphism.
Contra qpi continuous functions in ideal bitopological spacesAlexander Decker
This academic article discusses contra qpI-continuous functions in ideal bitopological spaces. It begins with preliminaries on bitopological spaces, ideal topological spaces, and related concepts. It then defines contra qpI-continuous functions and establishes some of their properties, such as their relationship to contra qI-continuous functions and qpI-continuous functions. It proves several theorems about contra qpI-continuous functions and their images, including that the image of a qpI-connected space under a contra qpI-continuous function is connected. The article concludes by discussing contra qpI-irresolute mappings.
Convergence Theorems for Implicit Iteration Scheme With Errors For A Finite F...inventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
Partitioning procedures for solving mixed-variables programming problemsSSA KPI
This document presents two procedures for solving mixed-variables programming problems. The key steps are:
1. The problem is partitioned into two subproblems - a programming problem defined on the set S, and a linear programming problem defined in Rp.
2. A partitioning theorem shows that solving the programming problem on S determines whether the original problem is feasible, feasible but not optimal, or determines an optimal solution and reduces the original problem to a linear programming problem.
3. To efficiently solve the programming problem on S without computing the entire constraint set, the problem is decomposed into subproblems where only constraints determining optimality need to be identified.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Common fixed point theorems with continuously subcompatible mappings in fuzz...Alexander Decker
This document introduces the concepts of continuously subcompatible maps in fuzzy metric spaces. Continuously subcompatible maps are a weaker condition than subcompatibility and subsequential continuity. A theorem is proved that if two pairs of self-mappings (A,S) and (B,T) satisfy the continuously subcompatible condition and inequality (1), then there exists a unique point z in the fuzzy metric space such that Az = Sz = Tz = Bz = z. The concepts of fuzzy metric spaces, compatible maps, weakly compatible maps, and occasionally weakly compatible maps are also defined.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
We continue the study of the concepts of minimality and homogeneity in the fuzzy context. Concretely, we introduce two new notions of minimality in fuzzy bitopological spaces which are called minimal fuzzy open set and pairwise minimal fuzzy open set. Several relationships between such notions and a known one are given. Also, we provide results about the transformation of minimal, and pairwise minimal fuzzy open sets of a fuzzy bitopological space, via fuzzy continuous and fuzzy open mappings, and pairwise continuous and pairwise open mappings, respectively. Moreover, we present two new notions of homogeneity in the fuzzy framework. We introduce the notions of homogeneous and pairwise homogeneous fuzzy bitopological spaces. Several relationships between such notions and a known one are given. And, some connections between minimality and homogeneity are given. Finally, we show that cut bitopological spaces of a homogeneous (resp. pairwise homogeneous) fuzzy bitopological space are homogeneous (resp. pairwise homogeneous) but not conversely.
On common fixed point theorem in fuzzy metric spaceAlexander Decker
This document presents two common fixed point theorems for occasionally weakly compatible mappings in fuzzy metric spaces. It begins with definitions related to fuzzy sets, fuzzy metric spaces, and occasionally weakly compatible mappings. Theorem 4.1 proves that under certain conditions involving an implicit relation, four self-mappings have a unique common fixed point. Theorem 4.2 proves the same result using a different implicit relation. The proofs demonstrate that the mappings have unique points of coincidence which must be equal, yielding a unique common fixed point. References are provided for additional background.
Study of Color Image Processing For Capturing and Comparing Imagespaperpublications3
The document discusses color image processing techniques for capturing and comparing images. It describes several color models used in digital image processing like RGB and HSI. Pixel-by-pixel image comparison is performed by comparing the color of pixels at the same coordinates. Factors that affect comparison include pixel tolerance, color tolerance, and inclusion of mouse pointer. OpenCV is analyzed for image capturing and color detection capabilities. The conclusion discusses testing the proposed method on different images and future work in comparing algorithms and image histograms.
Abstract: Distributed computing is a situated of IT administrations that are given to a client more than a system on a rented premise and with the capacity to scale up or down their administration necessities. Generally cloud registering administrations are conveyed by an outsider supplier who possesses the foundation. It favorable circumstances to specify yet a couple incorporate versatility, strength, adaptability, productivity and outsourcing non-center exercises. Distributed computing offers an imaginative plan of action for associations to receive IT benefits without forthright speculation. Notwithstanding the potential increases accomplished from the distributed computing, the associations are moderate in tolerating it because of security issues and difficulties connected with it. Security is one of the significant issues which hamper the development of cloud. The thought of giving over vital information to another organization is troubling; such that the shoppers should be cautious in comprehension the dangers of information breaks in this new environment. This paper presents a point by point examination of the distributed computing security issues furthermore, difficulties concentrating on the distributed computing sorts and the administration conveyance sorts.Keywords: Cloud Computing, Scalability, Infrastructure, IT.
Title: Cloud Computing Security Issues and Challenges
Author: Nishant Katiyar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Applying Agile Methodologies on Large Software Projectspaperpublications3
Abstract: Agile is suitable for Small projects as contrasted with the large projects. There is some problem in the execution of large projects. Large Projects are not easy to execute. When we use agile methodologies, Large projects are very difficult to implement. To construct a product framework by utilizing agile methodologies we found that the large projects need more practices as compare them with Small projects.
In this paper, I will present an arrangement of latest and changed development practices, which will help in building up a large project. The Agile Framework for Large Projects (AFLP) was connected to four industry cases. The AFLP gives a structured approach to programming associations to adopt agile practices and evaluate the outcomes. The system incorporates an extended Scrum procedure and agile practices, which consist of agility and critical success factors in agile software projects under that chosen from the XP, Scrum and Crystal Clear.Keywords: Agile Methods (Scrum), Large Software Projects, Industrial Case Study.
Title: Applying Agile Methodologies on Large Software Projects
Author: Nida Rashid
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: Traditional approaches for document classification need data which is labelled for the construction reliable classifiers which are even accurate. Unfortunately, data which is already labelled are rarely available, and often too costly to obtain. For the given learning task for which data which is trained is unavailable, abundant labelled data may be there for a different and related domain. One would like to use the related labelled data as auxiliary information to accomplish the classification task in the target domain. Recently, the paradigm of transfer learning has been introduced to enable effective learning strategies when auxiliary data obey a different probability distribution. A co-clustering based classification algorithm has been previously proposed to tackle cross-domain text classification. In this work, we extend the idea underlying this approach by making the latent semantic relationship between the two domains explicit. This goal is achieved with the use of Wikipedia. As a result, the pathway that allows propagating labels between the two domains not only captures common words, but also semantic concepts based on the content of documents. We empirically demonstrate the efficacy of our semantic-based approach to cross-domain classification using a variety of real data.Keywords: Classification, Clustering, Cross-domain Text Classification, Co-clustering, Labelled data, Traditional Approaches.
Title: Co-Clustering For Cross-Domain Text Classification
Author: Rayala Venkat, Mahanthi Kasaragadda
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Research on Lexicographic Linear Goal Programming Problem Based on LINGO and ...paperpublications3
Abstract: Lexicographic Linear Goal programming within a pre-emptive priority structure including Column-dropping Rule has been one of the useful techniques considered in solving multiple objective problems. The basic ideas to solve goal programming are transforming goal programming into single-objective linear programming. An optimal solution is attained when all the goals are reached as close as possible to their aspiration level, while satisfying a set of constraints. One of the Goal Programming algorithm – the Lexicographic method including Column-dropping Rule and the method of LINGO software are discussed in this paper. Finally goal programming model are applied to the actual management decisions, multi-objective programming model are established and used LINGO software and Column-dropping Rule to achieve satisfied solution.Keywords: Goal programming, Lexicographic Goal programming, multi-objective, LINGO software, Column-dropping Rule.
Title: Research on Lexicographic Linear Goal Programming Problem Based on LINGO and Column-Dropping Rule
Author: N. R. Neelavathi
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Networkpaperpublications3
Abstract: Vehicular ad hoc networks (VANETs) can provide scalable and cost-effective solutions for applications such as traffic safety, dynamic route planning, and context-aware advertisement using short-range wireless communication. To function properly, these applications require efficient routing protocols. However, existing mobile ad hoc network routing and forwarding approaches have limited performance in VANETs. This dissertation shows that routing protocols which account for VANET-specific characteristics in their designs, such as position and mobility of Vehicle, can provide good performance for a large spectrum of applications.
Increased vehicular traffic demands smart vehicles which can interact with each other and roadside infrastructure to prevent accidents. Vehicular Ad-hoc Network (VANET) provides this flexibility to the vehicles. In this desertion we initially analyze the performance of AODV and OLSR, and further we improve the performance of AODV by selecting the node on the basis of trust value of the successive nodes, we also reduce the neighbor hood expiry time and correspondingly update the route table of AODV, with this purposed approach we would be able to reduce the end-to-end delay of AODV sufficiently also the performance of AODV increase in terms of Throughput and packet delivery ratio.Keywords: VANET, AODV, ROUTING, ROUT TABLE.
Title: Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Network
Author: Dalbir Singh, Amit Jain (Asst. Prof.)
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)paperpublications3
Abstract: Ramanujan’s lost notebook contains many results on mock theta functions. In particular, the lost notebook contains eight identities for tenth order mock theta functions. Previously many authors proved the first six of Ramanujan’s tenth order mock theta function identities. It is the purpose of this paper to prove the seventh and eighth identities of Ramanujan’s tenth order mock theta function identities which are expressed by mock theta functions and also a definite integral. The properties of modular forms are used for the proofs of theta function identities and L. J. Mordell’s transformation formula for the definite integral.Keywords: Mock Theta Functions from Ramanujan’s Lost Notebook.
Title: Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)
Author: MOHAMMADI BEGUM JEELANI SHAIKH
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: With development of the information technology, the scale of data is increasing quickly. The massive data poses a great challenge for data processing and classification. In order to classify the data, there were several algorithm proposed to efficiently cluster the data. One among that is the random forest algorithm, which is used for the feature subset selection. The feature selection involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. It is achieved by classifying the given data. The efficiency is calculated based on the time required to find a subset of features, the effectiveness is related to the quality of the subset of features. The existing system deals with fast clustering based feature selection algorithm, which is proven to be powerful, but when the size of the dataset increases rapidly, the current algorithm is found to be less efficient as the clustering of datasets takes quiet more number of time. Hence the new method of implementation is proposed in this project to efficiently cluster the data and persist on the back-end database accordingly to reduce the time. It is achieved by scalable random forest algorithm. The Scalable random forest is implemented using Map Reduce Programming (An implementation of Big Data) to efficiently cluster the data. In works on two phases, the first step deals with the gathering the datasets and persisting on the datastore and the second step deals with the clustering and classification of data. This process is completely implemented using Google App Engine’s hadoop platform, which is a widely used open-source implementation of Google's distributed file system using MapReduce framework for scalable distributed computing or cloud computing. MapReduce programming model provides an efficient framework for processing large datasets in an extremely parallel mining. And it comes to being the most popular parallel model for data processing in cloud computing platform. However, designing the traditional machine learning algorithms with MapReduce programming framework is very necessary in dealing with massive datasets.Keywords: Data mining, Hadoop, Map Reduce, Clustering Tree.
Title: Big Data on Implementation of Many to Many Clustering
Author: Ravi. R, Michael. G
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: We extend some existing results on the zeros of polar derivatives of polynomials by considering more general coefficient conditions. As special cases the extended results yield much simpler expressions for the upper bounds of zeros than those of the existing results.
Mathematics Subject Classification: 30C10, 30C15.Keywords: Zeros of polynomial, Eneström - Kakeya theorem, Polar derivatives.
Title: On the Zeros of Polar Derivatives
Author: P. Ramulu, G.L. Reddy
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: This paper tackles, studying and introducing a new types of Kc – spaces that are called be βKc_i-spaces where (i = 1 , 2 , 3 ) . As well as discussion the important results which are arriving to during this studying.Keywords: βω-open, βω-closed, β-closed map, βω-compactβ Kc_i-spaces.
Title:Study Kc - Spaces Via ω-Open Sets
Author: Dr. Luay A.A.AL-Swidi, Salam. H. Ubeid
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: An edge dominating set D of a fuzzy graph G= (σ, µ) is a non-split edge dominating set if the induced fuzzy sub graph H= (<e-d>, σ¢, µ¢) is connected. The split edge domination number γ¢ns(G)or γ¢ns is the minimum fuzzy cardinality of a non-split edge dominating set. In this paper we study a non-split edge dominating set of fuzzy graphs and investigate the relationship of γ¢ns(G)with other known parameter of G. Keywords: Fuzzy graphs, fuzzy domination, fuzzy edge domination, fuzzy non split edge domination number.
Title: Non Split Edge Domination in Fuzzy Graphs
Author: C.Y. Ponnappan, S. Basheer Ahamed, P. Surulinathan
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Enhance The Technique For Searching Dimension Incomplete Databasespaperpublications3
Abstract: Data ambiguity is major problem in the information retrieval ambiguity is due to the loss in the data dimension it causes lot of problem in various real life application. Database may incomplete due to missing dimension and value. In previous work is totally based on the missing value. We focus on the problem is to find the missing dimension in our work. Missing dimension leads towards the problem in the traditional query approach. Missing dimension information create computational problem, so large number of possible combinations of missing dimensions need to be examined to check similarity between the query object and the data objects . Our aim is to reduce the all recovery version to increase the system performance as number of possible recovery data is reduces the time to estimate the true result is also reduces. Keywords: Missing Dimensions, Similarity search, Whole sequence query, Probability triangle inequality, Temporal data.
Title: Enhance The Technique For Searching Dimension Incomplete Databases
Author: Mr. Amol Patil, Prof. Saba Siraj, Miss. Ashwini Sagade
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: Smartphones have become very common. It has claims in all the fields such as private use, in government groups such as defence, military etc. It has become common because of occurrence of huge number of applications. Smartphones convey large amount of personal material, such as user’s private details, contacts, messages, emails, credit card information, etc. This delicate- materialpresent, needs security and privacy. The project suggests the idea of securing the Private information such as contacts, browsing history, cookies, credit card information etc, present on the user profile of a personalized search engine. Security is provided by locking and wiping the data of the phone from a remote server, in the event of phone getting lost or stolen. To achieve this, message authentication code technique is used. The authenticity and integrity of the message is proved by a short piece of information. Integrity governs accidental and intentional message changes and authenticity governs the message’s origin. It stops malicious users from launching denial of service attacks. A Secure Hash Algorithm is used to produce a hash value which Converts plaintext to encoded message and outputs a MAC. The MAC defends both message data integrity and its authenticity by permitting receivers who also possess the secret key to detect any changes to message content.Keywords: Clickthrough data, abstraction, location search, mobile search engine, ontology, user profiling.
Title: Private Mobile Search Engine Using RSVM Training
Author: Ms. Mayuri A. Auti, Dr. S. V. Gumaste
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Comparative Performance Analysis & Complexity of Different Sorting Algorithmpaperpublications3
Abstract: An Algorithm is mix of guidelines without further order in offered request to take care of the predetermined issue. Sorting considered as the crucial operation for masterminding the rundown of components in a specific request either in rising or diving request in view of their key quality. Sorting system like: Insertion, Bubble, and Selection all have the quadratic time multifaceted ideal models O (N2) that breaking point their utilization as per the amount of parts. The objective of this paper audited different type of sorting algorithm like Insertion Sort, Selection, Bubble, Merge sort their execution investigation as for their time complexity nature.Keywords: Sorting Algorithm, Bubble, Selection, Insertion, Merge Sort, Complexity.
Title: Comparative Performance Analysis & Complexity of Different Sorting Algorithm
Author: Shiv Shankar Maurya, Arti Rana, Ajay Vikram Singh
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: Object Classification is an important task within the field of computer vision. Image classification refers to the labelling of images into one of a number of predefined categories. Classification includes image sensors, image pre-processing, object detection, object segmentation, feature extraction and object classification. Many classification techniques have been developed for image classification. In this survey various classification techniques are considered; Artificial Neural Network (ANN), Decision Tree (DT), Support Vector Machine (SVM) and Fuzzy Classification.Keywords: Image Classification, Artificial Neural Network, Decision Tree, Support Vector Machine, Fuzzy Classifier.
Title: Analysis of Classification Approaches
Author: Robin Kumar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Delay Constrained Energy Efficient Data Transmission over WSNpaperpublications3
Abstract: In wireless sensor network generally concentrate on minimization of energy Consumption, Also reducing energy saving and end to end delay. Reduced the end to end delay is one of the main challenges in the Wireless Sensor Networks. In TDMA providing reliable packet transmission and two transmission scheduling schemes are used to maximize the end-end reliability within a delay bound in packet transmission called dedicated scheduling and shared scheduling. In addition, they formulate solutions for implementing two algorithms into two basic routing algorithms, single-path routing and any-path routing algorithm. The proposed system presented energy efficient sleep scheduling algorithm for reducing the energy for delay constrained in WLAN. This algorithm to maximize the energy saving for packet delay constraints and it determines sleep period and wake up time to be minimized, the aim of this project is proposed to maximize the length of sleep time under packet deadline constraints using green call algorithm. Keywords: Delay-constrained applications, energy efficiency, Sleep scheduling, wireless sensor network.
Title: Delay Constrained Energy Efficient Data Transmission over WSN
Author: H. Hasina Begaum
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
This document summarizes and analyzes six major data mining algorithms: C4.5, k-Means, SVM, Apriori, EM, and PageRank. It provides an overview of each algorithm, discusses their impact and applications, and reviews current and future research areas. The six algorithms cover classification, clustering, statistical learning, association rule mining, and link mining, which are core topics in data mining research.
An Advanced IR System of Relational Keyword Search Techniquepaperpublications3
Abstract: Now these days keyword search to relational data set becomes an area of research within the data base and Information Retrieval. There is no standard process of information retrieval, which will clearly show the accurate result also it shows keyword search with ranking. Execution time is retrieving of data is more in existing system. We propose a system for increasing performance of relational keyword search systems. In the proposed system we combine schema-based and graph-based approaches and propose a Relational Keyword Search System to overcome the mentioned disadvantages of existing systems and manage the information and user access the information very efficiently. Keyword Search with the ranking requires very low execution time. Execution time of retrieving information and file length during Information retrieval can be display using chart.Keywords: Keyword Search, Datasets, Information Retrieval Query Workloads, Schema-based Systems, Graph-based Systems, ranking, relational databases.
Title: An Advanced IR System of Relational Keyword Search Technique
Author: Dhananjay A. Gholap, Gumaste S. V
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)paperpublications3
Abstract: This paper presents an evaluation of open source e-learning platforms with the aim of finding the most suitable platform for extending to an adaptive one. The extended platform will be utilized in an operational teaching environment. Therefore, the overall functionality of the platform is as important as the adaptation capabilities, and the evaluation treats both issues in this paper .in this paper we will explain the proper and best learning platform for Users . In this we will compare one of the best learning platforms (Moodle and Blackbox) both are all of them best virtual learning platform. We will compare both virtual system its functionality and using best tool. This paper is focused on the Moodle Architecture and comparative study of Moodle, thus we discusses comparisons it between different virtual learning platform at last conclusion we will describe which learning platform is best for users.Keywords: E-learning, Blackboard, Moodle, tools, function, methodology.
Title: A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)
Author: Kanak Sachan, Dr. Rajiv Singh
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELETpaperpublications3
Abstract: The Security is the most important aspect of Database, for maintain the integrity and as well as security of the system image watermarking is technique proposed at the year of 1996, in this paper we also implement image watermarking using 2-D biorthogonal Wavelt. The importance of transmitting digital information in digital watermarking system and the dissymmetric digital watermarking framework lived on media content communication is also being discussed in this paper. Then we apply watermarking embedding algorithm to keep the balance between watermarks’ imperceptibility and its robustness while the data is being sent on the communication channel.Keywords: Discrete Wavelet Transform (DWT), Gray Scale, Peak Signal to Noise Ratio (PSNR).
Title: Entropy based Digital Watermarking using 2-D Biorthogonal WAVELET
Author: Abhinav Kumar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Fixed points of contractive and Geraghty contraction mappings under the influ...IJERA Editor
In this paper, we prove the existence of fixed points of contractive and Geraghty contraction maps in complete metric spaces under the influence of altering distances. Our results extend and generalize some of the known results.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
Continuous functions play a dominant role in analysis and homotopy theory. They
have applications to image processing, signal processing, information, statistics,
engineering and technology. Recently topologists studied the continuous like functions
between two different topological structures. For example, semi continuity between a
topological structure, α-continuity between a topology and an α-topology.
Nithyanantha Jothi and Thangavelu introduced the concept of binary topology in
2011. Recently the authors extended the notion of binary topology to n-ary topology
where n˃1 an integer. In this paper continuous like functions are defined between a
topological and an n-ary topological structures and their basic properties are
studied.
Complete l fuzzy metric spaces and common fixed point theoremsAlexander Decker
This document presents definitions and theorems related to complete L-fuzzy metric spaces and common fixed point theorems. It begins with introducing concepts such as L-fuzzy sets, L-fuzzy metric spaces, and triangular norms. It then defines Cauchy sequences and completeness in L-fuzzy metric spaces. The main result is Theorem 2.2, which establishes conditions under which four self-mappings of a complete L-fuzzy metric space have a unique common fixed point. These conditions include the mappings having compatible pairs, one mapping having a closed range, and the mappings satisfying a contractive-type inequality condition. The proof of the theorem constructs appropriate sequences to show convergence.
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) Propertyinventionjournals
The object of this paper is to establish a common fixed point theorem for semi-compatible pair of self maps by using CLRg Property in fuzzy metric space.
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...mathsjournal
In this paper, we give some new definition of Compatible mappings of type (P), type (P-1) and type (P-2) in intuitionistic generalized fuzzy metric spaces and prove Common fixed point theorems for six mappings
under the conditions of compatible mappings of type (P-1) and type (P-2) in complete intuitionistic fuzzy
metric spaces. Our results intuitionistically fuzzify the result of Muthuraj and Pandiselvi [15]
Mathematics subject classifications: 45H10, 54H25
Common Fixed Point Theorems For Occasionally Weakely Compatible Mappingsiosrjce
Som [11 ] establishes a common fixed point theorem for R-weakly Commuting mappings in a Fuzzy
metric space.The object of this Paper is to prove some fixed point theorems for occasionally Weakly compatible
mappings by improving the condition of Som[11 ].
This document defines and provides necessary and sufficient conditions for a pair of operators (T1, T2) on a topological vector space to be syndetically hypercyclic. It begins by introducing key concepts such as hypercyclic pairs and sequences. The main result is that a pair (T1, T2) is syndetically hypercyclic if and only if it satisfies the Hypercyclicity Criterion for syndetic sequences. Additionally, it is shown that if a pair satisfies the Hypercyclicity Criterion for a syndetic sequence, then it is topologically mixing. The proof of the main theorem utilizes the Hypercyclicity Criterion and shows topological weak mixing is equivalent to
This paper introduces the concept of semi-periodic ∞-tuples of commutative bounded linear mappings on a separable Banach space. The authors prove two main results: 1) A hypercyclicity criterion for ∞-tuples, stating conditions under which an ∞-tuple is hypercyclic. 2) If an ∞-tuple is hypercyclic and has a dense generalized kernel, then it satisfies the conditions of the hypercyclicity criterion. The paper aims to expand understanding of dynamical properties of ∞-tuples acting on Banach spaces.
The document discusses hypercyclic operators and density on function spaces. It defines key concepts like hypercyclic vectors and orbits. It summarizes previous results by Birhoff, Maclane, Godefroy-Shapiro, and Kitai-Getner-Shapiro on hypercyclic operators. Theorems are presented on density and hypercyclicity, including that the differentiation operator on H(C) is hypercyclic and the composition of a hypercyclic operator with a bijective operator is also hypercyclic.
This paper proves a Caccioppoli-Kannan type fixed point theorem in generalized metric spaces (g.m.s.) that includes previous theorems by Kannan, Saha, and Mihet. It shows that if a mapping T on a T-orbitally complete g.m.s. satisfies d(T^n x, T^n y) ≤ a_n[d(x,Tx) + d(y,Ty)] where a_n converges and a_1 < 1, then T has a unique fixed point. This generalizes Caccioppoli's theorem to g.m.s. and recovers Kannan's fixed point theorem in g.
On Application of Unbounded Hilbert Linear Operators in Quantum MechanicsBRNSS Publication Hub
This research work presents an important Banach space in functional analysis which is known and called
Hilbert space. We verified the crucial operations in this space and their applications in physics, particularly
in quantum mechanics. The operations are restricted to the unbounded linear operators densely defined
in Hilbert space which is the case of prime interest in physics, precisely in quantum machines. Precisely,
we discuss the role of unbounded linear operators in quantum mechanics, particularly, in the study of
Heisenberg uncertainty principle, time-independent Schrödinger equation, Harmonic oscillation, and
finally, the application of Hamilton operator. To make these analyses fruitful, the knowledge of Hilbert
spaces was first investigated followed by the spectral theory of unbounded operators, which are claimed
to be densely defined in Hilbert space. Consequently, the theory of probability is also employed to study
some systems since the operators used in studying these systems are only dense in H (i.e., they must (or
probably) be in the domain of H defined by L2 ( ) −∞,+∞ ).
Semicompatibility and fixed point theorem in fuzzy metric space using implici...eSAT Journals
This document summarizes a research paper on proving fixed point theorems in fuzzy metric spaces using the concept of semicompatibility and implicit relations. It defines key concepts such as fuzzy metric spaces, Cauchy sequences, completeness, compatibility, semicompatibility, weak compatibility, and implicit relations. It then proves a fixed point theorem for four self-mappings on a complete fuzzy metric space where the mappings satisfy conditions related to semicompatibility, weak compatibility, and an implicit relation.
Semicompatibility and fixed point theorem in fuzzy metric space using implici...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Theoretical work submitted to the Journal should be original in its motivation or modeling structure. Empirical analysis should be based on a theoretical framework and should be capable of replication. It is expected that all materials required for replication (including computer programs and data sets) should be available upon request to the authors.
Existence Theory for Second Order Nonlinear Functional Random Differential Eq...IOSR Journals
This document presents an existence theory for solutions to second order nonlinear functional random differential equations in Banach algebras. It begins by introducing the type of random differential equation being studied and defining relevant function spaces. It then states several theorems and lemmas from previous works that will be used to prove the main results. The paper goes on to prove that under certain Lipschitz conditions and boundedness assumptions on the operators defining the equation, the random differential equation has at least one random solution in the given function space. It also shows that the set of such random solutions is compact. The results generalize previous existence theorems to the random case.
This document provides an overview of preliminary topological concepts needed for applied mathematics. It defines topological spaces and metric spaces, and introduces key topological notions like open and closed sets, bases for topologies, convergence of sequences, accumulation points, interior and closure of sets, and dense sets. Metric spaces are shown to induce a natural topological structure, though not all topologies come from a metric. Examples are provided to illustrate various definitions and properties.
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...mathsjournal
In this paper, we give some new definition of Compatible mappings of type (P), type (P-1) and type (P-2) in intuitionistic generalized fuzzy metric spaces and prove Common fixed point theorems for six mappings under the conditions of compatible mappings of type (P-1) and type (P-2) in complete intuitionistic fuzzy metric spaces. Our results intuitionistically fuzzify the result of Muthuraj and Pandiselvi [15]
COMMON FIXED POINT THEOREMS IN COMPATIBLE MAPPINGS OF TYPE (P*) OF GENERALIZE...mathsjournal
In this paper, we give some new definition of Compatible mappings of type (P), type (P-1) and type (P-2) in intuitionistic generalized fuzzy metric spaces and prove Common fixed point theorems for six mappings under the conditions of compatible mappings of type (P-1) and type (P-2) in complete intuitionistic fuzzy metric spaces.
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
Infrastructure Challenges in Scaling RAG with Custom AI modelsZilliz
Building Retrieval-Augmented Generation (RAG) systems with open-source and custom AI models is a complex task. This talk explores the challenges in productionizing RAG systems, including retrieval performance, response synthesis, and evaluation. We’ll discuss how to leverage open-source models like text embeddings, language models, and custom fine-tuned models to enhance RAG performance. Additionally, we’ll cover how BentoML can help orchestrate and scale these AI components efficiently, ensuring seamless deployment and management of RAG systems in the cloud.
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
Full-RAG: A modern architecture for hyper-personalizationZilliz
Mike Del Balso, CEO & Co-Founder at Tecton, presents "Full RAG," a novel approach to AI recommendation systems, aiming to push beyond the limitations of traditional models through a deep integration of contextual insights and real-time data, leveraging the Retrieval-Augmented Generation architecture. This talk will outline Full RAG's potential to significantly enhance personalization, address engineering challenges such as data management and model training, and introduce data enrichment with reranking as a key solution. Attendees will gain crucial insights into the importance of hyperpersonalization in AI, the capabilities of Full RAG for advanced personalization, and strategies for managing complex data integrations for deploying cutting-edge AI solutions.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
“An Outlook of the Ongoing and Future Relationship between Blockchain Technologies and Process-aware Information Systems.” Invited talk at the joint workshop on Blockchain for Information Systems (BC4IS) and Blockchain for Trusted Data Sharing (B4TDS), co-located with with the 36th International Conference on Advanced Information Systems Engineering (CAiSE), 3 June 2024, Limassol, Cyprus.
Using ψ-Operator to Formulate a New Definition of Local Function
1. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 265
Paper Publications
Using ψ-Operator to Formulate a New
Definition of Local Function
1
Dr.Luay A.A.AL-Swidi, 2
Dr.Asaad M.A.AL-Hosainy, 3
Reyam Q.M.AL-Feehan
1
Professor,
2
Ass. Professor, 3
Msc. Student,
1, 2, 3
Department of Mathematics College of Education for Pure Science Babylon University
Abstract: In this paper, we use ψ-operator in order to get a new version of local function. The concepts of maps,
dense, resolvable and Housdorff have been investigated in this paper, as well as modified to be useful in general
صت الخ :ان ُا تخدي س ا ً ف ْذا بحث ان ٍت ه ًع ان ساي اب ٍي أجم صٕل ح ان هى ع ّسخ َ ِد ٌجد ٍي ت دان ان ٍت ه ًح د.ان ٔق ى ت ٍق ق تح ان ً ف
ٍى ْفا ي دٔال ,ان ت ثاف ك ًجًٕعاث,ان ان هت قاب ان هحم ن ٔ ضاء ف سدٔرف ٔٓاك,ان ذن ٔك هٓا ٌعد ت ٌٕك ت ن ٍدة ف ي كم ش ب .عاو
Keywords: ψ-operator, dense, resolvable and Housdorff.
1. INTRODUCTION AND PRILMINARIES
As requirements for our work, we define here the following concepts sequentially: Ideal space, local function, Kuratowski
closure, dense, T*-dense, I-dense, codense, ψ-operator, resolvable, I-open, pre-I-open, scattered set and Housdorff space.
We start define the ideal space. Let (X, T) be a topological space with no separation properties assumed. The topic of
ideal topological space has been considered by (Kuratowski, 1966) and (Vaidyanathaswamy, 1960). An ideal I on a
topological space (X, T) is a nonempty collection of subsets of X which satisfies the following two condition:
(1) If A I and B A, then B I (heredity).
(2) If A I and B I, then A B I (finite additivity).
Moreover a σ-ideal on (X, T) is an ideal which settle (1), (2) and the following condition:
3.If {Ai : i = 1,2,3,….} I, then {Ai : i =1,2,3,….} I (countable additivity).
An ideal space is a topological space (X, T) with an ideal I on X and is denoted by (X, T, I).For a subset A X, A*( I)={x
X : U A I for every U T (x)} is called the local function of A with respect to I and T (Kuratowski, 1933).We simply write
A* instead of A*( I) in case there is no chance for disorder. It is familiar that Cl*(A) = A A* defines a Kuratowski closure
operator for a topology T *(I) which is finer than T. During this paper, for a subset A X, Cl (A) and In (A) indicate the
closure and the interior of A ,respectively. A subset A of an ideal space (X, T, I) is said to be dense (resp, T *-dense
(Dontcher, Gansster and Rose, 1999), I –dense (Dontcher, Gansster and Rose,1999) if Cl (A) = X (resp Cl*(A) = X, A*=
X).An ideal I on a space (X, T) is said to be codense (Devid, Sivaraj and Chelvam, 2005) if and only if T I = {Ф}.For an
ideal space (X, T, I) and for any A X, where I is codense. Then: dense, T*-dense and I-dense are comparable (Jankovic
and Hamlett, 1990). (Natkanies, 1986) used the idea of ideals to define another operator known as ψ-operator elucidates
as follow: For a subset A X, ψ (A) = X-(X-A)*.Equivalently ψ(A) = {M T: M-A I}.It is obvious that ψ(A) for any A is a
member of T. For an ideal space (X, T, I) and Y X then (Y, T y, I y) is an ideal space where T y = {U Y: U T} and I y =
{U Y: U I} = {U I: U Y}. In 1943, Hewitt put forward the opinion of a resolvable space as follows: A nonempty
topological space (X, T) is said to be resolvable (Hewitt, 1943) if X is the disjoint union of two dense subsets. Given a
space (X, T) and A X, A is called I -open (Jankovic and Hamlett, 1990 )(resp per- I –open(Donkhev,1996)if A In
(A*)(resp A In Cl*(A).A set A X is called scattered (Jankovic and Hamlett, 1990) if A contains no nonempty dense-in-
itself subset. A space (X, T, I) is called I -Housdorff (Dontcher,1995) if for each two distinct points x ≠ y, there exist I -
open sets U and V containing x and y respectively, such that U V=Ф. Throughout this paper we define a new local
function and generalizations .Many characterizations, proprieties and relation between them are obtained.
2. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 266
Paper Publications
2. ()Ψ*-OPERATOR
In this section we put forward a new type of local function by using ψ-operator, in order to do this we have to have a deep
looking in (Jankovic and Hamlett, 1992) work of the local function in ideal space.
Definition 2.1
Let (X, T, I) be an ideal space. An operator (.)ψ*: P(x) → P(x), called ψ -local function of A with respect to I and T, is
define as follow: for any A X, Aψ* (I, T)={x X: ψ (U) A I, for every open subset U T(x) }, where T(x)={U T,x U}. When
there is no chance for confusion Aψ* (I, T) is briefly denoted by Aψ*.
Fact
Let (X, T, I) be an ideal space .Then A* Aψ*, for any A X.
Now we define a new closure operator in terms of ψ -local function.
Definition 2.2
Let (X, T, I) be an ideal space. For any A X, we define
(1) Cl ψ (A) = {x X: ψ (U) A ≠ Ф for every U X, x ψ (U)}. It is clear that Cl (A) Cl ψ (A).
(2) Cl ψ*(A) (I, T) = A Aψ*
When there is no chance for confusion Cl ψ*(A) (I, T) is briefly denoted by Cl ψ*(A).
Note
Let (X, T, I) be an ideal space. Then Cl ψ*(A) Cl ψ (A), for any A X.
We discuss the properties of ψ -local function in following theorem:
Theorem 2.3
Let (X, T) be a topological space, I and J be two ideals on X, and let A and B be two subsets of X. Then the following
properties hold:
1. If A B, then Aψ* Bψ*.
2. If I J, then Aψ* (J) Aψ* (I).
3. Aψ* =Cl (Aψ*) Cl ψ (A).
4. (Aψ*)ψ* Aψ*.
5. (A B)ψ* = Aψ* Bψ*
6. (A B)ψ* Aψ* Bψ*
7. For every I ϵ I, then (A I)ψ* = Aψ* = (A I)ψ*.
8. If G T, then G Aψ* (G A)ψ*.
9. If U T, then U Cl ψ* (A) Cl ψ* (U A).
10. If A I, then Aψ* = Ф.
Proof.
Straight from Definition2.1 and Definition 2.2
3. Ψ - DENSE AND GENERALIZATIONS
Definition 3.1
Let (X, T, I) be an ideal space, A X is called:
3. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 267
Paper Publications
(1) ψ -dense, if Cl ψ (A) = X.
(2) ψ -T*-dense, if Cl ψ*(A) = X.
(3) ψ -I-dense, if Aψ* = X.
The following remark is immediate from above definitions:
Remark 3.2
(1) If A is ψ -I-dense, then A is ψ -T*-dense.
(2) If A is ψ -T*-dense, then A is ψ -dense.
In the following example we show that the convers of above remark does not hold:
Example 3.3
Let X = {a, b, c}, T = {Ф, X, {a}, {b}. {a, b}} and I = {Ф, {b}}. If A = {a, b}, then Aψ* = {a, c} but Cl ψ* = X.
The study of ideal got new dimension when Codense ideal [ 10 ] has been incorporated in ideal space. In the
following definition we introduce a new concept of condense by using ψ-operator.
Definition 3.4
Let (X, T, I) be an ideal space, an ideal I is called ψ -codense if, ψ (T) I = {Ф}.
Lemma 3.5
Let (X, T, I) be an ideal space and for every subset A X. If A Aψ*, then the following relations hold:
Aψ* = Cl (Aψ*) = Cl ψ (A) = Cl ψ*(A).
Proof.
Clear from Definition 2.2: (1), and Theorem 2.3: (3).
Theorem 3.6
Let (X, T, I) be an ideal space, and for every subset A X. If I is ψ -codense, then the following relations hold:
(1) Where A is ψ -dense, then it is ψ -T*-dense.
(2) Where A is ψ -T*-dense, then it is ψ -I-dense.
Proof.
This is an immediate consequence of Lemma 3.5.
The following theorem related to ψ -codense ideal:
Theorem 3.7
If X is finite, then X=X* if and only if, I is ψ -codense.
Proof.
Necessity. By Theorem 2.5: [1].we get that T I= {Ф}. Since ψ(T) I T I. It follow that ψ(T) I = {Ф}.So I is ψ -codense.
Sufficiency. Assume that I is ψ -codense. Since X-X* is open, let x X-X*. Then there exists Ux X-X*, and x X*.Then
there exists Vx T(x), such that Ux Vx I. Assume that Wx = Ux Vx I. But X-X* = Wx. Hence X-X* I and ψ(T) I ≠
{Ф}, a contradiction. Therefore, X = X*.
Corollary 3.8
Let X be any nonempty set .If (X, T, I) is an ideal space where I is σ-ideal, then the following statement are equivalent:
(1) X = X*;
4. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 268
Paper Publications
(2) T I = {Ф};
(3) ψ(T) I = {Ф}.
Proof.
Similar to the proof of Theorem 3.7
By Remark 3.2, and Theorem 3.6, the following relations hold:
ψ -dens ᵜ ψ -T*-dense ᵜ ψ -I-dense.
ᵜ: I is ψ -codense.
By Theorem 2.3 :( 2), we have the following remark:
Remark 3.9
(1)Let (X, T, I) and (X, T, J) be two ideal spaces, I J, if A is ψ -I-dense with respect to J ,then A is ψ -I-dense with respect
to I for any A X.
(2) Let (X, T, I) and (X, σ, I) be two ideal spaces, T σ, if A is ψ -I-dense with respect to σ ,then A is ψ -I-dense with
respect to T for any A X.
By Remark 3.2 and Remark 3.9: (1), (2) we get the following corollary:
Corollary 3.10
(1)Let (X, T, I) and (X, T, J) be two ideal spaces, I J, if A is ψ -T*-dense (ψ -dense) with respect to J, then A is ψ -T*-
dense (ψ -dense) with respect to I for any A X.
(2) Let (X, T, I) and (X, σ, I) be two ideal spaces, T σ, if A is ψ -T*-dense (ψ -dense) with respect to σ, then A is ψ -T*-
dense (ψ -dense) with respect to T for any A X.
Definition 3.11
A function f: (X, T, I) → (Y, σ) is called ψ -map if, f (Cl ψ (A)) Cl f (A), for any A X.
Note
Where f:(X,T,I)→(Y,σ,f(I)) is a bijection map ,then f(I) will be an ideal on Y.
Theorem 3.12
If f: (X, T, I) →(Y, σ) is bijection ψ - map .Then the image of any ψ -dense subset A of X is dense in Y.
Proof.
Assume that A is ψ -dense in X. Since f is ψ -map, then f (Cl ψ (A)) Cl (f (A)).Implies that f (X) Cl (f (A)) and since f is
surjection .Therefore, Y= Cl (f (A)). Hence f (A) is dense in Y.
Definition 3.13
A function f:(X,T,I)→(Y,σ,J) is called :
(1) ψ -(I,J) map ,if f (Cl ψ* (A)) Cl* f (A).
(2) ψ 0 - (I,J) map ,if f (Aψ*) (f(A))*.
(3) ψ 1- (I,J) map, if f (Aψ*) (f(A))ψ* .
(4) ψ 2- (I,J) map ,if f (Cl ψ* (A)) Cl ψ* f(A).
(5) ψ 3- (I,J) map, if f(Cl ψ(A)) Cl ψ f(A).
For any A X.
5. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 269
Paper Publications
From the above definitions we get the following remark :
Remark 3.14
(1) ψ 0 - (I, J) map → ψ - (I, J) map.
(2) ψ 1 - (I, J) map → ψ 2 - (I, J) map → ψ 3 - (I, J) map.
Theorem 3.15
(1) If f: (X, T, I) →(Y, σ) is bijection ψ 0-(I, J) map .Then the image of any ψ -I-dense subset A of X is f(I)-dense in Y.
(2) If f: (X, T, I) → (Y, σ) is bijection ψ - (I, J) map. Then the image of any ψ -T*-dense subset A of X is T*-dense in Y.
Proof.
(1)Assume that A is ψ -I-dense in X. Since f is ψ 0-(I, J) map, then f (Aψ*) (f (A))*. Implies that f(X) (f (A))*, and
since f is surjection .Therefore, Y= (f (A))*.Hence f (A) is f (I)-dense in Y.
(2) Assume that A is ψ –T*-dense in X. Since f is ψ -(I, J) map, then f (Clψ*(A)) Cl* f (A)Implies that f(X) Cl* f (A),
and since f is surjection .Therefore, Y= Cl* f (A).Hence f (A) is T*-dense in Y.
Theorem 3.16
(1)If f: (X, T, I) → (Y, σ, J) is ψ 1 - (I, J) bijection map. Then the image of any ψ -I-dense subset of X is ψ -f (I)-dense in
Y.
(2) If f: (X, T, I) → (Y, σ, J) is bijection ψ 2-(I, J) map. Then the image of any ψ -T*-dense subset of X is ψ -T*-dense in
Y.
(3) If f: (X, T, I) → (Y, σ, J) is bijection ψ 3-(I, J) map. Then the image of any ψ -dense subset of X is ψ -dense in Y.
Proof.
(1) Assume that A is ψ-I-dense in X. Since f is ψ 1-(I, J) map then f (Aψ*) (f (A))ψ*,and since f is surjection .Therefore,
Y = (f (A))ψ*.Hence f (A) is ψ -f (I)-dense in Y.
(2) Assume that A is ψ –T*-dense in X. Since f is ψ 2-(I, J) map then f (Clψ*(A)) Cl ψ* f(A), and since f is surjection
.Therefore, Y=Cl ψ*f(A).Hence f (A) is ψ –T*-dense in Y.
(3) Assume that A is ψ-dense in X. Since f is ψ 3-(I, J) map then f(Cl ψ(A)) Cl ψ f(A) and since f is surjection .Therefore,
Y=Cl ψ f(A).Hence f(A) is ψ-dense in Y.
4. Ψ -RESOLVABILITY AND GENERALIZATIONS
In this section we define ψ- resolvable space and recall some of the generalizations of ψ-resolvable and their relationship
with Housdorff space.
Definition 4.1
A nonempty topological space (X, T) is called:
(1) ψ -resolvable, if X is the disjoint union of two ψ -dense subsets.
(2) ψ-T*-resolvable, if X is the disjoint union of T*-dense and ψ-dense subsets.
(3) ψ-I-resolvable, if X is the disjoint union of I-dense and ψ -dense subsets.
It is clear that: ψ -I-resolvable → ψ -T*-resolvable → ψ -resolvable.
Theorem 4.2
Let (X, T) be a nonempty topological space, where I is ψ-codense. Then if X is ψ -T*-resolvability, then X is ψ -I-
resolvability.
Question
We claim that ψ-resolvability does not imply ψ-T*-resolvability, but we could not find an example.
6. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 270
Paper Publications
From Corollary 3.9 we get the following remark:
Remark 4.3
Let (X, T, I) , (X, T, J) be an ideal spaces, with I J, if X is ψ -resolvable with respect to J ,then X is ψ -resolvable with
respect to I.
Definition 4.4
A function f:(X,T,I)→(Y,σ,J) ,is said to be bi*-map if :
(1) f: (X,T,I)→(Y, σ) is ψ 3-(I,J) map;
(2) f: (X,T*)→(Y, σ*) is a continuous map.
Theorem 4.5
Let f :( X, T, I) → (Y, σ) be bijection bi*- map, and if X is ψ -T*-resolvable space .Then Y is ψ -T*-resolvable with
respect to the ideal f (I).
Proof.
Assume that X is ψ -T*-resolvable space, then there exists two disjoint ψ -dense and T*-dense subsets such that Cl ψ (A)
= Cl*(B) = X. It is clear by Corollary 3.16, and Definition 4.4 that Y is ψ -T*-resolvable.
Lemma 4.6
If U is an open set and D ψ* = X, then U (D ψ (U))ψ*.
Proof
Let x U, and suppose if possible that x (D ψ (U))ψ* Then (D ψ (U)) ψ (V) I, and since ψ (U) ψ (V) T. Therefore, x D
ψ* = X. This is a contradiction .That is U (D ψ (U))ψ*.
Theorem 4.7
(1) Let U T and Cl ψ*(D) = X, then U Cl ψ* (D ψ (U)).
(2) Let U T, and Cl ψ (D) = X. Then U Cl ψ (D ψ (U)).
Using Remark 3.2: (1), (2), and similar to the proof of Lemma 4.6.
Theorem 4.8
Let Y T, and Aψ* = X. Then A1ψ y* = Y, where A1 = A y.
Proof.
By lemma 4.6 Y (A Y)ψ x* = A1ψ x*.
Then Y = A1ψ x* y = A1ψ y*.
Using Remark 3. 2 :(1) ,(2), and Theorem 4.8we get the following theorem:
Theorem 4.9
(1) Let Y T, and Cl ψ*(A) = X. Then Cl ψ*y (A1) = Y, where A1 = A Y.
(2) Let Y T, and Cl ψ (A) = X. Then Cl ψ y (A1) = Y, where A1 = A Y.
Theorem 4.10
(1) Let (X, T, I) be ψ -I-resolvable space, if Y is open .Then (Y, Ty, I y) is ψ –I y- resolvable.
(2) Let (X, T, I) be ψ -T*-resolvable space, if Y is open .Then (Y, Ty, I y) is ψ -T*y- resolvable.
(3) Let (X, T, I) be ψ -resolvable space, if Y is open .Then (Y, Ty, I y) is ψ - resolvable.
7. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 271
Paper Publications
Proof.
(1) Assume that (X, T, I) is ψ -I-resolvable space .Then there exists two disjoint ψ -dense, and I-dense subsets such that: A
B = X, and Cl ψ (A) = B* = X. Note that Y = Y X = Y (A B) = (Y A) (Y B) , and (Y A) (Y B) = Y (A B) = Ф. Put A1
= A Y and B1 = B Y. Then Y = A1 B1, A1 B1 = Ф. By corollary 3.10: (2), we have Cl ψ y (A1) = Y, and by lemma we
have B*1y = Y. Hence (Y, Ty, I y) is ψ –I y-resolvable.
(2) Assume that (X, T, I) is ψ –T*-resolvable space .Then there exists two disjoint ψ -dense, and T*-dense subsets such
that: A B = X, and Clψ (A) = Cl*(B) = X. Note that Y = Y X = Y (A B) = (Y A) (Y B) , and (Y A) (Y B) = Y (A B) =
Ф. Put A1 = A Y and B1 = B Y. Then Y = A1 B1, A1 B1 = Ф. By Theorem 2.3.20: (3), we have Clψ y (A1) = Y, Cl*1y
= Y. Hence (Y, Ty, I y) is ψ –T* y-resolvable.
(3) Assume that (X, T, I) is ψ -resolvable space .Then there exists two disjoint ψ –dense subsets such that: A B = X, and
Clψ (A) = Clψ (B) = X. Note that Y = Y X = Y (A B) = (Y A) (Y B) , and (Y A) (Y B) = Y (A B) = Ф. Put A1 = A Y
and B1 = B Y. Then Y = A1 B1, A1 B1 = Ф. By Theorem 2.3.20: (3), we have Clψ y (A1) = Clψ y (A1) = Y. Hence (Y,
Ty, I y) is ψ – Ty - resolvable.
Definition 4.11
In ideal space (X, T, I) A subset A is called ψ -pre-open if A In Cl ψ (A).
Definition 4.12
(1) An ideal space (X, T, I) is called ψ -I -Housdorff, if for every distinct point x, y X, there exist two disassociate ψ -pre-
open, and I-open sets containing each respectively.
(2) An ideal space (X, T, I) is called ψ -T*-Housdorff, if for every distinct point x, y X, there exist two disjoint ψ -pre-
open, and pre-I-open sets containing each respectively.
(3) An ideal space (X, T, I) is called ψ -Housdorff, if for every distinct point x, y X, there exist two disjoint ψ -pre-open
sets containing each respectively.
Lemma 4.13
If ({x})ψ I. Then ({x})ψ* = Ф.
Proof.
Assume that ({x})ψ* ≠ Ф, then there exist y ({x})ψ* such that ψ (U) {x} I for every U T(x). Implies that ({x})ψ I. This
is a contradiction.
Theorem 4.14
(1) If an ideal space (X, T, I) is ψ -I-resolvable, and the scattered set of (X, T) are in I, then (X, T, I) is ψ -I-Housdorff.
(2) If an ideal space (X, T, I) is ψ -T*-resolvable, and the scattered set of (X, T*) are in I, then (X, T, I) is ψ -T*-
Housdorff.
(3) If an ideal space (X, T, I) is ψ -resolvable, and the scattered set of (X, T) are in I, then (X, T, I) is ψ -Housdorff.
Proof.
(1) Let A and B be disjoint ψ -dense, and I-dense subsets of X such that X = A B. Since Clψ (A) = X, B* = X. Therefore,
A In Clψ (A) and B In B*, then A and B are ψ -pre-open and I-open sets respectively. Let x, y be any two element of X
and both x and y are in A .Take V = A{y} and U = B {y}. It is easily observed (see [6], Theorem 2.3 (h)]) that V also I-
open set and y in V. Now to show that U = A {x} is ψ -pre-open. Clψ (A {x}) = Clψ (A) Clψ ({x} = X Clψ ({x}) = X
.Hence A {x} In Clψ (A {x}), so U is ψ -pre-open. Hence (X, T, I) is ψ -I-Housdorff.
(2) Let A and B be disjoint T*-dense, and ψ-dense subsets of X such that X = A B. Since Cl* (A) = X and Clψ (B) = X.
Therefore, A In Cl* (A) and B In Clψ (B), then A and B are pre- I-open and ψ -pre-open sets respectively. Let x, y be
any two element of X and both x and y are in A .Take V = A{y} and U = B {y}. To show that V also pre- I-open set
Cl*(A{y}) = Cl*(A) Cl* ({y}) = X. Hence A{y} In Cl*(A{y}.Therefore, V is pre-I-open. Now to show that U = B
8. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (265-272), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 272
Paper Publications
{y} is ψ -pre-open. Clψ (B {y}) = Clψ (B) Clψ{y} = X Clψ ({y}) = X .Hence B {y} In Clψ (B {y}), so U is ψ -pre-
open. Hence (X, T, I) is ψ –T*-Housdorff.
(3) Let A and B be disjoint ψ -dense subsets of X such that X = A B. Since Clψ(A) = Clψ(B) = X. Therefore, A In Clψ(A)
and B In Clψ(B), then A and B are ψ-pre-open sets. Let x, y be any two element of X and both x and y are in A. Take U
= A{y} and V = B {y}. By Theorem 2.1.5: (8) we have V and U are ψ-pre-open sets. To show that U is ψ-pre-open, Clψ
(A{y}) = Clψ (A) Clψ({y}) = X Clψ({y}) = X, A{y} In Clψ(A). Now to show that V is ψ-pre-open. Clψ(B {y}) =
Clψ(B) Clψ({y}) = X, B {y} In Clψ(B). Hence U,V are ψ-pre-open. Therefore, (X, T, I) is ψ-Housdorff.
REFERENCES
[1] Dontchev, J., Ganster, M., Rose, D., Ideal resolvability.Topology and its Appl. 93(1999), 1-16.
[2] J Dontcher, On Housdorff spaces via topology ideals and I-irresolute functions Annals of the New York Academy
of Sciences, Papers on General Topology and Applications, Vol.767(1995), 28-38.
[3] J.Donkhev, On pre-I-open sets and a decomposition of I-continuity, Banyan Math. J., 2 (1996).
[4] J. Dontcher, M.Ganster, D.Rose, Ideal resolvability, Topology and its Applications, 19(1999), 1-6.
[5] E.Hewitt, A problem of set-theoretic topology, Duke Math.J,10 (1943),309-333.
[6] D.Jankovic and T.R.Hamlett, New topologies from old via ideals, Amer. Math. Monthly, 97(1990),295-310.
[7] D. Jankovic and T.R.Hamlett, Compatible Extensions of Ideals, Bollettino U.M.I,7(1992),453-465.
[8] K.Kuratowski,Topology,Vol 1,Academic Press, New York,1966. K. Kuratowski, Topology I, Warszawa, 1933.
[9] T.Natkaniec, On I-continuitty and I-semicontinuity points, Math Solvaca, 36:3 (1986), 297-312.
[10] V.R.Devid.Sivaraj, T.T. Chelvam, Codense and completely codense ideals, Acta Nath. Hungar. 108 (2005) 197-205.
[11] R.Vaidyanathaswamy, set topology, Ghelsea Publishing company (1960).