Ing. Miroslav Balík, Ph.D.

The "Open Faculty" project that CTU Prague is dealing with this year should fall under the faculty's effort in obtaining higher quality applicants, and should also support in representing the faculty to the general public. The project includes a web that maps fields of study and individual courses to the extent of selected lectures, presentations and other study materials ("study try-out"), the mission of which is to acquaint secondary school students with the faculty curriculum. A "course try-out" will be prepared for applicants in academic year 2013/2014. The "Open Faculty" pilot project will be tested at the Faculty of Information Technologies and Faculty of Electrical Engineering. FIT and FEL currently use the Edux system for the presentation and administration of study materials. This system is adapted to be used by students and educators of CTU. Upon opening the faculty to applicants, the access right methodology will need to be modified along with changing (and creating new) study materials with respect to the given target group. The multimedia contents of 5 courses (topics) are currently in the creation progress.

Cover is a type of a regularity of strings. A restricted approximate cover w of string T is a factor of T such that every position of T lies within some approximate occurrence of w in T. In this paper, the problem of all restricted smallest distance approximate covers of a string is studied and a polynomial time and space algorithm for solving the problem is presented. It searches for all restricted approximate covers of a string with given limited approximation using Hamming distance and it computes the smallest distance for each found cover. The solution is based on a finite automata approach, that provides a straightforward way to design algorithms to many problems in stringology. Therefore it is shown that the set of problems solvable using finite automata includes the one studied in this paper.

Vyhodnoceni implementace DAWGu