Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Experimental design" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Distributed scheduling of measurements in a sensor network for parameter estimation of spatio-temporal systems
    Autorzy:
    Patan, M.
    Kowalów, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/331122.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    sensor network
    distributed parameter system
    parameter estimation
    experimental design
    sensor scheduling
    sieć sensorowa
    układ o parametrach rozłożonych
    estymacja parametrów
    projekt eksperymentalny
    Opis:
    The main aim of the paper is to develop a distributed algorithm for optimal node activation in a sensor network whose measurements are used for parameter estimation of the underlying distributed parameter system. Given a fixed partition of the observation horizon into a finite number of consecutive intervals, the problem under consideration is to optimize the percentage of the total number of observations spent at given sensor nodes in such a way as to maximize the accuracy of system parameter estimates. To achieve this, the determinant of the Fisher information matrix related to the covariance matrix of the parameter estimates is used as the qualitative design criterion (the so-called D-optimality). The proposed approach converts the measurement scheduling problem to a convex optimization one, in which the sensor locations are given a priori and the aim is to determine the associated weights, which quantify the contributions of individual gaged sites to the total measurement plan. Then, adopting a pairwise communication scheme, a fully distributed procedure for calculating the percentage of observations spent at given sensor locations is developed, which is a major novelty here. Another significant contribution of this work consists in derivation of necessary and sufficient conditions for the optimality of solutions. As a result, a simple and effective computational scheme is obtained which can be implemented without resorting to sophisticated numerical software. The delineated approach is illustrated by simulation examples of a sensor network design for a two-dimensional convective diffusion process.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 1; 39-54
    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ł
    Tytuł:
    Configuring a sensor network for fault detection in distributed parameter systems
    Autorzy:
    Patan, M.
    Uciński, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/929887.pdf
    Data publikacji:
    2008
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    metoda podziału i ograniczeń
    ograniczony plan eksperymentu
    układ o parametrach rozłożonych
    detekcja uszkodzeń
    estymacja parametryczna
    rozmieszczanie czujników
    branch-and-bound
    constrained experimental design
    distributed parameter system
    fault detection
    parameter estimation
    sensor location
    Opis:
    The problem of fault detection in distributed parameter systems (DPSs) is formulated as that of maximizing the power of a parametric hypothesis test which checks whether or not system parameters have nominal values. A computational scheme is provided for the design of a network of observation locations in a spatial domain that are supposed to be used while detecting changes in the underlying parameters of a distributed parameter system. The setting considered relates to a situation where from among a finite set of potential sensor locations only a subset 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. Then, the solution of a resulting combinatorial problem is determined based on the branch-and-bound method. As its essential part, a relaxed problem is discussed in which the sensor locations are given a priori and the aim is to determine the associated weights, which quantify the contributions of individual gauged sites. The concavity and differentiability properties of the criterion are established and a gradient projection algorithm is proposed to perform the search for the optimal solution. The delineated approach is illustrated by a numerical example on a sensor network design for a two-dimensional convective diffusion process.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2008, 18, 4; 513-524
    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