<?xml version="1.0" encoding="UTF-8"?>
<xml><records><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">D. Augustyn</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A red modified weighted moving average for soft real-time application</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2014</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Int. J. Appl. Math. Comput. Sci.</style></secondary-title><pages><style face="normal" font="default" size="100%">697–707</style></pages><volume><style face="normal" font="default" size="100%">24</style></volume><number><style face="normal" font="default" size="100%">3</style></number><abstract><style face="normal" font="default" size="100%">The popularity of TCP/IP has resulted in an increase in usage of best-effort networks for real-time communication. Much effort has been spent to ensure quality of service for soft real-time traffic over IP networks. The Internet Engineering Task Force has proposed some architecture components, such as Active Queue Management (AQM). The paper investigates the influence of the weighted moving average on packet waiting time reduction for an AQM mechanism: the RED algorithm. The proposed method for computing the average queue length is based on a difference equation (a recursive equation). Depending on a particular optimality criterion, proper parameters of the modified weighted moving average funtion can be chosen. This change will allow reducing the number of violations of timing constraints and better use of this mechanism for soft real-time transmissions. The optimization problem is solved through simulation performed in OMNeT++ and later verified experimentally on a Linux implementation.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Adrian Kapczyński</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Advanced problems of Internet technologies</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2008</style></year></dates><section><style face="normal" font="default" size="100%">Active Queue Management in Linux based routers</style></section><publisher><style face="normal" font="default" size="100%">Wydawnictwo WSB</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Andrzej Grzywak</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Podstawy Budowy i Oprogramowania Sieci Typu Internet</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2007</style></year></dates><section><style face="normal" font="default" size="100%">Aktywne zarządzanie ruchem pakietów dla multimedialnych strumieni danych</style></section><publisher><style face="normal" font="default" size="100%">Wyższa Szkoła Biznesu w Dąbrowie Górniczej</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Flluid flow approximation of time-limited TCP/UDP/XCP streams.</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2014</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences</style></secondary-title><pages><style face="normal" font="default" size="100%">217–225</style></pages><volume><style face="normal" font="default" size="100%">62</style></volume><number><style face="normal" font="default" size="100%">2</style></number><abstract><style face="normal" font="default" size="100%">This article presents the use of fluid flow approximation to model interactions between a set of TCP, UDP and XCP flows in the enveronment of IP routers using AQM (Active Queue Management) algorithms to control traffic congestion. In contrast to other works, independent UDP and TCP streams are considered and the model allows to start and end data transmissions in TCP, UDP and XCP strams at any time moment. It incorporates several Active Queue Management mechanisms: RED, NLRED, CHOKe.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Bolesław Pochopień</style></author><author><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></author><author><style face="normal" font="default" size="100%">Andrzej Grzywak</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2006</style></year></dates><section><style face="normal" font="default" size="100%">Badanie mechanizmów kontroli przeciążenia w TCP zaimplementowanych w systemie operacyjnym Linux</style></section><publisher><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Piotr Pikiewicz</style></author><author><style face="normal" font="default" size="100%">M. Rostański</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Internet in the Information Society Computer Systems Architecture and Security</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">AQM algorithms for aggressive network streams.</style></section><abstract><style face="normal" font="default" size="100%">In this article we study a model of network transmissions with Active Queue Management in an intermadiate IP router. We use the OMNET++ discrete event simulator to model the different variants of the CHOKe algorithms. We model a system where CHOKe, xCHOKe and gCHOKe are the AQM policy. The obtained results show the behaviour of these algorithms and confirm their advantage over a standard RED algorithm.</style></abstract><isbn><style face="normal" font="default" size="100%">978-83-62897-40-7</style></isbn><publisher><style face="normal" font="default" size="100%">Academy of Business in Dabrowa Gornicza</style></publisher><pub-location><style face="normal" font="default" size="100%">Cielplaka Str. 1c, 41-300 Dąbrowa Górnicza</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Analysis of CHOKe-Family Active Queue Management</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2013</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></secondary-title><pages><style face="normal" font="default" size="100%">49–66</style></pages><volume><style face="normal" font="default" size="100%">25</style></volume><number><style face="normal" font="default" size="100%">1</style></number><abstract><style face="normal" font="default" size="100%">In the article we study a model of network transmissions with Active Queue Management in an intermediate IP router. We use the OMNET++ discrete event simulator to model the varies variants of the CHOKe algorithms. We model a system where CHOKe, xCHOKe and gCHOKe are the AQM policy. The obtained results shows the behaviour of these algorithms. The paper presents also the implementation of AQM mechanisms in the router based on Linux.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">E. Helwich</style></author><author><style face="normal" font="default" size="100%">J. Wójkowska-Mach</style></author><author><style face="normal" font="default" size="100%">M. Borszewska-Kornacka</style></author><author><style face="normal" font="default" size="100%">J. Gadzinowski</style></author><author><style face="normal" font="default" size="100%">A. Kordek</style></author><author><style face="normal" font="default" size="100%">D. Pawlik</style></author><author><style face="normal" font="default" size="100%">J. Szczapa</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">P.B. Heczko</style></author><author><style face="normal" font="default" size="100%">E. Gułczyńska</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Epidemiologia zakażeń noworodków z bardzo małą masą urodzeniową</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2013</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Developmental Period Medicine Medycyna Wieku Rozwojowego</style></secondary-title><pages><style face="normal" font="default" size="100%">224–231</style></pages><volume><style face="normal" font="default" size="100%">XVII</style></volume><number><style face="normal" font="default" size="100%">3</style></number><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">Badania Polskiej Sieci Neonatologicznej</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Extending scientiﬁc computing system with structural quantum programming capabilities</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2010</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences - Technical Sciences</style></secondary-title><pages><style face="normal" font="default" size="100%">77–88</style></pages><volume><style face="normal" font="default" size="100%">58</style></volume><number><style face="normal" font="default" size="100%">1</style></number><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1006.1549</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Noise effects in the quantum search algorithm from the viewpoint of computational complexity</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2012</style></year></dates><secondary-title><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science</style></secondary-title><pages><style face="normal" font="default" size="100%">493–499</style></pages><volume><style face="normal" font="default" size="100%">22</style></volume><number><style face="normal" font="default" size="100%">2</style></number><abstract><style face="normal" font="default" size="100%">We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on computational complexity of the quantum search algorithm. We show that only for small amounts of noise the quantum search algorithm is still more efficient than any classical algorithm.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1108.1915</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Numerical Model of Tcp in 802.16 Networks Using Fluid Flow Approximation</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">First International Conference on Networking and Future Internet 2011 (ICNFI 2011)</style></secondary-title><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">J. Wójkowska-Mach</style></author><author><style face="normal" font="default" size="100%">M. Borszewska-Kornacka</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">J. Gadzinowski</style></author><author><style face="normal" font="default" size="100%">E. Gułczyńska</style></author><author><style face="normal" font="default" size="100%">E. Helwich</style></author><author><style face="normal" font="default" size="100%">A. Kordek</style></author><author><style face="normal" font="default" size="100%">D. Pawlik</style></author><author><style face="normal" font="default" size="100%">J. Szczapa</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">P. Heczko</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Early-onset Infections of Very-low-birth-weight Infants in Polish Neonatal Intensive Care Units</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style face="normal" font="default" size="100%">7</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">The Pediatric Infectious Disease Journal</style></secondary-title><pages><style face="normal" font="default" size="100%">691–695</style></pages><volume><style face="normal" font="default" size="100%">31</style></volume><number><style face="normal" font="default" size="100%">7</style></number><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Andrzej Grzywak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Wysokowydajne Sieci Komputerowe</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2005</style></year></dates><volume><style face="normal" font="default" size="100%">1</style></volume><edition><style face="normal" font="default" size="100%">1</style></edition><section><style face="normal" font="default" size="100%">Operatory gęstości w informatyce kwantowej</style></section><abstract><style face="normal" font="default" size="100%">W pracy przedstawiono model matematyczny układu kwantowego zawierającego n qubitów. Wykorzystując pojęcie iloczynu tensorowego oraz jego własności zdefiniowano operatory gęstości (macierze gęstości), będące alternatywnym opisem stanów czystych i mieszanych układu kwantowego. Operatory gęstości są 2n´2n -wymiarowymi macierzami hermitowskimi (symetrycznymi), dodatnio określonymi. Operatory gęstości możliwiają na podstawie badania śladu macierzy gęstości rozróżnienie czystych i mieszanych stanów kwantowych, oraz stosunkowo łatwe wyznaczenie wartości liczbowej dowolnej obserwabli układu kwantowego. Wszystkie zaprezentowane w pracy rezultaty są uogólnieniem na przypadek dowolnego układu kwantowego złożonego z n-qubitów, rezultatów przedstawionych w pracy [1] dla 1-qubitowych oraz 2-qubitowych układów kwantowych. Przedstawione w pracy rezultaty można uogólnić na przypadek złożonych układów kwantowych będących iloczynami tensorowymi wielowymiarowych kwantowych podukładów składowych.</style></abstract><publisher><style face="normal" font="default" size="100%">Wydawnictwo Komunikacji i Łączności, Warszawa</style></publisher><pub-location><style face="normal" font="default" size="100%">Warszawa</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></author><author><style face="normal" font="default" size="100%">Piotr Gaj</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Stefan Węgrzyn in Memoriam</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2012</style></year></dates><section><style face="normal" font="default" size="100%">Podstawy infromatyki kwantowej</style></section><isbn><style face="normal" font="default" size="100%">978-83-7335-955-0</style></isbn><publisher><style face="normal" font="default" size="100%">Wydawnictwo Politechniki Śląskiej</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Stochastic controllability of linear systems with delay in control.</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2007</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences. Technical Sciences.</style></secondary-title><pages><style face="normal" font="default" size="100%">23–29</style></pages><volume><style face="normal" font="default" size="100%">55</style></volume><number><style face="normal" font="default" size="100%">1</style></number><abstract><style face="normal" font="default" size="100%">In the paper finite-dimensional stationary dynamical control systems described by linear stochastic ordinary differential state equations with single point delay in the control are considered. Using notations, theorems and methods taken directly from deterministic controllability problems, necessary and sufficient conditions for different kinds of stochastic relative controllability are formulated and proved. It will be proved that under suitable assumptions relative controllability of a deterministic linear associated dynamical system is equivalent to stochastic relative exact controllability and stochastic relative approximate controllability of the original linear stochastic dynamical system. Some remarks and comments on the existing results for stochastic controllability of linear dynamical systems with delays are also presented. Finally, minimum energy control problem for stochastic dynamical system is formulated and solved.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Stochastic controllability of linear systems with state delays.</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2007</style></year></dates><secondary-title><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science</style></secondary-title><pages><style face="normal" font="default" size="100%">5–13</style></pages><volume><style face="normal" font="default" size="100%">17</style></volume><number><style face="normal" font="default" size="100%">1</style></number><abstract><style face="normal" font="default" size="100%">In the paper finite-dimensional stationary dynamical control systems described by linear stochastic ordinary differential state equations with single point delay in the state variables are considered. Using theorem and methods taken directly from deterministic controllability problems, necessary and sufficient conditions for different kinds of stochastic relative controllability are formulated and proved. It will be proved that under suitable assumptions relative controllability of a deterministic linear associated dynamical system is equivalent to stochastic relative exact controllability and stochastic relative approximate controllability of the original linear stochastic dynamical system. Some remarks and comments on the existing results for controllability of linear dynamical systems with delays are also presented. Finally, minimum energy control problem for stochastic dynamical system is formulated and solved.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantum search algorithm</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2002</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Studia Informatica</style></secondary-title><pages><style face="normal" font="default" size="100%">95–104</style></pages><volume><style face="normal" font="default" size="100%">23</style></volume><number><style face="normal" font="default" size="100%">2A</style></number><abstract><style face="normal" font="default" size="100%">Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations. It now appears that, at least theoretically, quantum computations may be much faster than classical computations for solving certain problems including for example search problems. In the present paper the fundamental Grover’s search algorithm of quantum computation is discussed. Fundamental quantum operators for Grover’s search algorithm are presented. Moreover, several remarks and comments concerning quantum computations are also given.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Sławomir Bugajski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Dwu-osobowa gra kwantowa</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2003</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Studia Informatica</style></secondary-title><pages><style face="normal" font="default" size="100%">329–335</style></pages><volume><style face="normal" font="default" size="100%">24</style></volume><number><style face="normal" font="default" size="100%">3</style></number><abstract><style face="normal" font="default" size="100%">W ostatnim czasie wykazano, że zastosowanie pewnych wybranych metod mechaniki kwantowej może znacznie przyspieszyć niektóre czasochłonne obliczenia. Teoretycznie, obliczenia kwantowe mogą być przeprowadzane znacznie szybciej niż metodami klasycznymi, czego przykładem jest teoria gier. W artykule przedstawiono definicję statycznej dwu-osobowej gry kwantowej oraz przedyskutowano jej podstawowe własności. Pokazano, między innymi, że statyczna dwo-osobowa gra kwantowa jest reprezentowana przez wektor o współrzędnych zespolonych określony w iloczynie tensorowym dwóch przestrzeni stanów kwantowych. Ponadto przedstawiono uwagi i komentarze dotyczące zagadnień gier kwantowych.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Modelling TCP Connection in WIMAX Network Using Fluid Flow Approximation.</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Applications and the Internet</style></secondary-title><pages><style face="normal" font="default" size="100%">502–507</style></pages><abstract><style face="normal" font="default" size="100%">The fluid-flow approximation models have been during last few years to analyze the dynamics and stability of TCP/RED connections in wired networks. The model assumes that the fluctuations of parameters of the connections are relatively low. The fluid flow models base on the linearization and use of control theory analysis tools to verify the stability and behavior of the analyzed system. In this article we use some extensions of fluid flow approximation to support time division multiplexing used in WiMAX wireless networks. We describe the modification of fluid flow equations to incorporate the delivery of packets as an on-off source with on and off times modulated by the WiMAX scheduling algorithm. The results of the fluid flow model have been compared to the measurement in a small test bed. We also show how to analyze the stability of the connection using control theory approach.</style></abstract><publisher><style face="normal" font="default" size="100%">IEEE Computer Society Press</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">J. Tańcula</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Examination of robust stability of computer networks</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2010</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Performance Modelling and Evaluation of Heterogeneous Networks</style></secondary-title><pages><style face="normal" font="default" size="100%">75–87</style></pages><abstract><style face="normal" font="default" size="100%">The thesis presents a nonlinear mathematical model of a computer network with the RED algorithm. The model equations were linearized around the set operating point and next block diagrams of the system presented. Using the methods for examining stability known from the literature, the robust stability of the system has been analysed with slight changes in its parameters. An example of stability examination prepared on the basis of the data for a real computer network has been shown. The results generalise the results known in he literature</style></abstract><publisher><style face="normal" font="default" size="100%">Institute of Theoretical and Applied Informatics of the Polish Academy o Sciences</style></publisher><pub-location><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">HET-NETs 2010 Zakopane, January 14th - 16th, 2010</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">J. Tańcula</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Analiza D-stabilności protokołu TCP-DCR.</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2012</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Studia Informatica</style></secondary-title><pages><style face="normal" font="default" size="100%">7–18</style></pages><volume><style face="normal" font="default" size="100%">33</style></volume><number><style face="normal" font="default" size="100%">3A (107)</style></number><abstract><style face="normal" font="default" size="100%">Praca zawiera analizę stabilności sieci na podstawie protokołu TCP-DCR, będącego modyfikacją tradycyjnego TCP. Utworzono model matematyczny sieci i opisano go równaniami. Schemat blokowy modelu sieci przekształcono do takiej postaci, aby zbadać jego D-stabilność stosując metodę przestrzeni niepewnych parametrów.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Informatyka kwantowa i jej miejsce w informatyce jako dyscyplinie naukowej</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2001</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Studia Informatica</style></secondary-title><pages><style face="normal" font="default" size="100%">11–27</style></pages><volume><style face="normal" font="default" size="100%">22</style></volume><number><style face="normal" font="default" size="100%">1</style></number><abstract><style face="normal" font="default" size="100%">W pracy przedstawiono podstawy matematyczne jedno i dwu qubitowych układów kwantowych. Wykorzystano zarówno podejście oparte na opisie wektorowym, jak i podejście bazujące na operatorach gęstości. Wprowadzenie operatorów gęstości umożliwia stosunkowo prostą interpretację wielu istotnych pojęć mechaniki kwantowej.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Kwantowe systemy informatyki</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2000</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Studia Informatica</style></secondary-title><pages><style face="normal" font="default" size="100%">15–45</style></pages><volume><style face="normal" font="default" size="100%">21</style></volume><number><style face="normal" font="default" size="100%">1</style></number><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantum computing</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2000</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></secondary-title><pages><style face="normal" font="default" size="100%">235–246</style></pages><volume><style face="normal" font="default" size="100%">12</style></volume><number><style face="normal" font="default" size="100%">3</style></number><abstract><style face="normal" font="default" size="100%">In the present studies on quantum computer systems principles of a quantum logic gates and basic elements of quantum computers are described. The fundamental elements of quantum computer and mathematical backgrounds of suitable quantum computation processes are presented. Specially Toffoli quantum gate and Hadamard quantum gate are discussed in details. Mathematical bases and principles of quantum computations are also mentioned. Finally, the role of nuclear magnetic resonance in quantum computations is investigated. Moreover, the extensive list of references is also presented.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author><author><style face="normal" font="default" size="100%">Sławomir Bugajski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Foundation of quantum computing. Part 2</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2002</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></secondary-title><pages><style face="normal" font="default" size="100%">93–106</style></pages><volume><style face="normal" font="default" size="100%">14</style></volume><number><style face="normal" font="default" size="100%">2</style></number><abstract><style face="normal" font="default" size="100%">1.“Quantum search algorithm“, Studia Informatica, vol.23, no.2A (48), 2002, str.95-104. 2.„Sterowalność układów dynamicznych typu 2D”, referat, XXXI Ogólnopolska Konferencja Zastosowań Matematyki, Zakopane, 17-24. 09.2002. 3.“Foundation of quantum computing. Part 2”, Archiwum Informatyki Teoretycznej i Stosowanej, tom 14, zeszyt 2, 2002, pp.93-106, (współautorzy: Stefan Węgrzyn, Sławomir Bugajski, 30%). 4.“Controllability and observability of distributed parameter systems. A survey”, Studia z Automatyki i Informatyki, tom 27, 2003, str. 7-19.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author><author><style face="normal" font="default" size="100%">Sławomir Bugajski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Foundations of Quantum Computing. Part 1.</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2001</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></secondary-title><pages><style face="normal" font="default" size="100%">97–142</style></pages><volume><style face="normal" font="default" size="100%">13</style></volume><number><style face="normal" font="default" size="100%">2</style></number><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sławomir Nowak</style></author><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Lech Znamirowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Systems of Informatics of the Direct Materials Production</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style face="normal" font="default" size="100%">5</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></secondary-title><pages><style face="normal" font="default" size="100%">3–14</style></pages><volume><style face="normal" font="default" size="100%">18</style></volume><number><style face="normal" font="default" size="100%">1</style></number><abstract><style face="normal" font="default" size="100%">The results of researches in the area of nanosystems of informatics, self-replication and self-organization processes are presented. Developing and joining together the gotten results into the integral whole permits in these three mentioned scopes to elaborate the scientific bases for the construction of structure of the algorithms and organization of nanosystems of informatics for the direct material production and object fabrication, and the inspiration of processes of the self-organization of objects.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>28</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sławomir Nowak</style></author><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author><author><style face="normal" font="default" size="100%">Lech Znamirowski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Sławomir Nowak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Systemy Informatyki Bezpośredniego Wytwarzania Materiałów</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2006</style></year></dates><edition><style face="normal" font="default" size="100%">1</style></edition><abstract><style face="normal" font="default" size="100%">Przedstawione opracowanie wynika z dającej się coraz wyraźniej odczuć potrzeby traktowania i rozwijania informatyki jako ogólnej dziedziny nauki o ruchu i przetwarzaniu informacji wszędzie tam, gdzie ruch i przetwarzanie informacji mają miejsce. Chodzi więc zarówno o różne systemy techniczne, jak i o organizmy biologiczne. Biologiczne systemy informatyki, rozwijające się od miliardów lat, charakteryzują się m.in. tym, że mają w nich miejsce procesy bezpośredniego wytwarzania potrzebnych organizmowi materiałów i produktów. Wzorując się na tym, autorzy niniejszego opracowania podjęli prace nad takimi technicznymi systemami informatyki, w których również mogły być realizowane procesy bezpośredniego wytwarzanie materiałów i produktów. Ponieważ z dotychczasowych naszych prac już obecnie wynika, że taka możliwość istnieje, postanowiliśmy zebrać nasze opracowania w pewną całość, ilustrującą jeden z obecnie podstawowych kierunków rozwojowych w informatyce.</style></abstract><isbn><style face="normal" font="default" size="100%">83-89105-97-7</style></isbn><publisher><style face="normal" font="default" size="100%">Wyd. Pracowni Komputerowej Jacka Sklamierskiego</style></publisher><pub-location><style face="normal" font="default" size="100%">ul. Pszczyńska 44, 44-100 Gliwice</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>28</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Kwantowe systemy informatyki</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2003</style></year></dates><edition><style face="normal" font="default" size="100%">2</style></edition><isbn><style face="normal" font="default" size="100%">83-89105-46-2</style></isbn><publisher><style face="normal" font="default" size="100%">Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>28</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Sławomir Bugajski</style></author><author><style face="normal" font="default" size="100%">M. Gibas</style></author><author><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></author><author><style face="normal" font="default" size="100%">Lech Znamirowski</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Sławomir Nowak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Nano i kwantowe systemy informatyki. Wyd.Drugie</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2004</style></year></dates><publisher><style face="normal" font="default" size="100%">Wydawnictwo Politechniki Śląskiej</style></publisher><pub-location><style face="normal" font="default" size="100%">Gliwice</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>28</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Sławomir Bugajski</style></author><author><style face="normal" font="default" size="100%">M. Gibas</style></author><author><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></author><author><style face="normal" font="default" size="100%">Lech Znamirowski</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Sławomir Nowak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Nano i Kwantowe Systemy Informatyki</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2003</style></year></dates><isbn><style face="normal" font="default" size="100%">83-7335-295-3</style></isbn><publisher><style face="normal" font="default" size="100%">Wydawnictwo Politechniki Śląskiej</style></publisher><pub-location><style face="normal" font="default" size="100%">Gliwice</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Lech Znamirowski</style></author><author><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></author><author><style face="normal" font="default" size="100%">Sławomir Nowak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Nano and quantum systems of informatics</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2004</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Science</style></secondary-title><pages><style face="normal" font="default" size="100%">1–10</style></pages><volume><style face="normal" font="default" size="100%">52</style></volume><number><style face="normal" font="default" size="100%">1</style></number><abstract><style face="normal" font="default" size="100%">In the present studies on quantum computer systems principles of a quantum logic gates and basic elements of quantum computers are described. The fundamental elements of quantum computer and mathematical backgrounds of suitable quantum computation processes are presented. Specially Toffoli quantum gate and Hadamard quantum gate are discussed in details. Mathematical bases and principles of quantum computations are also mentioned. Finally, the role of nuclear magnetic resonance in quantum computations is investigated. Moreover, the extensive list of references is also presented.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Jakub Szyguła</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The AQM Dropping Packet Probability Function Based on Non-integer Order PI^αD^β Controller</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2019</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Electrical Engineering</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-319-78458-8</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">36-48</style></pages><volume><style face="normal" font="default" size="100%">496</style></volume><section><style face="normal" font="default" size="100%">36</style></section><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Dariusz Marek</style></author><author><style face="normal" font="default" size="100%">Jakub Szyguła</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">GPU Accelerated Non-integer Order PI^αD^β Controller Used as AQM Mechanism</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2018</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-319-92459-5</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">286-299</style></pages><volume><style face="normal" font="default" size="100%">860</style></volume><section><style face="normal" font="default" size="100%">286</style></section><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Dariusz Marek</style></author><author><style face="normal" font="default" size="100%">Jakub Szyguła</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Influence of the Traffic Self-similarity on the Choice of the Non-integer Order PI^α Controller Parameters</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2018</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-00840-6</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">76-83</style></pages><volume><style face="normal" font="default" size="100%">935</style></volume><section><style face="normal" font="default" size="100%">76</style></section><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The use of a non-integer order PI controller with an active queue management mechanism</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2016</style></year></dates><secondary-title><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1515/amcs-2016-0055</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">777-789</style></pages><volume><style face="normal" font="default" size="100%">26</style></volume><issue><style face="normal" font="default" size="100%">4</style></issue><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Self-similarity Traffic and AQM Mechanism Based on Non-integer Order Pi^αD^β Controller</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2017</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-319-59767-6_27</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">336-350</style></pages><volume><style face="normal" font="default" size="100%">718</style></volume><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Dariusz Marek</style></author><author><style face="normal" font="default" size="100%">Jakub Szyguła</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">AQM Mechanism with the Dropping Packet Function Based on the Answer of Several  PIα  Controllers</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2019</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Communications in Computer and Information Science </style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-21952-9_29</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">1039</style></volume><section><style face="normal" font="default" size="100%">400-412</style></section><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Artur Babiarz</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Ngoc Nguyen</style></author><author><style face="normal" font="default" size="100%">Ford Gaol</style></author><author><style face="normal" font="default" size="100%">Tzung-Pei Hong</style></author><author><style face="normal" font="default" size="100%">Bogdan Trawiński</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Selected Problems of Controllability of Semilinear Fractional Systems-A Survey</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2019</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Intelligent Information and Database Systems</style></secondary-title><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The following article presents recent results of controllability problem of dynamical systems in infinite and finite-dimensional spaces. Roughly speaking, we describe selected controllability problems of fractional order systems, including approximate controllability and complete controllability.&lt;/p&gt;&#13;
</style></abstract><isbn><style face="normal" font="default" size="100%">978-3-030-14799-0</style></isbn><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Jakub Szyguła</style></author><author><style face="normal" font="default" size="100%">Dariusz Marek</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Diffusion Approximation Model of TCP NewReno Congestion Control Mechanism</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2020</style></year></dates><secondary-title><style face="normal" font="default" size="100%">SN Computer Science</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1007/s42979-019-0032-x</style></electronic-resource-num><issue><style face="normal" font="default" size="100%">1:43</style></issue><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jakub Szyguła</style></author><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Dariusz Marek</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%"> AQM mechanism with neuron tuning parameters</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style face="normal" font="default" size="100%">23-26 March 2020</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">12th Asian Conference on Intelligent Information and Database Systems, Phuket, Thailand</style></secondary-title><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jakub Szyguła</style></author><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Dariusz Marek</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The IoT Gateway with Active Queue Management</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year></dates><secondary-title><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science (AMCS)</style></secondary-title><urls><style face="normal" font="default" size="100%"/></urls><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.34768/amcs-2021-0012</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">31</style></volume><issue><style face="normal" font="default" size="100%">1</style></issue><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Controllability of Semilinear Systems with Multiple Variable Delays in Control</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style face="normal" font="default" size="100%">nov</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Mathematics</style></secondary-title><urls><style face="normal" font="default" size="100%">https://www.mdpi.com/2227-7390/8/11/1955</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.3390/math8111955</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">1955</style></pages><volume><style face="normal" font="default" size="100%">8</style></volume><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In the paper semilinear, finite-dimensional, control systems with multiple time variable point delays in admissible controls are considered. Using Rothe's fixed-point theorem, sufficient controllability conditions are formulated. The results of the paper are generalization to many time variable delays in control, of the results published recently.&lt;/p&gt;&#13;
</style></abstract><isbn><style face="normal" font="default" size="100%">9780735412767</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Artur Babiarz</style></author><author><style face="normal" font="default" size="100%">Adam Czornik</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On Stabilizability of Discrete Time Systems with Delay in Control</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2020</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Intelligent Information and Database Systems</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/978-3-030-41964-6_16</style></electronic-resource-num><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The paper deals with discrete time-invariant systems with a delay in the control variable. The relations between different types of controllability and stabilizability are presented and discussed. The results are related to asymptotic null controllability, bounded feedback stabilizability and small feedback stabilizability for linear discrete-time systems with delay in control. The main tool employed is the technique of reducing the delayed equation to a delay-free equation. Thanks to this idea the criteria for bounded feedback stabilizability and small feedback stabilizability for the delayed systems are expressed in the appropriate properties of delay-free systems. Main results are analogical of this one proved in [18] for discrete time-invariant delay-free systems and to those from [14] for continuous-time systems. One of the additional result of this paper provides a criterion for controllability of discrete time system with delay in control. An important contribution of this paper is the indication of further generalizations of the obtained results.&lt;/p&gt;&#13;
</style></abstract><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dariusz Marek</style></author><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Jakub Szyguła</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Combined diffusion approximation - simulation model of AQM’s transient behaviour</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style face="normal" font="default" size="100%">01/2021</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Computer Communications</style></secondary-title><urls><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0140366420319940</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.comcom.2020.11.014</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">166</style></volume><section><style face="normal" font="default" size="100%">40-48</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The article introduces an approach combining diffusion approximation and simulation ones. Furthermore, it describes how it can be used to evaluate active queue management (AQM) mechanisms. Based on the obtained queue distributions, the simulation part of the model decides on package losses and modifies the flow intensity sent by the transmitter. The diffusion is used to estimate queue distributions and the goal of the simulation part of the model is to represent the AQM mechanism. On the one hand, the use of the diffusion part considerably accelerates the performance of the whole model. On the other hand, the simulation increases the accuracy of the diffusion part. We apply the model to compare the performance of fractional order PIη controller used in AQM with the performance of RED, a well known active queue management mechanism.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dariusz Marek</style></author><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Jakub Szyguła</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Diffusion model of a non-integer order PIγ controller with TCP/UDP  streams</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style face="normal" font="default" size="100%">05/2021</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Entropy</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.3390/e23050619</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">23</style></volume><section><style face="normal" font="default" size="100%">619</style></section><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Piotr Kulczycki</style></author><author><style face="normal" font="default" size="100%">Józef Korbicz</style></author><author><style face="normal" font="default" size="100%">Janusz Kacprzyk</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Controllability of Fractional Linear Systems with Delays in Control</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Studies in Systems, Decision and Control</style></secondary-title><pages><style face="normal" font="default" size="100%">307-330</style></pages><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In the chapter linear, fractional, continuous time, finite-dimensional, dynamical control systems with multiple variable point delays and distributed delay in admissible control described by linear ordinary differential state equations are considered. Using notations, theorems and methods taken directly from functional analysis and linear controllability theory, necessary and sufficient conditions for global relative controllability in a given finite time interval are formulated and proved. The main result of the chapter is to show, that global relative controllability of fractional linear systems with different types of delays in admissible control is equivalent to non-singularity of a suitably defined relative controllability matrix. In the proofs of the main results, methods and concepts taken from the theory of linear bounded operators in Hilbert spaces are used.&#160; Applying a relative controllability matrix for relative controllable systems steering admissible control is proposed, which steers the fractional system from a given initial complete state to the desired final relative state. Some remarks and comments on the existing controllability results for linear fractional dynamical system with delays are also presented.&lt;/p&gt;&#13;
</style></abstract><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Controllability of Fractional Linear Systems with Delays</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year></dates><secondary-title><style face="normal" font="default" size="100%">25th International Conference on Methods and Models in Automation and Robotics</style></secondary-title><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tadeusz Kaczorek</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Convex linear combination of the controllability pairs for linear systems</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Control and Cybernetics</style></secondary-title><volume><style face="normal" font="default" size="100%">50</style></volume><issue><style face="normal" font="default" size="100%">4</style></issue><section><style face="normal" font="default" size="100%">1-11</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The convex linear combination of the controllabil- ity pairs of linear continuous-time linear systems is defined and its pro-perties are discussed. The main result is obtained using pure algebraic methods. In the illustrative examples different cases of linear convex combinations are analyzed.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Sterowalność układów z opóźnieniami</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style face="normal" font="default" size="100%">09/2021</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">49. konferencja „Zastosowania Matematyki”, Zakopane 19-25.09.2021</style></secondary-title><urls><style face="normal" font="default" size="100%">https://www.impan.pl/~zakopane/49/Klamka.pdf</style></urls><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dariusz Marek</style></author><author><style face="normal" font="default" size="100%">Adam Domański</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Jakub Szyguła</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Katarzyna Filus</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Approximation Models for the Evaluation of TCP/AQM Networks</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences, Technical Sciences (BPASTS)</style></secondary-title><urls><style face="normal" font="default" size="100%">https://journals.pan.pl/dlibra/publication/141986/edition/123961/content</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.24425/bpasts.2022.141986</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">70</style></volume><issue><style face="normal" font="default" size="100%">4</style></issue><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Tadeusz Kaczorek</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Convex linear combination of the controllability pairs for linear systems</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Control and Cybernetics</style></secondary-title><volume><style face="normal" font="default" size="100%">50</style></volume><section><style face="normal" font="default" size="100%">541</style></section><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tadeusz Kaczorek</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Andrzej Dzieliński</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Controllability of linear convex combination of linear discrete-time fractional systems</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences: Technical Sciences</style></secondary-title><urls><style face="normal" font="default" size="100%">http://journals.pan.pl/Content/124861/PDF/2928_BPASTS_2022_70_5.pdf</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.24425/bpasts.2022.143102</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">70</style></volume><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper the controllability properties of the convex linear combination of fractional, linear, discrete-time systems are characterized and investigated. The notions of linear convex combination and controllability in the context of fractional-order systems are recalled. Then, the controllability property of such a linear combination of discrete-time, linear fractional systems is proven. Further, the reduction of an infinite problem of transition matrix derivation is reduced to a finite one, which greatly simplifies the numerical burden of the controllability issue. Examples of controllable and uncontrollable, single-input, linear systems are presented. The possibility of extension of the considerations to multi-input systems is shown.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Relative Exact Controllability of Fractional Linear Systems with Delays in Control</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2023</style></year></dates><secondary-title><style face="normal" font="default" size="100%"/></secondary-title><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In the paper linear, fractional, continuous time, infinite-dimensional, stationary dynamical control systems with multiple variable point delays in admissible control described by state equations are considered. Using notations, theorems and methods taken directly from functional analysis and linear controllability theory, necessary and sufficient conditions for global relative exact controllability in a given finite time interval are formulated and proved. The main result of the paper is to show, that global relative exact controllability of fractional linear systems with different types of delays in admissible control is equivalent to invertibility of suitably defined relative exact controllability operator. In the proof of main result, methods taken from the theory of linear bounded operators in Hilbert spaces are used. Some remarks and comments on the existing controllability results for linear fractional dynamical system with delays are also presented.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Katarzyna Filus</style></author><author><style face="normal" font="default" size="100%">Joanna Domańska</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evaluating Convolutional Neural Networks via measuring similarity of their first-layer filters and Gabor filters</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2024</style></year></dates><secondary-title><style face="normal" font="default" size="100%">32nd International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1109/MASCOTS64422.2024.10786556</style></electronic-resource-num><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tadeusz Kaczorek</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Andrzej Dzieliński</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Descriptor continuous- and discrete-time linear systems with zero transfer matrices</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2025</style></year><pub-dates><date><style face="normal" font="default" size="100%">03/2025</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences. TECHNICAL SCIENCES</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.24425/bpasts.2024.152710</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">73(2)</style></volume><section><style face="normal" font="default" size="100%">e152710</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, necessary and sufficient conditions for zeroing of the transfer matrices of descriptor continuous-time and discrete-time&lt;br /&gt;&#13;
linear systems are established. The conditions are illustrated by simple numerical examples of the descriptor continuous-time and discrete-time&lt;br /&gt;&#13;
linear systems. Also some remarks on the systems with delays in control are given.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;&#160;&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tadeusz Kaczorek</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Andrzej Dzieliński</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">CONTROLLABILITY AND OBSERVABILITY OF THE DESCRIPTOR LINEAR SYSTEMS  REDUCED TO THE STANDARD ONES BY FEEDBACKS</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2024</style></year><pub-dates><date><style face="normal" font="default" size="100%">2024</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Acta Mechanica et Automatica</style></secondary-title><volume><style face="normal" font="default" size="100%">18/1</style></volume><section><style face="normal" font="default" size="100%">119</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Abstract: In this paper, a new method for the reduction of the descriptor linear systems to standards ones is presented and verified. The method uses a state and/or state derivative feedback of output and output derivative feedback in order to transform the descriptor system into a standard one. The controllability and observability properties of the original descriptor as well as transformed standard systems are proved. Simple numerical examples illustrate the theorems introduced. Key words: controllability and observability, descriptor linear systems, state feedback, state derivative feedback, standard linear system&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>
