|
| |
|
|
Prototype Verification of Modification of Evolutionary Algorithm
Švestka, Marek ; Rajnoha, Martin (referee) ; Šeda, Pavel (advisor)
This thesis is about evolutionary algorithms with a concrete solution for an Aircraft Landing Problem. The goal is to create a genetic algorithm for this task resolution, apply selected modifications and compare all outputs. The program runs with different selection methods which are further reviewed. Input data are taken from Operations research library for this task. The outcome of this thesis gives a closer look to evolutionary programming and it’s problem resolution.
|
|
|
Algorithm for Realistic Vascular Circulation of Synthetic Retina
Dvořák, Martin ; Drahanský, Martin (referee) ; Semerád, Lukáš (advisor)
The aim of this bachelor thesis is to improve an existing tool for creating synthetic retina of the eye. The improvement of an existing software is carried out by changing the algorithm for creation vascular bed. The problem was solved by designing an algorithm which is based on real behavior of vascular system in the retina of the eye. Real pictures were statistically recorded. Mathematical programs created aproximation curves of the blood vessels. Directions of the blood vessels, locations of branching and a number of branching of blood vessels were observed. A model for generation of synthetic pictures was designed based on discovered information and probability of branching. The main results are synthetic retinas which contain patterns of behavior of a real retina of the eye. These pictures have similar number of blood vessels, aiming towards the same location and branching in the same points as real pictures.
|
|
|
Programming tools for development of algorithms and programs at elementary school
Dümont, Jan ; Novák, Jaroslav (advisor) ; Vaňková, Petra (referee)
This thesis monitors the past and current status of the educational area of algorithms and computer programming in elementary school, on the basis of research carried out at the Department of Information Technology and Technical Education of the Pedagogical Faculty of Charles University in Prague. It provides an overview of the different teaching methods and programs that contribute to the development of the skills of pupils, due to their age and skills achieved in this area. In the theoretical part of the thesis are explained the basic concepts of the topic of algorithms and programming, which follows the practical part with the use of these procedures in the ICT lessons and in other school subjects.
|
|
| |
|
|
Balanced and almost balanced group presentations from algorithmic viewpoint
Skotnica, Michael ; Tancer, Martin (advisor) ; Paták, Pavel (referee)
In this thesis we study algorithmic aspects of balanced group presentations which are finite presentations with the same number of generators and relations. The main motivation is that the decidability of some problems, such as the triviality problem, is open for balanced presentations. First, we summarize known results on decision problems for general finite presen- tations and we show two group properties which are undecidable even for balanced presentations - the property of "being a free group"' and the property of "having a finite presentation with 12 generators". We also show reductions of some graph problems to the triviality problem for group presentations, such as determining whether a graph is connected, k-connected or connected including an odd cycle. Then we show a reduction of the determining whether a graph with the same number of vertices and edges is a cycle to the triviality problem for balanced presentations. On the other hand, there is also a limitation of reduction to balanced presentations. We prove that there is no balanced presentation with two generators a, b|ap(m) bq(m) , ar(m) bs(m) for p(m), q(m), r(m), s(m) ∈ Z[m] which describes the trivial group if and only if m is odd. In the last part of this thesis, we describe a relation between group presentations and topology. In addition,...
|
|
|
Algorithms for the computation of Galois groups
Kubát, David ; Žemlička, Jan (advisor) ; Růžička, Pavel (referee)
This thesis covers the topic of the computation of Galois groups over the rationals. Beginning with the classic algorithm by R. Stauduhar, we then review the theory necessary to explain the modular algorithm by K. Yokoyama. More precisely, we discuss the notion of the universal splitting ring of a polynomial. For a separable polynomial, we then study idempotents in the universal splitting ring. The modular algorithm involves computations in the ring of p-adic integers. Examples are given for polynomials of degree 3 and 4.
|
|
| |
|
|
Automated Trading on Cryptocurrency Exchanges
Křesťan, Zdeněk ; Zbořil, František (referee) ; Kočí, Radek (advisor)
This thesis focuses on automated trading on cryptocurrency exchanges. Cryptos are now widespread. The possibility of hier automated buying and selling is an interesting topic, which is more and more mentioned. The main part of the thesis is the design of an algorithm for processing data from stock exchanges, their evaluation and subsequent execution of cryptocurrency trades. It also describes its implementation, testing and possible further extensions.
|
|
| |
guest ::
