Technical Reports

A list with abstracts sorted by year - 1997

DESAM - Approaches to Desambiguation

by Karel Pala, Pavel Rychlý, Pavel Smr¾, December 1997, 12 pages.

FIMU-RS-97-09. Available as Postscript, PDF.

Abstract:

This paper deals with Czech desambiguated corpus DESAM. It is a tagged corpus which was manually desambiguated and can be used in various applications. We discuss the structure of the corpus, tools used for its managing, linguistic applications, and also possible use of machine learning techniques relying on the desambiguated data. Possible ways of developing procedures for complete automatic desambiguation are considered.

Stepping Stones to an Information Society

by Jiøí Zlatu¹ka, A revised version of an invited talk presented at SOFSEM`97 conference. December 1997, 30 pages.

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

Abstract:

The information revolution is radically transforming many patterns along which society and enterprises have traditionally worked. These changes do not bring just minor technological improvements, but indeed a fundamental transformation of our industry-based society into an information-based one. The changes are most visible and documented within the business world, but the synergy between technological and social shifts does not stop there. In this paper we try to identify and summarize key trends and challenges which this development puts before us.

PHC Format Description

by Pavel Frýda, Ivan Kopeèek, November 1997, 6 pages.

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

Abstract:

The paper contains the presentation of a data format for phonetic corpora called PHC format and proposal of library of utilities designed for manipulation with PHC format.

Bisimulation Equivalence is Decidable for One-Counter Processes

by Petr Janèar, Accepted for presentation at the 24th International Colloquium on Automata, Languages, and Programming (ICALP`97). May 1997, 13 pages.

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

Abstract:

It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter, in fact. Also regularity, i.e. bisimulation equivalence with some finite-state process, is shown to be decidable for the mentioned processes.

Navigation and Information System for Visually Impaired People

by Ivan Kopeèek, Pavel Smr¾, May 1997, 7 pages.

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

Abstract:

Orientation is one of the most important problems of visually impaired people. The aim of this paper is to suggest a contribution to the solution of this problem using computer technology. The basic idea is the detection of motion and orientation using sensors and consequent position identification. The detected trajectory is compared with a map and is corrected by means of the algorithm described in the paper. Some problems concerning sensor detection of human motion are also discussed. Based on the determined position other relevant information is provided to the user of system (information describing the neighbourhood of the actual position, optimal way to the chosen destination, possible warnings).

An Algorithm on Interpolating between Two Shapes of a Molecule

by Ale¹ Køenek, Accepted for the SCCG`97 in Bratislava. May 1997, 10 pages.

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

Abstract:

Conformational behaviour analysis produces a sequence of shapes of a molecule which are only the key points on the entire path. They differ from one another significantly and an interpolation is necessary to achieve a smooth visualization. However, standard interpolation techniques cannot be used. We introduce a hypothesis on the nature of the shape changes and derive an interpolation algorithm. Conditions required for proper function as well as some ideas how to overcome the algorithm`s drawbacks are presented.

Towards Adjusting Informatics Education to Information Era

by Jozef Gruska, Roland Vollmar, A slightly extended version of the invited paper for IFIP TC3 WG3.2 Workshop "Informatics as a discipline and in other disciplines: What is in common?" May 1997, 33 pages.

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

Abstract:

Since the very beginning of the modern computing era, the scientific and educational community in informatics has been in a continuous search for a proper philosophy, viewpoints, aims, contents, methods and tools. Advances in software, communication and hardware have played by that search the most influencing role, with theory advances having only secondary and declining impacts - in spite of the remarkable success of theory, quite well recognized by the community at large.

The recent developments and advances in computing, communication and informatization of the society point out strongly, that horizons of the field are much broader, and its impacts on the society are far larger than anticipated even by strong optimists. This brings new and strong impetus to reconsider again the aims, scope, contents and methods of education in informatics and in other areas.

In the paper we analyze: (a) needs to change education in informatics; (b) the current situation in informatics education; (c) a framework for a new approach; (d) steps to be done; (3) two case studies.

Bisimilarity of Processes with Finite-state Systems

by Petr Janèar, Antonín Kuèera, These results will be presented at INFINITY`97 workshop. May 1997, 19 pages.

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

Abstract:

We describe a general method for deciding bisimilarity for pairs of processes where one process has finitely many states. We apply this method to pushdown processes and to PA processes. We also demonstrate that the mentioned problem is undecidable for `state-extended` PA processes.

Lower Bound of Distance in 3D

by Petr Koneèný, Karel Zikan, This article is going to be presented at WSCG`97 in Pilsen. January 1997, 16 pages.

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

Abstract:

The term "collision detection" refers to the task of determining whether, in a given set of objects, any two intersect. If they do, then common collision detection systems return either one such pair or all such pairs. The term "proximity computation" refers to a more general task where we determine the nearest or the "most overlapping" pairs of objects. In the article, we present a new method to rapidly compute lower bounds of distances. The lower bound decreases the complexity of collision detection (or proximity computation) by computing "candidates" of collision, i.e., pairs of objects that might intersect. It estimates the lower bound of their distance and rejects pairs that are too far from each other to collide.