National Repository of Grey Literature 149 records found  beginprevious83 - 92nextend  jump to record: Search took 0.01 seconds. 
Y Soft Campus - the semi-abandoned shooting range area in Brno-Pisarky
Zavřelová, Jana ; Dundáček, Josef (referee) ; Kratochvíl, Jan (advisor)
Y SOFT CAMPUS The location of the planned campus of one of the most dynamically developing Czech companies is located in the premises of the former shooting range in Brno - Pisárky. This is despite the attractive surroundings and excellent access to the city center today as a brownfield. I propose a new small "city". Sufficiently self-sufficient but also dependent on the environment. This is backed up by new possibilities of land use. In addition to the building itself, I place multifunctional houses with medium-term accommodation on the premises, cultivate and expand the sports grounds for indoor activities, engage the river and create a residential area among the growing forests. This is supplemented by kindergarten and retirement home. From the historic buildings of the cruise restaurant and the grounds of the sports grounds and their surroundings, I create a public space with a gallery, an existing restaurant and a community center. Y Softu is based on the soft border between the city and the forest. The compact area of the building "breaks" into smaller segments, which at the same time represent individual departments. The building suddenly grows into the forest and the forest into the building. I provide enough natural light, contact with the surrounding grown forest, and varying views of the world. I make sure that, despite the great distances, everyone has the maximum interconnection. At the northern edge, I leave the area for the intended extension, which until then has grown trees to function as a forest. The building is designed as a wooden building with a reinforced concrete core and an extensive vegetation roof. The building is energetically designed as carefully and self-sustaining as possible. It uses geothermal and solar energy, rains the rainwater into tanks and re-uses it for flushing and irrigation and is also heated by a ventilation fan with a heat recovery unit
The role of women in contemporary Czech neo-Nazi movement
Kratochvíl, Jan ; Kandert, Josef (advisor) ; Čada, Karel (referee)
This graduate thesis is focused on the role of women in the Czech neonazist movement. It explores an approach of women and their organizations to gender roles and the position of women in the neonazist movement. From the gender point of view it analyses access of women to the movement, activism of separate organizations and documents of the neonazist organization " Resistance Women Unity". Thesis is based on the synthesis of available literature on this topic and authentic findings and original research of the author. The theoretical part of the thesis starts with the introduction of women's role in the national socialist ideology and the society of the German Reich, because national socialism in its original form represents a relevant reference framework for a neonazism movement. In the following part the author completely describes the development and the origin of women's neonazist organizations in the Czech Republic after year 1989 including extremely active Women Side - National Resistance Supporters and Resistance Women Unity. At the end of the theoretical part he compares and evaluates existing researches on this topic and he polemizes with their conclusions, especially with the ways how women join the movemets. The analytical part of the thesis consists of the content analysis of web pages...
The Role of Rating Agencies in the Worldwide Crise
Kratochvíl, Jan ; Očko, Petr (advisor) ; Ivánek, Jiří (referee)
The thesis focuses on the role of rating agencies in the financial crisis. The aim of the thesis is to judge a rate how much rating agencies contributed to give rise to last financial crisis, began by fall of Lehman Brothers in 2008. A main question is whether rating agencies acted inadvertently or on purpose and which all factors contributed most to result in financial crisis and as well how the rating agencies could influence and cope with these factors. The thesis deals with regulation of rating agencies and their appropriateness too. Rating and its aspects in theoretical way are described in the first part of the work. The real situation of rating industry prior to and in financial crisis is described in the second practical part of the thesis.
Computational complexity in graph theory
Doucha, Martin ; Kratochvíl, Jan (advisor) ; Dvořák, Zdeněk (referee)
This work introduces two new parameterizations of graph problems generalizing vertex cover which fill part of the space between vertex cover and clique width in the hierarchy of graf parameterizations. We also study parameterized complexity of Hamiltonian path and cycle, vertex coloring, precoloring extension and equitable coloring parameterized by these two parameterizations. With the exception of precoloring extension which is W[1]-hard in one case, all the other problems listed above are tractable for both parameterizations. The boundary between tractability and intractability of these problems can therefore be moved closer to parameterization by clique width.
Grid representations of graphs and the chromatic number
Balko, Martin ; Valtr, Pavel (advisor) ; Kratochvíl, Jan (referee)
Grid Representations and the Chromatic Number Martin Balko August 2, 2012 Department: Department of Applied Mathematics Supervisor: doc. RNDr. Pavel Valtr Dr. Supervisor's email address: valtr@kam.mff.cuni.cz Abstract In the thesis we study grid drawings of graphs and their connections with graph colorings. A grid drawing of a graph maps vertices to distinct points of the grid Zd and edges to line segments that avoid grid points representing other vertices. We show that a graph G is qd -colorable, d, q ≥ 2, if and only if there is a grid drawing of G in Zd in which no line segment intersects more than q grid points. Second, we study grid drawings with bounded number of columns, introducing some new NP- complete problems. We also show a sharp lower bound on the area of plane grid drawings of balanced complete k-partite graphs, proving a conjecture of David R. Wood. Finally, we show that any planar graph has a planar grid drawing where every line segment contains exactly two grid points. This result proves conjectures of D. Flores Pe˝naloza and F. J. Zaragoza Martinez. Keywords: graph representations, grid, chromatic number, plane
Extending Partial Representations of Graphs
Klavík, Pavel ; Kratochvíl, Jan (advisor) ; Fiala, Jiří (referee)
In this thesis, we study geometric intersection representations of graphs. For a fixed class, the well-known recognition problem asks whether a given graph belongs to this class. We study a generalization of this problem called partial representation extension. Its input consists of a graph with a partial representation, so a part of the graph is pre-drawn. The problems asks whether this partial representation can be extended to a representation of the entire graph. We study this problem for classes of interval graphs, proper interval graphs, unit interval graphs and chordal graphs (in the setting of subtrees-in-tree representations). We give linear-time algorithms for the first two classes and an almost quadratic-time algorithm for unit interval graphs. For chordal graphs, we consider different versions of the problem and show that almost all cases are NP-complete. Even though the classes of proper and unit interval graphs are known to be equal, the partial representation extension problem distinguishes them. For unit interval graphs, it poses additional restrictions concerning precise positions of intervals, and we describe a new structure of unit interval representations to deal with this. 1
Geometrické reprezentace grafů
Klavík, Pavel ; Kratochvíl, Jan (advisor) ; Pergel, Martin (referee)
Intersection graphs are a well studied field of graph theory. Complexity questions of recognition have been studied for several years. Given a graph, we ask whether the graph belongs to a fixed class. In this thesis, we introduce a new problem of partial representation extension. In this problem, aside from a graph, a part of a representation is also fixed. We ask whether it is possible to extend this partial representation to the whole graph. This problem is at least as hard as recognition. We study the partial representation extension problem for several intersection defined classes. We solve extending of interval graphs in time O(n2) and proper interval graphs in time O(mn). Using an approach described by Golumbic, we further show that comparability and permutation graphs are extendable in time O( · m). There are some classes that are known to be equal, for example unit interval graphs and proper interval graphs. Surprisingly, in the case of extending, we need to distinguish them. Similarly, we show that extending of function graphs and extending of co-comparability graphs are completely different problems.
Parameterized Complexity
Suchý, Ondřej ; Kratochvíl, Jan (advisor) ; Telle, Jan Arne (referee) ; Obdržálek, Jan (referee)
Title: Parameterized Complexity Author: Ondřej Suchý Department: Department of Applied Mathematics Advisor: Prof. RNDr. Jan Kratochvíl, CSc. Advisor's e-mail address: honza@kam.mff.cuni.cz Abstract: This thesis deals with the parameterized complexity of NP-hard graph problems. We explore the complexity of the problems in various scenarios, with respect to miscellaneous parameters and their combina- tions. Our aim is rather to classify in this multivariate manner whether the particular parameters make the problem fixed-parameter tractable or intractable than to present the algorithm achieving the best running time. In the questions we study typically the first-choice parameter is unsuccessful, in which case we propose to use less standard ones. The first family of problems investigated provides a common general- ization of many well known and studied domination and independence problems. Here we suggest using the dual parameterization and show that, in contrast to the standard solution-size, it can confine the in- evitable combinatorial explosion. Further studied problems are ana- logues of the Steiner problem in directed graphs. Here the parameter- ization by the number of terminals to be connected seems to be previ- ously unexplored in the directed setting. Unfortunately, the problems are shown to be...
Philosophy and Ethics of Ladislav Klíma
Kratochvíl, Jan ; Blažková, Miloslava (advisor) ; Hauser, Michael (referee)
The thesis are focused on the Czech author and philosopher Ladislav Klíma. The core topics are analyses of the philosophical systém, which is called Egosolisms, created by him. In the first part I have dissected the method thanks to which Klíma reached his view. The theses take into special consideration his "universal sense" and time. The thesis also mention Klíma's transition from theoretical thinking to formulations of particular ethical principles which the author also practised during his life. Furthermore the whole system is examined from a conceivable point of view and some contradictions are revealed. These contradictions are pointing out that more likely we are handeling with a particular confession rather than a effort to bring a certain inner cohesive systém of statements. The thesis are also researching to what degree do Klima's thoughts come from authors in whose connections it is spoke about Klima's work. The comperation basically is between Klima and Schopenhauer's conception of will and Nietzsche's conception of time. In the second part I was mainly dealing with Klima's ethic conclusions and suggestions, his criticism of Christianity and his approach to death and mortality. There is a tendency to show that despite of the verbal assaulting book Klima takes over a lot from religious forms of...

National Repository of Grey Literature : 149 records found   beginprevious83 - 92nextend  jump to record:
See also: similar author names
26 KRATOCHVÍL, Jakub
1 KRATOCHVÍL, Josef
26 Kratochvíl, Jakub
3 Kratochvíl, Jaromír
11 Kratochvíl, Jaroslav
2 Kratochvíl, Jindřich
25 Kratochvíl, Jiří
1 Kratochvíl, Jiří Jaroslav
2 Kratochvíl, Jonáš
Interested in being notified about new results for this query?
Subscribe to the RSS feed.