This paper describes an approach for mediation of heterogeneous XML schemas. Such an approach is proposed as a tool for XML data integration system. A global XML schema is specified by the designer to provide a homogeneous view over heterogeneous XML data. An XML mediation layer is introduced to manage: (1) establishing appropriate mappings between the global schema and the schemas of the sources; (2) querying XML data sources in terms of the global schema. The XML data sources are described by XML Schema language. The former task is performed through a semi-automatic process that generates local and global paths. A tree structure for each XML schema is constructed and represented by a simple form. This is in turn used for assigning indices manually to match local paths to corresponding global paths. By gathering all paths with the same indices, the equivalent local and global paths are grouped automatically, and an XML Metadata Document is constructed. An XML Query Translator for the latter task is described to translate a global user query into local queries by using the mappings that are defined in the XML Metadata Document.

This paper describes an approach for mediation of heterogeneous XML schemas. Such an approach is proposed as a tool for XML data integration system. A global XML schema is specified by the designer to provide a homogeneous view over heterogeneous XML data. An XML mediation layer is introduced to manage: (1) establishing appropriate mappings between the global schema and the schemas of the sources; (2) querying XML data sources in terms of the global schema. The XML data sources are described by XML Schema language. The former task is performed through a semi-automatic process that generates local and global paths. A tree structure for each XML schema is constructed and represented by a simple form. This is in turn used for assigning indices manually to match local paths to corresponding global paths. By gathering all paths with the same indices, the equivalent local and global paths are grouped automatically, and an XML Metadata Document is constructed. An XML Query Translator for the latter task is described to translate a global user query into local queries by using the mappings that are defined in the XML Metadata Document.

The effort described in this paper introduces an indexing structure for path search in the graph structured data called rho-index. It is based on a graph segmentation S(G) that is meant to represent the indexed graph G in a simpler manor yet having similar properties as the graph G had. This is achieved using graph transformations and a special type of a matrix used to represent the transformed graph.

One of the areas of data integration covers systems that maintain co-herence among a heterogeneous set of databases. Such a system repeatedly col-lects data from the local databases, synchronizes them, and pushes the updates back. One of the key problems in this architecture is the conflict resolution. When data in a less relevant data source changes, it should not cause any data change in a store with higher relevancy. To meet such requirements, we propose a DataPile structure with following main advantages: effective storage of historical versions of data, straightfor-ward adaptation to global schema changes, separation of data conversion and replication logic, simple implementation of data relevance. Key usage of such mechanisms is in projects with following traits or require-ments: integration of heterogeneous data from sources with different reliability, data coherence of databases whose schema differs, data changes are performed on local databases and minimal load on the central database.

During the implementation of an environmental accounting system in a company, one of the most important pieces of information to obtain is a detailed understanding about material flows (raw materials, semi-finished products, final products and wastes) and flows of different types of energy inputs (buying, selling and wastage) when thinking about the consequences on the company. The authors, in the article: 1) study the question of the quantification of the flows, and the accuracy of their measurement, 2) provide an environmental accounting statement, with help of standards and indices, statistical trends analysis.

Příspěvek se zabývá problematikou získávání logických tvrzení z dat, tedy těmi metodami dobývání znalostí z dat (data mining), jejichž výsledky lze vyjádřit v jazyce nějaké formální logiky. Je podán velmi stručný přehled širokého spektra rozmanitých metod tohoto typu, jak metod vycházejících ze statistických přístupů, tak i metod spočívajících na principech strojového učení, a je poukázáno na specifický charakter metod založených na umělých neuronových sítích. Pro ilustraci jsou podrobněji popsány dvě konkrétní metody získávání logických tvrzení z dat. Jednou z nich je metoda Guha, která vychází z observační logiky a je pravděpodobně nejstarší metodou získávání pravidel z dat vůbec. Druhou je metoda založená na po částech lineárních vícevrstvých perceptronech.

Most of information retrieval systems depend on Boolean queries. The performance of an information retrieval system is usually measured in terms of two different criteria, precision and recall. This way, the optimization of any of its components is a clear example of a multiobjective problem. However, although evolutionary algorithms have been widely applied in the information retrieval area, in all of these applications both criteria have been combined in a single scalar fitness function by means of a weighting scheme. In this paper, we deal with using of Genetic algorithms in Information retrieval specially in optimizing of a Boolean query.

Kernel based learning methods are subject of great interest at present. We discuss two kernel based learning methods, namely the Regularization Networks (RN) and the Radial Basis Function Network (RBF networks). The RNs are derived from the regularization theory, had been studied thoroughly from a function approximation point of view, and therefore have very good theoretical background. The RBF networks represent a model of artificial neural networks with both neuro-physiological and mathematical motivation. In addition they may be treated as a generalised form of Regularization Networks, i.e. RN with increased number of kernel functions. We demonstrated the performance of both approaches on experiments, including both benchmark and real-life learning tasks. We claim that the performance of RN and RBF network is comparable in terms of generalisation error. The RN approach usually leads to solutions with higher model complexity (high number of base units). In this situations, the RBF networks can be used as a ’cheaper’ alternative.

Integration has been an acknowledged data processing problem for a long time. However, there is no universal tool for general data integration. Because various data descriptions, data heterogeneity, and machine unreadability, it is not easy way. Improvement in this situation could bring the Semantic Web. Its idea is based on machine understandable web data, which bring us an opportunity of better automated processing. The SemanticWeb is still a future vision, but there are already some features we can use. The paper describes how is integration solved in mediation integration system VirGIS and discusses use of nowadays Semantic Web features to improve it. According to the proposed changes, a new ontology that covers data used in VirGIS is presented.

Ontologies play an important role in a knowledge representation. It involves ontology development as well as ontology re-use. Among various fields, where ontologies can be useful, is the GIS (Geographical Information System) data area. The goal of the research described in this paper is to develop a specific ontology for a given GIS domain. At first, we describe a general methodology and main tools for ontology development. Then a new ontology that covers data used in a VirGIS integration system is presented. The paper describes the VirGIS specified ontology as well as a list of spatio-temporal data ontologies that are available and possible to use for a general data features description.

The paper deals with expressing preferences in the framework of the relational data model. Preferences have usually a form of a partial ordering. Therefore the question arises how to provide the relational data model with such an ordering.

During the implementation of an environmental accounting system in a company, one of the most important pieces of information to obtain is a detailed understanding about material flows (raw materials, semi-finished products, final products and wastes) and flows of different types of energy inputs (buying, selling and wastage) when thinking about the consequences on the company. The authors, in the article: 1) study the question of the quantification of the flows, and the accuracy of their measurement, 2) provide an environmental accounting statement, with help of standards and indices, statistical trends analysis.

We study and design multi-agent systems for computational intelligence modeling. Agents typically reside in a high-performance parallel environment, such as a cluster of computational nodes, and utilize a non-blocking asynchronous communication. The need of accurate predictions of run-time and other characterizations of complex parallel asynchronous processes bring us to design a new parallel model creation methodology. In this article our approach is briefly described and a test case is shown and discussed.

This paper presents BOLE — a new platform for bottomup generation and merging of bio-ontologies. In contrast to other ontology-learning systems that are currently available, BOLE can be characterized by the modular architecture enabling integrating and comparing various methods of the automatic acquisition of semantic relations. We introduce the architecture of the tool and discuss the methodology of the employed synthetic bottom-up approach. OLITE — the central component responsible for the automatic acquisition of semantic relations from texts is described in detail. The presented preliminary results prove the efficiency of the implemented framework. We also provide a brief comparative overview of other relevant approaches and outline the future work on representation of uncertain knowledge for bio-ontology merging.

This paper presents OLE — a new platform for bottom-up generation and merging of ontologies. In contrast to other ontology-learning systems that are currently available, OLE can be characterized by the modular architecture enabling integrating and comparing various methods of the automatic acquisition of semantic relations. We introduce the architecture of the tool and discuss the methodology of the employed synthetic bottom-up approach. OLITE — the central component responsible for the automatic acquisition of semantic relations from texts is described in detail. The presented preliminary results prove the efficiency of the implemented framework. We also provide a brief comparative overview of other relevant approaches and outline the future work on representation of uncertain knowledge for ontology merging.

The need of search mechanisms based on data content rather then attributes values has recently lead to formation of the metric-based similarity retrieval. The computational complexity of such retrieval and the large volume of processed data call for distributed processing. In this paper, we propose chiDistance, a distributed data structure for similarity search in metric spaces. The structure is based on the idea of a vectorbased index method iDistance which enables to transform the issue of similarity search into the one-dimensional range search problem. A Peerto-Peer system based on the Chord protocol is created to distribute the storage space and to parallelize the execution of similarity queries. In the experiments conducted on our prototype implementation we study the system performance concentrating on several aspects of parallelism of the range search algorithm.

This paper describes the exhaustive results obtained within IST 290388 Project Balkanet, which went on 2001-2004. The attention is paid to the restructuring and final shaping the individual Balkan WordNets. In comparison with the EuroWordNet Project some new results have been obtained: The sets of Base Concepts have been extended and a set of the Balkanet 1. Common Synsets has been introduced (8,000 synsets). These were relinked to Princeton WordNet 2.0 (PWN) and converted to XML standard format, 2. The language specific synsets that do not have translation equivalents in PWN 2.0 have been established for Balkanet languages, 3. Valency frames have been developed for Czech, Bulgarian and Romanian, 4. Domains have been added to Balkanet WordNets and implemented in the VisDic browser, 5. Integrating derivational relations into Czech WordNet and adding semantic relations into Turkish WordNet exploiting Turkish derivational morphology, 6. Links to the SUMO/MILO Ontology were added to and implemented in VisDic.

Digitální knihovny (DK) přispívají k rozvoji Sémantického webu a současně mohou využívat jeho technologické prvky. Lze tak docílit kvalitnějšího řízení dat v DK a snazší integrace více DK, jakož i a zvýšení možnosti interakce s dalšími informačními zdroji. Ideou, stojící za Sémantickým webem, je rozšířit webové stránky značkováním, které podchytí alespoň část významu obsahu stránky. Toto sémantické značkování znamená přidání jistých metadat, která poskytují formální sémantiku obsahu webu. Projekty Sémantického webu vycházejí z technologií, které jsou vyvíjeny jako standardy. Patří sem jazyky XML, XML Schema, RDF a RDF Schema. Tyto jazyky slouží pro zápis metadat, z nichž část se organizuje v ontologiích. Další úroveň Sémantického webu využívá jazyky logiky. Základ zpracování v takto pojatém webu poskytují programy - softwaroví agenti. Cílem článku je uvést do technologií Sémantického webu a ukázat jejich uplatnění při vytváření DK

Současné webové vyhledavače založené na technikách vyhledávání informací v textech nejsou schopny využít sémantické znalosti uvnitř webové stránky a tedy nemohou dát uspokojující odpovědi na uživatelské dotazy. Možným řešením se zdá být tzv. Sémantický web, který koncem 90. let popsal ve své vizi Tim Berners-Lee. Ideou, stojící za Sémantickým webem, je rozšířit webové stránky značkováním, které podchytí alespoň část významu obsahu stránky. Toto sémantické značkování znamená přidání jistých metadat, která poskytují formální sémantiku obsahu webu. Projekty Sémantického webu vycházejí z několika technologií, z nichž ty základní jsou již standardizovány nebo alespoň doporučovány. Patří sem jazyky XML, XML Schema, RDF a RDF Schema. Tyto jazyky slouží pro zápis metadat, z nichž některá se organizují v tzv. ontologiích. Další úroveň Sémantického webu využívá jazyky logiky. Základ zpracování v takto pojatém webu poskytují softwaroví agenti, tj. programy, které pracují autonomně a proaktivně. Cílem článku je uvést do technologií podporujících vytváření Sémantického webu, ukázat jeho architekturu a zmínit některé již rozpracované projekty směřující k vytváření inteligentních webových informačních služeb, personalizovaných webových míst a sémanticky zesílených vyhledávacích strojů.

Methods of web data mining can be divided into several categories according to a kind of mined information and goals that particular categories set: Web structure mining (WSM), Web usage mining (WUM), and Web Content Mining (WCM). The objective of this paper is to propose a new WCM method of a page relevance ranking based on the page content exploration. The method, we call it Page Content Rank (PCR) in the paper, combines a number of heuristics that seem to be important for analysing the content of Web pages. The page importance is determined on the base of the importance of terms which the page contains. The importance of a term is specified with respect to a given query q and it is based on its statistical and linguistic features. As a source set of pages for mining we use a set of pages responded by a search engine to the query q. PCR uses a neural network as its inner classification structure. We describe an implementation of the proposed method and a comparison of its results with the other existing classification system – PageRank algorithm.

Ever increasing environmental demands from customers, authorities and governmental organizations as well as new business control functions are integrated to environmental management systems (EMSs). With a production of huge data sets and their processing in real-time applications, the needs for environmental data management have grown significantly. Current trends in database development and an associated research meet these challenges. The paper discusses recent advances in database technologies and attempts to highlight them with respect to requirements of EMSs.

The paper describes a method for relational data model estimation from input web data and usage of this method. It includes also its principal limitations and shows the model usage for a more effective storage into a repository. The repository is implemented as the universal relation. The properties of the model are described as well.

Metoda odhadování struktury dat spojuje vizi sémantického webu a dnešní webové datové zdroje, které převážně neobsahují žádnou doprovodnou sémantiku prezentovaných informací. Aby bylo možné tyto zdroje použít pokročilými nástroji sémantického webu, je potřeba sémantiku prezentovaných dat alespoň odhadnout. Příspěvek popisuje takovou metodu, ukazuje její použití pro úlohy induktivního logického programování a jmenuje výhody použití pravidlových systémů pro její implementaci.

Odhadování struktury dat je jednou z možností, jak automatizovaným způsobem interpretovat data. Ta mohou být popsána pomocí modelu funkčních závislostí, vytváření takového modelu lze srovnat s některými technikami strojového učení. Tento příspěvek shrnuje vybrané základní techniky induktivního logického programování a analyzuje je z pohledu metody odhadování struktury dat. Ukazuje se, že techniky induktivního logického programování lze v některých případech převést právě odhadování struktury dat.

It is well known that ontologies will become a key piece, as they allow making the semantics of Semantic Web content explicit. In spite of the big advantages that the Semantic Web promises, there are still several problems to solve. Those concerning ontologies include their availability, development and evolution. In the area of information retrieval, the dimension of document vectors plays an important role. Firstly, with higher index dimensions the indexing structures suffer from the "curse of dimensionality" and their efficiency rapidly decreases. Secondly, we may not use exact words when looking for a document, thus we miss some relevant documents. LSI is a numerical method, which discovers latent semantics in documents by creating concepts from existing terms. In this paper we present a basic method of mapping LSI concepts on given ontology (WordNet), used both for retrieval recall improvement and dimension reduction. We offer experimental results for this method on a subset of TREC collection, consisting of Los Angeles Times articles.

In the area of information retrieval, the dimension of document vectors plays an important role. We may need to find a few words or concepts, which characterize the document based on its contents, to overcome the problem of the "curse of dimensionality", which makes indexing of highdimensional data problematic. To do so, we earlier proposed a Wordnet and Wordnet+LSI (Latent Semantic Indexing) based model for dimension reduction. While LSI works on the whole collection, another procedure of feature extraction (and thus dimension reduction) exists, using binary factorization. The procedure is based on the search of attractors in Hopfield-like associative memory. Separation of true attractors (factors) and spurious ones is based on calculation of their Lyapunov function. Being applied to textual data the procedure conducted well and even more it showed sensitivity to the context in which the words were used. In this paper, we suggest that the binary factorization may benefit from the Wordnet filtration.

The paper describes a possible treatment of sharing data in a large network of users. The mathematical model is based on weighted hypergraphs whose nodes and edges denote the users and their relations, respectively. Its flexibility guarantees to have basic relations between users robust under frequent changes in the network connections. Approach copes with the communication/computing issues from different point of view based on a structure evolution and its further optimization in sense of keeping the parallel space and time complexities low. Although the idea is aimed to the field of mobile computing, it can be generalized in straightforward way to other similar environment. An experimental application is also proposed and discussed in the paper.

The paper describes selected problems and possible solutions for the position management in mobile computing. A proposed scheme extends existing approaches. The main idea is to reduce amount of possible solutions given by a movement prediction algorithm by constrains ubiquitously found in the real-life. Existing solutions and possibilities for a future research are also described.

In this paper we present an architecture for decision making of software agents that allows the agent to behave autonomously. Our target area is computational agents—encapsulating various neural networks, genetic algorithms, and similar methods — that are expected to solve problems of different nature within an environment of a hybrid computational multi-agent system. The architecture is based on the vertically-layered and beliefdesire-intention architectures. Several experiments with computational agents were conducted to demonstrate the benefits of the architecture

We present two original computational models - globular universe and autopoietic automata - capturing the basic aspects of an evolution: a construction of self-reproducing automata by self-assembly and a transfer of algorithmically modified genetic information over generations. Within this framework we show implementation of autopoietic automata in a globular universe. Further, we characterize the computational power of lineages of autopoietic automata via interactive Turing machines and show an unbounded complexity growth of a computational power of automata during the evolution. Finally, we define the problem of sustainable evolution and show its undecidability.

We look for computational limits of artificial, natural and hybrid cognitive and intelligent systems. The common basis for such studies is offered by computationalism, i.e., the belief that cognitive or intelligent processes, respectively, are in essence computational processes. We show that in principle cognitive systems might exist whose computational power outperforms that of Turing machines and that even in practice we observe the rudiments of such systems. These results point to the fact that the so - called Church - Turing Thesis, dealing with the central position of Turing machines in the world of computations and algorithms, must be seen in the context of physical principles exploited by the cognitive systems, and in that of the communication scenario between the system and its environment.

Popíšeme původní výpočetní modely – globulární vesmír a autopoietické automaty – které zachycují podstatné výpočetní aspekty evoluce: konstrukci sebereprodukčních evolučních automatů pomocí sebesestavování a přenos algoritmicky modifikovatelné genetické informace na potomka. V tomto rámci ukážeme neomezený růst výpočetní síly automatů během evoluce a pomocí interaktivního Turingova stroje chrakterizujeme výpočetní sílu rodových linií automatů.