|
|
Specific Bellman's Lost in a Forest Problem analysis
Žůrek, Daniel ; Čermák, Jan (referee) ; Hoderová, Jana (advisor)
This thesis focuses on the analysis of a selected Bellman problem known as "Lost in a Forest." Initially, it defines and presents some auxiliary theorems important for finding the shortest escape path. The main part of the thesis focuses on the construction and analysis of escape paths in various types of forests. The thesis thoroughly examines the shortest escape path in an infinite strip of forest with unit width. The results of this thesis provide new insights into the optimization of escape paths and offer formal proofs confirming that Zalgaller's path is the shortest possible escape path in the given context. Additionally, the thesis addresses the solution for a rectangular forest with an obstacle, bringing new ideas to this area.
|
|
| |
|
|
To Dvur Kralove by train - Transfer Terminal in Dvur Kralove nad Labem
Hudečková, Kristína ; Růžička, Tomáš (referee) ; Ponešová, Barbora (advisor)
The terminal represents joining two things – an internal and an external – a city and a surroundings. The intetion of my bachelor thesis is to connect fluently a main hiking trail from a center of city with a bus service and train transport. To make this connection as natural as possible, the proposal of terminal is based on a mass concentration in a point of joint and gradual diffusion towards the the city and the surroundings. The terminal is designed as a longitudinal structure with a one communication in the middle of the layout. The space of terminal is defined by twenty steel frames arranged one behind the other in the direction of the axis of connection between train track and hiking trail from the center of the city. The steel frame becomes the dominant element of the terminal. Different closing of sections between particular frames creates spaces of different characters and a different rate of permeability.
|
|
|
WATERWAY, TO SING THE SPACE
Orel Tomáš, Jakub ; Šejn, Miloš (referee) ; Helia De Felice, Jennifer (advisor)
The way of the Jedovnice creek: connection with the spring Falling into the underground halls and back to the light. The Water Way is an intermedial poem that is concerned to the element of water, character of its way through the landscape and its presence in the landscape. Since the type of work I most prefer is the work in the landscape, I am returning back to the natural landscape, strong places in Moravian karst near Brno. The audiovisual poem is primarily focused on the moment of melting. Sublimation of ice from the ice shelter, ephemeral phenomena on the surface, such as miniature whirls, waves, rays of sunlight and especially moonlight. The poem focuses on the possibilities of transferring the experience with a specific place, and the events in a unique, unrepeatable time and space into the theatrical scene and possibilities of the musical and audiovisual interpretation of such experience. I work with digital media (video mix and audiostop) to transfer the artist's physical experience in a unique time and unique natural setting into the scenic form of the work. Considering the physical and symbolic qualities of the water element, I have abandoned the composition of the event in the classical sense.
|
|
|
Revitalization Program of Floral Garden in Kromeriz
Kudlička, Jan ; Matoušková, Petra (referee) ; Mléčka, Jan (advisor)
This project elaborate the foreground of Kvetna garden in Kromeriz.Everything is solucionated like a fluid connection with an old garden.It isssues from the old concept but however has got a new modern and dynamic form.The main idea is to make a pleasure visit for the people who will arrive and give them more knowings about culture ,history and art.
|
|
|
Graphs, Algorithms and their Application
Venerová, Lenka ; Dostál,, Jiří (referee) ; Bobalová, Martina (advisor)
The Bachelor thesis is primarily focused on the problems of graphs and graph algorithms. The main point is to explain and to enlarge the subject. Very often, we find ourselves confronted with problems, which we, though unconsciously, solve by means of the graph algorithms knowledge. Therefore, the other aim of my bachelor thesis is to demonstrate the application of some of these methods in solving distribution tasks.
|
|
|
The Shortest Graph's Pahts Finding
Jágr, Petr ; Ohlídal, Miloš (referee) ; Jaroš, Jiří (advisor)
The aim of this thesis is finding, comparing and implementation of algorithms for finding the shortest paths between each of pairs of nodes in a graph. For this task I use modifications of existing algorithms to achive the lowest time consumption of the computation. Modifications are established on Dijkstra's and Floyd-Warshall's algorithm. We also familiarize with Bellman-Ford algorithm.
|
|
|
Graphs, Graph Algorithms and their Use in Finding the Shortest Path
Ott, Lukáš ; Moravec, Petr (referee) ; Bobalová, Martina (advisor)
This Bachelor thesis concentrates on introducing graphs and graph algorithms theories for finding the shortest path and consequential implementation of acquired pieces of knowledge into program MS Excel 2003 using VBA language. Chart theory applies to everything, from small problems to complex actions. If we are able to understand the basic pieces of knowledge presented in this thesis, we will also be able to put them into practice.
|
|
|
Graph theory and its applications
Huclová, Alena ; Karásek, Jiří (referee) ; Pavlík, Jan (advisor)
It is often necessary to be oriented in the complicated relations between parts of a unit. This problem can be solved by the graphs’ theory very well. Graph G is an ordered pair (V,E) where V is a non-empty set of vertices (our parts of the unit) and E is a set of two-element subsets of the set V called arcs (i.e. relations between parts of the unit). G= (V,E) The graph aplication is frequently hidden. It is not found in the solution of the problem, but could be used to express and substantiate it quite easily. In my work I will deal with optimization problems of a graph. Problem of the maximum network flow that we solve using directed graph can be an example. As for non-directed graphs, we will be interested in the search of a minimum frame of a graph.
|
|
|
Reservoirs - Brno, Zluty kopec (Yellow hill)
Gomboš, Michal ; Bujna, Tomáš (referee) ; Palaščák, Michal (advisor)
After successfully avoiding of the destructive scenario with the demolition of reservoirs and replacing them with parking house, the second question arises. How to stimulate the people's interest in these underground jewels, the interest that would confirm the decision to save reservoirs. One of the possible ways, in which I see a purpose and the one that I decided to chose is to make the reservoirs accessible alongside the pathway and let the natural curiosity of human to do the rest.
|
guest ::
