Bachelor theses
Simulating of different methods of attack on RSA as a teaching application
Author
Tomáš Mahr
Type
Bachelor thesis
Supervisor
RNDr. Jiřina Scholtzová, Ph.D.
Reviewers
doc. RNDr. Josef Kolář, CSc.
Department
GUI for a study of a digital evolution system
Author
Martin Plávek
Year
2016
Type
Bachelor thesis
Supervisor
RNDr. Jiřina Scholtzová, Ph.D.
Reviewers
Ing. Petr Špaček, Ph.D.
Department
Summary
The objective of this thesis was to analyze, design and implement graphic user
interface for the Svet application which is supposed to help us understand the
principles of biological evolution. An initial analysis of the original solution
(application in the C programming language) was done. The appearance of
user interface was designed using Swing technology and a new version of the
Svet application - Svet 2.3.14 - was implemented in Java programming language.
The new solution gives us opportunity to work with the Svet without the necessity of updating the application source code and it provides us with
an output without opening any text files.
Solution for Management and Visualization of Complex Search Queries
Author
Daniel Chabr
Year
2015
Type
Bachelor thesis
Supervisor
RNDr. Jiřina Scholtzová, Ph.D.
Department
Summary
This thesis concerns the possibilities of facilitating the process of creating complex search queries for enterprise search platforms. The analysis part of the thesis discovered common patterns in contemporary query languages. These patterns were then used to design a solution for visualizing the queries in a lucid tree structure and for the management of the queries. Then, I implemented a prototype of the designed solution and tested it. The implemented prototype resulted in a successful proof of concept.
Proposal of an output compression from the application SVET
Author
Vladislav Jásek
Year
2015
Type
Bachelor thesis
Supervisor
RNDr. Jiřina Scholtzová, Ph.D.
Reviewers
Ing. Daniel Dombek, Ph.D.
Department
Summary
The primary purpose of this thesis is to propose and implement optimal
compression of outputs from digital evolution system SVET. The result of
this thesis is a program, from which you can easily get information about the
course of evolution, such as family tree, preparation of individual organisms
or extract certain time period of evolution.
Recursively Constructed Graphs
Author
Anežka Štěpánková
Year
2017
Type
Bachelor thesis
Supervisor
RNDr. Jiřina Scholtzová, Ph.D.
Reviewers
Ing. Daniel Dombek, Ph.D.
Department
Summary
The aim of this work is to present the recurrent graphs defined in BI-GRA and the corresponding linear recurrent equations, which describe number of nodes and edges. Furthermore the recursively constructed graphs were introduced, and the appropriate recurrent equation were presented for some classes of recursively constructad graphs expressing the number of nodes and edges. This work is focused on seven classes -- namely trees, serial-parallel graphs, k-trees, partial k-trees, Halin graphs, cographs, and treewidth-k graphs. The result of the work is the introduction of these classes, a list of recursive constructions of the graphs, examples of some graphs and the corresponding recurrent equation.
Implementation of the multiplication in nonassociative (noncommutative) algebras
Author
Matyáš Hollmann
Year
2017
Type
Bachelor thesis
Supervisor
RNDr. Jiřina Scholtzová, Ph.D.
Reviewers
Ing. Karel Klouda, Ph.D.
Department
Summary
This bachelor's thesis introduces the reader to the subject of nonassociative algebras and superalgebras, which are mathematical structures (sets equipped with some operations on them). It also presents to the reader the concept of free (super)algebras that define identities and superidentities of varieties. The second part of this thesis focuses on one alternative niln superalgebra on one odd generator for which an interactive computer program has been developed. This program can evaluate any arithmetic expression in said superalgebra. For a fixed n it can also evaluate the niln superidentity in this superalgebra. The program supports output in the Wolfram Mathematica format and for greater user convenience even in LaTeX.
Mobile Application for Route Search in Prague Public Transport
Author
Artem Kandaurov
Year
2018
Type
Bachelor thesis
Supervisor
RNDr. Jiřina Scholtzová, Ph.D.
Reviewers
Ing. Jiří Chludil
Department
Summary
This thesis deals with the shortest path problem in a time-dependent directed weighted multigraph. An example of such graph is a public transport network built with GTFS data. The aim of the thesis is to design data structure and algorithm for routes search in transport networks and design optimizations to improve route search process. The result is an offline mobile application for public transport route search in Prague.
Master theses
Information System for INEX Slovakia
Author
Filip Sakala
Year
2018
Type
Master thesis
Supervisor
RNDr. Jiřina Scholtzová, Ph.D.
Reviewers
Ing. Ivan Halaška
Department
Summary
The aim of this master thesis is to create an information system for the non-profit, non-governmental organization (NGO) INEX Slovakia. The scope of activities of the NGO includes volunteering and educational activities in Slovakia and abroad in cooperation with partner organizations.
Following a thourough mapping of the processes relating to the work of the employees of INEX Slovakia (as well as their requirements), an IS has been designed and implemented within the Ruby on Rails framework using a MySQL database. The implemented IS was subsequently tested by automatic unit tests, as well as the users themselves. The IS was then deployed to a cloud server solution Microsoft Azure using the Phusion Passenger tool. The information system will optimize the work of INEX Slovakia employees in the future by simplifying many tasks that are being done manually or by hand as of today.