Program seminářů pro rok 2004/2005

Jaro 2005

24. 2. 2005: Úvodní seminář jarního semestru; Program:
Informace o koncepci semináře v jarním semestru.
Domluva programu semináře.
Diskuse.
3. 3. 2005: L. Bártek; Grafická uživatelská rozhraní přátelská pro dialogové zpracování; Abstract
Dialogova rozhrani umoznuji zvysit pristupnost aplikaci pro dalsi skupiny uzivatelu. Cilem teto prednasky bude jednak seznamit posluchace se zakladnimi principy generovani dialogovych rozhrani z grafickych rozhrani a dale specifikovat pozadavky na graficka rozhrani, aby byl mozny bezproblemovy prevod techto rozhrani do dialogove podoby.
10. 3. 2005: P. Cenek; DS Management; Abstract:
First, dialogue systems and their structure will be introduced and categorized according to the dialogue management approach. The rest of the talk will concentrate on the dialogue management in frame-based dialogue systems. Dialogue strategies that control the dialogue will be introduced and representation of dialogue task/domains will be discussed. The talk will be concluded with a short overview of my work.
17. 3. 2005: M. Dokulil, I. Kopeček, J. Thomas; Bach, Goedel and Informatics Dedicated to the 320th anniversary of Bach's birth and to the 70th anniversary of Goedel's papers on the consistency of the axiom of choice.; Abstract:
What is it about Bach's music that so fascinates and enchants so many mathematicians and computer scientists? What are the parallels between Bach's music and Goedel's work, and between baroque music and today's informatics? There are many such questions, which are both controversial and provocative, while at the same time being inspiring and fascinating. This presentation will touch on some of these points and attempt to illustrate them, in the languages of music as well as in informatics.
24. 3. 2005: D. Novák; chiDistance: A Distributed Data Structure for Similarity Search; Abstract
The need of search mechanisms based on data content rather then data attributes 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 presentation, we propose "chiDistance", a distributed data structure for similarity search in metric spaces. The structure is based on the idea of a vector-based index method iDistance which enables to transform the issue of similarity search into the one-dimensional range search problem. A Peer-to-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.
31. 3. 2005: J. Kohout; Computer Algebra Systems in modelling biologic-medical processes; Abstract:
Computer Algebra Systems (CAS) can be shortly defined as computation with symbols representing mathematical objects - numbers, functions, systems of equations, groups, rings, etc. The adjective "algebraic" emphasizes that in many cases the goal is expressing the answer in a closed formula or symbolic expression instead of using floating-point approximation. CAS have a wide utilisation in mathematical models in a diverse range of disciplines starting from natural sciences through social sciences to economy. Generating such models is the main topic of the lecture.
7.4. 2005: J. Špojcar; TBA
14. 4. 2005: V. Ulman; TBA; L. Boháč; TBA
21.4. 2005: M. Křipač; TBA
28. 4. 2005: P. Drášil; TBA; B. Zimmerová; TBA
5.5. 2005: I. Peterlík; TBA; R. Pospíšilová; TBA
12.5. 2005: P. Fibich; TBA
19. 5. 2004: P o s t e r S e s s i o n

Podzim 2004

30. 9. 2004: Úvodní seminář podzimního semestru; Informace o koncepci semináře v podzimním semestru.
Domluva programu semináře.
Diskuse.
7. 10. 2004: Luděk Bártek; Generování dialogových rozhraní; Abstract
V teto prednasce se budeme venovat generovani jednotlivych druhu dialogovych strategii v ramci systemu DIG. Ukazemem si metody pro generovani dialogove strategie s iniciativou systemu a dialogove stretegie se smisenou iniciativou. Zamyslime se nad nekterymi problemy, ktere pri tom nastavaji a nad jejich resenimi.
14. 10. 2004: O. Krajíček; GSIP - Alternative Web Services Invocation Protocol/Infrastructure; Abstract:
Generic Service Invocation Protocol (GSIP) aims to provide an alternative communication infrastructure for applications based on the Web Services technology. It is designed for environments where traditional SOAP based approach imposes drawbacks on performance and scalability, leads to wasting resources and/or processing power. Such problems may emerge in various environments, e.g. large-scale information systems, Grid computing, high-performance or mobile computing applications. The GSIP is designed to address the shortcommings, by introducing service-specigic invocation model and corresponding infrastructure and by using alternative data encoding schemes. This allows for extensibility and implementation of more advanced communication models. GSIP design and architecture, along with some basic performance studies will be presented.; M. Batko; Indexing Techniques in Peer-to-Peer Networks; Abstract:
Since the emergence of high-speed networks, interest in distributed systems increased considerably. There are many research challenges in this area. However, a distributed storage system may be the most interesting one. Such a system would allow to store some general blocks of data (files, documents, etc.) and distribute them among network nodes (computers participating in a network). The data can be retrieved using queries issued be participants of the network. A well defined paradigm for solving this need is available nowadays: a Peer-to-Peer (P2P) architecture. The presentation will provide a brief survey on current P2P indexing techniques with emphasis on a P2P system with support for similarity searches.
21. 10. 2004: P. Moravec; Distributed Algorithm for LTL Model Checking; Abstract
We present a new distributed-memory algorithm for enumerative LTL model-checking that is designed to be run on a cluster of workstations communicating via MPI. The detection of accepting cycles is based on computing maximal accepting predecessors and the subsequent decomposition of the graph into independent predecessor subgraphs induced by maximal accepting predecessors. The influence of the ordering on the algorithm performance is discussed. Experimental implementation of the algorithm shows promising results.
4. 11. 2004: T. Hudík; Text Categorization with Support Vector Machine; Abstract
It will be given short theoretical background about Support Vector Machines. This seminar will describe some results acquired from testing influences of selected important parameters of SVM applied to text categorization. The main object was to verify whether results obtained with standard, publicly accessible datasets (the traditional Reuters text documents and the 20Newsgroups) could be applied to real medical text documents from various Internet resources utilized by physicians. The research also focused on features as document similarity, balance of categories, presence of common words (stop-words), and data volume. The results of experiments demonstrated that there could be typical problems with setting up parameters for some real data. Especially the medical documents provided worse outcomes because the real-data categories were not well balanced and the documents in different categories were mutually rather similar---i.e., overlapping classes. As a result, SVM could not always find sufficiently good separating hyperplanes as it mostly did for `trouble-free' datasets like Reuters or 20Newsgroups.
11. 11. 2004: L. Pokluda; Haptical navigation of visually impaired persons in buildings; Abstract
The spatial orientation of visually impaired persons has some specialities. Instead of global knowledge of scene gained by sight, visually impaired person knowledge of scene depend on continuous addition of information about local space to global scene during scene walk through. Preliminary tests showed necessity of whole scale of methods for supporting scene walkthrough of visually impaired persons. According to different individual ability of independant scene search, computer has to show scene information in different manner. Persons which are able to actively (themselves) explore scene need a kind of haptic model of real environment. On the other hand some visually impaired persons aren't able/like to search scene actively and prefere passive let-by-hand approach. These two extremes fall on each side of haptic navigation continuum which we want to present.
18. 11 2004: V. Kovalčík; Accelerating scene rendering using occlusion queries; Abstract
Large virtual worlds are becoming common nowadays. Unfortunately, computers are not powerful enough to display them using simple brute force methods. Therefore advanced algorithms have to be used. We will present an algorithm for accelerating the rendering process using an occlusion query function found on a modern graphic cards.
25. 11. 2004: J. Hubený; Image Segmentation via Level Set Methods; Abstract
One of the main goal in computer vision is to locate certain objects of interest and distinguish them from the background. This task is called image segmentation. The level set methods are nowadays widely used in various fields (computer animation, CAD design, fluid dynamics, robotic navigation, image segmentation and denoising). The use of level set methods in image segmentation will be presented. Level set methods belong to the active contour models. These methods are based on the tracking of the interface motion. In the image segmentation, the interface represents boundary between the objects of interest and the background. Starting with some initial boundary the methods move the interface under certain velocity field, which is derived from the image data, towards the desired boundaries. A major advantage of the level set approach is its ability to segment arbitrary complex objects, without any a priori knowledge about their topology and their amount. Moreover, the presented methods can be used without significant modifications in any dimension.
2. 12. 2004: F. Procházka; Universal Information Robot; Abstract
The project of designing computer system called Universal Information Robot will be presented. Surprisingly, the main topic of the design process (7 years long) is simplification. We will explain basic modules, describe the process of building such a system and briefly discuss some related areas like modern trends in artificial inteligence, self-reference and self-similarity (fractal geometry) and transparent intensional logic. The application of such a system is quite large. Some projects and grants, where the Universal Information Robot is used (crisis management, oncology, project management) will be presented as well.
9. 12. 2004: P. Šmerk; Rules for Morphological Disambiguation; Abstract
State-of-the-art rule-based tools for morphological disambiguation use either manually crafted rules or rules learnt from manually annotated data. We will present a new method of learning rules for morphological disambiguation using only unannotated data. Inductive logic programming and active learning are employed. The induced rules display very promising accuracy. Also the probable limitations of the proposed method will be discussed.
16. 12. 2004: P o s t e r S e s s i o n; Prezentovány budou postery vytvořené v podzimním semestru