Faculty of Informatics logo Informatický seminář 2004/2005
Čt. 12.00 - 13.00, A107
- - - - -
Minulé ročníky 1998/1999 1999/2000 2000/2001 2001/2002 2002/2003 2003/2004
- - - - -

30. 9. 2004


Úvodní seminář podzimního semestru

Program:
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
Abstract
Prezentovány budou postery vytvořené v podzimním semestru

- - - - -

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řáelská 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
What is meant by "This cryptographic protocol is secure?"
Abstract
Proving that a given cryptographic protocol is secure (i.e. it achieves some intuitive properties) is one of the goals of cryptography. The traditional way of defining security for a cryptographic task is to present list of properties formulated rather in a natural language than using mathematical formalism. This approach has many disadvantages. The talk will focus on a new way of defining security of cryptographic protocol.

- - - - -

14. 4. 2005

V. Ulman
Voxel-based Registration Methods in "in vivo" Imaging
Abstract:
The progress in modern cell biology and microscopy allows researchers to study huge amounts of high resolution data. The help of computers with automatic processing is therefore indispensable. In the field of in vivo imaging the correspondence finding problem is the most challenging. In the presentation we will provide an introduction into basic methods -- point-based registration methods and the optical flow technique. A proposal of a new method based on motion history images will be outlined as well. Finally, we will shortly discuss a comparison of these methods.

L. Boháč
Quantum Information Processing in Cryptography (Will quantum cryptography replace classical one?)
Abstract:
Quantum computing is a relatively new and rapidly developing field of science. It is an interdisciplinary field which combines classical computer science, mathematics and quantum physics and has recently achieved considerable progress. The talk will focus especially on the promising fields of quantum cryptography. Strange properties and power of quantum mechanics allow to threaten contemporary cryptographic systems with quantum computer. On the other hand, they also allow to design new secure cryptosystems and cryptographic protocols. Examples of exploiting quantum mechanics in cryptography together with their advantages and drawbacks will be presented.

- - - - -

21.4. 2005

M. Křipač
Multi-Tiered Data Distribution in Web-Based Systems
Abstract
On-line transaction processing in web-based systems requires more and more sophisticated methods of data storage and distribution. This presentation will discuss some important limits of current design strategies and an alternative model of data processing will be presented. We will also focus on practical implementations of this model and its further contribution to development of Masaryk University Information System.

- - - - -

28. 4. 2005

P. Drášil
The past, present and future of e-Learning
Abstract:
Education is one of the fields, where computers and related technologies are still seeking their role. First, we will mention some basic terms, concepts and issues in e-Learning. The presentation will then describe the historical evolution of e-Learning technologies, including some highlights from the past, the current state-of-the-art, and possible future directions

B. Zimmerová
Component-Based Systems
Abstract:
Current evolution in software engineering heads towards reusability of software parts - components. Component-Based Software Engineering (CBSE) is becoming popular even in large projects with high importance of reliability and correctness. In this talk, the main features and benefits of component-based systems will be introduced and applicability of some formal methods will be discussed.

- - - - -

12.5. 2005

P. Fibich
Model of Grid Scheduling Problem
Abstract:
An introduction to grid scheduling will be presented. This presentation is focused on the Graham's classification of scheduling problems. We will use basic parameters and extensions of the classification to cover a Grid Scheduling Problem (GSP). The GSP consists of heterogeneous distributed resources. It has a dynamic nature and layered structure. The goal of presentation is to find a suitable model for GSP based on standard classification.

R. Pospíšilová
3D reconstruction from images and self-calibration
Abstract:
This presentation will discuss the possibility to obtain three dimensional reconstruction of scene only from information contained in an image sequence. Scene geometry and camera geometry are assumed to be unknown.

- - - - -

19. 5. 2004


P o s t e r S e s s i o n
Abstract
Prezentovány budou postery vytvořené v jarním semestru

- - - - -

- - - - -

- - - - -

 

Vedoucí semináře: doc. RNDr. Ivan Kopeček, CSc. (kopecek@fi.muni.cz)