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.

SkillSum: basic skills screening with personalised, computer-generated feedback

We report on our experiences in developing and evaluating a system that provided formative assessment of basic skills and automatically generated personalised feedback reports for 16-19 year-old users. Development of the system was informed by literacy and numeracy experts and it was trialled 'in the field' with users and basicskills tutors. We experimented with two types of assessment and with feedback that evolved from long, detailed reports with graphics to more readable, shorter ones with no graphics. We discuss the evaluation of our final solution and compare it with related systems

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

The ADA and Personnel Training

This brochure is one of a series on human resources practices and workplace accommodations for persons with disabilities edited by Susanne M. Bruyère, Ph.D., CRC, Director, Employment and Disability Institute, Cornell University ILR School. This brochure was written by Susanne Bruyère in 1996, and updated in 2001. It was further updated in 2011 by Beth Reiter, an independent legal consultant, Ithaca, N.Y., with assistance from Sara Furguson, a Cornell University Employment and Disability Institute student research assistant

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

Emptiness Problems for Distributed Automata

We investigate the decidability of the emptiness problem for three classes of distributed automata. These devices operate on finite directed graphs, acting as networks of identical finite-state machines that communicate in an infinite sequence of synchronous rounds. The problem is shown to be decidable in LogSpace for a class of forgetful automata, where the nodes see the messages received from their neighbors but cannot remember their own state. When restricted to the appropriate families of graphs, these forgetful automata are equivalent to classical finite word automata, but strictly more expressive than finite tree automata. On the other hand, we also show that the emptiness problem is undecidable in general. This already holds for two heavily restricted classes of distributed automata: those that reject immediately if they receive more than one message per round, and those whose state diagram must be acyclic except for self-loops.Comment: In Proceedings GandALF 2017, arXiv:1709.01761. 13 pages, 2 figure