|
|
Extrasensory Architecture
Kacetlová, Kateřina ; Eyer, David (referee) ; Mléčka, Jan (advisor)
This thesis sums up the current possibilities of a family house building considering the tradition and the relationship of the inhabitants not only to the landscape but also to themselves. Specifically, it describes the possibility of using natural building materials and creating a variable and vital space considering contemporary family needs. The first part of the sub diploma contains a manual of historical development and current trends in the field of extrasensory perception of architecture. The design part describes a proposal of a family house in the countryside. The results of this study provide a basic insight into the problem and illustrate the practical application of acquired knowledge in the construction of the family house.
|
|
|
Algorithm for word morphisms fixed points
Matocha, Vojtěch ; Holub, Štěpán (advisor) ; Žemlička, Jan (referee)
In the present work we study the first polynomial algorithm, which tests if the given word is a fixed point of a nontrivial morphism. This work contains an improved worst-case complexity estimate O(m · n) where n denotes the word length and m denotes the size of the alphabet. In the second part of this work we study the union-find problem, which is the crucial part of the described algorithm, and the Ackermann function, which is closely linked to the union-find complexity. We summarize several common methods and their time complexity proofs. We also present a solution for a special case of the union-find problem which appears in the studied algorithm. The rest of the work focuses on a Java implementation, whose time tests correspond to improved upper bound, and a visualization useful for particular entries.
|
|
|
Meze pro vzdálenostně podmíněné značkování grafů
Kupec, Martin ; Fiala, Jiří (advisor) ; Dvořák, Zdeněk (referee)
We study the complexity of the λ−L(p, q)-labelling problem for fixed λ, p, and q. The task is to assign vertices of a graph labels from the set {0, . . . , λ} such that labels of adjacent vertices differ by at least p while vertices with a common neighbor have different labels. We use two different reductions, one from the NAE-3SAT and the second one from the edge precoloring extension problem. 1
|
|
|
External Economic Analysisi of an Enterprise
Baroch, Václav ; Kyjonka, Vladimír (advisor) ; Král, Jaroslav (referee)
Automatizované zpracování ekonomické analýzy podniku přináší jistá omezení. Klasická von Neumannova architektura doznala v poslední době určitých vylepšení, a je tak možné simulovat procesy, jejichž algoritmické zpracování bylo ještě před pár lety z praktického hlediska nemyslitelné, především kvůli nedostatečné početní a paměťové výkonnosti užívané IT technologie. Přes všechna zrychlení a razantní vylepšení IT technologií v posledních letech však softwarové zpracování simulace podnikových procesů naráží na dvě podstatná omezení, jež jsou popsána v práci. Je to nemožnost vytvářet izomorfní model reality a nutnost řešit simulaci interních a externích procesů v diskrétním čase.
|
|
|
Signal complexity evaluation in the processing of functional magnetic resonance imaging
Vyhnánek, Jan ; Boldyš, Jiří (advisor) ; Dvořák, Jiří (referee)
Functional magnetic resonance imaging has been recently the most common tool for examining the neural activity in human and animals. The goal of a typical data-mining challenge is the localisation of brain areas activated during a cognitive task which is usually performed using a linear model or correlation methods. For this purpose several authors have proposed the use of methods evaluating signal complexity which could possibly overcome some of the shortcomings of the standards methods due to their independence on a priori knowledge of data characteristics. This work explains possibilities of using such methods including aspects of their configuration and it proposes an evaluation of performance of the methods applied on simulated data following expected biological characteristics. The results of the evaluation of performance showed little advantage of these methods over the standard ones in cases when the standard methods were possible to apply. However, some of the methods evaluating signal complexity were found useful for determining the regularity of signals which is a feature that cannot be assessed by the standard methods. Optimal parameters of the methods evaluating signal regularity were determined on simulated data and finally the methods were applied on the data examining emotional processing of...
|
|
|
Macroevolutionary and ecological implications of the theory of frozen plasticity
Toman, Jan ; Flegr, Jaroslav (advisor) ; Fatka, Oldřich (referee) ; Mikuláš, Radek (referee)
The frozen plasticity theory is a punctuationalist theory of adaptive evolution. It states that long periods of stasis, during which populations respond to selection pressures only by elastic change in the frequency of already present alleles, alternate in the evolution of sexual species with short periods of plastic evolution, during which alleles can get fixed or eliminated by directed selection. Asexual species are not expected to maintain such high genetic polymorphism in the long term. They should, however, be able to plastically respond to selection pressures throughout their whole existence. This difference between the evolutionary dynamics of sexual and asexual clades has a number of ecological and macroevolutionary implications. Concerning ecology, we could expect different environmental preferences of sexual and asexual species. Accordingly, in our first work that was based on a comparative study, we statistically significantly supported the hypothesis that (ancient) asexual groups of (eukaryotes) inhabit more stable and homogeneous habitats than their related sexual controls. Focusing on actually experienced, i.e. subjective, heterogeneity of the environment turned out to be the crucial factor of this type of research. From the viewpoint of macroevolutionary implications of the frozen...
|
|
|
Evolution as a Way to God in the Work of Teilhard de Chardin
Jirousová, Františka ; Karfíková, Lenka (advisor) ; Sokol, Jan (referee) ; Macek, Petr (referee)
This dissertation deals with the notion of centration in the work of Teilhard de Chardin, the notion being examined with regard to two related aims: 1) to illustrate the logical structure of Teilhard's Christian theory of evolution, and 2) to explain the relation between centration carried out by created beings and centration assigned to God as the focal point of evolution. In other words: to explore the connection between fundamental freedom attributed by Teilhard to created beings and culminating in human beings according to him, and God's freedom demonstrating itself in controlling the universe and directing it to a goal being the fullness of being (pleroma). The first part presents Teilhard's life and the contexts of his work. The second part explains the main notions of Teilhard's theory and metaphysics, such as "consciousness", "spirit", "energy", "centro-complexity", and "matter", and relates them to the notion of centration. Centration is presented here as an activity of the consciousness consisting in the unifying formation of multitude by its interconnection with different types of relations around one centre. In such unification, the main law of evolution manifests itself - the Law of Differentiating Unity. This means that parts unified in such way start differentiating again. What is...
|
|
|
The Theory of Communication as an Explanatory Principle for the Natural Multilevel Text Segmentation
Milička, Jiří ; Zemánek, Petr (advisor) ; Cvrček, Václav (referee) ; Altmann, Gabriel (referee)
1. Phonemes, words, clauses and sentences are not a logical necessity of language, unlike distinctive features and morphemes. 2. Despite this, such nested segmentation is very firmly present in languages and in our concepts of language description, 3. because nested segmentation and inserting redundancy on multiple levels is an efficient way to get the language signal through the burst-noise channel. 4. There are various strategies how redundancy can be added and what kind of redundancy can be added. 5. The segment delimiter is expressed by some additional information and the amount of delimiting information is independent from the length of the seg- ment it delimits. This principle can serve as a basis for a successful model for the Menzerath's relation.
|
|
|
Grover's algorithm in Quantum computing and its applications
Katabira, Joseph ; Návrat, Aleš (referee) ; Hrdina, Jaroslav (advisor)
Kvantová výpočetní technika je rychle rostoucí obor informatiky, který přenáší principy kvantových jevu do našeho každodenního života. Díky své kvantové podstatě získávají kvantové počítače převahu nad klasickými počítači. V této práci jsme se zaměřili na vysvětlení základů kvantového počítání a jeho implementaci na kvantovém počítači. Zejména se zaměřujeme na popis fungování, konstrukci a implementaci Groverova algoritmu jako jednoho ze základních kvantových algoritmů. Demonstrovali jsme sílu tohoto kvantového algoritmu při prohledávání databáze a porovnávali ho s klasickými nekvantovými algoritmy pomocí implementace prostřednictvím simulačního prostředí QISKit. Pro simulaci jsme použili QASM Simulator a State vector Simulator Aer backends a ukázali, že získané výsledky korelují s dříve diskutovanými teoretickými poznatky. Toto ukazuje, že Groverův algoritmus umožňuje kvadratické zrychlení oproti klasickému nekvantovému vyhledávacímu algoritmu, Použitelnost algoritmu stejně jako ostatních kvantových algoritmů je ale stále omezena několika faktory, mezi které patří vysoké úrovně dekoherence a chyby hradla.
|
|
|
Kombinatorika matematických struktur
Paták, Pavel
The combinatorics of a first order mathematical structure is the class of all formulas valid in all in it definable structures. This notion was first introduced by Krajíček in [6]. In the present work we try to characterize and compare the combinatorics of several different prominent structures (reals, complex number, dense linear order, . . . ). We also study the question of algorithmical complexity, i.e. the question how hard it is to check whether a given formula lies in the combinatorics of a given structure. We prove that this question is corecursively enumeratively complete and therefore algorithmicaly undecidable in the case of models of complete theories without strict order property (SOP) and in the case of pseudofinite structures.
|
guest ::
