Ing. Eliška Šestáková, Ph.D.

Theses

Bachelor theses

Android mobile application for personal safety

Author
Bich Phuong Phamová
Year
2020
Type
Bachelor thesis
Supervisor
Ing. Eliška Šestáková
Reviewers
Ing. Marek Suchánek
Summary
This bachelor thesis deals with the design and implementation of a personal safety mobile application for Android operating system. The final prototype is carried out using standard development practices as well as modern technologies such as Google Maps and the Firebase platform. The application provides users with the ability to call immediate help in critical situations. In case a criminal offense is witnessed, it is possible to publish a report to raise awareness. This thesis contains an analysis of existing solutions, requirements specification, design of the application's architecture, implementation, and usability testing. Possibilities of further development are discussed at the end of the thesis.

Implementation of 2D turn-based strategy game with AI

Author
Ivan Štěpánek
Year
2020
Type
Bachelor thesis
Supervisor
Ing. Eliška Šestáková
Reviewers
Ing. Karel Klouda, Ph.D.
Summary
The thesis deals with creating a strategy game and artificial intelligence learn-ing the game via self-play. It looks into a strategy game genre as well as im-portant components of artificial intelligence. It analyzes several examples ofreal-world games and programs playing strategy games. In the end, the thesisdiscusses the quality of implemented artificial intelligence but also the gameand suggests possible improvements.

Tower Defense AI Competition

Author
Martin Sedláček
Year
2019
Type
Bachelor thesis
Supervisor
Ing. Eliška Šestáková
Reviewers
Ing. Ondřej Guth, Ph.D.
Summary
This work is dealing with a design and implementation of a Tower Defense game prototype. For this cause the analysis of existing Tower Defense games and their game elements was performed. Pathfinding algorithms and games allowing external plug-in of artificial intelligence were also described. The created prototype allows such plug-in of artificial intelligence via scripting.

A Survey on Tree Indexing Problem

Author
Karolina Hrnčiříková
Year
2022
Type
Bachelor thesis
Supervisor
Ing. Eliška Šestáková, Ph.D.
Reviewers
Ing. Štěpán Plachý
Summary
A tree indexing problem is a special kind of tree pattern matching that preprocesses a given input tree to optimize locating one type of query within it. There are many variants of tree indexing problems, and to the best of our knowledge, there does not exist an overview of them. Therefore, we survey existing tree indexing problems and provide categories that help define them. The categories are the following: the type of input tree, the type of queries, what is considered a match, and the type of required answers. One tree indexing problem that we defined using these categories is the subtree rejection problem. This problem focuses on whether a given subtree is present in an input tree rather than where. We discuss two existing solutions to the subtree rejection problem. The solutions are subtree pushdown automata and subtree oracle pushdown automata. Moreover, we also propose an index based on a finite automaton, called the subtree finite automaton. Given an input tree and a query pattern, the query time of all three methods depends only on the size of the query pattern and not on the size of the preprocessed input tree. To assess the efficiency of the solutions in practice, we compare their performance on ranked ordered trees with heights of up to 15. In these experiments, subtree finite automata perform the best with respect to build and query time.

Travel Journal - Web Application

Author
Jan Truchlý
Year
2021
Type
Bachelor thesis
Supervisor
Ing. Eliška Šestáková, Ph.D.
Reviewers
Ing. Tomáš Nováček
Summary
This thesis deals with the design and implementation of a prototype web application which is used to record and organize travel experiences. The main content of this thesis is characerization of the problem of experience management, analysis of application requirements, design of its prototype and its subsequent implementation, testing and discussion of possible extentions. The result was achieved by creating the prototype.

Automata Approach to XML Data Indexing: Implementation and Experimental Evaluation

Author
Lukáš Renc
Year
2018
Type
Bachelor thesis
Supervisor
Ing. Eliška Šestáková
Reviewers
Ing. Jan Trávníček, Ph.D.
Summary
This thesis deals with implementation and an experimental evaluation of some XML data indexing methods. The methods are as follows:Tree String Path Automaton (TSPA), Tree String Path Subsequence Automaton (TSPSA) and Tree Path Automaton (TPA). All of these methods are based on the theory of finite automata and answer a limited subset of XPath query (limited to ${/,//}$ transitions and their combination) in linear time to the length of the query. They are implemented as a Java library. SAX library is used to preprocess an XML document. The main part of the thesis is dedicated to a description, an implementation and conditions under which experiments are conducted. In the thesis experiments are run to clarify relations between Size/Depth/Width of an XML document and RAM consumption/Time to build an index. The chosen XML documents, which are presented in this thesis, form a set of mutually different documents in crucial aspects (average depth, maximal depth, size, number of leaves). Results of the conducted experiments are described in the end of the thesis. There is built-in support for experimental environment in the resulting Java library.

Direct Sales System

Author
Tereza Živnůstková
Year
2018
Type
Bachelor thesis
Supervisor
Ing. Eliška Šestáková
Reviewers
Mgr. Martin Podloucký
Summary
This thesis deals with creation of the Direct Sales System (DSS). The main purpose of DSS si to store information about customers, orders, meetings, etc. First part of the thesis contains analysis of existing systems and future requirements. The second part deals with design and implementation of a functional DSS prototype. The prototype was implemented as a desktop application in Java and JavaFX.

Automata Approach to XML Data Indexing: Selecting Unknown Nodes

Author
Maria Karzhenkova
Year
2018
Type
Bachelor thesis
Supervisor
Ing. Eliška Šestáková
Reviewers
Ing. Tomáš Pecka
Summary
Being a part of the "Automata Approach to XML Data Indexing" project, this thesis is concerned with studying the existing methods of indexes creation algorithms based on the automata theory and extending them to deal with more significant fragment of XPath queries. The presented methods allow us to construct XML data indexes that support evaluation of all XPath queries using any combinations of child (/), descendant-or-self (//) axes, asterisk (*) and nodename node tests. Given an XML document D and its corresponding XML tree model T with n nodes, the tree is preprocessed and the index for the document D is constructed. The searching phase time of each of the constructed indexes for a query Q is bounded by O(m), where m is size of the query Q, and does not depend on the indexed XML document size n. Moreover, the space and time complexities for each of the proposed indexes are discussed, all the introduced algorithms are implemented and tested over the real-life datasets.

Master theses

Automata Approach to Approximate Tree Pattern Matching

Author
Lukáš Renc
Year
2020
Type
Master thesis
Supervisor
Ing. Eliška Šestáková
Reviewers
Ing. Ondřej Guth, Ph.D.
Summary
This thesis is focused on approximate tree pattern matching via pushdown automaton. It uses tree edit operations defined by Selkow. The thesis studies methods of approximate tree pattern matching problem and propose of a new method for searching occurrences of tree pattern in an input tree with edit distance up to k and using pushdown automaton as a computational model. The method receives a tree pattern on the input and creates a pushdown automat for it. The automaton is then used for processing an input tree T - it searches occurrences of the tree pattern in the input tree. This thesis consists of theoretical background, the proposal of the method, implementation of the method, and its experimental testing. The method is implemented in Java programming language. The last part of the thesis are experiments that show the sensitivity of the method to the internal structure of both input trees.