|
|
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
|
|
|
Validation of XML documents against XSEM PSM schemas
Skalický, Jakub ; Malý, Jakub (advisor) ; Bednárek, David (referee)
XSEM is a modeling language created for modeling XML schemas. Its implementation, called eXolutio, provides a user friendly interface for modeling schemas in XSEM. The aim of this work is to design an algorithm for validation of XML documents against XSEM PSM schemas and comparison of the expressive power of XSEM PSM with other XML schema languages. The thesis contains the description of fundamental algorithm and all the extensions required to fully support all the constructs and capabilities provided by XSEM. The practical part describes the implementation of the proposed algorithm as an extension of eXolutio.
|
|
|
Analýza paralelizovatelnosti programů na základě jejich bytecode
Brabec, Michal ; Bednárek, David (advisor) ; Ježek, Pavel (referee)
Analysis of automatic program parallelization based on bytecode There are many algorithms for automatic parallelization and this work explores the possible application of these algorithms to programs based on their bytecode or similar intermediate code. All these algorithms require the identification of independent code segments, because if two parts of code do not interfere with one another then they can be run in parallel without any danger of data corruption. Dependence testing is an extremely complicated problem and in general application, it is not algorithmically solvable. However, independences can be discovered in special cases and then they can be used as a basis for application of automatic parallelization, like the use of vector instructions. The first step is function inlining that allows the compiler to analyze the code more precisely, without unnecessary dependences caused by unknown functions. Next, it is necessary to identify all control flow constructs, like loops, and after that the compiler can attempt to locate dependences between the statements or instructions. Parallelization can be achieved only if the analysis discovered some independent parts in the code. This work is accompanied by an implementation of function inlining and code analysis for the .NET framework.
|
|
|
Implementation of selected database operations in parallel environment
Majdan, Ján ; Bednárek, David (advisor) ; Lokoč, Jakub (referee)
Title: Implementation of selected database operations in parallel environment Author: Bc. Ján Majdan Department: Department of Software Engineering Supervisor: RNDr. David Bednárek, Ph.D. Abstract: This thesis describes several design possibilities of database operations in a parallel environment called Bobox. First, the thesis covers theory of da- tabases as well as algorithms needed to implement database operations in main memory. Next part discusses the usage of hash tables to implement parallel data- base operations. The key principles discussed contain hashing approaches based on a shared hash table, as well as principles of data preprocessing (local hash Table). The thesis then describes practical usage of selected database operations, which were implemented based on the principles described in the first theory sec- tions. The implementation also involves performance measurement at different levels of parallelism. Finally, acquired results are analyzed and discussed in terms of scalability of parallelism and performance in the Bobox environment. Keywords: database operations, Bobox, parallelism, hashing, data preprocessing 1
|
|
|
Analysis of Interface Automata with On-Demand Replication
Daniel, Jakub ; Kofroň, Jan (advisor) ; Bednárek, David (referee)
Interface automaton is a model of software component behaviour based on finite state machines. It describes component's provided interface, the supported usage, and required interface, the usage of other components. A considerable number of components can be used in parallel with no bound on the level of parallelism. It is not necessary for the model to attempt to capture such unboundedness. An alternative approach is to allow an increment of the level of parallelism on- demand. This thesis analyses on a theoretical level and proposes a final form of an operation to perform such replication to allow creation of models of an arbitrary level of parallelism of certain parts of its behaviour.
|
|
|
Extracting Linked Data from Excel Files
Dembinný, Šimon ; Nečaský, Martin (advisor) ; Bednárek, David (referee)
Title: Extracting Linked Data from Excel files Author: Šimon Dembinný Department: Department of Software Engineering Supervisor of the bachelor thesis: Mgr.Martin Nečaský, Ph.D, Department of Software Engineering at Faculty of Mathematics and Physics of Charles University Abstract: The major part of the thesis rests in the development of an application for extracting Linked Data from Excel files. The application is created as Microsoft Excel Add-on. The comparison with best freely available tool for Linked Data extraction from table data "Open refine" is provided in the theoretical part together with explanation of the concept of Linked Data itself.
|
|
|
Universal discrete simulator
Vytasil, Jiří ; Pergel, Martin (advisor) ; Bednárek, David (referee)
In this thesis we analyzed the design and implementation of the program allowing you to perform discrete-event simulation. Further in the program we implemented visualization of discrete-event simulation. Emphasis is placed mainly on universality. In addition to the program and its description includes information of discrete-event simulation, which allows easier understanding of program operation. For a description of discrete-event simulation using finite-state automata and regular grammars. These parts are described more in order to more easily understand the description of the discrete-event simulation. The system also allows adjustment of input files for easier operation of the program.
|
|
|
A modern implementation of LALR(1) parser generator
Fišer, Karel ; Bednárek, David (advisor) ; Hnětynka, Petr (referee)
The goal of this thesis is to design and implement a modern parser generator. The result is a program that reads description of some context-free LALR(1) grammar and semantic actions from an input file. To output files the program generates source codes in several target modern object-oriented programming languages for implementation of the syntax analyzer which, when parsing the language corresponding to the given grammar, executes the given semantic actions. Powered by TCPDF (www.tcpdf.org)
|
|
| |
guest ::
