Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "filter approach" wg kryterium: Temat


Wyświetlanie 1-10 z 10
Tytuł:
A modified filter SQP method as a tool for optimal control of nonlinear systems with spatio-temporal dynamics
Autorzy:
Rafajłowicz, E.
Styczeń, K.
Rafajłowicz, W.
Powiązania:
https://bibliotekanauki.pl/articles/331421.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
programowanie nieliniowe
sterowanie optymalne
równanie różniczkowe cząstkowe
filter approach
nonlinear programming
optimal control
partial differential equations
Opis:
Our aim is to adapt Fletcher's filter approach to solve optimal control problems for systems described by nonlinear Partial Differential Equations (PDEs) with state constraints. To this end, we propose a number of modifications of the filter approach, which are well suited for our purposes. Then, we discuss possible ways of cooperation between the filter method and a PDE solver, and one of them is selected and tested.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 2; 313-326
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nonlinear multiple model particle filters algorithm for tracking multiple targets
Autorzy:
Sebbagh, A.
Tebbikh, H.
Powiązania:
https://bibliotekanauki.pl/articles/229441.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
estimation
particle filter
multiple targets tracking
multiple model approach
Opis:
The paper addresses multiple targets tracking problem encountered in number of situations in signal and image processing. In this paper, we present an efficient filtering algorithm to perform accurate estimation in jump Markov nonlinear systems, which we aim to contribute in solving the problem of multiple targets tracking using bearings-only measurements. The idea of this algorithm consists of the combination between the multiple model approach and particle filtering methods, which give a nonlinear multiple model particle filters algorithm. This algorithm is used to estimate the trajectories of multiple targets assumed to be nonlinear, from their noisy bearings.
Źródło:
Archives of Control Sciences; 2011, 21, 1; 37-60
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zum Einfluss affektiver Faktoren auf den frühen Fremdsprachenerwerb im Elementarbereich durch den narrativen Ansatz
Autorzy:
Jakosz, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/913260.pdf
Data publikacji:
2018-09-10
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
storytelling approach
emotions
motivation
early school education
language input
stories
affective filter
Opis:
The article presents the impact of emotions on teaching children foreign languages. To this end, the results of a research project carried out under the auspices of the Institute of German Philology at the University of Silesia in Katowice are discussed. The project consisted in providing language courses at three kindergartens and one primary school. During those courses, German was taught as a foreign language using the storytelling approach. The project results led to the conclusion that, unlike traditional teaching methods, which are based on very limited input and intensive imitation, the teaching method used creates much more favourable conditions for the activation of innate language acquiring processes and takes the level of the children’s cognitive development into account to a larger degree. The objectives of the evaluation were – among other things – to determine how the storytelling approach affects children’s attitudes to a foreign language, whether it arouses their internal motivation for acquiring a foreign language, whether it contributes to building their confidence, and whether it stimulates their imagination and creativity.
Źródło:
Glottodidactica. An International Journal of Applied Linguistics; 2018, 45, 1; 51-68
0072-4769
Pojawia się w:
Glottodidactica. An International Journal of Applied Linguistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nonlinear diagnostic filter design: Algebraic and geometric points of view
Autorzy:
Shumsky, A.
Zhirabok, A.
Powiązania:
https://bibliotekanauki.pl/articles/908458.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
filtr diagnostyczny
system nieliniowy
podejście geometryczne
detekcja uszkodzeń
lokalizacja uszkodzeń
diagnostic filter
nonlinear systems
geometric approach
algebraic approach
fault detection
fault isolation
Opis:
The problem of diagnostic filter design is studied. Algebraic and geometric approaches to solving this problem are investigated. Some relations between these approaches are established. New definitions of fault detectability and isolability are formulated. On the basis of these definitions, a procedure for diagnostic filter design is given in both algebraic and geometric terms.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 1; 115-127
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Active fault tolerant control of nonlinear systems: the cart-pole example
Autorzy:
Bonfe, M.
Castaldi, P.
Mimmo, N.
Simani, S.
Powiązania:
https://bibliotekanauki.pl/articles/907604.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
detekcja uszkodzeń
lokalizacja uszkodzeń
filtracja nieliniowa
sterowanie tolerujące uszkodzenia
fault detection
fault isolation
nonlinear filter
nonlinear geometric approach
fault tolerant control
cart pole nonlinear model
Opis:
This paper describes the design of fault diagnosis and active fault tolerant control schemes that can be developed for nonlinear systems. The methodology is based on a fault detection and diagnosis procedure relying on adaptive filters designed via the nonlinear geometric approach, which allows obtaining the disturbance de-coupling property. The controller reconfiguration exploits directly the on-line estimate of the fault signal. The classical model of an inverted pendulum on a cart is considered as an application example, in order to highlight the complete design procedure, including the mathematical aspects of the nonlinear disturbance de-coupling method based on the nonlinear differential geometry, as well as the feasibility and efficiency of the proposed approach. Extensive simulations of the benchmark process and Monte Carlo analysis are practical tools for assessing experimentally the robustness and stability properties of the developed fault tolerant control scheme, in the presence of modelling and measurement errors. The fault tolerant control method is also compared with a different approach relying on sliding mode control, in order to evaluate benefits and drawbacks of both techniques. This comparison highlights that the proposed design methodology can constitute a reliable and robust approach for application to real nonlinear processes.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 3; 441-455
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Execution time prediction model for parallel GPU realizations of discrete transforms computation algorithms
Autorzy:
Puchala, Dariusz
Stokfiszewski, Kamil
Wieloch, Kamil
Powiązania:
https://bibliotekanauki.pl/articles/2173530.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
graphics processing unit
GPU
execution time prediction model
discrete wavelet transform
DWT
lattice structure
convolution-based approach
orthogonal transform
orthogonal filter banks
time effectiveness
prediction accuracy
Opis:
Parallel realizations of discrete transforms (DTs) computation algorithms (DTCAs) performed on graphics processing units (GPUs) play a significant role in many modern data processing methods utilized in numerous areas of human activity. In this paper the authors propose a novel execution time prediction model, which allows for accurate and rapid estimation of execution times of various kinds of structurally different DTCAs performed on GPUs of distinct architectures, without the necessity of conducting the actual experiments on physical hardware. The model can serve as a guide for the system analyst in making the optimal choice of the GPU hardware solution for a given computational task involving particular DT calculation, or can help in choosing the best appropriate parallel implementation of the selected DT, given the limitations imposed by available hardware. Restricting the model to exhaustively adhere only to the key common features of DTCAs enables the authors to significantly simplify its structure, leading consequently to its design as a hybrid, analytically–simulational method, exploiting jointly the main advantages of both of the mentioned techniques, namely: time-effectiveness and high prediction accuracy, while, at the same time, causing mutual elimination of the major weaknesses of both of the specified approaches within the proposed solution. The model is validated experimentally on two structurally different parallel methods of discrete wavelet transform (DWT) computation, i.e. the direct convolutionbased and lattice structure-based schemes, by comparing its prediction results with the actual measurements taken for 6 different graphics cards, representing a fairly broad spectrum of GPUs compute architectures. Experimental results reveal the overall average execution time and prediction accuracy of the model to be at a level of 97.2%, with global maximum prediction error of 14.5%, recorded throughout all the conducted experiments, maintaining at the same time high average evaluation speed of 3.5 ms for single simulation duration. The results facilitate inferring the model generality and possibility of extrapolation to other DTCAs and different GPU architectures, which along with the proposed model straightforwardness, time-effectiveness and ease of practical application, makes it, in the authors’ opinion, a very interesting alternative to the related existing solutions.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 1; e139393, 1--30
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Filtr eksplanacyjny: wykrywanie inteligentnego projektu na gruncie nauk przyrodniczych
Explanatory Filter: Detecting Intelligent Design in the Natural Sciences
Autorzy:
Sagan, Dariusz
Powiązania:
https://bibliotekanauki.pl/articles/2013053.pdf
Data publikacji:
2009
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II. Towarzystwo Naukowe KUL
Tematy:
filtr eksplanacyjny
wyspecyfikowana złożoność
specyfikacja
konieczność
przypadek
projekt
wnioskowanie o projekcie
eliminacyjne podejście do testowania hipotez
porównawcze podejście do testowania hipotez
William Dembski
explanatory filter
specified complexity
specification
necessity
chance
design
design inference
eliminative approach to hypotheses testing
comparative approach to hypotheses testing
Opis:
The main purpose of this paper is to present the concept of explanatory filter as developed by William Dembski, a proponent of intelligent design theory. The explanatory filter is intended as a tool for detecting design, i.e. for discriminating between the results of intelligent and unintelligent activity, in case when the underlying causal history is unknown. Dembski claims that the explanatory filter as a method of design detection is already widely used in various branches of knowledge, although in a pre-theoretic form. His goal is to give the filter a rigorous theoretical shape, as well as to apply it to natural sciences such as cosmology or biology. After outlining the foundations of Dembski’s proposal, various objections to the concept of explanatory filter will be analyzed.
Źródło:
Roczniki Filozoficzne; 2009, 57, 1; 157-193
0035-7685
Pojawia się w:
Roczniki Filozoficzne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Execution time prediction model for parallel GPU realizations of discrete transforms computation algorithms
Autorzy:
Puchala, Dariusz
Stokfiszewski, Kamil
Wieloch, Kamil
Powiązania:
https://bibliotekanauki.pl/articles/2173636.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
graphics processing unit
GPU
execution time prediction model
discrete wavelet transform
DWT
lattice structure
convolution-based approach
orthogonal transform
orthogonal filter banks
time effectiveness
prediction accuracy
procesor graficzny
model przewidywania czasu wykonania
dyskretna transformata falkowa
struktura sieciowa
podejście oparte na splotach
przekształcenia ortogonalne
ortogonalne banki filtrów
efektywność czasowa
dokładność przewidywania
Opis:
Parallel realizations of discrete transforms (DTs) computation algorithms (DTCAs) performed on graphics processing units (GPUs) play a significant role in many modern data processing methods utilized in numerous areas of human activity. In this paper the authors propose a novel execution time prediction model, which allows for accurate and rapid estimation of execution times of various kinds of structurally different DTCAs performed on GPUs of distinct architectures, without the necessity of conducting the actual experiments on physical hardware. The model can serve as a guide for the system analyst in making the optimal choice of the GPU hardware solution for a given computational task involving particular DT calculation, or can help in choosing the best appropriate parallel implementation of the selected DT, given the limitations imposed by available hardware. Restricting the model to exhaustively adhere only to the key common features of DTCAs enables the authors to significantly simplify its structure, leading consequently to its design as a hybrid, analytically–simulational method, exploiting jointly the main advantages of both of the mentioned techniques, namely: time-effectiveness and high prediction accuracy, while, at the same time, causing mutual elimination of the major weaknesses of both of the specified approaches within the proposed solution. The model is validated experimentally on two structurally different parallel methods of discrete wavelet transform (DWT) computation, i.e. the direct convolutionbased and lattice structure-based schemes, by comparing its prediction results with the actual measurements taken for 6 different graphics cards, representing a fairly broad spectrum of GPUs compute architectures. Experimental results reveal the overall average execution time and prediction accuracy of the model to be at a level of 97.2%, with global maximum prediction error of 14.5%, recorded throughout all the conducted experiments, maintaining at the same time high average evaluation speed of 3.5 ms for single simulation duration. The results facilitate inferring the model generality and possibility of extrapolation to other DTCAs and different GPU architectures, which along with the proposed model straightforwardness, time-effectiveness and ease of practical application, makes it, in the authors’ opinion, a very interesting alternative to the related existing solutions.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 1; art. no. e139393
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Execution time prediction model for parallel GPU realizations of discrete transforms computation algorithms
Autorzy:
Puchala, Dariusz
Stokfiszewski, Kamil
Wieloch, Kamil
Powiązania:
https://bibliotekanauki.pl/articles/2173537.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
graphics processing unit
GPU
execution time prediction model
discrete wavelet transform
DWT
lattice structure
convolution-based approach
orthogonal transform
orthogonal filter banks
time effectiveness
prediction accuracy
procesor graficzny
model przewidywania czasu wykonania
dyskretna transformata falkowa
struktura sieciowa
podejście oparte na splotach
przekształcenia ortogonalne
ortogonalne banki filtrów
efektywność czasowa
dokładność przewidywania
Opis:
Parallel realizations of discrete transforms (DTs) computation algorithms (DTCAs) performed on graphics processing units (GPUs) play a significant role in many modern data processing methods utilized in numerous areas of human activity. In this paper the authors propose a novel execution time prediction model, which allows for accurate and rapid estimation of execution times of various kinds of structurally different DTCAs performed on GPUs of distinct architectures, without the necessity of conducting the actual experiments on physical hardware. The model can serve as a guide for the system analyst in making the optimal choice of the GPU hardware solution for a given computational task involving particular DT calculation, or can help in choosing the best appropriate parallel implementation of the selected DT, given the limitations imposed by available hardware. Restricting the model to exhaustively adhere only to the key common features of DTCAs enables the authors to significantly simplify its structure, leading consequently to its design as a hybrid, analytically–simulational method, exploiting jointly the main advantages of both of the mentioned techniques, namely: time-effectiveness and high prediction accuracy, while, at the same time, causing mutual elimination of the major weaknesses of both of the specified approaches within the proposed solution. The model is validated experimentally on two structurally different parallel methods of discrete wavelet transform (DWT) computation, i.e. the direct convolutionbased and lattice structure-based schemes, by comparing its prediction results with the actual measurements taken for 6 different graphics cards, representing a fairly broad spectrum of GPUs compute architectures. Experimental results reveal the overall average execution time and prediction accuracy of the model to be at a level of 97.2%, with global maximum prediction error of 14.5%, recorded throughout all the conducted experiments, maintaining at the same time high average evaluation speed of 3.5 ms for single simulation duration. The results facilitate inferring the model generality and possibility of extrapolation to other DTCAs and different GPU architectures, which along with the proposed model straightforwardness, time-effectiveness and ease of practical application, makes it, in the authors’ opinion, a very interesting alternative to the related existing solutions.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 1; e139393, 1--30
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Execution time prediction model for parallel GPU realizations of discrete transforms computation algorithms
Autorzy:
Puchala, Dariusz
Stokfiszewski, Kamil
Wieloch, Kamil
Powiązania:
https://bibliotekanauki.pl/articles/2173635.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
graphics processing unit
GPU
execution time prediction model
discrete wavelet transform
DWT
lattice structure
convolution-based approach
orthogonal transform
orthogonal filter banks
time effectiveness
prediction accuracy
procesor graficzny
model przewidywania czasu wykonania
dyskretna transformata falkowa
struktura sieciowa
podejście oparte na splotach
przekształcenia ortogonalne
ortogonalne banki filtrów
efektywność czasowa
dokładność przewidywania
Opis:
Parallel realizations of discrete transforms (DTs) computation algorithms (DTCAs) performed on graphics processing units (GPUs) play a significant role in many modern data processing methods utilized in numerous areas of human activity. In this paper the authors propose a novel execution time prediction model, which allows for accurate and rapid estimation of execution times of various kinds of structurally different DTCAs performed on GPUs of distinct architectures, without the necessity of conducting the actual experiments on physical hardware. The model can serve as a guide for the system analyst in making the optimal choice of the GPU hardware solution for a given computational task involving particular DT calculation, or can help in choosing the best appropriate parallel implementation of the selected DT, given the limitations imposed by available hardware. Restricting the model to exhaustively adhere only to the key common features of DTCAs enables the authors to significantly simplify its structure, leading consequently to its design as a hybrid, analytically–simulational method, exploiting jointly the main advantages of both of the mentioned techniques, namely: time-effectiveness and high prediction accuracy, while, at the same time, causing mutual elimination of the major weaknesses of both of the specified approaches within the proposed solution. The model is validated experimentally on two structurally different parallel methods of discrete wavelet transform (DWT) computation, i.e. the direct convolutionbased and lattice structure-based schemes, by comparing its prediction results with the actual measurements taken for 6 different graphics cards, representing a fairly broad spectrum of GPUs compute architectures. Experimental results reveal the overall average execution time and prediction accuracy of the model to be at a level of 97.2%, with global maximum prediction error of 14.5%, recorded throughout all the conducted experiments, maintaining at the same time high average evaluation speed of 3.5 ms for single simulation duration. The results facilitate inferring the model generality and possibility of extrapolation to other DTCAs and different GPU architectures, which along with the proposed model straightforwardness, time-effectiveness and ease of practical application, makes it, in the authors’ opinion, a very interesting alternative to the related existing solutions.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 1; art. no. e139393
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-10 z 10

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies