• Aucun résultat trouvé

Preface and frontmatter

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "Preface and frontmatter"

Copied!
6
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Charles University in Prague, MFF, Department of Software Engineering Czech Technical University in Prague, FEE, Department of Computer Science

VˇSB–TU Ostrava, FEECS, Department of Computer Science Czech Society for Cybernetics and Informatics

Proceedings of the Dateso 2010 Workshop Databases, Texts

Specifications, and Objects

2010

http://www.cs.vsb.cz/dateso/2010/

http://www.ceur-ws.org/Vol-567/

Sc.

Group

AMPHORA RESEARCH GROUP

A R G

Amphor

Sponsored by

http://www.mirlabs.org/ http://www.cski.cz/

April 21 – 23, 2010

ˇ Stˇ edron´ın - Plazy

(2)

DATESO 2010

c J. Pokorn´y, V. Sn´aˇsel, K. Richta, editors

This work is subject to copyright. All rights reserved. Reproduction or publication of this material, even partial, is allowed only with the editors’ permission.

Technical editor:

Pavel Moravec,[email protected] VˇSB – Technical University of Ostrava

Faculty of Electrical Engineering and Computer Science Department of Computer Science

Page count: 198 Publication: 310th Impression: 150 Edition: 1st First published: 2010

This proceedings was typeset by PDFLATEX.

Cover design by Pavel Moravec ([email protected]) and Tom´aˇs Skopal.

Printed and bound in Ostrava, Czech Republic by TiskServis Jiˇr´ı Pustina.

Published by MATFYZPRESS publishing house of Faculty of Mathematics and Physics Charles University in Prague, Sokolovsk´a 83, 186 75 Praha 8, Czech Republic as its 310th publication.

(3)

Preface

DATESO 2010, the international workshop on current trends on Databases, In- formation Retrieval, Algebraic Specification and Object Oriented Programming, was held on April 21 – 23, 2010 in in pension Fousek, ˇStˇedron´ın - Plazy.

The 10th jubilee year was organized by Department of Software Engineer- ing MFF UK Praha, Department of Computer Science and Engineering FEL CVUT Praha, Department of Computer Science VˇSB-Technical Universityˇ Ostrava, and the Working group on Computer Science and Society of Czech Society for Cybernetics and Informatics. The DATESO workshops aim for strengthening connections between these various areas of Computer science.

The proceedings of DATESO 2010 are also available at DATESO Web site:

http://www.cs.vsb.cz/dateso/2010/ and CEUR Workshop Proceeding site:

http://www.ceur-ws.org/Vol-567/ (ISSN 1613-0073). The Program Com- mittee selected 15 papers (11 full papers and 4 posters) from 26 submissions, based on two independent reviews.

The workshop program also included 2 invited lectures: Database Trends and Directions: Current Challenges and Opportunities by George Feuerlicht, and Content-based Retrieval of Compressed Images by Gerald Schaefer.

We wish to express our sincere thanks to all the authors who submitted papers, the members of the Program Committee, who reviewed them on the basis of originality, technical quality, and presentation. We are also thankful to the Organizing Committee for preparation of workshop and its proceedings as well as the Czech Society for Cybernetics and Informatics and MIR Labs for their support of publishing this issue.

Special thanks go to P. Moravec who, as copy editor of DATESO Proceedings, prepared this volume.

April, 2010 J. Pokorn´y, V. Sn´aˇsel, K. Richta (Eds.)

(4)

Steering Committee

Jaroslav Pokorn´y (chair) Charles University, Prague

V´aclav Sn´aˇsel VˇSB-Technical University of Ostrava, Ostrava Karel Richta Czech Technical University, Prague

Program Committee

Jaroslav Pokorn´y (chair) Charles University, Prague

Karel Richta Czech Technical University, Prague Vojtˇech Sv´atek University of Economics, Prague Peter Vojt´aˇs Charles University, Prague

Duˇsan H´usek Inst. of Computer Science, Academy of Sciences, Prague Michal Kr´atk´y VˇSB-Technical University of Ostrava, Ostrava

Tom´aˇs Skopal Charles University, Prague

Pavel Moravec VˇSB-Technical University of Ostrava, Ostrava Irena Mlynkov´a Charles University, Prague

Michal Valenta Czech Technical University, Prague Pavel Loupal Czech Technical University, Prague Martin Neˇcask´y Charles University, Prague

Jiˇr´ı Dvorsk´y VˇSB-Technical University of Ostrava, Ostrava Radim Baˇca VˇSB-Technical University of Ostrava, Ostrava Petr Gajdoˇs VˇSB-Technical University of Ostrava, Ostrava

Organizing Committee

Pavel Moravec VˇSB-Technical University of Ostrava, Ostrava Martin Neˇcask´y Charles University, Prague

Jakub Lokoˇc Charles University, Prague Jakub Kl´ımek Charles University, Prague

(5)

Table of Contents

Full Papers

Parametrised Hausdorff Distance as a Non-Metric Similarity Model for

Tandem Mass Spectrometry. . . 1 Jiˇr´ı Nov´ak, David Hoksza

Two-step Modified SOM for Parallel Calculation. . . 13 Petr Gajdoˇs, Pavel Moravec

Answering Metric Skyline Queries by PM-tree . . . 22 Tom´aˇs Skopal, Jakub Lokoˇc

A Framework for Efficient Design, Maintaining, and Evolution of a

System of XML Applications . . . 38 Martin Neˇcask´y, Irena Ml´ynkov´a

Reconstructing Social Networks from Emails . . . 50 Marcel Kvassay, Michal Laclav´ık, ˇStefan Dlugolinsk´y

Efficient Implementation of XPath Processor on Multi-Core CPUs . . . 60 Martin Kruliˇs, Jakub Yaghob

Fast Fibonacci Encoding Algorithm . . . 72 Jiˇr´ı Walder, Michal Kr´atk´y, Jan Platoˇs

iXUPT: Indexing XML Using Path Templates. . . 84 Tom´aˇs Bartoˇs, J´an Kasarda

Reverse-engineering of XML Schemas: A Survey . . . 96 Jakub Kl´ımek, Martin Neˇcask´y

Evolving Quasigroups by Genetic Algorithms. . . 108 V´aclav Sn´aˇsel, Jiˇr´ı Dvorsk´y, Eliˇska Ochodkov´a, Pavel Kr¨omer, Jan

Platoˇs, Ajith Abraham

Using Spectral Clustering for Finding Students’ Patterns of Behavior

in Social Networks . . . 118 Gamila Obadi, Pavla Dr´aˇzdilov´a, Jan Martinoviˇc, Kateˇrina Slaninov´a,

V´aclav Sn´aˇsel

Posters

Deferred Node-copying Scheme for XQuery Processors . . . 131 Jan Kurˇs, Jan Vran´y

(6)

Denotational Semantics of the XML-λQuery Language. . . 139 Pavel Loupal, Karel Richta

Modeling and Verification of Priority Assignment in Real-Time

Databases Using Uppaal . . . 147 Martin Kot

Testing Quasigroup Identities using Product of Sequence. . . 155 Eliˇska Ochodkov´a, Jiˇr´ı Dvorsk´y, V´aclav Sn´aˇsel, Ajith Abraham

Invited Papers

Database Trends and Directions: Current Challenges and Opportunities. . 163 George Feuerlicht

Content-based Retrieval of Compressed Images . . . 175 Gerald Schaefer

Author Index

. . . 186

Références

Télécharger maintenant ( PDF - 6 Page - 444.04 KB )

Documents relatifs

E

In Chapter 3, we will describe our incremental distance computation al- gorithm which utilizes the concept of Voronoi regions and the properties of convex polyhedra to perform

Department of Computer Science Stanford University

(Note, though, that the number of training patterns seen before this maximum number of mistakes is made might be much greater.) This theoretical (and very impractical!) result (due

D I S SCIENCE DEPARTMENT ICAl

To prove the theorem, consider the computational sequences producible by the flowchart (*); they may be described by the regular expression.. We will show that

Department Of Computer Science Gulbarga University Gulbarga

 There are chances of Android may become the widely used operating system in world as it has found its application in many. appliances such as washing machine, microwave

Computer Science and Educational Software Design

For instance, let us consider a piece of software meant to implement some given type of calculus that learners need to use while solving some type of problem: the way software

First Pages

This was the 7 th an- nual workshop organized by Vˇ SB-Technical University Ostrava, Department of Computer Science, FEL ˇ CVUT Praha, Department of Computer Science and Engineering

First Pages

This was the 6 th an- nual workshop organized by Vˇ SB-Technical University Ostrava, Department of Computer Science, FEL ˇ CVUT Praha, Department of Computer Science and Engineering

On Bunched Typing Peter O’Hearn Department of Computer Science Queen Mary, University of London

The reading for the affine variant, which admits Weakening for the multiplicative combination “,”, is obtained by changing the interpretation of the additive function type to say