|
|
Restoration of the former fast in Hodíškov
Centner, Václav ; Špiller, Martin (referee) ; Guzdek, Adam (advisor)
The aim of the bachelor's thesis was to develop the concept of the studio work from the first semester of the third year, which we originally took from concept to documentation for the building permit in part B. Furthermore, the design was finalized in the documentation C for the implementation of the construction. The actual topic was the restoration of the fast house in Hodíšek, which has long since lost its original purpose and is now used as council housing for non-domestic local residents. The Rychta has also undergone several alterations to try to bring new qualities to it, which have been rather contradictory. The Rychta is located in Hodíškov, which is a small village among the hills of the Highlands. We drove to the place through winding roads barely wide enough for one car. Around the roads there were grown-up houses and we actually felt a bit like in another world after arriving from Brno. The Rychta stands on a hill, separating the former sugar factory from the rest of the village. From the hill the tavern looks down on the village and looks majestic as the patron saint of the place. There is also a small pond in the village, which makes the local climate more pleasant and provides a home for all kinds of animals and plants. Hodíškov has 150 inhabitants, so the fast house with its farm wing exceeds the capacity of the locals' demands for a place where they can meet and hold public gatherings. Therefore, in connection with the romantic nature of the place, I thought that the fast house with its farm wing could serve as a setting for weddings and larger social events. This will allow me to bring a more generous spatial experience to the vaulted spaces in the farm wing and restore the spirit of the interior spaces that has been lost during the remodeling of the past years. In my approach to the heritage values of the fast house I am trying to restore its dignity and grandeur on the other hand not forgetting and denying its history which has been so tarnished. Different parameters apply to the economic wing. During the rebuilding process, there were attempts to bring it closer to the speedway with various façade elements and the like. In working with these two buildings I try to establish firmly where each stands and what its role is and was. The wedding program required increased accommodation capacity, which I solved by adding a "barn" to the rear yard space.
|
|
|
Optimization of traffic engineering problems
Le, Huy ; Hošek, Jaromír (referee) ; Hrabec, Dušan (advisor)
This bachelor thesis focuses on optimization of traffic light control of intersection, more specifically looks for optimal minimal signal plan of intersection considering given requirements. Theoretical part is about suppositions and basic definitions, after that usable algorithms for this problem are described in details. Practical part deals with application of these algorithms on specific example of intersection and compares obtained results afterwards.
|
|
|
Preparation of Homeworks in the Course Algorithms
Miloš, Roman ; Masopust, Tomáš (referee) ; Lukáš, Roman (advisor)
This Bachelor's thesis is about preparing of homeworks for the course Algorithms on graphs. Thesis contains five parts. The first task is to create graphs using adjacency matrix, next is to create a graph using the adjacency lists. The third task is to implement Prim algorithm for finding the minimum skeleton. The fourth is the implementation of Floyd-Warshall algorithm for finding minimum paths in the graph, finding the connection and completeness of the graph. The fifth task is to identify and implement discretion chart NP-complete problem of finding a maximum clique of graph.
|
|
| |
|
|
Optimization of traffic engineering problems
Le, Huy ; Hošek, Jaromír (referee) ; Hrabec, Dušan (advisor)
This bachelor thesis focuses on optimization of traffic light control of intersection, more specifically looks for optimal minimal signal plan of intersection considering given requirements. Theoretical part is about suppositions and basic definitions, after that usable algorithms for this problem are described in details. Practical part deals with application of these algorithms on specific example of intersection and compares obtained results afterwards.
|
|
|
Preparation of Homeworks in the Course Algorithms
Miloš, Roman ; Masopust, Tomáš (referee) ; Lukáš, Roman (advisor)
This Bachelor's thesis is about preparing of homeworks for the course Algorithms on graphs. Thesis contains five parts. The first task is to create graphs using adjacency matrix, next is to create a graph using the adjacency lists. The third task is to implement Prim algorithm for finding the minimum skeleton. The fourth is the implementation of Floyd-Warshall algorithm for finding minimum paths in the graph, finding the connection and completeness of the graph. The fifth task is to identify and implement discretion chart NP-complete problem of finding a maximum clique of graph.
|
|
|
Models and methods for network economies
BÖHM, Petr
The goal is to create a summary of models and methods for network economies including network structure, a dynamic and uncertain environment, factors more criteria in the network economy. Deeper deal with graph theory, networks and supply networks. Part of this work is the analytical part, where the patterns and using them I find the position of nodes in the network data from Lidé.cz and eBay. I demonstrate the models and calculations.
|
guest ::
