|
19.9
Adam, Stanislav ; FUXJÄGER, Klaus (vedoucí práce) ; JÍCHA, Marek (oponent)
Tato bakalářská práce se zabývá studií osvětlovacího systému Cine Reflect Lighting System a jeho schopnosti přistupovat k osvětlení scény zcela odlišným způsobem. První část práce shrnuje výhody a nevýhody zrcadlových systémů, čímž může pomoci kameramanům při volbě správné osvětlovací technologie snímaného filmu. Druhá část bakalářské práce je zaměřena na použití CRLS ve filmech Michaela Hanekeho, zejména v jeho dobovém snímku Bílá Stuha (2009).
|
|
Firemní identita kulturních institucí
Rálek, Jakub ; SULŽENKO, Jiří (vedoucí práce) ; SVOBODOVÁ, Doubravka (oponent)
Tato práce zkoumá problematiku vztahu a aplikace firemní identity v kulturním prostředí. Rozebírá klíčové pojmy grafický design, firemní image, firemní kultura, firemní komunikace, firemní produkt, cílová skupina, symbol, brand, vize, mise a další. Je rozdělena do tří částí – první část obsahujícící definice, druhá část obsahující rozbor případových studií – dvou divadel (Divadla Na zábradlí a Divadla Josefa Kajetána Tyla) – a třetí část, která spojuje dvě předchozí v nastínění procesu budování vlastní identity. Poslední část se zaměřuje zejména na práci s vizuálním stylem. Práce zdůrazňuje nezbytnost a smysl profesionálního marketingového přístupu k dosažení rostoucí hodnoty značky a obecného stabilního růstu jakékoliv kulturní společnosti.
|
| |
|
Vliv sněhové pokrývky na odtok během dešťových srážek.
Juras, Roman ; Máca, Petr (vedoucí práce) ; Ladislav , Ladislav (oponent)
V zimním období, kdy leží na povodí sněhová pokrývka, stále přibývá výskytu dešťových srážek. Déšť dopadající na sníh (ROS) má často za následek vznik povodní a mokrých lavin. Predikce vlivu ROS záleží především na lepším pochopení mechanismů vzniku a složení odtoku ze sněhové pokrývky. Spojení simulace deště na sněhovou pokrývku a využití stopovačů bylo testováno jako vhodný nástroj pro tento účel. Celkem bylo provedeno 18 experimentů na sněhovou pokrývku s různými počátečními vlastnostmi v horských podmínkách střední a západní Evropy.
Pro určení charakteru proudění bylo použito barvivo brilliant blue (FCF), pomocí kterého je možné vizualizovat preferenční cesty, ale i určit rozhraní dvou vrstev o různých hydraulických vlastnostech. Zastoupení jednotlivých složek odtékající vody na výtoku bylo stanoveno pomocí metody separace hydrogramu, která poskytuje dobré výsledky s přijatelnou nejistotou. Z technických důvodů nebylo možné obě metody použít současně během jednoho experimentu, i když by to ještě více rozšířilo znalosti o dynamice proudění dešťové vody ve sněhové pokrývce. Množství tavné vody bylo vypočteno pomocí rovnice energetické bilance. Použití této rovnice je poměrně přesné, ale zároveň náročné na vstupy. Z toho důvodu bylo tání vypočteno pouze u jednoho experimentu.
Rychlost vzniku odtoku roste v první řadě intenzitou srážky. Počáteční vlastnosti sněhové pokrývky, jako hustota a vlhkost, ovlivňují rychlost vzniku odtoku až druhotně. Na druhou stranu při stejné intenzitě srážky vykazovala nevyzrálá sněhová pokrývka s malou hustotou rychlejší hydrologickou odpověď, než vyzrálá pokrývka s větší hustotou. Velikost odtoku je závislá, především na počátečním nasycení. Vyzrálá sněhová pokrývka s vyšším počátečním nasycení generovala vyšší celkový odtok, kde dešťová voda přispívala maximálně z 50ti %. Proti tomu protekla dešťová voda nevyzrálou sněhovou pokrývkou poměrně rychle a do odtoku se propagovala přibližně z 80ti %.
Pro predikci odtoku během ROS byla použita Richardsova rovnice v rámci modelu SNOWPACK. Tento model byl upraven tak, že byla sněhová matrice rozdělena pro lepší simulaci preferenčního proudění. Tento přístup přinesl zlepšení výsledků oproti klasickému přístupu, kdy se uvažuje pouze matricové proudění.
|
|
Packet Classification Algorithms
Puš, Viktor ; Lhotka,, Ladislav (oponent) ; Dvořák, Václav (vedoucí práce)
This thesis deals with packet classification in computer networks. Classification is the key task in many networking devices, most notably packet filters - firewalls. This thesis therefore concerns the area of computer security. The thesis is focused on high-speed networks with the bandwidth of 100 Gb/s and beyond. General-purpose processors can not be used in such cases, because their performance is not sufficient. Therefore, specialized hardware is used, mainly ASICs and FPGAs. Many packet classification algorithms designed for hardware implementation were presented, yet these approaches are not ready for very high-speed networks. This thesis addresses the design of new high-speed packet classification algorithms, targeted for the implementation in dedicated hardware. The algorithm that decomposes the problem into several easier sub-problems is proposed. The first subproblem is the longest prefix match (LPM) operation, which is used also in IP packet routing. As the LPM algorithms with sufficient speed have already been published, they can be used in out context. The following subproblem is mapping the prefixes to the rule numbers. This is where the thesis brings innovation by using a specifically constructed hash function. This hash function allows the mapping to be done in constant time and requires only one memory with narrow data bus. The algorithm throughput can be determined analytically and is independent on the number of rules or the network traffic characteristics. With the use of available parts the throughput of 266 million packets per second can be achieved. Additional three algorithms (PFCA, PCCA, MSPCCA) that follow in this thesis are designed to lower the memory requirements of the first one without compromising the speed. The second algorithm lowers the memory size by 11 % to 96 %, depending on the rule set. The disadvantage of low stability is removed by the third algorithm, which reduces the memory requirements by 31 % to 84 %, compared to the first one. The fourth algorithm combines the third one with the older approach and thanks to the use of several techniques lowers the memory requirements by 73 % to 99 %.
|
|
Harnessing Forest Automata for Verification of Heap Manipulating Programs
Šimáček, Jiří ; Abdulla, Parosh (oponent) ; Křetínský, Mojmír (oponent) ; Vojnar, Tomáš (vedoucí práce)
This work addresses verification of infinite-state systems, more specifically, verification of programs manipulating complex dynamic linked data structures. Many different approaches emerged to date, but none of them provides a~sufficiently robust solution which would succeed in all possible scenarios appearing in practice. Therefore, in this work, we propose a new approach which aims at improving the current state of the art in several dimensions. Our approach is based on using tree automata, but it is also partially inspired by some ideas taken from the methods based on separation logic. Apart from that, we also present multiple advancements within the implementation of various tree automata operations, crucial for our verification method to succeed in practice. Namely, we provide an optimised algorithm for computing simulations over labelled transition systems which then translates into more efficient computation of simulations over tree automata. We also give a new algorithm for checking inclusion over tree automata, and we provide experimental evaluation demonstrating
|
|
Optimization of Gaussian Mixture Subspace Models and Related Scoring Algorithms in Speaker Verification
Glembek, Ondřej ; Brummer, Niko (oponent) ; Campbell,, William (oponent) ; Burget, Lukáš (vedoucí práce)
This thesis deals with Gaussian Mixture Subspace Modeling in automatic speaker recognition. The thesis consists of three parts. In the first part, Joint Factor Analysis (JFA) scoring methods are studied. The methods differ mainly in how they deal with the channel of the tested utterance. The general JFA likelihood function is investigated and the methods are compared both in terms of accuracy and speed. It was found that linear approximation of the log-likelihood function gives comparable results to the full log-likelihood evaluation while simplyfing the formula and dramatically reducing the computation speed. In the second part, i-vector extraction is studied and two simplification methods are proposed. The motivation for this part was to allow for using the state-of-the-art technique on small scale devices and to setup a simple discriminative-training system. It is shown that, for long utterances, while sacrificing the accuracy, we can get very fast and compact i-vector systems. On a short-utterance(5-second) task, the results of the simplified systems are comparable to the full i-vector extraction. The third part deals with discriminative training in automatic speaker recognition. Previous work in the field is summarized and---based on the knowledge from the earlier chapters of this work---discriminative training of the i-vector extractor parameters is proposed. It is shown that discriminative re-training of the i-vector extractor can improve the system if the initial estimation is computed using the generative approach.
|
|
Acceleration Methods for Evolutionary Design of Digital Circuits
Vašíček, Zdeněk ; Miller, Julian (oponent) ; Zelinka,, Ivan (oponent) ; Sekanina, Lukáš (vedoucí práce)
Although many examples showing the merits of evolutionary design over conventional design techniques utilized in the field of digital circuits design have been published, the evolutionary approaches are usually hardly applicable in practice due to the various so-called scalability problems. The scalability problem represents a general problem that refers to a situation in which the evolutionary algorithm is able to provide a solution to a small problem instances only. For example, the scalability of evaluation of a candidate digital circuit represents a serious issue because the time needed to evaluate a candidate solution grows exponentially with the increasing number of primary inputs. In this thesis, the scalability problem of evaluation of a candidate digital circuit is addressed. Three different approaches to overcoming this problem are proposed. Our goal is to demonstrate that the evolutionary design approach can produce interesting and human competitive solutions when the problem of scalability is reduced and thus a sufficient number of generations can be utilized. In order to increase the performance of the evolutionary design of image filters, a domain specific FPGA-based accelerator has been designed. The evolutionary design of image filters is a kind of regression problem which requires to evaluate a large number of training vectors as well as generations in order to find a satisfactory solution. By means of the proposed FPGA accelerator, very efficient nonlinear image filters have been discovered. One of the discovered implementations of an impulse noise filter consisting of four evolutionary designed filters is protected by the Czech utility model. A different approach has been introduced in the area of logic synthesis. A method combining formal verification techniques with evolutionary design that allows a significant acceleration of the fitness evaluation procedure was proposed. The proposed system can produce complex and simultaneously innovative designs, overcoming thus the major bottleneck of the evolutionary synthesis at gate level. The proposed method has been evaluated using a set of benchmark circuits and compared with conventional academia as well as commercial synthesis tools. In comparison with the conventional synthesis tools, the average improvement in terms of the number of gates provided by our system is approximately 25%. Finally, the problem of the multiple constant multiplier design, which belongs to the class of problems where a candidate solution can be perfectly evaluated in a short time, has been investigated. We have demonstrated that there exists a class of circuits that can be evaluated efficiently if a domain knowledge is utilized (in this case the linearity of components).
|
|
Code Characterization for Automated User Interface Generation
Kadlec, Jaroslav ; Slavík,, Pavel (oponent) ; Sochor, Jiří (oponent) ; Zemčík, Pavel (vedoucí práce)
This work presents novel approach to automation of user interface creation. A taxonomy based on data characterization was adopted and new taxonomy for code characterization is proposed. Taxonomy points most important aspects of data and code so that it can be used in a process of automated user interface creation. The taxonomy is platform independent and can be stored as a metadata in the application file or in a separate external file. A process of automated user interface creation based on the taxonomy is proposed and individual parts of the process are described in more detail. Presented taxonomy and process of user interface generation are demonstrated on examples.
|
|
Physically-based Modeling and Simulation
Dvořák, Radim ; Racek, Stanislav (oponent) ; Šujanský,, Milan (oponent) ; Zbořil, František (vedoucí práce)
The thesis deals with the modeling of air pollution transportation and dispersion processes in the atmosphere, more precisely with the numerical approaches to solve such models. The modeling of air pollution has a great importance for prediction of the contaminations and it helps with understanding of the process and with elimination of its consequences. The models which are described by partial differential equations, namely advection-diffusion equations, and thus they can be solved by numerous analytical/numerical methods are in the scope of the thesis. In particular, well known method of lines (MoL) and several models based on it together with the possibility to accelerate the computation are studied in the first half of the work. It is shown that MoL approach is still suitable for many concrete models and it has a great potential for parallelization on graphics cards. Quite young ELLAM method and its application to solved atmospheric advection-diffusion equations is the second objective. A concrete form of ELLAM method and its proposed adaptation approaches are evaluated and it is shown that it overcomes the current state of the art methods in many cases.
|
host ::
