| |
|
Vector Graphics Editor for the AGE Project
Šebetovský, Jan ; Ježek, Pavel (advisor) ; Šerý, Ondřej (referee)
Present work studies possibilities of creating the vector graphics editor, which would be able to work as part of project AGE. Purpose of this project is to create integrated graphics tool. This work also contains program which is basic version of described editor. The advantage of this editor is especially ability to compute dimensions and colours of objects in picture from properties of another objecet in picture according to expression created by user. Editor also supports layers (in form of groups of objects), export of picture into bitmap formats and ability to work with Bézier curves. In addition this program almost fully supports filters, which are created in other work.
|
|
Algoritmus pro nelineární nejmenší čtverce
Balda, Miroslav
The contribution deals with a problem of experimental data processing by a least squares approach. A Matlab function based on Fletcher's version of Levenberg-Marquardt method has been implemented and tested even for a constrained problem
|
|
Optimal strategy for connecting light paths in bidirectional methods for global ilumination computation
Vorba, Jiří ; Křivánek, Jaroslav (advisor) ; Wilkie, Alexander (referee)
This work introduces a method for optimal combination of light paths generated from the camera and from the light sources in the Photon Mapping algorithm used for computing global illumination. Our method is based on Multiple Importance Sampling, a general approach, introduced by Veach, for adaptive path connection in Bidirectional Path-Tracing. Our goal is to examine this method in connection with the biased algorithm of Photon Mapping and to improve the ineffective heuristic used in the original version of this algorithm. This heuristic is usually problematic when applied to the scenes where highly glossy materials prevail.
|
| |
|
Interpolation in modal logics
Bílková, Marta ; Pudlák, Pavel (advisor) ; Švejdar, Vítězslav (referee) ; Iemhoff, Rosalie (referee)
Since Craig's landmark result on interpolation for classical predicate logic, proved as the main technical lemma in [14], interpolation is considered one of the centra! concepts in pure logic. Various interpolation properties find their applications in computer science and have many deep purely logical consequences. We focus on two propositional versions of Craig interpolation property: Craig Interpolation Property: for every provable implication (A -+ B) there is an interpolant I containing only only common variables of A and B such that both implications (A -+ I) and (I-+ B) are provable. Craig interpolation, although it seems rather technical, is a deep logical property. It is dosely related to expressive power of a logic - as such it entails Beth's definability property, or forces functional completeness. It is also related to Robinson's joint consistency of two theories that agree on the common language. Craig interpolation has an important algebraic counterpart - it entails amalgamation or superamalgamation property of appropriate algebraic structures. In case of modal provability logics, Craig interpolation entails fixed point theorem. There are other interpolation properties, defined w.r.t. a consequence relation rather then w.r.t. a provable implication. In presence of deduction theorem the two...
|
|
Solution of optimization problems with non-decreasing constraints.
Pavlíček, Ondřej ; Zimmermann, Karel (advisor) ; Palata, Jan (referee)
The content of this work is a presentation of algorithms solving optimization problems with a max-separable objective function of the form f(x) = maxjJ fj (xj), where fj are continuous unimodal functions. The optimization problems are solved under constraints, which are described by a system of (max,+)-linear equations and inequalities with variables occurring on both sides of the constraints. In Chapter 6, a modification of this problem with different variables on each side of the constraints is studied. Chapter 7 deals with problems, in which the constraint coefficients may be infinite. The work is based on results contained in previous publications, in which was shown that if the set of feasible solutions of the optimization problems considered here is nonempty, it has always the greatest element. The algorithms suggested in this work begin with this greatest element and decrease step by step the objective function without leaving the feasible set. The method proceeds in a certain sense by analogy with the method of feasible directions. Proofs of correctness of the algorithms and some results concerning computational complexity, as well as a computer implementation are included in the concluding part of the work.
|
|
An Implementation of the Extended Game Quoridor
Trojánek, Tomáš ; Mírovský, Jiří (advisor) ; Zeman, Daniel (referee)
This thesis analyses a classic board game called Quoridor and subsequently its implementation into a form of computer multiplayer application. At first, rules and its extensions from offical version are described, namely - new type of obstacles and generalization of the game board so that it allows bigger amount of players. These specifics alter the game and bring new challenges. A description of algorithms and mathematical study that solves these problems effectively folow. The described version is compared to the original. Finally thesis write about the design, realization and important mechanisms of the application, which contains, among others, implementations of individual algorithms from this text. Program allows to test proved theorems in real environment. It is a network multiplayer game with possibility to add computer oponents.
|
|
Wechsler memory scale-III., abbreviated test description and preliminary standarts for 20-39 yars old
Jenčová, Adéla ; Kulišťák, Petr (referee) ; Niederlová, Markéta (referee)
This thesis is about Wechsler Memory Scale-III Abbreviated (WMS-IIIa). WMS-IIIa is a screening test for measuring memory functioning. It contains measures of visual and verbal memory, immediate and delayed memory. Theoretical part of the thesis is an attempt of a Czech version of the test manual. It summarizes information about its original development, structure, purpose, administration, scoring and possibilities of interpretation. Moreover there is ona charter which summarize current knowledge about memory and one charter devoted to possibilities how to measure memory via psychological methods. The empirical part is a research targeted on acquisition of Czech norms on representative sample of nonclinical population at the age of 20 to 39 years. Statistical analysis was computed from data of 154 individuals. Demografic characteristics of research group was compared with characteristics of Czech population at the age of 20 to 39 years as described by Czech Statistical Institute.
|
|
Choral Works by Jan Bůžek
Holubcová, Tereza ; Stříteská, Leona (referee) ; Pecháček, Stanislav (advisor)
In the diploma work on "Sborova tvorba Jana Buzka" author give information about the life of the composer and devotes the arrangement of his composition for women and children choir, which devides into following categories: choir on the texts of folk poetry, choir on the ancient chinese and ancient japanese poetry, choir on the texts of J.Y. Sladek and choir on the poetry of other authors. Compositions, which are used in this diploma work weren 't, as a whole, published so far. For better understanding and use of Buzek's production, author analyses selected composition. The author firstly focuses on the harmonic and formal aspekt. Author pays attention to the technique of Buzek's composition and his use of modern methods. Author supportes this with a note extract processed in a computer program Sibelius4. As the supplement, the author presents a list of all well-preserved compositions for women and children choir, further then the whole version of individual compositions for practical use on atached CD, where it is possible to listen to every individual composition in electronic version and therefore get better idea of their sound form.
|
guest ::
