An Adaptive Feed-Forward Control
Kárný, Miroslav
2007 - English Feed-forward controllers are important in a range of control problems. Their importance is obvious in tasks in which potential of feedback control is limited, for instance, in systems with long transportation delays. Formally, their design can be approached by a standard methodology of optimal stochastic control. It can be consistently performed by combining Bayesian learning and dynamic programming. This formal solution can, however, rarely be converted into a computationally feasible algorithms. Thus, various approximations are searched for. The current report deals with a specific type of approximation based on a projection of optimal /emph{anticipating} control strategy to a non-anticipating one. This approximation way suits to the feed-forward control in which the selected system inputs influence the state of the controller but not the system-related data used in the feed-forward loop. V práci je popsán speciální návrh adaptivní dopředné vazby založený na neanticipativní aproximaci optimální anticipativní strategie. Keywords: adaptive feed=forward control; approximation Available at various institutes of the ASCR An Adaptive Feed-Forward Control

Feed-forward controllers are important in a range of control problems. Their importance is obvious in tasks in which potential of feedback control is limited, for instance, in systems with long ...

Kárný, Miroslav
Ústav teorie informace a automatizace, 2007

Image Segmentation Based on Local Noise Variance
Saic, Stanislav; Mahdian, Babak
2007 - English New segmentation method detecting changes in noise variance is introduced. Several examples are shown to demonstrate the method’s output. Je předvedena nová metoda pro detekci zmen variance sumu v digitálním obraze. Na řadě příkladů jsoou uvedeny výstupy metody. Keywords: Digital image; Segmentation; Noise; Tampering Available at various institutes of the ASCR Image Segmentation Based on Local Noise Variance

New segmentation method detecting changes in noise variance is introduced. Several examples are shown to demonstrate the method’s output....

Saic, Stanislav; Mahdian, Babak
Ústav teorie informace a automatizace, 2007

Spectral gap for zero processes on graphs
Fajfrová, Lucie
2007 - English The paper presents a method how the problem of finding a lower bound on the spectral gap for a zero range process on a connected graph could be transformed into the problem of finding a lower bound on spectral gap of a simple random walk on the graph. V clanku se ukazuje, jak lze ulohu nalezeni odhadu spektralni mezery pro Zero-range proces na grafu prevest na ulohu hledani spektralni mezery nahodne prochazky na grafu Keywords: particle systems; zero range dynamics; spectral gap Available at various institutes of the ASCR Spectral gap for zero processes on graphs

The paper presents a method how the problem of finding a lower bound on the spectral gap for a zero range process on a connected graph could be transformed into the problem of finding a lower ...

Fajfrová, Lucie
Ústav teorie informace a automatizace, 2007

Convexity and dependence in chance-constrained programming
Houda, Michal
2007 - English Keywords: stochastich programmnig; weak dependence; stability Available at various institutes of the ASCR Convexity and dependence in chance-constrained programming

Houda, Michal
Ústav teorie informace a automatizace, 2007

Empirical Estimates via Stability in Stochastic Programming
Kaňková, Vlasta
2007 - English It is known that optimization problems depending on a probability measure correspond to many applications. It is also known that these problems belong mostly to a class of nonlinear optimization problems and, moreover, that very often an ``underlying" probability measure is not completely known. The aim of the research report is to deal with the case when an empirical measure substitutes the theoretical one. In particular, the aim is to generalize reults dealing with convergence rate in the case of empirical esrimates. The introduced results are based on the stability results corresponding to the Wasserstein metric. A relationship berween tails of one-dimensional marginal distribution functions and exponentional rate of convergence are introduced. The corresponding results are focus mainly on ``classical" type of problems corresponding to the cases with penalty and recourse. However, an integer simple recourse case and some special risk funkcionals are discussed also. Keywords: Stochastic programming; stability; Wasserstein metric; empirical estimates; convergence rate; problems with penalty and recourse; integer simple recourse case; resk funkcionals Available at various institutes of the ASCR Empirical Estimates via Stability in Stochastic Programming

It is known that optimization problems depending on a probability measure correspond to many applications. It is also known that these problems belong mostly to a class of nonlinear optimization ...

Kaňková, Vlasta
Ústav teorie informace a automatizace, 2007

Jak správně interpretovat ukazatele způsobilosti a výkonnosti výrobního procesu
Michálek, Jiří
2007 - Czech Práce se zabývá otázkou správného chápání ukazatelů způsobilosti a výkonnosti a ukazuje na některé nedostatky, které se vyskytují v praxi The paper deals with the question of capability and performance indices right understanding and shows some mistakes occurring in practice Keywords: Ukazatee způsobilosti; ukazatele výkonnosti Available at various institutes of the ASCR Jak správně interpretovat ukazatele způsobilosti a výkonnosti výrobního procesu

Práce se zabývá otázkou správného chápání ukazatelů způsobilosti a výkonnosti a ukazuje na některé nedostatky, které se vyskytují v praxi...

Michálek, Jiří
Ústav teorie informace a automatizace, 2007

A Novel Emulation Technique that Preserves Circuit Structure and Timing
Kafka, Leoš
2007 - English This paper presents an emulation technique that allows to preserve structure and optionally timing of an emulated circuit according to a target technology. The technique is compatible with fault injection techniques based on circuit instrumentation or partial runtime reconfiguration, and it allows to emulate timing parameters of the circuit through an introduction of a virtual time. An area and timing overhead due to preserving the circuit structure and parameters of basic delay elements are evaluated by experiments. Článek popisuje novou metodu emulace obvodů v FPGA, která zachovává strukturu a případně i časování obvodu s ohledem na cílovou technologii. Metoda umožňuje použít obě metody vkládání poruch, a to jak metody založené na modifikaci obvodu, tak metody založené na dynamické rekonfiguraci. K emulaci časových vlastností obvodu se používá virtuální čas. Článek dále obsahuje experimenty, které ověřují základní vlastnosti navrhované metody. Keywords: Fault emulation Available at various institutes of the ASCR A Novel Emulation Technique that Preserves Circuit Structure and Timing

This paper presents an emulation technique that allows to preserve structure and optionally timing of an emulated circuit according to a target technology. The technique is compatible with fault ...

Kafka, Leoš
Ústav teorie informace a automatizace, 2007

O šířce projektů, aneb - proč vybrali Gagarina
Mareš, Milan
2007 - Czech Příspěvek shrnuje a zobecňuje zkušenosti se získáváním a managementem rozsáhlých projektů. The contribution presents and summerizes experience with acquisition and management of large projects. Keywords: Management of projects; Research centres Available at various institutes of the ASCR O šířce projektů, aneb - proč vybrali Gagarina

Příspěvek shrnuje a zobecňuje zkušenosti se získáváním a managementem rozsáhlých projektů.

Mareš, Milan
Ústav teorie informace a automatizace, 2007

An Effective Algorithm to Search Reductions in Compositional Models
Kratochvíl, Václav
2007 - English This paper deals with the problem of marginalization of multidimensional probability distributions represented by a compositional model. By the perfect one in this case. From the computational point of view this solution is more efficient than any known marginalization process for Bayesian models. This is because the process mentioned in the paper in a form of an algorithm and takes an advantage of the fact that the perfect sequence models have some information encoded; if can be obtained from the Bayesian networks by an application of rather computationally expensive procedures. One part of that algorithm is marginalization by means of reduction. This paper describe a new faster algorithm to find a reduction in a compositional model. Marginalizace multidimenzionálních distribucí reprezentovaných perfektními kompozicionálními modely je mnohem efektivnější než jakýkoli marginalizační proces v bayesovských sítích. Důvod je prostý. Marginalizační algoritmus, zmíněný v tomto článku, využívá informací zakódovaných ve struktuře kompozicionálních modelů, které se v bayseovských sítích musí složitě vypočítat. V tomto článku se zabýváme jednou podsekcí marginalizačního algoritmu - marginalizací redukcí. Je zde představen nový rychlejší způsob hledání redukcí v kompozicionálních modelech. Keywords: compositional model; marginalization; reduction Available at various institutes of the ASCR An Effective Algorithm to Search Reductions in Compositional Models

This paper deals with the problem of marginalization of multidimensional probability distributions represented by a compositional model. By the perfect one in this case. From the computational point ...

Kratochvíl, Václav
Ústav teorie informace a automatizace, 2007

Conditional Irrelevance Relation for Belief Functions: Examples
Jiroušek, Radim
2007 - English The paper presents an additional possibility how to define conditional independence relation for belief functions. The approach is based on the operator of composition originally designed for multidimensional model processing. Not to make confusion with the preceding definitions we call this relation conditional irrelevance. In the paper examples illustrating properties of this relation are presented. V článku je představen další způsob jak definovat relaci podmíněné nezávislosti ve věrohodnostních funkcích. Tento přístup je založen na operátoru, který byl na vrhnut původně pouze pro multidimenzionální modely, operátoru kompozice. Abychom předešli zmatkům s předchozími definicemi, nazýváme tento vztah podmíněnou irelevancí. Vlastnosti tohoto vztahu (relace) jsou ilustrovány množstvím příkladů. Keywords: belief function; conditional irrelevance; operator of composition Available at various institutes of the ASCR Conditional Irrelevance Relation for Belief Functions: Examples

The paper presents an additional possibility how to define conditional independence relation for belief functions. The approach is based on the operator of composition originally designed for ...

Jiroušek, Radim
Ústav teorie informace a automatizace, 2007