|
|
Animation of Graph Algorithms in MonoGame
Popek, Michal ; Pergel, Martin (advisor) ; Kopecký, Michal (referee)
The result of this bachelor thesis is an application for teaching graph algorithms intended to be used at technically oriented high schools and universities. The application comes with a proprietary language Cb, which is used to write before mentioned graph algorithms. In this text we shall discuss processing and presentation of algorithms, thus we will take a look at compiler and its construction and stepping of algorithms during run time. To draw the graphs we use force-directed graph drawing algorithms for generating the layout of graphs automatically on a computer screen. 1
|
|
|
Online games as a support for teaching the "new" computer science at Secondary Schools
Bohatová, Zuzana ; Pešková, Klára (advisor) ; Forstová, Lenka (referee)
The thesis describes the development of the web application Starting With Computer Science (Začínáme s informatikou) for teaching computer science at the lower secondary level (ISCED 2). The application contains five themes. Each topic is divided into an in- troductory theoretical section and an interactive part. For example, it includes activities such as matching pairs on the topic of data storage, assembling a computer mother- board, or finding a path in a graph. In the thesis, the newly updated Czech national computing curriculum for lower secondary education, known as New Informatics, is in- troduced, followed by an analysis of existing interactive educational websites.Then we present an analysis of our solution, the user and application development documentation. Finally, we review the progress and results from testing the application with third-year students at an eight-year gymnasium.
|
|
|
Weak saturation processes in multipartite hypergraphs
Rajský, Adam ; Tyomkyn, Mykhaylo (advisor) ; Tancer, Martin (referee)
Given hypergraphs H and P, wsat(H, P) denotes the smallest number of edges in a subgraph of H with the property that the missing edges can be sequentially added such that the addition of every edge creates a new copy of P. In 1985 Alon proved that wsat(Kn, P)/n tends to a finite limit for any graph P. A generalisation of this Theorem to r-uniform hypergraphs was conjectured by Tuza in 1992 and proved by Shapira and Tyomkyn in 2021. In this thesis, we use the methodology introduced by Shapira and Tyomkyn to prove a similar theorem when H is a complete r-partite r- uniform hypergraph.
|
|
|
Experimental Analysis of Query Languages in Modern Database Systems
Čorovčák, Martin ; Koupil, Pavel (advisor) ; Holubová, Irena (referee)
The rise of Big Data has highlighted the limitations of relational databases while handling large datasets, leading to the growth of NoSQL databases. This has made DBMS benchmarking crucial for performance evaluation and decision-making. This thesis compares relational (MySQL, SQLite), graph (Neo4j, ArangoDB), docu- ment (MongoDB), and column-family (Cassandra) databases. We analyze the expressive power of their query languages and their runtime efficiency across varying data sizes. We conclude, that there's no "number one" solution for all use cases. The choice depends on factors like data volume, query complexity, and the need for joins. For complex queries and frequent joins, MySQL and SQLite are the most expressive but may struggle with very large datasets. Cassandra and MongoDB excel in perfor- mance and scalability but require efficient schema design and targeted data redundancy. ArangoDB presents a versatile option capable of handling multiple data models but might require further investigation into its performance compared to Neo4j.
|
|
|
Graph Neural Networks in Epilepsy Surgery
Hrtonová, Valentina ; Filipenská, Marina ; Klimeš, Petr
Epilepsy surgery presents a viable treatment option for patients with drug-resistant epilepsy, necessitating precise localization of the epileptogenic zone (EZ) for optimal outcomes. As the limitations of currently used localization methods lead to a seizure-free postsurgical outcome only in about 60% of cases, this study introduces a novel approach to EZ localization by leveraging Graph Neural Networks (GNNs) for the analysis of interictal stereoelectroencephalography (SEEG) data. A GraphSAGE-based model for identifying resected seizure-onset zone (SOZ) electrode contacts was applied to a clinical dataset comprising 17 patients from two institutions. This study uniquely focuses on the use of interictal SEEG recordings, aiming to streamline the presurgical monitoring process and minimize risks and costs associated with prolonged SEEG monitoring. Through this innovative approach, the GNN model demonstrated promising results, achieving an Area Under the Receiver Operating Characteristic (AUROC) score of 0.830 and an Area Under the Precision-Recall Curve (AUPRC) of 0.432. These outcomes along with the potential of GNNs in leveraging the patient-specific electrode placement highlight their potential in enhancing the accuracy of EZ localization in drug-resistant epilepsy patients.
|
|
|
The use of regeneration in the recreational sports population.
Lauberová, Michaela ; Majorová, Simona (advisor) ; Nováková, Pavlína (referee)
Title of the bachelor thesis: The use of regeneration in the recreational sports population Goals: To determine whether recreational athletes use regenerative means and, if so, which specific means are used. To identify the reasons that influence the selection of regenerative means. Metohods: The data needed for the purposes of the bachelor's thesis were collected through a non-invasive online surfy, the quantitative research method was used in the work. The type of research is theoretical-empirical. The online surfy, which is completely anonymous, was posted on the social network Instagram nad Facebook, as an internet link, and was intended for recreational athletes agend 18-65. The research population is made up of the recreational athletes (48 women and 13 men) took part in the research. The data was processed through graphs and tables. Results: Based on the results of the survey, it was found that 91,8 % of recreational athletes use some of the regenerative means (massage, compensatory exercises, and regenerative procedures). According to the subjective perspective, 41 % of respondents reported following a healthy diet. The most frequent reason given by respondents (26,2 %) for using regenerative means was relaxation, and the second most frequent reason (24,6 %) was regeneration. When selecting...
|
|
|
Multi-athletics competitions at modern Olympic Games and international events
Kusák, Karel ; Kolář, František (advisor) ; Kaplan, Aleš (referee)
Author: Karel Kusák Title: Multi-athletics competitions at modern Olympic Games and international events Objectives: Purpose of the bachelor thesis is to describe the history of athletic multi events at the Olympic Games, World Championships and other international events. Furthermore, also to show and describe the development of performances at the mentioned events. Methods: The method of analysis is used in this thesis. The results of athletic multi events at international events from 1912 to 2023 are analyzed. The development of the world record and individual results of selected male and female athletes is also studied in this period. Results: Through this thesis, I have mapped the development of athletic multi events, including its scoring tables, based on the study of selected sources. Using graphs, I have also illustrated the performances of the top three male and female competitors in the selected events. Key words: athletics (track and field), multi events, Olympic Games, World Championship, European Championship, world record, outstanding athletes
|
|
|
The Gabriel-Roiter measure in representation theory
Krasula, Dominik ; Šťovíček, Jan (advisor)
The Gabriel-Roiter measure is a module-theoretic invariant, defined in 1972 by P. Gabriel. It is an order-preserving function that refines a composition length of a module by also taking lengths of indecomposable submodules into account. We calculate all Gabriel-Roiter measures for finite-length representa- tions of an orientation of a Dynkin graph D4 and an orientation of a Euclidean graph ˜A3. In 2007, H. Krause proposed a combinatorial definition of the Gabriel-Roiter measure based on other length functions instead of composition length. We study these alternative Gabriel-Roiter measures on thin representations of quiv- ers whose underlying graph is a tree. 1
|
|
|
Knowledge of contraception among university students
Chaloupková, Aneta ; Majorová, Simona (advisor) ; Nováková, Pavlína (referee)
Title: Knowledge of contraception among university students Objectives: The main goal of this bachelor's thesis is to find out what knowledge Czech university students have about contraception and compare the level of knowledge between women and men. Methods: Theoretical-empirical research was conducted to determine the level of knowledge of contraception among Czech university students using a quantitative method. Research method was chosen a survey, the specific form was an online anonymous survey created on the website www.survio.com, which was shared via a web link through social networks, namely Facebook and Instagram. The survey consisted of twenty-five questions, the first three questions were exploratory, the following three questions were supplementary questions about contraception, and then there were only questions focused on knowledge about contraception. The survey contained closed questions, only the question on age was open-ended. The survey was aimed at students of Czech universities, eighty-four respondents participated, including fifty-nine women and twenty-five men. In this thesis the method of analysis, description and comparative method is used. The obtained data are processed into tables and graphs. The Shapiro-Wilk and Bartlett static diagnostic tests were used, followed by a...
|
|
|
Binary codes induced by the line graph of an n-dimensional cube
Janovský, Tomáš ; Žemlička, Jan (advisor) ; Šťovíček, Jan (referee)
This paper deals with the binary codes from the line graph of the n-cube, then the codes of the design, which is defined by the vertex graph of the n-cube, and finally the dual codes of these codes. The first chapter is devoted to an introduction to the topic and the necessary concepts from the theory of linear codes, graphs and designs are defined there. The second chapter is devoted to the construction of the aforementioned codes, the description of their basic parameters such as the dimension and the Hamming distance of the code, and finally the description of the generating matrices of these codes. Finally, the last chapter deals with the dual codes of the codes constructed in the second chapter especially again the description of the Hamming distance.
|
guest ::
