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ę "Byrski, J." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-9 z 9
    Tytuł:
    The role of parameter constraints in EE and OE methods for optimal identification of continuous LTI models
    Autorzy:
    Byrski, W.
    Byrski, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/331405.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    system ciągły
    funkcja przenoszenia
    metoda najmniejszych kwadratów
    continuous systems
    parameter constraints in identification
    modulating functions
    transfer function normalization
    least squares method
    Opis:
    The paper presents two methods used for the identification of Continuous-time Linear Time Invariant (CLTI) systems. In both methods the idea of using modulating functions and a convolution filter is exploited. It enables the proper transformation of a differential equation to an algebraic equation with the same parameters. Possible different normalizations of the model are strictly connected with different parameter constraints which have to be assumed for the nontrivial solution of the optimal identification problem. Different parameter constraints result in different quality of identification. A thorough discussion on the role of parameter constraints in the optimality of system identification is included. For time continuous systems, the Equation Error Method (EEM) is compared with the continuous version of the Output Error Method (OEM), which appears as a special sub-case of the EEM.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2012, 22, 2; 379-388
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    State estimators and observers for continuous and discrete linear systems. Part 1. Differential asymptotic state estimators
    Autorzy:
    Byrski, J.
    Byrski, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/93134.pdf
    Data publikacji:
    2018
    Wydawca:
    Państwowa Wyższa Szkoła Zawodowa w Tarnowie
    Tematy:
    linear estimator
    Kalman filter
    Luenberger observer
    exact state observer
    linear system
    estymator liniowy
    filtr Kalmana
    obserwator Luenbergera
    dokładny obserwator stanu
    system liniowy
    Opis:
    In the paper an overview of state estimators and state observers used in linear systems, will be presented. The state estimators and observers can be used in many applications like the state reconstruction for the control purposes or for the diagnosis and fault detection in technical processes or for the virtual measurements of inaccessible variables of the system as well as for the best filtration of the differential equation solution. As the standard most commonly the Kalman filter and Luenberger type observers are used. Although the Kalman filter guarantees optimal filtering quality of the state, reconstructed from the noisy measurements, both Kalman filter and the Luenberger observer guarantee only asymptotic quality of the real state changes and tracking, basing on the current measurements of the system output and input signals. Unfortunately, the value of the estimation error at any moment of time cannot be calculated. The discussion on differences between continuous and two types of discrete Kalman Filter will be presented. This paper is planned to be the introduction to presentation of another type of the state observers which have the structure given by the integral operators. Based on measurements of the system output and input signals on some predefined finite time interval, they can reconstruct, after this interval, the observed state exactly.
    Źródło:
    Science, Technology and Innovation; 2018, 3, 2; 62-68
    2544-9125
    Pojawia się w:
    Science, Technology and Innovation
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A double window state observer for detection and isolation of abrupt changes in parameters
    Autorzy:
    Byrski, J.
    Byrski, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/330142.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    fault detection
    fault isolation
    exact state observer
    parameter abrupt changes
    derivative reconstruction
    linear continuous system
    detekcja uszkodzeń
    lokalizacja uszkodzeń
    dokładny obserwator stanu
    układ ciągły liniowy
    Opis:
    The paper presents a new method for diagnosis of a process fault which takes the form of an abrupt change in some real parameter of a time-continuous linear system. The abrupt fault in the process real parameter is reflected in step changes in many parameters of the input/output model as well as in step changes in canonical state variables of the system. Detection of these state changes will enable localization of the faulty parameter in the system. For detecting state changes, a special type of exact state observer will be used. The canonical state will be represented by the derivatives of the measured output signal. Hence the exact state observer will play the role of virtual sensors for reconstruction of the derivatives of the output signal. For designing the exact state observer, the model parameters before and after the moment of fault occurrence must be known. To this end, a special identification method with modulating functions will be used. A novel concept presented in this paper concerns the structure of the observer. It will take the form of a double moving window observer which consists of two signal processing windows, each of width T . These windows are coupled to each other with a common edge. The right-hand side edge of the left-side moving window in the interval [t − 2T, t − T ] is connected to the left-hand side edge of the right-side window which operates in the interval [t − T, t]. The double observer uses different measurements of input/output signals in both the windows, and for each current time t simultaneously reconstructs two values of the state—the final value of the state in the left-side window zT (t − T ) and the initial value of the state z0(t − T ) in the right-side window. If the process parameters are constant, the values of both the states on the common joint edge are the same. If an abrupt change (fault) in some parameter at the moment tA = t − T occurs in the system, then step changes in some variables of the canonical state vector will also occur and the difference between the states will be detected. This will enable localization of the faulty parameter in the system.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 585-602
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Component-Based Architecture for Systems, Services and Data Integration in Support for Criminal Analysis
    Autorzy:
    Dajda, J.
    Dębski, R.
    Byrski, A.
    Kisiel-Dorohinicki, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/308469.pdf
    Data publikacji:
    2012
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    criminal analysis
    component-based systems
    software integration
    Opis:
    Criminal analysis processes is based on heterogeneous data processing. To support it, analysts utilize a large set of specialized tools, however they are usually designed to solve a particular problem are often incompatible with other existing tools and systems. Therefore, to fully leverage the existing supporting tools, their technological integration is required. In this paper we present original approach for integrating systems based on the component-driven paradigm. Firstly, a problem of supporting criminal analysis is described with a strong emphasis on the heterogeneity issues. Secondly, some theoretical information about integration is depicted followed by the details of the proposed architecture. Finally, the technological assumptions are discussed and prototype integration based on proposed concept is overviewed. om the experiments are discussed in the final part of the paper.
    Źródło:
    Journal of Telecommunications and Information Technology; 2012, 1; 67-73
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Collectively intelligent prediction in evolutionary multi-agent system
    Autorzy:
    Kijak, J.
    Martyna, P.
    Byrski, A.
    Faber, Ł.
    Piętak, K.
    Kisiel-Dorohinicki, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/397728.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Łódzka. Wydział Mikroelektroniki i Informatyki
    Tematy:
    evolutionary neural networks
    agent-based computing
    time series prediction
    collective intelligence
    metaheuristic optimization
    ewolucyjne sieci neuronowe
    obliczenia agentowe
    predykcja szeregów czasowych
    inteligencja zbiorowa
    optymalizacja metaheurystyczna
    Opis:
    In the paper a summary of our previously realized and published work connected with constructing collective intelligent evolutionary multi-agent systems for time series prediction, based on multi-layered perceptrons is shown. Besides recalling our past papers, we describe the whole concept, present an implementation in a contemporary, componentoriented software framework AgE 3.0 and we conduct a number of experiments, finding different optimal parametrization for the considered instances of the problems (popular Mackey-Glass chaotic time series). The paper may be useful for a practitioner willing to use our meatheuristic algorithm (EMAS) along with the idea of collective agent-based system in order to realize prediction tasks.
    Źródło:
    International Journal of Microelectronics and Computer Science; 2017, 8, 3; 85-96
    2080-8755
    2353-9607
    Pojawia się w:
    International Journal of Microelectronics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Model for dynamic and hierarchical data repository in relational database
    Autorzy:
    Piech, M.
    Fracz, W.
    Turek, W.
    Kisiel-Dorohinicki, M.
    Dajda, J.
    Byrski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/305565.pdf
    Data publikacji:
    2018
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    JSON
    relational databases
    EAV
    CQRS
    PostgreSQL
    open schema model
    Opis:
    The aim of this research is to build an open schema model for a digital sources repository in a relational database. This required us to develop a few advanced techniques. One of them was to keep and maintain a hierarchical data structure pushed into the repository. A second was to create constraints on any hierarchical level that allows for the enforcement of data integrity and consistency. The created solution is mainly based on a JSON file as a native column type, which was designed for holding open schema documents. In this paper, we present a model for any repository that uses hierarchical dynamic data. Additionally, we include a structure for normalizing the input and description for the data in order to keep all of the model assumptions. We compared our solution with a well-known open schema model – Entity-Attribute-Value – in the scope of saving data and querying about relationships and contents from the structure. The results show that we achieved improvements in both the performance and disk space usage, as we extended our model with a few new features that the previous model does not include. The techniques developed in this research can be applied in every domain where hierarchical dynamic data is required, as demonstrated by the digital book repository that we have presented.
    Źródło:
    Computer Science; 2018, 19 (4); 479-500
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Parallel patterns for agent-based evolutionary computing
    Autorzy:
    Stypka, J.
    Anielski, P.
    Mentel, S.
    Krzywicki, D.
    Turek, W.
    Byrski, A.
    Kisiel-Dorohinicki, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/305684.pdf
    Data publikacji:
    2016
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    agent-based computing
    functional programming
    parallel pattern
    Opis:
    Computing applications such as metaheuristics-based optimization can greatly benefit from multi-core architectures available on modern supercomputers. In this paper, we describe an easy and efficient way to implement certain population-based algorithms (in the discussed case, multi-agent computing system) on such runtime environments. Our solution is based on an Erlang software library which implements dedicated parallel patterns. We provide technological details on our approach and discuss experimental results.
    Źródło:
    Computer Science; 2016, 17 (1); 83-98
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Emergence of population structure in socio-cognitively inspired ant colony optimization
    Autorzy:
    Byrski, A.
    Świderska, E.
    Łasisz, J.
    Kisiel-Dorohinicki, M.
    Lenaerts, T.
    Samson, D.
    Indurkhya, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/305756.pdf
    Data publikacji:
    2018
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    ant colony optimization
    socio-cognitive systems
    discrete optimization
    emergence
    Opis:
    A metaheuristic proposed by us recently, Ant Colony Optimization (ACO) hybridized with socio-cognitive inspirations, turned out to generate interesting results compared to classic ACO. Even though it does not always find better solutions to the considered problems, it usually finds sub-optimal solutions usually. Moreover, instead of a trial-and-error approach to configure the parameters of the ant species in the population, in our approach, the actual structure of the population emerges from predefined species-to-species ant migration strategies. Experimental results of our approach are compared against classic ACO and selected socio-cognitive versions of this algorithm.
    Źródło:
    Computer Science; 2018, 19 (1); 81-98
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Volunteer computing simulation using repast and mason
    Autorzy:
    Byrski, A.
    Feluś, M.
    Gawlik, J.
    Jasica, R.
    Kobak, P.
    Jankowski, G.
    Nawarecki, E.
    Wroczyński, M.
    Majewski, P
    Krupa, T.
    Strychalski, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/305347.pdf
    Data publikacji:
    2013
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    volunteer computing
    agent-based simulation
    RePast
    MASON
    Opis:
    Volunteer environments usually consist of a large number of computing nodes, with highly dynamic characteristics, therefore reliable models for a planning of the whole computing are highly desired. An easy to implement approach to modelling and simulation of such environments May employ agent-based universal simulation frameworks, such as RePast or MASON. In the course of the paper the above-mentioned simulation frame Works are adapter to suport simulation of volunteer computing. After giving implementation details, selected results concerning computing time and speedup are given and are compared with the ones obtained from an actual volunteer environment.
    Źródło:
    Computer Science; 2013, 14 (1); 153-172
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-9 z 9

      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