Object-oriented Graphics Architectures for Global Illumination

by Jiří Sochor, Radek Oslejšek, December 1998, 17 pages.

FIMU-RS-98-08. Available as Postscript, PDF.


The paper presents several examples of object-oriented graphics architectures derived from OO Testbed for Global Illumination. A new architecture based on explorer-with-map paradigm is described and projected on serial HW architecture of Cohen&Demetrecsu.


by Zdeněk Říha, December 1998, 43 pages.

FIMU-RS-98-07. Available as Postscript, PDF.


Certifications are specific procedures which compare references with measurements that allow a party to bind an attribute to an unknown party. There are three main types of methods that have been proposed to deal with this concern: directory methods, based on Certification Authorities: X.509 (e.g. SSL, PKIX), referral methods, based on "introducers" of keys (e.g. PGP), and collaborative methods (e.g. SKIP). All of them are described in the report.

MFCS`98 Workshop on Concurrency - Preproceedings

by Petr Jančar, Mojmír Křetínský, Pre-proceedings of the MFCS`98 Workshop on Concurrency (the PS file is NOT provided, as it is too large (approx. 30MB); take pdf (3.5 MB) instead). July 1998, 209 pages.

FIMU-RS-98-06. Available as Postscript, PDF.


This volume contains the pre-proceedings of the MFCS`98 Workshop on Concurrency, which took place in Brno, Czech Republic, August 27-29, 1998, as a satellite event of the 23rd international symposium on Mathematical Foundations of Computer Science. It is composed of two invited papers delivered by Javier Esparza (Munich) and Faron Moller (Uppsala), and of 17 contributed papers selected out of 24 submissions. The revised (and full) version of the proceedings should appear as a volume of Electronic Notes in Theoretical Computer Science (Elsevier).

Comparing the Classes BPA and BPA with Deadlocks

by Jiří Srba, This is a full version of the paper accepted to MFCS`98. June 1998, 36 pages.

FIMU-RS-98-05. Available as Postscript, PDF.


The class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable. We extend these processes with a deadlocking state into BPA_delta systems. We show that the BPA_delta class is more expressive w.r.t. bisimulation equivalence but it remains language equivalent to BPA. We prove that bisimilarity and regularity remain decidable in the BPA_delta class. Finally we give a characterisation of those BPA_delta processes which can be equivalently (up to bisimilarity) described within the "pure" BPA syntax.

Constraints with Variables` Annotations

by Hana Rudová, This is an extended version of the paper accepted for presentation at ECAI-98. May 1998, 14 pages.

FIMU-RS-98-04. Available as Postscript, PDF.


Variables` annotations in over-constrained problems are proposed and described in order to express preferences for optimal solution selection using preferences on variables. The basic interpretation of variables` annotations is presented and correspondence with hierarchical CSP and possibilistic CSP is described. An algorithm for solving systems of constraints with variables` annotations using mappings to hierarchy is designed. The potential application areas are also mentioned.

Programmed Learning & Hypertext

by Jaroslav Pelikán, May 1998, 6 pages.

FIMU-RS-98-03. Available as Postscript, PDF.


The history of programmed learning and its main principles. The advantages and disadvantages of programmed learning and hypertext systems. The integration of programmed learning and hypertext. The proposal, structure and realization of an electronic textbook. The main advantages of such a textbook.

Off-line Recognition of Cursive Handwritten Czech Text

by Pavel Smrž, Štěpán Hrbáček, Michal Martinásek, February 1998, 8 pages.

FIMU-RS-98-02. Available as Postscript, PDF.


In this paper a part of the system for recognising off-line cursive Czech text is presented. Recently, various systems for recognition of cursive English text has been developed, however, to our knowledge no method has been presented yet for Czech, a language rich in diacritic marks. This paper deals with preprocessing which is different for Czech and English handwritten texts. For finding the letter boundaries a method based on minimising a heuristic cost function has been used.

The Architecture of the Blind User Oriented Hypertext AUDIS

by Ivan Kopeček, February 1998, 7 pages.

FIMU-RS-98-01. Available as Postscript, PDF.


The architecture of the blind user oriented hypertext AUDIS developed at the Faculty of Informatics, Masaryk University Brno, is described in the paper. AUDIS is developed primarily as a support, which would help visually impaired students to study various materials. It can also serve as an Internet browser.