|
|
Implementation of the DEECo component framework for embedded systems
Matěna, Vladimír ; Bureš, Tomáš (advisor) ; Bednárek, David (referee)
Recent development in the field of distributed and decentralized cyber-physical systems led to emerge of DEECo model. As many DEECo use cases are embedded applications it is interesting to evaluate DEECo on embedded hardware. Currently there is only reference DEECo implementation which is written in Java thus cannot be used for embedded applications. As part of this thesis C++ DEECo mapping and embedded CDEECo++ framework were designed using FreeRTOS operating system for task scheduling and synchronization. An example application designed for the STM32F4 board demonstrates usability of the framework. This thesis contains description of the DEECo mapping into the C++ language, source codes of the CDEECo++ framework, documentation and example application including basic measurement of its real- time properties. Powered by TCPDF (www.tcpdf.org)
|
|
|
Static analysis of C# programs
Malý, Petr ; Bednárek, David (advisor) ; Parízek, Pavel (referee)
The goal of this diploma thesis is to study and implement selected methods of static code analysis for C# programs translated into the Common Intermediate Language. The results of this work are integrated into the ParallaX Development Environment system. This diploma thesis focuses on Structural, Points-to and Dependence. analysis. Powered by TCPDF (www.tcpdf.org)
|
|
|
Framework for information extraction from the large language data sets
Kuboň, David ; Križ, Vincent (advisor) ; Bednárek, David (referee)
This thesis describes the FAFEFI program that focuses on n-gram and skip-gram extraction from large data sets. The thesis presents two different approaches to passing input data to the program. It also describes the design of data structures for n-gram and skip-gram representation within computer memory, the algorithm of n-gram and skip-gram extraction, memory-friendly options of saving extracted data and their final composition into output feature vectors. It also offers a variety of extra functions such as line filter and line modifier and a great deal of configurable parameters ranging from in-file separators to formatting the names of output files. Moreover, the program provides a differentiation in its activity by enabling saving data just after extraction from the train set and brings tools for cluster parallelization. Powered by TCPDF (www.tcpdf.org)
|
|
|
Analysis of a File System Using the Verifying C Compiler
Škorvaga, David ; Kofroň, Jan (advisor) ; Bednárek, David (referee)
Title: Analysis of a File System Using the Verifying C Compiler Author: Bc. David Škorvaga Department: Department of Distributed and Dependable Systems Supervisor: RNDr. Jan Kofroň, Ph.D. Abstract: Formal verification is a way to improve reliability of software systems. One approach of formal verification is focused on proving correctness of annotat- ed source code of an established programming language. Verifying C Compiler (VCC) is a verifier for concurrent C that accepts an annotated code in C language and automatically verifies its correctness with respect to the given annotation. There have been successful attempts to verify some critical systems, including the operating system kernel. Another critical part of operating system is its file system. In the thesis, we choose FatFs file system, a simple device-independent implementation of the FAT file system. We specify a part of it using the VCC annotation and successfully verify its correctness. Keywords: Formal Verification, File System, VCC
|
|
|
Optimizing scriptable generator of terrain maps
Zábský, Matěj ; Bednárek, David (advisor) ; Kahoun, Martin (referee)
The goal of this thesis is to develop a procedural terrain height map generator programmable using a Turing complete scripting language. The generator must allow rendering of partial maps by generating arbitrary rectangular region of the map described by any script. The thesis explains why this means the traditional script execution model won't work in this case and proposes a novel two stage model, which executes the scripts in two stages - a simulation stage and a rendering stage. Powered by TCPDF (www.tcpdf.org)
|
|
|
An IDE for C# Script Development
Pelc, Jan ; Ježek, Pavel (advisor) ; Bednárek, David (referee)
The goal of this thesis is to explore tools for using the C# programming language to create scripts - short programs for quick and easy solving of small, usually one-time temporary tasks that usually arise during the work on larger projects. In the thesis we analyze existing tools and identify their advantages and disadvantages, formulate requirements for our own tool, and develop our own tool. The result of the thesis is a small integrated development environment (IDE) for quick and easy authoring of scripts in the C# language. The IDE offers sufficient features to allow easy authoring and debugging of programs consisting primarily of a single C# source code file. In the work we make heavy use of the NRefactory library for syntactic and semantic analysis of the C# source code. Powered by TCPDF (www.tcpdf.org)
|
|
|
Implementace a evaluace protokolu CBOR
Kalvoda, Pavel ; Bednárek, David (advisor) ; Kofroň, Jan (referee)
CBOR (RFC 7049) is a recent binary schema-less data serialization protocol similar to JSON and BSON. It introduces several novel concepts, such as explicit streaming support and extensible semantics. A robust, generic, standard-compliant implementation for C is developed and presented, along with its binding for the Ruby language. Both the implementation and the protocol itself are critically evaluated by both experimental and theoretical inquiries. The measurements show that the implementation achieves performance superior to relevant alternatives while still providing a rich set of features. CBOR offers functionality and efficiency on par with or superior to the alternatives. Both high- volume applications and constrained node systems might benefit from CBOR. Some of its features, however, were shown to be needlessly complex or impractical. Suggestions addressing these deficiencies are presented. Several other approaches to implementing CBOR are proposed and discussed. Powered by TCPDF (www.tcpdf.org)
|
|
|
Genetic programming in financial markets forecasting
Krejčí, Tomáš ; Bednárek, David (advisor) ; Majerech, Vladan (referee)
The aim of this thesis is to test usability of the genetic programming for predicting of the financial markets based on historical prices. The thesis includes the study of genetic programming techniques used or useful for the market prediction. The practical part of thesis is implementation of selected methods and testing their performance on available historical data from financial markets. Powered by TCPDF (www.tcpdf.org)
|
|
|
Computerized bookkeeper
Pavlovský, Jiří ; Bednárek, David (advisor) ; Daniel, Jakub (referee)
Main aim of this work is implementation of a system to help departmental accountants with administration of a budget. System will make it possible to administer not only of completed expenditures but also expenditures planned. Also, it will offer administration of individual budgets and planning of expenditures in a financial year. The system will cooperate with the official accounting system by importing its data exports. Powered by TCPDF (www.tcpdf.org)
|
|
|
Capturing Performance Assumptions using Stochastic Performance Logic
Trojánek, Tomáš ; Tůma, Petr (advisor) ; Bednárek, David (referee)
Performance testing is a mean used to evaluate speed of software projects. In an ideal state a project has a set of tests attached to it and such set may be repeat- edly executed in order to verify that all performance expectations are satisfied. The most widespread method of constructing these tests nowadays is based on measuring absolute time values. A test executes a chosen application unit and then compares the time it took to complete with a precise bound, which has been determined in advance. However, this approach has several disadvantages that affect reliability of such tests. First of all, the way in which those precise bounds should be established is not clear. And even if it is, then the bounds are tied to a certain hardware configuration. As a remedy, this thesis demonstrates a whole another approach, which is based on relative performance comparison. Using a logic built on top of a research published by the issuing department, chosen application units are compared together in a manner that makes results of such tests more reliable even to a change of hardware configuration. The presented theory is also implemented and verified on selected use cases. 1
|
guest ::
