translated by Google

Seminar program for 2003/2004

St. 12.00 - 13.00, A107
Lecturer: doc. RNDr. Ivan Kopeček, CSc. ( )

Autumn 2003

24. 9. 2003
Introductory Seminar Seminar
Information on Seminar Concept in the Autumn Semester.
Agenda of the seminar.
October 1, 2003
Jan Flasar
Interaction in the local area
In this presentation, we focus on interacting in virtual space - we will only be interested in methods for selecting and manipulating objects. We'll show you the issues we can meet here and how they can be resolved. Then, let's look at the design of methods that should accelerate user interactions with virtual objects. And we wonder where everywhere these techniques can be used.
8 October 2003
Michal Batko
Scalable and Distributed Data Structures
Since the emergence of high-speed networks, interest in distributed systems has increased considerably. Modern computer networks have a large enough bandwidth, so it is becoming more expensive for an application to access local disk, then it is a RAM access of another computer on a network. We can therefore distribute data between network nodes using a distributed system. For the efficient use of such a system, new techniques are needed for storage, access and processing of distributed data. Scalable Distributed Data Structures (SDDS) represent a step towards efficient storage and access of distributed data, since they are very well suited for large scale distributed systems. Distributed techniques can also be used to enhance the processing of large data sets of objects, where we can compute similarities between these objects (examples of applications can be image recognition, audio sample matching, molecules searching, ...). One method to accomplish this task is to use a "metric space" abstraction for classes of objects that allow defining a "distance" function. This method is used in a scalable distributed data structure GHT *, which allows to perform similarity queries on generic metric spaces in a distributed environment.
15. 10. 2003
Prof. Manfred Kudlek
University of Hamburg
Languages ​​of Cyclic Words
Cyclical words play a role in DNA computing. Several methods for generating languages ​​of cyclic words are presented. One is to take cyclical permutations of classical languages, another one to solve algebraic systems of equations on cyclical words. The relations between the language classes defined in this way are also considered.
22 October 2003
D. Šafránek
Visual Specification of Concurrent Systems
29. 10. 2003
P. Motlíček
Modeling Spectra and Temporal Trajectories in Speech Processing
This work investigates the application of spectral and temporal speech processing algorithms developed for feature extraction in Automatic Speech Recognition (ASR) and for very low bit-rate speech coding. In the first part, various spectral processing features of extraction techniques are investigated for robust parameterization of speech. We are especially focused on all-field modeling techniques that use, as the major processing block, an autoregressive model that suppresses speaker-dependent details in the audio spectrum. Such techniques that use the model spectrum are advantageous as opposed to directly using signal audio spectrum. Furthermore, the work investigates the inclusion of temporal information as an additional speech parameter in ASR. We primarily concentrate on the use of frequency-localized temporal trajectories (patterns). In the last part, the use of spectral and temporal processing techniques for Very Low Bit-Rate (VLBR) speech coding is investigated. We study the properties of autoregressive model-based features in a speech coder. Our coding approach is based on a proper selection of speech units automatically derived from an Automatic Language Independent Speech Processing (ALISP) tool.
5. 11. 2003
P. Cenek
Dialogue System Design Abstract:
Design of dialog systems, ie systems that use natural language for communication with users, is specific in many ways. The structure of such systems will be introduced and particularities of their design will be discussed. Examples of applications will be presented.
F. Procházka
Knowledge representation and acquisition through the UIR system and the identification expressions
The presentation will introduce the principle of knowledge representation and acquisition through the UIR (Universal Information Recorder) system, UIR ontology and so-called identification expressions. Using this method enables us to specify the knowledge base as well as the inference machine of an information / knowledge-based system on a high conceptual level of abstraction. This method will be compared to the method based on Transparent Intensional Logic (TIL). The UIR system is used in real commercial applications.
12.11. 2003
M. Castle
Time Stamping
In order to use digital documents as a medium for keeping information, it is necessary to apply a technique that ensures the integrity of digital documents over a long period of time. What is needed is a method of time-stamping digital documents that can time stamp the data itself and make it impossible to stamp a document with a time different from the actual one. Time stamping is a technique that proves the existence of certain digital data before a specific point in time. The presentation will focus on current situation, simple and linking schemes, TSA requirements and practical realization.
19.11. 2003
V. Kovalčík
Occlusion Culling
Despite the fact that the processors are faster and more complex features are added to the graphics cards every year, complicated visual scenes can not be displayed fast enough yet. Thus, some new methods of searching for visible objects in huge scenes are needed. In this talk, some of them will be discussed and directions for research in this area will be presented.
26.11. 2003
P. Holub
TCP and beyond: Protocols for reliable transfer in high-bandwith long-distance networks
Bandwidth provided by current high-speed networks grows even faster than computing and storage capacity. Some other properties, however, can not be improved at such speeds also due to limitations imposed by laws of physics. The most important of these is latency, influencing the dramatic behavior of TCP - the most common Internet protocol for reliable transfers. Building on basic ideas described by Sven Ubik during his talk two weeks ago I will introduce improvements to TCP protocol designed to cope with the networks described above. We will examine approaches different from those used by TCP as well.
3.12. 2003
J. Thomas
English: could not give a damn
Together we will assemble a picture of the best speakers of English, how they came to be so, and consider who can join their ranks. The question is: can anyone be "a best speaker of English", and if so, what does it take? Conversely, we will consider what it takes to ensure eternal exclusion from the club.
A website for those interested in helping themselves can be found at Note: comments on pronunciation problems can be found (underscore before 'pron').
10.12. 2003
P. Kolčárek
Level of detail: Graphics Haptics
We will present a possible way of using LOD in a haptic environment. Level of detail is a technique commonly used in computer graphics for displaying complex 3D models. However, it can be used in other fields as well. We will discuss some advantages and disadvantages of using LOD in graphics and haptics. A short outline of the LOD algorithm in haptics will be presented at the end.
17.12. 2003
Poster Session
Posters created during the fall semester will be presented.

Spring 2004

25. 2. 2004
Introductory Seminar of the Spring Semester
Information on Seminar Concept in the Autumn Semester.
Agenda of the seminar.
3. 3. 2004
Luděk Bartek
Generate dialog interfaces
Nowadays, W3 consortium-based Internet applications are booming. Most of these applications missed only a graphical output that is not suitable for people with different sufferers, for getting help with different thin clients based on their voice. This description of the sentence may resolve the issue.
10. 3. 2004
Jan Kohout
Precitipation data processing
17 March 2004
James Thomas
Help yourself to help yourself
This talk will follow on from my December one in which I tried to make much of the conscious and subconscious choices that we are involved in when producing language and in particular a foreign language, whether spoken or written. The parallel thrust in that talk concerned our need to equip ourselves with as many linguistic resources as possible so that we can make the most reasoned choices. This was a call to learn more, to pursue studies. A brief illustration was also shown showing how corpora can assist in our decision making. In this talk, I would like to develop this theme. General corpora can answer general questions, which is important since some of the issues are related to general aspects of language. But to focus on the characteristics of specific language tasks, writing academic papers for example, it is advantageous to consult a corpus of the specific genre you are working in. And if such a corpus does not exist, we must create one: the Brno Informatics Corpus, perhaps!
24 March 2004
Miroslav Křipač
Data Sharing Within Database Clusters
Database clusters meet the current demand for scalability and high availability of mission critical systems. However, conventional implementations of the single-use shared disk subsystem limit their wide-spread adoption primarily for cost reasons. This presentation will focus on an alternative software approach to data sharing methods and its impact on system performance.
31 March 2004
L. Svoboda
Question Answering Systems
At present, the Internet accesses many databases, each with its own interface (weather, transport links, exchange rates, ...). The natural endeavor is to create one universal interface that would allow you to communicate in native language. The basic principles and the current state of development in the field of answering questions are presented.
April 7, 2004
V. Kadlec
Syntactic Analysis of Natural Languages
The paper introduces the {\ tt libkp} comparison and evaluation system for the syntactic processing of natural languages. The analysis of natural language sentences is based on a free grammar for given language. The internal representation of the trees should allow the application of contextual constraints, eg agreement fulfillment. In general, this is NP-complete problem. That is why it is necessary to develop new evaluation algorithms. Then we will be able to work efficiently with trees, where these constraints were applied. We can also select the most probable trees based on the frequency characteristics obtained from tree-banks.
The system is language-independent, however it is optimized for very large and highly ambiguous grammars for the Czech (thousands of rules). We also expect this tool to be used for comparing and evaluating different CFG-parsing algorithms.
14. 4. 2004
M. Marciniszyn
Bipartite Entanglement in Mixed States
A new approach, which considers quantum entanglement as a source for the transmission of information, is presented in the talk. The algorithm performing the calculation of our measure is polynomially slower in comparison with those by Bennet et. al., however this drawback is fully compensated by the possibility of measuring mixed states entanglement. The approach is presented from the point of view of computer scientists, no knowledge of quantum mechanics is assumed.
21. 4. 2004
J. Stibor
Interphase Chromosomes Segmentation
The process of chromosomes segmentation and their localization is essential for genetic diagnosis (Down Syndrome, leukemia, ...). This talk will explain the method of interphase chromosome segmentation. The method is based on Voronoi Tesselation of 2D and 3D images. The duality with Delaunay Graph is used in the implementation of this method.
28. 4. 2004
J. Hejtmanek
Distributed Data Storage
5. 5. 2004
R. Pelanek
Model Checking - An Overview
Model checking is a formal method designed to design and verify safety-critical systems. The talk will provide an overview of this technique. We will discuss the idea of ​​the approach; main problems and remedies; history, state of the art and future of the field. Finally, we will mention the relevant research in the ParaDiSe laboratory.
12 May 2004
P. Adamek
Effective Evaluation of XPath Expressions
XPath is the most common language for searching XML documents. This paper describes the XPath expression evaluation and outlines some methods that use indexes to speed up this process. In addition, the requirements and benefits of each method are discussed; great emphasis is placed on the desired abilities of the indices.
S. Barton
Designing Indexing Structure for Discovering Relationships in RDF Graphs
Discovering the complex relationships between entities is one way of benefiting from the Semantic Web. This paper discusses new approaches to incorporating rho-operators into RDF querying engines, which will allow discovering such relationships viable. Such incorporation is based on creating an index that describes the original RDF graph. The index is created in two steps. Firstly, it transforms the RDF graph into a forest of trees and then creates an extended signature for each of these trees. The signatures are accompanied by additional information related to transformed problematic nodes breaking the tree structure.

Jan Flasar
Pavel Kolcarek
Radka Pospisilova
Lukas Kokrment
Vaclav Kadlec
Vit Kovalcik
Pavel Cenek
Michal Batko
Tomas Hnilic