Displaying 21 – 40 of 922

Showing per page

A chaos-based secure cluster protocol for wireless sensor networks

Qian Fang, Ying Liu, Xiaoqun Zhao (2008)

Kybernetika

Security mechanisms for wireless sensor networks (WSN) face a great challenge due to the restriction of their small sizes and limited energy. Hence, many protocols for WSN are not designed with the consideration of security. Chaotic cryptosystems have the advantages of high security and little cost of time and space, so this paper proposes a secure cluster routing protocol based on chaotic encryption as well as a conventional symmetric encryption scheme. First, a principal-subordinate chaotic function...

A characterization for residuated implications on the set of all the closed intervals in J[0,1]. Application to the L-fuzzy concept theory.

Cristina Alcalde, Ana Burusco, Ramón Fuentes-González (2005)

Mathware and Soft Computing

In this paper, a new characterization for the interval-valued residuated fuzzy implication operators is presented, with which it is possible to use them in a simple and efficient way, since the calculation of the values of an intervalvalued implication applicated to two intervals is reduced to the study of a fuzzy implication applicated to the extremes of these intervals. This result is very important in order to extract knowledge from an L-fuzzy context with incomplete information. Finally, some...

A Characterization of Multidimensional S -Automatic Sequences

Emilie Charlier, Tomi Kärki, Michel Rigo (2009)

Actes des rencontres du CIRM

An infinite word is S -automatic if, for all n 0 , its ( n + 1 ) st letter is the output of a deterministic automaton fed with the representation of n in the considered numeration system S . In this extended abstract, we consider an analogous definition in a multidimensional setting and present the connection to the shape-symmetric infinite words introduced by Arnaud Maes. More precisely, for d 2 , we state that a multidimensional infinite word x : d Σ over a finite alphabet Σ is S -automatic for some abstract numeration...

A characterization of poly-slender context-free languages

Lucian Ilie, Grzegorz Rozenberg, Arto Salomaa (2010)

RAIRO - Theoretical Informatics and Applications

For a non-negative integer k, we say that a language L is k-poly-slender if the number of words of length n in L is of order 𝒪 ( n k ) . We give a precise characterization of the k-poly-slender context-free languages. The well-known characterization of the k-poly-slender regular languages is an immediate consequence of ours.

A chunking mechanism in a neural system for the parallel processing of propositional production rules.

Ernesto Burattini, A. Pasconcino, Guglielmo Tamburrini (1995)

Mathware and Soft Computing

The problem of extracting more compact rules from a rule-based knowledge base is approached by means of a chunking mechanism implemented via a neural system. Taking advantage of the parallel processing potentialities of neural systems, the computational problem normally arising when introducing chuncking processes is overcome. Also the memory saturation effect is coped with using some sort of forgetting mechanism which allows the system to eliminate previously stored, but less often used chunks....

A classical decision theoretic perspective on worst-case analysis

Moshe Sniedovich (2011)

Applications of Mathematics

We examine worst-case analysis from the standpoint of classical Decision Theory. We elucidate how this analysis is expressed in the framework of Wald's famous Maximin paradigm for decision-making under strict uncertainty. We illustrate the subtlety required in modeling this paradigm by showing that information-gap's robustness model is in fact a Maximin model in disguise.

A classification of rational languages by semilattice-ordered monoids

Libor Polák (2004)

Archivum Mathematicum

We prove here an Eilenberg type theorem: the so-called conjunctive varieties of rational languages correspond to the pseudovarieties of finite semilattice-ordered monoids. Taking complements of members of a conjunctive variety of languages we get a so-called disjunctive variety. We present here a non-trivial example of such a variety together with an equational characterization of the corresponding pseudovariety.

A coalgebraic semantics of subtyping

Erik Poll (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Coalgebras have been proposed as formal basis for the semantics of objects in the sense of object-oriented programming. This paper shows that this semantics provides a smooth interpretation for subtyping, a central notion in object-oriented programming. We show that different characterisations of behavioural subtyping found in the literature can conveniently be expressed in coalgebraic terms. We also investigate the subtle difference between behavioural subtyping and refinement.

A Coalgebraic Semantics of Subtyping

Erik Poll (2010)

RAIRO - Theoretical Informatics and Applications

Coalgebras have been proposed as formal basis for the semantics of objects in the sense of object-oriented programming. This paper shows that this semantics provides a smooth interpretation for subtyping, a central notion in object-oriented programming. We show that different characterisations of behavioural subtyping found in the literature can conveniently be expressed in coalgebraic terms. We also investigate the subtle difference between behavioural subtyping and refinement.

Currently displaying 21 – 40 of 922