01416nas a2200181   4500000000100000000000100001000000100002008004100003100002100044700001900065700001600084700001700100245007400117300001400191490000700205520100800212022001401220       2014                            d1 aJoanna Domańska1 aAdam Domański1 aD. Augustyn1 aJerzy Klamka00aA red modified weighted moving average for soft real-time application  a697–7070 v243 aThe 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.  a1641-876X00357nas a2200145   4500000000100000000000100001008004100002260002000043100002100063700001900084700001700103700002100120700002300141245004700164       2008                            d  bWydawnictwo WSB1 aJoanna Domańska1 aAdam Domański1 aJerzy Klamka1 aJoanna Domańska1 aAdrian Kapczyński00aAdvanced problems of Internet technologies00398nas a2200145   4500000000100000000000100001008004100002260005100043100002100094700001900115700002400134700002000158700001700178245005700195       2007                            d  bWyższa Szkoła Biznesu w Dąbrowie Górniczej1 aJoanna Domańska1 aAdam Domański1 aTadeusz Czachórski1 aAndrzej Grzywak1 aJerzy Klamka00aPodstawy Budowy i Oprogramowania Sieci Typu Internet00902nas a2200181   4500000000100000000000100001000000100002008004100003100002100044700001900065700002400084700001700108245006700125300001400192490000700206520049300213022001400706       2014                            d1 aJoanna Domańska1 aAdam Domański1 aTadeusz Czachórski1 aJerzy Klamka00aFlluid flow approximation of time-limited TCP/UDP/XCP streams.  a217–2250 v623 aThis 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.  a0239-752800445nas a2200169   4500000000100000000000100001008004100002260004300043100001900086700002100105700002400126700002500150700002200175700002000197700001700217245004100234       2006                            d  bWydawnictwa Komunikacji i Łączności1 aAdam Domański1 aJoanna Domańska1 aTadeusz Czachórski1 aBolesław Pochopień1 aAndrzej Kwiecień1 aAndrzej Grzywak1 aJerzy Klamka00aNowe Technologie Sieci Komputerowych00913nas a2200169   4500000000100000000000100001008004100002260009000043100001900133700002100152700001700173700002000190700001800210245008300228520041000311020002200721       2013                            d  bAcademy of Business in Dabrowa GorniczaaCielplaka Str. 1c, 41-300 Dąbrowa Górnicza1 aAdam Domański1 aJoanna Domańska1 aJerzy Klamka1 aPiotr Pikiewicz1 aM. Rostański00aInternet in the Information Society Computer Systems Architecture and Security3 aIn 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.  a978-83-62897-40-700797nas a2200169   4500000000100000000000100001000000100002008004100003100001900044700002100063700001700084245005300101300001200154490000700166520044000173022001400613       2013                            d1 aAdam Domański1 aJoanna Domańska1 aJerzy Klamka00aAnalysis of CHOKe-Family Active Queue Management  a49–660 v253 aIn 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.  a1896-533400611nas a2200253   4500000000100000000000100001000000100002008004100003100001500044700002300059700002700082700001900109700001400128700001400142700001500156700002100171700001700192700001600209700002000225245007500245300001400320490000900334022001400343       2013                            d1 aE. Helwich1 aJ. Wójkowska-Mach1 aM. Borszewska-Kornacka1 aJ. Gadzinowski1 aA. Kordek1 aD. Pawlik1 aJ. Szczapa1 aJoanna Domańska1 aJerzy Klamka1 aP.B. Heczko1 aE. Gułczyńska00aEpidemiologia zakażeń noworodków z bardzo małą masą urodzeniową  a224–2310 vXVII  a1428-345X00418nas a2200169   4500000000100000000000100001000000100002008004100003100001700044700001700061700002200078700002300100245009200123300001200215490000700227022001400234       2010                            d1 aPiotr Gawron1 aJerzy Klamka1 aJaroslaw Miszczak1 aRyszard Winiarczyk00aExtending scientific computing system with structural quantum programming capabilities  a77–880 v58  a0239-752800748nas a2200157   4500000000100000000000100001000000100002008004100003100001700044700001700061700002300078245009700101300001400198490000700212520037100219       2012                            d1 aPiotr Gawron1 aJerzy Klamka1 aRyszard Winiarczyk00aNoise effects in the quantum search algorithm from the viewpoint of computational complexity  a493–4990 v223 aWe 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.00293nas a2200109   4500000000100000000000100001008004100002100002200043700002400065700001700089245007700106       2011                            d1 aKrzysztof Grochla1 aTadeusz Czachórski1 aJerzy Klamka00aNumerical Model of Tcp in 802.16 Networks Using Fluid Flow Approximation00650nas a2200265   4500000000100000000000100001000000100002008004100003260000600044100002300050700002700073700002100100700001900121700002000140700001500160700001400175700001400189700001500203700001700218700001400235245010000249300001400349490000700363022001400370       2012                            d  c71 aJ. Wójkowska-Mach1 aM. Borszewska-Kornacka1 aJoanna Domańska1 aJ. Gadzinowski1 aE. Gułczyńska1 aE. Helwich1 aA. Kordek1 aD. Pawlik1 aJ. Szczapa1 aJerzy Klamka1 aP. Heczko00aEarly-onset Infections of Very-low-birth-weight Infants in Polish Neonatal Intensive Care Units  a691–6950 v31  a0891-366801386nas a2200145   4500000000100000000000100001008004100002260006300043100001700106700002000123245003600143250000600179490000600185520104900191       2005                            d  bWydawnictwo Komunikacji i Łączności, WarszawaaWarszawa1 aJerzy Klamka1 aAndrzej Grzywak00aWysokowydajne Sieci Komputerowe  a10 v13 aW 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.00324nas a2200133   4500000000100000000000100001008004100002260004000043100001700083700002200100700001400122245003200136020002200168       2012                            d  bWydawnictwo Politechniki Śląskiej1 aJerzy Klamka1 aAndrzej Kwiecień1 aPiotr Gaj00aStefan Węgrzyn in Memoriam  a978-83-7335-955-001234nas a2200133   4500000000100000000000100001000000100002008004100003100001700044245007200061300001200133490000700145520094800152       2007                            d1 aJerzy Klamka00aStochastic controllability of linear systems with delay in control.  a23–290 v553 aIn 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.01214nas a2200133   4500000000100000000000100001000000100002008004100003100001700044245006800061300001100129490000700140520093300147       2007                            d1 aJerzy Klamka00aStochastic controllability of linear systems with state delays.  a5–130 v173 aIn 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.00806nas a2200133   4500000000100000000000100001000000100002008004100003100001700044245002900061300001300090490000700103520056200110       2002                            d1 aJerzy Klamka00aQuantum search algorithm  a95–1040 v233 aRecently, 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.00984nas a2200145   4500000000100000000000100001000000100002008004100003100001700044700002300061245002900084300001400113490000700127520070400134       2003                            d1 aJerzy Klamka1 aSławomir Bugajski00aDwu-osobowa gra kwantowa  a329–3350 v243 aW 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.01274nas a2200145   4500000000100000000000100001008004100002260003200043100001700075700002400092700002200116245007800138300001400216520089800230       2011                            d  bIEEE Computer Society Press1 aJerzy Klamka1 aTadeusz Czachórski1 aKrzysztof Grochla00aModelling TCP Connection in WIMAX Network Using Fluid Flow Approximation.  a502–5073 aThe 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.00973nas a2200145   4500000000100000000000100001008004100002260010800043100001700151700001600168700002400184245005700208300001200265520055000277       2010                            d  bInstitute of Theoretical and Applied Informatics of the Polish Academy o SciencesaGliwice, Bałtycka 51 aJerzy Klamka1 aJ. Tańcula1 aTadeusz Czachórski00aExamination of robust stability of computer networks  a75–873 aThe 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 literature00646nas a2200157   4500000000100000000000100001000000100002008004100003100001700044700001600061245004700077300001100124490000700135520033200142022001400474       2012                            d1 aJerzy Klamka1 aJ. Tańcula00aAnaliza D-stabilności protokołu TCP-DCR.  a7–180 v333 aPraca 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.  a0208-728600660nas a2200145   4500000000100000000000100001000000100002008004100003100001700044700002000061245007900081300001200160490000700172520033500179       2001                            d1 aJerzy Klamka1 aStefan Węgrzyn00aInformatyka kwantowa i jej miejsce w informatyce jako dyscyplinie naukowej  a11–270 v223 aW 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.00267nas a2200133   4500000000100000000000100001000000100002008004100003100001700044700002000061245003300081300001200114490000700126       2000                            d1 aJerzy Klamka1 aStefan Węgrzyn00aKwantowe systemy informatyki  a15–450 v2100859nas a2200145   4500000000100000000000100001000000100002008004100003100001700044700002000061245002200081300001400103490000700117520058900124       2000                            d1 aJerzy Klamka1 aStefan Węgrzyn00aQuantum computing  a235–2460 v123 aIn 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.00905nas a2200157   4500000000100000000000100001000000100002008004100003100001700044700002000061700002300081245004400104300001300148490000700161520057900168       2002                            d1 aJerzy Klamka1 aStefan Węgrzyn1 aSławomir Bugajski00aFoundation of quantum computing. Part 2  a93–1060 v143 a1.“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.00316nas a2200145   4500000000100000000000100001000000100002008004100003100001700044700002000061700002300081245004600104300001300150490000700163       2001                            d1 aJerzy Klamka1 aStefan Węgrzyn1 aSławomir Bugajski00aFoundations of Quantum Computing. Part 1.  a97–1420 v1300930nas a2200193   4500000000100000000000100001000000100002008004100003260000600044100002000050700002000070700001700090700002100107245006200128300001100190490000700201520051400208022001400722       2006                            d  c51 aSławomir Nowak1 aStefan Węgrzyn1 aJerzy Klamka1 aLech Znamirowski00aSystems of Informatics of the Direct Materials Production  a3–140 v183 aThe 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.  a0867-212101516nam a2200181   4500000000100000000000100001008004100002260008800043100002000131700002000151700002100171700001700192700002000209245006500229250000600294520101600300020001801316       2006                            d  bWyd. Pracowni Komputerowej Jacka Sklamierskiegoaul. Pszczyńska 44, 44-100 Gliwice1 aSławomir Nowak1 aStefan Węgrzyn1 aLech Znamirowski1 aJerzy Klamka1 aSławomir Nowak00aSystemy Informatyki Bezpośredniego Wytwarzania Materiałów  a13 aPrzedstawione 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.  a83-89105-97-700400nam a2200157   4500000000100000000000100001008004100002260005900043100002000102700001700122700002200139700002400161245003300185250000600218020001800224       2003                            d  bWydawnictwo Pracowni Komputerowej Jacka Skalmierskiego1 aStefan Węgrzyn1 aJerzy Klamka1 aJaroslaw Miszczak1 aTadeusz Czachórski00aKwantowe systemy informatyki  a2  a83-89105-46-200485nam a2200181   4500000000100000000000100001008004100002260004900043100002000092700001700112700002300129700001300152700002300165700002100188700002200209700002000231245005200251       2004                            d  bWydawnictwo Politechniki ŚląskiejaGliwice1 aStefan Węgrzyn1 aJerzy Klamka1 aSławomir Bugajski1 aM. Gibas1 aRyszard Winiarczyk1 aLech Znamirowski1 aJaroslaw Miszczak1 aSławomir Nowak00aNano i kwantowe systemy informatyki. Wyd.Drugie00503nam a2200193   4500000000100000000000100001008004100002260004900043100002000092700001700112700002300129700001300152700002300165700002100188700002200209700002000231245004000251020001800291       2003                            d  bWydawnictwo Politechniki ŚląskiejaGliwice1 aStefan Węgrzyn1 aJerzy Klamka1 aSławomir Bugajski1 aM. Gibas1 aRyszard Winiarczyk1 aLech Znamirowski1 aJaroslaw Miszczak1 aSławomir Nowak00aNano i Kwantowe Systemy Informatyki  a83-7335-295-300978nas a2200181   4500000000100000000000100001000000100002008004100003100002000044700001700064700002100081700002300102700002000125245004400145300001100189490000700200520058900207       2004                            d1 aStefan Węgrzyn1 aJerzy Klamka1 aLech Znamirowski1 aRyszard Winiarczyk1 aSławomir Nowak00aNano and quantum systems of informatics  a1–100 v523 aIn 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.00416nas a2200157   4500000000100000000000100001008004100002100001900043700002100062700002400083700001700107700001900124245009700143300001000240490000800250       2019                            d1 aAdam Domański1 aJoanna Domańska1 aTadeusz Czachórski1 aJerzy Klamka1 aJakub Szyguła00aThe AQM Dropping Packet Probability Function Based on Non-integer Order PI^αD^β Controller  a36-480 v49600432nas a2200169   4500000000100000000000100001008004100002100001900043700002100062700002400083700001700107700001800124700001900142245008100161300001200242490000800254       2018                            d1 aAdam Domański1 aJoanna Domańska1 aTadeusz Czachórski1 aJerzy Klamka1 aDariusz Marek1 aJakub Szyguła00aGPU Accelerated Non-integer Order PI^αD^β Controller Used as AQM Mechanism  a286-2990 v86000465nas a2200169   4500000000100000000000100001008004100002100001900043700002100062700002400083700001700107700001800124700001900142245011600161300001000277490000800287       2018                            d1 aAdam Domański1 aJoanna Domańska1 aTadeusz Czachórski1 aJerzy Klamka1 aDariusz Marek1 aJakub Szyguła00aThe Influence of the Traffic Self-similarity on the Choice of the Non-integer Order PI^α Controller Parameters  a76-830 v93500380nas a2200145   4500000000100000000000100001008004100002100001900043700002100062700002400083700001700107245009100124300001200215490000700227       2016                            d1 aAdam Domański1 aJoanna Domańska1 aTadeusz Czachórski1 aJerzy Klamka00aThe use of a non-integer order PI controller with an active queue management mechanism  a777-7890 v2600384nas a2200145   4500000000100000000000100001008004100002100001900043700002100062700002400083700001700107245009400124300001200218490000800230       2017                            d1 aAdam Domański1 aJoanna Domańska1 aTadeusz Czachórski1 aJerzy Klamka00aSelf-similarity Traffic and AQM Mechanism Based on Non-integer Order Pi^αD^β Controller  a336-3500 v71800430nas a2200157   4500000000100000000000100001008004100002100001900043700002100062700002400083700001700107700001800124700001900142245010200161490000900263       2019                            d1 aAdam Domański1 aJoanna Domańska1 aTadeusz Czachórski1 aJerzy Klamka1 aDariusz Marek1 aJakub Szyguła00aAQM Mechanism with the Dropping Packet Function Based on the Answer of Several  PIα  Controllers0 v103900791nas a2200181   4500000000100000000000100001008004100002260004400043100001800087700001700105700001600122700001400138700001900152700002200171245008300193520031100276020002200587       2019                            d  bSpringer International PublishingaCham1 aArtur Babiarz1 aJerzy Klamka1 aNgoc Nguyen1 aFord Gaol1 aTzung-Pei Hong1 aBogdan Trawiński00aSelected Problems of Controllability of Semilinear Fractional Systems-A Survey3 a<p>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.</p>
  a978-3-030-14799-000385nas a2200145   4500000000100000000000100001008004100002100001900043700002100062700002400083700001700107700001900124700001800143245007800161       2020                            d1 aAdam Domański1 aJoanna Domańska1 aTadeusz Czachórski1 aJerzy Klamka1 aJakub Szyguła1 aDariusz Marek00aDiffusion Approximation Model of TCP NewReno Congestion Control Mechanism00389nas a2200157   4500000000100000000000100001008004100002260002100043100001900064700001900083700002100102700002400123700001800147700001700165245004900182       2020                            d  c23-26 March 20201 aJakub Szyguła1 aAdam Domański1 aJoanna Domańska1 aTadeusz Czachórski1 aDariusz Marek1 aJerzy Klamka00a AQM mechanism with neuron tuning parameters00445nas a2200169   4500000000100000000000100001008004100002100001900043700001900062700002100081700002400102700001700126700001800143245004900161856005800210490000700268       2021                            d1 aJakub Szyguła1 aAdam Domański1 aJoanna Domańska1 aTadeusz Czachórski1 aJerzy Klamka1 aDariusz Marek00aThe IoT Gateway with Active Queue Management  uhttps://www.amcs.uz.zgora.pl/?action=paper&paper=15980 v3100776nas a2200169   4500000000100000000000100001008004100002260000800043100001700051245008300068856004500151300000900196490000600205520036300211022001400574020001800588       2020                            d  cnov1 aJerzy Klamka00aControllability of Semilinear Systems with Multiple Variable Delays in Control  uhttps://www.mdpi.com/2227-7390/8/11/1955  a19550 v83 a<p>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.</p>
  a2227-7390  a978073541276701455nas a2200145   4500000000100000000000100001008004100002260003800043100001800081700001700099700001700116245007000133520108400203022002201287       2020                            d  bSpringer International Publishing1 aArtur Babiarz1 aAdam Czornik1 aJerzy Klamka00aOn Stabilizability of Discrete Time Systems with Delay in Control3 a<p>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.</p>
  a978-3-030-41964-601417nas a2200205   4500000000100000000000100001008004100002260001200043100001800055700001900073700002100092700002400113700001700137700001900154245008700173856007100260490000800331520085800339022001401197       2021                            d  c01/20211 aDariusz Marek1 aAdam Domański1 aJoanna Domańska1 aTadeusz Czachórski1 aJerzy Klamka1 aJakub Szyguła00aCombined diffusion approximation - simulation model of AQM’s transient behaviour  uhttp://www.sciencedirect.com/science/article/pii/S01403664203199400 v1663 a<p>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.</p>
  a0140-366400431nas a2200169   4500000000100000000000100001008004100002260001200043100001800055700001900073700002100092700001900113700002400132700001700156245008100173490000700254       2021                            d  c05/20211 aDariusz Marek1 aAdam Domański1 aJoanna Domańska1 aJakub Szyguła1 aTadeusz Czachórski1 aJerzy Klamka00aDiffusion model of a non-integer order PIγ controller with TCP/UDP  streams0 v2301636nas a2200157   4500000000100000000000100001008004100002260001300043100001700056700002000073700001900093700002000112245007200132300001200204520126200216       2021                            d  bSpringer1 aJerzy Klamka1 aPiotr Kulczycki1 aJózef Korbicz1 aJanusz Kacprzyk00aControllability of Fractional Linear Systems with Delays in Control  a307-3303 a<p>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.&nbsp; 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.</p>
00207nas a2200085   4500000000100000000000100001008004100002100001700043245006100060       2021                            d1 aJerzy Klamka00aControllability of Fractional Linear Systems with Delays00596nas a2200121   4500000000100000000000100001008004100002100002100043700001700064245007800081490000700159520030800166       2021                            d1 aTadeusz Kaczorek1 aJerzy Klamka00aConvex linear combination of the controllability pairs for linear systems0 v503 a<p>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.</p>
00277nas a2200109   4500000000100000000000100001008004100002260001200043100001700055245004600072856004900118       2021                            d  c09/20211 aJerzy Klamka00aSterowalność układów z opóźnieniami  uhttps://www.impan.pl/~zakopane/49/Klamka.pdf00511nas a2200181   4500000000100000000000100001008004100002100001800043700001900061700002100080700001900101700002400120700001700144700002000161245006400181856007700245490000700322       2022                            d1 aDariusz Marek1 aAdam Domański1 aJoanna Domańska1 aJakub Szyguła1 aTadeusz Czachórski1 aJerzy Klamka1 aKatarzyna Filus00aApproximation Models for the Evaluation of TCP/AQM Networks  uhttps://journals.pan.pl/dlibra/publication/141986/edition/123961/content0 v7000302nas a2200121   4500000000100000000000100001008004100002100001700043700002100060245007800081490000700159022001400166       2021                            d1 aJerzy Klamka1 aTadeusz Kaczorek00aConvex linear combination of the controllability pairs for linear systems0 v50  a0324-856901186nas a2200145   4500000000100000000000100001008004100002100002100043700001700064700002400081245009200105856007200197490000700269520076400276       2022                            d1 aTadeusz Kaczorek1 aJerzy Klamka1 aAndrzej Dzieliński00aControllability of linear convex combination of linear discrete-time fractional systems  uhttp://journals.pan.pl/Content/124861/PDF/2928_BPASTS_2022_70_5.pdf0 v703 a<p>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.</p>
01230nas a2200097   4500000000100000000000100001008004100002100001700043245008700060520098500147       2023                            d1 aJerzy Klamka00aRelative Exact Controllability of Fractional Linear Systems with Delays in Control3 a<p>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.</p>
00328nas a2200109   4500000000100000000000100001008004100002100002000043700002100063700001700084245011700101       2024                            d1 aKatarzyna Filus1 aJoanna Domańska1 aJerzy Klamka00aEvaluating Convolutional Neural Networks via measuring similarity of their first-layer filters and Gabor filters00768nas a2200145   4500000000100000000000100001008004100002260001200043100002100055700001700076700002400093245008800117490001000205520040700215       2025                            d  c03/20251 aTadeusz Kaczorek1 aJerzy Klamka1 aAndrzej Dzieliński00aDescriptor continuous- and discrete-time linear systems with zero transfer matrices0 v73(2)3 a<p>In this paper, necessary and sufficient conditions for zeroing of the transfer matrices of descriptor continuous-time and discrete-time<br />
linear systems are established. The conditions are illustrated by simple numerical examples of the descriptor continuous-time and discrete-time<br />
linear systems. Also some remarks on the systems with delays in control are given.</p>

<p>&nbsp;</p>
01022nas a2200145   4500000000100000000000100001008004100002260000900043100002100052700001700073700002400090245011400114490000900228520063900237       2024                            d  c20241 aTadeusz Kaczorek1 aJerzy Klamka1 aAndrzej Dzieliński00aCONTROLLABILITY AND OBSERVABILITY OF THE DESCRIPTOR LINEAR SYSTEMS  REDUCED TO THE STANDARD ONES BY FEEDBACKS0 v18/13 a<p>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</p>