Search results for "Intelligence"
showing 10 items of 6959 documents
Balls into non-uniform bins
2014
Balls-into-bins games for uniform bins are widely used to model randomized load balancing strategies. Recently, balls-into-bins games have been analysed under the assumption that the selection probabilities for bins are not uniformly distributed. These new models are motivated by properties of many peer-to-peer (P2P) networks, which are not able to perfectly balance the load over the bins. While previous evaluations try to find strategies for uniform bins under non-uniform bin selection probabilities, this paper investigates heterogeneous bins, where the "capacities" of the bins might differ significantly. We show that heterogeneous environments can even help to distribute the load more eve…
Language Recognition Power and Succinctness of Affine Automata
2016
In this work we study a non-linear generalization based on affine transformations of probabilistic and quantum automata proposed recently by Diaz-Caro and Yakaryilmaz [6] referred as affine automata. First, we present efficient simulations of probabilistic and quantum automata by means of affine automata which allows us to characterize the class of exclusive stochastic languages. Then, we initiate a study on the succintness of affine automata. In particular, we show that an infinite family of unary regular languages can be recognized by 2-state affine automata, whereas the number of states of any quantum and probabilistic automata cannot be bounded. Finally, we present the characterization …
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
2007
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
General aggregation operators based on a fuzzy equivalence relation in the context of approximate systems
2016
Our paper deals with special constructions of general aggregation operators, which are based on a fuzzy equivalence relation and provide upper and lower approximations of the pointwise extension of an ordinary aggregation operator. We consider properties of these approximations and explore their role in the context of extensional fuzzy sets with respect to the corresponding equivalence relation. We consider also upper and lower approximations of a t-norm extension of an ordinary aggregation operator. Finally, we describe an approximate system, considering the lattice of all general aggregation operators and the lattice of all fuzzy equivalence relations.
From quantale algebroids to topological spaces: Fixed- and variable-basis approaches
2010
Using the category of quantale algebroids the paper considers a generalization of the classical Papert-Papert-Isbell adjunction between the categories of topological spaces and locales to partial algebraic structures. It also provides a single framework in which to treat the concepts of quasi, standard and stratified fuzzy topology.
L-fuzzy syntopogenous structures, Part I: Fundamentals and application to L-fuzzy topologies, L-fuzzy proximities and L-fuzzy uniformities
2013
Abstract We introduce the concept of an L-fuzzy syntopogenous structure where L is a complete lattice endowed with an implicator ↦ : L × L → L satisfying certain properties (in particular, as L one can take an MV-algebra). As special cases our L-fuzzy syntopogenous structures contain classical Csaszar syntopogenous structures, Katsaras–Petalas fuzzy syntopogenous structures as well as fuzzy syntopogeneous structures introduced in the previous work of the second named author (A. Sostak, Fuzzy syntopogenous structures, Quaest. Math. 20 (1997) 431–461). Basic properties of the category of L-fuzzy syntopogenous spaces are studied; categories of L-fuzzy topological spaces, L-fuzzy proximity spac…
On approximate-type systems generated by L-relations
2014
The aim of this work is to study approximate-type systems induced by L-relations in the framework of the general theory of M-approximate systems introduced in [42] and its generalizations. Special attention is payed to the structural properties of lattices of such systems and to the study of connections between categories of such systems and the corresponding categories of sets endowed with L-relations.
A Decomposition Theorem for the Fuzzy Henstock Integral
2012
We study the fuzzy Henstock and the fuzzy McShane integrals for fuzzy-number valued functions. The main purpose of this paper is to establish the following decomposition theorem: a fuzzy-number valued function is fuzzy Henstock integrable if and only if it can be represented as a sum of a fuzzy McShane integrable fuzzy-number valued function and of a fuzzy Henstock integrable fuzzy number valued function generated by a Henstock integrable function.
Two integrals and some modified versions — Critical remarks
1986
The aim of this paper is to discuss different constructions of integrals (Sections 3 and 4) based on @?-decomposable measures (Section 1). According to the classification of the continuous t-conorms @? in essentially two types namely v and Archimedean t-conorms, there exist mainly two types of integrals namely the constructions of Sugeno (Section 3) and of Weber (Section 4). Further constructions corresponding to the Archimedean case result to be special cases or not well defined (Section 4). In all cases a crucial property is some restricted distribution law for the pair (@?, ) with an appropriate operation(Section 2). Some applications shall illustrate the use of the two integrals (Sectio…
A general concept of fuzzy connectives, negations and implications based on t-norms and t-conorms
1983
All known connectives 'and'/'or' for fuzzy sets or some classes can be introduced as t-norms/t-conorms, where Ling's representation theorem is used as a basic tool, and which is illustrated by various known and new examples (Section 2). Given a strict negation function and one connective, the other can be constructed, so that the corresponding De Morgan law is valid. In case of given Archimedean connectives, there can be constructed negation functions (Section 3). Given a non-strict Archimedean connective, a negation function and the other connective can be constructed, so that in addition to the De Morgan laws, the excluded middle law and the law of non-contradiction are valid, i.e. the ne…