2006, Vol. XIII, Núm. 1
http://hdl.handle.net/2099/3538
2020-01-21T06:09:19ZAn orthogonality-based classification of conjectures in ortholattices
http://hdl.handle.net/2099/3657
An orthogonality-based classification of conjectures in ortholattices
Trillas i Gay, Enric; Pradera Gómez, Ana
A mathematical model for conjectures (including hypotheses, consequences and speculations), was recently introduced, in the context of ortholattices, by Trillas, Cubillo and Castiñeira (Artificial Intelligence 117, 2000, 255-257). The aim of the present paper is to further clarify the structure of this model by studying its relationships with one of the most important ortholattices' relation, the orthogonality relation. The particular case of orthomodular lattices -the framework for both Boolean and quantum logics- is specifically taken into account.; [Reviewed by Vinayak V. Joshi]-
-In the present paper, the authors prove results regarding the orthogonality of the elements of the set of strict conjectures with $p_{\wedge}$ in ortholattices; their results may be summarized as follows:
1. The only conjectures which are always left-orthogonal to $p_{\wedge}$ are consequences, whereas hypotheses are the only ones which are always right-orthogonal. But in the case of orthomodular lattices, consequences and hypotheses both are orthogonal to $p_{\wedge}$.
2. In general, it is possible to find conjectures of any kind (consequences, hypotheses or speculations of the two types) that are both left- and right-orthogonal to $p_{\wedge}$.
3. A conjecture that is neither left- nor right-orthogonal to $p_{\wedge}$ is necessarily a speculation.
2007-10-09T08:39:17ZTrillas i Gay, EnricPradera Gómez, AnaA mathematical model for conjectures (including hypotheses, consequences and speculations), was recently introduced, in the context of ortholattices, by Trillas, Cubillo and Castiñeira (Artificial Intelligence 117, 2000, 255-257). The aim of the present paper is to further clarify the structure of this model by studying its relationships with one of the most important ortholattices' relation, the orthogonality relation. The particular case of orthomodular lattices -the framework for both Boolean and quantum logics- is specifically taken into account.
[Reviewed by Vinayak V. Joshi]-
-In the present paper, the authors prove results regarding the orthogonality of the elements of the set of strict conjectures with $p_{\wedge}$ in ortholattices; their results may be summarized as follows:
1. The only conjectures which are always left-orthogonal to $p_{\wedge}$ are consequences, whereas hypotheses are the only ones which are always right-orthogonal. But in the case of orthomodular lattices, consequences and hypotheses both are orthogonal to $p_{\wedge}$.
2. In general, it is possible to find conjectures of any kind (consequences, hypotheses or speculations of the two types) that are both left- and right-orthogonal to $p_{\wedge}$.
3. A conjecture that is neither left- nor right-orthogonal to $p_{\wedge}$ is necessarily a speculation.Fuzzy coalitional structures (alternatives)
http://hdl.handle.net/2099/3656
Fuzzy coalitional structures (alternatives)
Mareš, Milan; Vlach, Milan
The uncertainty of expectations and vagueness of the interests belong to
natural components of cooperative situations, in general. Therefore, some
kind of formalization of uncertainty and vagueness should be included in
realistic models of cooperative behaviour. This paper attempts to contribute
to the endeavour of designing a universal model of vagueness in cooperative
situations. Namely, some initial auxiliary steps toward the development of
such a model are described. We use the concept of fuzzy coalitions suggested
in [1], discuss the concepts of superadditivity and convexity, and introduce a
concept of the coalitional structure of fuzzy coalitions.
The first version of this paper [10] was presented at the Czech-Japan
Seminar in Valtice 2003. It was obvious that the roots of some open questions
can be found in the concept of superadditivity (with consequences on some
other related concepts), which deserve more attention. This version of the
paper extends the previous one by discussion of alternative approaches to
this topic.
2007-10-09T08:37:05ZMareš, MilanVlach, MilanThe uncertainty of expectations and vagueness of the interests belong to
natural components of cooperative situations, in general. Therefore, some
kind of formalization of uncertainty and vagueness should be included in
realistic models of cooperative behaviour. This paper attempts to contribute
to the endeavour of designing a universal model of vagueness in cooperative
situations. Namely, some initial auxiliary steps toward the development of
such a model are described. We use the concept of fuzzy coalitions suggested
in [1], discuss the concepts of superadditivity and convexity, and introduce a
concept of the coalitional structure of fuzzy coalitions.
The first version of this paper [10] was presented at the Czech-Japan
Seminar in Valtice 2003. It was obvious that the roots of some open questions
can be found in the concept of superadditivity (with consequences on some
other related concepts), which deserve more attention. This version of the
paper extends the previous one by discussion of alternative approaches to
this topic.Dual commutative hyper-K-idelas of type 1 in hyper K-algebras of order 3
http://hdl.handle.net/2099/3655
Dual commutative hyper-K-idelas of type 1 in hyper K-algebras of order 3
Torkzadeh, Lida; Zahedi, Mohammad Mehdi
In this note we classify the bounded hyper K-algebras of order 3, which
have D1 = {1}, D2 = {1, 2} and D3 = {0, 1} as a dual commutative hyper
K-ideal of type 1. In this regard we show that there are such non-isomorphic
bounded hyper K-algebras.
2007-10-09T08:35:58ZTorkzadeh, LidaZahedi, Mohammad MehdiIn this note we classify the bounded hyper K-algebras of order 3, which
have D1 = {1}, D2 = {1, 2} and D3 = {0, 1} as a dual commutative hyper
K-ideal of type 1. In this regard we show that there are such non-isomorphic
bounded hyper K-algebras.A model of routine lifetime optimization with linguistic knowledge in wireless ad-hoc networks
http://hdl.handle.net/2099/3654
A model of routine lifetime optimization with linguistic knowledge in wireless ad-hoc networks
Natsheh, Essam; Khatum, Sabira; Jantan, Adznan B.
Ad-hoc On-Demand Distance Vector (AODV) routing protocol has been
and continues to be a very active and fruitful research protocol since its
introduction in the wireless ad-hoc networks. AODV uses a static value for its
route lifetime parameter called Active Route Timeout (ART) which indicates
the time that the route can stay active in the routing table. Route lifetime may
be more accurately determined dynamically via measurement, instead of
static value. To accomplish this, the fuzzy logic system is used to obtain
adaptive values for ART depending on the situation of the transmitter and
intermediate nodes. To study the effect of various parameters on ART, three
design methods for fuzzy ART are proposed here, namely: fuzzy-SKP, fuzzy-
Power, and fuzzy-Comb. Analysis shows that the proposed design methods
are quite efficient and superior to the conventional design method with
respect to routing overhead (25%) and average end-to-end delay (41%).
Hence, the proposed fuzzy system is able to optimize ART efficiently.
2007-10-09T08:35:35ZNatsheh, EssamKhatum, SabiraJantan, Adznan B.Ad-hoc On-Demand Distance Vector (AODV) routing protocol has been
and continues to be a very active and fruitful research protocol since its
introduction in the wireless ad-hoc networks. AODV uses a static value for its
route lifetime parameter called Active Route Timeout (ART) which indicates
the time that the route can stay active in the routing table. Route lifetime may
be more accurately determined dynamically via measurement, instead of
static value. To accomplish this, the fuzzy logic system is used to obtain
adaptive values for ART depending on the situation of the transmitter and
intermediate nodes. To study the effect of various parameters on ART, three
design methods for fuzzy ART are proposed here, namely: fuzzy-SKP, fuzzy-
Power, and fuzzy-Comb. Analysis shows that the proposed design methods
are quite efficient and superior to the conventional design method with
respect to routing overhead (25%) and average end-to-end delay (41%).
Hence, the proposed fuzzy system is able to optimize ART efficiently.Dynamic gridmaps: comparing building techniques
http://hdl.handle.net/2099/3653
Dynamic gridmaps: comparing building techniques
Cañas Planas, José María; Matellán Olivera, Vicente
Mobile robots need to represent obstacles in their surroundings, even
moving ones, to make right movement decisions. For higher autonomy the
robot should automatically build such representation from its sensory input.
This paper compares the dynamic character of several gridmap building techniques:
probabilistic, fuzzy, theory of evidence and histogramic. Two criteria
are defined to rank such dynamism in the representation: time to show a new
obstacle and time to show a new hole. The update rules for first three such
techniques hold associative property which confers them static character, inconvenient
for dynamic environments. Major contribution of this paper is the
introduction of two new approaches are presented to improve the perception
of mobile obstacles: one uses a differential equation to update the map and
another uses majority voting in a limited memory per cell. Their dynamisms
are also evaluated and the results presented.
2007-10-09T08:34:17ZCañas Planas, José MaríaMatellán Olivera, VicenteMobile robots need to represent obstacles in their surroundings, even
moving ones, to make right movement decisions. For higher autonomy the
robot should automatically build such representation from its sensory input.
This paper compares the dynamic character of several gridmap building techniques:
probabilistic, fuzzy, theory of evidence and histogramic. Two criteria
are defined to rank such dynamism in the representation: time to show a new
obstacle and time to show a new hole. The update rules for first three such
techniques hold associative property which confers them static character, inconvenient
for dynamic environments. Major contribution of this paper is the
introduction of two new approaches are presented to improve the perception
of mobile obstacles: one uses a differential equation to update the map and
another uses majority voting in a limited memory per cell. Their dynamisms
are also evaluated and the results presented.