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.

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

Fuzzy Absolutes and Related Topics

The study on the fuzzy absolutes and related topics. The different kinds of extensions especially compactification formed a major area of study in topology. Perfect continuous mappings always preserve certain topological properties. The concept of Fuzzy sets introduced by the American Cyberneticist L. A Zadeh started a revolution in every branch of knowledge and in particular in every branch of mathematics. Fuzziness is a kind of uncertainty and uncertainty of a symbol lies in the lack of well-defined boundaries of the set of objects to which this symbol belongs. Introduce an s-continuous mapping from a topological space to a fuzzy topological space and prove that the image of an H-closed space under an s-continuous mapping is f-H closed. Here also proved that the arbitrary product fi and sum of  fi of the s-continuous maps fi are also s-continuous. The original motivation behind the study of absolutes was the problem of characterizing the projective objects in the category of compact spaces and continuous functions.

Study on Fuzzy Ordered FuzzyTopological Spaces

In this study we combine the notions of fuzzy order and fuzzy topology of Chang and define fuzzy ordered fuzzy topological space. Its various properties are analysed. Product, quotient, union and intersection of fuzzy orders are introduced. Besides, fuzzy order preserving maps and various fuzzy completeness are investigated. Finally an attempt is made to study the notion of generalized fuzzy ordered fuzzy topological space by considering fuzzy order defined on a fuzzy subset.

Pseudo-Compact Semi-Topological Groups

Митрофан М. Чобан, Петър Ст. Кендеров, Уорън Б. Муурс - Полу-топологична група (съответно, топологична група) е група, снабдена с топология, относно която груповата оперция произведение е частично непрекъсната по всяка от променливите (съответно, непрекъсната по съвкупност от променливите и обратната операция е също непрекъсната). В настоящата работа ние даваме условия, от топологичен характер, една полу-топологична група да е всъщност топологична група. Например, ние показваме, че всяка сепарабелна псевдокомпактна полу-топологична група е топологична група. Показваме също, че всяка локално псевдокомпактна полу-топологична група, чиято групова операция е непрекъсната по съвкупност от променливите е топологична група.

Lindelof spaces which are indestructible, productive, or D

We discuss relationships in Lindelof spaces among the properties "indestructible". "productive", "D", and related properties. (C) 2011 Elsevier B.V. All rights reserved.

Current AI in games : a review

As the graphics race subsides and gamers grow weary of predictable and deterministic game characters, game developers must put aside their “old faithful” finite state machines and look to more advanced techniques that give the users the gaming experience they crave. The next industry breakthrough will be with characters that behave realistically and that can learn and adapt, rather than more polygons, higher resolution textures and more frames-per-second. This paper explores the various artificial intelligence techniques that are currently being used by game developers, as well as techniques that are new to the industry. The techniques covered in this paper are finite state machines, scripting, agents, flocking, fuzzy logic and fuzzy state machines decision trees, neural networks, genetic algorithms and extensible AI. This paper introduces each of these technique, explains how they can be applied to games and how commercial games are currently making use of them. Finally, the effectiveness of these techniques and their future role in the industry are evaluated.

Playing Games on Sets and Models

The most prominent objective of the thesis is the development of the generalized descriptive set theory, as we call it. There, we study the space of all functions from a fixed uncountable cardinal to itself, or to a finite set of size two. These correspond to generalized notions of the universal Baire space (functions from natural numbers to themselves with the product topology) and the Cantor space (functions from natural numbers to the {0,1}-set) respectively. We generalize the notion of Borel sets in three different ways and study the corresponding Borel structures with the aims of generalizing classical theorems of descriptive set theory or providing counter examples. In particular we are interested in equivalence relations on these spaces and their Borel reducibility to each other. The last chapter shows, using game-theoretic techniques, that the order of Borel equivalence relations under Borel reduciblity has very high complexity. The techniques in the above described set theoretical side of the thesis include forcing, general topological notions such as meager sets and combinatorial games of infinite length. By coding uncountable models to functions, we are able to apply the understanding of the generalized descriptive set theory to the model theory of uncountable models. The links between the theorems of model theory (including Shelah's classification theory) and the theorems in pure set theory are provided using game theoretic techniques from Ehrenfeucht-Fraïssé games in model theory to cub-games in set theory. The bottom line of the research declairs that the descriptive (set theoretic) complexity of an isomorphism relation of a first-order definable model class goes in synch with the stability theoretical complexity of the corresponding first-order theory. The first chapter of the thesis has slightly different focus and is purely concerned with a certain modification of the well known Ehrenfeucht-Fraïssé games. There we (me and my supervisor Tapani Hyttinen) answer some natural questions about that game mainly concerning determinacy and its relation to the standard EF-game

Utilizando mapas de conectividade fuzzy no desenvolvimento de algoritmos reparadores de imagens binárias 3D

A 3D binary image is considered well-composed if, and only if, the union of the faces shared by the foreground and background voxels of the image is a surface in R3. Wellcomposed images have some desirable topological properties, which allow us to simplify and optimize algorithms that are widely used in computer graphics, computer vision and image processing. These advantages have fostered the development of algorithms to repair bi-dimensional (2D) and three-dimensional (3D) images that are not well-composed. These algorithms are known as repairing algorithms. In this dissertation, we propose two repairing algorithms, one randomized and one deterministic. Both algorithms are capable of making topological repairs in 3D binary images, producing well-composed images similar to the original images. The key idea behind both algorithms is to iteratively change the assigned color of some points in the input image from 0 (background)to 1 (foreground) until the image becomes well-composed. The points whose colors are changed by the algorithms are chosen according to their values in the fuzzy connectivity map resulting from the image segmentation process. The use of the fuzzy connectivity map ensures that a subset of points chosen by the algorithm at any given iteration is the one with the least affinity with the background among all possible choices

Lógica BDI fuzzy

Intendding to understand how the human mind operates, some philosophers and psycologists began to study about rationality. Theories were built from those studies and nowadays that interest have been extended to many other areas such as computing engineering and computing science, but with a minimal distinction at its goal: to understand the mind operational proccess and apply it on agents modelling to become possible the implementation (of softwares or hardwares) with the agent-oriented paradigm where agents are able to deliberate their own plans of actions. In computing science, the sub-area of multiagents systems has progressed using several works concerning artificial intelligence, computational logic, distributed systems, games theory and even philosophy and psycology. This present work hopes to show how it can be get a logical formalisation extention of a rational agents architecture model called BDI (based in a philosophic Bratman s Theory) in which agents are capable to deliberate actions from its beliefs, desires and intentions. The formalisation of this model is called BDI logic and it is a modal logic (in general it is a branching time logic) with three access relations: B, D and I. And here, it will show two possible extentions that tranform BDI logic in a modal-fuzzy logic where the formulae and the access relations can be evaluated by values from the interval [0,1]

The Meaningful Fractal Fuzzy Dimension Applied to the Design of Self Organizing Maps

This paper presents the principal results of a detailed study about the use of the Meaningful Fractal Fuzzy Dimension measure in the problem in determining adequately the topological dimension of output space of a Self-Organizing Map. This fractal measure is conceived by combining the Fractals Theory and Fuzzy Approximate Reasoning. In this work this measure was applied on the dataset in order to obtain a priori knowledge, which is used to support the decision making about the SOM output space design. Several maps were designed with this approach and their evaluations are discussed here.

Um modelo fuzzy-dea-game para estratégias de produção sob incerteza

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)