Distributed Graph Automata and Verification of Distributed Algorithms

Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting transitions to be nondeterministic or deterministic, we also obtain two strictly weaker variants of our automata for which the emptiness problem is decidable. As an application, we suggest how suitable graph automata might be useful in formal verification of distributed algorithms, using Floyd-Hoare logic.Comment: 26 pages, 6 figures, includes a condensed version of the author's Master's thesis arXiv:1404.6503. (This version of the article (v2) is identical to the previous one (v1), except for minor changes in phrasing.

Low-energy block of apartments

Diplomová práce se zabývá vypracováním projektové dokumentace čtyřpodlažního nízkoenergetického bytového domu s plochou střechou ve stupni pro realizaci stavby. Jedná se o nepodsklepenou stavbu s hromadnou garáží v prvním nadzemním podlaží. Stavba je navržena s důrazem na celkovou energetickou úspornost, která je doložena podrobným energetickým výpočtem náročnosti budovy podle vyhlášky č.78/2013 Sb. a ČSN 73 0540-2.Diploma thesis is aimed on solution of project documentation design of a four-storey low-energy block of apartments with a flat roof in the degree of project realization. The object has a collective garage on first floor and no basement. The structure is designed with the emphasis on overall energy saving, which was documented by detailed calculation of the energy performance of the building under Decree No.78 / 2013 Coll. and ČSN 73 0540-2.

Deriving content selection rules from a corpus of non-naturally occurring documents for a novel NLG application

We describe a methodology for deriving content selection rules for NLG applications that aim to replace oral communications from human experts by written communications that are generated automatically. We argue for greater involvement of users and for a strategy for handling sparse data

A corpus analysis of discourse relations for Natural Language Generation

We are developing a Natural Language Generation (NLG) system that generates texts tailored for the reading ability of individual readers. As part of building the system, GIRL (Generator for Individual Reading Levels), we carried out an analysis of the RST Discourse Treebank Corpus to find out how human writers linguistically realise discourse relations. The goal of the analysis was (a) to create a model of the choices that need to be made when realising discourse relations, and (b) to understand how these choices were typically made for “normal” readers, for a variety of discourse relations. We present our results for discourse relations: concession, condition, elaboration additional, evaluation, example, reason and restatement. We discuss the results and how they were used in GIRL