Národní úložiště šedé literatury Nalezeno 23,641 záznamů.  začátekpředchozí21 - 30dalšíkonec  přejít na záznam: Hledání trvalo 0.59 vteřin. 

Čtenářský deník a ICT - tradiční výuková metoda v kontextu moderních technologií
GRÚZ, Michael
Rigorózní práce Čtenářský deník a ICT tradiční výuková metoda v kontextu moderních technologií je rozdělena na dva oddíly. Teoretická část se nejprve zabývá základními principy uměleckého textu, jeho recepcí a motivací k četbě. Pozornost je dále věnována literární a čtenářské výchově ve škole, ale i v mimoškolním životě dítěte, a to i v tzv. předčtenářském období. Stěžejní oddíl je zaměřen na vliv moderních technologií na výuku literatury a problematiku čtenářských (kulturních) deníků. Výzkumná část obsahuje výsledky dvou dotazníkových šetření. První z nich bylo určeno pro učitele českého jazyka a literatury, kteří působí na druhém stupni základních škola a na nižším stupni gymnázií, a kladlo si za úkol zmapovat jejich přístup k zadávání, kontrole, hodnocení a dalšímu využití čtenářských deníků v hodinách literární výchovy. Druhý dotazník zjišťoval žákovský přístup k individuální mimočítankové četbě a využívání tzv. online literárních příruček.

Black Chromia Plating for the Solar Radiation Absorbers
Brožek, Vlastimil ; Březina, Václav ; Brom, Petr ; Kubatík, Tomáš František ; Vilémová, Monika ; Mastný, L. ; Novák, M.
Black chromia layers were produced on copper, zirconium and aluminium substrates. These layers are aimed to serve as solar collectors. Efficiency of the layers during UV-VIS, UV radiation and WSP® plasma torch radiation is described. The chromia layers were prepared by a new procedure, i.e. deposition of ammonium dichromate solution using plasma torch or so called Liquid Precursor Plasma Spraying (LPPS). Solution of ammonium dichromate is fed into plasma stream, where dissociation takes place under temperatures of 4000 K – 25000 K. Up to nanometric oxide particles can be produced; the resulting size is dependent on solution concentration and feeding nozzle diameter. The particles impact on substrate and form coating. Using 2 wt.% to 5 wt.% solution of ammonium dichromate and feeding nozzle of 0.2 mm in diameter is the size of produced chromia particles about 6 µm which results in formation of 2 µm to 3 µm thick coating, i.e. according to the theory an optimal thickness 2.5 um for absorption layers, necessary condition for formation energy traps for IR radiation emitters up to 100°C. Moreover, black chromia coating is a suitable corrosion barrier of metallic substrates. \n\n

Laserové chlazení zachycených iontů pro metrologii frekvence a času
Číp, Ondřej ; Pham, Minh Tuan ; Čížek, Martin ; Lešundák, Adam ; Hucl, Václav ; Hrabina, Jan ; Řeřucha, Šimon ; Jedlička, Petr ; Lazar, Josef
Současný výzkum v oboru laserového chlazení zachycených iontů vede k získání izolovaných iontů v základním pohybovém stavu. Detekce excitovaného Dopplerovsky zchlazeného iontu na jeho kvadrupólový přechod elektronické struktury dává příležitost ke stabilizaci vysoce koherentních laserů na optické frekvenci řádu stovek THz. Tímto způsobem lze definovat nový standard času či optické frekvence zvaný "Optické atomové hodiny". Ústav přístrojové techniky v Brně ve spolupráci s Katedrou optiky Univerzity Palackého v Olomouci realizují unikátní výzkumnou infrastrukturu pro laserové chlazení 40Ca+ iontů a následné experimenty kvantové mechaniky a spektroskopie ve společné laboratoři v Brně. V současnosti jsou rutinně generovány a zachytávány 40Ca+ ionty. Je prováděno jejich Dopplerovské chlazení prostřednictvím dipólového přechodu na vlnové délce 397 nm a prováděna detekce a spektroskopie elektronické struktury iontu a výskyt jeho temných rezonancí.

Analýza vlivu používání technických zařízení řidičem na reakční dobu
Kubánek, Ondřej ; Bradáč, Albert (oponent) ; Panáček, Vladimír (vedoucí práce)
Tato diplomová práce se zabývá analýzou vlivu používání technických zařízení řidičem na reakční dobu. Jsou zde popsány zákonné požadavky na používání technických zařízení řidičem ve vozidle. Rozebrány typy používaných technických zařízení řidiči a především probrána problematika reakční doby řidičů. Jsou posouzeny vlivy působící na reakční dobu, způsoby měření reakční doby a typy reakčních dob. Jsou rozebrány starší výzkumy z počátků měření reakčních dob až po nejnovější výzkumy, zabývající se měřením reakčních dob při používání mobilního telefonu. Praktická část práce je věnována provedení jízdních zkoušek na vybraném vzorku řidičů a vyhodnocení jejich reakčních dob při běžné jízdě a při telefonování. Naměřená a vyhodnocená data jsou okomentována s ohledem na přínos ve znalecké činnosti oboru doprava.

New Methods for Increasing Efficiency and Speed of Functional Verification
Zachariášová, Marcela ; Dohnal, Jan (oponent) ; Steininger, Andreas (oponent) ; Kotásek, Zdeněk (vedoucí práce)
In the development of current hardware systems, e.g. embedded systems or computer hardware, new ways how to increase their reliability are highly investigated. One way how to tackle the issue of reliability is to increase the efficiency and the speed of verification processes that are performed in the early phases of the design cycle. In this Ph.D. thesis, the attention is focused on the verification approach called functional verification. Several challenges and problems connected with the efficiency and the speed of functional verification are identified and reflected in the goals of the Ph.D. thesis. The first goal focuses on the reduction of the simulation runtime when verifying complex hardware systems. The reason is that the simulation of inherently parallel hardware systems is very slow in comparison to the speed of real hardware. The optimization technique is proposed that moves the verified system into the FPGA acceleration board while the rest of the verification environment runs in simulation. By this single move, the simulation overhead can be significantly reduced. The second goal deals with manually written verification environments which represent a huge bottleneck in the verification productivity. However, it is not reasonable, because almost all verification environments have the same structure as they utilize libraries of basic components from the standard verification methodologies. They are only adjusted to the system that is verified. Therefore, the second optimization technique takes the high-level specification of the system and then automatically generates a comprehensive verification environment for this system. The third goal elaborates how the completeness of the verification process can be achieved using the intelligent automation. The completeness is measured by different coverage metrics and the verification is usually ended when a satisfying level of coverage is achieved. Therefore, the third optimization technique drives generation of input stimuli in order to activate multiple coverage points in the veri\-fied system and to enhance the overall coverage rate. As the main optimization tool the genetic algorithm is used, which is adopted for the functional verification purposes and its parameters are well-tuned for this domain. It is running in the background of the verification process, it analyses the coverage and it dynamically changes constraints of the stimuli generator. Constraints are represented by the probabilities using which particular values from the input domain are selected.       The fourth goal discusses the re-usability of verification stimuli for regression testing and how these stimuli can be further optimized in order to speed-up the testing. It is quite common in verification that until a satisfying level of coverage is achieved, many redundant stimuli are evaluated as they are produced by pseudo-random generators. However, when creating optimal regression suites, redundancy is not needed anymore and can be removed. At the same time, it is important to retain the same level of coverage in order to check all the key properties of the system. The fourth optimization technique is also based on the genetic algorithm, but it is not integrated into the verification process but works offline after the verification is ended. It removes the redundancy from the original suite of stimuli very fast and effectively so the resulting verification runtime of the regression suite is significantly improved.

Acceleration Methods for Evolutionary Design of Digital Circuits
Vašíček, Zdeněk ; Miller, Julian (oponent) ; Zelinka,, Ivan (oponent) ; Sekanina, Lukáš (vedoucí práce)
Although many examples showing the merits of evolutionary design over conventional design techniques utilized in the field of digital circuits design have been published, the evolutionary approaches are usually hardly applicable in practice due to the various so-called scalability problems. The scalability problem represents a general problem that refers to a situation in which the evolutionary algorithm is able to provide a solution to a small problem instances only. For example, the scalability of evaluation of a candidate digital circuit represents a serious issue because the time needed to evaluate a candidate solution grows exponentially with the increasing number of primary inputs. In this thesis, the scalability problem of evaluation of a candidate digital circuit is addressed. Three different approaches to overcoming this problem are proposed. Our goal is to demonstrate that the evolutionary design approach can produce interesting and human competitive solutions when the problem of scalability is reduced and thus a sufficient number of generations can be utilized. In order to increase the performance of the evolutionary design of image filters, a domain specific FPGA-based accelerator has been designed. The evolutionary design of image filters is a kind of regression problem which requires to evaluate a large number of training vectors as well as generations in order to find a satisfactory solution. By means of the proposed FPGA accelerator, very efficient nonlinear image filters have been discovered. One of the discovered implementations of an impulse noise filter consisting of four evolutionary designed filters is protected by the Czech utility model. A different approach has been introduced in the area of logic synthesis. A method combining formal verification techniques with evolutionary design that allows a significant acceleration of the fitness evaluation procedure was proposed. The proposed system can produce complex and simultaneously innovative designs, overcoming thus the major bottleneck of the evolutionary synthesis at gate level. The proposed method has been evaluated using a set of benchmark circuits and compared with conventional academia as well as commercial synthesis tools. In comparison with the conventional synthesis tools, the average improvement in terms of the number of gates provided by our system is approximately 25%. Finally, the problem of the multiple constant multiplier design, which belongs to the class of problems where a candidate solution can be perfectly evaluated in a short time, has been investigated. We have demonstrated that there exists a class of circuits that can be evaluated efficiently if a domain knowledge is utilized (in this case the linearity of components).

Simulace a protiřetězce pro efektivní práci s konečnými automaty
Holík, Lukáš ; Černá, Ivana (oponent) ; Jančar, Petr (oponent) ; Vojnar, Tomáš (vedoucí práce)
This thesis is focused on techniques for finite automata and their use in practice, with the main emphasis on nondeterministic tree automata. This concerns namely techniques for size reduction and language inclusion testing, which are two problems that are crucial for many applications of tree automata. For size reduction of tree automata, we adapt the simulation quotient technique that is well established for finite word automata. We give efficient algorithms for computing tree automata simulations and we also introduce a new type of relation that arises from a combination of tree automata downward and upward simulation and that is very well suited for quotienting. The combination principle is relevant also for word automata. We then generalise the so called antichain universality and language inclusion checking technique developed originally for finite word automata for tree automata.  Subsequently, we improve the antichain technique for both word and tree automata by combining it with the simulation-based inclusion checking techniques, significantly improving efficiency of the antichain method. We then show how the developed reduction and inclusion checking methods improve the method of abstract regular tree model checking, the method that was the original motivation for starting the work on tree automata. Both the reduction and the language inclusion methods are based on relatively simple and general principles that can be further extended for other types of automata and related formalisms. An example is our adaptation of the reduction methods for alternating Büchi automata, which results in an efficient alternating automata size reduction technique.

Stability and convergence of numerical computations
Sehnalová, Pavla ; Dalík, Josef (oponent) ; Horová, Ivana (oponent) ; Kunovský, Jiří (vedoucí práce)
The aim of this thesis is to analyze the stability and convergence of fundamental numerical methods for solving ordinary differential equations. These include one-step methods such as the classical Euler method, Runge-Kutta methods and the less well known but fast and accurate Taylor series method. We also consider the generalization to multistep methods such as Adams methods and their implementation as predictor-corrector pairs. Furthermore we consider the generalization to multiderivative methods such as Obreshkov method. There is always a choice in predictor-corrector pairs of the so-called mode of the method and in this thesis both PEC and PECE modes are considered. The main goal and the new contribution of the thesis is the use of a special fourth order method consisting of a two-step predictor followed by an one-step corrector, each using second derivative formulae. The mathematical background of historical developments of Nordsieck representation, the algorithm of choosing a variable stepsize or an error estimation are discussed. The current approach adapts well to the multiderivative situation in variable stepsize formulations. Experiments for linear and non-linear problems and the comparison with classical methods are presented.

Multimedia Data Processing in Heterogeneous Distributed Environment
Kajan, Rudolf ; Ferko,, Andrej (oponent) ; Míkovec, Zdeněk (oponent) ; Herout, Adam (vedoucí práce)
Ubiquitous computing, a paradigm in which the processing of information is linked with each activity or object as encountered, was proposed by Mark Weiser as the next era for interacting with computers. Its goal is to enable people to interact with devices more naturally and casually in ways that suit whatever location or context they find themselves in. Ubiquitous computing focuses on learning by removing the complexity of computing and increases efficiency while using computing for different daily activities. But after more than 15 years since Weiser formulated these goals, several aspects of ubiquitous computing are still not a part of user experience with today’s technology. Seamless integration with environment leading to technological invisibility or user interaction spanning across multiple devices pose still a great challenge. The main goal of our work is to make a step towards making the idea of ubiquitous computing a reality by addressing the question about intuitive information sharing between a personal device and a situated display. We have developed three interaction techniques which support unobtrusive content exchange between touch-enabled personal device and a large display - whether it is shared-private or public. These techniques are based on video streams, augmented reality, and analysis of gaze data. Besides the interaction techniques, we also present a framework for real-time application state acquisition and reconstruction on target platform. We report on user studies focused on the usability of our prototypes and a system performance evaluations. Our experiments were formed around real-life scenarios which are commonly experienced throughout the day. For interactions based on video streams, the results indicate that our techniques outperform the existing solutions: the localization and task migration is done in real time on a midlevel cellphone; the localization is reliable even for different observation angles and for cluttered screen content. Our technique based on gaze analysis goes even further by allowing for modeling of implicit user preferences through gaze data, while being accurate and unobtrusive.

Specificity of insect-plant associations and their role in the formation of plant defenses and speciation
VOLF, Martin
The aim of this dissertation is to investigate what role insect-plant interactions play in the formation of host-plant defenses and in the diversification of both groups. We show that various groups of herbivore respond differently to host-plant defenses. Therefore plant defenses diversify into suites of complementary traits, as individual traits fail to provide protection against specialized herbivores. Further, we identify what levels of host-phylogeny shape the food-web structure of insect herbivores. We show that specialized herbivores are affected mainly by the terminal parts of the host-phylogeny. In contrast, more polyphagous guilds are affected mainly by the mid-levels of the host phylogeny because the effects of terminal or deeper phylogeny seem to be surpassed by other factors in more generalist insect species. In the last chapter, we show how specialized insect-plant interactions generated by tight insect-plant coevolution can influence the speciation in plants over environmental gradients.