National Repository of Grey Literature 39 records found  beginprevious21 - 30next  jump to record: Search took 0.00 seconds. 
Canon brand in media from its foundation in Czech republic to the present day
Pérezová, Aneta ; Klabíková Rábová, Tereza (advisor) ; Huněk, Filip (referee)
The main topic of this bachelor's thesis is to describe the media communication of Canon company in the Czech republic from its foundation to the present time. First part of the work explains the history of the Canon brand in the world, describes its product portfolio and names the important competitors. The first part also focuses on the Canon CZ, the Czech subsidiary of Canon Inc. Next part of the thesis briefly explains the theory of media and goes to the explanation of the particular ways how to promote a company in media. Such subjects as ATL, BTL, online media, public relations and sponsoring are being described. The main part of the thesis is the description of the mentioned promotion ways used on an example presented by the company Canon CZ. The analysis is divided into different time periods. Also sales results are mentioned in the end of the thesis. The work also constitutes of two researches which are a quantitative content analysis and a survey.
« CONSTRUCTIONS INACHEVEES » : The meaning of the literary fragment and of the incomplete, their signification in the construction of the human self. Stendhal, Deml, Michaux
Prokop, Lukáš ; Vojvodík, Josef (advisor) ; Hrbata, Zdeněk (referee) ; Rinner, Fridrun (referee)
The objective of this work is to analyze the relation of a literary text to one's identity, to its understanding and to its formation through the written language. The relation between man and the world founded on the awareness of one's own visibility serves as the basis for this analysis. Further, the analysis draws on a hypothesis that one's own visibility within the world is perceived as both a threat and as something inauthentic. Thus, human beings make considerable effort to form themselves according to their own principles or to become someone else with the help of literary text, to take on various disguises and masks, but also to use language as a tool enabling them to uncover their own authenticity. On the onset, such approach was represented by Stendhal's work that is considered as the founding stone of literary egotism. The reason is that, in his work, Stendhal focuses exclusively on himself, which is manifested by a double gesture: self-analysis and self-construction. Both these gestures, performed by the means of language, have a number of successors in various literatures, including Czech literature and the work of Jakub Deml. In Deml's texts, too, the double gesture of self-analysis and self-construction can be recognized. By modifying his own identity, mainly through the inclusion of other...
Visibility at the Praha Ruzyne airport
Kusáková, Kateřina ; Žák, Michal (advisor) ; Pišoft, Petr (referee)
The goal of this bachelor thesis is to show the importance of visibility in flight operations. There are settled minima of visibility for each process, which must be achieved. Visibility has its own daily range, which is closely connected with solar radiation. Its also connected with a vertical structure of atmosphere, direction and speed of wind and current weather conditions. Visibility achieves its lowest values during intensive precipitations and in a fog. Mainly because of an appearance and lasting of a fog, there are compilations at the airport and very often a special procedures must be taken for an organization of flight operations. An appearance and lasting of a fog has a big influence on flight operations and that is why I pay an attention to this in my work. I concentrated myself not only on the daily range of visibility and its dependency on the direction of a wind, but on conditions of appearance and ending the fog as well.
Efficient visibility calculation for light transport simulation in participating media
Houška, Čestmír ; Křivánek, Jaroslav (advisor) ; Karlík, Ondřej (referee)
Title: Efficient visibility calculation for light transport simulation in participating media Author: Čestmír Houška Department / Institute: Department of Software and Computer Science Educa- tion Supervisor of the master thesis: doc. Ing. Jaroslav Křivánek, Ph.D. Abstract: This thesis investigates the use of acceleration methods for the testing of visibility in light transport calculation algorithms with the emphasis on conser- vativeness and low accelerated query overhead. Several published non-directional and directional distance field methods are presented with the description of their characteristic properties. Two of these methods are then implemented and thor- oughly tested in an existing rendering framework on a path tracing volumetric integrator as well as on an own implementation of a ray marching single scattering integrator. A method that further accelerates the original distance field methods by pre-caching results of some of the queries is also proposed, implemented and tested. Furthermore, several possible extensions to this method are outlined. Keywords: computer graphics, rendering, participating media, visibility
Visibility Determination in 3D Maze
Hodes, Vít ; Pečiva, Jan (referee) ; Polok, Lukáš (advisor)
This work is about solving the visibility problem in the environment of simple 3D maze by means of BSP tree and PVS computation between leaves. It contains description of key algorithms and processes for achieving this goal. In the core of this work were all of the implemented ways of drawing measured and mutually compared. At the end are outlined next possible steps in development and evaluating achieved results.
Education Computer Program for Demonstration of 3D Models Visibility Algorithms
Juřica, Dalibor ; Šiler, Ondřej (referee) ; Kršek, Přemysl (advisor)
The aim of this project isn't build the application, whick is able to hande visibility problem of three dimensional scenes, but application, that can demonstrate idea of this visibility problem. Separate scenes will be designed in way, that even the amateur will not have any problem to understand the principle of demonstrate algorithms. Subsequent graduation of the visibility problem will be then fully comprehensible.
Hierarchical Techniques in Lighting Computation
Ligmajer, Jiří ; Polok, Lukáš (referee) ; Navrátil, Jan (advisor)
This master thesis deals with description of hierarchical techniques in global lighting computation. Here is explaining the importance of hierarchical techniques in lighting computation and shows method, how to use these hierarchical techniques in realtime radiosity and its extension to dynamic area lighting. These two techniques are described in detail in the first part of this project. In the other part is desing and implementation of application for dynamic area lighting computation.
Real-Time Illumination of a Scene
Martanovič, Lukáš ; Polok, Lukáš (referee) ; Navrátil, Jan (advisor)
This thesis is focused on describing methods of computation of global illumination of 3D graphics scenes in real-time. First chapter contains brief introduction to the issue of global illumination (GI) computation, as well as quick summarisation of principles of most commonly used GI computation approaches. A method of visibility computing for indirect illumination, taking advantage of Imperfect Shadow Mapping, is introduced next. After closer examination of this method and prerequisite algorithms follows a description of its practical implementation, as well as of the structure of simple demonstrative application. Next chapter then contains testing and brief examination and evaluation of resulting program's behaviour. Finally, a possible method extension by means of virtual point light clustering is proposed.
Visibility Determination in 3D Maze
Petruželka, Jiří ; Milet, Tomáš (referee) ; Polok, Lukáš (advisor)
The purpose of this thesis is to present methods for visibility determination and to design and implement an application to demonstrate visibility determination in a 3D maze.
Analysis of General Polygon Boolean Operation Algorithms
Daněk, Tomáš ; Zemčík, Pavel (referee) ; Beran, Vítězslav (advisor)
This thesis deals with general polygon boolean operation algorithms. Boolean operations are e.g. intersection, union or difference. A general polygon can be e.g. a selfinterecting polygon with inner hole. Clipping of polygons against a rectangular window is probably the most familiar boolean operation on polygons. At first, basic definitions are listed. Then the principles of a selected set of boolean operation algorithms are reviewed. Finally, a complex comparison of the algorithms is undertaken. Performance as well as the ability to handle degenerate cases are tested. The output of this thesis is an overall evaluation of algorithm properties and a dynamic library that contains the implementation of all of the tested algorithms.

National Repository of Grey Literature : 39 records found   beginprevious21 - 30next  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.