|
|
Study of road I / 43 near the town of Štíty
Babík, Maroš ; Jakl, Tomáš (referee) ; Kosňovský, Michal (advisor)
The goal of the diploma thesis is a study of the road I/43 near the town of Štíty. Štíty is situated in Olomouc region. It is situated 55 km north-west from Olomouc city. The reason for a study is processing and verification of the route in terms of its feasibility according to the current ČSN 73 6101, while respecting the interests of environmental protection and its binding to the communication network. The consideration has been taken to the nature reserve Selský les during projection. From several of the proposed variants came one result, which was processed in detail. All variants are heading through the undeveloped terriotry, where the crossings and relocations of the actual roads and water flows have been solved.
|
|
|
Forgotten Apocalypse - The Czech Reflection of the Retreat of the German Heeresgruppe Mitte
Jakl, Tomáš ; Beneš, Zdeněk (advisor) ; Hutečka, Jiří (referee) ; Mücke, Pavel (referee)
Title: Forgotten Apocalypse - The Czech Reflection of the Retreat of the German Heeresgruppe Mitte Author: Mgr. Tomáš Jakl Abstract: There are war campaigns that can be described simply, others more difficult to describe, and some cannot be reconstructed by a continuous narrative at all. The events in the Czech Lands in the first two weeks of May 1945 belong to the most difficult to describe. The fact that there was the largest of last German fighting groups of armies is well known. It is also commonly known that it was the Central Army Group commanded by Field Marshal Ferdinand Schörner. Significantly less is known that as a result of the outbreak of the Czech Uprising, this group of armies retreated across the rebellious territory to the demarcation line between the US and the Red Army The last desperate illusion of German soldiers was that they would contact the Americans and jointly drive the Russians out of Europe. Allied Commander-in-Chief in the West, General Dwight David Eisenhower, did not intend to do anything after the death of US President Roosevelt, which the Soviet dictator could even interpret as a similar development. Not only did he forbid General Patton from crossing the agreed line in advance with the Soviets, visually accommodating the retreating Germans, but the US troops also released...
|
|
|
Restorer's conservator's informational system ResIS
Novotný, Jan, ; Jakl, Tomáš
Předložená metodika je návod, jak používat Restaurátorský informační systém ResIS pro zkvalitnění péče o knihovní fondy. ResIS je navržen pro komplexní zpracování dokumentace vzácných knihovních exemplářů. Základem systému je digitální archiv s několika desítkami tisíc identifikačních záznamů knihovních exemplářů, náhradních nosičů, bibliografických odkazů, restaurátorských zpráv a dokumentací z oblasti restaurování a ochrany historických fondů. Nejrozsáhlejší část tvoří restaurátorská dokumentace, do systému je zahrnuta rovněž dokumentace z konzervátorských průzkumů, výstav, výzkumných záměrů a vědeckých projektů.
Fulltext:  PDF
|
|
|
Influence of fabrication and alloying on magnesium alloys
Jakl, Tomáš ; Remešová, Michaela (referee) ; Horynová, Miroslava (advisor)
This bachelor thesis compares mechanical properties of magnesium alloys in dependence on their composition and fabrication. The first part deals with a pure magnesium and its properties. The second part contains information about alloying elements and an overview of the fabrication methods. The third part consists of different magnesium alloys. The thesis contains photographs of microstructures, a review of mechanical properties and their comparison.
|
|
|
d-Frames as algebraic duals of bitopological spaces
Jakl, Tomáš ; Pultr, Aleš (advisor) ; Picado, Jorge (referee) ; Cintula, Petr (referee)
Achim Jung and Drew Moshier developed a Stone-type duality theory for bitopological spaces, amongst others, as a practical tool for solving a particular problem in the theory of stably compact spaces. By doing so they discovered that the duality of bitopological spaces and their algebraic counterparts, called d-frames, covers several of the known dualities. In this thesis we aim to take Jung's and Moshier's work as a starting point and fill in some of the missing aspects of the theory. In particular, we investigate basic categorical properties of d-frames, we give a Vietoris construction for d-frames which generalises the corresponding known Vietoris constructions for other categories, and we investigate the connection between bispaces and a paraconsistent logic and then develop a suitable (geometric) logic for d-frames.
|
|
|
NorthEast segment of Hranice town bypass
Kelča, Petr ; Jakl, Tomáš (referee) ; Všetečka, Martin (advisor)
The aim of this diploma thesis is to elaborate a variant of the technical solution of the Northeast bypass road of the city Hranice and its subsequent comparison with other variant prepared by the company Linio Plan, s.r.o. The main task of the bypass road is the operation of the industrial zone, through which is achieved the relocation of a large part of the transit traffic from the city centre. The basic difference of compared variants is their location to the city, the solution developed by Linio Plan, s.r.o. passes through the industrial zone and the other variant passes outside this zone.
|
|
|
Some point-free aspects of connectedness
Jakl, Tomáš ; Pultr, Aleš (advisor)
In this thesis we present the Stone representation theorem, generally known as Stone duality in the point-free context. The proof is choice-free and, since we do not have to be concerned with points, it is by far simpler than the original. For each infinite cardinal κ we show that the counter- part of the κ-complete Boolean algebras is constituted by the κ-basically disconnected Stone frames. We also present a precise characterization of the morphisms which correspond to the κ-complete Boolean homomorphisms. Although Booleanization is not functorial in general, in the part of the dual- ity for extremally disconnected Stone frames it is, and constitutes an equiv- alence of categories. We finish the thesis by focusing on the De Morgan (or extremally disconnected) frames and present a new characterization of these by their superdense sublocales. We also show that in contrast with this phenomenon, a metrizable frame has no non-trivial superdense sublocale; in other words, a non-trivial Čech-Stone compactification of a metrizable frame is never metrizable. 1
|
|
|
Some point-free aspects of connectedness
Jakl, Tomáš ; Pultr, Aleš (advisor) ; Fiala, Jiří (referee)
In this thesis we present the Stone representation theorem, generally known as Stone duality in the point-free context. The proof is choice-free and, since we do not have to be concerned with points, it is by far simpler than the original. For each infinite cardinal κ we show that the counter- part of the κ-complete Boolean algebras is constituted by the κ-basically disconnected Stone frames. We also present a precise characterization of the morphisms which correspond to the κ-complete Boolean homomorphisms. Although Booleanization is not functorial in general, in the part of the dual- ity for extremally disconnected Stone frames it is, and constitutes an equiv- alence of categories. We finish the thesis by focusing on the De Morgan (or extremally disconnected) frames and present a new characterization of these by their superdense sublocales. We also show that in contrast with this phenomenon, a metrizable frame has no non-trivial superdense sublocale; in other words, a non-trivial Čech-Stone compactification of a metrizable frame is never metrizable. 1
|
|
|
Arimaa challenge - comparission study of MCTS versus alpha-beta methods
Jakl, Tomáš ; Majerech, Vladan (advisor) ; Hric, Jan (referee)
In the world of chess programming the most successful algorithm for game tree search is considered AlphaBeta search, however in game of Go it is Monte Carlo Tree Search. The game of Arimaa has similarities with both Go and Chess, but there has been no successful program using Monte Carlo Tree Search so far. The main goal of this thesis is to compare capabilities given by Monte Carlo Tree Search algorithm and AlphaBeta search, both having the same evaluation function, in the game of Arimaa.
|
|
| |
guest ::
