Number of found documents: 841
Published from to

Simulator of ADSL Physical Layer
Mazanec, Tomáš
2007 - English
This paper presents simulation results accomplished within ADSL toolbox, which was developed in our institute. The toolbox simulates physical layer of ADSL communication chain, where the main efforts are given to equalization techniques at receiver, proper channel partitioning at transmitter and channel modeling. Článek prezentuje další výsledky práce na ADSL toolboxu, simulačním prostředí, které jsme vyvinuli na našem pracovišti. Konkrétně se jedná o simulace vlivu konfigurace ADSL kanálu, kterou provádí tzv. bit-load algoritmy. V této souvislosti je uvedena metoda water-filling a její konkrétní realizace Rate-adaptive water-filling. Touto metodou dosažené výsledky jsou prezentovány a porovnány s referenčními metodami. Druhá část článku se věnuje popisu modelů ADSL kanálů, které toolbox využívá. Keywords: ADSL; bit-load; water-filling; ADSL channel Available at various institutes of the ASCR
Simulator of ADSL Physical Layer

This paper presents simulation results accomplished within ADSL toolbox, which was developed in our institute. The toolbox simulates physical layer of ADSL communication chain, where the main efforts ...

Mazanec, Tomáš
Ú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

Possibilistic Iterative Proportional Fitting Procedure revisited
Vejnarová, Jiřina
2007 - English
Iterative Proportional Fitting Procedure (parameterized by a continuous t-norm) for computation of multidimensional possibility distributions from its marginals designed in 2003, is discussed in more details. Special attention is paid to its application to possibilistic marginal problem. Prace detailnejiji studuje Iterativni proporcionalni fitujici proceduru (parametrizovanou spojitou t-normou) navrzenou v roce 2003. Zvlastni pozornost je venovana jejimu pouziti k reseni posibilistickeho marginalniho problemu. Keywords: Possibility theory; marginal problem; Iterative Proportional Fitting Procedure Available at various institutes of the ASCR
Possibilistic Iterative Proportional Fitting Procedure revisited

Iterative Proportional Fitting Procedure (parameterized by a continuous t-norm) for computation of multidimensional possibility distributions from its marginals designed in 2003, is discussed in more ...

Vejnarová, Jiřina
Ústav teorie informace a automatizace, 2007

Geographical Modelling
Klimešová, Dana
2007 - English
The contribution is devoted to the analytical GIS functions that are able to solve complex spatial problems, landscape elements planning alternatives and applications that require the integrated analysis of multiple geographically distributed factors being used in suitable logical sequence. Příspěvek je věnován analytickým funkcím GIS, které mohou ve vhodné posloupnosti řešit složité analytické úlohy se široce distribuovanými geografickými faktory. Keywords: verlay operations; connectivity functions; spread and network f; inter-visibility f Available at various institutes of the ASCR
Geographical Modelling

The contribution is devoted to the analytical GIS functions that are able to solve complex spatial problems, landscape elements planning alternatives and applications that require the integrated ...

Klimešová, Dana
Ústav teorie informace a automatizace, 2007

Performance Analysis of Extended EFICA Algorithm
Koldovský, Zbyněk; Málek, J.; Tichavský, Petr; Yannick, D.; Shahram, H.
2007 - English
This paper supports the document "Extension of EFICA Algorithm for Blind Separation of Piecewise Stationary Non Gaussian Sources." Tento clanek je doplnkem k clanku "Extension of EFICA Algorithm for Blind Separation of Piecewise Stationary Non Gaussian Sources." Keywords: Cramer-Rao Lower Bound; Independent Component Analysis; Blind Source Separation; EFICA Algorithm Available at various institutes of the ASCR
Performance Analysis of Extended EFICA Algorithm

This paper supports the document "Extension of EFICA Algorithm for Blind Separation of Piecewise Stationary Non Gaussian Sources."...

Koldovský, Zbyněk; Málek, J.; Tichavský, Petr; Yannick, D.; Shahram, H.
Ústav teorie informace a automatizace, 2007

Decision Making with Imperfect Knowledge Accumulation
Kárný, Miroslav
2007 - English
Formal basis of Bayesian decision making with non-expanding knowledge accumulation is proposed. Je navržen formální základ bayesovského rozhodování při nenarůstajícím rozsahu znalostí Keywords: Bayesian decision making; knowledge accumulation Available at various institutes of the ASCR
Decision Making with Imperfect Knowledge Accumulation

Formal basis of Bayesian decision making with non-expanding knowledge accumulation is proposed.


Je navržen formální základ bayesovského rozhodování při nenarůstajícím rozsahu znalostí

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

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

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