Multi-agent systems typically utilize a non-blocking asynchronous communication in order to achieve required flexibility and adaptability. High performance computing techniques exploit the current hardware ability of overlapping asynchronous communication with computation to load the available computer resources efficiently. On the contrary, widely used parallel processes modeling methodologies do not often allow for an asynchronous communication description. At the same time those models do not allow their user to select the granularity level and provide only a fixed set of machine and algorithm description quantities. In this work we addressed this issue and designed a new parallel processes modeling methodology. Its main features include an open set of atomic operations that are calculated and predicted for the algorithm in question, and the computer aided semi-automatic measuring of operation counts and approximation of cost functions. This allows not only for tuning the model granularity as well as accuracy according to user needs, but also to reach a such description complexity that would be very difficult to obtain without any computer aid.

Multi-agent systems typically utilize a non-blocking asynchronous communication in order to achieve required flexibility and adaptability. High performance computing techniques exploit the current hardware ability of overlapping asynchronous communication with computation to load the available computer resources efficiently. On the contrary, widely used parallel processes modeling methodologies do not often allow for an asynchronous communication description. At the same time those models do not allow their user to select the granularity level and provide only a fixed set of machine and algorithm description quantities. In this work we addressed this issue and designed a new parallel processes modeling methodology. Its main features include an open set of atomic operations that are calculated and predicted for the algorithm in question, and the computer aided semi-automatic measuring of operation counts and approximation of cost functions. This allows not only for tuning the model granularity as well as accuracy according to user needs, but also to reach a such description complexity that would be very difficult to obtain without any computer aid. We demonstrated that our approach gives good results on the parallel implementation of a selected generalized genetic algorithm. A model was constructed and its predictions compared with the reality on various computer architectures, including one parallel cluster machine. We also designed and implemented an open multi-agent system suitable for the above mentioned experiments and many others. This system synthesizes the areas of high performance computing, multi-agent systems and computational intelligence into an efficient and flexible means of running experiments.

World Wide Web obsahuje data, která jsou pro počítačové programy nesrozumitelná. Následkem toho je na něm obtížné některé věci zautomatizovat. Nedostatky současného webu by měl odstranit sémantický web, ve kterém data budou mít přesně popsaný význam. Zlepšení může přinést také v oblasti integrace, která je v případě dat pocházejících z webu velmi obtížná. Tento článek se zabývá integrací webových dat. Zaměřuje se na relační data ve formátu XML a navrhuje postupy základních integračních operací.

This paper describes an option to express our preferences in the framework of relational databases. Preferences have usually a form of a partial ordering. Therefore the question is how to deliver the semantics of ordering to a database system. The answer is quite straightforward.

Příspěvek popisuje provedenou studii proveditelnosti databázově orientované části systému zajišťujícím automatickou extrakci dat z webových zdrojů (formáty XHTML, XML, CSV). Úkolem této části je transformace dat do automaticky vygenerovaného relačního modelu, který může být následně užit pro realizaci myšlenek sémantického webu. V úvodní části je uvedena motivace pro implementaci takového nástroje. Součástí příspěvku je i částečné ohlédnutí za již implementovanými metodami, které autor v současné době zpracovává. V poslední části je nastíněna fuzzyfikace problematiky.

Advances in cellular mobile technology have engendered a new paradigm of computing, called mobile computing. New challenges have arisen and solutions are proposed based on various approaches. One of the most important challenges is security and now a day has been found ubiquitous in computing as whole. The paper is intended as a quick survey emphasizing security paradigm and also ad hoc networks are kept in mind and briefly discussed.

A multi-agent system targeted toward the area of computational intelligence modeling is presented. The purpose of the system is to allow both experiments and high-performance distributed computations employing hybrid computational models. The focus of the system is the interchangeability of computational components, their autonomous behavior, and emergence of new models.

We discuss two approaches to supervised learning, namely regularization networks and RBF networks, and demonstrate their performance on experiments. We claim that the performance of these two models is comparable, so the RBF networks can be used as a cheaper alternative to regularization networks.

Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing rho-operators into RDF querying engines which will enable discovering such relationships viable. The cornerstone of such implementation is creating an index which describes the original RDF graoh. The index is created by recursive application of a transformation of graph to forest of trees and then to each tree its extended signature is created. The signatures are accompanied by the additional information about transformed problematic nodes breaking the tree structure. The components described by the signatures are assumed as a single node in the following step. The transitions between the signatures represent edges.