|
|
Game theory on graphs
Osička, Ondřej ; Vašík, Petr (referee) ; Hrdina, Jaroslav (advisor)
The subject of this thesis is to introduce game theory and cooperative game theory in relation to graph theory. Game in characteristic function form is used to model the cooperative game. The optimal division of payoff among the players is determined by means of Shapley value and game kernel. Examples of practical use are presented. To examine more complicated game network or to express relationship between players both directed and undirected graphs are used.
|
|
|
Rings of order p^2 and p^3
Haluza, Vít ; Hrdina, Jaroslav (referee) ; Kureš, Miroslav (advisor)
This Bachelor thesis deals with classification and studying of properties of rings of order p^2 and p^3 (p is prime). Terms such as ring ideal or polynomial over finite field are introduced and used in this thesis. Apart from abstract unspecified rings, some special types of finite rings are also mentioned and classified. Program package, which is able to automatically classify given ring of order p^2 is also part of this thesis.
|
|
|
Lie groups theory in robotics
Horník, Petr ; Vašík, Petr (referee) ; Hrdina, Jaroslav (advisor)
In this thesis we focus on the mathematical description of the forward kinematics in three-dimensional space using orthogonal transformations and matrix theory. Applying the acquired knowledge we solve an example using the method of moving frame. Between bases we pass using the passage matrix and we implement the example in the MATLAB environment. Consequently, we focus on deeper relation with exponential functions and extend the theory by the theory of Lie groups and algebras. Especially, we take notice of the special orthogonal group SO(3). Finally, we enrich the theory with homogeneous transformation and special Euclidean group.
|
|
|
Voronoi cell constructions on the map
Čermák, Jan ; Hrdina, Jaroslav (referee) ; Pavlík, Jan (advisor)
This bachelor’s thesis deals with study of Voronoi cell and its representation in Voronoi diagrams and their construction on the model of Earth’s surface. At first, Voronoi diagrams and their characteristics are explained in a plane, we describe their construction using Fortune’s algorithm, then spherical geometry is explained. Then we take a look at some equations that are useful for calculating on a sphere, and we use them for calculating distances on Earth, which we approximate with a sphere. Finally we apply Fortune’s algorithm on a sphere, we explain the principles of construction of Voronoi diagrams with this algorithm on a sphere and changes compared to the planar case that must be taken care of. The goal of the thesis is to display Voronoi diagram on Google maps, thus we work with Google Maps API.
|
|
|
Mathematics principles of Navigation
Petrovič, Branislav ; Vašík, Petr (referee) ; Hrdina, Jaroslav (advisor)
This bachelor's thesis deals with the calculating of the position of the GPS receiver using the method of Cramer's rule. Subsequently, the errors generated during the transmission are described. The geodetic coordinates for the calculated position in space are introduced. The calculations of the receiver position by Cramer's rule and the calculations in geodesy are performed using MATLAB.
|
|
|
The transfer of elliptic curves onto the torus
Bajko, Jaroslav ; Hrdina, Jaroslav (referee) ; Kureš, Miroslav (advisor)
Elliptic curves are an essential part of modern mathematics and play an important role especially in cryptography. The bachelor work focuses on the visualization elliptic curves and group operation in real plane and torus. In the first chapter we will introduce elliptic curves over field of real numbers and above all over prime fields. In order to describe the problematics rigorously the graphical outputs and also the experimental results in the field of discrete elliptic curves will be mentioned. In the next section we will pay a particular attention to topology, functions between topological spaces and to the introduction of the concept of smooth manifold. We will search the suitable functions which can transfer geometrical objects from the real plane onto torus. A software specifically developed for transfering the elliptic curves onto the torus works on the basis of aforementioned functions.
|
|
|
Computation geometry in robotics.
Pivovarník, Marek ; Pavlík, Jan (referee) ; Hrdina, Jaroslav (advisor)
Thesis deals with finding forbiden configuration space for polygonal robot. The aim is to compute an obstacle shape in configuration space. This problem solves Minkowsky Sum. Also thesis deals with Minkowsky sum properties. In the rest of the thesis is mentioned algorithm to compute Minkowsky sum, its debugging and implementation to the C# enviroment.
|
|
|
General Codes with m Marks
Holešovský, Jan ; Hrdina, Jaroslav (referee) ; Skula, Ladislav (advisor)
This bachelor's thesis is concerned with results of error-correcting codes theory, which deals with detection and correction of errors, that arise during communication by means of these codes. The aim of this thesis is the explanation of the theory above in absolute generality, followed by detail view of some significant codes. Using linear algebra over finite fields, we will introduce an error-corecting code like a set with structure, whose characters considerably simplify the detection and correction of errors. The knowledge, that was acquired for general codes, is applied to well-known binary codes at the end of the thesis (ie. Hamming codes and Golay code). With these codes are demonstrated their properties, that sort these codes to the most important binary codes.
|
|
|
Rings of endomorphisms of elliptic curves and Mestre's theorem
Szásziová, Lenka ; Hrdina, Jaroslav (referee) ; Kureš, Miroslav (advisor)
Eliptické křivky jsou mocným nástrojem dnešní doby. Jednak přispěly k vyřešení mnoha matematických problémů, ale také nalezly četná uplatnění v aplikacích, jako je například kryptografie založená na eliptických křivkách (ECC). Tato metoda veřejného klíče má velkou budoucnost, neboť v mnohém doplňuje nedostatky známé RSA metody. Jedním z hlavních problémů kryptografie založené na eliptických křivkách je určení řádu eliptické křivky, tedy výpočet počtu bodů eliptické křivky nad prvočíselným polem. Tomuto zásadnímu problému je věnována tato práce. Na určení řádu eliptické křivky existuje řada algoritmů. Pro menší prvočísla (čili pro charakteristiku prvočíselného pole) se užívá metoda založená na přímém výpočtu, tzv. naivní algoritmus. Velkou pomocí v této problematice je Hasseho teorém, který omezuje řád eliptické křivky intervalem. Pro větší prvočísla se s úspěchem používají Shanksův algoritmus a jeho vylepšení Mestreho algoritmus. Oba algoritmy mají dvě části - Baby Step a Giant Step. Shanksův algoritmus je však v určitých případech nepoužitelný a tento problém řeší Mestreho algoritmus, který používá pojem twist eliptické křivky. Díky Mestreho teorému bylo dokázáno, že řád eliptické křivky nad prvočíselným polem muže být spočten pro každé prvočíslo vetší než 457. Důkaz, který spočívá především v isomorfismu okruhu endomorfismů nad eliptickými křivkami a imaginárního kvadratického řádu, je uveden na závěr této práce.
|
|
|
Matrices, Determinant and Body Volume
Šomplák, Radovan ; Hrdina, Jaroslav (referee) ; Vašík, Petr (advisor)
In his thesis describes the basic properties of matrices, determinants and their use in display issues between vector spaces. In the final chapters devoted to determinants and its applications, which indicates the relation between determinants and calculation of volume. Subsequently determinanti describes how to use in calculating the elements using multiple integrals. Another possible application is the so-called Cramerovo rule which allows us to solving systems of linear equations.
|
guest ::
RSS feed.