This thesis focuses on design and implementation of a tool for automated generation of test inputs for a specified program trace. The aim of the thesis is to make development of testing suites (complying a given advanced coverage criteria) easier and more effective. These kinds of test suites are used in critical applications with code base written in low-level languages like C/C++ with strict restrictions applied. The tool investigates a program model and what conditions must be met to execute program in a way following provided trace. The tool uses advanced SMT-solver tool (software tool specialized for solving satisfiability problem) for generating fitting values. LLVM compiler framework libraries are used for modelling a program. Z3 library is used as a SMT-solver backend. This thesis brings results in architectural and implementation design of a tool capable of test inputs generation based on program analysis and provided program trace to cover.

This thesis focuses on creating an application for procedural generation and visualisation of a volumetric terrain using the OpenGL library. The terrain is considered to be mostly static, however with a possibility of modification of individual voxels. The project seeks a compromise between rendering performance and the aesthetics. The design is led in a way so that it could be further used as a foundation for a game. An emphasis is put on accelerating used methods on the GPU.

This master’s thesis deals with coding information and QR codes generating. There is described operation principle of QR codes for this purpose, and design of the equipment. This device is able to encode the information received through the serial port and display it in the QR code on the OLED display. Microprocessor is part of the device, so there is outlined the procedure for programming and testing equipment.

Cílem této práce je návrh a implementace aplikace pro simulaci poškození umělého otisku prstu. Při studiu jsem se soustředil hlavně na projekt SFinGe, který je průkopníkem v této oblasti. Specifikoval jsem přesněji oblast zájmu na optický či kapacitní senzor a poškození otisků prstů v závislosti na tlaku a vlhkosti, poškození a pošpinění senzoru a deformaci pokožky. Navrhl jsem způsob implementace těchto vlivů poškozujících umělý otisk prstu tak, aby se lépe podobal reálným otiskům. Tyto metody využívají morfologické operátory a model plastického zkreslení u otisků prstů. Výsledky nejúspěšnějších metod mají o 62.5% horší skóre v komerčním produktu oproti originálu a o jednu třídu horší hodnocení dle normy pro kvalitu obrazu otisku prstu. Přínosem této práce je tedy poškození umělých otisků tak, že prokazatelně dosahují horších výsledků než originál a návrh aplikace, která umožňuje rozšíření o další metody.

This thesis deals with the procedural generation of building models based on a given pattern. The community project OpenStreetMap is used for obtaining datasets that create the buildings platform patterns. A brief survey of classifiers and formal grammars for modeling is introduced. Designing an estate classifier and algorithm for building generation is practical aspect of this thesis, including the algorithm implementation. 3D output meshes are rendered using OpenGL in real-time.

The goal of this thesis was to propose algorithms for procedural generation of realistic three-dimensional tree models and implement them as a library. This library uses a set of 92 mostly numerical parameters as an input and enables to export generated model into 3DS or OBJ file. It's an objective library, written in C++ language and designed mainly for MS Windows platform. Proposed algorithms are able to generate specific biologic species of broadleaf and coniferous trees.

This master's thesis deals with the creation of an extension to the existing information system NLPIS. A part of solution is the creation and maintenance of automatically generated pages for projects in the MediaWiki application. The data will be generated into the MediaWiki from database NLPIS information system and e-mail communications.

This text was written as part of a master's thesis. It describes development of an automatic generator of 3D models for Blender. After a brief introduction to the Blender application some of existing scripts for 3D model creation (tested as part of theoretical research) are presented. After an analysis of features required from an automatic generator various types of swords were chosen as the suitable class of objects for the automatic creation. Next part of this thesis presents basic terms in this field, namely the nomenclature of the swords and other related weapons. Their most important properties are listed and explained. The chapter also provides a simplified abstract of the sword typology. Following chapters describe main ideas of creating the model, explain principles and mathematics behind used algorithms and procedures and provide information about realization of the GUI as well as testing and optimisation. As the text explains these issues, sugestions about possible future enhancements are made. Document is concluded with an evaluation of all achievements and argues impact of this work on its field.

Master's thesis deals with system for fast waveform generation and synchronous data acquistion. Part of this thesis are requirements of system, which will be gradually analysed. The result of analysis will be selection of suitable components for system and its design.

One of the important feature of application specific processors is performance. To maximize it, the compiler must adapt to needs of processor that it is going to compile for and it must generate the most efficient code. One of the ways to do that is to search for appropriate instructions that can be implemented as one instruction with multiple outputs. Afterwards the generated code can be parsed through peephole optimizations that search for instruction patterns and replace them with other instructions to make code more effective. This paper describes the problem of finding and selecting suitable candidates for multiple output instructions. It also provides a brief overview of the few best known algorithms that solve this problem. Eventually it examines possibilities of incorporating this optimizations to LLVM compiler.