|
|
The Stirling Thermodynamic Cycle
Macháček, Jan ; Sokanský, Karel (referee) ; Kyncl, Jan (referee) ; Gregor, Jan (advisor)
My doctoral thesis deals with study and analyse of Stirling thermodynamical cycle. Cycle that is composed of two isochoras and two isotherms. I describe functional principle of Stirling engine and all its parts, constructional variations of pistons system and possible engine working modes. Next chapter contains analyse of engine constructional parameters. Measuring of torque and load characteristics, p - V schemes and output work for various engine inputs is part of this analyse. There is composed mathematical engine characterization by means of Schmidt theory in chapter five. Mathematical characterization is consequently applied to engine model. Theoretical analysis and practical measurement were base for concepts, realization and verification of constructional correction. One part of my thesis is attended to design of new lamella for regenerative exchanger. For optimal lamella constructional proportions were used computational algorithm and simulations. There is concept of cogeneration unit with Stirling engine and its benefits check in last chapter. General theoretical and practical analyse of workable Stirling engine is result of my thesis. Analyse in this extent was not nowhere publishing yet. Design of regenerative exchanger lamella is then practical input of my thesis.
|
|
|
Advanced Electronic Circuits Simulation Methods
Kocina, Filip ; Kozek, Martin (referee) ; Kyncl, Jan (referee) ; Kunovský, Jiří (advisor)
Disertační práce se zabývá simulací elektronických obvodů. Popisuje metodu kapacitorové substituce (CSM) pro převod elektronických obvodů na elektrické obvody, jež mohou být následně řešeny pomocí numerických metod, zejména Moderní metodou Taylorovy řady (MTSM). Tato metoda se odlišuje automatickým výběrem řádu, půlením kroku v případě potřeby a rozsáhlou oblastí stability podle zvoleného řádu. V rámci disertační práce bylo autorem disertace vytvořeno specializované programové vybavení pro řešení obyčejných diferenciálních rovnic pomocí MTSM, s mnoha vylepšeními v algoritmech (v porovnání s TKSL/386). Tyto algoritmy zahrnují zjednodušování obecných výrazů na polynomy, paralelizaci nezávislou na integrační metodě atp. Tento software běží na linuxovém serveru, který komunikuje pomocí protokolu TCP/IP. Toto vybavení bylo úspěšně použito pro simulaci VLSI obvodů, jejichž řešení pomocí CSM bylo značně rychlejší a spotřebovávalo méně paměti než state-of-the-art SPICE.
|
|
|
Covering families of triangles by convex sets
Krajči, Samuel ; Kynčl, Jan (advisor) ; Soukup, Jan (referee)
A convex universal cover of a family M of sets in the plane is a convex set that contains a congruent copy of every element of M. Park and Cheong conjecture that for every family of triangles with bounded diameter there exists a triangle that is a smallest universal cover of this family. We prove this conjecture for every family of all triangles with the lengths of their two sides fixed, every family of all triangles with the length of a side and the size α of the opposite angle fixed (where α is from an interval (0, λ]∩[3π/7, π) with λ being approximately 0.396π), every finite subfamily of a family of all triangles with the length of a side and the size α of the opposite angle fixed (where α ≥ π/2). 1
|
|
|
Unfolding some classes of polycubes
Minařík, Josef ; Kynčl, Jan (advisor) ; Tiwary, Hans Raj (referee)
An unfolding of a polyhedron is a cutting along its surface such that the surface remains connected and it can be flattened to the plane without any overlap. An edge- unfolding is a restricted kind of unfolding, we are only allowed to cut along the edges of the faces of the polyhedron. A polycube is a special case of orthogonal polyhedron formed by glueing several unit cubes together face-to-face. In the case of polycubes, the edges of all cubes are available for cuts in edge-unfolding. We focus on one-layer polycubes and present several algorithms to unfold some classes of them. We show that it is possible to edge-unfold any one-layer polycube with cubic holes, thin horizontal holes and separable rectangular holes. The question of edge-unfolding general one-layer polycubes remains open. We also briefly study some classes of multi-layer polycubes. 1
|
|
| |
|
|
The analysis of marketing communications of the Prague Spring International Music Festival 2009
Kyncl, Jan ; Dolanská, Nora (advisor) ; Čeňková, Jana (referee)
Bachelor thesis "The analysis of marketing communications of The Prague Spring International Music Festival 2009" deals with the method how basic marketing principles are applied in the field of arts. The major goal of this study is: 1. to make a list of the main features marketing of an art organization should include, 2. to name the reasons why marketing policy should be adopted by such organization's management, 3. to indicate conditions needed for success in arts marketing. The theoretical part is based upon the relevant art marketing publications available, and on the major marketing literature which creates a framework for modern marketing theory. The second part deals with the marketing campaign of the The Prague Spring International Music Festival 2009 which is widely considered to be the most significant cultural event within the Czech republic and Central Europe as well. The analysis consists of detailed description of the marketing planning proces, characterization of the campaign's communication mix, and the evaluation of it's effectiveness. There's also a short resumé at the end of the text which provides a brief review of festival camping. Complex overview of all the information gained by writing the diploma thesis and studying the subject is also included.
|
|
| |
|
| |
|
| |
|
|
Drawing geometric graphs on red-blue point sets
Soukup, Jan ; Kynčl, Jan (advisor) ; Kratochvíl, Jan (referee)
Consider a set B of blue points and a set R of red points in the plane such that R ∪ B is in general position. A graph drawn in the plane whose edges are straight-line segments is called a geometric graph. We investigate the problem of drawing non-crossing properly colored geometric graphs on the point set R ∪ B. We show that if ||B| − |R|| ≤ 1 and a subset of R forms the vertices of a convex polygon separating the points of B, lying inside the polygon, from the rest of the points of R, lying outside the polygon, then there exists a non-crossing properly colored geometric path on R∪B covering all points of R ∪ B. If R∪B lies on a circle, the size of the longest non-crossing geometric path is related to the size of the largest separated matching; a separated matching is a non-crossing properly colored geometric matching where all edges can be crossed by a line. A discrepancy of R ∪ B is the maximal difference between cardinalities of color classes of intervals on the circle. When the discrepancy of R ∪ B is at most 2, we show that there is a separated matching covering asymptotically 4 5 of points of R ∪ B. During this proof we use a connection between separated matchings and the longest common subsequences between two binary sequences where the symbols correspond to the colors of the points.
|
guest ::
RSS feed.