|
Kavárna - architektonický topos prvorepublikové společnosti
PFEFEROVÁ, Dita
Bakalářská práce se zabývá obnovenými prvorepublikovými kavárnami v Brně a v Praze. V případě brněnských kaváren především okolnostmi jejich vzniku, dobovým kontextem, historií kavárenství a také okolnostmi, za kterých se původním kavárnám měla vrátit jejich podoba a funkce. V samostatných kapitolách se autorka věnuje analýze kavárenských budov, důvodům i cílům jejich obnovy a rekonstrukce. Pozornost je zaměřena na Zemanovu kavárnu v Brně na Kolišti architekta Bohuslava Fuchse a na její repliku z roku 1995, dále na kavárnu ERA, jejíž budovu navrhl Josef Kranz. Patřičná pozornost je věnována noblesní kavárně Savoy, navržené Jindřichem Kumpoštem pro kavárníka Jana Nekvapila, i kavárně a cukrárně Kolbaba, jejímž autorem je architekt Jan Víšek. Pro srovnání s vývojem, který se odehrával v Brně, potom autorka zvolila unikátní kubistickou kavárnu Grand Café Orient v Praze, nacházející se v Domě U Černé Matky Boží od Josefa Gočára. Práce shrnuje okolnosti, za jakých kavárny za doby První republiky vznikaly ve dvou největších českých městech, ve kterých byly pro rozvoj kaváren různé podmínky. Podobně potom sleduje, za jakých podmínek se dařilo znehodnocená místa původních kaváren opětovně vracet do života a na základě podrobného rozboru literatury hodnotí úspěšnost těchto rekonstrukcí.
|
|
New Methods for Increasing Efficiency and Speed of Functional Verification
Zachariášová, Marcela ; Dohnal, Jan (oponent) ; Steininger, Andreas (oponent) ; Kotásek, Zdeněk (vedoucí práce)
In the development of current hardware systems, e.g. embedded systems or computer hardware, new ways how to increase their reliability are highly investigated. One way how to tackle the issue of reliability is to increase the efficiency and the speed of verification processes that are performed in the early phases of the design cycle. In this Ph.D. thesis, the attention is focused on the verification approach called functional verification. Several challenges and problems connected with the efficiency and the speed of functional verification are identified and reflected in the goals of the Ph.D. thesis. The first goal focuses on the reduction of the simulation runtime when verifying complex hardware systems. The reason is that the simulation of inherently parallel hardware systems is very slow in comparison to the speed of real hardware. The optimization technique is proposed that moves the verified system into the FPGA acceleration board while the rest of the verification environment runs in simulation. By this single move, the simulation overhead can be significantly reduced. The second goal deals with manually written verification environments which represent a huge bottleneck in the verification productivity. However, it is not reasonable, because almost all verification environments have the same structure as they utilize libraries of basic components from the standard verification methodologies. They are only adjusted to the system that is verified. Therefore, the second optimization technique takes the high-level specification of the system and then automatically generates a comprehensive verification environment for this system. The third goal elaborates how the completeness of the verification process can be achieved using the intelligent automation. The completeness is measured by different coverage metrics and the verification is usually ended when a satisfying level of coverage is achieved. Therefore, the third optimization technique drives generation of input stimuli in order to activate multiple coverage points in the veri\-fied system and to enhance the overall coverage rate. As the main optimization tool the genetic algorithm is used, which is adopted for the functional verification purposes and its parameters are well-tuned for this domain. It is running in the background of the verification process, it analyses the coverage and it dynamically changes constraints of the stimuli generator. Constraints are represented by the probabilities using which particular values from the input domain are selected. The fourth goal discusses the re-usability of verification stimuli for regression testing and how these stimuli can be further optimized in order to speed-up the testing. It is quite common in verification that until a satisfying level of coverage is achieved, many redundant stimuli are evaluated as they are produced by pseudo-random generators. However, when creating optimal regression suites, redundancy is not needed anymore and can be removed. At the same time, it is important to retain the same level of coverage in order to check all the key properties of the system. The fourth optimization technique is also based on the genetic algorithm, but it is not integrated into the verification process but works offline after the verification is ended. It removes the redundancy from the original suite of stimuli very fast and effectively so the resulting verification runtime of the regression suite is significantly improved.
|
|
K typům příjmení v Českých Budějovicích
KOPTYŠOVÁ, Jana
Téma této diplomové práce spadá do oblasti onomastické, úžeji do její podoblasti, antroponomastiky, jež zkoumá vznik, tvoření, rozšíření a povahu osobních jmen. V této práci, kterou jsem rozdělila na dvě části, se budu zabývat typy příjmení v Českých Budějovicích. První část teoretická stručně seznamuje s vývojem příjmení od počátku jejich vzniku, druhá praktická, resp. výzkumná část se věnuje konkrétnějšímu členění v rámci Českých Budějovic. Součástí praktické části je také přehledné třídění příjmení do několika skupin podle různých kritérií, přičemž na konci práce je v abecedním řazení uvedený rejstřík příjmení s příslušnými stránkami jejich výskytu v této diplomové práci.
|
|
Simulace a protiřetězce pro efektivní práci s konečnými automaty
Holík, Lukáš ; Černá, Ivana (oponent) ; Jančar, Petr (oponent) ; Vojnar, Tomáš (vedoucí práce)
This thesis is focused on techniques for finite automata and their use in practice, with the main emphasis on nondeterministic tree automata. This concerns namely techniques for size reduction and language inclusion testing, which are two problems that are crucial for many applications of tree automata. For size reduction of tree automata, we adapt the simulation quotient technique that is well established for finite word automata. We give efficient algorithms for computing tree automata simulations and we also introduce a new type of relation that arises from a combination of tree automata downward and upward simulation and that is very well suited for quotienting. The combination principle is relevant also for word automata. We then generalise the so called antichain universality and language inclusion checking technique developed originally for finite word automata for tree automata. Subsequently, we improve the antichain technique for both word and tree automata by combining it with the simulation-based inclusion checking techniques, significantly improving efficiency of the antichain method. We then show how the developed reduction and inclusion checking methods improve the method of abstract regular tree model checking, the method that was the original motivation for starting the work on tree automata. Both the reduction and the language inclusion methods are based on relatively simple and general principles that can be further extended for other types of automata and related formalisms. An example is our adaptation of the reduction methods for alternating Büchi automata, which results in an efficient alternating automata size reduction technique.
|
|
On-line Data Analysis Based on Visual Codebooks
Beran, Vítězslav ; Honec, Jozef (oponent) ; Sojka, Eduard (oponent) ; Zemčík, Pavel (vedoucí práce)
This work introduces the new adaptable method for on-line video searching in real-time based on visual codebook. The new method addresses the high computational efficiency and retrieval performance when used on on-line data. The method originates in procedures utilized by static visual codebook techniques. These standard procedures are modified to be able to adapt to changing data. The procedures, that improve the new method adaptability, are dynamic inverse document frequency, adaptable visual codebook and flowing inverted index. The developed adaptable method was evaluated and the presented results show how the adaptable method outperforms the static approaches when evaluating on the video searching tasks. The new adaptable method is based on introduced flowing window concept that defines the ways of selection of data, both for system adaptation and for processing. Together with the concept, the mathematical background is defined to find the best configuration when applying the concept to some new method. The practical application of the adaptable method is particularly in the video processing systems where significant changes of the data domain, unknown in advance, is expected. The method is applicable in embedded systems monitoring and analyzing the broadcasted TV on-line signals in real-time.
|
|
Extensions to Probabilistic Linear Discriminant Analysis for Speaker Recognition
Plchot, Oldřich ; Fousek, Petr (oponent) ; McCree,, Alan (oponent) ; Burget, Lukáš (vedoucí práce)
This thesis deals with probabilistic models for automatic speaker verification. In particular, the Probabilistic Linear Discriminant Analysis (PLDA) model, which models i--vector representation of speech utterances, is analyzed in detail. The thesis proposes extensions to the standard state-of-the-art PLDA model. The newly proposed Full Posterior Distribution PLDA models the uncertainty associated with the i--vector generation process. A new discriminative approach to training the speaker verification system based on the~PLDA model is also proposed. When comparing the original PLDA with the model extended by considering the i--vector uncertainty, results obtained with the extended model show up to 20% relative improvement on tests with short segments of speech. As the test segments get longer (more than one minute), the performance gain of the extended model is lower, but it is never worse than the baseline. Training data are, however, usually available in the form of segments which are sufficiently long and therefore, in such cases, there is no gain from using the extended model for training. Instead, the training can be performed with the original PLDA model and the extended model can be used if the task is to test on the short segments. The discriminative classifier is based on classifying pairs of i--vectors into two classes representing target and non-target trials. The functional form for obtaining the score for every i--vector pair is derived from the PLDA model and training is based on the logistic regression minimizing the cross-entropy error function between the correct labeling of all trials and the probabilistic labeling proposed by the system. The results obtained with discriminatively trained system are similar to those obtained with generative baseline, but the discriminative approach shows the ability to output better calibrated scores. This property leads to a better actual verification performance on an unseen evaluation set, which is an important feature for real use scenarios.
|
|
"Útěk do lesů a za dobrodružstvím" a jeho reprezentace v české literatuře 1. poloviny 20. století
NĚMCOVÁ, Věra
Bakalářská práce se zaměří na dobrodružnou literaturu v českém prostředí v první polovině 20. století, a to zejména na literaturu týkající se vzniku a rozšiřování trampského hnutí u nás, které se jako fenomén. "útěku do lesů a za dobrodružstvím" projevuje v společenském životě i v literatuře pod vlivem dobových událostí. Studentka bude sledovat různé reprezentace tohoto fenoménu zejména v literatuře typu "Rodokaps". Pozornost věnuje rovněž tvorbě německého autora Roberta Krafta. Do této části bude zařazen stručný autorův životopis, jeho tvorba a charakteristika devíti stěžejních románů, které spojuje postava hrdiny Nobodyho.
|
|
Biochemické motody jako nástroj pro studium proteinů v reprodukci
Postlerová, Pavla ; Zigo, Michal ; Pohlová, Alžběta ; Jonáková, Věra
Studium molekulárních mechanismů rerodukce je důležité pro pochopení tohoto děje. pro extrakci proteinů ze spermií využíváme různé přístupy a specializované kity, které izolují proteiny z různých částí a povrchu spermatické buňky. Proteiny z reprodukčních tekutin dělíme pomocí chromatografických metod. Charakterizaci a porovnání proteinů získaných odlišnými extrakčními metodami nebo proteinů různých savčích druhů a proteinů spermií, které jsou v rozdílných stádiích svého vývoje, provádíme pomocí SDS a 2D elektroforézy. Elektroforeticky separované proteiny přenesené na NC membránu využíváme pro detekci pomocí protilátek nebo k vazebnýcm studiím s biotinem značenými ligandy. Izolace proteinů z reprodukčních tkání a tekutin a jejich detekce pomocí protilátek je nezbytná pro určení původu proteinů reprodukčního traktu. Lokalizace proteinů na povrchu a uvnitř spermatických buněk a v sekreční tkáni reprodukčních orgánů studujeme pomocé imunofluorescenční mikroskopie. Cílená izolace určitých proteinů spermatické buňky, jejich lokalizace na spermiích nebo v tekutinách a tkáních reprodukčního traktu slouží jako nepostradatelné nástroje pro studium molekulárních mechanismů reprodukčního procesu.
|
|
Dynamics of mouse sperm capacitation and acrosome reaction
Dvořáková-Hortová, Kateřina ; Frolíková, Michaela ; Děd, Lukáš ; Šebková, Nataša
Capacitation followed by the acrosome reaction (AR), is a very complex event of molecular changes, including acrosome matrix rearrangement and actin polymerization, which mammalian sperm must undergo in the female reproductive tract in order to obtain the ability to penetrate and fertilize the egg. CD46 and β1-integrin belong to specific proteins, which are predicted to interact during molecular reorganization of capacitating sperm. The IZUMO1 as the primary fusion protein of the mammalian sperm is also involved in this dynamic network. We investigated the relationship between the Izumo, CD46 and β1 integrin relocation in the sperm head during the capacitation and AR in vitro. We have already successfully monitored by immunofluorescent labelling the dynamics of proteins CD46 and β1-integrin. The changes in the localization of these proteins associated with the AR and their mutual co-localization was observed. The original β1-integrin location in the freshly released epididymal sperm is in the acrosome and it relocates during the AR further through the sperm head compartments into the equatorial segment and over the whole sperm head. Its density over the equatorial segment is decreasing with the extended time of the AR. Also its presence in the perforatorium of the mouse sperm head is very prominent. The pattern for protein CD46 is extremely similar if not identical in both aspects such as compartment localization and time progress during capacitation and AR in vitro. The molecular interaction of CD46 and β1-integrin was investigated using the Proximity Ligation Assay and Super resolution microscopy STED. The data were statistically analysed. The newly obtained results from CD46 and β1-integrin relocation are in correlation with IZUMO1 dynamics and giving a substantial knowledge on the studied protein network rearrangement during capacitation and AR in mouse spermatozoa.
|
|
International Digital Library of Manuscripts
Knoll, Adolf,
The Manuscriptorium Digital Library is Europe’s largest digital library of manuscripts providing access to data from more than 120 institutions across Europe incl. ca. 55 most important Czech collections. In March 2015, it contained 43,372 fully digitized documents and more than 337,000 bibliographic records. The documents are not only of European origin (Western, Slavonic, Hebrew, Armenian ...), but there are also data representing Arabic, Persian, Ottoman, Indian and other manuscript traditions. The digital library was launched in 2003 by the National Library of the Czech Republic, in partnership with the Czech AiP Beroun Company. In comparison and in contrast with other aggregation services, it provides seamless access to full digital documents on the fly, reusing thus repositories of partner digital libraries. Users do not need to travel or to navigate from one physical place or digital library to another one to access needed documents. Manuscriptorium provides uniform interface to any data from any digital library that signed the partnership agreement. The internal metadata solution is based on the robust TEI P5 approach and suits both library and researchers’ requirements for description and structuring. It aggregates not only fully digitized documents, but also the partially digitized ones and bibliographic records. It contains manuscripts as well as old printed books, historical maps, and historical posters. The documents are mostly represented by digital images and in certain extent also by full texts, TEI-structured and unstructured. The Manuscriptorium larger environment provides also online support to TEI authoring and online metadata validation and upload. ...
|
host ::
