|
|
Proposal of manufacturing technology of bracket
Tůma, Vojtěch ; Schwarzer, Emil (referee) ; Dvořák, Milan (advisor)
The object of this bachelor thesis is to propose manufacturing process of the holder by using technologies of metal processing. The design of the holder of the headset for light sport aircraft is assigned. The first part of this thesis describes preparation of the semi-finished product by the material cutting, bending methods and final surfacing of the part. In the second section there are evaluated technological aspects of the part, made calculations for dimension of the developed shape of the part, cutting force and cutting work, the total material consumption, minimal and maximal radius of the bend, spring-back, bending force and bending work. The bending jig was then designed according to those calculations. Based on the price quotation for the jig acquisition was performed the economical evaluation and was set the sale price of one piece of the headset holder. The process of the design is then briefly summarized in the conclusion.
|
|
|
Nowhere-dense classes of graphs
Tůma, Vojtěch ; Dvořák, Zdeněk (advisor) ; Mareš, Martin (referee)
In this thesis we study sparse classes of graphs and their properties usable for design of algorithms and data structures. Our specific focus is on the con- cepts of bounded expansion and tree-depth, developed in recent years mainly by J. Nešetřil and P. Ossona de Mendez. We first give a brief introduction to the theory as whole and survey tools and results from related areas of parametrised complexity and algorithmic model theory. The main part of the thesis, application of the theory, presents two new dynamic data structures. The first is for keeping a tree-depth decomposition of a graph, the second counts appearances of fixed subgraphs in a given graph. The time and space complexity of operations of both structures is guaranteed to be low when used for sparse graphs. 1
|
|
|
Role of communication in team-oriented FPS games
Tuma, Vojtěch ; Gemrot, Jakub (advisor) ; Bída, Michal (referee)
Communicaton in computer games is used to coordinate a team strategy and for sharing knowledge. The role of communication was examined in this thesis by creating several teams of bots for CTF mode of the Unreal Tournament 2004 computer game. As a base for implementation served the Pogamut platform and an existing deathmatch bot adjusted for CTF mode. For comparison three teams were made: the first was without any communication, the second used knowledge sharing and the third team - apart from knowledge sharing - used active communication for group movement. After several comparing experiments a conclusion was made that the team without communication is not worse than teams using communication. The difference is small and may have been affected during experiments or by specific implementation in this thesis. 1
|
|
| |
|
|
Summarization of gene expression arrays from free living species
Tuma, Vojtěch ; Mořkovský, Libor (advisor) ; Vomlelová, Marta (referee)
Gene expression arrays are used to assess expression of exons and genes of orga- nisms. The design of expression arrays is based on a genome of laboratory strains of model organisms. The most frequent summarization algorithms used to pro- cess data from measurements are gcRMA, PLER and IterPLIER. When using expression arrays to research free living species, the measured values are influen- ced by differences in genomes of free living and model organisms. We propose a method to improve the results by removing parts of genomes influenced by known differences between species from the summarization. Removing influenced parts can improve summarization, especially on exon level. 1
|
|
|
Role of communication in team-oriented FPS games
Tuma, Vojtěch ; Gemrot, Jakub (advisor) ; Bída, Michal (referee)
Communicaton in computer games is used to coordinate a team strategy and for sharing knowledge. The role of communication was examined in this thesis by creating several teams of bots for CTF mode of the Unreal Tournament 2004 computer game. As a base for implementation served the Pogamut platform and an existing deathmatch bot adjusted for CTF mode. For comparison three teams were made: the first was without any communication, the second used knowledge sharing and the third team - apart from knowledge sharing - used active communication for group movement. After several comparing experiments a conclusion was made that the team without communication is not worse than teams using communication. The difference is small and may have been affected during experiments or by specific implementation in this thesis. 1
|
|
|
Nowhere-dense classes of graphs
Tůma, Vojtěch ; Dvořák, Zdeněk (advisor) ; Mareš, Martin (referee)
In this thesis we study sparse classes of graphs and their properties usable for design of algorithms and data structures. Our specific focus is on the con- cepts of bounded expansion and tree-depth, developed in recent years mainly by J. Nešetřil and P. Ossona de Mendez. We first give a brief introduction to the theory as whole and survey tools and results from related areas of parametrised complexity and algorithmic model theory. The main part of the thesis, application of the theory, presents two new dynamic data structures. The first is for keeping a tree-depth decomposition of a graph, the second counts appearances of fixed subgraphs in a given graph. The time and space complexity of operations of both structures is guaranteed to be low when used for sparse graphs. 1
|
|
|
Barevnost grafů na plochách
Tůma, Vojtěch ; Dvořák, Zdeněk (advisor) ; Fiala, Jiří (referee)
In this thesis we deal with extending a 4-coloring of a cycle into the rest of the graph. We prove that for plane 3-colorable graphs such that every face except the outer face O is a triangle and O has length 4 or 5, the question of extendability of a precoloring of O reduces to extendability into 3 small basic graphs. We also classify the situation when there is an inner face of size 5 in the graph in similar terms. 1
|
|
|
Proposal of manufacturing technology of bracket
Tůma, Vojtěch ; Schwarzer, Emil (referee) ; Dvořák, Milan (advisor)
The object of this bachelor thesis is to propose manufacturing process of the holder by using technologies of metal processing. The design of the holder of the headset for light sport aircraft is assigned. The first part of this thesis describes preparation of the semi-finished product by the material cutting, bending methods and final surfacing of the part. In the second section there are evaluated technological aspects of the part, made calculations for dimension of the developed shape of the part, cutting force and cutting work, the total material consumption, minimal and maximal radius of the bend, spring-back, bending force and bending work. The bending jig was then designed according to those calculations. Based on the price quotation for the jig acquisition was performed the economical evaluation and was set the sale price of one piece of the headset holder. The process of the design is then briefly summarized in the conclusion.
|
guest ::
RSS feed.