This document summarizes research on fuzzy-closed sets and fuzzy separation axioms in fuzzy topological spaces. Some key points:
- It introduces the concept of fuzzy α-closed sets and studies their basic properties.
- It discusses properties of fuzzy separation axioms like fuzzy αT-spaces and fuzzy αT1-spaces, where α is a natural number from 0 to 3 or 0 to 4.
- Theorems are provided about fuzzy α-closed sets and their relationships to other concepts like fuzzy α-neighborhoods and fuzzy α-interiors/closures.
- Properties of fuzzy topological spaces satisfying different fuzzy separation axioms are characterized, such as characterizing when a space
1) The document contains exercises from an introduction to real analysis course on the supremum property. It includes solutions to problems involving finding the supremum and infimum of sets, and proving properties about the supremum and infimum.
2) For problem 4, it is proven that if S is a nonempty bounded set, then the infimum of S is less than or equal to all elements of S, and the supremum of S is greater than or equal to all elements of S.
3) For problem 6, it is shown that if A and B are bounded nonempty subsets, then the supremum of A union B is the maximum of the supremums of A and B, and the inf
1) The document contains exercises on the completeness property of real numbers from an introduction to real analysis course.
2) It includes problems, solutions, and proofs regarding the infimum and supremum of sets, bounded sets, and the completeness property.
3) Key results proven include if A and B are bounded subsets of the real numbers, then their union A ∪ B is bounded, and if S is a bounded set and S0 is a nonempty subset of S, then the infimum of S0 is greater than or equal to the infimum of S.
This document summarizes a research paper that introduces new concepts related to characterizing kernel sets in fuzzy topological spaces. Specifically, it defines kernelled fuzzy points, boundary kernelled fuzzy points, and derived kernelled fuzzy points of a subset. Using these notions, the paper presents a new definition of the kernel set of a fuzzy topological space as the union of the set itself and the set of all boundary kernelled fuzzy points. It also introduces the concept of a fuzzy topological kr-space and uses these concepts to characterize weak separation axioms between TF0 and TF1 spaces.
This document provides an overview of strings and string processing in C#. It discusses the String class and how strings are implemented as objects in C#. Key methods of the String class like Length, IndexOf, Substring, Split, and Join are described. Algorithms for splitting a string into words and joining an array into a string are presented. Methods for comparing strings like Equals and CompareTo are also covered.
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
IRJET- Soft Pre Generalized B- Closed Sets in a Soft Topological SpaceIRJET Journal
This document introduces the concept of soft pre generalized b-closed sets in a soft topological space. Some key points:
- A soft set FA is soft pre generalized b-closed if bcl(FA) contains FA whenever FA is contained in a soft P-open set F0.
- Every soft closed, soft b-closed, soft generalized closed, and soft pg-closed set is also soft pgb-closed. However, the converses are not always true.
- Properties of soft pgb-closed sets are studied, including that the intersection of two soft pgb-closed sets is soft pgb-closed, and if a set is contained in the soft pgb-closure of
Suffix trees and suffix arrays are data structures used to solve problems related to string matching and text indexing in an efficient manner. Suffix trees allow finding patterns in text in O(m) time where m is the pattern length, by traversing the tree. Suffix arrays store suffixes in sorted order and allow pattern searching in O(m+logn) time where n is text length. Both structures take O(n) time and space to construct where n is text length. They find applications in bioinformatics, data compression, and other string algorithms.
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
1) The document contains exercises from an introduction to real analysis course on the supremum property. It includes solutions to problems involving finding the supremum and infimum of sets, and proving properties about the supremum and infimum.
2) For problem 4, it is proven that if S is a nonempty bounded set, then the infimum of S is less than or equal to all elements of S, and the supremum of S is greater than or equal to all elements of S.
3) For problem 6, it is shown that if A and B are bounded nonempty subsets, then the supremum of A union B is the maximum of the supremums of A and B, and the inf
1) The document contains exercises on the completeness property of real numbers from an introduction to real analysis course.
2) It includes problems, solutions, and proofs regarding the infimum and supremum of sets, bounded sets, and the completeness property.
3) Key results proven include if A and B are bounded subsets of the real numbers, then their union A ∪ B is bounded, and if S is a bounded set and S0 is a nonempty subset of S, then the infimum of S0 is greater than or equal to the infimum of S.
This document summarizes a research paper that introduces new concepts related to characterizing kernel sets in fuzzy topological spaces. Specifically, it defines kernelled fuzzy points, boundary kernelled fuzzy points, and derived kernelled fuzzy points of a subset. Using these notions, the paper presents a new definition of the kernel set of a fuzzy topological space as the union of the set itself and the set of all boundary kernelled fuzzy points. It also introduces the concept of a fuzzy topological kr-space and uses these concepts to characterize weak separation axioms between TF0 and TF1 spaces.
This document provides an overview of strings and string processing in C#. It discusses the String class and how strings are implemented as objects in C#. Key methods of the String class like Length, IndexOf, Substring, Split, and Join are described. Algorithms for splitting a string into words and joining an array into a string are presented. Methods for comparing strings like Equals and CompareTo are also covered.
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
IRJET- Soft Pre Generalized B- Closed Sets in a Soft Topological SpaceIRJET Journal
This document introduces the concept of soft pre generalized b-closed sets in a soft topological space. Some key points:
- A soft set FA is soft pre generalized b-closed if bcl(FA) contains FA whenever FA is contained in a soft P-open set F0.
- Every soft closed, soft b-closed, soft generalized closed, and soft pg-closed set is also soft pgb-closed. However, the converses are not always true.
- Properties of soft pgb-closed sets are studied, including that the intersection of two soft pgb-closed sets is soft pgb-closed, and if a set is contained in the soft pgb-closure of
Suffix trees and suffix arrays are data structures used to solve problems related to string matching and text indexing in an efficient manner. Suffix trees allow finding patterns in text in O(m) time where m is the pattern length, by traversing the tree. Suffix arrays store suffixes in sorted order and allow pattern searching in O(m+logn) time where n is text length. Both structures take O(n) time and space to construct where n is text length. They find applications in bioinformatics, data compression, and other string algorithms.
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
The document discusses different types of tries data structures and their applications. It describes standard tries, compressed tries, and suffix tries. Standard tries support operations like finding, inserting, and removing strings in time proportional to the string length and alphabet size. Compressed tries reduce space by compressing chains of redundant nodes. Suffix tries store all suffixes of a text in linear space and support fast pattern matching queries in time proportional to the pattern length plus the number of matches. The document provides examples of using tries for text processing, web search indexing, internet routing, and other applications.
This document is an introduction to topological vector spaces written by Oliver Taylor for his MA-M00 project at Swansea University. It begins with brief histories of functional analysis and topological vector spaces. Fundamental concepts from vector spaces, convexity, and topology are then introduced. These include definitions of vector spaces, convex sets, open sets, neighborhoods, and topological spaces. The interactions between topology, convexity, and vector space structures are discussed. Finally, topological vector spaces are defined as vector spaces endowed with a topology compatible with the algebraic operations. Examples and applications are discussed in the last section.
In 2001 and 2003, Nakaok and Oda [3] and [4] introduced the notation of maximal open sets and minimal open sets in topological spaces. In 2010, Miguel, Saeid and Seithuti [2], introduced the notation of maximal θ-open sets and minimal θ -closed sets in topological spaces. In this paper, we introduce new classes of sets called maximal α-open sets and minimal α -open sets and investigate some of their fundamental properties.
This document presents a new method for finding the fuzzy critical path in a project network using type-2 discrete fuzzy numbers and type reduction. The key steps are:
1. Represent the time span of each activity as a type-2 discrete fuzzy number.
2. Use type reduction and the center of gravity to calculate the earliest start time, latest finish time, and total slack fuzzy time for each activity.
3. Identify the fuzzy critical path as the path(s) with a total slack time of 0 based on the center of gravity calculations.
An example application of the method on a sample network is provided to demonstrate the approach. The proposed method allows identification of the fuzzy critical path when activity
Recursion is a programming technique that involves a function calling itself. It consists of a recursive case where the function calls itself and a base case that stops the recursion. Without a base case, recursion will run infinitely. Examples of using recursion include calculating factorials and Fibonacci sequences by defining the problem in terms of smaller instances of the same problem. Recursion can reduce time complexity but uses more memory than iteration due to the function calls being stored on the stack.
This document discusses recursion in computer programming. It defines recursion as a technique that involves a procedure or function calling itself, either directly or indirectly. It notes that recursion requires a recursive case, where the code calls itself, and a base case, which stops recursion from continuing indefinitely. The document provides examples of using recursion to calculate factorials and the Fibonacci sequence in Python code. It also compares recursion to iteration, noting advantages like reducing time complexity, but disadvantages like using more memory.
TOP as a Grammatical Category The Case in Ngas and HausaLengji Danjuma
Since his work on Metta in 1987, Teke has adduced that African languages are better analyzed using TOP, a position which serves as the landing site for move-. Languages such as Yoruba, Tiv, and Bafut have been investigated along this line (Atanga, 1996) (Teke G. T., 1995) (1996). (Danjuma, 1996; 2003) and (Teke & Danjuma, 2004) have also dealt with some of the aspects of this analysis in Ngas. However, this paper seeks to focus on the movement of nouns and verbs into TOP in both Ngas and Hausa which are both Chadic languages in order to draw the basic similarities and differences as regards this analysis of move- into TOP.
ABSTRACT : In this paper we have studied the behavior of the different limits in some of the dual spaces of function spaces. A good number of results have been established. We have also observed that in few cases we have to take the of a set suitable conditions. We also used the notion of a perfect function space in establishing a few results .As a matter of facts the notions of which are used in this paper are parametric convergent ,parametric limit, projective convergent , projective limit, dual space of a function space and perfect function space in addition of the suitably defined and constructed some of the function spaces.
Linear algebra is the study of linear sets of equations and their transformation properties. It allows the analysis of rotations in space, least squares fittings, solutions to coupled differential equations, and more. Linear algebra is used in various fields including chemistry, coding theory, cryptography, economics, genetics, geometry, and engineering. Some examples of its applications are balancing chemical equations, coding and decoding messages, analyzing coupled oscillations, and encryption/decryption techniques using matrices.
Abstract: The project involves creation of 1. Website which will help an NGO named Juvenile Diabetic Parent Association of India (JDPAI) to reach out to the larger audiences and help them out in managing their diabetes and 2. As an Android powered Mobile device is the gadget found commonly in the common man we will develop an Android app which will help in managing diabetes by helping in counting the daily calorie intake, giving suggestions on different situations faced by the diabetics in their daily lives etc. The website has all the information about JDPAI and its work throughout the years. The android app will have all the information about the organization as well as extra features like calorie counting, sugar level manager, etc. This app will help the diabetics (Majorly type 1) manage their lives without any stress. The entire result given on each query fired by the user would be stored on the database of the app.
Folder Security Using Graphical Password Authentication Schemepaperpublications3
Abstract: Now a day most of the user are facing problem for providing the security to the folder, so that it will not be accesses by the unauthorized user. Taking in action all these problems I have designed a model which will provide a best security to your folders using graphical password authentication model. Graphical passwords are an alternative to alphanumeric passwords in which users click on images to authenticate themselves rather than type alphanumeric strings. We have developed one such system, called Pass Points, and evaluated it with human users. Beginning around 1999, a multitude of graphical based password scheme which have been proposed as alternative to text based password scheme, motivated by the promise of improved password memorability and thus usability. This paper presents a detailed evaluation of the Pass Points and pattern matching password scheme which provides high level of security and provides security to your folder.
Supervised Multi Attribute Gene Manipulation For Cancerpaperpublications3
Abstract: Data mining, the extraction of hidden predictive information from large databases, is a powerful new technology with great potential to help companies focus on the most important information in their data warehouses. Data mining tools predict future trends and behaviours, allowing businesses to make proactive, knowledge-driven decisions. The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by retrospective tools typical of decision support systems.
They scour databases for hidden patterns, finding predictive information that experts may miss because it lies outside their expectations. Data mining techniques are the result of a long process of research and product development. This evolution began when business data was first stored on computers, continued with improvements in data access, and more recently, generated technologies that allow users to navigate through their data in real time. Data mining takes this evolutionary process beyond retrospective data access and navigation to prospective and proactive information delivery.
Analysis of Fungus in Plant Using Image Processing Techniquespaperpublications3
Abstract: The present work proposes a methodology for analysis of fungus in plant, using image processing techniques. The fungus kills the young seedling; it spread by air and can also infect plant. Therefore it is very important to monitor the leaf at regular intervals so as to keep track on quality of growth of plant. For analysis of fungus is focused on technique using MATLAB 7.0. The image are captured by digital camera mobile and processed using image growing, then the part of the leaf spot has been used for the classification purpose of the trait and test. The acquired image are in jpeg format and are converted to gray scale image. The gray scale images are enhanced and make noise free. The Ostu algorithm is applied to get threshold image. The pixel neighborhood is applied to enhance the pixel of leaf to show clearly the fungus area. Clustering is applied to get infected part of the leaf. RGB image is then segmented for analysis of fungus in plant. Comparative analyses of Image Edge Detection techniques are presented. It has been observed that the Canny Edge Detection algorithm is computationally more expensive compared to Sobel Edge Detection technique. The fungus infected area is 24.5951%.
Privacy Preserving Data Leak Detection for Sensitive Datapaperpublications3
Abstract: Number of data leaks in the organization, research institutions and security firms have grown rapidly in recent years. The data leakage occurs if there is no proper protection. The common approach is to monitor the data that are stored in the organization local network. The existing method require the plaintext sensitive data. However, this requirement is undesirable, as it may threaten the confidentiality of the sensitive information. A privacy preserving data-leak detection solution is proposed which can be outsourced and be deployed in a semi-honest detection environment. Fuzzy fingerprint technique is designed and implemented that enhances data privacy during data-leak detection operations. The DLD provider computes fingerprints from network traffic and identifies potential leaks in them. To prevent the DLD provider from gathering exact knowledge about the sensitive data, the collection of potential leaks is composed of real leaks and noises. The evaluation results show that this method can provide accurate detection.
Abstract: The main communication methods used by deaf people are sign language, but opposed to common thought, there is no specific universal sign language: every country or even regional group uses its own set of signs. The use of sign language in digital systems can enhance communication in both directions: animated avatars can synthesize signals based on voice or text recognition; and sign language can be translated into various text or sound forms based on different images, videos and sensors input. The ultimate goal of this research, but it is not a simple spelling of spoken language, so that recognizing different signs or letters of the alphabet (which has been a common approach) is not sufficient for its transcription and automatic interpretation. Here proposes an algorithm and method for an application this would help us in recognising the various user defined signs. The palm images of right and left hand are loaded at runtime. Firstly these images will be seized and stored in directory. Then technique called Template matching is used for finding areas of an image that match (are similar) to a template image (patch). Our goal is to detect the highest matching area. We need two primary components- A) Source image (I): In the template image in which we try to find a match. B) Template image (T): The patch image which will be compared to the template image. In proposed system user defined patterns will be having 60% accuracy while default patterns will be provided with 80% accuracy.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
Abstract: In today’s commercial, industrial and domestic world, Automation plays an important role, it is actually an arrangement of different elements in order to regulate, direct, sense and command itself to achieve a desired result. “Automatic Fire Fighting Robot” project employs the electrical thermostat technology for the controlling the fire 24 hrs. The system is cost effective, has a wide applications which when implement can show good and effective result. It can be use deliberately in industrial applications, commercial and in domestic sectors where the requirement of automatic work demands. Synchronization of various equipment involve in the system i.e Thermostat Sensor, water jet, wireless remote and wireless android device WiFi enabled Camera. This is mean to simulate the real world operation of Robot performing a fire extinguishing function. Fuzzy logic provided an appropriate solution to the otherwise complex task of mathematically deriving an exact model for the non-linear control system upon which conventional control techniques could then be applied. Making Robot wireless increases the effective area of operation, thereby making it possible to control the robot from remote location. Keeping all above factors in mind the Robot is capable of being remotely controlled and live video buffering i.e possessing a multimedia interface was convinced and developed.
Abstract: Password authentication is one of the simplest and the most convenient authentication mechanisms to deal with secret data over insecure networks. Every user now holds email account for different web sites or holds a username password for their office work in their computer system. In this paper, we shall present the result of our survey through basic currently available password-authentication-related schemes. We know that Apart from getting the password hacked by some intruder, a serious threats comes from the surrounding environment, specially the colleagues, friends or visitors nearby the system. Most of them have a tendency of observing keenly while you cast your password. Here we propose a simple way to provide a new way of password through clicks that would provide a secure mechanism from both the intruders and the people nearby while you type your password in the application.
1) The document discusses properties of abelian categories, including that kernels and cokernels are unique up to isomorphism.
2) It proves that in an abelian category, a morphism is a monomorphism if and only if its kernel is the zero object, and it is an epimorphism if and only if its cokernel is the zero object.
3) It also proves that in an abelian category, every bimorphism is an isomorphism, and that every monomorphism is the kernel of some morphism.
Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...paperpublications3
1. The document discusses using bandwidth aggregation to improve video streaming quality over multiple wireless access networks. It formulates the multi-link video streaming process as a reinforcement learning task using a Markov Decision Process to determine optimal actions.
2. It proposes a quality-adaptive streaming approach that uses an adaptive search algorithm to obtain sub-optimal solutions in real time. The approach aims to achieve smooth, high quality video streaming while avoiding interruptions.
3. The approach considers metrics like startup latency, playback fluency, average playback quality, playback smoothness, and wireless service cost in its reward function to balance video quality of service with cost. It was evaluated using a realistic testbed with an Android phone.
Abstract: File replication is an effective way to enhance file availability and reduce file querying delay. It creates replicas for a file to improve its probability of being encountered by requests. Here, we introduce a new concept of resource for file replication, which considers both node storage and node meeting ability. We theoretically study the influence of resource allocation on the average querying delay and derive an optimal file replication rule (OFRR) that allocates resources to each file based on its popularity and size. We then propose a file replication protocol based on the rule, which approximates the minimum global querying delay in a fully distributed manner.
Efficient and Optimal Routing Scheme for Wireless Sensor Networkspaperpublications3
Abstract: The Wireless Sensor Networks (WSNs) have emerged as a new category of networking systems with limited computing, communication, and storage resources. In many sensing applications source nodes deliver packets to sink nodes via multiple hops, leading to the problem on how to find routes that enable all packets to be delivered in required time frames, while simultaneously taking into account factors such as energy efficiency and load balancing. To solve this problem one data collection protocol is developed called EDAL, which stands for Energy-efficient Delay-aware Lifetime-balancing data collection. Methods used are centralized heuristic and ant colony gossiping to find best energy efficient path. Then integrate EDAL with compressive sensing to reduce the amount of traffic generated and to reduce delay in the network.
The document discusses different types of tries data structures and their applications. It describes standard tries, compressed tries, and suffix tries. Standard tries support operations like finding, inserting, and removing strings in time proportional to the string length and alphabet size. Compressed tries reduce space by compressing chains of redundant nodes. Suffix tries store all suffixes of a text in linear space and support fast pattern matching queries in time proportional to the pattern length plus the number of matches. The document provides examples of using tries for text processing, web search indexing, internet routing, and other applications.
This document is an introduction to topological vector spaces written by Oliver Taylor for his MA-M00 project at Swansea University. It begins with brief histories of functional analysis and topological vector spaces. Fundamental concepts from vector spaces, convexity, and topology are then introduced. These include definitions of vector spaces, convex sets, open sets, neighborhoods, and topological spaces. The interactions between topology, convexity, and vector space structures are discussed. Finally, topological vector spaces are defined as vector spaces endowed with a topology compatible with the algebraic operations. Examples and applications are discussed in the last section.
In 2001 and 2003, Nakaok and Oda [3] and [4] introduced the notation of maximal open sets and minimal open sets in topological spaces. In 2010, Miguel, Saeid and Seithuti [2], introduced the notation of maximal θ-open sets and minimal θ -closed sets in topological spaces. In this paper, we introduce new classes of sets called maximal α-open sets and minimal α -open sets and investigate some of their fundamental properties.
This document presents a new method for finding the fuzzy critical path in a project network using type-2 discrete fuzzy numbers and type reduction. The key steps are:
1. Represent the time span of each activity as a type-2 discrete fuzzy number.
2. Use type reduction and the center of gravity to calculate the earliest start time, latest finish time, and total slack fuzzy time for each activity.
3. Identify the fuzzy critical path as the path(s) with a total slack time of 0 based on the center of gravity calculations.
An example application of the method on a sample network is provided to demonstrate the approach. The proposed method allows identification of the fuzzy critical path when activity
Recursion is a programming technique that involves a function calling itself. It consists of a recursive case where the function calls itself and a base case that stops the recursion. Without a base case, recursion will run infinitely. Examples of using recursion include calculating factorials and Fibonacci sequences by defining the problem in terms of smaller instances of the same problem. Recursion can reduce time complexity but uses more memory than iteration due to the function calls being stored on the stack.
This document discusses recursion in computer programming. It defines recursion as a technique that involves a procedure or function calling itself, either directly or indirectly. It notes that recursion requires a recursive case, where the code calls itself, and a base case, which stops recursion from continuing indefinitely. The document provides examples of using recursion to calculate factorials and the Fibonacci sequence in Python code. It also compares recursion to iteration, noting advantages like reducing time complexity, but disadvantages like using more memory.
TOP as a Grammatical Category The Case in Ngas and HausaLengji Danjuma
Since his work on Metta in 1987, Teke has adduced that African languages are better analyzed using TOP, a position which serves as the landing site for move-. Languages such as Yoruba, Tiv, and Bafut have been investigated along this line (Atanga, 1996) (Teke G. T., 1995) (1996). (Danjuma, 1996; 2003) and (Teke & Danjuma, 2004) have also dealt with some of the aspects of this analysis in Ngas. However, this paper seeks to focus on the movement of nouns and verbs into TOP in both Ngas and Hausa which are both Chadic languages in order to draw the basic similarities and differences as regards this analysis of move- into TOP.
ABSTRACT : In this paper we have studied the behavior of the different limits in some of the dual spaces of function spaces. A good number of results have been established. We have also observed that in few cases we have to take the of a set suitable conditions. We also used the notion of a perfect function space in establishing a few results .As a matter of facts the notions of which are used in this paper are parametric convergent ,parametric limit, projective convergent , projective limit, dual space of a function space and perfect function space in addition of the suitably defined and constructed some of the function spaces.
Linear algebra is the study of linear sets of equations and their transformation properties. It allows the analysis of rotations in space, least squares fittings, solutions to coupled differential equations, and more. Linear algebra is used in various fields including chemistry, coding theory, cryptography, economics, genetics, geometry, and engineering. Some examples of its applications are balancing chemical equations, coding and decoding messages, analyzing coupled oscillations, and encryption/decryption techniques using matrices.
Abstract: The project involves creation of 1. Website which will help an NGO named Juvenile Diabetic Parent Association of India (JDPAI) to reach out to the larger audiences and help them out in managing their diabetes and 2. As an Android powered Mobile device is the gadget found commonly in the common man we will develop an Android app which will help in managing diabetes by helping in counting the daily calorie intake, giving suggestions on different situations faced by the diabetics in their daily lives etc. The website has all the information about JDPAI and its work throughout the years. The android app will have all the information about the organization as well as extra features like calorie counting, sugar level manager, etc. This app will help the diabetics (Majorly type 1) manage their lives without any stress. The entire result given on each query fired by the user would be stored on the database of the app.
Folder Security Using Graphical Password Authentication Schemepaperpublications3
Abstract: Now a day most of the user are facing problem for providing the security to the folder, so that it will not be accesses by the unauthorized user. Taking in action all these problems I have designed a model which will provide a best security to your folders using graphical password authentication model. Graphical passwords are an alternative to alphanumeric passwords in which users click on images to authenticate themselves rather than type alphanumeric strings. We have developed one such system, called Pass Points, and evaluated it with human users. Beginning around 1999, a multitude of graphical based password scheme which have been proposed as alternative to text based password scheme, motivated by the promise of improved password memorability and thus usability. This paper presents a detailed evaluation of the Pass Points and pattern matching password scheme which provides high level of security and provides security to your folder.
Supervised Multi Attribute Gene Manipulation For Cancerpaperpublications3
Abstract: Data mining, the extraction of hidden predictive information from large databases, is a powerful new technology with great potential to help companies focus on the most important information in their data warehouses. Data mining tools predict future trends and behaviours, allowing businesses to make proactive, knowledge-driven decisions. The automated, prospective analyses offered by data mining move beyond the analyses of past events provided by retrospective tools typical of decision support systems.
They scour databases for hidden patterns, finding predictive information that experts may miss because it lies outside their expectations. Data mining techniques are the result of a long process of research and product development. This evolution began when business data was first stored on computers, continued with improvements in data access, and more recently, generated technologies that allow users to navigate through their data in real time. Data mining takes this evolutionary process beyond retrospective data access and navigation to prospective and proactive information delivery.
Analysis of Fungus in Plant Using Image Processing Techniquespaperpublications3
Abstract: The present work proposes a methodology for analysis of fungus in plant, using image processing techniques. The fungus kills the young seedling; it spread by air and can also infect plant. Therefore it is very important to monitor the leaf at regular intervals so as to keep track on quality of growth of plant. For analysis of fungus is focused on technique using MATLAB 7.0. The image are captured by digital camera mobile and processed using image growing, then the part of the leaf spot has been used for the classification purpose of the trait and test. The acquired image are in jpeg format and are converted to gray scale image. The gray scale images are enhanced and make noise free. The Ostu algorithm is applied to get threshold image. The pixel neighborhood is applied to enhance the pixel of leaf to show clearly the fungus area. Clustering is applied to get infected part of the leaf. RGB image is then segmented for analysis of fungus in plant. Comparative analyses of Image Edge Detection techniques are presented. It has been observed that the Canny Edge Detection algorithm is computationally more expensive compared to Sobel Edge Detection technique. The fungus infected area is 24.5951%.
Privacy Preserving Data Leak Detection for Sensitive Datapaperpublications3
Abstract: Number of data leaks in the organization, research institutions and security firms have grown rapidly in recent years. The data leakage occurs if there is no proper protection. The common approach is to monitor the data that are stored in the organization local network. The existing method require the plaintext sensitive data. However, this requirement is undesirable, as it may threaten the confidentiality of the sensitive information. A privacy preserving data-leak detection solution is proposed which can be outsourced and be deployed in a semi-honest detection environment. Fuzzy fingerprint technique is designed and implemented that enhances data privacy during data-leak detection operations. The DLD provider computes fingerprints from network traffic and identifies potential leaks in them. To prevent the DLD provider from gathering exact knowledge about the sensitive data, the collection of potential leaks is composed of real leaks and noises. The evaluation results show that this method can provide accurate detection.
Abstract: The main communication methods used by deaf people are sign language, but opposed to common thought, there is no specific universal sign language: every country or even regional group uses its own set of signs. The use of sign language in digital systems can enhance communication in both directions: animated avatars can synthesize signals based on voice or text recognition; and sign language can be translated into various text or sound forms based on different images, videos and sensors input. The ultimate goal of this research, but it is not a simple spelling of spoken language, so that recognizing different signs or letters of the alphabet (which has been a common approach) is not sufficient for its transcription and automatic interpretation. Here proposes an algorithm and method for an application this would help us in recognising the various user defined signs. The palm images of right and left hand are loaded at runtime. Firstly these images will be seized and stored in directory. Then technique called Template matching is used for finding areas of an image that match (are similar) to a template image (patch). Our goal is to detect the highest matching area. We need two primary components- A) Source image (I): In the template image in which we try to find a match. B) Template image (T): The patch image which will be compared to the template image. In proposed system user defined patterns will be having 60% accuracy while default patterns will be provided with 80% accuracy.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
Abstract: In today’s commercial, industrial and domestic world, Automation plays an important role, it is actually an arrangement of different elements in order to regulate, direct, sense and command itself to achieve a desired result. “Automatic Fire Fighting Robot” project employs the electrical thermostat technology for the controlling the fire 24 hrs. The system is cost effective, has a wide applications which when implement can show good and effective result. It can be use deliberately in industrial applications, commercial and in domestic sectors where the requirement of automatic work demands. Synchronization of various equipment involve in the system i.e Thermostat Sensor, water jet, wireless remote and wireless android device WiFi enabled Camera. This is mean to simulate the real world operation of Robot performing a fire extinguishing function. Fuzzy logic provided an appropriate solution to the otherwise complex task of mathematically deriving an exact model for the non-linear control system upon which conventional control techniques could then be applied. Making Robot wireless increases the effective area of operation, thereby making it possible to control the robot from remote location. Keeping all above factors in mind the Robot is capable of being remotely controlled and live video buffering i.e possessing a multimedia interface was convinced and developed.
Abstract: Password authentication is one of the simplest and the most convenient authentication mechanisms to deal with secret data over insecure networks. Every user now holds email account for different web sites or holds a username password for their office work in their computer system. In this paper, we shall present the result of our survey through basic currently available password-authentication-related schemes. We know that Apart from getting the password hacked by some intruder, a serious threats comes from the surrounding environment, specially the colleagues, friends or visitors nearby the system. Most of them have a tendency of observing keenly while you cast your password. Here we propose a simple way to provide a new way of password through clicks that would provide a secure mechanism from both the intruders and the people nearby while you type your password in the application.
1) The document discusses properties of abelian categories, including that kernels and cokernels are unique up to isomorphism.
2) It proves that in an abelian category, a morphism is a monomorphism if and only if its kernel is the zero object, and it is an epimorphism if and only if its cokernel is the zero object.
3) It also proves that in an abelian category, every bimorphism is an isomorphism, and that every monomorphism is the kernel of some morphism.
Using Bandwidth Aggregation to Improve the Performance of Video Quality- Adap...paperpublications3
1. The document discusses using bandwidth aggregation to improve video streaming quality over multiple wireless access networks. It formulates the multi-link video streaming process as a reinforcement learning task using a Markov Decision Process to determine optimal actions.
2. It proposes a quality-adaptive streaming approach that uses an adaptive search algorithm to obtain sub-optimal solutions in real time. The approach aims to achieve smooth, high quality video streaming while avoiding interruptions.
3. The approach considers metrics like startup latency, playback fluency, average playback quality, playback smoothness, and wireless service cost in its reward function to balance video quality of service with cost. It was evaluated using a realistic testbed with an Android phone.
Abstract: File replication is an effective way to enhance file availability and reduce file querying delay. It creates replicas for a file to improve its probability of being encountered by requests. Here, we introduce a new concept of resource for file replication, which considers both node storage and node meeting ability. We theoretically study the influence of resource allocation on the average querying delay and derive an optimal file replication rule (OFRR) that allocates resources to each file based on its popularity and size. We then propose a file replication protocol based on the rule, which approximates the minimum global querying delay in a fully distributed manner.
Efficient and Optimal Routing Scheme for Wireless Sensor Networkspaperpublications3
Abstract: The Wireless Sensor Networks (WSNs) have emerged as a new category of networking systems with limited computing, communication, and storage resources. In many sensing applications source nodes deliver packets to sink nodes via multiple hops, leading to the problem on how to find routes that enable all packets to be delivered in required time frames, while simultaneously taking into account factors such as energy efficiency and load balancing. To solve this problem one data collection protocol is developed called EDAL, which stands for Energy-efficient Delay-aware Lifetime-balancing data collection. Methods used are centralized heuristic and ant colony gossiping to find best energy efficient path. Then integrate EDAL with compressive sensing to reduce the amount of traffic generated and to reduce delay in the network.
Fingerprint Feature Extraction, Identification and Authentication: A Reviewpaperpublications3
Abstract: In the modern computerized world, due to high demand on fingerprint identification system, a lot of challenges keep arising in each phase of system, which include fingerprint image enhancement, feature extraction, features matching and fingerprint classification. Applications such as online banking and online shopping use techniques that depend on personal identification numbers, keys, or passwords. But there is the risk of data being forgotten, lost, or even stolen. One of the solutions to it may be biometric authentication methods which provide a unique way to identify, recognize and authenticate people. Fingerprints being the oldest methods of biometric authentication, are being explored at large. The main focus of the paper is to review fingerprint feature extraction, identification and authentication in different image/pattern based and minutiae-based fingerprints.
Comparative Study of Data Mining Classification Algorithms in Heart Disease P...paperpublications3
Abstract: This research paper intends to provide an accuracy of the best algorithm from the classification algorithms. The main objective of this research work is to predict more accurately the presence of heart disease in patients. The dataset used here is from the UCI Machine Learning Repository based Hungarian-14-heart disease with 294 instances. In this research paper, we use weka tool with five classifiers like Naïve Bayes, Logistic function, RBF Network function, Decision Table rule, SMO function and their performance on the diagnosis has been compared. From that Naïve Bayes provides 86% accurate result in 0 seconds and RBF Network provides 86% of accuracy in 0.17 seconds. The research result shows both the Naïve Bayes outperforms with a time duration of 0 seconds to build the model.
Avoiding Anonymous Users in Multiple Social Media Networks (SMN)paperpublications3
Abstract: The main aim of this project is secure the user login and data sharing among the social networks like Gmail, Facebook and also find anonymous user using this networks. If the original user not available in the networks, but their friends or anonymous user knows their login details means possible to misuse their chats. In this project we have to overcome the anonymous user using the network without original user knowledge. Unauthorized user using the login to chat, share images or videos etc This is the problem to be overcome in this project .That means user first register their details with one secured question and answer. Because the anonymous user can delete their chat or data In this by using the secured questions we have to recover the unauthorized user chat history or sharing details with their IP address or MAC address. So in this project they have found out a way to prevent the anonymous users misuse the original user login details.
Abstract: We are making one android application for our college. This application gives the complete details about the college like Admission procedure, various departments’ information etc. In that special job hunting section we are going to provide a new job opening in every one hour duration. The best advantage of these application will be messaging system that we are going to provide in the application. Every student will receive an SMS every hour about the job opening. If teacher wants send any kind of message any group of student, they can directly send the SMS notification to all the students with our messaging system. These help the student of college to be updated always and also attract all students to get admission in our college.
Abstract: The dramatic growth of smartphones in recent years, the challenge of limited energy capacity of these devices has not been solved satisfactorily. However, in the era of cloud computing, the limitation on energy capacity can be eased off in an efficient way by offloading heavy tasks to the cloud. It is important for smartphone and cloud computing developers to have insights into the energy cost of smartphone applications before implementing the offloading techniques.
In this paper, we evaluate the energy cost of multimedia applications on smartphones that are connected to Multimedia Cloud Computing (MCC). In other words, we investigate the feasibility of MCC. Specifically, we compared the energy costs for uploading and downloading a audio file to and from MCC with the energy costs of encoding the same audio file on a smartphone. The aforementioned comparison was performed by using HTTP and FTP Internet protocols with 3G and Wi-Fi network interfaces.
Enhancing Data Security in Cloud Storage Auditing With Key Abstractionpaperpublications3
Abstract: Auditing is an important service to verify the data in the cloud. Most of the auditing protocols are based on the assumption that the client’s secret key for auditing is secure. The security is not fully achieved, because of the low security parameters of the client. If the auditing protocol is not secured means the data of the client will exposed inevitably. In this paper a new mechanism of cloud auditing is implemented. And investigate to reduce the damage of the client key exposure in cloud storage auditing. Here the designing is built upon to overcome the week key auditing process. The auditing protocol is designed with the help of key exposure resilience. In the proposed design, the binary tree structure and the pre-order traversal technique is used to update the secret keys of the client. The security proof and the performance shows the cloud storage auditing with key exposure resilience is very efficient.
Abstract: Data Mining has wide applications in many areas such as banking, medicine, scientific research and among government agencies. Classification is one of the commonly used tasks in data mining applications. The cloud computing, users have the opportunity to outsource their data, in encrypted form, as well as the data mining tasks to the cloud. Since the data on the cloud is in encrypted form, existing privacy preserving classification techniques are not applicable. On solving the classification problem over encrypted data. A secure k-NN classifier over encrypted data in the cloud. The k-NN protocol protects the confidentiality of the data, user’s input query, and data access patterns. To develop a secure k-NN classifier over encrypted data under the standard semi-honest model. Also, we empirically analyze the efficiency of our solution through various experiments.
Fair Restrained Dominating Set in the Corona of GraphsDr. Amarjeet Singh
In this paper, we give the characterization of a fair restrained dominating set in the corona of two nontrivial connected graphs and give some important results.
In this paper, we extend the concept of fair secure dominating sets by characterizing the corona of two nontrivial connected graphs and give some important results.
FURTHER CHARACTERIZATIONS AND SOME APPLICATIONS OF UPPER AND LOWER WEAKLY QUA...IJESM JOURNAL
In his paper we characterize upper and lower weakly quasi continuous fuzzy multifunction’s [3] be a new type of convergence of a net in a topological space and also characterize lower weakly quasi continuous fuzzy multifunction by a newly defined convergence of a fuzzy net. Again a new concept of regularity in a topological space has been introduced and characterized and using this regularity several applications of upper weakly quasi continuous fuzzy multifunctions have been shown.
The aim of this paper is to investigate different definitions of soft points in the existing literature on soft set theory and its extensions in different directions. Then limitations of these definitions are illustrated with the help of examples. Moreover, the definition of soft point in the setup of fuzzy soft set, intervalvalued fuzzy soft set, hesitant fuzzy soft set and intuitionistic soft set are also discussed. We also suggest an approach to unify the definitions of soft point which is more applicable than the existing notions.
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...inventionjournals
In this paper, we prove some common fixed point theorem for weakly compatible maps in intuitionistic fuzzy metric space for two, four and six self mapping.
Hypersoft set is an extension of the soft set where there is more than one set of attributes occur and it is very much helpful in multi-criteria group decision making problem. In a hypersoft set, the function F is a multi-argument function. In this paper, we have used the notion of Fuzzy Hypersoft Set (FHSS), which is a combination of fuzzy set and hypersoft set. In earlier research works the concept of Fuzzy Soft Set (FSS) was introduced and it was applied successfully in various fields. The FHSS theory gives more flexibility as compared to FSS to tackle the parameterized problems of uncertainty. To overcome the issue where FSS failed to explain uncertainty and incompleteness there is a dire need for another environment which is known as FHSS. It works well when there is more complexity involved in the parametric data i.e the data that involves vague concepts. This work includes some basic set-theoretic operations on FHSSs and for the reliability and the authenticity of these operations, we have shown its application with the help of a suitable example. This example shows that how FHSS theory plays its role to solve real decision-making problems.
In this paper, we define the - -fuzzy subring and discussed various
fundamental aspects of - -fuzzy subrings. We introduce the concept of -
-level subset of this new fuzzy set and prove that - -level subset of - -
fuzzy subring form a ring. We define - -fuzzy ideal and show that set of
all - -fuzzy cosets form a ring. Moreover, we investigate the properties of
homomorphic image of - -fuzzy subring.
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 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.
In this paper a new class of minimal open and minimal closed sets in topological spaces, namely minimal 푣-open and minimal 푣-closed sets are introduced. We give some basic properties and various characterizations of minimal 푣-open and minimal 푣- closed sets. Mathematical Subject Classification: 54A05
International Journal of Mathematics and Statistics Invention (IJMSI)inventionjournals
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.
In this article we present a brief history and some applications of semirings, the structure of compact monothetic c semirings. The classification of these semirings be based on known description of discrete cyclic semirings and compact monothetic semirings. Boris Tanana "Compact Monothetic C-semirings" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-2 , February 2021, URL: https://www.ijtsrd.com/papers/ijtsrd38612.pdf Paper Url: https://www.ijtsrd.com/mathemetics/algebra/38612/compact-monothetic-csemirings/boris-tanana
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.
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.
This document introduces the concept of Nano generalized delta semi closed sets in Nano topological spaces. It defines Nano generalized delta semi closed sets and provides several examples to illustrate their behavior. The paper studies some properties of these sets, such as their relationships with other Nano topological concepts like Nano open sets, Nano closed sets, and Nano semiopen sets. Several theorems are proved about Nano generalized delta semi closed sets and their properties.
Zadeh conceptualized the theory of fuzzy set to provide a tool for the basis of the theory of possibility. Atanassov extended this theory with the introduction of intuitionistic fuzzy set. Smarandache introduced the concept of refined intuitionistic fuzzy set by further subdivision of membership and non-membership value. The meagerness regarding the allocation of a single membership and non-membership value to any object under consideration is addressed with this novel refinement. In this study, this novel idea is utilized to characterize the essential elements e.g. subset, equal set, null set, and complement set, for refined intuitionistic fuzzy set. Moreover, their basic set theoretic operations like union, intersection, extended intersection, restricted union, restricted intersection, and restricted difference, are conceptualized. Furthermore, some basic laws are also discussed with the help of an illustrative example in each case for vivid understanding.
This document introduces the concepts of intuitionistic fuzzy almost - generalized semi continuous mappings and intuitionistic fuzzy almost contra - generalized semi continuous mappings. It defines these concepts and studies some of their basic properties. It provides definitions for intuitionistic fuzzy topological spaces and establishes preliminaries for intuitionistic fuzzy sets, intuitionistic fuzzy open and closed sets, and various types of intuitionistic fuzzy continuous mappings. An example is given to illustrate an intuitionistic fuzzy almost - generalized semi continuous mapping.
This document introduces the concepts of intuitionistic fuzzy almost - generalized semi continuous mappings and intuitionistic fuzzy almost contra - generalized semi continuous mappings. It defines these concepts and studies some of their basic properties. The document begins with preliminaries on intuitionistic fuzzy sets and intuitionistic fuzzy topological spaces. It then defines intuitionistic fuzzy almost - generalized semi continuous mappings and provides an example. Finally, it introduces intuitionistic fuzzy almost contra - generalized semi continuous mappings.
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.
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
International Conference on NLP, Artificial Intelligence, Machine Learning an...gerogepatton
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
Low power architecture of logic gates using adiabatic techniquesnooriasukmaningtyas
The growing significance of portable systems to limit power consumption in ultra-large-scale-integration chips of very high density, has recently led to rapid and inventive progresses in low-power design. The most effective technique is adiabatic logic circuit design in energy-efficient hardware. This paper presents two adiabatic approaches for the design of low power circuits, modified positive feedback adiabatic logic (modified PFAL) and the other is direct current diode based positive feedback adiabatic logic (DC-DB PFAL). Logic gates are the preliminary components in any digital circuit design. By improving the performance of basic gates, one can improvise the whole system performance. In this paper proposed circuit design of the low power architecture of OR/NOR, AND/NAND, and XOR/XNOR gates are presented using the said approaches and their results are analyzed for powerdissipation, delay, power-delay-product and rise time and compared with the other adiabatic techniques along with the conventional complementary metal oxide semiconductor (CMOS) designs reported in the literature. It has been found that the designs with DC-DB PFAL technique outperform with the percentage improvement of 65% for NOR gate and 7% for NAND gate and 34% for XNOR gate over the modified PFAL techniques at 10 MHz respectively.
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...University of Maribor
Slides from talk presenting:
Aleš Zamuda: Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapter and Networking.
Presentation at IcETRAN 2024 session:
"Inter-Society Networking Panel GRSS/MTT-S/CIS
Panel Session: Promoting Connection and Cooperation"
IEEE Slovenia GRSS
IEEE Serbia and Montenegro MTT-S
IEEE Slovenia CIS
11TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONIC AND COMPUTING ENGINEERING
3-6 June 2024, Niš, Serbia
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELgerogepatton
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Advanced control scheme of doubly fed induction generator for wind turbine us...
Fuzzy α^m-Separation Axioms
1. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 56
Paper Publications
Fuzzy -Separation Axioms
1
Qays Hatem Imran, 2
Hayder Kadhim Zghair
1
Department of Mathematics, College of Education for Pure Science, Al-Muthanna University, Samawah, Iraq
2
Department of Software, College of Information Technology, University of Babylon, Babylon, Iraq
Abstract: This paper will introduce a new class of fuzzy closed set (briefly F- ) called fuzzy -closed set as well
as, introduce the fuzzy -kernel set of the fuzzy topological space. The investigation will address and discuss
some of the properties of the fuzzy separation axioms such as fuzzy - -space and fuzzy - -space (note that,
the indexes and are natural numbers of the spaces and are from 0 to 3 and from 0 to 4 respectively).
Mathematics Subject Classification (2010): 54A40.
Keywords: -closed set, - -space, and - -space, .
1. INTRODUCTION
In 1965 Zadeh studied the fuzzy sets (briefly -sets) (see [6]) which plays such a role in the field of fuzzy topological
spaces (or simply fts). The fuzzy topological spaces investigated by Chang in 1968 (see [3]). A. S. Bin Shahna [1] defined
fuzzy -closed sets. In 1997, fuzzy generalized closed set (briefly - ) was introduced by G. Balasubramania and P.
Sundaram [5]. In 2014, M. Mathew and R. Parimelazhagan [7] defined -closed sets of topological spaces. The aim of
this paper is to introduce a concept of -closed sets and study their basic properties in fts. Furthermore, the
investigation will include some of the properties of the fuzzy separation axioms such fuzzy - -space and fuzzy -
-space (here the indexes and are natural numbers of the spaces and are from 0 to 3 and from 0 to 4 respectively).
2. PRELIMINARIES
Throughout this paper, or simply always mean a fts. A fuzzy point [4] with support and value (
) at will be denoted by , and for fuzzy set , iff . Two fuzzy points and are said to be
distinct iff their supports are distinct. That is, by and we mean the constant fuzzy sets taking the values and on
, respectively [2]. For a fuzzy set in a fts , , and represents the fuzzy closure of ,
the fuzzy interior of and the fuzzy complement of respectively.
Definition 2.1:[12] A fuzzy point in a set with support and membership value is called crisp point, denoted by .
For any fuzzy set in , we have iff .
Definition 2.2:[8] A fuzzy point is called quasi-coincident (briefly -coincident) with the fuzzy set is denoted
by iff . A fuzzy set in a fts is called -coincident with a fuzzy set which is denoted by
iff there exists such that . If the fuzzy sets and in a fts are not -coincident then
we write ̅ . Note that ̅ .
Definition 2.3:[8] A fuzzy set in a fts is called -neighbourhood (briefly -nhd) of a fuzzy point (resp. fuzzy
set ) if there is a - in a fts such that (resp. ).
2. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 57
Paper Publications
Definition 2.4:[1] A fuzzy set of a fts is called a fuzzy -open set (briefly - ) if and
a fuzzy -closed set (briefly - ) if . The fuzzy -closure of a fuzzy set of fts is the
intersection of all - that contain and is denoted by .
Definition 2.5:[5] A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if whenever
and is a - in .
Definition 2.6:[10] A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if
whenever and is a - in .
Definition 2.7:[9] A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if whenever
and is a - in .
Remark 2.8:[5,11] In a fts , then the following statements are true:
(i) Every - is a - .
(ii) Every - is a - .
Remark 2.9:[9,10] In a fts , then the following statements are true:
(i) Every - is a - .
(ii) Every - is a - .
(iii) Every - is a - .
3. FUZZY -CLOSED SETS
Definition 3.1: A fuzzy set of a fts is called a fuzzy -closed set (briefly - ) if
whenever and is a - . The complement of a fuzzy -closed set in is fuzzy -open set (briefly -
) in , the family of all - (resp. - ) of a fts is denoted by - (resp. - ).
Example 3.2: Let and the fuzzy set in defined as follows: .
Let be a fts. Then the fuzzy sets and are - and - at the same time in .
Remark 3.3: In a fts , then the following statements are true:
(i) Every - is a - .
(ii) Every - is a - .
(iii) Every - is a - .
(iv) Every - is a - .
Proof: (i) This follows directly from the definition (3.1).
(ii) Let be a - in and let be a - such that . Since every - is a - and is a - ,
. Therefore, is a - in .
(iii) From the part (ii) and remark (2.9) (ii).
(iv) From the part (iii) and remark (2.9) (iii).
Theorem 3.4: A fuzzy set is - iff contains no non-empty - .
Proof: Necessity. Suppose that is a non-empty -closed subset of such that .
Then . Then . Therefore and . Since is a -
and is a - , . Thus . Therefore
. Therefore contains no non-empty - .
3. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 58
Paper Publications
Sufficiency. Let be a - . Suppose that is not contained in . Then is a non-
empty - and contained in which is a contradiction. Therefore, and hence is a
- .
Theorem 3.5: Let , if is a - relative to and is a - then is a - in a fts .
Proof: Let be a - in a fts such that . Given that . Therefore and . This
implies . Since is a - relative to , then . implies that
. Thus . This implies that
. Therefore
. Since is a - in . . Also implies that
. Thus . Therefore . Since is not
contained in , is a - relative to .
Theorem 3.6: If is a - and , then is a - .
Proof: Let be a - such that . Let be a - in a fts such that . Since is
a - , we have whenever . Since and , then
. Therefore, . Thus, is a - in .
Theorem 3.7: The intersection of a - and a - is a - .
Proof: Let be a - and be a - . Since is a - ( ) whenever where is a -
. To show that is a - . It is enough to show that ( ) whenever , where is a
- . Let then . Since is a - , is a - and is a - ( )
. Now, ( ) ( ) ( ) ( )
. This implies that is a - .
Theorem 3.8: If and are two - in a fts , then is a - in .
Proof: Let and be two - in a fts . Let be a - in such that .
Now, ( ) ( ) ( ) . Hence is a - .
Remark 3.9: The union of two - need not be a - .
Definition 3.10: The intersection of all - in a fts containing is called fuzzy -closure of and is
denoted by - , - : , is a - .
Definition 3.11: The union of all - in a fts contained in is called fuzzy -interior of and is denoted
by - , - is a - .
Proposition 3.12: Let be any fuzzy set in a fts . Then the following properties hold:
(i) - iff is a - .
(ii) - iff is a - .
(iii) - is the largest - contained in .
(iv) - is the smallest - containing .
Proof: (i), (ii), (iii) and (iv) are obvious.
4. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 59
Paper Publications
Proposition 3.13: Let be any fuzzy set in a fts . Then the following properties hold:
(i) - - ,
(ii) - - .
Proof: (i) By definition, - is a -
- is a -
is a -
is a -
-
(ii) The proof is similar to (i).
Definition 3.14: A fuzzy set in a fts is said to be a fuzzy -neighbourhood (briefly -nhd) of a fuzzy
point if there exists a - such that . A -nhd is said to be a -open-nhd (resp. -
closed-nhd) iff is a - (resp. - ). A fuzzy set in a fts is said to be a fuzzy - -neighbourhood
(briefly - -nhd) of a fuzzy point (resp. fuzzy set ) if there exists a - in a fts such that
(resp. ).
Theorem 3.15: A fuzzy set of a fts is - iff ̅ ̅ , for every - of .
Proof: Necessity. Let be a - and ̅ . Then and is a - in which implies that
as is a - . Hence, ̅ .
Sufficiency. Let be a - of a fts such that . Then ̅ and is a - in . By
hypothesis, ̅ implies . Hence, is a - in .
Theorem 3.16: Let and be a fuzzy point and a fuzzy set respectively in a fts . Then - iff every
- -nhd of is -coincident with .
Proof: Let - . Suppose there exists a - -nhd of such that ̅ . Since is a - -nhd of ,
there exists a - in such that whish gives that ̅ and hence . Then -
, as is a - . Since , we have - , a contradiction. Thus every - -nhd
of is -coincident with .
Conversely, suppose - . Then there exists a - such that and . Then we have
and ̅ , a contradiction. Hence - .
Theorem 3.17: Let and be two fuzzy sets in a fts . Then the following are true:
(i) - , - .
(ii) - is a - in .
(iii) - - when .
(iv) iff - , when is a - in .
(v) - - ( - ).
Proof: (i) and (ii) are obvious.
(iii) Let - . By theorem (3.16), there is a - -nhd of a fuzzy point such that ̅ , so there is a
- such that and ̅ . Since , then ̅ . Hence - by theorem (3.16). Thus
- - .
(iv) Let be a - in . Suppose that ̅ , then . Since is a - and by a part (iii),
- - . Hence, ̅ - .
Conversely, suppose that ̅ - . Then - . Since - , we have .
Hence ̅ .
5. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 60
Paper Publications
(v) Since - - ( - ). We prove that - ( - - . Suppose that - .
Then by theorem (3.16), there exists a - -nhd of a fuzzy point such that ̅ and so there is a - in
such that and ̅ . By a part (iv), ̅ - . Then by theorem (3.16), - - .
Thus - - - . Hence - - - .
Theorem 3.18: Let and be two fuzzy sets in a fts . Then the following are true:
(i) - , - .
(ii) - is a - in .
(iii) - - when .
(iv) - - ( - ).
Proof: Obvious.
Remark 3.19: The following are the implications of a - and the reverse is not true.
4. FUZZY -KERNEL AND FUZZY - -SPACES,
Definition 4.1: The intersection of all -open subset of containing is called the fuzzy -kernel of (briefly
- ), this means - - : .
Definition 4.2: In a fts , a fuzzy set is said to be weakly ultra fuzzy -separated from if there exists a -
such that or - .
By definition (4.2), we have the following: For every two distinct fuzzy points and of ,
(i) - is not weakly ultra fuzzy -separated from .
(ii) - is not weakly ultra fuzzy -separated from .
Corollary 4.3: Let be a fts, then - iff - for each .
Proof: Suppose that - . Then there exists a - containing such that . Therefore, we
have - . The converse part can be proved in a similar way.
Definition 4.4: A fts is called fuzzy - -space ( - -space, for short) if for each - and ,
then - .
Definition 4.5: A fts is called fuzzy - -space ( - -space, for short) if for each two distinct fuzzy points
and of with - - , there exist disjoint - such that - and -
.
Theorem 4.6: Let be a fts. Then is - -space iff - - , for each .
- 𝛼 𝑚
-
𝛼 -
𝛼-
𝛼--
6. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 61
Paper Publications
Proof: Let be a - -space. If - - , for each , then there exist another fuzzy
point such that - and - } this means there exist an - , implies
- this contradiction. Thus - - .
Conversely, let - - , for each - , then - - [by
definition (4.1)]. Hence by definition (4.4), is a - -space.
Theorem 4.7: A fts is an - -space iff for each - and , then - .
Proof: Let for each - and , then - and let be a - , then for each
implies is a - implies - [by assumption]. Therefore -
implies - [by corollary (4.3)]. So - . Thus is an - -space.
Conversely, let be a - -space and be a - and . Then for each implies is a
- , then - [since is a - -space], so - - . Thus -
.
Corollary 4.8: A fts is - -space iff for each - and , then - - .
Proof: Clearly.
Theorem 4.9: Every - -space is a - -space.
Proof: Let be a - -space and let be a - , , then for each implies is a -
and - implies - - . Hence by definition (4.5), - . Thus is a
- -space.
Theorem 4.10: A fts is - -space iff for each with - - , then there exist
- , such that - , - and - , -
and .
Proof: Let be a - -space. Then for each with - - . Since every -
-space is a - -space [by theorem (4.9)], and by theorem (4.6), - - , then there exist -
, such that - and - and [since is a - -space], then
and are F - such that . Put and . Thus and so
that - and - .
Conversely, let for each with - - , there exist - , such that -
- and - - and ,
then and are - such that . Put and . Thus, - and -
and , so that and implies - and - , then
- and - . Thus, is a - -space.
Corollary 4.11: A fts is - -space iff for each with - - there exist disjoint
- such that - - and - - .
Proof: Let be a - -space and let with - - , then there exist disjoint -
such that - and - . Also is - -space [by theorem (4.9)] implies for
each , then - - [by theorem (4.6)], but - - - -
- . Thus - - and - - .
Conversely, let for each with - - there exist disjoint - such that -
- and - - . Since - , then - - -
for each . So we get - and - . Thus, is a - -space.
7. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 62
Paper Publications
Definition 4.12: Let be a fts. Then is called:
(i) fuzzy -regular space ( -space, for short), if for each fuzzy point and each - such that – ,
there exist disjoint - and such that and .
(ii) fuzzy -normal space ( -space, for short) iff for each pair of disjoint - and , there exist disjoint
- and such that and .
(iii) fuzzy - -space ( - -space, for short) if it is property -space.
(iv) fuzzy - -space ( - -space, for short) iff it is - -space and -space.
Example 4.13: Consider the fts of example (3.2). Then is a -space and -space.
Remark 4.14: Every - -space is a - -space, .
Proof: Clearly.
Theorem 4.15: A fts is -space ( - -space) iff for each -closed subset of and with -
- then there exist - , such that - , - and -
, - and .
Proof: Let be a -space ( - -space) and let be a - , , then there exist disjoint -
such that and , then and are - such that .
Put and , so we get - , - and - ,
- and .
Conversely, let for each -closed subset of and with - - , then there exist -
such that - , - and - , -
and . Then and are - such that and - , -
. So that and . Thus, is a -space ( - -space).
Lemma 4.16: Let be a -space and be a - . Then - - .
Proof: Let be a -space and be a - . Then for each , there exist disjoint - such that
and . Since - , implies - , thus - - . We showing
that if implies - - , therefore - - - . As -
- [by definition (4.1)]. Thus, - - .
Theorem 4.17: A fts is -space ( - -space) iff for each -closed subset of and with -
- - - , then there exist disjoint - such that - - and
- - .
Proof: Let be a -space ( - -space) and let be a - , . Then there exist disjoint -
such that and By lemma (4.16), - - - , in the other hand is a
- -space [by theorem (4.9) and remark (4.14)]. Hence, by theorem (4.6), - - , for
each . Thus, - - and - - .
Conversely, let for each - and with - - - - , then there exist
disjoint - such that - - and - - . Then and .
Thus, is a -space ( - -space).
Theorem 4.18: A fts is -space iff for each disjoint - , with - - then there
exist - , such that - , - and - , -
and .
8. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 63
Paper Publications
Proof: Let be a -space and let for each disjoint - , with - - then there
exist disjoint - such that and and , then and are - such that
and - , - Put and . Thus, - , -
and - , - .
Conversely, let for each disjoint - , with - - , there exist - , such that -
, - and - , - and
implies and are - such that . Put and , thus - and -
, so that and . Thus is a -space.
Theorem 4.19: Every - -space is a -space.
Proof: Let be a - and . Then - - , then for each there exist -
such that - , - and - , -
[since is a - -space and by theorem (4.10)], let , so we have .
Hence is a -space, then there exist disjoint - such that and . Thus, is a
-space.
5. FUZZY - -SPACES,
Definition 5.1: Let be a fts. Then is called:
(i) fuzzy - -space ( - -space, for short) iff for each pair of distinct fuzzy points in , there exists a - in
containing one and not the other.
(ii) fuzzy - -space ( - -space, for short) iff for each pair of distinct fuzzy points and of , there exists
- containing and respectively such that and .
(iii) fuzzy - -space ( - -space, for short) iff for each pair of distinct fuzzy points and of , there exist
disjoint - in such that and .
(iv) fuzzy - -space ( - -space, for short) iff it is - -space and r-space.
(v) fuzzy - -space ( - -space, for short) iff it is - -space and n-space.
Example 5.2: Let and be a fts on . Then is a crisp point in and is a - -
space.
Example 5.3: Let and be a fts on . Then are crisp points in and is a -
-space and - -space.
Example 5.4: The discrete fuzzy topology in is a - -space and - -space.
Remark 5.5: Every - -space is a - -space, .
Proof: Clearly.
Theorem 5.6: A fts is - -space iff either - or - , for each .
Proof: Let be a - -space then for each , there exists a - such that , or
, . Thus either , implies - or , implies - .
Conversely, let either - or - , for each . Then there exists a - such
that , or , . Thus is a - -space.
9. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 64
Paper Publications
Theorem 5.7: A fts is - -space iff either - is weakly ultra fuzzy -separated from or -
is weakly ultra fuzzy -separated from for each .
Proof: Let be a - -space then for each , there exists a - such that , or
, . Now if , implies - is weakly ultra fuzzy -separated from . Or if
, implies - is weakly ultra fuzzy -separated from .
Conversely, let either - be weakly ultra fuzzy -separated from or - be weakly ultra
fuzzy -separated from . Then there exists a - such that - and or -
implies , or , . Thus, is a - -space.
Theorem 5.8: A fts is - -space iff for each , - is weakly ultra fuzzy -separated
from and - is weakly ultra fuzzy -separated from .
Proof: Let be a - -space then for each there exist - such that , and
, . Implies - is weakly ultra fuzzy -separated from and - is weakly ultra
fuzzy -separated from .
Conversely, let - be weakly ultra fuzzy -separated from and - be weakly ultra fuzzy
-separated from . Then there exist - such that - and -
implies , and , . Thus, is a - -space.
Theorem 5.9: A fts is - -space iff for each , - .
Proof: Let be a - -space and let - . Then - contains another fuzzy point
distinct from say . So - implies - is not weakly ultra fuzzy -separated from .
Hence by theorem (5.8), is not a - -space this is contradiction. Thus - .
Conversely, let - , for each and let be not a - -space. Then by theorem (5.8), -
is not weakly ultra fuzzy -separated from , this means that for every - contains -
then implies - implies - , this is contradiction. Thus, is a
- -space.
Theorem 5.10: A fts is - -space iff for each , - and - } .
Proof: Let be a - -space then for each , there exists - such that , and
, . Implies - and - .
Conversely, let - and - , for each . Then there exists - such
that , and , . Thus, is a - -space.
Theorem 5.11: A fts is - -space iff for each implies - - .
Proof: Let be a - -space. Then - and - [by theorem (5.9)]. Thus,
- - .
Conversely, let for each implies - - and let be not - -space then
for each implies - or - [by theorem (5.10)], then - -
this is contradiction. Thus, is a - -space.
Theorem 5.12: A fts is - -space iff is - -space and - -space.
Proof: Let be a - -space and let be a - , then for each , - -
[by theorem (5.11)] implies - and - ) this means - ,
hence - . Thus, is a - -space.
10. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 65
Paper Publications
Conversely, let be a - -space and - -space, then for each there exists a - such that
, or . Say since is a - -space, then - , this
means there exists a - such that . Thus, is a - -space.
Theorem 5.13: A fts is - -space iff
(i) is - -space and - -space.
(ii) is - -space and - -space.
Proof: (i) Let be a - -space then it is a - -space. Now since is a - -space then for each
, there exist disjoint - such that and implies - and -
, therefore - and - . Thus, is a - -space.
Conversely, let be a - -space and - -space, then for each , there exists a - such that
or , implies - - , since is a - -space [by assumption],
then there exist disjoint - such that and . Thus, is a - -space.
(ii) By the same way of part (i) a - -space is - -space and - -space.
Conversely, let be a - -space and - -space, then for each , there exist - such that
and implies - - } , since is a - -space, then there exist
disjoint - such that and . Thus, is a - -space.
Corollary 5.14: A - -space is - -space iff for each with - - then there
exist - , such that - , - and - , -
and .
Proof: By theorem (4.10) and theorem (5.13).
Corollary 5.15: A - -space is - -space iff one of the following conditions holds:
(i) for each with - - , then there exist - such that - -
and - - .
(ii) for each with - - then there exist - , such that -
, - and - , - and .
Proof: (i) By corollary (4.11) and theorem (5.13).
(ii) By theorem (4.10) and theorem (5.13).
Theorem 5.16: A - -space is - -space iff one of the following conditions holds:
(i) for each , - .
(ii) for each , - - implies - - .
(iii) for each , either - or - .
(iv) for each , then - and - .
Proof: (i) Let be a - -space. Then is a - -space and - -space [by theorem (5.13)]. Hence by
theorem (5.9), - for each .
Conversely, let for each , - , then by theorem (5.9), is a - -space. Also is a
- -space by assumption. Hence by theorem (5.13), is a - -space.
(ii) Let be a - -space. Then is - -space [by remark (5.5)]. Hence by theorem (5.11), -
- for each .
Conversely, assume that for each , - - implies - -
. So by theorem (5.11), is a - -space, also is a - -space by assumption. Hence by theorem
(5.13), is a - -space.
11. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 66
Paper Publications
(iii) Let be a - -space. Then is a - -space [by remark (5.5)]. Hence by theorem (5.6), either
- or - for each .
Conversely, assume that for each , either - or - for each . So by
theorem (5.6), is a - -space, also is - -space by assumption. Thus is a - -space [by
theorem (5.13)].
(iv) Let be a - -space. Then is a - -space and - -space [by theorem (5.13)]. Hence by
theorem (5.10), - and - .
Conversely, let for each then - and - . Then by theorem (5.10), is a
- -space. Also is a - -space by assumption. Hence by theorem (5.13), is a - -space.
Remark 5.17: Each fuzzy separation axiom is defined as the conjunction of two weaker axioms: - -space = -
-space and - -space = - -space and - -space, .
Theorem 5.18: Let be a fts and - for each then is - -space if and only if it is
a - -space.
Proof: Let be a - -space. Then, is a - -space [By remark (5.17)].
Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, -
for each , then is a - -space [by theorem (5.9)]. Hence by remark (5.17), is a - -space.
Theorem 5.19: Let be a fts and let , implies - - , then is a -
-space iff it is a - -space.
Proof: Let be a - -space. Then is a - -space [by remark (5.17)].
Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, -
- , for each , then by theorem (5.11), is a - -space. Hence by remark (5.17),
is a - -space.
Theorem 5.20: Let be a fts and for each either - or - , then
is a - -space iff it is a - -space.
Proof: Let be a - -space. Then is a - -space [by remark (5.17)].
Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, for each
either - or - . This means either - is weakly ultra fuzzy -separated
from or - is weakly ultra fuzzy -separated from , so by theorem (5.7), is a - -space.
Hence by remark (5.17), is a - -space.
Theorem 5.21: Let be a fts and let , then - and - , is a -
-space iff it is a - -space.
Proof: Let be a - -space. Then is a - -space [by remark (5.17)].
Conversely, let be a - -space then it is a -space [definition (4.12)(iii)]. By assumption, for each
then - and - . Therefore, - is weakly ultra fuzzy -separated from
and - is weakly ultra fuzzy -separated from , so by theorem (5.8), is a - -space.
Hence by remark (5.17), is a - -space.
Remark 5.22: The relation between fuzzy -separation axioms can be representing as a matrix. Therefore, the element
refers to this relation. As the following matrix representation shows:
12. 1022-ISSN 2350
International Journal of Recent Research in Mathematics Computer Science and Information Technology
www.paperpublications.org, Available at:March 2016–67), Month: October 2015-e 2, pp: (56Vol. 2, Issu
Page | 67
Paper Publications
and - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
- - - - - - - - - -
Matrix Representation
The relation between fuzzy -separation axioms
REFERENCES
[1] S. Bin Shahna, “On fuzzy strong semi continuity and fuzzy pre continuity”, Fuzzy sets and system, 44(2), (1991),
303-308.
[2] Sikn, “On fuzzy FC - Compactness”, Comm. Korean Math. Soc., 13(1998), 137-150.
[3] L. Chang, “Fuzzy topological spaces”, J. Math. Anal. Appl., 24(1968), 182-190.
[4] K. Wong, “Fuzzy points and local properties of fuzzy topology”, J. Math. Anal. Appl., 46(1974), 316-328.
[5] G. Balasubramania and P. Sundaram, “On some generalizations of fuzzy continuous functions”, Fuzzy sets and
Systems, 86(1), (1997), 93-100.
[6] L. A. Zadeh, “Fuzzy sets”, Information and control, 8 (1965), 338-353.
[7] M. Mathew and R. Parimelazhagan, “ -Closed set in topological spaces”, International Journal of Mathematical
Analysis, Vol.8, No.47, (2014), 2325-2329.
[8] P. M. Pu and Y. M. Liu, “ Fuzzy topology I. Neighborhood structure of a fuzzy point and Moore-Smith
convergence”, J. Math. Anal. Appl., 76(1980), 571-599.
[9] R. K. Saraf and S. Mishra, “Fgα-closed sets”, J. Tripura Math. Soc., 2(2000), 27-32.
[10] R. K. Saraf, G. Navalagi and M. Khanna, “On fuzzy semi pre generalized closed sets”, Bull. Malaysian Math. Sci.
Soc., 28(1), (2005), 19-30.
[11] S. S. Thakur and S. Singh, “On fuzzy semi pre open sets and fuzzy semi pre continuous”, Fuzzy sets and system,
98(3), (1998), 383-391.
[12] S. Ganguly and S. Saha, “A note on -continuity and -connected sets in fuzzy set theory”, Simon Stevin, 62(1988).