In this paper, we introduce the notion of intuitionistic fuzzy semipre generalized connected space, intuitionistic fuzzy semipre generalized super connected space and intuitionistic fuzzy semipre generalized extremally disconnected spaces. We investigate some of their properties.
On Some New Contra Continuous and Contra Open Mappings in Intuitionistic Fuzz...Editor IJCATR
In this paper we introduce intuitionistic fuzzy contra semipre generalized continuous mappings, intuitionistic fuzzy almost contra semipre generalized continuous mappings and intuitionistic fuzzy contra semipre generalized open mappings. We study some of their properties.
On Some New Continuous Mappings in Intuitionistic Fuzzy Topological SpacesEditor IJCATR
In this paper we introduce intuitionistic fuzzy almost semipre generalized continuous mappings, intuitionistic fuzzy completely semipre generalized continuous mappings, intuitionistic fuzzy almost semipre generalized closed mappings and intuitionistic fuzzy almost semipre generalized open mappings. Some of their properties are studied.
In this paper, we introduce the notion of an intuitionistic fuzzy generalized semipre regular closed sets and intuitionistic fuzzy generalized semipre regular open sets and study some of its properties in Intuitionistic fuzzy topological spaces.
International Refereed Journal of Engineering and Science (IRJES) is a peer reviewed online journal for professionals and researchers in the field of computer science. The main aim is to resolve emerging and outstanding problems revealed by recent social and technological change. IJRES provides the platform for the researchers to present and evaluate their work from both theoretical and technical aspects and to share their views.
www.irjes.com
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.
On pgr Homeomorphisms in Intuitionistic Fuzzy Topological SpacesEditor IJCATR
In this paper, we introduce intuitionistic fuzzy pgr closed mapping, intuitionistic fuzzy pgr open mapping,
intuitionistic fuzzy pgr homeomorphisms and study some of their properties in intuitionistic fuzzy topological spaces.
On Some New Contra Continuous and Contra Open Mappings in Intuitionistic Fuzz...Editor IJCATR
In this paper we introduce intuitionistic fuzzy contra semipre generalized continuous mappings, intuitionistic fuzzy almost contra semipre generalized continuous mappings and intuitionistic fuzzy contra semipre generalized open mappings. We study some of their properties.
On Some New Continuous Mappings in Intuitionistic Fuzzy Topological SpacesEditor IJCATR
In this paper we introduce intuitionistic fuzzy almost semipre generalized continuous mappings, intuitionistic fuzzy completely semipre generalized continuous mappings, intuitionistic fuzzy almost semipre generalized closed mappings and intuitionistic fuzzy almost semipre generalized open mappings. Some of their properties are studied.
In this paper, we introduce the notion of an intuitionistic fuzzy generalized semipre regular closed sets and intuitionistic fuzzy generalized semipre regular open sets and study some of its properties in Intuitionistic fuzzy topological spaces.
International Refereed Journal of Engineering and Science (IRJES) is a peer reviewed online journal for professionals and researchers in the field of computer science. The main aim is to resolve emerging and outstanding problems revealed by recent social and technological change. IJRES provides the platform for the researchers to present and evaluate their work from both theoretical and technical aspects and to share their views.
www.irjes.com
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.
On pgr Homeomorphisms in Intuitionistic Fuzzy Topological SpacesEditor IJCATR
In this paper, we introduce intuitionistic fuzzy pgr closed mapping, intuitionistic fuzzy pgr open mapping,
intuitionistic fuzzy pgr homeomorphisms and study some of their properties in intuitionistic fuzzy topological spaces.
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.
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroupsjournal ijrtem
ABSTRACT:The aim of this paper is basically to study the First Isomorphism Theorem, Second Isomorphism Theorem, Third Isomorphism theorem, Correspondence Theorem etc. of intuitionistic fuzzy/vague sub groups of a crisp group.
KEY WORDS: Intutionistic fuzzy or Vague Subset, Intutionistic fuzzy Image, Intutionistic fuzzy Inverse Image, Intutionistic fuzzy/vague sub (normal) group, Correspondence Theorem, First (Second, Third) Isomorphism Theorem.
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.
In the present paper , we introduce and study the concept of gr- Ti- space (for i =0,1,2) and
obtain the characterization of gr –regular space , gr- normal space by using the notion of gr-open
sets. Further, some of their properties and results are discussed.
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.
The determination of this paper is to introduce two new spaces , namely 𝑆𝑔
∗
-compact and 𝑆𝑔
∗
-
connected spaces. Additionally some properties of these spaces are investigated.
Mathematics Subject Classification: 54A05
Some More Results on Intuitionistic Semi Open SetsIJERA Editor
The purpose of this paper is to define and study the intuitionistic semi open sets in intuitionistic topological
space. Also some properties of this set are discussed.
In general topology many strong and weak forms of open and closed sets have been defined
and studied. Govindappa Navalagi introduced the concept of semi α-open sets which is a weaker form of
α-open sets. Semi*α-open set is defined analogously by replacing the closure operator by the
generalized closure operator due to Dunham in the definition of semi α-open sets. In this paper we
introduce a new class of sets, namely semi*α-closed sets, as the complement of semi*α-open sets. We
find characterizations of semi*α-closed sets. We also define the semi*α-closure of a subset. Further we
investigate fundamental properties of the semi*α-closure. We define the semi*α-derived set of a subset
and study its properties.
Abstract: In this paper, we define and study about a new type of generalized closed set called, g∗s-closed set.Its relationship with already defined generalized closed sets are also studied
μ-πrα Closed Sets in Bigeneralized Topological SpacesIJERA Editor
The aim of the paper is to introduce the concept of μ(m,n)-πrα closed sets in bigeneralized topological spaces and study some of their properties. We also introduce the notion of μ(m,n)-πrα continuous function and μ(m,n)-πrα T1/2 spaces on bigeneralized topological spaces and investigate some of their properties. Mathematics subject classification: 54A05, 54A10
Grid computing is a modularized way of structuring network resources so as to share the information and resources, to perform heavily intense problems. Grid computing is a part of distributed processing which allows the distribution of the problem over multiple computational resources. The formation of grid decides the computation cost, the performance metrics of the operation to be carried out. The grid computing favours the formation of an adhoc structure formed at the time of request (it does not hold an infrastructure) that is termed as virtual organization. This paper presents dynamic source routing for modeling virtual organization.
Risk Prediction for Production of an EnterpriseEditor IJCATR
Despite all preventive measures, there is so much possibility of risks in any project development as well as in enterprise management. There is no any standard mechanism or methodology available to assess the risks in any project or production management. Using some precautionary steps, the manager can only avoid the risks as much as he can. To address this issue, this paper presents a probabilistic risk assessment model for the production of an enterprise. For this, Multi-Entity Bayesian Network (MEBN) has been used to represent the requirements for production management as well as to assess the risks adherence in production management, where MEBN combines expressivity of first-order logic and probabilistic feature of Bayesian network. Bayesian network provides the feature to represent the probabilistic uncertainty and reasoning about probabilistic knowledge base, which is used here to represent the probable risks behind each causes of a risk. The proposed probabilistic model is discussed with the help of a case study, which is used to predict risks inherent in the production of an enterprise, which depends upon various measures like labour availability, power backup, transport availability etc.
Online Social Network (OSN) sites act as a medium to spread their own views, activities and their thoughts to some camaraderie. Contents of this network are spread over web, so it was hard to determine by a human decision. Currently, they do not provide any mechanism to ensure privacy concerns towards data associated with each user. Due to this problem, number of users lacks from their ownership control. In this paper, we proposed AC2P (Activity Control-Access Control Protocol) for information control on the web. Alternatively, Tag Refinement strategy determines illegal tagging over images and send notification about particular image spread within different communities/groups. These techniques reduce risk of information flow and avoid unwanted tagging toward images.
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.
Correspondence and Isomorphism Theorems for Intuitionistic fuzzy subgroupsjournal ijrtem
ABSTRACT:The aim of this paper is basically to study the First Isomorphism Theorem, Second Isomorphism Theorem, Third Isomorphism theorem, Correspondence Theorem etc. of intuitionistic fuzzy/vague sub groups of a crisp group.
KEY WORDS: Intutionistic fuzzy or Vague Subset, Intutionistic fuzzy Image, Intutionistic fuzzy Inverse Image, Intutionistic fuzzy/vague sub (normal) group, Correspondence Theorem, First (Second, Third) Isomorphism Theorem.
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.
In the present paper , we introduce and study the concept of gr- Ti- space (for i =0,1,2) and
obtain the characterization of gr –regular space , gr- normal space by using the notion of gr-open
sets. Further, some of their properties and results are discussed.
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.
The determination of this paper is to introduce two new spaces , namely 𝑆𝑔
∗
-compact and 𝑆𝑔
∗
-
connected spaces. Additionally some properties of these spaces are investigated.
Mathematics Subject Classification: 54A05
Some More Results on Intuitionistic Semi Open SetsIJERA Editor
The purpose of this paper is to define and study the intuitionistic semi open sets in intuitionistic topological
space. Also some properties of this set are discussed.
In general topology many strong and weak forms of open and closed sets have been defined
and studied. Govindappa Navalagi introduced the concept of semi α-open sets which is a weaker form of
α-open sets. Semi*α-open set is defined analogously by replacing the closure operator by the
generalized closure operator due to Dunham in the definition of semi α-open sets. In this paper we
introduce a new class of sets, namely semi*α-closed sets, as the complement of semi*α-open sets. We
find characterizations of semi*α-closed sets. We also define the semi*α-closure of a subset. Further we
investigate fundamental properties of the semi*α-closure. We define the semi*α-derived set of a subset
and study its properties.
Abstract: In this paper, we define and study about a new type of generalized closed set called, g∗s-closed set.Its relationship with already defined generalized closed sets are also studied
μ-πrα Closed Sets in Bigeneralized Topological SpacesIJERA Editor
The aim of the paper is to introduce the concept of μ(m,n)-πrα closed sets in bigeneralized topological spaces and study some of their properties. We also introduce the notion of μ(m,n)-πrα continuous function and μ(m,n)-πrα T1/2 spaces on bigeneralized topological spaces and investigate some of their properties. Mathematics subject classification: 54A05, 54A10
Grid computing is a modularized way of structuring network resources so as to share the information and resources, to perform heavily intense problems. Grid computing is a part of distributed processing which allows the distribution of the problem over multiple computational resources. The formation of grid decides the computation cost, the performance metrics of the operation to be carried out. The grid computing favours the formation of an adhoc structure formed at the time of request (it does not hold an infrastructure) that is termed as virtual organization. This paper presents dynamic source routing for modeling virtual organization.
Risk Prediction for Production of an EnterpriseEditor IJCATR
Despite all preventive measures, there is so much possibility of risks in any project development as well as in enterprise management. There is no any standard mechanism or methodology available to assess the risks in any project or production management. Using some precautionary steps, the manager can only avoid the risks as much as he can. To address this issue, this paper presents a probabilistic risk assessment model for the production of an enterprise. For this, Multi-Entity Bayesian Network (MEBN) has been used to represent the requirements for production management as well as to assess the risks adherence in production management, where MEBN combines expressivity of first-order logic and probabilistic feature of Bayesian network. Bayesian network provides the feature to represent the probabilistic uncertainty and reasoning about probabilistic knowledge base, which is used here to represent the probable risks behind each causes of a risk. The proposed probabilistic model is discussed with the help of a case study, which is used to predict risks inherent in the production of an enterprise, which depends upon various measures like labour availability, power backup, transport availability etc.
Online Social Network (OSN) sites act as a medium to spread their own views, activities and their thoughts to some camaraderie. Contents of this network are spread over web, so it was hard to determine by a human decision. Currently, they do not provide any mechanism to ensure privacy concerns towards data associated with each user. Due to this problem, number of users lacks from their ownership control. In this paper, we proposed AC2P (Activity Control-Access Control Protocol) for information control on the web. Alternatively, Tag Refinement strategy determines illegal tagging over images and send notification about particular image spread within different communities/groups. These techniques reduce risk of information flow and avoid unwanted tagging toward images.
Data Mining is an analytic process designed to explore data in search of consistent patterns and systematic relationships between variables, and then to validate the results by applying the patterns found to a new subset of data. Data mining is often described as the process of discovering patterns, correlations, trends or relationships by searching through a large amount of data stored in repositories, databases, and data warehouses. Diabetes, often referred to by doctors as diabetes mellitus, describes a group of metabolic diseases in which the person has high blood [3] glucose (blood sugar), either because insulin production is insufficient, or because the body's cells do not respond properly to insulin, or both. This project helps in identifying whether a person has diabetes or not, if predicted diabetic[4] the project suggest measures for maintaining normal health and if not diabetic it predicts the risk of getting diabetic. In this project Classification algorithm was used to classify the Pima Indian diabetes dataset. Results have been obtained using Android Application.
One of the most popular areas of research is wireless communication. Mobile Ad Hoc network (MANET) is a network with wireless mobile nodes, infrastructure less and self organizing. With its wireless and distributed nature it is exposed to several security threats. One of the threats in MANET is the wormhole attack. In this attack a pair of attacker forms a virtual link thereby recording and replaying the wireless transmission. This paper presents types of wormhole attack and also includes different technique for detecting wormhole attack in MANET..
Wireless data broadcast is an efficient way of disseminating data to users in the mobile computing environments. From the server’s point of view, how to place the data items on channels is a crucial issue, with the objective of minimizing the average access time and tuning time. Similarly, how to schedule the data retrieval process for a given request at the client side such that all the requested items can be downloaded in a short time is also an important problem. In this paper, we investigate the multi-item data retrieval scheduling in the push-based multichannel broadcast environments. The most important issues in mobile computing are energy efficiency and query response efficiency. However, in data broadcast the objectives of reducing access latency and energy cost can be contradictive to each other. Consequently, we define a new problem named Minimum Cost Data Retrieval Problem (MCDR) and Large Number Data Retrieval (LNDR) Problem. We also develop a heuristic algorithm to download a large number of items efficiently. When there is no replicated item in a broadcast cycle, we show that an optimal retrieval schedule can be obtained in polynomial time
Image enhancement plays an important role in vision applications. Recently a lot of work has been performed in the field of image enhancement. Many techniques have already been proposed till now for enhancing the digital images. This paper has presented a comparative analysis of various image enhancement techniques. This paper has shown that the fuzzy logic and histogram based techniques have quite effective results over the available techniques. This paper ends up with suitable future directions to enhance fuzzy based image enhancement technique further. In the proposed technique, an approach is made to enhance the images other than low-contrast images as well by balancing the stretching parameter (K) according to the color contrast. Proposed technique is designed to restore the degraded edges resulted due to contrast enhancement as well.
In this paper, we consider a criminal investigation on the collective guilt of part members in a working group. Assuming that the statistics we used are reliable, we present the Page Rank Model based on mutual information. First, we use the average mutual information between non-suspicious topics and the suspicious topics to score the topics by degree of suspicion. Second, we build the correlation matrix based on the degree of suspicion and acquire the corresponding Markov state transition matrix. Then, we set the original value for all members of the working group based on the degree of suspicion. At the last, we calculate the suspected degree of each member in the working group. In the small 10-people case, we build the improved Page Rank model. By calculating the statistics of this case, we acquire a table which indicates the ranking of the suspected degree. In contrast with the results given in this issue, we find these two results basically match each other, indicating the model we have built is feasible. In the current case, firstly, we obtain a ranking list on 15 topics in order of suspicion via Page Rank Model based on mutual information. Secondly, we acquire the stable point of Markov state transition matrix using the Markov chain. Then, we build the connection matrix based on the degree of suspicion and acquire the corresponding Markov state transition matrix. Last, we calculate the degree of 83 candidates. From the result, we can see that those suspicious are on the top of the ranking list while those innocent people are at the bottom of the list, representing that the model we have built is feasible. When suspicious topics and conspirators changed, a relatively good result can also be obtained by this model. In the current case, we have the evidence to believe that Dolores and Jerome, who are the senior managers, have significant suspicion. It is recommended that future attention should be paid to them. The Page Rank Model, based on mutual information, takes full account of the information flow in message distribution network. This model can not only deal with the statistics used in conspiracy, but also be applied to detect the infected cells in a biological network. Finally, we present the advantages and disadvantages of this model and the direction of improvements.
Multi-Agent systems (Autonomous agents or agents) and knowledge discovery (or data mining) are two active
areas in information technology. A profound insight of bringing these two communities together has unveiled a tremendous
potential for new opportunities and wider applications through the synergy of agents and data mining. Multi-agent systems
(MAS) often deal with complex applications that require distributed problem solving. In many applications the individual and
collective behavior of the agents depends on the observed data from distributed data sources. Data mining technology has
emerged, for identifying patterns and trends from large quantities of data. The increasing demand to scale up to massive data sets
inherently distributed over a network with limited band width and computational resources available motivated the development of
distributed data mining (DDM).Distributed data mining is originated from the need of mining over decentralized data
sources. DDM is expected to perform partial analysis of data at individual sites and then to send the outcome as partial result
to other sites where it sometimes required to be aggregated to the global result
Security for Effective Data Storage in Multi CloudsEditor IJCATR
Cloud Computing is a technology that uses the internet and central remote servers to maintain data and
applications. Cloud computing allows consumers and businesses to use applications without installation and access their personal
files at any computer with internet access. This technology allows for much more efficient computing by centralizing data
storage, processing and bandwidth. The use of cloud computing has increased rapidly in many organizations. Cloud computing
provides many benefits in terms of low cost and accessibility of data. Ensuring the security of cloud computing is a major factor
in the cloud computing environment, as users often store sensitive information with cloud storage providers but these providers
may be untrusted. Dealing with “single cloud” providers is predicted to become less popular with customers due to risks of
service availability failure and the possibility of malicious insiders in the single cloud. A movement towards “multi-clouds”, or in
other words, “interclouds” or “cloud-of clouds” has emerged recently. This paper surveys recent research related to single and
multi-cloud security and addresses possible solutions. It is found that the research into the use of multicloud providers to maintain
security has received less attention from the research community than has the use of single clouds. This work aims to promote the
use of multi-clouds due to its ability to reduce security risks that affect the cloud computing user.
Random Valued Impulse Noise Elimination using Neural FilterEditor IJCATR
A neural filtering technique is proposed in this paper for restoring the images extremely corrupted with random valued impulse noise. The proposed intelligent filter is carried out in two stages. In first stage the corrupted image is filtered by applying an asymmetric trimmed median filter. An asymmetric trimmed median filtered output image is suitably combined with a feed forward neural network in the second stage. The internal parameters of the feed forward neural network are adaptively optimized by training of three well known images. This is quite effective in eliminating random valued impulse noise. Simulation results show that the proposed filter is superior in terms of eliminating impulse noise as well as preserving edges and fine details of digital images and results are compared with other existing nonlinear filters.
Assistive Examination System for Visually ImpairedEditor IJCATR
This paper presents a design of voice enabled examination system which can be used by the visually challenged students.
The system uses Text-to-Speech (TTS) and Speech-to-Text (STT) technology. The text-to-speech and speech-to-text web based
academic testing software would provide an interaction for blind students to enhance their educational experiences by providing them
with a tool to give the exams. This system will aid the differently-abled to appear for online tests and enable them to come at par with
the other students. This system can also be used by students with learning disabilities or by people who wish to take the examination in
a combined auditory and visual way.
A Formal Machine Learning or Multi Objective Decision Making System for Deter...Editor IJCATR
Decision-making typically needs the mechanisms to compromise among opposing norms. Once multiple objectives square measure is concerned of machine learning, a vital step is to check the weights of individual objectives to the system-level performance. Determinant, the weights of multi-objectives is associate in analysis method, associated it's been typically treated as a drawback. However, our preliminary investigation has shown that existing methodologies in managing the weights of multi-objectives have some obvious limitations like the determination of weights is treated as one drawback, a result supporting such associate improvement is limited, if associated it will even be unreliable, once knowledge concerning multiple objectives is incomplete like an integrity caused by poor data. The constraints of weights are also mentioned. Variable weights square measure is natural in decision-making processes. Here, we'd like to develop a scientific methodology in determinant variable weights of multi-objectives. The roles of weights in a creative multi-objective decision-making or machine-learning of square measure analyzed, and therefore the weights square measure determined with the help of a standard neural network.
Risk-Aware Response Mechanism with Extended D-S theoryEditor IJCATR
Mobile Ad hoc Networks (MANET) are having dynamic nature of its network infrastructure and
it is vulnerable to all types of attacks. Among these attacks, the routing attacks getting more attention
because its changing the whole topology itself and it causes more damage to MANET. Even there are lot of
intrusion detection Systems available to diminish those critical attacks, existing causesunexpected network
partition, and causes additional damages to the infrastructure of the network , and it leads to uncertainty in
finding routing attacks in MANET. In this paper, we propose a adaptive risk-aware response mechanism with
extended Dempster-Shafer theory in MANET to identify the routing attacks and malicious node. Our
techniques find the malicious node with degree of evidence from the expert knowledge and detect the
important factors for each node.It creates black list and all those malicious nodes so that it may not enter the
network again
On some locally closed sets and spaces in Ideal Topological SpacesIJMER
In this paper we introduce and characterize some new generalized locally closed sets
known as
δ
ˆ
s-locally closed sets and spaces are known as
δ
ˆ
s-normal space and
δ
ˆ
s-connected space and
discussed some of their properties
On intuitionistic fuzzy 휷 generalized closed setsijceronline
In this paper, we have introduced the notion of intuitionistic fuzzy 훽 generalized closed sets, and investigated some of their properties and characterizations
On intuitionistic fuzzy 휷 generalized closed setsijceronline
In this paper, we have introduced the notion of intuitionistic fuzzy 훽 generalized closed sets, and investigated some of their properties and characterizations
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications
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.
In this paper, we define and study about a new type of generalized closed set called, 𝑔∗s-closed set.Its relationship with already defined generalized closed sets are also studied.
Intuitionistic Fuzzy W- Closed Sets and Intuitionistic Fuzzy W -ContinuityWaqas Tariq
The aim of this paper is to introduce and study the concepts of intuitionistic fuzzy w- closed sets, intuitionistic fuzzy w-continuity and inttuitionistic fuzzy w-open & intuitionistic fuzzy w-closed mappings in intuitionistic fuzzy topological spaces.
Fundamentals of Parameterised Covering Approximation SpaceYogeshIJTSRD
Combination of theories has not only advanced the research, but also helped in handling the issues of impreciseness in real life problems. The soft rough set has been defined by many authors by combining the theories of soft set and rough set. The concept Soft Covering Based Rough Set be given by J.Zhan et al 2008 , Feng Feng et al 2011 , S.Yuksel et al 2015 by taking full soft set instead of Covering. In this note We first consider the covering soft set and then covering based soft rough set. Again it defines a mapping from the coverings of element of universal set U to the parameters attributes . The new model “Parameterised Soft Rough Set on Covering Approximation Space is conceptualised to capture the issues of vagueness, and impreciseness of information. Also dependency on this new model and some properties be studied. Kedar Chandra Parida | Debadutta Mohanty "Fundamentals of Parameterised Covering Approximation Space" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-3 , April 2021, URL: https://www.ijtsrd.com/papers/ijtsrd38761.pdf Paper URL: https://www.ijtsrd.com/mathemetics/applied-mathematics/38761/fundamentals-of-parameterised-covering-approximation-space/kedar-chandra-parida
In this paper we introduce the concept of connectedness in fuzzy rough topological spaces.
We also investigate some properties of connectedness in fuzzy rough topological spaces.
In this paper we introduce a new class of sets known as
δ
ˆ
S –closed sets in ideal topological
spaces and we studied some of its basic properties and characterizations. This new class of sets lies
between –I–closed [19] sets and g–closed sets, and its unique feature is it forms topology and it is
independent of open sets.
In this paper, we introduce the concept of residual quotient of intuitionistic fuzzy subsets of ring and module and then define the notion of residual quotient intuitionistic fuzzy submodules , residual quotient intuitionistic fuzzy ideals. We study many properties of residual quotient relating to union, intersection, sum of intuitionistic fuzzy submodules (ideals). Using the concept of residual quotient, we investigate some important characterization of intuitionistic fuzzy annihilator of subsets of ring and module. We also study intuitionistic fuzzy prime submodules with the help of intuitionistic fuzzy annihilators. Many related properties are defined and discussed.
In this paper, we introduce the concept of residual quotient of intuitionistic fuzzy subsets of ring and module and then define the notion of residual quotient intuitionistic fuzzy submodules , residual quotient intuitionistic fuzzy ideals. We study many properties of residual quotient relating to union, intersection, sum of intuitionistic fuzzy submodules (ideals). Using the concept of residual quotient, we investigate some important characterization of intuitionistic fuzzy annihilator of subsets of ring and module. We also study intuitionistic fuzzy prime submodules with the help of intuitionistic fuzzy annihilators. Many related properties are defined and discussed
On Zα-Open Sets and Decompositions of ContinuityIJERA Editor
In this paper, we introduce and study the notion of Zα-open sets and some properties of this class of sets are investigated. Also, we introduce the class of A *L-sets via Zα-open sets. Further, by using these sets, a new decompositions of continuous functions are presented. (2000) AMS Subject Classifications: 54D10; 54C05; 54C08.
The authors Selvi.R, Thangavelu.P and
Anitha.m introduced the concept of
-continuity between a
topological space and a non empty set where
{L, M, R, S}
[4]. Navpreet singh Noorie and Rajni Bala[3] introduced the
concept of f#
function to characterize the closed, open and
continuous functions. In this paper, the concept of Semi- -
continuity is introduced and its properties are investigated and
Semi- -continuity is further characterized by using f#
functions
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)
Similar to Intuitionistic Fuzzy Semipre Generalized Connected Spaces (20)
Text Mining in Digital Libraries using OKAPI BM25 ModelEditor IJCATR
The emergence of the internet has made vast amounts of information available and easily accessible online. As a result, most libraries have digitized their content in order to remain relevant to their users and to keep pace with the advancement of the internet. However, these digital libraries have been criticized for using inefficient information retrieval models that do not perform relevance ranking to the retrieved results. This paper proposed the use of OKAPI BM25 model in text mining so as means of improving relevance ranking of digital libraries. Okapi BM25 model was selected because it is a probability-based relevance ranking algorithm. A case study research was conducted and the model design was based on information retrieval processes. The performance of Boolean, vector space, and Okapi BM25 models was compared for data retrieval. Relevant ranked documents were retrieved and displayed at the OPAC framework search page. The results revealed that Okapi BM 25 outperformed Boolean model and Vector Space model. Therefore, this paper proposes the use of Okapi BM25 model to reward terms according to their relative frequencies in a document so as to improve the performance of text mining in digital libraries.
Green Computing, eco trends, climate change, e-waste and eco-friendlyEditor IJCATR
This study focused on the practice of using computing resources more efficiently while maintaining or increasing overall performance. Sustainable IT services require the integration of green computing practices such as power management, virtualization, improving cooling technology, recycling, electronic waste disposal, and optimization of the IT infrastructure to meet sustainability requirements. Studies have shown that costs of power utilized by IT departments can approach 50% of the overall energy costs for an organization. While there is an expectation that green IT should lower costs and the firm’s impact on the environment, there has been far less attention directed at understanding the strategic benefits of sustainable IT services in terms of the creation of customer value, business value and societal value. This paper provides a review of the literature on sustainable IT, key areas of focus, and identifies a core set of principles to guide sustainable IT service design.
Policies for Green Computing and E-Waste in NigeriaEditor IJCATR
Computers today are an integral part of individuals’ lives all around the world, but unfortunately these devices are toxic to the environment given the materials used, their limited battery life and technological obsolescence. Individuals are concerned about the hazardous materials ever present in computers, even if the importance of various attributes differs, and that a more environment -friendly attitude can be obtained through exposure to educational materials. In this paper, we aim to delineate the problem of e-waste in Nigeria and highlight a series of measures and the advantage they herald for our country and propose a series of action steps to develop in these areas further. It is possible for Nigeria to have an immediate economic stimulus and job creation while moving quickly to abide by the requirements of climate change legislation and energy efficiency directives. The costs of implementing energy efficiency and renewable energy measures are minimal as they are not cash expenditures but rather investments paid back by future, continuous energy savings.
Performance Evaluation of VANETs for Evaluating Node Stability in Dynamic Sce...Editor IJCATR
Vehicular ad hoc networks (VANETs) are a favorable area of exploration which empowers the interconnection amid the movable vehicles and between transportable units (vehicles) and road side units (RSU). In Vehicular Ad Hoc Networks (VANETs), mobile vehicles can be organized into assemblage to promote interconnection links. The assemblage arrangement according to dimensions and geographical extend has serious influence on attribute of interaction .Vehicular ad hoc networks (VANETs) are subclass of mobile Ad-hoc network involving more complex mobility patterns. Because of mobility the topology changes very frequently. This raises a number of technical challenges including the stability of the network .There is a need for assemblage configuration leading to more stable realistic network. The paper provides investigation of various simulation scenarios in which cluster using k-means algorithm are generated and their numbers are varied to find the more stable configuration in real scenario of road.
Optimum Location of DG Units Considering Operation ConditionsEditor IJCATR
The optimal sizing and placement of Distributed Generation units (DG) are becoming very attractive to researchers these days. In this paper a two stage approach has been used for allocation and sizing of DGs in distribution system with time varying load model. The strategic placement of DGs can help in reducing energy losses and improving voltage profile. The proposed work discusses time varying loads that can be useful for selecting the location and optimizing DG operation. The method has the potential to be used for integrating the available DGs by identifying the best locations in a power system. The proposed method has been demonstrated on 9-bus test system.
Analysis of Comparison of Fuzzy Knn, C4.5 Algorithm, and Naïve Bayes Classifi...Editor IJCATR
Early detection of diabetes mellitus (DM) can prevent or inhibit complication. There are several laboratory test that must be done to detect DM. The result of this laboratory test then converted into data training. Data training used in this study generated from UCI Pima Database with 6 attributes that were used to classify positive or negative diabetes. There are various classification methods that are commonly used, and in this study three of them were compared, which were fuzzy KNN, C4.5 algorithm and Naïve Bayes Classifier (NBC) with one identical case. The objective of this study was to create software to classify DM using tested methods and compared the three methods based on accuracy, precision, and recall. The results showed that the best method was Fuzzy KNN with average and maximum accuracy reached 96% and 98%, respectively. In second place, NBC method had respective average and maximum accuracy of 87.5% and 90%. Lastly, C4.5 algorithm had average and maximum accuracy of 79.5% and 86%, respectively.
Web Scraping for Estimating new Record from Source SiteEditor IJCATR
Study in the Competitive field of Intelligent, and studies in the field of Web Scraping, have a symbiotic relationship mutualism. In the information age today, the website serves as a main source. The research focus is on how to get data from websites and how to slow down the intensity of the download. The problem that arises is the website sources are autonomous so that vulnerable changes the structure of the content at any time. The next problem is the system intrusion detection snort installed on the server to detect bot crawler. So the researchers propose the use of the methods of Mining Data Records and the method of Exponential Smoothing so that adaptive to changes in the structure of the content and do a browse or fetch automatically follow the pattern of the occurrences of the news. The results of the tests, with the threshold 0.3 for MDR and similarity threshold score 0.65 for STM, using recall and precision values produce f-measure average 92.6%. While the results of the tests of the exponential estimation smoothing using ? = 0.5 produces MAE 18.2 datarecord duplicate. It slowed down to 3.6 datarecord from 21.8 datarecord results schedule download/fetch fix in an average time of occurrence news.
Evaluating Semantic Similarity between Biomedical Concepts/Classes through S...Editor IJCATR
Most of the existing semantic similarity measures that use ontology structure as their primary source can measure semantic similarity between concepts/classes using single ontology. The ontology-based semantic similarity techniques such as structure-based semantic similarity techniques (Path Length Measure, Wu and Palmer’s Measure, and Leacock and Chodorow’s measure), information content-based similarity techniques (Resnik’s measure, Lin’s measure), and biomedical domain ontology techniques (Al-Mubaid and Nguyen’s measure (SimDist)) were evaluated relative to human experts’ ratings, and compared on sets of concepts using the ICD-10 “V1.0” terminology within the UMLS. The experimental results validate the efficiency of the SemDist technique in single ontology, and demonstrate that SemDist semantic similarity techniques, compared with the existing techniques, gives the best overall results of correlation with experts’ ratings.
Semantic Similarity Measures between Terms in the Biomedical Domain within f...Editor IJCATR
The techniques and tests are tools used to define how measure the goodness of ontology or its resources. The similarity between biomedical classes/concepts is an important task for the biomedical information extraction and knowledge discovery. However, most of the semantic similarity techniques can be adopted to be used in the biomedical domain (UMLS). Many experiments have been conducted to check the applicability of these measures. In this paper, we investigate to measure semantic similarity between two terms within single ontology or multiple ontologies in ICD-10 “V1.0” as primary source, and compare my results to human experts score by correlation coefficient.
A Strategy for Improving the Performance of Small Files in Openstack Swift Editor IJCATR
This is an effective way to improve the storage access performance of small files in Openstack Swift by adding an aggregate storage module. Because Swift will lead to too much disk operation when querying metadata, the transfer performance of plenty of small files is low. In this paper, we propose an aggregated storage strategy (ASS), and implement it in Swift. ASS comprises two parts which include merge storage and index storage. At the first stage, ASS arranges the write request queue in chronological order, and then stores objects in volumes. These volumes are large files that are stored in Swift actually. During the short encounter time, the object-to-volume mapping information is stored in Key-Value store at the second stage. The experimental results show that the ASS can effectively improve Swift's small file transfer performance.
Integrated System for Vehicle Clearance and RegistrationEditor IJCATR
Efficient management and control of government's cash resources rely on government banking arrangements. Nigeria, like many low income countries, employed fragmented systems in handling government receipts and payments. Later in 2016, Nigeria implemented a unified structure as recommended by the IMF, where all government funds are collected in one account would reduce borrowing costs, extend credit and improve government's fiscal policy among other benefits to government. This situation motivated us to embark on this research to design and implement an integrated system for vehicle clearance and registration. This system complies with the new Treasury Single Account policy to enable proper interaction and collaboration among five different level agencies (NCS, FRSC, SBIR, VIO and NPF) saddled with vehicular administration and activities in Nigeria. Since the system is web based, Object Oriented Hypermedia Design Methodology (OOHDM) is used. Tools such as Php, JavaScript, css, html, AJAX and other web development technologies were used. The result is a web based system that gives proper information about a vehicle starting from the exact date of importation to registration and renewal of licensing. Vehicle owner information, custom duty information, plate number registration details, etc. will also be efficiently retrieved from the system by any of the agencies without contacting the other agency at any point in time. Also number plate will no longer be the only means of vehicle identification as it is presently the case in Nigeria, because the unified system will automatically generate and assigned a Unique Vehicle Identification Pin Number (UVIPN) on payment of duty in the system to the vehicle and the UVIPN will be linked to the various agencies in the management information system.
Assessment of the Efficiency of Customer Order Management System: A Case Stu...Editor IJCATR
The Supermarket Management System deals with the automation of buying and selling of good and services. It includes both sales and purchase of items. The project Supermarket Management System is to be developed with the objective of making the system reliable, easier, fast, and more informative.
Energy-Aware Routing in Wireless Sensor Network Using Modified Bi-Directional A*Editor IJCATR
Energy is a key component in the Wireless Sensor Network (WSN)[1]. The system will not be able to run according to its function without the availability of adequate power units. One of the characteristics of wireless sensor network is Limitation energy[2]. A lot of research has been done to develop strategies to overcome this problem. One of them is clustering technique. The popular clustering technique is Low Energy Adaptive Clustering Hierarchy (LEACH)[3]. In LEACH, clustering techniques are used to determine Cluster Head (CH), which will then be assigned to forward packets to Base Station (BS). In this research, we propose other clustering techniques, which utilize the Social Network Analysis approach theory of Betweeness Centrality (BC) which will then be implemented in the Setup phase. While in the Steady-State phase, one of the heuristic searching algorithms, Modified Bi-Directional A* (MBDA *) is implemented. The experiment was performed deploy 100 nodes statically in the 100x100 area, with one Base Station at coordinates (50,50). To find out the reliability of the system, the experiment to do in 5000 rounds. The performance of the designed routing protocol strategy will be tested based on network lifetime, throughput, and residual energy. The results show that BC-MBDA * is better than LEACH. This is influenced by the ways of working LEACH in determining the CH that is dynamic, which is always changing in every data transmission process. This will result in the use of energy, because they always doing any computation to determine CH in every transmission process. In contrast to BC-MBDA *, CH is statically determined, so it can decrease energy usage.
Security in Software Defined Networks (SDN): Challenges and Research Opportun...Editor IJCATR
In networks, the rapidly changing traffic patterns of search engines, Internet of Things (IoT) devices, Big Data and data centers has thrown up new challenges for legacy; existing networks; and prompted the need for a more intelligent and innovative way to dynamically manage traffic and allocate limited network resources. Software Defined Network (SDN) which decouples the control plane from the data plane through network vitalizations aims to address these challenges. This paper has explored the SDN architecture and its implementation with the OpenFlow protocol. It has also assessed some of its benefits over traditional network architectures, security concerns and how it can be addressed in future research and related works in emerging economies such as Nigeria.
Measure the Similarity of Complaint Document Using Cosine Similarity Based on...Editor IJCATR
Report handling on "LAPOR!" (Laporan, Aspirasi dan Pengaduan Online Rakyat) system depending on the system administrator who manually reads every incoming report [3]. Read manually can lead to errors in handling complaints [4] if the data flow is huge and grows rapidly, it needs at least three days to prepare a confirmation and it sensitive to inconsistencies [3]. In this study, the authors propose a model that can measure the identities of the Query (Incoming) with Document (Archive). The authors employed Class-Based Indexing term weighting scheme, and Cosine Similarities to analyse document similarities. CoSimTFIDF, CoSimTFICF and CoSimTFIDFICF values used in classification as feature for K-Nearest Neighbour (K-NN) classifier. The optimum result evaluation is pre-processing employ 75% of training data ratio and 25% of test data with CoSimTFIDF feature. It deliver a high accuracy 84%. The k = 5 value obtain high accuracy 84.12%
Hangul Recognition Using Support Vector MachineEditor IJCATR
The recognition of Hangul Image is more difficult compared with that of Latin. It could be recognized from the structural arrangement. Hangul is arranged from two dimensions while Latin is only from the left to the right. The current research creates a system to convert Hangul image into Latin text in order to use it as a learning material on reading Hangul. In general, image recognition system is divided into three steps. The first step is preprocessing, which includes binarization, segmentation through connected component-labeling method, and thinning with Zhang Suen to decrease some pattern information. The second is receiving the feature from every single image, whose identification process is done through chain code method. The third is recognizing the process using Support Vector Machine (SVM) with some kernels. It works through letter image and Hangul word recognition. It consists of 34 letters, each of which has 15 different patterns. The whole patterns are 510, divided into 3 data scenarios. The highest result achieved is 94,7% using SVM kernel polynomial and radial basis function. The level of recognition result is influenced by many trained data. Whilst the recognition process of Hangul word applies to the type 2 Hangul word with 6 different patterns. The difference of these patterns appears from the change of the font type. The chosen fonts for data training are such as Batang, Dotum, Gaeul, Gulim, Malgun Gothic. Arial Unicode MS is used to test the data. The lowest accuracy is achieved through the use of SVM kernel radial basis function, which is 69%. The same result, 72 %, is given by the SVM kernel linear and polynomial.
Application of 3D Printing in EducationEditor IJCATR
This paper provides a review of literature concerning the application of 3D printing in the education system. The review identifies that 3D Printing is being applied across the Educational levels [1] as well as in Libraries, Laboratories, and Distance education systems. The review also finds that 3D Printing is being used to teach both students and trainers about 3D Printing and to develop 3D Printing skills.
Survey on Energy-Efficient Routing Algorithms for Underwater Wireless Sensor ...Editor IJCATR
In underwater environment, for retrieval of information the routing mechanism is used. In routing mechanism there are three to four types of nodes are used, one is sink node which is deployed on the water surface and can collect the information, courier/super/AUV or dolphin powerful nodes are deployed in the middle of the water for forwarding the packets, ordinary nodes are also forwarder nodes which can be deployed from bottom to surface of the water and source nodes are deployed at the seabed which can extract the valuable information from the bottom of the sea. In underwater environment the battery power of the nodes is limited and that power can be enhanced through better selection of the routing algorithm. This paper focuses the energy-efficient routing algorithms for their routing mechanisms to prolong the battery power of the nodes. This paper also focuses the performance analysis of the energy-efficient algorithms under which we can examine the better performance of the route selection mechanism which can prolong the battery power of the node
Comparative analysis on Void Node Removal Routing algorithms for Underwater W...Editor IJCATR
The designing of routing algorithms faces many challenges in underwater environment like: propagation delay, acoustic channel behaviour, limited bandwidth, high bit error rate, limited battery power, underwater pressure, node mobility, localization 3D deployment, and underwater obstacles (voids). This paper focuses the underwater voids which affects the overall performance of the entire network. The majority of the researchers have used the better approaches for removal of voids through alternate path selection mechanism but still research needs improvement. This paper also focuses the architecture and its operation through merits and demerits of the existing algorithms. This research article further focuses the analytical method of the performance analysis of existing algorithms through which we found the better approach for removal of voids
Decay Property for Solutions to Plate Type Equations with Variable CoefficientsEditor IJCATR
In this paper we consider the initial value problem for a plate type equation with variable coefficients and memory in
1 n R n ), which is of regularity-loss property. By using spectrally resolution, we study the pointwise estimates in the spectral
space of the fundamental solution to the corresponding linear problem. Appealing to this pointwise estimates, we obtain the global
existence and the decay estimates of solutions to the semilinear problem by employing the fixed point theorem
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
How to Build a Module in Odoo 17 Using the Scaffold MethodCeline George
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
How to Add Chatter in the odoo 17 ERP ModuleCeline George
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
Thinking of getting a dog? Be aware that breeds like Pit Bulls, Rottweilers, and German Shepherds can be loyal and dangerous. Proper training and socialization are crucial to preventing aggressive behaviors. Ensure safety by understanding their needs and always supervising interactions. Stay safe, and enjoy your furry friends!
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
1. International Journal of Computer Applications Technology and Research
Volume 2– Issue 3, 224 - 228, 2013
www.ijcat.com 224
Intuitionistic Fuzzy Semipre Generalized Connected
Spaces
M. Thirumalaiswamy
Department of Mathematics,
NGM College, Pollachi-642001,
Tamil Nadu, India
K. M. Arifmohammed
Department of Mathematics,
NGM College, Pollachi-642001,
Tamil Nadu, India
Abstract : In this paper, we introduce the notion of intuitionistic fuzzy semipre generalized connected space, intuitionistic
fuzzy semipre generalized super connected space and intuitionistic fuzzy semipre generalized extremally disconnected
spaces. We investigate some of their properties.
Keywords : Intuitionistic fuzzy topology, intuitionistic fuzzy semipre generalized connected space, intuitionistic fuzzy
semipre generalized super connected space and intuitionistic fuzzy semipre generalized extremally disconnected spaces
2010 Mathematical Subject Classification: 54A40, 03F55
1. INTRODUCTION
In 1965, Zadeh [11] introduced fuzzy sets and
in 1968, Chang [2] introduced fuzzy topology. After the
introduction of fuzzy set and fuzzy topology, several
authors were conducted on the generalization of this
notion. The notion of intuitionistic fuzzy sets was
introduced by Atanassov [1] as a generalization of fuzzy
sets. 1997, Coker [3] introduced the concept of
intuitionistic fuzzy topological spaces. In this paper, we
introduce the notion of intuitionistic fuzzy semipre
generalized connected space, intuitionistic fuzzy semipre
generalized super connected space and intuitionistic
fuzzy semipre generalized extremally disconnected
spaces. And study some of their properties.
2. PRELIMINARIES
Definition 2.1:[1] Let X be a non-empty fixed set. An
intuitionistic fuzzy set (IFS in short) A in X is an object
having the form A = {〈 x, µA(x), νA(x)〉 / x ∈ X} where
the functions µA: X → [0, 1] and νA : X → [0, 1]
denote the degree of membership (namely µA(x)) and the
degree of non-membership (namely νA(x)) of each
element x ∈ X to the set A respectively and 0 ≤ µA(x) +
νA(x) ≤ 1 for each x ∈ X. Denote by IFS(X), the set of
all intuitionistic fuzzy sets in X.
Definition 2.2:[1] Let A and B be IFSs of the form A =
{〈 x, µA(x), νA(x)〉 / x ∈ X} and B = {〈 x, µB(x),
νB(x)〉 / x ∈ X}. Then
1. A ⊆ B if and only if µA(x) ≤ µB(x) and νA(x)
≥ νB(x) for all x ∈ X
2. A = B if and only if A ⊆ B and B ⊆ A
3. Ac = {〈 x, νA(x), µA(x)〉 / x ∈ X }
4. A ∩ B = {〈 x, µA(x) ∧ µB(x), νA(x) ∨
νB(x)〉 / x ∈ X}
5. A ∪ B = {〈 x, µA(x) ∨ µB(x), νA(x) ∧
νB(x)〉 / x ∈ X}
For the sake of simplicity, we shall use the notation A =
〈 x, µA, νA〉 instead of A = {〈 x, µA(x), νA(x)〉 / x ∈
X}. Also for the sake of simplicity, we shall use the
notation A = 〈 x, (µA, µB), (νA, νB)〉 instead of A =
〈 x, (A/μA, B/μB), (A/νA, B/νB)〉 . The intuitionistic
fuzzy sets 0~ = {〈 x, 0, 1〉 / x ∈ X} and 1~ = {〈 x, 1,
0〉 / x ∈ X} are respectively the empty set and the whole
set of X.
Definition 2.3:[3] An intuitionistic fuzzy topology (IFT
in short) on X is a family τ of IFSs in X satisfying the
following axioms:
1. 0~, 1~ ∈ τ
2. G1 ∩ G2 ∈ τ, for every G1, G2 ∈ τ
3. ∪ Gi ∈ τ for any family {Gi / i ∈ J} ⊆ τ
In this case the pair (X, τ) is called an intuitionistic fuzzy
topological space(IFTS in short) and any IFS in τ is
known as an intuitionistic fuzzy open set(IFOS in
short)in X. The complement Ac of an IFOS A in an IFTS
(X, τ) is called an intuitionistic fuzzy closed set (IFCS in
short) in X.
Definition 2.4:[3] Let (X, τ) be an IFTS and A = 〈 x,
µA, νA〉 be an IFS in X. Then
1. int(A) = ∪{ G / G is an IFOS in X and G ⊆ A
}
2. cl(A) = ∩{ K / K is an IFCS in X and A ⊆ K }
3. cl(Ac) = (int(A))c
4. int(Ac) = (cl(A))c
Definition 2.5:[10] An IFS A of an IFTS (X, τ) is an
2. International Journal of Computer Applications Technology and Research
Volume 2– Issue 3, 224 - 228, 2013
www.ijcat.com 225
1. intuitionistic fuzzy semipre closed set (IFSPCS
for short) if there exists an IFPCS B such that int(B) ⊆ A
⊆ B
2. intuitionistic fuzzy semipre open set (IFSPOS
for short) if there exists an IFPOS B such that B ⊆ A ⊆
cl(B)
Definition 2.6:[4] Let A be an IFS in an IFTS (X, τ).
Then
1. spint (A) = ∪{ G / G is an IFSPOS in X and G
⊆ A }
2. spcl (A) = ∩{ K / K is an IFSPCS in X and A
⊆ K }
Note that for any IFS A in (X, τ), we have spcl(Ac) =
(spint(A))c and spint(Ac) = (spcl(A))c .
Definition 2.7:[7] An IFS A in an IFTS (X, τ) is said to
be an intuitionistic fuzzy semipre generalized closed set
(IFSPGCS for short) if spcl(A) ⊆ U whenever A ⊆ U
and U is an IFSOS in (X, τ).
The family of all IFSPGCSs of an IFTS (X, τ) is denoted
by IFSPGC(X). Every IFCS and IFSPCS is an IFSPGCS
but the converses are not true in general.
Definition 2.8:[5] The complement Ac of an IFSPGCS
A in an IFTS (X, τ) is called an intuitionistic fuzzy
semipre generalized open set (IFSPGOS for short) in X.
The family of all IFSPGOSs of an IFTS (X, τ) is denoted
by IFSPGO(X). Every IFOS and IFSPOS is an IFSPGOS
but the converses are not true in general.
Definition 2.9:[9] Let A be an IFS in an IFTS (X, τ).
Then semipre generalized interior of A (spgint(A) for
short) and semipre generalized closure of A (spgcl(A) for
short) are defined by
1. spgint (A) = ∪{ G / G is an IFSPGOS in X and
G ⊆ A }
2. spgcl (A) = ∩{ K / K is an IFSPGCS in X and
A ⊆ K }
Note that for any IFS A in (X, τ), we have spgcl(Ac) =
(spgint(A))c and spgint(Ac) = (spgcl(A))c.
Definition 2.10:[5] An IFTS(X, τ) is said to be an
intuitionistic fuzzy semipre T*1/2 space (IFSPT*1/2
space for short) if every IFSPGCS is an IFCS in (X, τ).
Definition 2.11:[8] A mapping f : (X, τ) → (Y, σ) is
called an intuitionistic fuzzy semipre generalized
continuous (IFSPG continuous for short) mappings if f -
1(V) is an IFSPGCS in (X, τ) for every IFCS V of (Y, σ).
Definition 2.12:[8] A mapping f: (X, τ) → (Y, σ) be an
intuitionistic fuzzy semipre generalized irresolute
(IFSPG irresolute) mapping if f -1(V) is an IFSPGCS in
(X, τ) for every IFSPGCS V of (Y, σ).
Definition 2.13:[4] Two IFSs A and B are said to be q-
coincident (A q B in short) if and only if there exists an
element x ∈ X such that µA(x) > νB(x) or νA(x) <
µB(x).
Definition 2.14:[4] Two IFSs A and B are said to be not
q-coincident (A qc B in short) if and only if A ⊆ Bc.
Definition 2.15:[6] An IFTS (X, τ ) is said to be an
intuitionistic fuzzy C5-connected (IFC5-connected for
short) space if the only IFSs which are both intuitionistic
fuzzy open and intuitionistic fuzzy closed are 0∼ and
1∼.
3. INTUITIONISTIC FUZZY
SEMIPRE GENERALIZED
CONNECTED SPACES
Definition 3.1: An IFTS (X, τ) is said to be an
intuitionistic fuzzy semipre generalized connected space
(IFSPG connected space for short) if the only IFSs which
are both an IFSPGOS and an IFSPGCS are 0~ and 1~.
Theorem 3.2: Every IFSPG connected space is IFC5-
connected but not conversely.
Proof: Let (X, τ) be an IFSPG connected space. Suppose
(X, τ) is not IFC5-connected, then there exists a proper
IFS A which is both an IFOS and an IFCS in (X, τ). That
is, A is both an IFSPGOS and an IFSPGCS in (X, τ).
This implies that (X, τ) is not IFSPG connected. This is a
contradiction. Therefore (X, τ) must be an IFC5-
connected space.
Example 3.3: Let X = {a, b} and G = 〈 x, (0.5, 0.6),
(0.5, 0.4)〉 . Then τ = {0~, G, 1~} is an IFT on X. Then
X is an IFC5-connected space but not IFSPG connected,
since the IFS A = 〈 x, (0.5, 0.7), (0.5, 0.3)〉 in X is both
an IFSPGCS and an IFSPGOS in X.
Theorem 3.4: An IFTS (X, τ) is an IFSPG connected
space if and only if there exists no non-zero IFSPGOSs
A and B in (X, τ) such that B = Ac, B = (spcl(A))c, A =
(spcl(B))c.
Proof: Necessity: Assume that there exist IFSs A and B
such that A ≠ 0~ ≠ B, B = Ac, B = (spcl(A))c, A =
(spcl(B))c. Since (spcl(A))c and (spcl(B))c are
IFSPGOSs in (X, τ), A and B are IFSPGOSs in (X, τ).
This implies (X, τ) is not IFSPG connected, which is a
contradiction. Therefore there exists no non-zero
IFSPGOSs A and B in (X, τ) such that B = Ac, B =
(spcl(A))c, A = (spcl(B))c.
Sufficiency: Let A be both an IFSPGOS and an
IFSPGCS in (X, τ) such that 1~ ≠ A ≠ 0~. Now by taking
B = Ac, we obtain a contradiction to our hypothesis.
Hence (X, τ) is an IFSPG connected space.
Theorem 3.5: Let (X, τ) be an IFSPT*1/2 space, then the
following statements are equivalent:
(i) (X, τ) is an IFSPG connected space,
3. International Journal of Computer Applications Technology and Research
Volume 2– Issue 3, 224 - 228, 2013
www.ijcat.com 226
(ii) (X, τ) is an IFC5-connected space.
Proof: (i) ⇒ (ii) is obvious by Theorem 3.2.
(ii) ⇒ (i) Let (X, τ) be an IFC5-connected space. Suppose
(X, τ) is not IFSPG connected, then there exists a proper
IFS A in (X, τ) which is both an IFSPGOS and an
IFSPGCS in (X, τ). But since (X, τ) is an IFSPT*1/2
space, A is both an IFOS and an IFCS in (X, τ). This
implies that (X, τ) is not IFC5-connected, which is a
contradiction to our hypothesis. Therefore (X, τ) must be
an IFSPG connected space.
Theorem 3.6: If f : (X, τ) → (Y, σ) is an IFSPG
continuous surjection and (X, τ) is an IFSPG connected
space, then (Y, σ) is an IFC5-connected space.
Proof: Let (X, τ) be an IFSPG connected space. Suppose
(Y, σ) is not IFC5-connected, then there exists a proper
IFS A which is both an IFOS and an IFCS in (Y, σ).
Since f is an IFSPG continuous mapping, f -1(A) is both
an IFSPGOS and an IFSPGCS in (X, τ). But this is a
contradiction to our hypothesis. Hence (Y, σ) must be an
IFC5- connected space.
Theorem 3.7: If f : (X, τ) → (Y, σ) is an IFSPG
irresolute surjection and (X, τ) is an IFSPG connected
space, then (Y, σ) is also an IFSPG connected space.
Proof: Suppose (Y, σ) is not an IFSPG connected space,
then there exists a proper IFS A such that A is both an
IFSPGOS and an IFSPGCS in (Y, σ). Since f is an
IFSPG irresolute surjection, f -1(A) is both an IFSPGOS
and an IFSPGCS in (X, τ). But this is a contradiction to
our hypothesis. Hence (Y, σ) must be an IFSPG
connected space.
Definition 3.8: An IFTS (X, τ) is IFSPG connected
between two IFSs A and B if there is no IFSPGOS E in
(X, τ) such that A ⊆ E and E qc B.
Example 3.9: Let X = {a, b} and G = 〈 x, (0.5, 0.4),
(0.5, 0.6)〉 . Then τ = {0~, G, 1~} is an IFT on X. Let A
= 〈 x, (0.5, 0.4), (0.5, 0.3)〉 and B = 〈 x, (0.5, 0.4), (0.5,
0.5)〉 be two IFSs in X. Hence (X, τ) is IFSPG
connected between the IFSs A and B.
Theorem 3.10: If an IFTS (X, τ) is IFSPG connected
between two IFSs A and B, then it is IFC5-connected
between A and B but the converse may not be true in
general.
Proof: Suppose (X, τ) is not IFC5-connected between A
and B, then there exists an IFOS E in (X, τ) such that A
⊆ E and E qc B. Since every IFOS is an IFSPGOS, there
exists an IFSPGOS E in (X, τ) such that A ⊆ E and E qc
B. This implies (X, τ) is not IFSPG connected between A
and B, a contradiction to our hypothesis. Therefore (X,
τ) must be IFC5-connected between A and B.
Example 3.11: Let X = {a, b} and G = 〈 x, (0.5, 0.4),
(0.5, 0.6)〉 . Then τ = {0~, G, 1~} is an IFT on X. Let A
= 〈 x, (0.4, 0.4), (0.6, 0.6)〉 and B = 〈 x, (0.3, 0.3), (0.4,
0.4)〉 be two IFSs in X. Then X is IFC5-connected
between A and B, since there exists no IFOS E in X such
that A ⊆ E and E q B. But it is not IFSPG connected
between the two IFS A and B, since there exists an
IFSPGOS E = 〈 x, (0.4, 0.4), (0.5, 0.5) 〉 in X such that
A ⊆ E and E q B.
Theorem 3.12: If an IFTS (X, τ) is IFSPG connected
between A and B and A ⊆ A1, B ⊆ B1, then (X, τ) is
IFSPG connected between A1 and B1.
Proof: Suppose that (X, τ) is not IFSPG connected
between A1 and B1, then by Definition 3.8, there exists
an IFSPGOS E in (X, τ) such that A1 ⊆ E and E qc B1.
This implies E ⊆ B1c. A1 ⊆ E implies A ⊆ A1 ⊆ E.
That is A ⊆ E. Now let us prove that E ⊆ Bc, that is E qc
B. Suppose that E q B, then by Definition 2.13, there
exists an element x in X such that µE(x) > νB(x) and
νE(x) < µB(x). Therefore µE(x) > νB(x) > νB1(x) and
νE(x) < µB(x) < µB1(x), since B ⊆ B1. Hence µE(x) >
µB1(x) and νE(x) < νB1(x). Thus E q B1. That is E q
B1, which is a contradiction. Therefore E qc B. That is
E ⊆ Bc. Hence (X, τ) is not IFSPG connected between A
and B, which is a contradiction to our hypothesis. Thus
(X, τ) must be IFSPG connected between A1 and B1.
Theorem 3.13: Let (X, τ) be an IFTS and A and B be
IFSs in (X, τ). If A q B, then (X, τ) is IFSPG connected
between A and B.
Proof: Suppose (X, τ) is not IFSPG connected between
A and B. Then there exists an IFSPGOS E in (X, τ) such
that A ⊆ E and E ⊆ Bc. This implies that A ⊆ Bc. That
is A qc B. But this is a contradiction to our hypothesis.
Therefore (X, τ) is must be IFSPG connected between A
and B.
Definition 3.14: An IFSPGOS A is an intuitionistic
fuzzy regular semipre generalized open set (IFRSPGOS
for short) if A = spgint(spgcl(A)). The complement of an
IFRSPGOS is called an intuitionistic fuzzy regular
semipre generalized closed set (IFRSPGCS for short).
Definition 3.15: An IFTS (X, τ) is called an intuitionistic
fuzzy semipre generalized (IFSPG for short) super
connected space if there exists no proper IFRSPGOS in
(X, τ).
Theorem 3.16: Let (X, τ) be an IFTS. Then the
following statements are equivalent:
(i) (X, τ) is an IFSPG super connected space
(ii) For every non-zero IFSPGOS A, spgcl(A) = 1~
(iii) For every IFSPGCS A with A ≠ 1~, spgint(A) =
0~
(iv) There exists no IFSPGOSs A and B in (X, τ)
such that A ≠ 0~ ≠ B, A ⊆ Bc
(v) There exists no IFSPGOSs A and B in (X, τ)
such that A ≠ 0~ ≠ B, B = (spgcl(A))c, A = (spgcl(B))c
(vi) There exists no IFSPGCSs A and B in (X, τ)
such that A ≠ 0~ ≠ B, B = (spgint(A))c, A =
(spgint(B))c
4. International Journal of Computer Applications Technology and Research
Volume 2– Issue 3, 224 - 228, 2013
www.ijcat.com 227
Proof: (i) ⇒ (ii) Assume that there exists an IFSPGOS A
in (X, τ) such that A ≠ 0~ and spgcl(A) ≠ 1~. Now let B
= spgint(spgcl(A))c. Then B is a proper IFRSPGOS in
(X, τ), which is conradiction. Therefore spgcl(A) = 1~.
(ii) ⇒ (iii) Let A ≠ 1~ be an IFSPGCS in (X, τ). If B =
Ac, then B is an IFSPGOS in (X, τ) with B ≠ 0~. Hence
spgcl(B) = 1~. This implies (spgcl(B))c = 0~. That is
spgint(Bc) = 0~. Hence spgint(A) = 0~.
(iii) ⇒ (iv) Suppose A and B be two IFSPGOSs in (X, τ)
such that A ≠ 0~ ≠ B and A ⊆ Bc. Then Bc is an
IFSPGCS in (X, τ) and B ≠ 0~ implies Bc ≠ 1~. By
hypothesis spgint(Bc) = 0~. But A ⊆ Bc. Therefore 0~
≠ A = spgint(A) ⊆ spgint(Bc) = 0~, which is a
contradiction. Therefore (iv) is true.
(iv) ⇒ (i) Suppose 0~ ≠ A ≠ 1~ be an IFRSPGOS in (X,
τ). If we take B = (spgcl(A))c, we get B ≠ 0~, since if B
= 0~ then this implies (spgcl(A))c = 0~. That is spgcl(A)
= 1~. Hence A = spgint(spgcl(A)) = spgint(1~) = 1~,
which is a contradiction. Therefore B ≠ 0~ and A ⊆ Bc.
But this is a contradiction to (iv). Therefore (X, τ) must
be an IFSPG super connected space.
(i) ⇒ (v) Suppose A and B be two IFSPGOSs in (X, τ)
such that A ≠ 0~ ≠ B and B = (spgcl(A))c, A =
(spgcl(B))c. Now we have spgint(spgcl(A)) = spgint(Bc)
= (spgcl(B))c = A, A ≠ 0~ and A ≠ 1~, since if A = 1~,
then 1~ = (spgcl(B))c ⇒ spgcl(B) = 0~ ⇒ B = 0~.
Therefore A ≠ 1~. That is, A is a proper IFRSPGOS in
(X, τ), which is a contradiction to (i). Hence (v) is
true.
(v) ⇒ (i) Let A be an IFSPGOS in (X, τ) such that A =
spgint(spgcl(A)), 0~ ≠ A ≠ 1~. Now take B =
(spgcl(A))c. In this case we get, B ≠ 0~ and B is an
IFSPGOS in (X, τ). Now B = (spgcl(A))c and
(spgcl(B))c = (spgcl(spgcl(A))c)c = spgint(spgcl(A)) =
A. But this is a contradiction to (v). Therefore (X, τ)
must be an IFSPG super connected space.
(v) ⇒ (vi) Suppose A and B be two IFSPGCS in (X, τ)
such that A ≠ 1~ ≠ B, B = (spgint(A))c, A = (spgint(B))c.
Taking C = Ac and D = Bc, C and D become IFSPGOSs
in (X, τ) with C ≠ 0~ ≠D and D = (spgcl(C))c, C =
(spgcl(D))c, which is a contradiction to (v). Hence (vi) is
true.
(vi) ⇒ (v) can be proved easily by the similar way as in
(v) ⇒ (vi).
Definition 3.17: An IFTS (X, τ) is said to be an
intuitionistic fuzzy semipre generalized (IFSPG for short
) extremally disconnected if the semipre generalized
closure of every IFSPGOS in (X, τ) is an IFSPGOS in
(X, τ).
Theorem 3.18: Let (X, τ) be an IFTS space. Then the
following statements are equivalent:
(vi) ⇒ (v) can be proved easily by the similar way as in
(v) ⇒ (vi).
Definition 3.17: An IFTS (X, τ) is said to be an
intuitionistic fuzzy semipre generalized (IFSPG for short
) extremally disconnected if the semipre generalized
closure of every IFSPGOS in (X, τ) is an IFSPGOS in
(X, τ).
Theorem 3.18: Let (X, τ) be an IFTS space. Then the
following statements are equivalent:
(i) (X, τ) is an IFSPG extremally disconnected
(ii) For each IFSPGCS A, spgint(A) is an IFSPGCS
(iii) For each IFSPGOS A, spgcl(A) =
(spgcl(spgcl(A))c)c
(iv) For each pair of IFSPGOSs A and B with
spgcl(A) = Bc implies that spgcl(A) = (spgcl(B))c
Proof : (i) ⇒ (ii) Let A be any IFSPGOS. Then Ac is an
IFSPGOS. So (i) implies that spgcl(Ac) = (spgint(A))c is
an IFSPGOS. Thus spgint(A) is an IFSPGCS in (X, τ).
(ii) ⇒ (iii) Let A be an IFSPGOS. We have
(spgcl(spgcl(A))c)c = (spgcl(spgint(Ac)))c. Since A is an
IFSPGOS, Ac is IFSPGCS. So by (ii) spgint(Ac) is an
IFSPGCS. That is spgcl(spgint(Ac)) = spgint(Ac).
Hence (spgcl(spgint(Ac)))c = (spgint(Ac))c = spgcl(A).
(iii) ⇒ (iv) Let A and B be any two IFSPGOSs in (X, τ)
such that spgcl(A) = Bc. (iii) implies that spgcl(A) =
(spgcl(spgcl(A))c)c =( spgcl(Bc)c)c = (spgcl(B))c.
(iv) ⇒ (i) Let A be any IFSPGOS in (X, τ). Put B =
(spgcl(A))c, then B is an IFSPGOS and spgcl(A) = Bc.
Hence by (iv) , spgcl(A) = (spgcl(B))c. Since spgcl(B) is
an IFSPGCS, it follows that spgcl(A) is an IFSPGOS.
This implies that (X, τ) is an IFSPG extremally
disconnected space.
4. REFERENCES
[1] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy
Sets and Systems, 20, 1986, 87-96.
[2] C. L. Chang, Fuzzy topological spaces,
J.Math.Anal.Appl. 24, 1968, 182-190.
[3] D. Coker, An introduction to intuitionistic
fuzzy topological space, Fuzzy Sets and Systems, 88,
1997, 81-89.
[4] H. Gurcay, Es. A. Haydar and D. Coker, On
fuzzy continuity in intuitionistic fuzzy topological
spaces, The J.Fuzzy Math.5 (2) , 1997, 365-378.
[5] M. Thirumalaiswamy and K. M.
Arifmohammed, Semipre Generalized Open Sets and
Applications of Semipre Generalized Closed Sets in
Intuitionistic Fuzzy Topological Spaces (submitted).
[6] N. Turnali and D. Coker, Fuzzy connectedness
in intuitionistic fuzzy topological spaces, FuzzySets and
Systems 116 (2000) 369–375.
5. International Journal of Computer Applications Technology and Research
Volume 2– Issue 3, 224 - 228, 2013
www.ijcat.com 228
[7] M. Thirumalaiswamy and K. Ramesh,
Intuitionistic fuzzy semi-pre generalized closed sets
(submitted).
[8] M. Thirumalaiswamy and K. Ramesh,
Semipre Generalized Continuous and Irresolute
Mappings in Intuitionistic Fuzzy Topological Space
(submitted).
[9] M. Thirumalaiswamy and K. Ramesh,
Semipre Generalized Homeomorphisms in Intuitionistic
Fuzzy Topological Spaces
[10] Young Bae Jun and Seok- Zun Song,
Intuitionistic fuzzy semi-pre open sets and Intuitionistic
fuzzy semi-pre continuous mappings, Jour. of Appl.
Math & computing, 2005, 467-474.
[11] L. A. Zadeh, Fuzzy sets, Information and
control, 8, 1965, 338-353.