|
|
Application for creating guitar songbooks from songs available on the web
Mezera, Matěj ; Kliber, Filip (advisor) ; Kofroň, Jan (referee)
The guitar songbook is a list of song lyrics with chords. Most guitarists create their own songbooks, and the existing programs for guitar songbook creation may not cover most of the features that the user expects from them. In this work we are focusing on design and implementation of a new application for guitar songbook creation. The application differs from others in that it allows you to add songs available on the Internet to the songbook. Songs from websites are added to the songbook using the web scraping technique. Other functions of the application are for example editing existing songs, saving the songbook for later editing or adding your own songs to the songbook. The resulting songbook can be saved in several formats, especially in PDF format.
|
|
|
System for management of chess competitions
Sezemský, Josef ; Kliber, Filip (advisor) ; Kofroň, Jan (referee)
We live in a time when digitalization is taking place in all sectors. Yet for chess tournament organisers and participants, there is no modern software to satisfy their requirements. In this thesis we will analyze the individual steps related to the organization of a chess tournament. At the same time, we will also analyze the programs that are currently used to tackle these difficulties. According to the results of the analysis, we will design and develop a web application that will facilitate the chess tournament for all participants.
|
|
|
Prediction of data-profiling duration
Kaštovský, Ondřej ; Kofroň, Jan (advisor) ; Kliber, Filip (referee)
Today, data quality plays a vital role in strategic planning and corporate decision-making processes. The ability to predict the duration of tasks re- lated to data processing and analysis is crucial for efficient use of resources and optimization of work processes. The goal of this work is to extend the functionality of Ataccama ONE, a data management platform of Ataccama, with a new microservice that allows predicting the duration of data profil- ing jobs. Our solution involves identifying the key data characteristics that affect the duration of these jobs and using these insights to prototype a ma- chine learning model to predict job durations. An important part of the solution is also to detect and process newly executed jobs in the platform in real-time and prepare the microservices for future integration into the plat- form. Emphasis is then placed on the quality of the implementation and the extensibility of the solution to predict other types of jobs.
|
|
|
Portfolio performance evaluation
Kočandrle, Vojtěch ; Zavoral, Filip (advisor) ; Kliber, Filip (referee)
Many people invest their money in various assets in order to produce gain. Therefore, they need to monitor how their investments are doing. There are specialized applications for this purpose. However, most of the existing solutions contains only a limited amount of features, especially when it comes to displaying graphs. Users also usually can not decide where data is stored and retrieved from. In out work, we will therefore focus on creating a competitive application that will be expandable using plugins and at the same time simple to use with possiblity of creating graphs and their user-definined layout within the dashboard. The simplicity of the application will also mean that, despite its extensibility, there will be no need to edit any configuration files. All settings will be configurable directly from the graphical user interface. 1
|
|
|
ParsecCore: A parser combinator library in the C# language
Tichý, Michal ; Kliber, Filip (advisor) ; Šefl, Vít (referee)
In this thesis, we implement a parser combinator library in C# inspired by Parsec. Parser combinators refer to a style of parsing where a parser is modeled as function from string to some structured result. Afterward, higher-order functions called combinators are used to combine simple parsers into more complex ones. Other such libraries exist, but in our estimation, they contain various deficiencies. We create an implementation without these faults and also introduce two new modules for parsing indentation- sensitive languages and permutations. We additionally implement two ex- ample parsers to showcase our library.
|
|
|
RISC-V support in MSIM
Papesch, Jan ; Horký, Vojtěch (advisor) ; Kliber, Filip (referee)
In this thesis we have added support for RISC-V into the MSIM emulator. MSIM supported only the MIPS R4000 as a CPU, and has been used for teaching the Operating systems course. This project redesigns MSIM to support multiple CPU architectures and adds an implementation of a RISC-V CPU. RISC-V as an architecture provides a basic instruction set as well as a wide variety of optional extensions. One chapter of this thesis is dedicated to giving an overview of the most important parts of the RISC-V architecture. The extensions that were thought to be useful or necessary for the Operating systems course have been implemented. 1
|
|
|
Family mobile app
Kuraňko, Tomáš ; Kofroň, Jan (advisor) ; Kliber, Filip (referee)
The goal of this work is to create a mobile application that will serve families and their members in their daily activities. This mobile application will include several fe- atures that will make everyday life easier for families and their members. Examples of such features include creating and managing tasks, shopping lists and recipes, storing family information and viewing family members in a family tree. At the same time, the application will serve as a means of communication thanks to the functionality of sharing created tasks, shopping lists and recipes. 1
|
|
|
Lepenka - Modular framework for games development on the .NET platform
Petráš, Kristián ; Kliber, Filip (advisor) ; Kofroň, Jan (referee)
Creating games using the Entity Component System data architecture requires a change in programming approach. Current .NET frameworks as- sume that the user is familiar with the principles of ECS. Therefore, as the interest in creating games using ECS grows, so does the need for a framework that allows intuitive learning of these principles. The result of this work is a data-driven framework with an archetypal data organization allowing for parallelization of systems. In addition, the framework makes extensive use of code generation, leading the user to a previously unexplored declarative way of creating games. Combined with platform independence, Lepenka provides the only solution for the .NET platform that takes on the aforementioned characteristics. Another important feature is code reusability across games, provided by modules allowing full abstraction of game systems and compo- nents.
|
|
|
PlanetSide 2 API Library with Outfit Activity Tracking Discord Bot
Müller, Jiří ; Ježek, Pavel (advisor) ; Kliber, Filip (referee)
The goal of this thesis was to create a .NET library working with a public API of a Census service allowing developers to access data from products of a Daybreak Game Company and utilizing this library to create a bot for a Discord social platform mainly used to track game activities of a player group forming so-called outfit. The library focuses on simple acquisition of game data available through both a REST interface used to query specific game information and a websocket service allowing us to track real-time events as a data stream. Furthermore the library supports storing previously queried data in an internal cache for faster access and reduction of network and service utilization in case of repeated requests. Major requirements for the bot are simple configurability by users, separating the functionality into modules allowing the users to adjust bot features according to their needs and straightforward extensibility of the features by developers. 1
|
|
|
Code changes visualisation
Martinek, Petr ; Majerech, Vladan (advisor) ; Kliber, Filip (referee)
The goal of this thesis is to design and implement a program, which, given two similar versions of source code written in JavaScript, generates a GIF animation showing a step- by-step process of rewriting the first version into the other. Another goal is to design the program in a way, so that the list of supported languages can be extended. To achieve this goal, a simple, language-independent representation of source code is defined and for every considered transformation within this simplified representation, a cost function is defined. Based on this cost function, the cheapest sequence of transfor- mations is found, which is then used to generate the final animation. 1
|
guest ::
