Definitions of two different ways of coarsening of basic belief assignments to opinions the simple coarsening and the normal coarsening are recalled in this contribution. A relation of results of combination of the normal opinions using the consensus operator to belief functions on an original n-element frame of discernment is examined. A questionable meaning of the normal coarsening is discussed.

In this study we engage in belief processing which enables managing of multiple and overlapping elements of a frame of discernment. Our focus is directed on DSm approach, which was originally introduced as a generalization of the Dempster-Shafer theory. Paradoxically, later it was presented also as a special case of the Dempster-Shafer approach applied on such frame of discernment. In this paper we discuss what is new in DSm approach, what are the benefits of DSm approach, and what is its real contribution to belief function theory.

Principal ideas of the minC combination are recalled. A mathematical structure of generalized frames of discernment is formalized. A generalized schema for a computation of the minC combination is presented. Conflicting belief masses redistribution among non-conflicting focal elements is overviewed. Final general formulas for computation of the minC combination are presented. Some examples of computation of the minC combination follow. Related works and approaches are referred in the end.

V tomto příspěvku se zbýváme extrakcí informací z webových zdrojů převážně textového charakteru. K tomuto účelu jsme se pokusili využít několik lingvistických nástrojů pro zpracování přirozeného textu v češtině. Jmenovitě se jedná o nástroje pražského projektu PDT a český WordNet. Cílem příspěvku je přiblížit možnosti, které tyto nástroje pro extrakci informací z textu poskytují. Extrakcí informací se zde zabýváme především v kontextu sémantického webu a zkoumáme možnosti, jak tyto nástroje využít pro automatizaci sémantické anotace stránek současného webu.

V tomto příspěvku je popsán přístup k virtuální integraci dat využívající současných principů, metod a nástrojů sémantického webu. Přístup pracuje s daty ve formátu RDF a předpokládá dostupnost ontologií, které je popisují. Ontologie jsou základem pro všechny kroky prezentovaného integračního procesu. Jsou využity jak k určení vztahů mezi daty a poskytovaným integrovaným pohledem, tak i k zápisu nalezených korespondencí. Ty jsou dále použity při zpracování dotazů kladených na integrovaná data.

Článek se zabývá přístupem, jak se pokusit zautomatizovat mnohdy netriviální úlohu nalezení pravidel pro integraci dat. Předkládaný přístup automaticky generuje kandidáty pravidel včetně jejich ohodnocení pomocí nepřímé míry definující jejich prioritu. Priorita může následně být použita buďto návrhářem (člověkem) jako pomocný prvek pro přípravu návrhu, nebo při automatickém návrhu integračního procesu zahrnující pravidla s maximální prioritou. Studie v příspěvku se detailně věnuje dvěma základním typům pravidel, ekvivalenci a hierarchii, přičemž ohodnocení kandidátů je založeno na (strukturální) analýze aktivních domén atributů. V neposlední řadě příspěvek ukazuje možnost decentralizovaného přístupu k integraci dat, jenž je inspirován webovými technologiemi.

The notion of preference poses a new prospect of personalization of database queries. In addition, it can be exploited to optimize query execution. Indeed, a novel optimization technique involving preference is developed, and its algorithm presented.

A formalism for the logical description of computational agents and multi-agent systems is given. It is explained how it such a formal description can be used to configure and reason about multi-agent systems realizing computational intelligence models. A usage within a real software system Bang 3 is demonstrated. A way to extend the system toward dynamic environments with migrating agents is discussed.

This work deals with a problem of automatic composition of multi-agent system satisfying given constraints. A general concept of representation of connected groups of agents (schemes) within a multi-agent system is introduced and utilized for automatic building of schemes to solve a given computational intelligence task. We propose a combination of an evolutionary algorithm and a formal logic resolution system which is able to propose and verify new schemes. The approach is illustrated on simple examples.

Amorphous computing differs from the classical ideas about computations almost in every aspect. The architecture of amorphous computers is random, since they consist of a plethora of identical computational units spread randomly over a given area. Within a limited radius the units can communicate wirelessly with their neighbors via a single-channel radio.We consider a model whose assumptions on the underlying computing and communication abilities are among the weakest possible: all computational units are finite state probabilistic automata working asynchronously, there is no broadcasting collision detection mechanism and no network addresses. We show that under reasonable probabilistic assumptions such amorphous computing systems can possess universal computing power with a high probability. The underlying theory makes use of properties of random graphs and that of probabilistic analysis of algorithms. To the best of our knowledge this is the first result showing the universality of such computing systems.

Zatímco dílčí ontologie pokrývají jeden pohled na úzce vymezenou oblast, mnohé aplikace vyžadují obecnější přístup k popisovaným datům. Z tohoto důvodu se přistupuje ke srovnávání ontologií (Ontology Matching), které, pokud je to možné, transformuje několik různých ontologických popisů do jediného. Příspěvek popisuje případovou studii takového procesu za využití různých metod, srovnává jejich úspěšnost a diskutuje možnost využití dílčích výsledků k definici výsledné ontologie. Pro experiment byly nezávisle vytvořeny dvě triviální ontologie, které byly různými nástroji a metodami integrovány do jedné.

Vize sémantického webu byla představena před skoro již 10 lety, avšak žádná z její aplikací prozatím nedokázala oslovit takové množství lidí, jaké dnes používá web v současné podobě. Příspěvek se věnuje možnostem sémantického webu a přínosům, které může přinést pro koncové uživatele. Nejprve podává přehled o současných technologiích i jejich použití a následně diskutuje možnosti plynoucí z použití odkazů v prostředí sémantického webu tak, jak je známe z webu současného, tedy rozšiřující, zpřesňující či udávající kontext prezentované informace.

We study behavioural patterns learned by a robotic agent by means of two different control and adaptive approaches - a radial basis function neural network trained by evolutionary algorithm, and a traditional reinforcement Q-learning algorithm. In both cases, a set of rules controlling the agent is derived from the learned controllers, and these sets are compared. It is shown that both procedures lead to reasonable and compact, albeit rather different, rule sets.

The thesis deals with security hazards in distributed environments where traditional centralized approaches are only of limited serviceability. One of the very successful model for treating security and access management in distributed systems are so called reputation systems. The main goal of the rep- utation systems is to provide entities in the environment with mechanisms for inferring and building trust consequently used for access control. If the trust between two entities is high enough, transactions are likely to be allowed. The thesis proposes a new security model with trust management system for dynamic and distributed environments with huge number of entities. In dynamic systems new entities or relationships are likely to emerge or existing entities or relationships may often disappear. Such dynamics pose severe problems even for traditional reputation systems. Therefore our approach differs from the traditional ones in the way adopted for establishment and management of trust between entities in our point of view trust is not assigned to particular relationships but the trust is common for a group of entities. In this way, our proposal significantly enhances ability to infer trust between entities with no previous personal experiences with each other or in environments with huge number of entities. For the proposal differs in understanding of trust, it uses a hypergraph model for representation of system of entities. The security model proposed in the thesis contains two algorithms for transformation of a general input graph structure into hypergraph model, an algorithm treating dynamics of the distributed environment and a security subsystem. Our experimental implementation SecGrid utilizes proposed algorithms and it is used for experimental verification of the security models. The experiments investigate ability of the transformation algorithms; in details the dynamic part of our proposal together with the security subsystem proposed specially for the hypergraph model. Experiments show that our model overcame the traditional graph model in many ways especially in dynamic environments with huge amount of entities.

Despite the tremendous research activity in the field of searching engines for the Internet, current searching engines still face some severe limitations. The paper presents an idea of a distributed data source environment to be build on the current state of the art technologies available on the Internet. The paper combines recent advances in the fields of a data inconsistency, a data integration and reputations of sources for further refinements of data searching and sharing processes. The paper generalizes the data binary formalism narrowly connected with the ideas of the semantic web into the <0,1> interval to enable the consideration of uncertainty at various levels.

While partial ontologies cover view at one-track area, many applications require much more general approach to describe their data. On this account it approaches to ontology matching as a headstone of further operations, that can transform several ontological descriptions into one. This paper describe case study of such process with using different methods, confront their fruitfulness and discuss a possibility of using particular results to definition of final ontology. Two trivial ontologies were created (independently of any tool) and they were matched using various selected tools.

A computational model of molecularly communicating mobile nanomachines is de¯ned. Nanomachines are modelled by timed probabilistic automata augmented by a severely restricted communication mechanism. We show that for molecular communication among such machines an asynchronous stochastic protocol originally designed for wireless communication in so-called amorphous computers with static computational units can also be used. We design an algorithm that using randomness and timing delays selects with a high probability a leader from among sets of anonymous candidates. This enables a simulation of counter automata proving that networks of mobile nanomachines possess universal computing power.

We propose a simple yet cognitively powerful architecture of an embodied conscious agent whose functioning is in a good agreement with neurophysiological evidence. Our model differs from other proposals by exploiting two complementary internal world models having a different purpose than that in similar models known from the literature. The first model captures the sensorimotor "syntax" of the agent's behavior and is used for situating the agent in its environment. The second model describes the sensorimotor dynamics of the world and is used for controlling the agent's behavior. Both internal world models are built automatically, autonomously in the course of agent's interaction with the environment and their coop- eration takes care of symbol grounding. We show that the cognitive potential of the proposed model goes substantially beyond that of earlier models since it supports algorithmic processes underlying phenomena similar to higher cognitive functions such as imitation learning and the development of commu- nication, language, thinking and consciousness.

Nastíníme jednoduchou, ale přesto kognitivně účinnou architekturu inteligentního agenta. Model využívá dvou komplementárních vnitřních modelů světa: jeden pro „syntax“ poznaného světa a druhý pro jeho sémantiku. Tyto modely řeší problém porozumění konceptům a podporují algoritmické procesy, jejichž efekty se pro pozorovatele jeví jako projevy vyšších kognitivních funkcí, jakými jsou imitační učení, rozvoj komunikace, řeči, myšlení a vědomí.

Classical models of computation no longer fully correspond to the current notions of computing in modern systems. Even in the sciences, many natural systems are now viewed as systems that compute. Can one devise models of computation that capture the notion of computing as seen today and that could play the same role as Turing machines did for the classical case? We propose two models inspired from key mechanisms of current systems in both artificial and natural environments: evolving automata and interactive Turing machines with advice. The two models represent relevant adjustments in our apprehension of computing: the shift to potentially non-terminating interactive computations, the shift towards systems whose hardware and/or software can change over time, and the shift to computing systems that evolve in an unpredictable, non-uniform way. The two models are shown to be equivalent and both are provably computationally more powerful than the models covered by the old computing paradigm. The models also motivate the extension of classical complexity theory by non-uniform classes, using the computational resources that are natural to these models. Of course, the additional computational power of the models cannot in general be meaningfully exploited in concrete goal-oriented computations.