translated by Google

Seminar program for 2002/2003

St. 12.00 - 13.00, A107
Lecturer: doc. RNDr. Ivan Kopeček, CSc. ( kopecek@fi.muni.cz )

Autumn 2002

26. 9. 2002
Introductory Seminar Seminar
Program:
Information on Seminar Concept in the Autumn Semester.
Agenda of the seminar.
Discussion.
3. 10. 2002
L. Bartek
Development of the dialog interface for the library system
Abstract
In the Speech and Dialogue Laboratory a dialogue interface is developed to access library systems. The currently-used VoiceXML-implemented dialogue strategy forces users to answer a number of questions in some situations, some of which may be irrelevant to its demand. The lecture will address both the solution of this problem by alternative strategies and the methods used.
10. 10. 2002
Meetings and discussions with the MU FIU
In addition to doctoral students, all other students interested in student research are invited. Take the opportunity to get information, formulate your opinions, problems, questions, and participate in open and informal discussions.
17. 10. 2002
Prof. J. Gruska
How to get famous
Abstract
Some thoughts and examples how one can get easily known (under certain conditions).
24. 10. 2002
P. Švéda
Security aspects of using the electronic signature
Abstract
The electronic signature has an embedded legislative framework (both by law and operating decree), but in connection with the practical use and mass extensions a number of open, neglected and unresolved issues arise. The signature is created by a computer, but it is far from being the only stone of an accident. The lecture will discuss the security aspects of using the electronic signature in practice and will point out possible approaches to solving isolated problems.
31 October 2002
P. Adámek
XML document search
Abstract
TBA
7. 11. 2002
M. Povolný
Electronic dictionaries
Abstract
Electronic dictionaries and lexical databases are an important part of NLP infrastructure. In the Natural Language Processing Laboratory we are working on a set of tools for the preparation, querying and presentation of electronic dictionaries and encyclopaedias intended for common use by an unskilled user as well as on the preparation of databases of semantic relations for other NLP tools. I will present the basic tools and concepts that we use and also some plans for the near future.
14. 11. 2002
J. Bouda
Encryption of quantum information
Abstract:
The quantum cryptography is a fast growing branch of quantum information processing. The most fundamental results of quantum cryptography include quantum distribution of key, quantum secret sharing, quantum oblivious transfer and other cryptographic protocols. The rapid evolution of quantum cryptography enforced the evolution of the quantum information encoded by the so-called quantum private channel, in which the plaintext is quantum information, the transmission channel is quantum and the key is either quantum or classical. As a consequence, we do not have to care about the secure distribution of quantum information, but we can focus our attention on the protocol itself.
P. Tišnovský
Brno University of Technology, FIT
Modeling and visualization of elastic bodies using hybrid particle systems
Abstract:
This presentation will provide information on body modeling using hybrid particle systems. A hybrid particle system that combines the properties of free and bound particles is useful when using elastic or deformable bodies to model. The presentation will describe the way of modeling these bodies and simulation of deformations when external forces are applied to the body. There will also be presented ways to visualize bodies simulated by the particle system.
21. 11. 2002
J. Dohnal
Searching in Metric Spaces
Abstract
In order to speed up retrieval in large collections of data, the index structures partition the data into subsets so that query requests can be evaluated without examining the entire collection. As the complexity of modern data types grows, metric spaces have become a popular paradigm for similarity retrieval. A new index structure, called the D-Index, combines a novel clustering technique and the pivot-based distance search strategy to speed up the execution of similarity range and the nearest neighbor queries for large files with objects stored in disk memories. Contrary to tree organizations, the D-Index structure is suitable for dynamic environments with a high rate of delete / insert operations.
28. 11. 2002
F. Procházka
UMT - Architecture and Applications
Abstract
We will present the tool which is used as a framework for building knowledge-oriented systems. This tool is called the Diamond tool and is the member of the Universal Modeling Tools (UMT) class. The key features of the Diamond tool are
- the ability to manage a meta * modeling (the number of the "meta" prefixes is not restricted)
- ability to use this tool as a modeling tool and as a production system at the same time
We will show how we can use these features and how it is implemented. We will mention some applications that use the Diamond tool. The Diamond tool is implemented in Prolog and version 1.3.0 is currently available.
5. 12. 2002
D. Svoboda
Segmentation of tissue nuclei obtained from confocal microscope
Abstract:
We have been developing a large project in the Laboratory of Optical Miscroscopy which offers a simplified analysis of biological specimens obtained from confocal microscopy. There is a necessary part of this project - it's a graphics library that supports many non-trivial 3D-image analysis functions. The aim of this talk is to introduce a draft of one module of this library. The module is about how to segment tissue nuclei and analyze them. Because the problem of tissue segmentation is very difficult and today there is no good algorithm dealing with this problem, we will be discussing other similar or more successful methods that have already been published.
12. 12. 2002
J. Stibor
Searching for groups of chromosomes in the digital biomedical image
Abstract
Nowadays it is necessary to process a large amount of image data in many branches of medicine. There are two possible approaches to processing - either human controlled or fully automatic processing. The automatic approach is for many reasons better. I will present the fully automatic algorithm for searching for groups of chromosomes in digital biomedical image. Input images were obtained from the Laboratory of Optical Microscopy, FI MUNI. For their further analysis it is necessary to locate areas containing biological material (in this case chromosomes) and this is just the work for the mentioned algorithm.
POSTER SESSION
Jiri Barnat: How to Distribute LTL Model-Checking Using Decomposition of Negative Claim Automaton
Jan Pesl: Implementing neural network computations in Maple
Jan Strejcek: Boundaries of Equivalence Checking
Pavel Kolcarek: Multiresolution methods in force feedback
Jitka Zidkova: An Implementation of a Distributed Modular Model Checking Algorithm
Lubomir Markovic: Objects with Changeable Roles
David Safranek: SGCCS
Radek Oslejsek
David Antos, Petr Sojka
Jan Flasar, Ludek Pokluda: VRECKO
Miroslav Hrad: Time Stamping
Michal Batko: Scalable and Distributed Data Structures
Zdenek Kaminski: Combo 6
Jaroslav Silbersky: Environmental decision support systems

Spring 2003

26. 2. 2003
Introductory Seminar of the Spring Semester
Program:
Information on the seminar concept in the spring semester.
Agenda of the seminar.
Discussion.
5. 3. 2003
J. Stibor
Searching for groups of chromosomes in the digital biomedical image
Abstract
Nowadays it is necessary to process a large amount of image data in many branches of medicine. There are two possible approaches to processing - either human controlled or fully automatic processing. The automatic approach is for many reasons better. I will present the fully automatic algorithm for searching for groups of chromosomes in digital biomedical image. Input images were obtained from the Laboratory of Optical Microscopy, FI MUNI. For their further analysis it is necessary to locate areas containing biological material (in this case chromosomes) and this is just the work for the mentioned algorithm.
12 March 2003
James Thomas
Presentations in English and English in Presentations
Abstract
As a good command of English is necessary to survive in academia in the modern world, this one-off lecture-workshop will touch on a few issues relevant to non-native speakers writing and speaking in English for academic purposes. Having proofread many academic papers written by Czechs in English, and having attended numerous lectures and presentations given by Czechs in English, it is hoped that some of the conclusions from this data will be salutary. Furthermore, some general observations on the way of presentations will be proffered
19 March 2003
Jan Frisch
Gentle introduction to NET and Grid Management
Abstract
The presentation will give an introductory overview of the network, computers, clusters and Grids management. Selected techniques of network monitoring and management through standardized protocols and services will be discussed, followed by presentation of their use in large scale computing and storage systems, with emphasis on heterogeneous environments. An illustration of how these methods can be applied to the integration of distributed systems and the creation and management of "virtual organizations" will also be presented. The last part will be dedicated to the expected contribution to end users and project oriented teams and to future trends.
26.3. 2003
M. Kubásek
Introduction to the Semantic Web and Ontologies
Abstract
The semantic web is a vision of the future of the World Wide Web brought forward by the inventor of the web, Tim Berners-Lee. It is not a utopian vision, but more of the feeling that the web has created enormous possibilities and that the right thing to do is to make use of these possibilities. The fundamental part of the semantic web is ontologies, which provide a description of knowledge representation at the meta-level. Ontologies add explicit metainformation describing semantics to data. Knowledge in ontologies is formalized using five types of components: classes, relations, functions, axioms and instances. Nowadays, computers are going through the change from standalone isolated devices to entry points to a world information exchange network. Therefore, support for efficient data, information and knowledge exchange is becoming the key effort in modern computer technology. Ontologies can offer such support. Ontologies also enable the reuse of existing knowledge bases in knowledge engineering.
April 2, 2003
Eva Lasarcyk
Studies of Phonetics and Computational Linguistics in Bonn
Abstract:
The talk gives brief information about Bonn University, teaching and research, especially at the presenter's home institute "Institut für Kommunikationsforschung und Phonetik". The talk will focus on speech processing as well as formal semantics, corpus linguistics, and text technology / hypermedia (milca project). Depending on the audience's interests, the presenter is ready to talk about the study of informatics at her university as well. Finally, a very brief overview of the study in Bonn and Germany in general is provided.
L. Svoboda
UIO Dialog System
Abstract:
The presentation will cover the UIO dialogue system. The system is designed to answer questions in the Czech language. It is a domain-oriented system with a solid knowledge base. No restrictive requirements are applied to the set of words used. Simple configuration of domains, easy editing and "learning" of new sentences are taken into consideration.
9. 4. 2003
Jan Pešl
Teaching math with MappleNet project
Abstract
Computer-assisted math teaching becomes very important by expanding information technologies. The offer of the synoptic visualization of math definitions and computations becomes math much more comprehensible for students. The authors of computer algebra systems are therefore developing new software projects related to math teaching. In case of Maple, there was introduced a project called MapleNet. It offers a complete software platform to enhance mathematics and related courses over the Web. It is suited to meet emerging challenges of distance, continuing, professional and many other non-traditional forms of education and training. It offers innovative client-server based software components to make it easy for instructors to create and distribute electronic supplements and enhancements to courses. MapleNet provides students with a rich interactive environment to explore difficult concepts. Its applications and lesson components can be easily launched from any web browser and do not require any advanced computing knowledge to run, so students can spend their time learning rather than operating software. MapleNet combines a Maple software engine on a server with Java-based Web interfaces.
16. 4. 2003
L. Pokluda, J. Sochor
Spatial haptic orientation for visually impaired people
Abstract
Is it possible to show space relationships to blind people? Techniques and experiments described in this talk explore several ways blind people can access spatial information using a one point force-feedback device. The presentation focuses on techniques supporting their orientation in buildings. Preliminary results show that a wider spectrum of different techniques is needed for blind people.
23.4. 2003
Petr Kuba
Exploiting Sampling and Meta-Learning for Parameter Setting for Support Vector Machines
Abstract:
It is a well-known fact that good parameter settings affect the performance of many machine learning algorithms. Support Vector Machines (SVM) and Neural Networks are particularly affected. In this paper, we focus on SVM and discuss some ways to set its parameters. The first approach uses small samples, while the second one exploits meta-learning and past results. Both methods have been thoroughly evaluated. We show that both approaches allow us to achieve quite good results with significant savings in experimentation time.
Michal Batko
TBA
30. 4. 2003
David Antoš
Associative Memories for IP Packet Routing
Abstract
The lecture describes the design of a Lookup Processor in the Combo6 IPv6 / IPv4 accelerating card for IP routing. Header matching in IPv6 requires more than 440 bits to be checked when packet filtering is requested.
It is advantageous to use Content Addressable Memory (CAM) to perform a match, unfortunately, the breadth of the widest available CAM market is not enough. More advanced processing is required. We propose a search processor based on CAM combined with a subsequent tree structure. For the purpose of the router, the structure must be dynamically (re) calculated out of the configuration, routing table, and firewall setting.
7 May 2003
M. Marciniszyn
Encryption of Classical Information: Using Quantum Channel to Detect Eavesdropping
Abstract
We present a cryptographic system that uses quantum channel to transmit classical information between two parties. The transmitted information is perfectly secure in the sense that it is encrypted using the classical Vernam cipher. Any eavesdropping of the message has a large probability of detection and therefore the key can be reused when no eavesdropping is detected. This system can also be used as the key distribution system.
14. 5. 2003
M. Castle
TBA
21.5. 2003
J. Flasar
Improved interaction in local area
Abstract:
The interaction is almost accomplished with the virtual objects that the user sees. In this talk, we will show the methods for interaction in the user's local area. We will design a collection of methods that allow users to interact not only with visible objects but also with objects that are hidden behind obstacles. At first, we will mention some techniques that have been used to solve the problem of interaction with objects hidden behind the obstacle. Then we will describe new approaches that improve the interaction in this situation. It means, the techniques in question either temporarily change the actual user's location to a better location for interaction or reveal the hidden area by some way.
L. Markovič
Objects with Roles & VRECKO
Abstract:
A brief introduction of a technique for creating applications with dynamic behavior - "Objects with Roles" and its application in HCI Lab's VRECKO system will be presented.
POSTER SESSION

V. Kadlec: PACE - Parser comparison and Evaluation
D. Svoboda, P. Matula: Multilevel Adaptive Thresholding and Dual Simplex Mesh Deformation as a Tool for Tissue Reconstruction
Miroslav Hrad: Time Stamping
Martin Vach: Biometrics
Pavel Kolcarek: Application of LOD in power feedback
Vlastislav Dohnal: D-index: Indexing Metric Spaces
Tomas Hnilica: WSDATA
Filip Prochazka: Diamond Modeling Tool
E. Hladká, P. Holub: AccessGrid Node at Faculty of Informatics
P. Holub: Protocols for High-Speed ​​Networks
Petr Adamek
Martin Povolný: DEB
Stanislav Barton: Semantic Web Technology
Petr Sojka: Presentations in Spring 2003