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ę "dopasowanie" wg kryterium: Temat


Wyświetlanie 1-6 z 6
Tytuł:
Fault diagnosis of a water for injection system using enhanced structural isolation
Autorzy:
Laursen, M.
Blanke, M.
Düştegör, D.
Powiązania:
https://bibliotekanauki.pl/articles/929918.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
analiza strukturalna
lokalizacja uszkodzeń
diagnostyka uszkodzeń
dopasowanie
structural analysis
fault isolation
fault diagnosis
matching
Opis:
A water for injection system supplies chilled sterile water as a solvent for pharmaceutical products. There are ultimate requirements for the quality of the sterile water, and the consequence of a fault in temperature or in flow control within the process may cause a loss of one or more batches of the production. Early diagnosis of faults is hence of considerable interest for this process. This study investigates the properties of multiple matchings with respect to isolability, and it suggests to explore the topologies of multiple use-modes for the process and to employ active techniques for fault isolation to enhance structural isolability of faults. The suggested methods are validated on a high-fidelity simulation of the process.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2008, 18, 4; 593-603
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simultaneous localization and mapping: A feature-based probabilistic approach
Autorzy:
Skrzypczyński, P.
Powiązania:
https://bibliotekanauki.pl/articles/929972.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
robot mobilny
lokalizacja równoczesna
dopasowanie właściwości
mobile robot
simultaneous localization and mapping
feature matching
Opis:
This article provides an introduction to Simultaneous Localization And Mapping (SLAM), with the focus on probabilistic SLAM utilizing a feature-based description of the environment. A probabilistic formulation of the SLAM problem is introduced, and a solution based on the Extended Kalman Filter (EKF-SLAM) is shown. Important issues of convergence, consistency, observability, data association and scaling in EKF-SLAM are discussed from both theoretical and practical points of view. Major extensions to the basic EKF-SLAM method and some recent advances in SLAM are also presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 4; 575-588
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A proximal-based algorithm for piecewise sparse approximation with application to scattered data fitting
Autorzy:
Zhong, Yijun
Li, Chongjun
Li, Zhong
Duan, Xiaojuan
Powiązania:
https://bibliotekanauki.pl/articles/2172132.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
piecewise sparse approximation
proximal gradient
scattered data fitting
aproksymacja rzadka
gradient proksymalny
dopasowanie danych
Opis:
In some applications, there are signals with a piecewise structure to be recovered. In this paper, we propose a piecewise sparse approximation model and a piecewise proximal gradient method (JPGA) which aim to approximate piecewise signals. We also make an analysis of the JPGA based on differential equations, which provides another perspective on the convergence rate of the JPGA. In addition, we show that the problem of sparse representation of the fitting surface to the given scattered data can be considered as a piecewise sparse approximation. Numerical experimental results show that the JPGA can not only effectively fit the surface, but also protect the piecewise sparsity of the representation coefficient.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2022, 32, 4; 671--682
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On parameter estimation in the bass model by nonlinear least squares fitting the adoption curve
Autorzy:
Marković, D.
Jukić, D.
Powiązania:
https://bibliotekanauki.pl/articles/331073.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
Bass model
least squares estimate
existence problem
data fitting
model Bassa
metoda najmniejszych kwadratów
estymacja
dopasowanie danych
Opis:
The Bass model is one of the most well-known and widely used first-purchase diffusion models in marketing research. Estimation of its parameters has been approached in the literature by various techniques. In this paper, we consider the parameter estimation approach for the Bass model based on nonlinear weighted least squares fitting of its derivative known as the adoption curve. We show that it is possible that the least squares estimate does not exist. As a main result, two theorems on the existence of the least squares estimate are obtained, as well as their generalization in the [...]. One of them gives necessary and sufficient conditions which guarantee the existence of the least squares estimate. Several illustrative numerical examples are given to support the theoretical work.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 1; 145-155
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Times series averaging and denoising from a probabilistic perspective on time-elastic kernels
Autorzy:
Marteau, Pierre-Francois
Powiązania:
https://bibliotekanauki.pl/articles/330311.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
time series averaging
time elastic kernel
dynamic time warping
hidden Markov model
szereg czasowy
dynamiczne dopasowanie czasu
ukryty model Markowa
Opis:
In the light of regularized dynamic time warping kernels, this paper re-considers the concept of a time elastic centroid for a set of time series. We derive a new algorithm based on a probabilistic interpretation of kernel alignment matrices. This algorithm expresses the averaging process in terms of stochastic alignment automata. It uses an iterative agglomerative heuristic method for averaging the aligned samples, while also averaging the times of their occurrence. By comparing classification accuracies for 45 heterogeneous time series data sets obtained by first nearest centroid/medoid classifiers, we show that (i) centroid-based approaches significantly outperform medoid-based ones, (ii) for the data sets considered, our algorithm, which combines averaging in the sample space and along the time axes, emerges as the most significantly robust model for time-elastic averaging with a promising noise reduction capability. We also demonstrate its benefit in an isolated gesture recognition experiment and its ability to significantly reduce the size of training instance sets. Finally, we highlight its denoising capability using demonstrative synthetic data. Specifically, we show that it is possible to retrieve, from few noisy instances, a signal whose components are scattered in a wide spectral band.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 2; 375-392
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A geometric approach to structural model matching by output feedback in linear impulsive systems
Autorzy:
Zattoni, E.
Powiązania:
https://bibliotekanauki.pl/articles/330301.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
linear impulsive system
hybrid system
model matching
disturbance decoupling
geometric approach
structural properties
układ liniowy impulsowy
układ hybrydowy
dopasowanie modelu
właściwości strukturalne
Opis:
This paper provides a complete characterization of solvability of the problem of structural model matching by output feedback in linear impulsive systems with nonuniformly spaced state jumps. Namely, given a linear impulsive plant and a linear impulsive model, both subject to sequences of state jumps which are assumed to be simultaneous and measurable, the problem consists in finding a linear impulsive compensator that achieves exact matching between the respective forced responses of the linear impulsive plant and of the linear impulsive model, by means of a dynamic feedback of the plant output, for all the admissible input functions and for all the admissible sequences of jump times. The solution of the stated problem is achieved by reducing it to an equivalent problem of structural disturbance decoupling by dynamic feedforward. Indeed, this latter problem is formulated for the so-called extended linear impulsive system, which consists of a suitable connection between the given plant and a modified model. A necessary and sufficient condition for the solution of the structural disturbance decoupling problem is first shown. The proof of sufficiency is constructive, since it is based on the synthesis of the compensator that solves the problem. The proof of necessity is based on the definition and the geometric properties of the unobservable subspace of a linear impulsive system subject to unequally spaced state jumps. Finally, the equivalence between the two structural problems is formally established and proven.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 1; 25-38
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    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