Fuzzy Topological Games and Related Topics

The main purpose of study is to extend the concept of the topological game G(K, X) and some other kinds of games into fuzzy topological games and to obtain some results regarding them. Owing to the fact that topological games have plenty of applications in covering properties, it made an attempt to explore some inter relations of games and covering properties in fuzzy topological spaces. Even though the main focus is on fuzzy para-meta compact spaces and closure preserving shading families, some brief sketches regarding fuzzy P-spaces and Shading Dimension is also provided. In a topological game players choose some objects related to the topological structure of a space such as points, closed subsets, open covers etc. More over the condition on a play to be winning for a player may also include topological notions such as closure, convergence, etc. It turns out that topological games are related to the Baire property, Baire spaces, Completeness properties, Convergence properties, Separation properties, Covering and Base properties, Continuous images, Suslin sets, Singular spaces etc.

Development of Bioreactors for Nitrifying Water In Closed System Hatcheries Of Penaeid And Non-Penaeid Prawns

In the present study the development of bioreactors for nitrifying water in closed system hatcheries of penaeid and non-penaeid prawns. This work is an attempt in this direction to cater to the needs of aquaculture industry for treatment and remediation of ammonia and nitrate in penaeid and non-penaeid hatcheries, by developing nitrifying bacteria allochthonous to the particular environment under consideration, and immobilizing them on an appropriately designed support materials configured as reactors. Ammonia toxicity is the major limiting factors in penaeid and non-penaeid hatchery systems causing lethal and sublethal effects on larvae depending on the pH values. Pressing need of the aquaculture industry to have a user friendly and economically viable technology for the removal of ammonia, which can be easily integrated to the existing hatchery designs without any major changes or modifications. Only option available now is to have biological filters through which water can be circulated for the oxidation of ammonia to nitrate through nitrite by a group of chemolithotrophs known as nitrifying bacteria. Two types of bioreactors have been designed and developed. The first category named as in situ stringed bed suspended bioreactor(SBSBR) was designed for use in the larval rearing tanks to remove ammonia and nitrite during larval rearing on a continuous basis, and the other to be used for nitrifying freshly collected seawater and spent water named as ex situ packed bed bioreactior(PBBR). On employing the two reactors together , both penaeid and non-penaeid larval rearing systems can be made a closed recirculating system at least for a season. A survey of literature revealed that the in situ stringed bed suspended reactor developed here is unique in its design, fabrication and mode of application.

Box Products in Fuzzy Topological Spaces and Related Topics

The topology as the product set with a base chosen as all products of open sets in the individual spaces. This topology is known as box topology. The main objective of this study is to extend the concept of box products to fuzzy box products and to obtain some results regarding them. Owing to the fact that box products have plenty of applications in uniform and covering properties, here made an attempt to explore some inter relations of fuzzy uniform properties and fuzzy covering properties in fuzzy box products. Even though the main focus is on fuzzy box products, some brief sketches regarding hereditarily fuzzy normal spaces and fuzzy nabla product is also provided. The main results obtained include characterization of fuzzy Hausdroffness and fuzzy regularity of box products of fuzzy topological spaces. The investigation of the completeness of fuzzy uniformities in fuzzy box products proved that a fuzzy box product of spaces is fuzzy topologically complete if each co-ordinate space is fuzzy topologically complete. The thesis also prove that the fuzzy box product of a family of fuzzy α-paracompact spaces is fuzzy topologically complete. In Fuzzy box product of hereditarily fuzzy normal spaces, the main result obtained is that if a fuzzy box product of spaces is hereditarily fuzzy normal ,then every countable subset of it is fuzzy closed. It also deals with the notion of fuzzy nabla product of spaces which is a quotient of fuzzy box product. Here the study deals the relation connecting fuzzy box product and fuzzy nabla product

Convex extendable trees

The concept of convex extendability is introduced to answer the problem of finding the smallest distance convex simple graph containing a given tree. A problem of similar type with respect to minimal path convexity is also discussed.

Studies on Fuzzy Matroitls and Related Topics

The doctoral thesis focuses on the Studies on fuzzy Matroids and related topics.Since the publication of the classical paper on fuzzy sets by L. A. Zadeh in 1965.the theory of fuzzy mathematics has gained more and more recognition from many researchers in a wide range of scientific fields. Among various branches of pure and applied mathematics, convexity was one of the areas where the notion of fuzzy set was applied. Many researchers have been involved in extending the notion of abstract convexity to the broader framework of fuzzy setting. As a result, a number of concepts have been formulated and explored. However. many concepts are yet to be fuzzified. The main objective of this thesis was to extend some basic concepts and results in convexity theory to the fuzzy setting. The concept like matroids, independent structures. classical convex invariants like Helly number, Caratheodoty number, Radon number and Exchange number form an important area of study in crisp convexity theory. In this thesis, we try to generalize some of these concepts to the fuzzy setting. Finally, we have defined different types of fuzzy matroids derived from vector spaces and discussed some of their properties.

Anomaly Detection Using System Call Sequence Sets.

This paper discusses our research in developing a generalized and systematic method for anomaly detection. The key ideas are to represent normal program behaviour using system call frequencies and to incorporate probabilistic techniques for classification to detect anomalies and intrusions. Using experiments on the sendmail system call data, we demonstrate that concise and accurate classifiers can be constructed to detect anomalies. An overview of the approach that we have implemented is provided.

Computing median and antimedian sets in median graphs

The median (antimedian) set of a profile π = (u1, . . . , uk) of vertices of a graphG is the set of vertices x that minimize (maximize) the remoteness i d(x,ui ). Two algorithms for median graphs G of complexity O(nidim(G)) are designed, where n is the order and idim(G) the isometric dimension of G. The first algorithm computes median sets of profiles and will be in practice often faster than the other algorithm which in addition computes antimedian sets and remoteness functions and works in all partial cubes

Prediction of Key Symptoms of Learning Disabilities in School-Age Children Using Rough Sets

This paper highlights the prediction of learning disabilities (LD) in school-age children using rough set theory (RST) with an emphasis on application of data mining. In rough sets, data analysis start from a data table called an information system, which contains data about objects of interest, characterized in terms of attributes. These attributes consist of the properties of learning disabilities. By finding the relationship between these attributes, the redundant attributes can be eliminated and core attributes determined. Also, rule mining is performed in rough sets using the algorithm LEM1. The prediction of LD is accurately done by using Rosetta, the rough set tool kit for analysis of data. The result obtained from this study is compared with the output of a similar study conducted by us using Support Vector Machine (SVM) with Sequential Minimal Optimisation (SMO) algorithm. It is found that, using the concepts of reduct and global covering, we can easily predict the learning disabilities in children

Simultaneous Embeddings Of Graphs As Median And Antimedian Subgraphs

The distance DG(v) of a vertex v in an undirected graph G is the sum of the distances between v and all other vertices of G. The set of vertices in G with maximum (minimum) distance is the antimedian (median) set of a graph G. It is proved that for arbitrary graphs G and J and a positive integer r 2, there exists a connected graph H such that G is the antimedian and J the median subgraphs of H, respectively, and that dH(G, J) = r. When both G and J are connected, G and J can in addition be made convex subgraphs of H.

Median Sets and Median Number of a Graph

A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.

On The Center Sets and Center Numbers of Some Graph Classes

For a set S of vertices and the vertex v in a connected graph G, max x2S d(x, v) is called the S-eccentricity of v in G. The set of vertices with minimum S-eccentricity is called the S-center of G. Any set A of vertices of G such that A is an S-center for some set S of vertices of G is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, Km,n, Kn −e, wheel graphs, odd cycles and symmetric even graphs and enumerate them for many of these graph classes. We also introduce the concept of center number which is defined as the number of distinct center sets of a graph and determine the center number of some graph classes

Fair Sets of Some Classes of Graphs

Given a non empty set S of vertices of a graph, the partiality of a vertex with respect to S is the di erence between maximum and minimum of the distances of the vertex to the vertices of S. The vertices with minimum partiality constitute the fair center of the set. Any vertex set which is the fair center of some set of vertices is called a fair set. In this paper we prove that the induced subgraph of any fair set is connected in the case of trees and characterise block graphs as the class of chordal graphs for which the induced subgraph of all fair sets are connected. The fair sets of Kn, Km;n, Kn e, wheel graphs, odd cycles and symmetric even graphs are identi ed. The fair sets of the Cartesian product graphs are also discussed

A study on semigroup action on fuzzy subsets, inverse fuzzy automata and related topics

This thesis comprises five chapters including the introductory chapter. This includes a brief introduction and basic definitions of fuzzy set theory and its applications, semigroup action on sets, finite semigroup theory, its application in automata theory along with references which are used in this thesis. In the second chapter we defined an S-fuzzy subset of X with the extension of the notion of semigroup action of S on X to semigroup action of S on to a fuzzy subset of X using Zadeh's maximal extension principal and proved some results based on this. We also defined an S-fuzzy morphism between two S-fuzzy subsets of X and they together form a category S FSETX. Some general properties and special objects in this category are studied and finally proved that S SET and S FSET are categorically equivalent. Further we tried to generalize this concept to the action of a fuzzy semigroup on fuzzy subsets. As an application, using the above idea, we convert a _nite state automaton to a finite fuzzy state automaton. A classical automata determine whether a word is accepted by the automaton where as a _nite fuzzy state automaton determine the degree of acceptance of the word by the automaton. 1.5. Summary of the Thesis 17 In the third chapter we de_ne regular and inverse fuzzy automata, its construction, and prove that the corresponding transition monoids are regular and inverse monoids respectively. The languages accepted by an inverse fuzzy automata is an inverse fuzzy language and we give a characterization of an inverse fuzzy language. We study some of its algebraic properties and prove that the collection IFL on an alphabet does not form a variety since it is not closed under inverse homomorphic images. We also prove some results based on the fact that a semigroup is inverse if and only if idempotents commute and every L-class or R-class contains a unique idempotent. Fourth chapter includes a study of the structure of the automorphism group of a deterministic faithful inverse fuzzy automaton and prove that it is equal to a subgroup of the inverse monoid of all one-one partial fuzzy transformations on the state set. In the fifth chapter we define min-weighted and max-weighted power automata study some of its algebraic properties and prove that a fuzzy automaton and the fuzzy power automata associated with it have the same transition monoids. The thesis ends with a conclusion of the work done and the scope of further study.

Mining minimal non-redundant association rules using frequent closed itemsets

The problem of the relevance and the usefulness of extracted association rules is of primary importance because, in the majority of cases, real-life databases lead to several thousands association rules with high confidence and among which are many redundancies. Using the closure of the Galois connection, we define two new bases for association rules which union is a generating set for all valid association rules with support and confidence. These bases are characterized using frequent closed itemsets and their generators; they consist of the non-redundant exact and approximate association rules having minimal antecedents and maximal consequences, i.e. the most relevant association rules. Algorithms for extracting these bases are presented and results of experiments carried out on real-life databases show that the proposed bases are useful, and that their generation is not time consuming.