translated by Google

Machine-translated page for increased accessibility for English questioners.

Seminar program for 2005/2006

Autumn 2005

22. 9. 2005
Introductory Seminar Seminar
Information on Seminar Concept in the Autumn Semester.
Agenda of the seminar.
29. 9. 2005
P. Cenek
A Framework for Rapid Multimodal Application Design
In the talk, my collaborative work with the Swiss Federal Polytechnic Institute in Lausanne (EPFL) will be described. The aim of this work is to extend the EPFL unimodal dialogue platform with multimodal capabilities. The EPFL dialogue platform will be introduced together with the EPFL Rapid Dialogue Prototyping Methodology (RDPM). Then, our approach to its extension will be explained. We formulated a set of design principles that should lead to an efficient multimodal interface for a given application. The principles have been tested on a prototype application in a series of Wizard of Oz experiments. The results will be presented together with a short practical demonstration of the application and the Wizard of Oz interface.
6. 10. 2005
L. Bartek
Optimization of Generated Dialogues
When the dialogues are generated from the graphical user interface, the optimality of the resulting dialogue may be unsatisfactory. This talk will suggest some methods that allow us to evaluate the dialogue optimality and optimize the resulting dialogue according to the proposed criterion.
13. 10. 2005
I. Peterlík
Finite Element Method and Soft Tissue Modeling
Virtually every phenomenon in nature can be described with the help of laws of physics, in terms of algebraic, differential or integral equations. Since numerical methods are often difficult or even impossible to find the exact solution of such equations, they play an important role in simulations and modeling. The talk consists of two parts. First, we present an introduction to the Finite Element Method, which provides a powerful tool for solving complex physical problems. In the second part we focus on medical simulations, namely soft tissue modeling. We look at the design of the surgical simulator with haptic interaction and describe the application of the finite element method in this area.
20. 10. 2005
M. Batko
Scalability in Distributed Similarity Searching
As the growth of digital data accelerates in variety and scope, huge data repositories are becoming available on modern computer networks. For users to be able to access selected data objects, the objects need to be structured and manipulated efficiently but also effectively. In contrast to traditional databases, the data is bulkier and more complex in nature. For such domains, an exact match has little meaning and proximity concepts (similarity, dissimilarity) are typically much more fruitful to search. Another problem, we should address todayadays, is the scalability of structures supporting efficient data retrieval. Creating a search index structure that scales to very large dimensions, presents many challenges and the task becomes increasingly difficult as the amount of data grows. Probably the most successful search engine that scales even to the Web dimension, is Google, but it can only manage text-like data. We show that recent trends in network architectures, such as the peer-to-peer communication paradigm, can also be exploited to develop real scalable and distributed similarity search structures for arbitrary metric distance functions. The presentation will provide a brief insight into four examples of such structures.
27. 10. 2005
H. Mlnařík
Towards a Categorical Semantics of a High-Level Quantum Programming Language
Quantum mechanics gets more and more important in computer science. Even though it is nowadays mainly a theoretical field, it will probably become a necessity for practice in one or two decades. We present a proposal of a category that can serve for the definition of a semantics of a programming language that combines both quantum and classical computations.
3 November 2005
M. Cuba
Semantic Grid
Semantic Grid is an extension of the current Grid, where information and services are given a well-defined meaning. As an introduction to this area, the overview of current Grid technologies will be presented together with the concept of ontologies and semantic descriptions. Then we will present our work on the use of semantic grid infrastructure for solving problems in biomedicine.
10. 11. 2005
O. Krajíček
SEAGRIN - Adaptine Grid
24. 11. 2005
O. Excellent
Privacy in Data Mining
In this talk, an overview of problems related to privacy in data mining will be presented together with different approaches to solving these problems. We will focus on different points of view on privacy and show several methods used to preserve privacy. We will also show some useful uses of data mining for IT security.
1 December 2005
J. Hubený
3D Reconstruction of Interphase Chromosome Territories
In this talk, we describe a robust and mathematically well-defined segmentation method suitable for the analysis of image data acquired using a confocal microscope. We will focus on the specific problem of reconstruction and segmentation of interphase chromosome territories. The proposed method uses PDE-based nonlinear filters for image preprocessing and PDE-based implicit active contour models for object reconstruction. Both these techniques are not widely used in image analysis in confocal microscopy because they are quite complex and their computation can be very slow when processing large three dimensional data. However, we will show that one can overcome the slow computing speed, which is the main disadvantage of PDE-based image processing techniques, by using fast and sophisticated numerical approximations and by processing the input image per partes. Last but not least we will discuss the performance and properties of the proposed reconstruction method and our plans to the future. We will finish the talk with the practical demonstration of the software, which implements the proposed method.
8 December 2005
P. Adámek
Indexing XML Documents that Change
Many indexing methods have been developed to allow efficient search collections of XML documents. However, many of them are static and do not efficiently support updates of indexed documents. This talk discusses this problem and offers some solutions. Further, we present an approach that is based on XML Tree Signatures.
15. 12. 2005
T. Rebok
QoS-enabled Distributed Multistream Active Router
Active Networks (Active Routers) have an appropriate approach for giving higher flexibility to current computer networks, allowing users to upload their own code for data processing inside the computer network. Introducing this approach into high-speed computer networks and distributed environment and Quality of Service (QoS) assurance are required. In the first part of this talk, we will discuss some of these routers and their possible practical applications, and in the second part we will briefly discuss the deployment of Active Networks on current computer networks and their assumed future.
22. 12. 2005
Poster Session
Presentations will be created in the autumn semester.
2. 3. 2006
P. Moravec
Distributed Decompositions of Graphs into Strongly Connected Components
Decomposition of graphs into strongly connected components (SCCs) is a classic graphical theoretical problem with applications in many areas involving formal verification. Since distributed distribution methods have become very popular, there is a natural need to propose distributed algorithms for SCCs decomposition. In this talk I present novel algorithms that solve that problem and discuss its properties.
9. 3. 2006
L. Bartek
Generating Web-based Presentations by Means of Dialogue
The talk deals with problems that may occur during the process of generating web pages by means of dialogue. Some topics related to the web-based presentation will be discussed as well.
16. 3. 2006
P. Medek
Analysis of Protein Structure
The identification of export tunnels leading from the inside of a protein molecule to its surface is believed to bring a significant improvement in the area of ​​drug design. We will describe how this problem has been solved to the present and propose a new solution based on Voronoi diagrams. Mainly we will focus on a temporary hybrid algorithm combining classical Voronoi diagrams with Euclidean Voronoi diagrams. At the end of this talk, we will discuss how this method could be extended to compute an exact solution.
23 March 2006
P. Očenášek, FIT BUT
Evolutionary Approach in the Security Protocol Design
This presentation is devoted to an evolutionary method that serves for designing security protocols. The principles of security protocols are outlined, followed by the reasoning about modal logic that is used to encode the belief and knowledge of communicating parties. The second part introduces the evolutionary optimization framework and suggests the techniques that can be used to automatically develop security protocols.
30. 3. 2006
J. Špojcar
Relationships between Anonymous Channels
We take a closer look at the anonymous channel - the most simple application of anonymity in cryptography. An anonymous channel is a primitive way for communication between parties. Every anonymous channel acquires some kind of anonymity eg anonymous sender, anonymity relationship, unlinkability message - receiver etc. We present many types of anonymous channels as well as a structure (a lattice) that describes some relations between them - simulation of one channel by another. We call this relationship reduction.
6 April 2006
L. Boháč
Superstrong Correlations in Quantum Cryptography
Classical as well as quantum theories put limits on non-local correlations that can be generated between two separate sites when no communication is allowed. Concept of superstrong correlations, maximum correlations allowed by special relativity, as well as their possible impact on quantum cryptography will be presented.
13. 4. 2006
M. Bidlo
Evolutionary design using development
The presentation is devoted to two different models of development for the evolutionary design of combinational logic circuits. The first of these, an instruction-based approach, is able to construct arbitrarily large circuits of several classes. Different examples of evolved circuits will be shown and discussed (eg sorting networks, polymorphic circuits). The second method employs a cellular automaton for the design of combinational circuits of a given number of inputs. Finally, a plan of possible future research activities will be given.
20. 4. 2006
J. Denemark
Virtual Grid Execution Environmant
The talk is focused on virtualization and its use in grid environment. We will show how it can be beneficial for grids and how it can help with satisfying heterogeneous requirements of users. An overview of some existing technologies will be presented and an architecture of a virtual execution environment we designed will be described.
27. 4. 2006
P. Vařeková
Specification of Software Components with Component-Interaction Automata
The talk presents a automated compute-based automation, which is designed to specify component interactions in hierarchical component-based software systems. First, we mention software components and their interaction properties. Then we will focus on a definition of Component-Interaction automaton. The last part of the talk discusses the modeling composition of components in the specification language Component-Interaction.
4 May 2006
A. Rogalewicz
Verification of Programs with Dynamic Data Structures by ARTMC
For example, SLL, DLL, Trees, etc.) have been proposed to encode a program behavior into tree transducers. Configurations of such programs are encoded as trees, and sets of such configurations as tree automata. This encoding allows us to use the "abstract regular tree model checking method". The complete method was prototypely implemented over tree libraries from the MONA project. This method has been successfully used on several examples.
11 May 2006
P. Adámek
18 May 2006
Poster Session
The posters created in the spring semester will be presented.