Number of found documents: 455
Published from to

FPGA-based fault simulator
Kafka, Leoš; Novák, O.
2006 - English
This paper describes a simulator based an this technique and show that partial dynamic reconfiguration is an effective way of falut injection. Error-detection-code based CED circuits are used in experiments; the results of the experiments are reported. Článek presentuje simulátor chyb založený na programovatelném logickém poli. Keywords: falut simulation; FPGA; reconfiguartion Available at various institutes of the ASCR
FPGA-based fault simulator

This paper describes a simulator based an this technique and show that partial dynamic reconfiguration is an effective way of falut injection. Error-detection-code based CED circuits are used in ...

Kafka, Leoš; Novák, O.
Ústav teorie informace a automatizace, 2006

Sensitivity of stochastic programs by means of the infimum functional
Lachout, Petr
2006 - English
Paper presents a study on sensitivity of stochastic programs. It is based on the infimum functional derivative, namely on its Hadamard derivative. The paper applies theoretical results on one- and two-stage stochastic programs. Článek představuje studii sensitivity stochastického programování. Je založen na derivaci functionalu infima, zejména na jeho Hadamardově derivaci. Teoretické výsledky jse aplikovány na jedno- a dvou-stupňové stochastické programování. Keywords: Sensitivity of stochastic program; Hadamard derivative; Two-stage stochastic program Available at various institutes of the ASCR
Sensitivity of stochastic programs by means of the infimum functional

Paper presents a study on sensitivity of stochastic programs. It is based on the infimum functional derivative, namely on its Hadamard derivative. The paper applies theoretical results on one- and ...

Lachout, Petr
Ústav teorie informace a automatizace, 2006

Optimality conditions for maximizers of the information divergence from an exponential family
Matúš, František
2006 - English
The information divergence of a probability measure P from an exponential family E over a finite set is defined as infimum of the divergences of P from Q subject to Q in E. All directional derivatives of the divergence from E are explicitly found. To this end, behaviour of the conjugate of a log-Laplace transform on the boundary of its domain is analysed. The first order conditions for P to be a maximizer of the divergence from E are presented, including new ones when P is not projectable to E. Informační divergence pravděpodobnostní míry P od exponenciální rodiny se definuje jako infimum divergencí P od Q v E. Byly spočteny směrové derivace této divergence pomocí nových výsledků o konjugaci log-Lapaceovy transformace. Byly formulovány nové nutné podmínky prvního řádu proto, aby P byla maximalizátorem této divergence Keywords: Kullback-Leibler divergence; relative entropy; exponential family; information projection; cumulant generating function; log-Laplace transform Available at various institutes of the ASCR
Optimality conditions for maximizers of the information divergence from an exponential family

The information divergence of a probability measure P from an exponential family E over a finite set is defined as infimum of the divergences of P from Q subject to Q in E. All directional derivatives ...

Matúš, František
Ústav teorie informace a automatizace, 2006

Classes of Gaussian, Discrete and Binary Representable Independence Models Have No Finite Characterization
Šimeček, Petr
2006 - English
The paper shows that there is no finite set of forbidden minors which characterizes classes of independence models that are representable by Gaussian, discrete and binary distributions, respectively. Keywords: conditional independence; independence models Available at various institutes of the ASCR
Classes of Gaussian, Discrete and Binary Representable Independence Models Have No Finite Characterization

The paper shows that there is no finite set of forbidden minors which characterizes classes of independence models that are representable by Gaussian, discrete and binary distributions, ...

Šimeček, Petr
Ústav teorie informace a automatizace, 2006

Independence Models
Šimeček, Petr
2006 - English
The paper inspects a possibility of construction of constraint–based learning algorithms based on the knowl- edge of representable independence models. V članku je zaveden pojem nezávislostního modelu a jeho reprezentace v různých distribučních rámcích. Dále je diskutována možnost výběr modelu na základě dat, především pro připad Gaussovsky reprezentovatelných modelů. Keywords: independence models Available at various institutes of the ASCR
Independence Models

The paper inspects a possibility of construction of constraint–based learning algorithms based on the knowl- edge of representable independence models....

Šimeček, Petr
Ústav teorie informace a automatizace, 2006

Comparison of approximations in stochastic and robust optimization programs
Houda, Michal
2006 - English
The paper deals with two wide areas of optimization theory: stochastic and robust programming. We specialize to different approaches when solving an optimization problem where some uncertainties in constraints occur. To overcome uncertainty, we can request the solution to be feasible to all but a small part of constraints. Both approaches gives us different methods to deal with this requirement. We try to find fundamental differencies between them and illustrate the differencies on a simple numerical example. Článek se zabývá dvěma rozsáhlými oblastmi teorie optimalizace: stochastickým a robustním programováním. Specializuje se na dva různé přístupy v případě řešení optimalizačních úloh, ve kterých se vyskytuje náhodný prvek v omezeních. Jako způsob obejití tohoto problému je možné hledat řešení, které je přípustné pro téměř všechna omezení až na malou část. Oba přístupy nabízí odlišné metody zabývající se tímto požadavkem. Ve článku se snažíme nalézt základní rozdíly mezi oběma přístupy a ilustrovat tyto rozdíly na jednoduchém numerickém příkladě. Keywords: chance-constrained programming; robust programming; approximations; sampling method Available at various institutes of the ASCR
Comparison of approximations in stochastic and robust optimization programs

The paper deals with two wide areas of optimization theory: stochastic and robust programming. We specialize to different approaches when solving an optimization problem where some uncertainties in ...

Houda, Michal
Ústav teorie informace a automatizace, 2006

Bayesian approach to change point detection of unemployment rate via MCMC methods
Reisnerová, Soňa
2006 - English
The time series of numbers of new unemployed is analyzed and modeled as a series of Poisson counts. Its intensity parameter is assumed to have a linear shape with a possible jump and trend change. The change is detected with the Markov chain Monte Carlo procedure. An application to Czech Republic data 1998-2003 is presented. Přírůstky počtu nezaměstnaných jsou modelovány jako časová řada Poissonových náhodných veličin, jejichž intensita má linearní trend s možnou změnou i skokem. Tato změna je detekována pomocí MCMC prodcedury, metoda je použita na analýzu dat z ČR z let 1998-2003. Keywords: Change point; unemployment rate; MCMC; poisson model Available at various institutes of the ASCR
Bayesian approach to change point detection of unemployment rate via MCMC methods

The time series of numbers of new unemployed is analyzed and modeled as a series of Poisson counts. Its intensity parameter is assumed to have a linear shape with a possible jump and trend change. The ...

Reisnerová, Soňa
Ústav teorie informace a automatizace, 2006

Bilateral degree control based solution of a polynomial eguation
Kraffer, Ferdinand
2006 - English
By feedback control consideartions of a good choice of the closed-loop characteristic polynomial matrix, the purpose of this contribution is to promote awareness of row-column reduced polynomial matrices, in constant to eligible but less advisable classes of polynomial matrices such as the monically diagonally degree-dominant matrices and the simultaneously row- and column reduced matrices. Dle úvah dobré volby zpětnovazební charakteristické polynomiální matice je účelem tohoto příspěvku šíření povědomí o řádkově-sloupcově redukovaných polynomiálních maticích v kontrastu s vhodnými ale méně doporučitelnými třídami matic jako jsou monicky diagonálně stupňově dominantní nebo současně řádkově a sloupcově redukované matice. Keywords: row-column reduced polynomial matrices Available at various institutes of the ASCR
Bilateral degree control based solution of a polynomial eguation

By feedback control consideartions of a good choice of the closed-loop characteristic polynomial matrix, the purpose of this contribution is to promote awareness of row-column reduced polynomial ...

Kraffer, Ferdinand
Ústav teorie informace a automatizace, 2006

Introduction to Statistical Pattern Recognition
Pudil, Pavel; Somol, Petr; Haindl, Michal
2006 - English
Pattern recognition problem is briefly characterized as a process of machine learning. Its main stages (dimensionality reduction and classifier design) are stated. Statistical approach is given priority here. Two approaches to dimensionality reduction, namely feature selection (FS) and feature extraction (FE) are specified. Though FS is a special case of FE, they are very different from a practical viewpoint and thus must be considered separately. Problém rozpoznávání je stručně charakterizován jako proces strojového učení. Jeho hlavní etapy (redukce dimenzionality, návrh klasifikátoru) jsou definovány. Prioritou článku je statistický přístup. Dva přístupy k redukci dimenzionality - výběr příznaků (FS) a extrakce příznaků (FE) jsou zmíněny. Přestože je FS speciálním případem FE, tyto přístupy se velmi liší z praktického pohledu a proto musí studovány odděleně. Keywords: Pattern Recognition Available at various institutes of the ASCR
Introduction to Statistical Pattern Recognition

Pattern recognition problem is briefly characterized as a process of machine learning. Its main stages (dimensionality reduction and classifier design) are stated. Statistical approach is given ...

Pudil, Pavel; Somol, Petr; Haindl, Michal
Ústav teorie informace a automatizace, 2006

Design and Realization of Experimental Robotic Walking Platform
Zikmund, J.; Čelikovský, Sergej
2006 - English
This project was interested in design of an experimental device for study of a robotics walking. The aim was development and solution the simple benchmark model for an experimental part of work in this research area, with respect to be applicable for a research work and system and control education as well. Prezentace výsledků projektu zabívajícího se vztvořením jednoduchého laboratorního modelu vhodného pro studium robotického kráčení. Bylo navrženo a setrojeno konstrukčně jednoduché modulární experimentální zářízení pro ověřování teoretických výsledků z danné oblasti. Jedná se o dvounohý planární kráčející mechanismus s pěti stupni volnosti. Keywords: Nonlinear system; walking robot Available at various institutes of the ASCR
Design and Realization of Experimental Robotic Walking Platform

This project was interested in design of an experimental device for study of a robotics walking. The aim was development and solution the simple benchmark model for an experimental part of work in ...

Zikmund, J.; Čelikovský, Sergej
Ústav teorie informace a automatizace, 2006

About project

NRGL provides central access to information on grey literature produced in the Czech Republic in the fields of science, research and education. You can find more information about grey literature and NRGL at service web

Send your suggestions and comments to nusl@techlib.cz

Provider

http://www.techlib.cz

Facebook

Other bases