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ę "Uciński, D." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    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ł
    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ł:
    Sensor network design for the estimation of spatially distributed processes
    Autorzy:
    Uciński, D.
    Patan, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/929585.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    projekt optymalny
    estymacja parametrów
    sieć sensorowa
    identyfikacja źródłowa
    optimal experiment design
    parameter estimation
    sensor network
    source identification
    Opis:
    In a typical moving contaminating source identification problem, after some type of biological or chemical contamination has occurred, there is a developing cloud of dangerous or toxic material. In order to detect and localize the contamination source, a sensor network can be used. Up to now, however, approaches aiming at guaranteeing a dense region coverage or satisfactory network connectivity have dominated this line of research and abstracted away from the mathematical description of the physical processes underlying the observed phenomena. The present work aims at bridging this gap and meeting the needs created in the context of the source identification problem. We assume that the paths of the moving sources are unknown, but they are sufficiently smooth to be approximated by combinations of given basis functions. This parametrization makes it possible to reduce the source detection and estimation problem to that of parameter identification. In order to estimate the source and medium parameters, the maximum--ikelihood estimator is used. Based on a scalar measure of performance defined on the Fisher information matrix related to the unknown parameters, which is commonly used in optimum experimental design theory, the problem is formulated as an optimal control one. From a practical point of view, it is desirable to have the computations dynamic data driven, i.e., the current measurements from the mobile sensors must serve as a basis for the update of parameter estimates and these, in turn, can be used to correct the sensor movements. In the proposed research, an attempt will also be made at applying a nonlinear model-predictive-control-like approach to attack this issue.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 3; 459-481
    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ł:
    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ł
      Wyświetlanie 1-5 z 5

      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