Program seminářů pro rok 2003/2004

St. 12.00 - 13.00, A107
Vedoucí semináře: doc. RNDr. Ivan Kopeček, CSc. (

Podzim 2003

24. 9. 2003
Úvodní seminář podzimního semestru
Informace o koncepci semináře v podzimním semestru.
Domluva programu semináře.
1. 10. 2003
Jan Flasar
Interakce v lokalni oblasti
V teto prezentaci se zamerime na interakci ve virtualnim prostoru - budeme se bavit pouze o metodach pro vyber a manipulaci s objekty. Ukazeme si problemy se kterymi se zde muzeme setkat a jak je lze resit. Pak nahledneme na navrh metod, ktere by mely urychlit interakci uzivatele s virtualnimi objekty. A take se podivame, kde vsude lze tyto techniky pouzit.
8. 10. 2003
Michal Batko
Scalable and Distributed Data Structures
Since the emergence of high-speed networks, interest in distributed systems increased considerably. Modern computer networks have large enough bandwidth, so that it is becoming more expensive for an application to access local disk, then it is to access RAM of another computer on a network. We can therefore distribute data among network nodes using a distributed system. For efficient use of such a system, new techniques are need 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 by definition they are very well suited for large scale distributed systems. Distributed techniques can also be used to enhance processing of huge datasets of objects, where we can compute similarities between those objects (examples of applications can be image recognition, audio samples 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 a generic metric spaces in distributed environment.
15. 10. 2003
Prof. Manfred Kudlek
University of Hamburg
Languages of Cyclic Words
Cyclic words play a certain role in DNA computing. Several methods to generate languages of cyclic words are presented. One is to take cyclic permutations of classical languages, another one to solve algebraic systems of equations on cyclic words. The relations between the language classes defined in this way are also considered.
22. 10. 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 feature extraction techniques are investigated for robust parameterization of speech. We are especially focused on all-pole modeling based techniques that use, as the major processing block, autoregressive model to suppress speaker-dependent details in the auditory spectrum. Such techniques that use the model spectrum are advantageous as opposed to directly using signal auditory spectrum. Further, the work investigates 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 employed in a speech coder. Our coding approach is based on a proper selection of speech units automatically derived by an Automatic Language Independent Speech Processing (ALISP) tool.
5. 11. 2003
P. Cenek
Dialogue System Design Abstrakt:
Design of dialogue systems, i.e. 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 via the UIR system and the identification expressions
The presentation will introduce the principle of knowledge representation and acquisition via the UIR (Universal Information Recorder) system, UIR ontology and so called identification expressions. Using this method enables us to specify a 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 with the method based on Transparent Intensional Logic (TIL). The UIR system is used in real commercial applications.
12.11. 2003
M. Hrad
Time Stamping
In order to use digital documents as a medium for keeping information it is necessary to apply a technique which assures the integrity of digital documents over a long time period. What is needed is a method of time-stamping digital documents which can time-stamp the data itself and make impossible to stamp a document with a time which is different from the actual one. Time Stamping is a technique which proves the existence of certain digital data prior to a specific point in time. The presentation will focus on present situation, simple and linking schemes, requirements of the TSA and practical realization.
19.11. 2003
V. Kovalčík
Occlusion Culling
Despite the fact, that processors are faster and more complex features are added to graphic cards every year, complicated visual scenes can't be displayed fast enough yet. Thus some new searching methods for visible objects in huge scenes are needed. In this talk some of them will be discussed and directions of the 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
Bandwith provided by current high-speed networks grows even faster than computing and storage capacity. Some other properties, however, can not be improved at such speed also due to limitations imposed by laws of physics. Most important of these is latency, influencing dramaticaly 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 networks described above. We will examine approaches different from the one used by TCP as well.
3.12. 2003
J. Thomas
English: couldn't give a damn
Together we shall 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 interesting 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 vs. 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 drawbacks of using LOD in graphics and haptics. A brief outline of LOD algorithm in haptics will be presented at the end.
17.12. 2003
Poster Session
Presentovány budou postery vytvořené během podzimního semestru.

Jaro 2004

25. 2. 2004
Úvodní seminář jarního semestru
Informace o koncepci semináře v podzimním semestru.
Domluva programu semináře.
3. 3. 2004
Luděk Bártek
Generování dialogových rozhraní
V dnesni dobe dochazi k rozmachu internetovych aplikaci zalozenych na standardech W3 konsorcia. Vetsina techto aplikaci ma bohuzel jen graficky vystup, ktery neni vhodny pro lidi s ruznymi postizenimi, pro pristup pomoci ruznych tenkych klientu zalozeny na hlase. Tato prednaska popise mozna reseni dane problematiky.
10. 3. 2004
Jan Kohout
Precitipation data processing
17. 3. 2004
James Thomas
Help yourself to help yourself
This talk will follow on from my December one in which I attempted 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 as to be able to make the most reasoned choices. This was a call to learn more, to pursue studies. A brief illustration was also given 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 errors do concern general aspects of language. But to focus in on 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. 3. 2004
Miroslav Křipač
Data Sharing Within Database Clusters
Database clusters meet current demand for scalability and high availability of mission critical systems. However, conventional implementations of single-purpose 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. 3. 2004
L. Svoboda
Question Answering Systems
V současnosti internet zpřístupňuje mnoho databází, z nichž každá má své vlastní rozhraní (počasí, dopravní spojení, měnové kurzy, ...). Přirozenou snahou je vytvořit jedno univerzální rozhraní, které by umožňovalo komunikovat v přirozeném jazyce. Jsou prezentovány základní principy a současný stav vývoje v oblasti zodpovídání otázek.
7. 4. 2004
V. Kadlec
Syntactic Analysis of Natural Languages
The paper introduces {\tt libkp} comparison and evaluation system for the syntactic processing of natural languages. The analysis of natural language sentences is in this tool based on context free grammar for given language. The internal representation of derivation trees should allow applying contextual constraints, e.g. agreement fulfillment. In general this is NP-complete problem. That is why it is required to develop new evaluating algorithms. Then we shall be able to work effectively with trees, where these constraints were applied. We can also select n most probable trees based on frequency characteristics obtained from tree-banks.
The system is language-independent, however it is optimized for very large and highly ambiguous grammars for Czech (thousands of rules). We also expect this tool can 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 computation of our measure is polynomially slower in comparison to 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 supposed.
21. 4. 2004
J. Stibor
Interphase Chromosomes Segmentation
The process of chromosomes segmentation and their localization is essential for genetic diseases diagnostic (Down Syndrome, leukemia, ...). This talk will explain the method of interphase chromosomes segmentation. The method is based on Voronoi Tesselation of 2D and 3D images. The duality with Delaunay Graph is used in 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 aimed at design and verification of 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. 5. 2004
P. Adamek
Effective Evaluation of XPath Expressions
XPath is the most common language for searching XML documents. This paper describes the issue of XPath expression evaluation and outlines some methods that use indices for speeding up this process. In addition, requirements and benefits of each method are discussed; great emphasis is put on the desired abilities of 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 enable discovering such relationships viable. Such incorporation is based on creating an index which 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 Hnilica