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ę "optimum experimental design" wg kryterium: Temat


Wyświetlanie 1-4 z 4
Tytuł:
Construction of constrained experimental designs on finite spaces for a modified Ek-optimality criterion
Autorzy:
Uciński, Dariusz
Powiązania:
https://bibliotekanauki.pl/articles/1838172.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
constrained optimum experimental design
minimal sum of largest eigenvalues
generalized simplicial decomposition
optimal measurement selection
Opis:
A simple computational algorithm is proposed for minimizing sums of largest eigenvalues of the matrix inverse over the set of all convex combinations of a finite number of nonnegative definite matrices subject to additional box constraints on the weights of those combinations. Such problems arise when experimental designs aiming at minimizing sums of largest asymptotic variances of the least-squares estimators are sought and the design region consists of finitely many support points, subject to the additional constraints that the corresponding design weights are to remain within certain limits. The underlying idea is to apply the method of outer approximations for solving the associated convex semi-infinite programming problem, which reduces to solving a sequence of finite min-max problems. A key novelty here is that solutions to the latter are found using generalized simplicial decomposition, which is a recent extension of the classical simplicial decomposition to nondifferentiable optimization. Thereby, the dimensionality of the design problem is drastically reduced. The use of the algorithm is illustrated by an example involving optimal sensor node activation in a large sensor network collecting measurements for parameter estimation of a spatiotemporal process.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 4; 659-677
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal Selection of Measurement Locations for Parameter Estimation in Distributed Processes
Autorzy:
Uciński, D.
Powiązania:
https://bibliotekanauki.pl/articles/911191.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
czujnik lokacyjny
rozproszony system komputerowy
estymacja parametryczna
sensor location
distributed-parameter systems
parameter estimation
optimum experimental design
spatial statistics
Opis:
The problem of locating pointwise sensor measurements so as to optimally estimate unknown parameters in a class of distributed systems is studied. Based on a scalar measure of performance defined on the corresponding Fisher information matrix, two approaches are developed for this problem: introduction of continuous designs, which allows for adaptation of well-known sequential algorithms of classical optimum experimental design, and application of standard non-linear programming techniques. In each case, particular algorithms are delineated and analysis of the appropriate sensor placements is made. The relative advantages and shortcomings of both the approaches are discussed and demonstrated by applying them to a two-dimensional diffusion process.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 2; 357-379
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mobile sensor routing for parameter estimation of distributed systems using the parallel tunneling method
Autorzy:
Zięba, T.
Uciński, D.
Powiązania:
https://bibliotekanauki.pl/articles/907911.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć sensorowa
układ o parametrach rozłożonych
projekt optymalny
obliczanie równoległe
sensor network
distributed parameter system
optimum experimental design
tunneling algorithm
parallel computing
Opis:
The paper deals with the problem of optimal path planning for a sensor network with mutliple mobile nodes, whose measurements are supposed to be primarily used to estimate unknown parameters of a system modelled by a partial differential equation. The adopted framework permits to consider two- or three-dimensional spatial domains and correlated observations. Since the aim is to maximize the accuracy of the estimates, a general functional defined on the relevant Fisher information matrix is used as the design criterion. Central to the approach is the parameterization of the sensor trajectories based on cubic B-splines. The resulting finite-dimensional global optimization problem is then solved using a parallel version of the tunneling algorithm. A numerical example is included to clearly demonstrate the idea presented in the paper.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2008, 18, 3; 307-318
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Sensor network scheduling for identification of spatially distributed processes
Autorzy:
Uciński, D.
Powiązania:
https://bibliotekanauki.pl/articles/331382.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć sensorowa
estymacja parametrów
układ o parametrach rozłożonych
macierz informacyjna Fishera
sensor network
parameter estimation
distributed parameter system
optimum experimental design
Fisher information matrix
Opis:
The work treats the problem of fault detection for processes described by partial differential equations as that of maximizing the power of a parametric hypothesis test which checks whether or not system parameters have nominal values. A simple node activation strategy is discussed for the design of a sensor network deployed in a spatial domain that is supposed to be used while detecting changes in the underlying parameters which govern the process evolution. The setting considered relates to a situation where from among a finite set of potential sensor locations only a subset of them can be selected because of the cost constraints. As a suitable performance measure, the Ds-optimality criterion defined on the Fisher information matrix for the estimated parameters is applied. The problem is then formulated as the determination of the density of gauged sites so as to maximize the adopted design criterion, subject to inequality constraints incorporating a maximum allowable sensor density in a given spatial domain. The search for the optimal solution is performed using a simplicial decomposition algorithm. The use of the proposed approach is illustrated by a numerical example involving sensor selection for a two-dimensional diffusion process.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 1; 25-40
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    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