2002, Vol. IX, Núm. 1
http://hdl.handle.net/2099/2075
2019-09-18T09:10:06ZFlexible information retrieval: some research trends
http://hdl.handle.net/2099/3621
Flexible information retrieval: some research trends
Pasi, Gabriella
In this paper some research trends in the field of Information Retrieval are presented. The focus is on the definition of flexible systems, i.e. systems that can represent and manage the vagueness and uncertainty which is characteristic of the process of information searching and retrieval. In this paper the application of soft computing techniques is considered, in particular fuzzy set theory.
2007-10-02T10:48:05ZPasi, GabriellaIn this paper some research trends in the field of Information Retrieval are presented. The focus is on the definition of flexible systems, i.e. systems that can represent and manage the vagueness and uncertainty which is characteristic of the process of information searching and retrieval. In this paper the application of soft computing techniques is considered, in particular fuzzy set theory.Fuzzy controller applications in stand-alone photovoltaic systems
http://hdl.handle.net/2099/3620
Fuzzy controller applications in stand-alone photovoltaic systems
Cañada Bago, Joaquín; García Galán, Sebastián; Aguilera García, Jorge; Velasco Pérez, Juan Ramón; Magdalena Layos, Luis
One of foremost problems in stand-alone photovoltaic systems consists on the
election of a strategy for charge controllers. The charge controllers main
function is the accumulation system protection, and this leads to an extension
of the batteries lifetime, thus reducing, the long term economic cost of the
installation. This document describes a Fuzzy Logic based charge controller.
In order to show the designed charge controller operation, firstly, a
succession of simulations have been carried out to try out the mentioned
controller efficiency. Afterwards, the designed charge controller has been used
on a real target system to control the charge and discharge processes of a
battery in a real stand-alone photovoltaic system, that is installed, on the
flat roof of the E.P.S. Jaén of the University of Jaén (Spain). Finally,
comparative operation results of the fuzzy charge controller developed are
exposed in this document.
2007-10-02T10:39:34ZCañada Bago, JoaquínGarcía Galán, SebastiánAguilera García, JorgeVelasco Pérez, Juan RamónMagdalena Layos, LuisOne of foremost problems in stand-alone photovoltaic systems consists on the
election of a strategy for charge controllers. The charge controllers main
function is the accumulation system protection, and this leads to an extension
of the batteries lifetime, thus reducing, the long term economic cost of the
installation. This document describes a Fuzzy Logic based charge controller.
In order to show the designed charge controller operation, firstly, a
succession of simulations have been carried out to try out the mentioned
controller efficiency. Afterwards, the designed charge controller has been used
on a real target system to control the charge and discharge processes of a
battery in a real stand-alone photovoltaic system, that is installed, on the
flat roof of the E.P.S. Jaén of the University of Jaén (Spain). Finally,
comparative operation results of the fuzzy charge controller developed are
exposed in this document.Fuzzy multicriteria decision making applied to the strategic plan of Valencia
http://hdl.handle.net/2099/3619
Fuzzy multicriteria decision making applied to the strategic plan of Valencia
Nieto Morote, Ana Mª; Ruz Vila, Francisco
We present a fuzzy multicriteria decision making to get the ranking of several projects presented to the major council of Valencia whose final aim is to define the future urbanistic structure of the city. This technique allows us to deal with such problems that are defined by linguistic (and vague) terms, like the case mentioned below.
2007-10-02T09:53:07ZNieto Morote, Ana MªRuz Vila, FranciscoWe present a fuzzy multicriteria decision making to get the ranking of several projects presented to the major council of Valencia whose final aim is to define the future urbanistic structure of the city. This technique allows us to deal with such problems that are defined by linguistic (and vague) terms, like the case mentioned below.Learning imprecise semantic concepts from image databases
http://hdl.handle.net/2099/3618
Learning imprecise semantic concepts from image databases
Sánchez Fernández, Daniel; Chamorro Martínez, Jesús
In this paper we introduce a model to represent high-level semantic concepts that can be perceived in images. The concepts are learned and represented by means of a set of
association rules that relate the presence of perceptual features to the fulfillment of a concept for a set of images. Since both the set of images where a perceptual feature
appears and the set of images fulfilling a given concept are fuzzy,
particularly because of user's subjectivity,
we use in fact fuzzy association rules for the learning model. The concepts so
acquired are useful in several applications, in particular they provide a new way to
formulate imprecise queries in image databases.
An additional feature of our methodology is that it can capture user's subjectivity.
2007-10-02T09:43:38ZSánchez Fernández, DanielChamorro Martínez, JesúsIn this paper we introduce a model to represent high-level semantic concepts that can be perceived in images. The concepts are learned and represented by means of a set of
association rules that relate the presence of perceptual features to the fulfillment of a concept for a set of images. Since both the set of images where a perceptual feature
appears and the set of images fulfilling a given concept are fuzzy,
particularly because of user's subjectivity,
we use in fact fuzzy association rules for the learning model. The concepts so
acquired are useful in several applications, in particular they provide a new way to
formulate imprecise queries in image databases.
An additional feature of our methodology is that it can capture user's subjectivity.Scalar cardinalities for divisors of a fuzzy cardinality
http://hdl.handle.net/2099/3617
Scalar cardinalities for divisors of a fuzzy cardinality
Casasnovas Casasnovas, Jaime
The cardinality of a finite fuzzy set can be defined as a scalar or
a fuzzy quantity. The fuzzy cardinalities are represented by means
the generalized natural numbers, where it is possible to define
arithmetical operations, in particular the division by a natural
number. The main result obtained in this paper is that, if
determined conditions are assured, the scalar cardinality of a
finite fuzzy set, B, whose fuzzy cardinality is a rational part of
the fuzzy cardinality of another fuzzy set, A, is obtained by the
same division of the scalar cardinality of A.
2007-10-02T09:32:49ZCasasnovas Casasnovas, JaimeThe cardinality of a finite fuzzy set can be defined as a scalar or
a fuzzy quantity. The fuzzy cardinalities are represented by means
the generalized natural numbers, where it is possible to define
arithmetical operations, in particular the division by a natural
number. The main result obtained in this paper is that, if
determined conditions are assured, the scalar cardinality of a
finite fuzzy set, B, whose fuzzy cardinality is a rational part of
the fuzzy cardinality of another fuzzy set, A, is obtained by the
same division of the scalar cardinality of A.Fuzzy Markov chains: uncertain probabilities
http://hdl.handle.net/2099/3616
Fuzzy Markov chains: uncertain probabilities
Buckley, James J.; Eslami, Esfandiar
We consider finite Markov chains where there are
uncertainties in some of the transition probabilities. These
uncertainties are modeled by fuzzy numbers. Using a restricted
fuzzy matrix multiplication we investigate the properties of
regular, and absorbing, fuzzy Markov chains and show that the
basic properties of these classical Markov chains generalize to
fuzzy Markov chains.
2007-10-02T09:26:42ZBuckley, James J.Eslami, EsfandiarWe consider finite Markov chains where there are
uncertainties in some of the transition probabilities. These
uncertainties are modeled by fuzzy numbers. Using a restricted
fuzzy matrix multiplication we investigate the properties of
regular, and absorbing, fuzzy Markov chains and show that the
basic properties of these classical Markov chains generalize to
fuzzy Markov chains.A fuzzy and intuitionistic fuzzy account of the Liar paradox
http://hdl.handle.net/2099/3615
A fuzzy and intuitionistic fuzzy account of the Liar paradox
Nikolov, Nicolai G.
The Liar paradox, or the sentence
"What I am now saying is false." and its various guises have been attracting the attention of
logicians and linguists since ancient times.
A commonly accepted treatment of the Liar paradox [7,8] is by means of Situation semantics, a powerful approach
to natural language analysis. It is based on the machinery of
non-well-founded sets developed in [1]. In this paper we show
how to generalize these results including elements of fuzzy
and intuitionistic fuzzy logic [3,4]. Basing on the results, a way
is proposed towards solving the problem of modelling the two levels of
Situation theory -- infons and propositions -- with a single one
retaining the specific features of the two-levels logics.
2007-10-02T09:18:01ZNikolov, Nicolai G.The Liar paradox, or the sentence
"What I am now saying is false." and its various guises have been attracting the attention of
logicians and linguists since ancient times.
A commonly accepted treatment of the Liar paradox [7,8] is by means of Situation semantics, a powerful approach
to natural language analysis. It is based on the machinery of
non-well-founded sets developed in [1]. In this paper we show
how to generalize these results including elements of fuzzy
and intuitionistic fuzzy logic [3,4]. Basing on the results, a way
is proposed towards solving the problem of modelling the two levels of
Situation theory -- infons and propositions -- with a single one
retaining the specific features of the two-levels logics.Propositional calculus for adjointness lattices
http://hdl.handle.net/2099/3614
Propositional calculus for adjointness lattices
Morsi, Nehad N.; Aziz Mohammed, E. A.; El-Zekey, M. S.
Recently, Morsi has developed a complete syntax for the class of all
adjointness algebras $\left( L,\leq ,A,K,H\right) $. There, $\left( L,\leq
\right) $ is a partially ordered set with top element $1$, $K$ is a
conjunction on $\left( L,\leq \right) $ for which $1$ is a left identity
element, and the two implication-like binary operations $A$ and $H$ on $L$
are adjoints of $K$.
In this paper, we extend that formal system to one for the class $ADJL$ of
all 9-tuples $\left( L,\leq ,1,0,A,K,H,\wedge ,\vee \right) $, called \emph{%
adjointness lattices}; in each of which $\left( L,\leq ,1,0,\wedge ,\vee
\right) $ is a bounded lattice, and $\left( L,\leq ,A,K,H\right) $ is an
adjointness algebra. We call it \emph{Propositional Calculus for Adjointness
Lattices}, abbreviated $AdjLPC$. Our axiom scheme for $AdjLPC$ features four
inference rules and thirteen axioms. We deduce enough theorems and
inferences in $AdjLPC$ to establish its completeness for $ADJL$; by means of
a quotient-algebra structure (a Lindenbaum type of algebra). We study two
negation-like unary operations in an adjointness lattice, defined by means
of $0$ together with $A$ and $H$. We end by developing complete syntax for
all adjointness lattices whose implications are $S$-type implications.
2007-10-02T09:08:32ZMorsi, Nehad N.Aziz Mohammed, E. A.El-Zekey, M. S.Recently, Morsi has developed a complete syntax for the class of all
adjointness algebras $\left( L,\leq ,A,K,H\right) $. There, $\left( L,\leq
\right) $ is a partially ordered set with top element $1$, $K$ is a
conjunction on $\left( L,\leq \right) $ for which $1$ is a left identity
element, and the two implication-like binary operations $A$ and $H$ on $L$
are adjoints of $K$.
In this paper, we extend that formal system to one for the class $ADJL$ of
all 9-tuples $\left( L,\leq ,1,0,A,K,H,\wedge ,\vee \right) $, called \emph{%
adjointness lattices}; in each of which $\left( L,\leq ,1,0,\wedge ,\vee
\right) $ is a bounded lattice, and $\left( L,\leq ,A,K,H\right) $ is an
adjointness algebra. We call it \emph{Propositional Calculus for Adjointness
Lattices}, abbreviated $AdjLPC$. Our axiom scheme for $AdjLPC$ features four
inference rules and thirteen axioms. We deduce enough theorems and
inferences in $AdjLPC$ to establish its completeness for $ADJL$; by means of
a quotient-algebra structure (a Lindenbaum type of algebra). We study two
negation-like unary operations in an adjointness lattice, defined by means
of $0$ together with $A$ and $H$. We end by developing complete syntax for
all adjointness lattices whose implications are $S$-type implications.