<?xml version="1.0" encoding="UTF-8"?>
<xml><records><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">A. Badrah</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">F. Quessette</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance evaluation of multistage interconnection networks with blocking - discrete and continuous time Markov model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><title><style face="normal" font="default" size="100%">Performance evaluation of multistage interconnection networks with blocking - discrete and continuous time Markov model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">A. Busic</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</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%">Level Crossing Ordering of Markov Chains: Proving Convergence and Bounding End to End Delays in an All Optical Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM Proceedings from Valuetools 2007</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ACM</style></PUBLISHER><title><style face="normal" font="default" size="100%">Level Crossing Ordering of Markov Chains: Proving Convergence and Bounding End to End Delays in an All Optical Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Józefiok</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><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance evaluation of multiuser interactive networking system</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of 6th International Conference HET-NETs 2010</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">223–231</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The article presents a work in progress aiming at performance evaluation of a large database system at an assurance company. The system includes a server with a database and a local area network with a number of terminals where the company employees run applications that introduce documents or retrieve them from the database. We discuss a model of clients activities. Measurements were collected inside the working system: the phases at each users application were identified and their duration was measured. The collected data are used to construct a synthetic model of applications activities which is then applied to predict the system bahaviour in case of the growth of the number of users.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance evaluation of multiuser interactive networking system</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">P. Bazan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Krzak</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%">Piotr Pikiewicz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nowe Technologie w Komputerowych Systemach Zarządzania. Internet w Społeczeństwie Informacyjnym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Ocena mechanizmów kształtowania efektywności transmisji</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie w Komputerowych Systemach Zarządzania. Internet w Społeczeństwie Informacyjnym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">A. Brachman</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%">Analiza wydajności protokołu TCP-NCR w sieciach bezprzewodowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Materiały Konferencji Sieci Komputerowe</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Komunikacji i Łączności</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">6</style></DATE><title><style face="normal" font="default" size="100%">Analiza wydajności protokołu TCP-NCR w sieciach bezprzewodowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">B. Bylina</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Bylina</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</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%">Współczesne problemy sieci komputerowych Nowe technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WNT</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Wykorzystanie równoległego i wektorowego rozkładu WZ w markowowskich modelach sieci komputerowych</style></SECTION><title><style face="normal" font="default" size="100%">Współczesne problemy sieci komputerowych Nowe technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">B. Bylina</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Bylina</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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The use of vectorized and parallelized solutions to Markovian models in performance evaluation of communication networks: a case of leaky buckets with tokens</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">16</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">153–170</style></PAGES><title><style face="normal" font="default" size="100%">The use of vectorized and parallelized solutions to Markovian models in performance evaluation of communication networks: a case of leaky buckets with tokens</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet w społeczeństwie informatycznym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Dąbrowa Górnicza</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wyższa Szkoła Biznesu i Organizacji</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Internet a sieci optyczne</style></SECTION><NOTES><style face="normal" font="default" size="100%">str 85 - 110</style></NOTES><title><style face="normal" font="default" size="100%">Internet w społeczeństwie informatycznym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">V. Mityushev</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ł.A. Stępień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Budziak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Queueing models: transient state analysis applied to performance evaluation of computer networks.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Abstracts 9th International ISAAC Congress</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">44-100 Gliwice, ul. Pszczyńska 44</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Pracownia Komputerowa Jacka Skalmierskiego</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">5–6</style></PAGES><DATE><style face="normal" font="default" size="100%">8</style></DATE><NOTES><style face="normal" font="default" size="100%">9th International ISAAC Congress August 509, 2013, Kraków, Poland</style></NOTES><title><style face="normal" font="default" size="100%">Queueing models: transient state analysis applied to performance evaluation of computer networks.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">V. Mityushev</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Ruzhansky</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analytic Methods in Interdisciplinary Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Queueing Models for Performance Evaluation of Computer Networks - Transient State Analysis</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">Queueing theory is a useful tool in design of computer networks and their performance evaluation. The literature concerning this subject is abundant. However, it is in general limited to the analysis of steady states. It means that flows of customers considered in models are constant and obtained solutions do not depend on time. It is in glaring contrast with the flows observed in real networks where the perpetual changes of traffic intensities are due to the nature of users, sending variable quantities of data, cf. multimedia traffic, and also due to the performance of traffic control algorithms which are trying to avoid congestion in networks, e.g. the algorithm of congestion window used in TCP protocol which is adapting the rate of the sent traffic to the observed losses or transmission delays. We discuss here the means used to analyse transient states in queueing models. In computer applications a mathematical model is useful only when it furnishes quantitative results. Therefore practical ussues related to numerical side of models are of importance and are here discussed. We present three approaches - Markov models solved numerically, fluid flow approximation and diffusion approximation. A particular importance is given to the latter as the author has here over 20year experience in development and application of this method. He is also convinced of the qualities of this approach - its flexibility to treat various variants of queueing models. Traffic intensity observed in computer networks have a complex stochastic nature that influences the network performances. We discuss also this side of implemented queueing models.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Analytic Methods in Interdisciplinary Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling transient states in queueing models of computer networks: a few practical issues</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of the International Conference Distributed Computer and Communication networks: Control, Computation, Communications</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Moscow</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">V.A.Trapeznikov Institute of Control Sciences Russian Academy of Sciences; Institute of Information and Communication technologies Bulgarian Academy of Sciences</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">27–28</style></PAGES><DATE><style face="normal" font="default" size="100%">10</style></DATE><NOTES><style face="normal" font="default" size="100%">DCCN 2013, Moscow, Russia, October 7-10, 2013</style></NOTES><title><style face="normal" font="default" size="100%">Modelling transient states in queueing models of computer networks: a few practical issues</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling and controlling dynamics of Internet flows.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. Intellectual systems of decision-making and problems of computational intelligence</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><NOTES><style face="normal" font="default" size="100%">ISDMCI'2013, Eupatoria, 20-24 maj 2013</style></NOTES><title><style face="normal" font="default" size="100%">Modelling and controlling dynamics of Internet flows.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Transient queueing models applied to performance evaluation of computer networks.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. Third International Conference of Gwalior Academy of Mathematical Sciences (GAMS) on Mathematical, Computational and Integrative Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><NOTES><style face="normal" font="default" size="100%">Bhopal India, 22-26 September 2013</style></NOTES><title><style face="normal" font="default" size="100%">Transient queueing models applied to performance evaluation of computer networks.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analityczne modele kolejkowe w ocenie efektywności pracy systemów i sieci kolejkowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Pro Dialog</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">16</style></VOLUME><PAGES><style face="normal" font="default" size="100%">90–111</style></PAGES><title><style face="normal" font="default" size="100%">Analityczne modele kolejkowe w ocenie efektywności pracy systemów i sieci kolejkowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</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%">N. Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Markovian models for long-range dependent traffic, new results</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of First Workshop on New Trends in Modelling Quantitave Methods and Measurements, in Modelling Quantitave Methods and Measurements, Zakopane, 27-29 June 2004</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">213–228</style></PAGES><title><style face="normal" font="default" size="100%">Markovian models for long-range dependent traffic, new results</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wpływ samopodobnej natury ruchu na długości kolejek w przełącznikach sieciowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2A (48)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">201–212</style></PAGES><title><style face="normal" font="default" size="100%">Wpływ samopodobnej natury ruchu na długości kolejek w przełącznikach sieciowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Markovian models for long-range dependent traffic</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">297–308</style></PAGES><title><style face="normal" font="default" size="100%">Markovian models for long-range dependent traffic</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><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%">Andrzej Grzywak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pikiewicz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nowe Technologie w Komputerowych Systemach Zarządzania. Internet w Społeczeństwie Informacyjnym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Rachunek sieciowy w zastosowaniu do analizy jakości usług w Internecie</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie w Komputerowych Systemach Zarządzania. Internet w Społeczeństwie Informacyjnym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><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%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</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%">Wysokowydajne sieci komputerowe. Nowe Technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Aktywne zarządzanie buforami routerów IP w obecności ruchu samopodobnego</style></SECTION><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe. Nowe Technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</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%">Dynamics of TCP/IP flows in presence of various AQM algorithms, a fluid flow approximation model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Third EuroNGI Workshop on New Trends in Modelling, Quantitative methods and Measurements</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Politecnico de Torino</style></PUBLISHER><title><style face="normal" font="default" size="100%">Dynamics of TCP/IP flows in presence of various AQM algorithms, a fluid flow approximation model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</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%">TCP/IP dynamics in wireless environment, a fluid-flow model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Third Workshop on Wireless and Mobility</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Technical University of Catalonia</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">VI</style></DATE><title><style face="normal" font="default" size="100%">TCP/IP dynamics in wireless environment, a fluid-flow model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arkadiusz Sochan</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Samopodobny charakter natężenia ruchu w sieciach komputerowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">22</style></VOLUME><ABSTRACT><style face="normal" font="default" size="100%">Artykuł przedstawia analizę natężenia ruchu pakietów w sieci Ethernet oraz ruchu ramek MPEG-2 w sieci ATM pod kątem występowania cechy zwanej samopodobieństwem. Zamieszczono krótką charakterystykę procesów samopodobnych oraz wnioski wypływające z samopodobnej natury ruchu w sieciach komputerowych.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Samopodobny charakter natężenia ruchu w sieciach komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</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%">Andrzej Grzywak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet w spoleczenstwie informatycznym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WNT</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Mechanizmy zapewniania jakości usług w sieci Internet</style></SECTION><title><style face="normal" font="default" size="100%">Internet w spoleczenstwie informatycznym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</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%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</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%">Współczesne problemy sieci komputerowych Nowe technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WNT</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Wplyw samopodobnej natury ruchu internetowego na działanie mechanizmów jakości usług</style></SECTION><title><style face="normal" font="default" size="100%">Współczesne problemy sieci komputerowych Nowe technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">F. Quessette</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance of a mixed deflection and convergence routing algorithm</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of 2nd Polish-German Teletraffic Symposium PGTS, Gdansk, 22-25 September 2002</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Performance of a mixed deflection and convergence routing algorithm</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Adam Józefiok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Simulation, Markov Chain and Diffusion Approximation Models – a Case Study</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Simulation, Markov Chain and Diffusion Approximation Models – a Case Study</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Adam Józefiok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Porównanie metod analizy efektywności na przykładzie serwera aplikacji w sieci lokalnej</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">32</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3A</style></NUMBER><PAGES><style face="normal" font="default" size="100%">7–20</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">W artykule przedstawiono model kolejkowy służący do oceny funkcjonowania dużego systemu sieciowego, w skład którego wchodzi rozbudowany system bazodanowy. Opisywany system jest systemem rzeczywistym. Zebrane wyniki pracy systemu posłużyły do budowy modelu działania aplikacji interakcyjnych, na podstawie łańcuchów Markova, aproksymacji dyfuzyjnej i symulacji zdarzeń dyskretnych. Porównanie ich z rzeczywistymi wynikami umożliwiło sprawdzenie przdatności użytych metod w rzeczywistych warunkach.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Porównanie metod analizy efektywności na przykładzie serwera aplikacji w sieci lokalnej</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Adam Józefiok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Georgia Sakellari</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance Evaluation of a Multiuser Interactive Networking System: A Comparison of Modelling Methods</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences II</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">215–222</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">This article presents a queueing model for performance evaluation of a large database system at an assurance company. The system includes a server with a database and a local area network with a number of terminals where the company employees run applications that introduce documents or retrieve them from the database. We discuss a model of clients activities. Measurements were collected inside the working system: the phases at each users application performance were identified and their duration was measured. The collected data are used to construct a synthetic model of applications activities which is then applied to predict the system behaviour in case of the growth of the number of users. We apply simulation, Markov and diffusion models-their comparison, based on real data, may better verify the utility of particular methods than usual academic examples.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance Evaluation of a Multiuser Interactive Networking System: A Comparison of Modelling Methods</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Garcia-Vidal</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">l. Cerda-Alabern</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Stability and Dynamics of TCP-NCR(DCR) Protocol</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Computer Systems 4396 - Wireless Systems and Mobility in Next Generation Internet</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">SpringeVerlag</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">241–254</style></PAGES><DATE><style face="normal" font="default" size="100%">5</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The fluid-flow approximation models investigate with much success the dynamics and stability of TCP/RED connections. Their main assumption is that the fluctuations of variables characterizing the behaviour of the connections are relatively small, that enables the linearization of model and the use of traditional control analysis tools to obtain such measures as Bode gain, phase margins, tracking error or delay margin. In this article, preserving linear fluid-flow model, we propose its extension to the case when a network is composed of wired and wireless part. We consider a variant of TCP algorithm (TCP-DCR or its new version TCP-NCR) and fluid-flow differential equations representing the size of congestion window, mean queue at the bottleneck router and loss probability at a RED queue are supplemented with terms representing constant loss probability due to transmission in wireless part and probability that a fraction of these errors is recovered by a link level mechanism. The decrease of congestion window due to TCP mechanism is delayed to allow the link protocol to deal with the errors. The model considers the presence of uncontrollable UDP flows.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Stability and Dynamics of TCP-NCR(DCR) Protocol</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Un modele d’approximation de diffusion pour la distribution du temps d’acheminement des paquets dans les réseaux de senseurs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Colloque francophone sur l’ingénierie des protocoles</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Un modele d’approximation de diffusion pour la distribution du temps d’acheminement des paquets dans les réseaux de senseurs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Estimation of packet transfer time at sensor networks, diffusion approximation approach</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from HET-NETs</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Estimation of packet transfer time at sensor networks, diffusion approximation approach</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">TCP performance for a wireless traffic, a diffusion approxiation model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from Workshop on Wireless and mobility in Future Generation Internet</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">2</style></DATE><title><style face="normal" font="default" size="100%">TCP performance for a wireless traffic, a diffusion approxiation model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Fluid-flow Approximation Model of TCP-NCR in wired-wireless networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from Polish Teletraffic Symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">9</style></DATE><title><style face="normal" font="default" size="100%">Fluid-flow Approximation Model of TCP-NCR in wired-wireless networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A model of TCP flows dynamics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">18</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">279–292</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The fluid flow approximation models investigate with much success the dynamics and stability of TCP/RED connections. Their main assumption is that the fluctuations of variables characterizing the behaviour of the connections are relatively small, that enables the linearization of model and the use of traditional control analysis tools to obtain such measures as Bode gain, phase margins, tracking error or delay margin</style></ABSTRACT><title><style face="normal" font="default" size="100%">A model of TCP flows dynamics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Some contributions to the modelling the dynamics of (TCP,UDP)/RED flows over reliable and unreliable connections</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from HET-NETs 2006</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">9</style></DATE><title><style face="normal" font="default" size="100%">Some contributions to the modelling the dynamics of (TCP,UDP)/RED flows over reliable and unreliable connections</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</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%">Modeling the IEEE 802.11 Networks MAC Layer Using Diffusion Approximation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceeding of HET-NETs 2010</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">429–442</style></PAGES><DATE><style face="normal" font="default" size="100%">1</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">Abstract: The article presents an analytical model of wireless networks using the IEEE 802.11 protocol to access the transport medium. The model allows to determine such key factors of the quality of service as transmission delays and losses. The model is based on diffusion approximation approach which was proposed three decades ago to model wired networks. We show that it can be adapted to take into consideration the input streams with general interarrival time distributions and servers with general service time distributions. The diffusion approximation has been chosen because of fairly general assumptions of models based on it, hard to be represented in Markov models. A queueing network model can have an arbitrary topology, the intensity of transmitted flows can be represented by non-Poisson (even self-similar) streams, the service times at nodes can be defined by general distributions. These assumptions are important: because of the CSMA/CA algorithm, the overall times needed to sent a packet are far from being exponentially distributed and therefore the flows between nodes are non-Poisson. Diffusion approximation allows us also to analyse the of transient behaviour of a network when traffic intensity is changing with time.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modeling the IEEE 802.11 Networks MAC Layer Using Diffusion Approximation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Duration of boot-up storm period</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">17th Polish teletraffic symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">145–150</style></PAGES><DATE><style face="normal" font="default" size="100%">12</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The simultaneous boot of multiple virtual machines or networking devices imposes heavy load on the networking infrastructure. In large network of virtual machines the coordination of the reboots and the device registration is required. In the paper we present a simple analytical model to compute the distribution of boot-up time. The model is verified by comparison to a simulation model, and may be used to check the influence of several parameters on the overall boot-up time during a boot storm.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Duration of boot-up storm period</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A diffusion approximation model for wireless networks based on IEEE 802.11 standard, Computer Communication Journal</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Communication Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">33</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">S1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">S86–S92</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The article presents an analytical model of wireless networks using the IEEE 802.11 protocol to access the transport medium. The model allows to determine such key factors of the quality of service as transmission delays and losses. The model is based on diffusion approximation approach which was proposed three decades ago to model wired networks. We show that it can be adapted to take into consideration the input streams with general interarrival time distributions and servers with general service time distributions. The diffusion approximation has been chosen because of fairly general assumptions of models based on it, hard to be represented in Markov models. A queueing network model can have an arbitrary topology, the intensity of transmitted flows can be represented by non-Poisson (even self-similar) streams, the service times at nodes can be defined by general distributions. These assumptions are important: because of the CSMA/CA algorithm, the overall times needed to sent a packet are far from being exponentially distributed and therefore the flows between nodes are non-Poisson. Diffusion approximation allows us also to analyse the of transient behaviour of a network when traffic intensity is changing with time.</style></ABSTRACT><title><style face="normal" font="default" size="100%">A diffusion approximation model for wireless networks based on IEEE 802.11 standard, Computer Communication Journal</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Jędruś</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Zakrzewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Gozdecki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Pacyna</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">S. Rahman</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Multimedia Networking: Technology, Management and Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Hershey, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Idea Group Publishing</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">QoS-Aware Digital Video Retrieval Application</style></SECTION><title><style face="normal" font="default" size="100%">Multimedia Networking: Technology, Management and Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</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%">Symulacyjne Badanie routingu w sieciach optycznych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2A</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">48</style></NUMBER><PAGES><style face="normal" font="default" size="100%">45–58</style></PAGES><title><style face="normal" font="default" size="100%">Symulacyjne Badanie routingu w sieciach optycznych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">V. Vishnevsky</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling Transient States in Queueing Models of Computer Networks: A Few Practical Issues</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Distributed Computer and Communication Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">58–72</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The article summarises author`s experience in two problems related to the use of queueing models in performance evaluation of computer networks: modelling transient states of queues and computations for queueing network models having large number of nodes. Both issues are not well represented in classical queuing theory, yet important to applications, because the observed traffic is time dependant and network topologies that should be considered become larger and larger. The article discusses two approaches: diffusion approximation and fluid-flow approximation that can cope with much larger models that are attainable with the use of Markov chains.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">17th International Conference, DCCN 2013 Moscow, Russia, October 7-10, 2013</style></NOTES><title><style face="normal" font="default" size="100%">Modelling Transient States in Queueing Models of Computer Networks: A Few Practical Issues</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet and real-time performance: a web server model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of 9th Conf. on Real-Time Systems, Ustroń, 16-19 September 2002</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Internet and real-time performance: a web server model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">D.D. Kouvatsos</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Approximation as a modelling tool in congestion control and performance evaluation, tutorial</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of HET-NETs '04, Performance Modelling and Evaluation of Heterogenous Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Diffusion Approximation as a modelling tool in congestion control and performance evaluation, tutorial</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</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%">Wysokowydajne sieci komputerowe, Nowe Technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Model pracy elektroniczno-optycznego węzła brzegowego, wykorzystanie aproksymacji dyfuzyjnej</style></SECTION><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe, Nowe Technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Approximation as a Modelling Tool, chapter in: Network Performance Engineering, A Handbook on Convergent Multi-Service Networks and Next Generation Internet, St</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">LNCS , Springer</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">5233</style></VOLUME><PAGES><style face="normal" font="default" size="100%">447–476</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Diffusion theory is already a vast domain of knowledge. This tutorial lecture does not cover all results: it presents in a coherent way an approach we have adopted and used in analysis of a series of models concerning evoluation of some traffic control mechanisms in computer, especially ATM, networks. Diffusion approximation is presented from engineer`s point of view, stressing its utility and commenting numerical problems of its implementation. Diffusion approximation is a method to model the behavior of a single queueing station or a network of stations. It allows one to include in the model general sevice times, general (also correlated)input streams and to investigate transient states, which, in presence of bursty streams (e.g. of multimedia transfers) in modern networks, are of interest.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Diffusion Approximation as a Modelling Tool, chapter in: Network Performance Engineering, A Handbook on Convergent Multi-Service Networks and Next Generation Internet, St</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A diffusion approximation model of an electronic-optical node</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">LNCS, Formal Techniques for Computer Systems and Bisiness Proesses</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><NUMBER><style face="normal" font="default" size="100%">3670</style></NUMBER><PAGES><style face="normal" font="default" size="100%">187–199</style></PAGES><title><style face="normal" font="default" size="100%">A diffusion approximation model of an electronic-optical node</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A novel diffusion process with jumps to study an electronic-optical edge router</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej I Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">17</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">87–100</style></PAGES><title><style face="normal" font="default" size="100%">A novel diffusion process with jumps to study an electronic-optical edge router</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion approximation: modelling transient flows of multiclass queueing networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of International Network Optimization Conference, INOC'03, Oct. 27-29, 2003 Evry, France</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Diffusion approximation: modelling transient flows of multiclass queueing networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A diffusion approximation model of Web servers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of WITASI02, 1st IFIP Workshop on Internet Technologies, Applications and Societal Impact, Wrocław, October 10-11, 2002</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">A diffusion approximation model of Web servers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling New Congestion Control Mechanisms TCP/IP Internet Protocols</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of International Conference on Control AUTOMATICS 2001, Odessa, Ukraine, 10-15 September 2001.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Modelling New Congestion Control Mechanisms TCP/IP Internet Protocols</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">B. Szady</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Forming optical packets, a diffusion approximation and simulation models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. Second EuoNGI Workshop on New Methods in Modelling, Quantitative Methods and Measurements, Aveiro, Porugal, November 24-25, 2005</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Forming optical packets, a diffusion approximation and simulation models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">B. Szady</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Forming optical packets, a diffusion approximation model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of 12th Polish Teletraffic Symposium PSRT2005, Poznan, 20-21 September 2005.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Forming optical packets, a diffusion approximation model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</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%">Traffic Engineering: Erlang and Engset Models Revisited with Diffusion Approximation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Information Sciences and Systems 2014</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">249–256</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Classical Erlang and Engset formulae determining the availability of channels, loss probability, and characteristics of overflow traffic are still use in telecommunications. Moreover, they are also interesting for traffic management in mobile networks and in Internet. They are based on the assumption of Poisson flows and exponentially distributed time of connections. By means of diffusion approximation queuing models, we extend these results to the case of general distributions and transient state analysis.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Traffic Engineering: Erlang and Engset Models Revisited with Diffusion Approximation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">D. Barth</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Berthome</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ch. Laforest</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">S. Vial</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Mixed Deflection and Convergence Routing Algorithm: Design and Performance</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of Euro-Par 2002, 27-30 August 2002, Padeborn University, Padeborn, Germany</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">A Mixed Deflection and Convergence Routing Algorithm: Design and Performance</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wpływ samopodobnej natury ruchu na zachowanie mechanizmu cieknącego wiadra</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2A (53)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">199–212</style></PAGES><title><style face="normal" font="default" size="100%">Wpływ samopodobnej natury ruchu na zachowanie mechanizmu cieknącego wiadra</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Model formowania pakietów w węźle brzegowym sieci optycznej</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2A (53)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">51–61</style></PAGES><title><style face="normal" font="default" size="100%">Model formowania pakietów w węźle brzegowym sieci optycznej</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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%">S. Balandin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet Traffic Source Vased on Hidden Markov Model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Smart spaces and Next Generation Wired/Wireless Networking</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">395–404</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">This article shows how to use Hidden Markov Models to generate self-similar traffic. The well-known Bellcore traces are used as a training sequence to learn HMM model parameters. Performance of trained model are tested on the remaining portions of the sequence. Then we can use the HMM trained with the Bellcore data as the traffic source model.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Internet Traffic Source Vased on Hidden Markov Model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A few investigations of long-range dependence in network traffic</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Information Science and Systems 2014</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">137–144</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The paper presents measurements and analysis of a LAN long-range dependence traffic collected in IITiS PAN (The Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences). Several methods of Hurst parameter estimation were used, the results obtained by the methods differ substantially. The analysis was made for the whole traffic and traffics generated by particular types of protocols. We seek for a dependence of Hurst parameter on a protocol type. Then, a MMPP(Markov-Modulated Poisson Process) model was applied to mimic the traces. It allows us to consider Markovian queueing models with long-range dependent and self-similar traffic, an important factor as we dispose an efficient software tool to solve numerically very large continuous-time Markov chains.</style></ABSTRACT><title><style face="normal" font="default" size="100%">A few investigations of long-range dependence in network traffic</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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%">Piotr Gaj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Estimating the intensity of long-range dependence in real and synthetic traffic traces.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">11–22</style></PAGES><NOTES><style face="normal" font="default" size="100%">22nd International Conference, CN 2015 Brunów, Poland, June 16-19, 2015</style></NOTES><title><style face="normal" font="default" size="100%">Estimating the intensity of long-range dependence in real and synthetic traffic traces.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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%">Alexander Dudin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valentina Klimenok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gennadiy Tsarenkov</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sergey Dudin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Fluid Flow Analysis of RED Algorithm with Modified Weighted Moving Average</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Modern Probabilistic Methods for analysis of Telecommunication Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">50–58</style></PAGES><DATE><style face="normal" font="default" size="100%">1</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">We study with the use of fluid flow approximation the impact of a modified weighted moving average on the performance of RED mechanism. A model of TCP/UDP connection with RED implemented in an intermediate IP router is used, the weighted moving average is determined on the basis of a difference (recursive) equation. The fluid flow approximation technique is applied to model the interactions between the set of TCP/UDP flows and RED mechanism.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 2013</style></NOTES><title><style face="normal" font="default" size="100%">Fluid Flow Analysis of RED Algorithm with Modified Weighted Moving Average</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wyższa Szkoła Biznesu w Dąbrowie Górniczej</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Aktywne zarządzanie ruchem pakietów dla multimedialnych strumieni danych</style></SECTION><title><style face="normal" font="default" size="100%">Podstawy Budowy i Oprogramowania Sieci Typu Internet</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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 Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modeling Packet Traffic with the Use of Superpositions of Two-State MMPPs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">24–36</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The aim of this paper is to use the superposition of two-state Markov Modulated Poisson Processes to replicate the statistical nature of internet traffic over several time scales. This paper characterizes of network traffic using Bellcore data and LAN traces collected in IITiS PAN. The fitting procedure for matching second-order self-similar properties of real data traces to that of two-state MMPP`s has also been described.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">21th International Conference, Computer Networks 2014 Brunów, Poland, June 23-27, 2014</style></NOTES><title><style face="normal" font="default" size="100%">Modeling Packet Traffic with the Use of Superpositions of Two-State MMPPs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A HMM network traffic model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">17–20</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The article proposes a description of Internet traffic based on Hidden Markov Model. The model refers to packet level traffic and is validated with the use of real traffic collected in our laboratory. A part of the gathered traces is used as a training sequence to learn HMM model parameters an the rest serves as testing sequences.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">International Conference on Networking and Future Internet (ICNFI 2012)</style></NOTES><title><style face="normal" font="default" size="100%">A HMM network traffic model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Implementation of modified AQM mechanisms in IP routers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Communications Software and Systems</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">4</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><DATE><style face="normal" font="default" size="100%">03</style></DATE><title><style face="normal" font="default" size="100%">Implementation of modified AQM mechanisms in IP routers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Drop-From-Front Strategy in AQM</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Computer Science, Springer Berlin</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">4712</style></VOLUME><PAGES><style face="normal" font="default" size="100%">61–72</style></PAGES><title><style face="normal" font="default" size="100%">The Drop-From-Front Strategy in AQM</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The influence of traffic self-similarity on QoS Mechanisms</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of SAINT 2005 Workshops, 31 January – 4 February 2005, Trento, Italy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">300–303</style></PAGES><title><style face="normal" font="default" size="100%">The influence of traffic self-similarity on QoS Mechanisms</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Self-similarity of network traffic and the performances of QoS mechanisms</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">16</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">337–349</style></PAGES><title><style face="normal" font="default" size="100%">Self-similarity of network traffic and the performances of QoS mechanisms</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">62</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">217–225</style></PAGES><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><title><style face="normal" font="default" size="100%">Flluid flow approximation of time-limited TCP/UDP/XCP streams.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><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%">T. Atmaca</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%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Komunikacji i Łączności</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Mechanizm optycznego przełączania ciągów danych</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">I. Kotuliak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</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%">Optical packet filling</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. 10th Polish Teletraffic Symposium, Kraków 18-19 Sept. 2003</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">419–429</style></PAGES><title><style face="normal" font="default" size="100%">Optical packet filling</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Comparison of CHOKe and gCHOKe active queues managemant algirithms with the use of fluid flow approximation.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">363–371</style></PAGES><DATE><style face="normal" font="default" size="100%">6</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">In the article we examine a model of TCP connection with Active Queue Managemanet in an intermediate IP router. We model a system where CHOKe or gCHOKe are the AQM policy. We use the fluid flow approximation technique to model the interactions between the set of TCP/UDP flows and two variants of the CHOKe algoithms. The obtained results confirm the superiority of these algorithms over a standard RED algorithm.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Comparison of CHOKe and gCHOKe active queues managemant algirithms with the use of fluid flow approximation.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Computer Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">291</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Comparison of AQM control systems with the use of fluid flow approximation</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-3-642-31216-8</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">In the article we study a model of TCP/UDP connection with Active Queue Management in an intermediate IP router. We use the fluid flow approximation technique to model the interactions between the set of TCP/UDP flows and AQM. We model a system where RED or NLRED are the AQM policy.The obtained results confirm the advantage of our NLRED algorithm</style></ABSTRACT><title><style face="normal" font="default" size="100%">Computer Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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%">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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">41-300 Dąbrowa Górnicza Cieplaka Str. 1c</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Academy od Business in Dabrowa Gornicza</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Active queues management algorithms, an analysis with the use of fluid flow approximation in CUDA en</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-83-62897-40-7</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">In the article we study a model of the TCP connection with Active Queue Management in the intermediate bottleneck IP router. The fluid flow approximation technique is used to model the interactions between the set of TCP flows and AQM algorithms. The numerical part of the model is run in CUDA environment.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Internet in the Information Society Computer Systems Architecture and Security</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Badanie mechanizmów kontroli przeciążenia w TCP zaimplementowanych w systemie operacyjnym Linux</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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%">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%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Projekt i implementacja modułu kolejkowego systemu Standardowego Interfejsu Central Cyfrowych (SICC)</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">GCU-Accelerated fluid flow approximation of the Active Queues Management algorithms</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">25</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">93–104</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">In the article we study a model of TCP connection with Active Queue Management in an intermediate IP router. We use the fluid flow approximation technique to model the interactions between the set of TCP flows and AQM algorithms. Computations for fluid flow approximation model are performed in the CUDA environment.</style></ABSTRACT><title><style face="normal" font="default" size="100%">GCU-Accelerated fluid flow approximation of the Active Queues Management algorithms</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The impact of self-similarity on traffic shaping in wireless LAN</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Computer Science, Springer Berlin</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">The impact of self-similarity on traffic shaping in wireless LAN</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet 2005</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Wrocław</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Oficyna Wydawnicza Politechniki Wrocławskiej</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Mechanizmy zapewnienia jakości usług w Internecie w ramach architektury integrated service</style></SECTION><title><style face="normal" font="default" size="100%">Internet 2005</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">F. Kłębczyk</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Some aspects of QoS in wireless LAN</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Some aspects of QoS in wireless LAN</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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%">F. Kłębczyk</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Sieci Komputerowe</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Suitability study of Differentiated Service for Quality of Service in wireless LAN</style></SECTION><title><style face="normal" font="default" size="100%">Sieci Komputerowe</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">Sławomir Nowak</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%">A contribution to the fair scheduling for the TCP and UDP streams</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science 79</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">A contribution to the fair scheduling for the TCP and UDP streams</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Gawron</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Urszula Stańczyk</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Eigengestures for natural human computer interface</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Man-Machine Interactions 2</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin / Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">49–56</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-642-23168-1</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">We present the application of Principal Component Analysis for data acquired during the design of a natural gesture interface. We investigate the concept of an eigengesture for motion capture hand gesture data and present the visualisation of principal components obtained in the course of conducted experiments. We also show the influence of dimensionality reduction on reconstructed gesture data quality.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1105.1293</style></NOTES><title><style face="normal" font="default" size="100%">Eigengestures for natural human computer interface</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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%">Arkadiusz Sochan</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A tool for network traffic generation and transmission delay measurement</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of 8th Polish Teletraffic Symposium</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><title><style face="normal" font="default" size="100%">A tool for network traffic generation and transmission delay measurement</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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%">A. Busic</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Simulation Analysis of Deflection Routing in Hypercube</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from Polish Teletraffic Symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">9</style></DATE><title><style face="normal" font="default" size="100%">Simulation Analysis of Deflection Routing in Hypercube</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arkadiusz Sochan</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%">Internet w społeczeństwie informacyjnym - Podstawowe problemy Internetu</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Naukowo-Techniczne</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Badania symulacyjne pakietowych sieci optycznych o dowolnych topologiach</style></SECTION><title><style face="normal" font="default" size="100%">Internet w społeczeństwie informacyjnym - Podstawowe problemy Internetu</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><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><title><style face="normal" font="default" size="100%">Numerical Model of Tcp in 802.16 Networks Using Fluid Flow Approximation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">H. Elbiaze</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</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%">Blind shaping strategy of self-similar traffic: Markovian model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">13–25</style></PAGES><title><style face="normal" font="default" size="100%">Blind shaping strategy of self-similar traffic: Markovian model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Applications and the Internet</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE Computer Society Press</style></PUBLISHER><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><title><style face="normal" font="default" size="100%">Modelling TCP Connection in WIMAX Network Using Fluid Flow Approximation.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Performance Modelling and Evaluation of Heterogeneous Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Institute of Theoretical and Applied Informatics of the Polish Academy o Sciences</style></PUBLISHER><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><NOTES><style face="normal" font="default" size="100%">HET-NETs 2010 Zakopane, January 14th - 16th, 2010</style></NOTES><title><style face="normal" font="default" size="100%">Examination of robust stability of computer networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Przemysław Kowalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Pojda</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Gruca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Visualization of heterogenic images of 3D scene</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Man-Machine Interacions 3</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Silesian University of Technology, Gliwice, Institute of Theoretical and Applied Informatics, Polish Academy of Science, Gliwice</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">291–297</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The article presents a problem of 3D and 2D heterogenic data visualization. The data come from different devices installed on the robot platform. The data include 3D point cloud, 2D images, 3D and 2D occupancy grids, obtained from laser scanning device, stereocameras and calculated using data from laser 3D scanner.&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">ICMMI 2013 International Conference on Man-Machine Interactions Brenna, October 22-25, 2013</style></NOTES><title><style face="normal" font="default" size="100%">Visualization of heterogenic images of 3D scene</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</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%">An analysis of the extracted parts of Opte Internet topology.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">371–381</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The paper defines a method to extract a part of a graph, which corresponding to a network (Internet) topology covering a certain area. The method refers to data gathered within Opte Project and describing the Internet topology. The extracted parts of graphs have been analyzed in terms of the number of neighbours, longest path length and existence of cycles. Then the resulting topologies are used to model transient behaviour of wide area networks with the use of fluid-flow approximation.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">22nd International Conference, CN 2015 Brunów, Poland, June 16-19, 2015</style></NOTES><title><style face="normal" font="default" size="100%">An analysis of the extracted parts of Opte Internet topology.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">M.M. Nycz</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%">Modelowanie dynamiki przesyłów TCP/IP z uwzględnieniem mechanizmu RED</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">33</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3! (107)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">49–62</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">W pracy przedstawiono wyniki modelowania wybranych scenariuszy współczesnych sieci komputerowych. W badaniach zastosowano model matematyczny aproksymacji fluid flow, opisujący wpływ zmiennego w czasie natężenia ruchu pakietów na przełączniki sieciowe i generowanie strat pakietowych, zgodnie z założeniami mechanizmu RED stosowanego w routerach. Przeprowadzone doświadczenia obejmowały wpływ początkowych ustawień parametrów na zachowanie układu.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelowanie dynamiki przesyłów TCP/IP z uwzględnieniem mechanizmu RED</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">M.M. Nycz</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%">Modelling transient TCP flows with the use of fluid flow approximation - a numerical study</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">181–184</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">This article presents the problem of modeling the basic elements of the transport system of the modern computer networks. The study of selected issues of the network topology uses a mathematical model of fluid flow approximations, which is based on mean value analysis. The model describes the effects of time varying packet traffic on the network switches and packet loss generation by the assumptions of active queue management mechanisms used in routers. The computations are due to our new software tool.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%"/></NOTES><title><style face="normal" font="default" size="100%">Modelling transient TCP flows with the use of fluid flow approximation - a numerical study</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kwiecień</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%">Contemporary aspects of computer networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WKiŁ</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Concept of new synchronisation method for wireless networks distribiuted simulation</style></SECTION><title><style face="normal" font="default" size="100%">Contemporary aspects of computer networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</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%">QoS management for multimedia traffic in synchronous slotted-ring OPS networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of HET-NETs 2010 Conference</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">143–152</style></PAGES><DATE><style face="normal" font="default" size="100%">1</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The paper presents synchronous slotted-ring network with optical packet switching. The network is equipped with quality of service management, particularly considering multimedia transfers. Thanks to proposed mechanism of guarantees, multimedia data are delivered with guaranteed delay time, not greater than assumed, and in the case the delivery on time is impossible – they are removed, freeing place for remaining packets.</style></ABSTRACT><title><style face="normal" font="default" size="100%">QoS management for multimedia traffic in synchronous slotted-ring OPS networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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%">Bolesław Pochopień</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%">Nanotechnologi i nanoinformatyka, Rozdział w książce Współczesne problemy sieci komputerowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Naukowo Technicze</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Nowe technologie: Nanotechnologi i nanoinformatyka</style></SECTION><NOTES><style face="normal" font="default" size="100%">Praca finansowana z grantu KBN 7 T11 C 01721</style></NOTES><title><style face="normal" font="default" size="100%">Nanotechnologi i nanoinformatyka, Rozdział w książce Współczesne problemy sieci komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Simulation models of fair scheduling for the TCP and UDP streams</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">HET-NETs 2010</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Simulation models of fair scheduling for the TCP and UDP streams</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</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%">Parallel simulation of networks with packet loss</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">14th Polish Teletraffic Symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITiS PAN</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">9</style></DATE><title><style face="normal" font="default" size="100%">Parallel simulation of networks with packet loss</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</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%">Wysokowydajne sieci komputerowe</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WKiŁ</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Nowe Technologie: Systemy operacyjne w układach technoligii molekularnych</style></SECTION><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</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><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analytical and numerical means to model transient states in computer networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">426–435</style></PAGES><DATE><style face="normal" font="default" size="100%">6</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">Transient queue analysis is needed to model the influence of time-dependent flows on congestion in computer networks. It may be applied to the networks performance evaluation and the analysis of the transmissions quality of service. However, the exact queuing theory gives us only few practically useful results, concerning mainly M/M/1 and M/M/1/N queues. The article presents potentials of three approaches: Markovian queues solved numerically, the diffusion approximation, and fluid-flow approximation. We mention briefly a software we implemented to use these methods and summarise our experience with it.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Analytical and numerical means to model transient states in computer networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deorowicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Urszula Stańczyk</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Man-Machine Interaction 2</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Advances in Intelligent and Soft Computing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">103</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Efficient representation of transition Matrix in the Markov process modeling of computer networks</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-3-642-23168-1</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">Markov chains are used in analysis in many fields. One of them is performance evaluation of computer systems, especially computer networks. For the analysis we use OLYMP object library that provides features to describe complex systems and find their statistical parameters. We present two compressed data structures for the most space-consuming parts of data processed by OLYMP. Then, we show how these improvements move the barrier of applicability of the utility.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Man-Machine Interaction 2</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">D. Augustyn</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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Active Queue Management with non-linear packets dropping function</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Performance Modelling and Evaluation of Heterogeneous Networks Proceedings of 6th Working International Conference</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">133–142</style></PAGES><DATE><style face="normal" font="default" size="100%">1</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">Abstract: Algorithms of queue management in IP routers determine which packet should be deleted when necessary. The article investigates the influence of packet rejection probability function on the performance, i.e. response time for in case of RED and nRED queues. In particular, the self-similar traffic is considered. The quantitative analysis based on simulations is shown.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Active Queue Management with non-linear packets dropping function</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">R. Laalaoua</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Jędruś</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Model of RED Control Mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of International Conference on Networking ICN01, July 9-13, 2001, CREF, Universite de Haute Alsace, Colmar, France</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Diffusion Model of RED Control Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">R. Laalaoua</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion approximation and markovian models of RED control mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">343–354</style></PAGES><title><style face="normal" font="default" size="100%">Diffusion approximation and markovian models of RED control mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">R. Laalaoua</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Markovian Model of RED Mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of CCGrid 2001, IEEE International Symposium on Cluster Computing, 15-18 May 2001, Brisbane, Australia</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Markovian Model of RED Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Skabek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Płoszaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Gruca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Implementation of registration algorithms for multiple views</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Man-Machine Interacions 3</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Silesian University of Technology, Gliwice, Institute of Theoretical and Applied Informatics, Polish Academy of Science, Gliwice</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">315–323</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The article discusses the implementation of algorithms for registration and multiregistration of scans. The multiregistration strategies of mesh sequences for different scanning views were proposed and compared. The comparison criteria comprise parameters of the registration process such as: the accuracy of scan matching, performance, complexity of registration.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">ICMMI 2013 International Conference on Man-Machine Interactions Brenna, October 22-25, 2013</style></NOTES><title><style face="normal" font="default" size="100%">Implementation of registration algorithms for multiple views</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Skabek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</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%">Wysokowydajne sieci komputerowe Nowe Technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WKiŁ</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Wykorzystanie skanera 3D do tworzenia obiektów wirtualnych</style></SECTION><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe Nowe Technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ireneusz Szcześniak</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%">OPUS Software for Performance Evaluation of Optical Packet-Switched Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">XII Konferencja Sieci Komputerowe</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">OPUS Software for Performance Evaluation of Optical Packet-Switched Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ireneusz Szcześniak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</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%">Wysokowydajne sieci komputerowe. Nowe Technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Oprogramowania OPUS do oceny wydajności sieci komunikacyjnych z optycznym przełączaniem pakietów</style></SECTION><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe. Nowe Technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ireneusz Szcześniak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Packet Loss Analysis in Optical Packet-Switched Networks with Limited Deflection Routing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Photonic Network Communications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><NOTES><style face="normal" font="default" size="100%">przyjęte do publikacji</style></NOTES><title><style face="normal" font="default" size="100%">Packet Loss Analysis in Optical Packet-Switched Networks with Limited Deflection Routing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ireneusz Szcześniak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</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%">Preliminary results of packet loss analysis in optical packet-switched networks with limited deflection routing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of SAINT 2005 Workshops, 31 January - 4 February 2005, Trento, Italy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">296–299</style></PAGES><title><style face="normal" font="default" size="100%">Preliminary results of packet loss analysis in optical packet-switched networks with limited deflection routing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</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><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ferhan Pekergin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">R. Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A model of boot-up storm dynamics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences III</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">London</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">371–379</style></PAGES><DATE><style face="normal" font="default" size="100%">10</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The simultaneous boot of multiple virtual machines or networking devices imposes heavy load on the networking infrastructure. In large network of many virtual machines the coordination of the reboots and device registration is required. In the paper we present a simple analytical model computing the distribution of boot-up time, which is verified by comparison to a simulation model and provide analysis of the influence of several parameters on the overall boot-up time during a boot storm.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">27th International Symposium of Computer and Information Sciences, Brenna,Poland, October 22-15, 2013</style></NOTES><title><style face="normal" font="default" size="100%">A model of boot-up storm dynamics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">T. Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">R. Laalaoua</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Badanie dynamiki algorytmu RED</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2A (48)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">223–234</style></PAGES><title><style face="normal" font="default" size="100%">Badanie dynamiki algorytmu RED</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</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%">Badanie skalowalności modeli sieci komputerowych wykorzystujących aproksymację dyfuzyjną wraz ze zwiększeniem rozmiaru modelowanej sieci</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studoa Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">33</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3A (107)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">63–78</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Zmienne natężenie ruchu generowanego przez aplikacje internetowe, np. multimedialne, a także przyjęta przez protokół TCP zasada regulacji natężenia transmisji w funkcji wykrytego obciążenia sieci, określanego na podstawie strat lub czasu transmisji, powodują, że natężenie transmisji internetowych jest permanentnie zmienne w czasie, a zmiany natężenia i dynamika tych zmian muszą być uwzględnione w ocenie algorytmów sterowania ruchem i unikania przeciążeń. Modelowanie struktur w Internecie wymaga z kolei dostosowania istniejących metod i modeli do analizy bardzo dużych konfiguracji sieciowych. Niniejsza praca bada pod kątem obliczeń numerycznych znany model matematyczny, umożliwiający analizę stanów nieustalonych w stanowisku obsługi i ich sieci, wykorzystujący metodę aproksymacji dyfuzyjnej. Zbadano wpływ poszczególnych parametrów modelu i rozmiaru sieci na całkowity czas obliczeń, a więc na skalowalność metody.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Badanie skalowalności modeli sieci komputerowych wykorzystujących aproksymację dyfuzyjną wraz ze zwiększeniem rozmiaru modelowanej sieci</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">T. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</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><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Numerical Comparison of Diffusion and Fluid-Flow Approximations Used in Modelling Transient States of TCP/IP Networks.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">213–222</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The paper presents a comparison of two approaches to queuing models used in performance evaluation of computer networks: diffusion approximation and fluid-flow approximation. Both methods are well known and are used alternatively in similar problems but the differences between their results and the errors they introduce when applied to TCP driven time dependent flows were not sufficiently investigated.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">21st International Conference, CN 2014 Brunów, Poland, June 23-27, 2014</style></NOTES><title><style face="normal" font="default" size="100%">A Numerical Comparison of Diffusion and Fluid-Flow Approximations Used in Modelling Transient States of TCP/IP Networks.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</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%">Technologie molekularne realizowane przez molekularne systemy informatyczne</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe: Nowe Technologie</style></SECTION><title><style face="normal" font="default" size="100%">Technologie molekularne realizowane przez molekularne systemy informatyczne</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego</style></PUBLISHER><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><title><style face="normal" font="default" size="100%">Kwantowe systemy informatyki</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Lech Znamirowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</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%">Wysokowydajne sieci komputerowe. Nowe technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Dwufazowy algorytm wyznaczania konformacji nanostruktur</style></SECTION><ISBN><style face="normal" font="default" size="100%">ISBN 83-206-1573-9</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">W procesach budowy obiektów w dziedzinie informatycznej technologii wytwarzania, jedną z możliwych metod jest wykorzystanie molekularnego programu określającego budowę obiektu, który powstaje na bazie współdziałających, molekularnych narzędzi realizujących program. Analiza działania sieci współpracujących nanostruktur wymaga znajomości konformacji początkowych lub konformacji występujących w sieci w wyniku współdziałania z innymi nanostrukturami. W rozdziale rozpatruje się zagadnienie wyznaczania konformacji dla polipeptydu określonego jego kodem zapisanym w DNA w przypadku powstawania w rybosomie lub w wyniku współdziałania z tzw. białkiem opiekuńczym w fazie innej niż faza powstawania. Przedstawiony został bezgradientowy, dwufazowy algorytm wyznaczania konformacji poprzez obliczenie kątów torsyjnych dla łańcucha aminokwasów. Rozważania zilustrowano przykładem numerycznym.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe. Nowe technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Lech Znamirowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</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%">Współczesne problemy sieci komputerowych. Nowe technologie</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WNT</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Przełączanie konformacyjne w nanoprocesach</style></SECTION><ISBN><style face="normal" font="default" size="100%">83-204-3010-0</style></ISBN><title><style face="normal" font="default" size="100%">Współczesne problemy sieci komputerowych. Nowe technologie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">R. Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum Queuing Networks Throughput Optimisation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ISCIS 29th Annual Symposium</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">X</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-319-09464-9</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">We study models of quantum queues based on discrete time quantum walks with barriers. Our considerations refer to multi-servers queuing models. Input and output of jobs in the queue are realized by systems consisting of quantum coins and walkers. We show that presented models behave differently from the classical ones. We also present numerical methods for optimisation of jobs processed by the system. We simultaneously maximise jobs throughput in the system and minimise the number of jobs lost.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Quantum Queuing Networks Throughput Optimisation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arkadiusz Sochan</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">8th Polish Teletraffic Symposium (Editor)</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Instytut Informatyki Teoretycznej i Stosowanej PAN</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">09</style></DATE><ISBN><style face="normal" font="default" size="100%">83-86644-90-7</style></ISBN><title><style face="normal" font="default" size="100%">8th Polish Teletraffic Symposium (Editor)</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</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%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Study of IP Router Queues with the Use of Markov Models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Brunów, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">608</style></VOLUME><PAGES><style face="normal" font="default" size="100%">294-305</style></PAGES><title><style face="normal" font="default" size="100%">A Study of IP Router Queues with the Use of Markov Models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Omer Abdelrahman</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gokce Gorbil</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling Dynamics of TCP Flows in Very Large Network Topologies</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Information Sciences and Systems 2015: 30th International Symposium on Computer and Information Sciences (ISCIS 2015)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">251–259</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-22635-4</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-22635-4_23</style></URL><title><style face="normal" font="default" size="100%">Modelling Dynamics of TCP Flows in Very Large Network Topologies</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Johan Arcile</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jean-Yves Didier</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Hanna Klaudel</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Gruca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Agnieszka Brachman</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</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%">Modelling and Analysing Mixed Reality Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Man–Machine Interactions 4: 4th International Conference on Man–Machine Interactions, ICMMI 2015 Kocierz Pass, Poland, October 6–9, 2015</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">3–17</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-23437-3</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-23437-3_1</style></URL><title><style face="normal" font="default" size="100%">Modelling and Analysing Mixed Reality Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Impact of the Degree of Self-Similarity on the NLREDwM Mechanism with Drop from Front Strategy</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">608</style></VOLUME><PAGES><style face="normal" font="default" size="100%">192–203</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-39207-3</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-39207-3_17</style></URL><title><style face="normal" font="default" size="100%">The Impact of the Degree of Self-Similarity on the NLREDwM Mechanism with Drop from Front Strategy</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</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%">Michele Pagano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Delays in IP Routers, a Markov Model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">659</style></VOLUME><PAGES><style face="normal" font="default" size="100%">185–192</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-47217-1</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-47217-1_20</style></URL><title><style face="normal" font="default" size="100%">Delays in IP Routers, a Markov Model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">Michele Pagano</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%">The Fluid Flow Approximation of the TCP Vegas and Reno Congestion Control Mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">659</style></VOLUME><PAGES><style face="normal" font="default" size="100%">193–200</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-47217-1</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-47217-1_21</style></URL><title><style face="normal" font="default" size="100%">The Fluid Flow Approximation of the TCP Vegas and Reno Congestion Control Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Global Queue Pruning Method for Efficient Broadcast in Multihop Wireless Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences: 31st International Symposium, ISCIS 2016, Kraków, Poland, October 27–28, 2016, Proceedings</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">214–224</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-47217-1</style></ISBN><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-47217-1_23</style></URL><title><style face="normal" font="default" size="100%">Global Queue Pruning Method for Efficient Broadcast in Multihop Wireless Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences ISCIS 2016</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in computer Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">659</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">659</style></NUMBER><PAGES><style face="normal" font="default" size="100%">500</style></PAGES><EDITION><style face="normal" font="default" size="100%">Springer</style></EDITION><title><style face="normal" font="default" size="100%">Computer and Information Sciences ISCIS 2016</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anastasios Drosou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Research and innovation action for the security of the internet of things: The SerIoT project</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"> Communications in Computer and Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">London, United Kingdom</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">821</style></VOLUME><PAGES><style face="normal" font="default" size="100%">101-118</style></PAGES><SECTION><style face="normal" font="default" size="100%">101</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-331995188-1</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Internet of Things (IoT) was born in the mid 2010’s, when the threshold of connecting more objects than people to the Internet, was crossed. Thus, attacks and threats on the content and quality of service of the IoT platforms can have economic, energetic and physical security consequences that go way beyond the traditional Internet’s lack of security, and way beyond the threats posed by attacks to mobile telephony. Thus, this paper describes the H2020 project “Secure and Safe Internet of Things” (SerIoT) which will optimize the information security in IoT platforms and networks in a holistic, cross-layered manner (i.e. IoT platforms and devices, honeypots, SDN routers and operator’s controller) in order to offer a secure SerIoT platform that can be used to implement secure IoT platforms and networks anywhere and everywhere.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Research and innovation action for the security of the internet of things: The SerIoT project</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</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%">European Cybersecurity Research and the SerIoT Project</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">935</style></VOLUME><PAGES><style face="normal" font="default" size="100%">166-173</style></PAGES><SECTION><style face="normal" font="default" size="100%">166</style></SECTION><DATE><style face="normal" font="default" size="100%">08/2018</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This paper briefly reviews some recent research in Cybersecurity in Europe funded by the European Commission in areas such as mobile telephony, networked health systems, the Internet of Things. We then outline the objectives of the SerIoT Project which started in 2018 to address the security needs of fields such as Smart Cities, Smart Transportation Systems, Supply Chains and Industrial Informatics.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-00840-6_19</style></URL><title><style face="normal" font="default" size="100%">European Cybersecurity Research and the SerIoT Project</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Electrical Engineering</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">496</style></VOLUME><PAGES><style face="normal" font="default" size="100%">36-48</style></PAGES><SECTION><style face="normal" font="default" size="100%">36</style></SECTION><title><style face="normal" font="default" size="100%">The AQM Dropping Packet Probability Function Based on Non-integer Order PI^αD^β Controller</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">860</style></VOLUME><PAGES><style face="normal" font="default" size="100%">286-299</style></PAGES><SECTION><style face="normal" font="default" size="100%">286</style></SECTION><title><style face="normal" font="default" size="100%">GPU Accelerated Non-integer Order PI^αD^β Controller Used as AQM Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">935</style></VOLUME><PAGES><style face="normal" font="default" size="100%">76-83</style></PAGES><SECTION><style face="normal" font="default" size="100%">76</style></SECTION><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></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</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%">Anastasis Drosou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Security for Internet of Things: The SerIoT Project</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2018 International Symposium on Networks, Computers and Communications (ISNCC)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Rome, Italy</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><title><style face="normal" font="default" size="100%">Security for Internet of Things: The SerIoT Project</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">26</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">4</style></ISSUE><PAGES><style face="normal" font="default" size="100%">777-789</style></PAGES><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></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">718</style></VOLUME><PAGES><style face="normal" font="default" size="100%">336-350</style></PAGES><title><style face="normal" font="default" size="100%">Self-similarity Traffic and AQM Mechanism Based on Non-integer Order Pi^αD^β Controller</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Hidden Markov Models in Long Range Dependence Traffic Modelling</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">700</style></VOLUME><PAGES><style face="normal" font="default" size="100%">75-86</style></PAGES><title><style face="normal" font="default" size="100%">Hidden Markov Models in Long Range Dependence Traffic Modelling</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Models of traffic control in large Internet topologies, invited talk</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The 8th International Conference on Electronics, Communications and Networks (CECNet 2018) Bangkok, Thailand, November 16-19th, 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Bangkok, Thailand</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Rangsit University</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">11/2018</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span style="font-family:times new roman,serif; font-size:12pt"&gt;Transient state queueing models help us to understand better the dynamics of Internet transmissions and the performance of traffic control algorithms. Fluid flow approximation, due its simplicity is popular and frequently used -- but even it, if applied to large topologies, is time and space consuming. The alternative approaches as Markov chains or diffusion approximation lead to much more complex computations. Fluid flow approximation is based on first-order differential equations, and its algorithm is based on iterative calculations on large mutually interdependent structures. In consequence, the bottleneck of the method lies not in numerical computations but in storing and selection of data. This is why we use an approach in which a database (SAP HANA) and its language are used to implement the method. The model logic is represented by ETL (Extract, Transform and Load) customizable and user-friendly processes. The numerical examples are based on a real topology having over 100 000 nodes. We may investigate and compare this way various TCP control algorithms as Vegas or Reno, as well as the influence of the introduction of energy aware algorithms to routers.&lt;/span&gt;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Models of traffic control in large Internet topologies, invited talk</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Queueing Models for Performance Evaluation of Computer Networks - Transient State Analysis, invited talk </style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2018 International Conference on Sensor Networks and Signal Processing (SNSP 2018)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Xi'an, China</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Xi'an University of Science Technology, China</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">11/2018</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Queueing theory is a useful tool in design of computer networks and their performance evaluation. The literature concerning this subject is abundant. However, it is in general limited to the analysis of steady states. It means that flows considered in models are constant and obtained solutions do not depend on time. It is in glaring contrast with the flows observed in real networks where the perpetual changes of traffic intensities are due to the nature of users, sending variable quantities of data, cf. multimedia traffic, and also due to the performance of traffic control algorithms which are trying to avoid congestion in networks, e.g. the algorithm of congestion window used in TCP protocol which is adapting the rate of the sent traffic to the observed losses or transmission delays. The quality of Internet transmission services depends on current load of links and not on its average value. Also modelling and understanding the performance of traffic control mechanisms, control stability and its impact on quality of service needs transient state analysis.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;We discuss mathematical and computational means used to analyse transient states in queueing models. In computer applications a mathematical model is useful only when it furnishes quantitative results. Therefore practical issues related to numerical side of models are of importance. &#160;We present three approaches - Markov models solved numerically, fluid flow approximation and diffusion approximation. A particular importance is given to the latter which is describing the evolution of queues and waiting times in terms of partial differential equations. The author has over 20 year experience in development and application of this method and is also convinced of the qualities of this approach, its flexibility to treat various variants of queueing models.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;Fluid flow approximation, due its simplicity is popular and frequently used -- but even it, if applied to large topologies, is time and space consuming. &#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160;&#160; Fluid flow approximation is based on first-order differential equations, and its algorithm needs iterative calculations on large mutually interdependent structures. In consequence, the bottleneck of the method lies not in numerical computations but in storing and selection of data. This is why we use an approach in which a database and its language are used to implement the method. The numerical examples are based on a real topology having over 100 000 nodes. We may investigate and compare this way various TCP control algorithms as Vegas or Reno, as well as the influence of the introduction of energy aware algorithms to routers.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;Traffic intensity observed in computer networks have a complex stochastic nature (self-similarity and long-range dependence) that influences the network performances. We discuss also this side of implemented queueing models.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Queueing Models for Performance Evaluation of Computer Networks - Transient State Analysis, invited talk </style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Queueing models of traffic control and performance evaluation in large Internet topologies, key-note talk</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">XIII International Scientific and Technical Conference, Computer Science and Information Technologies</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%"> Lviv Polytechnic National University</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%"> Lviv Polytechnic National University</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">09/2018</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Transient state queueing models help us to understand better the dynamics of internet transmissions and the performance of traffic control algorithms. Fluid flow approximation, due its simplicity is popular and frequently used -- but even it, if applied to large topologies, is time and space consuming. The alternative approaches as Markov chains or diffusion approximation lead to much more complex computations. Fluid flow approximation is based on first-order differential equations, and its algorithm is based on iterative calculations on large mutually interdependent structures. In consequence, the bottleneck of the method lies not in numerical computations but in storing and selection of data. This is why we use an approach in which a database (SAP HANA) and its language are used to implement the method.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;The model logic is represented by ETL (Extract, Transform and Load) customizable and user-friendly processes. The numerical examples are based on a real topology having over 100 000 nodes. We may investigate and compare this way various TCP control algorithms as Vegas or Reno, as well as the influence of the introduction of energy aware algorithms to routers.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Queueing models of traffic control and performance evaluation in large Internet topologies, key-note talk</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Metoda sterowania natężeniem ruchu w Internecie, referat zaproszony</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">XXI Krajowa Konferencja Automatyzacji Procesów Dyskretnych</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Zakopane</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Politechnika Śląska</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">09/2018</style></DATE><title><style face="normal" font="default" size="100%">Metoda sterowania natężeniem ruchu w Internecie, referat zaproszony</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Suila</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Edelqueen Anyam</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance of a buffer between electronic and all-optical networks, diffusion approximation model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">32nd International Symposium on Computer and Information Sciences   In Conjunction with the IFIP World Congress 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Poznań</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Communications in Computer and Information Science , vol. 935, Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">09/2018</style></DATE><title><style face="normal" font="default" size="100%">Performance of a buffer between electronic and all-optical networks, diffusion approximation model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Kuaban Suila</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Queueing Model of the Edge Node in IP over All-Optical Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Communications in Computer and Information Science, vol. 860</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">06/2018</style></DATE><title><style face="normal" font="default" size="100%">A Queueing Model of the Edge Node in IP over All-Optical Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Józefiok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Queueing Model of an Insurance Database Interactive System, Comparison of Modelling Methods</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">5th International Conference on Man - Machine Interactions, ICMMI 2017</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Kraków</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Advances in Intelligent Systems and Computing, vol. 659, pp. 525-531</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">10/2017</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-319-67791-0</style></ISBN><title><style face="normal" font="default" size="100%">A Queueing Model of an Insurance Database Interactive System, Comparison of Modelling Methods</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</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%">Performance Modelling of Transmissions in Very Large Network Topologies</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Distributed Computer and Communication Networks 20th International Conference, DCCN 2017</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Moscow, Russia</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Communications in Computer and Information Science, vol. 700, pp. 49-62</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">09/2017</style></DATE><ISBN><style face="normal" font="default" size="100%">ISBN: 978-3-319-66835-2</style></ISBN><title><style face="normal" font="default" size="100%">Performance Modelling of Transmissions in Very Large Network Topologies</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marek Fiuk</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%">A Queueing Model and Performance Analysis of UPnP/HTTP client server interactions in Networked Control Systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks 2019</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Communications in Computer and Information Science</style></PUBLISHER><NUMBER><style face="normal" font="default" size="100%">1039</style></NUMBER><PAGES><style face="normal" font="default" size="100%">366-386</style></PAGES><EDITION><style face="normal" font="default" size="100%">Springer</style></EDITION><ABSTRACT><style face="normal" font="default" size="100%">&lt;div&gt;HTTP based communication protocols are ubiquitous in modern distributed control/supervision systems, therefore it becomes important to understand the performance of the HTTP protocol working with this type of applications and to develop techniques to investigate the impact of the protocol on the overall performance of these systems. A distributed control/supervision system based on HTTP usually consists of multiple nodes sending control requests or measurements to one or more recipient nodes; these data are used to perform control functions, and are stored or presented to supervising personnel. Typically multiple, concurrent flows of data are carried over HTTP to a given recipient. The stochastic characteristics of these flows are often different from the bursty nature of the ordinary Web Browser – Web Server interactions. Furthermore, in order to efficiently carry the randomly arriving data, the number of overlapping (concurrent) HTTP request/response sessions utilized by a sending node is higher than in typical Web Browser -- Web Server communications.&lt;/div&gt;&#13;
&#13;
&lt;div&gt;We investigate how the characteristics of nodes participating in the distributed control system communications (number of nodes, service times, number of service stations, queue lengths) influence performance of the employed HTTP protocol. The main focus is on&#160; end-to-end delays in transmissions, the most important factor in control. The presented approach can be used to select configuration parameters for the nodes of a realistic control/supervision system having in mind the best communication related performance of such system.&lt;/div&gt;&#13;
&#13;
&lt;div&gt;In this work we propose a queuing model of HTTP client/server interactions which we subsequently simplify to be represented by a numerically solvable Markov chain. We compare the results obtained with the simplified model with the output of a discrete event simulation based on the original full model.&lt;/div&gt;&#13;
&#13;
&lt;div&gt;The initial motivation for this research came from a study of UPnP based remote PTZ camera control mechanism used by a leading manufacturer of large scale video monitoring systems.&lt;/div&gt;&#13;
&#13;
&lt;div&gt;&#160;&lt;/div&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Queueing Model and Performance Analysis of UPnP/HTTP client server interactions in Networked Control Systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Cognitive Packet Networks for the Secure Internet of Things</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Global IoT Summit (GIoTS)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Aarhus, Denmark</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ISBN><style face="normal" font="default" size="100%">978-1-7281-2171-0</style></ISBN><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/8766380</style></URL><title><style face="normal" font="default" size="100%">Cognitive Packet Networks for the Secure Internet of Things</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Enrico Ferrera</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Claudio Pastrone</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paul-Emmanuel Brun</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Remi De Besombes</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konstantinos Loupos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gerasimos Kouloumpis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Patrick O’Sullivan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Alexandros Papageorgiou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Panayiotis Katsoulakos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bill Karakostas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Antonis Mygiakis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christina Stratigaki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bora Caglayan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Basile Starynkevitch</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christos Skoufis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stelios Christofi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Nicolas Ferry</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Hui Song</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arnor Solberg</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Peter Matthews</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Antonio Skarmeta</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">José Santa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michail Beliatis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mirko Presser</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Josiane Parreira</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Juan Martínez</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Payam Barnaghi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Shirin Enshaeifar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Thorben Iggena</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marten Fischer</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ralf Tönjes</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Martin Strohbach</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Alessandro Sforzin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Hien Truong</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">John Soldatos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sofoklis Efremidis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Georgios Koutalieris</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Panagiotis Gouvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Juergen Neises</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">George Hatzivasilis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ioannis Askoxylakis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vivek Kulkarni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arne Broering</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Dober</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kostas Ramantas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christos Verikoukis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joachim Posegga</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Domenico Presenza</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">George Spanoudakis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Danilo Pau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anastasis Drosou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tommi Elo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Santeri Paavolainen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dmitrij Lagutin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Helen Leligou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Panagiotis Trakadas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">George Polyzos</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">IoT European Security and Privacy Projects: Integration, Architectures and Interoperability</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Next Generation Internet of Things. Distributed Intelligence at the Edge and Human Machine-to-Machine Cooperation</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">River Publishers</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">7</style></SECTION><ISBN><style face="normal" font="default" size="100%">9788770220071</style></ISBN><title><style face="normal" font="default" size="100%">IoT European Security and Privacy Projects: Integration, Architectures and Interoperability</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">1039</style></VOLUME><SECTION><style face="normal" font="default" size="100%">400-412</style></SECTION><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></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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%">Diffusion Approximation Models for Cloud Computations with Task Migrations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2019 IEEE International Conference on Fog Computing (ICFC)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/8821824</style></URL><title><style face="normal" font="default" size="100%">Diffusion Approximation Models for Cloud Computations with Task Migrations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SN Computer Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ISSUE><style face="normal" font="default" size="100%">1:43</style></ISSUE><title><style face="normal" font="default" size="100%">Diffusion Approximation Model of TCP NewReno Congestion Control Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><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><DATE><style face="normal" font="default" size="100%">23-26 March 2020</style></DATE><title><style face="normal" font="default" size="100%"> AQM mechanism with neuron tuning parameters</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Anastasija Collen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Niels Nijdam</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Javier Augusto-Gonzalez</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sokratis Katsikas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konstantinos Giannoutakis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Georgios Spathoulas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konstantinos Votis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">N. Ghavami</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Melanie Volkamer</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piroska Haller</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Sánchez</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Dimas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paolo Campegiani</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sokratis Katsikas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ioannis Komnios</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Romano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">GHOST - Safe-Guarding Home IoT Environments with Personalised Real-Time Risk Control</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Security in Computer and Information Sciences - First International ISCIS Security Workshop 2018, Euro-CYBERSEC 2018, London, UK, February 26-27, 2018, Revised Selected Papers</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-319-95189-8_7</style></URL><title><style face="normal" font="default" size="100%">GHOST - Safe-Guarding Home IoT Environments with Personalised Real-Time Risk Control</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Olumide Akinwande</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Reinforcement Learning Approach to Adaptive Forwarding in Named Data Networking</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences - 32nd International Symposium, ISCIS 2018, Held at the 24th IFIP World Computer Congress, WCC 2018, Poznan, Poland, September 20-21, 2018, Proceedings</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-00840-6_23</style></URL><title><style face="normal" font="default" size="100%">A Reinforcement Learning Approach to Adaptive Forwarding in Named Data Networking</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paolo Campegiani</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sokratis Katsikas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ioannis Komnios</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Romano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Security in Computer and Information Sciences - First International ISCIS Security Workshop 2018, Euro-CYBERSEC 2018, London, UK, February 26-27, 2018, Revised Selected Papers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">821</style></VOLUME><ISBN><style face="normal" font="default" size="100%">978-3-319-95188-1</style></ISBN><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-319-95189-8</style></URL><title><style face="normal" font="default" size="100%">Security in Computer and Information Sciences - First International ISCIS Security Workshop 2018, Euro-CYBERSEC 2018, London, UK, February 26-27, 2018, Revised Selected Papers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Computer and Information Sciences - 32nd International Symposium, ISCIS 2018, Held at the 24th IFIP World Computer Congress, WCC 2018, Poznan, Poland, September 20-21, 2018, Proceedings</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">935</style></VOLUME><ISBN><style face="normal" font="default" size="100%">978-3-030-00839-0</style></ISBN><title><style face="normal" font="default" size="100%">Computer and Information Sciences - 32nd International Symposium, ISCIS 2018, Held at the 24th IFIP World Computer Congress, WCC 2018, Poznan, Poland, September 20-21, 2018, Proceedings</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</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%">Transient Behaviour of a Network Router</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">43th International Conference on Telecommunications and Signal Processing</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Milano, Italy</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The broader use of Software Defined Network (SDN) controllers creates periodic changes in topology and traffic rates at routers that adapt the network to changes in network conditions.&#160;&lt;br /&gt;&#13;
Thus the transient behaviour of network components, and in particular routers, is becoming of great interest.&lt;br /&gt;&#13;
Since standard queueing models are difficult to analyze under time-varying conditions, we propose a tractable diffusion approximation for both the transient and steady-state behaviour of a network router. In particular, the analysis provides the steady-state and transient delay and packet loss probability as a function of traffic load and other characteristics. Using these results, we show that when SDN routers change the paths of flows frequently, the network's behaviour may often be far from its steady-state behaviour. Therefore any network optimization conducted with the help of SDN should not be based on&#160;steady-state behaviour, but rather on some metric reated to the network time dependent behaviour.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Transient Behaviour of a Network Router</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vladimir Vishnevskiy</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konstantin Samouylov</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dmitry Kozyrev</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Multichannel Diffusion Approximation Models for the Evaluation of Multichannel Communication Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Distributed Computer and Communication Networks - 22nd International Conference, DCCN 2019, Moscow, Russia, September 23-27, 2019, Revised Selected Papers</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-36614-8_4</style></URL><title><style face="normal" font="default" size="100%">Multichannel Diffusion Approximation Models for the Evaluation of Multichannel Communication Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Gruca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deorowicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Harezlak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Agnieszka Piotrowska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Man-Machine Interactions 6 - 6th International Conference on Man-Machine Interactions, ICMMI 2019, Cracow, Poland, October 2-3, 2019</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Advances in Intelligent Systems and Computing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1061</style></VOLUME><ISBN><style face="normal" font="default" size="100%">978-3-030-31963-2</style></ISBN><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-31964-9</style></URL><title><style face="normal" font="default" size="100%">Man-Machine Interactions 6 - 6th International Conference on Man-Machine Interactions, ICMMI 2019, Cracow, Poland, October 2-3, 2019</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion approximation as a tool in computer networks performance evaluation, invited talk,  The 9th International Conference on  Electronics, Communications and Networks, CECNet 2019, October 18-21, 2019   Kitakyushu City, Japan</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Performance of computer networks is frequently investigated with the use of queueing theory. Its models represent the queues of packets waiting in routers to be sent further and evaluate queueing delays, loss probabilities in routers and then the overall transmission quality of service. There is a constant effort &#160;to develop models reflecting as exactly as possible the stochastic nature of the transmission intensity, its variability, the distribution of the size of packets, &#160;and the rules of traffic management applied by protocols to avoid network congestion. The article describes one of the approaches: diffusion approximation where the size of queues is described by a diffusion process. The method was introduced in 1970-ties by Hisashi Kobayashi and Erol Gelenbe and is still being developed by the author to fit various models of Internet, Internet of Things, Software Defined Networks, Cloud and Fog computing, edge computing. The method is based on the solution of a system of differential partial equations giving&#160; an approximation of the queue lengths distribution at any considered time moment. The features that are in favour of the method are:&lt;/p&gt;&#13;
&#13;
&lt;ul&gt;&#13;
	&lt;li&gt;diffusion model of a single server assumes general&#160; interarrival and service time distributions this way going beyond Markov models,&lt;/li&gt;&#13;
	&lt;li&gt;network models may have any topology, also hierarchical, and any number of nodes (are easy scalable)&lt;/li&gt;&#13;
	&lt;li&gt;the results are obtained in form of queue distributions and waiting time distributions that makes easier to analyse&#160; QoS of paths, e.g. jitter,&lt;/li&gt;&#13;
	&lt;li&gt;&#160;easy separation of each node within a network model,&lt;/li&gt;&#13;
	&lt;li&gt;the transient state model is solved step-by-stem in small time intervals with parameters specific to these intervals; any decision of a controller concerning&#160; dynamic routing of packets,&#160; as well as changes of flows due to attacks and control mechanisms may be easily reflected in time-dependent and state-dependent diffusion parameters&#160; and time-depended routing probabilities in equations determining the flows.&lt;/li&gt;&#13;
&lt;/ul&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Diffusion approximation as a tool in computer networks performance evaluation, invited talk,  The 9th International Conference on  Electronics, Communications and Networks, CECNet 2019, October 18-21, 2019   Kitakyushu City, Japan</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">Katarzyna Filus</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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The self-similar markovian sources</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Applied Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">10</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">11</style></ISSUE><title><style face="normal" font="default" size="100%">The self-similar markovian sources</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Queueing Model of the Edge Node in IP over  All-Optical Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">25th International Conference on Computer Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">978-3-3199-249-5</style></ISBN><title><style face="normal" font="default" size="100%">A Queueing Model of the Edge Node in IP over  All-Optical Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Edelqueen Anyam</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance of a buffer between  electronic and all-optical networks, diffusion approximation model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">32nd International Symposium  on Computer and Information Sciences In Conjunction with the IFIP World Congress 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Poznań, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%"> 978-3-0300-0839-0</style></ISBN><title><style face="normal" font="default" size="100%">Performance of a buffer between  electronic and all-optical networks, diffusion approximation model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science (AMCS)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">31</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><URL><style face="normal" font="default" size="100%"/></URL><title><style face="normal" font="default" size="100%">The IoT Gateway with Active Queue Management</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Communications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">166</style></VOLUME><SECTION><style face="normal" font="default" size="100%">40-48</style></SECTION><DATE><style face="normal" font="default" size="100%">01/2021</style></DATE><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><URL><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0140366420319940</style></URL><title><style face="normal" font="default" size="100%">Combined diffusion approximation - simulation model of AQM’s transient behaviour</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</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%">Time Dependent Diffusion Model for Security Driven Software Defined Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Second International Workshop on Stochastic Modeling and Applied Research of Technology (SMARTY 2020)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Petrozavodsk, Karelia, Russia</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">CEUR-WS.org</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">2792</style></VOLUME><PAGES><style face="normal" font="default" size="100%">38-56</style></PAGES><EDITION><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></EDITION><DATE><style face="normal" font="default" size="100%">12/2020</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We present a model of a Software Defined Network (SDN) where frequent changes in routing and traffic rates at routers are needed to respond to the security, quality of service (QoS), and energy savings requirements of applications such as the Internet of Things.&lt;br /&gt;&#13;
Such frequent path and traffic changes introduce time-dependent network behaviours, and standard queueing models are not well adapted to analyse the transient regime, we propose a tractable diffusion approximation for both the transient and steady-state behaviour.&lt;br /&gt;&#13;
Our model can represent any network topology transmitting time-dependent flows with routing changes, and computes queue length and delay distributions at each network node and along&#160;complete paths between senders and receivers.&#160;&lt;br /&gt;&#13;
Using realistic router parameters, we show that transients occupy a significant fraction of system time, so that the optimisation conducted with SDN controllers needs to include the effect of time-dependent behaviours.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-2792/</style></URL><title><style face="normal" font="default" size="100%">Time Dependent Diffusion Model for Security Driven Software Defined Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Amira Kamli</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</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%">Performance Evaluation of the Packet Aggregation Mechanism of an N-GREEN Metro Network Node</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Modelling, Analysis, and Simulation of Computer and Telecommunication Systems, 28th International Symposium, MASCOTS 2020, Nice, France, November 17–19, 2020, Revised Selected Papers</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">on-line</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">12527</style></VOLUME><EDITION><style face="normal" font="default" size="100%">Computer Communication Networks and Telecommunications, LNCS</style></EDITION><DATE><style face="normal" font="default" size="100%">12/2020</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-030-68110-4</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Today's telecommunication network infrastructure and services are dramatically changing due partially to the rapid increase in the amount of traffic generation and its transportation. This rapid change is also caused by the increased demand for a high quality of services and the recent interest in green networking strengthened by cutting down carbon emission and operation cost. Access networks generate short electronic packets of different sizes, which are aggregated into larger optical packets at the ingress edge nodes of the optical backbone network. It is transported transparently in the optical domain, reconverted into the electronic domain at the egress edge nodes, and delivered to the destination access networks. Packet aggregation provides many benefits at the level of MAN, and core networks such as, increased spectral efficiency, energy efficiency, optimal resource utilisation, simplified traffic management which significantly reduces protocol and signalling overhead. However, packet aggregation introduces performance bottleneck at the edge node as the packets from the access networks are temporarily stored in the aggregation buffers during the packet aggregation process. In this article, we apply the diffusion approximation model and other stochastic modelling methods to analytically evaluate the performance of a new packet aggregation mechanism which was developed specifically for an N-GREEN (Next Generation of Routers for Energy &#160;Efficiency) metro network. We obtain the distribution of the packets' queue in the aggregation buffer, which influences the distribution of the waiting time (delay) experienced by packets in the aggregation buffer. We then, demonstrate the influence of the probability $p$ of successfully inserting the packet data units from the aggregation queue to the optical ring within a defined timeslot $\Delta$. We also discuss the performance evaluation of the complete ring by deriving the utilisation of each link.&lt;br /&gt;&#13;
&#160;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance Evaluation of the Packet Aggregation Mechanism of an N-GREEN Metro Network Node</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</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%">Software Defined Network Dynamics via Diffusions</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">28th International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems, MASCOTS 2020, revised delected papers</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">on-line</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">12527</style></VOLUME><EDITION><style face="normal" font="default" size="100%">Computer Communication Networks and Telecommunications, LNCS</style></EDITION><DATE><style face="normal" font="default" size="100%">12/2020</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-030-68110-4</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Software-Defined Networks (SDN) dynamically modify the paths of Internet flows in response to the quality of service or security needs, and hence frequently modify traffic levels at network routers. Thus network routers often operate in the transient regime, rather than at steady-state, with significant impact on packet loss probabilities and delay. We, therefore, investigate the time-dependent performance of a small network of routers, modelled as G/G/1/N queueing stations. &#160;A diffusion approximation is developed to predict the quality of service of the routers in the transient regime. Numerical examples show that&#160;the results in the transient regime can differ very significantly from the steady-state results, and therefore that the&#160;transient analysis must be taken into account in evaluating the performance of routers in a SDN network.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.springer.com/gp/book/9783030681098</style></URL><title><style face="normal" font="default" size="100%">Software Defined Network Dynamics via Diffusions</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</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%">Time Dependent Diffusion Model for Security Driven Software Defined Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The Second International Workshop on Stochastic Modeling and Applied Research of Technology (SMARTY 2020)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2792</style></VOLUME><PAGES><style face="normal" font="default" size="100%">pp. 38-56</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We present a model of a Software Defined Network (SDN) where frequent changes in routing and traffic rates at routers are needed&lt;br /&gt;&#13;
to respond to the security, quality of service (QoS), and energy savings requirements of applications such as the Internet of Things. Such frequent path and traffic changes introduce time-dependent network behaviours, and standard queueing models are not well adapted to analyse the transient regime, we propose a tractable diffusion approximation for both the transient and steady-state behaviour. Our model can represent any network topology transmitting time-dependent flows with routing changes, and computes queue length and delay distributions at each network node and along complete paths between senders and receivers. Using realistic router parameters, we show that transients occupy a significant fraction of system time, so that the optimisation conducted with SDN controllers needs to include the effect of time-dependent behaviours.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Time Dependent Diffusion Model for Security Driven Software Defined Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</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%">Time-Dependent Performance of a Multi-Hop Software Defined Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Applied Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">11</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">2469</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1-21</style></SECTION><DATE><style face="normal" font="default" size="100%">03/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;It has been recently observed that Software Defined Networks (SDN) can change the&lt;br /&gt;&#13;
paths of different connections in the network at a relatively frequent pace to improve the overall&lt;br /&gt;&#13;
network performance, including delay and packet loss, or to respond to other needs such as security.&lt;br /&gt;&#13;
These changes mean that a network that SDN controls will seldom operate in steady state; rather,&lt;br /&gt;&#13;
the network may often be in transient mode, especially when the network is heavily loaded and&lt;br /&gt;&#13;
path changes are critically important. Hence, we propose a transient analysis of such networks to&lt;br /&gt;&#13;
better understand how frequent changes in paths and the switches’ workloads may affect multi-hop&lt;br /&gt;&#13;
networks’ performance. Since conventional queueing models are difficult to solve for transient&lt;br /&gt;&#13;
behaviour and simulations take excessive computation time due to the need for statistical accuracy,&lt;br /&gt;&#13;
we use a diffusion approximation to study a multi-hop network controlled by SDN. The results show&lt;br /&gt;&#13;
that network optimization should consider the transient effects of SDN and that transients need to be&lt;br /&gt;&#13;
included in the design of algorithms for SDN controllers that optimize network performance.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/journal/applsci</style></URL><title><style face="normal" font="default" size="100%">Time-Dependent Performance of a Multi-Hop Software Defined Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Entropy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><SECTION><style face="normal" font="default" size="100%">619</style></SECTION><DATE><style face="normal" font="default" size="100%">05/2021</style></DATE><title><style face="normal" font="default" size="100%">Diffusion model of a non-integer order PIγ controller with TCP/UDP  streams</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</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%">Diffusion Analysis Improves Scalability of IoTNetworks to Mitigate the Massive Access Problem</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2021 Mascots: 29th International Symposium on the Modelling, Analysis and Simulation of Computer and Telecommunication Systems</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Houston, Texas, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">11/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;A significant challenge of IoT networks is to offer Quality of Service (QoS) and meet deadline requirements when packets from a massive number of IoT devices are forwarded to an IoT gateway. Many IoT devices tend to report their data to their wired or wireless network gateways at closely correlated instants of time, leading to congestion known as the MassiveAccess Problem (MAP), which increases the probability that the IoT data will not meet its required deadlines. Since IoT data loses much of its value if it arrives to destination beyond a required deadline, MAP has been extensively studied in the literature. Thus we first take a queueing theoretic view of the problem, and also use a Diffusion Approximation to gain insight into the IoT traffic statistics that affect MAP. Then we introduce the Quasi-Deterministic Transmission Policy (QDTP) which significantly alleviates MAP when the average traffic rate grows beyond a given level and substantially reduces the probability that IoT data deadlines are missed. The results are validated using real IoT data which has been placed in IP packets for transmission.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Diffusion Analysis Improves Scalability of IoTNetworks to Mitigate the Massive Access Problem</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Model of Preemptive-Resume Priority Systems and Its Application to Performance Evaluation of SDN Switches.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">21</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5042</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1</style></SECTION><DATE><style face="normal" font="default" size="100%">07/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The increasing use of Software-Defined Networks brings the need for their performance analysis and detailed analytical and numerical models of them. The primary element of such research is a model of a SDN switch. This model should take into account non-Poisson traffic and general distributions of service times. Because of frequent changes in SDN flows, it should also analyze transient states of the queues. The method of diffusion approximation can meet these requirements. We present here a diffusion approximation of priority queues and apply it to build a more detailed model of SDN switch where packets returned by the central controller have higher priority than other packets.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Diffusion Model of Preemptive-Resume Priority Systems and Its Application to Performance Evaluation of SDN Switches.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Amira Kamli</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance Analysis of Packet Aggregation Mechanisms and Their Applications in Access (e.g., IoT, 4G/5G), Core, and Data Centre Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">21</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3898</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1</style></SECTION><DATE><style face="normal" font="default" size="100%">06/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The transmission of massive amounts of small packets generated by access networks&#13;
through high-speed Internet core networks to other access networks or cloud computing data centres has introduced several challenges such as poor throughput, underutilisation of network resources,  and higher energy consumption. Therefore, it is essential to develop strategies to deal with these challenges. &#13;
One of them is to aggregate smaller packets into a larger payload packet, and these groups of aggregated packets will share the same header, hence increasing throughput, improving resource utilisation, and reduction in energy consumption. This paper presents a review of the packet aggregation applications in access networks (e.g., IoT and 4G/5G mobile networks), optical core networks, and cloud computing data centre networks. &#13;
Then we propose new analytical models based on diffusion approximation for the evaluation of the performance of packet aggregation mechanisms. We demonstrate the use of measured traffic from real networks to evaluate the performance of packet aggregation mechanisms analytically. The use of diffusion approximation allows us to consider time-dependent queueing models with general interarrival and service time distributions. Therefore these models are more general than others presented till now.&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance Analysis of Packet Aggregation Mechanisms and Their Applications in Access (e.g., IoT, 4G/5G), Core, and Data Centre Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Amira Kamli</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</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%">Performance Evaluation of the Packet Aggregation Mechanism of an N-GREEN Metro Network Node</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Modelling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Workshop 2020</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%"> January 2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span style="background-color:rgb(255, 255, 255); color:rgb(51, 51, 51); font-family:hind,arial,sans-serif; font-size:15px"&gt;Today’s telecommunication network infrastructure and services are dramatically changing due partially to the rapid increase in the amount of traffic generation and its transportation. This rapid change is also caused by the increased demand for a high quality of services and the recent interest in green networking strengthened by cutting down carbon emission and operation cost. Access networks generate short electronic packets of different sizes, which are aggregated into larger optical packets at the ingress edge nodes of the optical backbone network. It is transported transparently in the optical domain, reconverted into the electronic domain at the egress edge nodes, and delivered to the destination access networks. Packet aggregation provides many benefits at the level of MAN, and core networks such as, increased spectral efficiency, energy efficiency, optimal resource utilisation, simplified traffic management which significantly reduces protocol and signalling overhead. However, packet aggregation introduces performance bottleneck at the edge node as the packets from the access networks are temporarily stored in the aggregation buffers during the packet aggregation process. In this article, we apply the diffusion approximation model and other stochastic modelling methods to analytically evaluate the performance of a new packet aggregation mechanism which was developed specifically for an N-GREEN (Next Generation of Routers for Energy Efficiency) metro network. We obtain the distribution of the packets’ queue in the aggregation buffer, which influences the distribution of the waiting time (delay) experienced by packets in the aggregation buffer. We then, demonstrate the influence of the probability&#160;&lt;/span&gt;&lt;em&gt;p&lt;/em&gt;&lt;span style="background-color:rgb(255, 255, 255); color:rgb(51, 51, 51); font-family:hind,arial,sans-serif; font-size:15px"&gt;&#160;of successfully inserting the packet data units from the aggregation queue to the optical ring within a defined timeslot&#160;&lt;/span&gt;&lt;span style="background-color:rgb(255, 255, 255); color:rgb(51, 51, 51); font-family:hind,arial,sans-serif; font-size:15px"&gt;Δ&lt;/span&gt;&lt;span style="background-color:rgb(255, 255, 255); color:rgb(51, 51, 51); font-family:hind,arial,sans-serif; font-size:15px"&gt;. We also discuss the performance evaluation of the complete ring by deriving the utilisation of each link.&lt;/span&gt;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance Evaluation of the Packet Aggregation Mechanism of an N-GREEN Metro Network Node</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Aleksander Byrski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yuko Murayama</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Computer Science Protecting Human Society Against Epidemics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ANTICOVID 2021</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Virtual Event, June 28–29, 2021</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">616</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">616</style></NUMBER><PAGES><style face="normal" font="default" size="100%">125</style></PAGES><TERTIARY_TITLE><style face="normal" font="default" size="100%">IFIP Advances in Information and Communication Technology</style></TERTIARY_TITLE><ISBN><style face="normal" font="default" size="100%">978-3-030-86582-5</style></ISBN><title><style face="normal" font="default" size="100%">Computer Science Protecting Human Society Against Epidemics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</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%">Fluid-Flow Approximation in the Analysis of Vast Energy-Aware Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Mathematics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">9</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3279</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1</style></SECTION><DATE><style face="normal" font="default" size="100%">12/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The paper addresses two issues: (i) modeling dynamic flows transmitted in vast TCP/IP networks and (ii) modeling the impact of energy-saving algorithms. The approach is based on the fluid-flow approximation, which applies first-order differential equations to analyze the evolution of queues and flows. We demonstrate that the effective implementation of this method overcomes the constraints of storing large data in numerical solutions of transient problems in vast network topologies. The model is implemented and executed directly in a database system. It can analyze transient states in topologies of more than 100,000 nodes, i.e., the size which was not considered until now. We use it to investigate the impact of an energy-saving algorithm on the performance of a vast network. We find that it reduces network congestion and save energy costs but significantly lower network throughput.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/2227-7390/9/24/3279</style></URL><title><style face="normal" font="default" size="100%">Fluid-Flow Approximation in the Analysis of Vast Energy-Aware Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences, Technical Sciences (BPASTS)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">70</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">4</style></ISSUE><URL><style face="normal" font="default" size="100%">https://journals.pan.pl/dlibra/publication/141986/edition/123961/content</style></URL><title><style face="normal" font="default" size="100%">Approximation Models for the Evaluation of TCP/AQM Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</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%">Mitigating the Massive Access Problem in the Internet of Things</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"> EuroCybersec</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The traffic from the large number of IoT devices connected to the IoT is a source of congestion known as the Massive Access Problem (MAP), that results in packet losses, delays and missed deadlines for realtime data. This paper reviews the literature on MAP and summarizes recent results on two approaches that have been designed to mitigate MAP. One approach is based on randomizing the packet arrival instants to IoT gateways within a given time interval that is chosen so that packet arrivals do not exceed their deadlines, but also so that they do not constitute bulk arrivals. The second approach is a novel traffic shaping policy named the Quasi-Deterministic-Transmission-Policy (QDTP) which has been proved to drastically reduce queue formation at the receiving gateway by delaying packet departures from the IoT devices in a judicious manner. Both analytical and experimental results are summarized, that describe the benefits of these techniques.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Mitigating the Massive Access Problem in the Internet of Things</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</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%">Improving Massive Access to IoT Gateways</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Performance Evaluation</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><SECTION><style face="normal" font="default" size="100%">102308</style></SECTION><DATE><style face="normal" font="default" size="100%">08/2022</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;IoT networks handle incoming packets from large numbers of IoT Devices (IoTDs) to IoT Gateways. This can lead to the IoT Massive Access Problem that causes buffer overflow, large end-to-end delays and missed deadlines. This paper analyzes a novel traffic shaping method named the Quasi-Deterministic Traffic Policy (QDTP) that mitigates this problem by shaping the incoming traffic without increasing the end-to-end delay or dropping packets. Using queueing theoretic techniques and extensive data driven simulations with real IoT datasets, the value of QDTP is shown as a means to considerably reduce congestion at the Gateway, and significantly improve the IoT network’s overall performance.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Improving Massive Access to IoT Gateways</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</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%">Optimizing Energy Usage for an Electric Drone</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">EuroCybersec 2021</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1596</style></VOLUME><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Unmanned Aerial Vehicles (UAVs) are rapidly gaining popu-&lt;br /&gt;&#13;
larity in a wide variety of applications, e.g., agriculture, health care, envi-&lt;br /&gt;&#13;
ronmental management, supply chains, law enforcement, surveillance,&lt;br /&gt;&#13;
and photography. Dones are often powered by batteries, making energy&lt;br /&gt;&#13;
a critical resource that must be optimised during the mission of the&lt;br /&gt;&#13;
drone. The duration of a done’s mission depends on the amount of energy&lt;br /&gt;&#13;
required to perform some manoeuvering actions (takeoff, level flight, hov-&lt;br /&gt;&#13;
ering, and landing), the energy required to power the ICT modules in&lt;br /&gt;&#13;
the drone, the drone’s speed, payload, and the wind. In this paper, we&lt;br /&gt;&#13;
present a model that minimizes the energy consumption of a low power&lt;br /&gt;&#13;
drone and maximizes the time required to completely drain the drone’s&lt;br /&gt;&#13;
battery and ensure the safe landing of the drone.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Optimizing Energy Usage for an Electric Drone</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling energy changes in the energy harvesting battery of an IoT device</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">30th International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2022)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The complexity of battery-powered autonomous de-&lt;br /&gt;&#13;
vices such as Internet of Things (IoT) nodes or Unmanned Aerial&lt;br /&gt;&#13;
Vehicles (UAV) and the necessity to ensure an acceptable quality&lt;br /&gt;&#13;
of service, reliability, and security, have significantly increased&lt;br /&gt;&#13;
their energy demand. In this paper, we discuss using a diffusion&lt;br /&gt;&#13;
approximation process to approximate the dynamic changes in&lt;br /&gt;&#13;
the energy content of a battery. We consider the case when&lt;br /&gt;&#13;
energy harvesting sources are constantly charging the battery.&lt;br /&gt;&#13;
The model assumes a probabilistic consumption and delivery of&lt;br /&gt;&#13;
energy, giving the time-dependent distributions of the energy at&lt;br /&gt;&#13;
the battery, of the time remaining until it becomes empty, the&lt;br /&gt;&#13;
time required to charge the battery to its total capacity, or the&lt;br /&gt;&#13;
time it is operational between two moments of complete depletion.&lt;br /&gt;&#13;
When possible, we compare the diffusion approximation results&lt;br /&gt;&#13;
with corresponding Markovian models.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling energy changes in the energy harvesting battery of an IoT device</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling energy changes in the energy harvesting battery of an IoT device</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">30th International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2022)  pp. 81-88</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE Xplore</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">03/2023</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The complexity of battery-powered autonomous devices such as Internet of Things (IoT) nodes or Unmanned Aerial Vehicles (UAV) and the necessity to ensure an acceptable quality of service, reliability, and security have significantly increased their energy demand. In this paper, we discuss using a diffusion approximation process to approximate the dynamic changes in the energy content of a battery. We consider the case when energy harvesting sources are constantly charging the battery. The model assumes a probabilistic consumption and delivery of energy, giving the time-dependent distributions of the energy at the battery, of the time remaining until it becomes empty, the&lt;br /&gt;&#13;
time required to charge the battery to its total capacity, or the time it is operational between two moments of complete depletion.&lt;br /&gt;&#13;
When possible, we compare the diffusion approximation results with corresponding Markovian models.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling energy changes in the energy harvesting battery of an IoT device</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</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%">Optimizing Energy Usage for an Electric Drone</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">EuroCybersec 2021: Security in Computer and Information Sciences</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1596</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">CCIS</style></NUMBER><PAGES><style face="normal" font="default" size="100%">61–75</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-031-09357-9</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Unmanned Aerial Vehicles (UAVs) are rapidly gaining popularity in a wide variety of applications, e.g., agriculture, health care, environmental management, supply chains, law enforcement, surveillance, and photography. Dones are often powered by batteries, making energy&lt;br /&gt;&#13;
a critical resource that must be optimised during the mission of the drone. The duration of a done’s mission depends on the amount of energy required to perform some manoeuvering actions (takeoff, level flight, hovering, and landing), the energy required to power the ICT modules in the drone, the drone’s speed, payload, and the wind. In this paper, we present a model that minimizes the energy consumption of a low-power drone and maximizes the time required to completely drain the drone’s battery and ensure the safe landing of the drone.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Optimizing Energy Usage for an Electric Drone</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Julius Tangka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling of the Energy Depletion Process and Battery Depletion Attacks for Battery-Powered Internet of Things (IoT) Devices</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">6183</style></ISSUE><DATE><style face="normal" font="default" size="100%">07/2023</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
The Internet of Things (IoT) is transforming almost every industry, including agriculture, food processing, health care, oil and gas, environmental protection, transportation and logistics, manufacturing, home automation, and safety. Cost-effective, small-sized batteries are often used to power IoT devices being deployed with limited energy capacity. The limited energy capacity of IoT devices makes them vulnerable to battery depletion attacks designed to exhaust the energy stored in the battery rapidly and eventually shut down the device. In designing and deploying IoT devices, the battery and device specifications should be chosen in such a way as to ensure a long lifetime of the device. This paper proposes diffusion approximation as a mathematical framework for modelling the energy depletion process in IoT batteries. We applied diffusion or Brownian motion processes to model the energy depletion of a battery of an IoT device. We used this model to obtain the probability density function, mean, variance, and probability of the lifetime of an IoT device. Furthermore, we studied the influence of active power consumption, sleep time, and battery capacity on the probability density function, mean, and probability of the lifetime of an IoT device. We modelled ghost energy depletion attacks and their impact on the lifetime of IoT devices. We used numerical examples to study the influence of battery depletion attacks on the distribution of the lifetime of an IoT device. We also introduced an energy threshold after which the device's battery should be replaced in order to ensure that the battery is not completely drained before it is replaced. &lt;/pre&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling of the Energy Depletion Process and Battery Depletion Attacks for Battery-Powered Internet of Things (IoT) Devices</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling the Energy Performance of Off-Grid Sustainable Green Cellular Base Stations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2023 31st International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2023)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Stony Brook, NY, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">16/01/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
There is a growing awareness of the need to reduce carbon emissions from the operation of mobile networks. The massive deployment of ultra-dense 5G and IoT networks will significantly increase energy demand and put the electricity grid under stress while also driving up operational costs. In this paper, we model the energy performance of an off-grid sustainable green cellular base station site which consists of a solar power system, Battery Energy Storage (BESS) and Hydrogen Energy Storage (HESS) system, and various types of macrocells, microcells, picocells, or femtocells, with broadband optical or microwave transmission systems, and other electrical and electronic systems (air conditioner, power converters, and controllers. We propose diffusion-based models of the charging and discharging processes of the energy storage systems, and obtain the probability of charging them to their full capacities during the day and completely discharging them at the end of each day. We also investigate the impact of design parameters such as the mean charging rate and the mean discharging rate on the probability densities of charging BESS and HESS to their full capacities during the day and of completely discharging them before the end of each night period. &lt;/pre&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling the Energy Performance of Off-Grid Sustainable Green Cellular Base Stations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sapana Sharma</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Markov model for a Self-Powered Green IoT Device with State-Dependent Energy Consumption</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceeding of the 2023 4th International Conference on Communications, Information, Electronic and Energy Systems (CIEES)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">979-8-3503-3691-7</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
The growing concerns about the resource sustainability and environmental impact of deploying billions or trillions of IoT devices in the various sectors of society or economy have given rise to an energy research field known as Green-IoT (G-IoT). G-IoT emphasises the need to prioritise energy efficiency and the reduction of pollution in the IoT ecosystem. This paper presents a Markov model for a self-powered Green IoT device with state-dependent energy consumption. The model evaluates the energy performance of a self-powered Green IoT device. We derive the probability distribution of the energy content of the battery, including the probability that the energy stored in the battery is completely depleted and the density of the lifetime of the IoT device. We investigate the influence of some design parameters on the results. Introducing the threshold at which the device is forced to enter an energy-saving regime significantly increases a G-IoT device's lifetime. Apart from deploying energy-efficient mechanisms to increase the lifetime of a G-IoT device, integrating an efficient energy harvesting system into the device will increase its lifetime and reduce the frequency of battery replacement.&lt;/pre&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Markov model for a Self-Powered Green IoT Device with State-Dependent Energy Consumption</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy performance of Internet of Things (IoT) networks for pipeline monitoring</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2024 International Wireless Communications and Mobile Computing (IWCMC)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Ayia Napa, Cyprus</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">17/07/2024</style></DATE><ISBN><style face="normal" font="default" size="100%">979-8-3503-6126-1</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
Pipelines are the most convenient ways to transport fluids (e.g., water, oil, and gas). However, leakage of fluids into the environment results in resource wastage (especially water, which is becoming a scarce resource) and environmental pollution (in the case of leakage of toxic fluids like oil and gas). Emerging technologies like the Internet of Things (IoT), Wireless Sensor Networks (WSNs), Artificial Intelligence (AI), distributed computing, and cloud computing enable continuous monitoring of pipelines to detect leakages and corrosion on the pipeline. The main challenge with using battery-powered sensor nodes to monitor pipelines is the energy constraint, necessitating frequent battery replacement. Thus, there is a need to develop energy-saving mechanisms to prolong the lifetime of these sensor nodes. In this paper, we use the diffusion approximation modelling framework in which the data from the experimental testbed are used to model the dynamics of the battery's energy content and to estimate the mean and variance of the device's lifetime. The novelty in the proposed diffusion model of the battery of an IoT node is the introduction of multiple energy thresholds that split the energy state-space of the battery into multiple energy-saving regimes. As the battery discharges, the node gradually transitions into energy-saving regimes by reconfiguring some of its parameters to reduce energy consumption (sometimes at the cost of trading off some performance metrics). We investigate the impact of energy-saving regimes or the number of thresholds on the node's lifetime.&lt;/pre&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy performance of Internet of Things (IoT) networks for pipeline monitoring</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy Performance of Off-Grid Green Cellular Base Stations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Performance Evaluation</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">165</style></VOLUME><DATE><style face="normal" font="default" size="100%">10/07/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
The most energy-hungry parts of mobile networks are the base station sites, which consume around $60-80\%$ of their total energy. One of the approaches for relieving this energy pressure on the electricity grid infrastructure and reducing the Operational Expenditures (OPEX) is to power base stations with renewable energy. However, the design of a green mobile network requires the dimensioning of the energy harvesting and storage systems through the estimation of the network's energy demand. Therefore, this paper develops a diffusion-based modelling framework for solar-powered green off-grid base station sites. We apply this framework to evaluate the energy performance of homogeneous and hybrid energy storage systems supplied by harvested solar energy. We present the complete analysis, with numerical examples, to study the relationship between the design parameters and the energy performance metrics. The numerical computations demonstrate how the proposed framework can be applied to evaluate homogeneous and unconventional hybrid energy storage systems.&lt;/pre&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy Performance of Off-Grid Green Cellular Base Stations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Markov Models for Dimensioning and Provisioning of Battery Energy Storage Systems (BESS) for Off-Grid Green Mobile Network Base Station Sites</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of the st 1 International Conference on Mathematical and Statistical Sciences(ICMSS-1)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ISBN><style face="normal" font="default" size="100%">978-99916-55-80-2</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
There is a growing desire by mobile network operators and other stakeholders to reduce carbon emissions from the operation of mobile networks. The widespread adoption of ultra-dense 5G and Internet of Things (IoT) networks will likely increase the energy demand from these networks significantly. In this paper, we model the density of the time required to charge BESS to its full capacity when the renewable energy sources can generate enough energy to meet the needs of the base station site and the density of the time required to completely deplete the energy stored in BESS when the renewable energy sources cannot generate a sufficient amount of energy to meet the demand of the site. We also investigate the influence of the design parameters, such as the energy supply-demand ratio, on the distribution of the time required to charge BESS to its full capacity (for a supply-demand ratio greater than one) and the time required to completely deplete the energy stored in BESS (for supply-demand ratio less than one).&lt;/pre&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">chrome-extehttps://icmss.nust.na/sites/default/files/ICMSS-1%20Conference%20Proceedings_1st%20Edition_Final-11apr24.pdf</style></URL><title><style face="normal" font="default" size="100%">Markov Models for Dimensioning and Provisioning of Battery Energy Storage Systems (BESS) for Off-Grid Green Mobile Network Base Station Sites</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</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%">Dropping or Marking: a Review and Evaluation of  Existing Fluid-Flow Approximation Models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">72</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5</style></ISSUE><SECTION><style face="normal" font="default" size="100%">e150333</style></SECTION><DATE><style face="normal" font="default" size="100%">09/2024</style></DATE><URL><style face="normal" font="default" size="100%">http://journals.pan.pl/Content/131546/PDF/BPASTS_2024_72_5_4300.pdf</style></URL><title><style face="normal" font="default" size="100%">Dropping or Marking: a Review and Evaluation of  Existing Fluid-Flow Approximation Models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sapana Sharma</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pradeep Singh</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy performance of self-powered Green IoT nodes</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Frontiers in Energy Research</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">12</style></VOLUME><DATE><style face="normal" font="default" size="100%">07/11/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The widespread adoption of the Internet of Things (IoT) partly depends on the successful design and deployment of IoT nodes that can operate for several years without any service outage and the need to replace their energy storage systems (e.g., battery, capacitor, or supercapacitor) when all the stored energy is depleted or when the cycle life of the Energy Storage Systems (ESS) is reached. Replacing batteries in the case of large-scale IoT networks and nodes located in places that are hard to reach is very challenging and costly, requiring the design of IoT nodes that can operate for several years without the need for human intervention. One such example is the deployment of IoT nodes in large agricultural fields (for soil or crop monitoring) or a long-distance pipeline (for pipeline monitoring). This paper investigates the practical implications of imposing energy-saving thresholds on the energy performance metrics of green IoT nodes. We propose an energy packet-based model for the evaluation of the energy performance of a green IoT node with the possibility of switching the node to energy-saving regimes on the fly when the energy content of the ESS reaches defined thresholds. Configuring single or multiple thresholds improves the energy performance of the node significantly (e.g., increases the lifetime of the node and reduces the probability of service outage and energy wastage), and the value of the threshold(s) should be carefully chosen. The energy performance of the IoT node can also be improved by dimensioning the energy harvesting system to ensure that the node operates for several years without running out of energy (e.g., maximizing the lifetime of the nodes and minimising the probability of service outage and energy wastage).&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy performance of self-powered Green IoT nodes</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Impact of energy leakage on the energy performance of green IoT nodes</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">32nd International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2024)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Krakow, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In the present paper, we investigate the impact of imperfections (non-idealities) of the energy storage system (e.g., batteries, capacitors, or supercapacitors) on the energy performance of green IoT nodes. In particular, we investigate the impact of energy leakage from the Energy Storage System (ESS) on important energy performance metrics, such as service outage probability, the density of the lifetime of the node, and the time-dependent mean number of energy packets (EPs) in the ESS. Also, we explore various strategies that can be employed to compensate for the impact of energy losses due to energy leakage on the energy performance metrics. Specifically, we examine two potential strategies for improving the energy performance of the IoT nodes: (i) through increasing the energy generation rate of the energy harvesters (e.g., by adding additional solar panels or replacing the existing solar panels with more efficient ones that can produce more energy), and (ii) through reducing the energy consumption rate of the IoT node (e.g., by configuring ESS energy thresholds below which the nodes are forced to operate in low energy consumption states).&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/10786519 </style></URL><title><style face="normal" font="default" size="100%">Impact of energy leakage on the energy performance of green IoT nodes</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Eric Djomadji</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Dimensioning the renewable energy system of a Green Cellular Base Station Site</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><SECONDARY_TITLE><style face="normal" font="default" size="100%">EAI/Springer Innovations in Communication and Computing </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The demand for mobile communication services has experienced astronomical growth in the past few decades and continues to grow steadily at a brisk rate. This is due partly to falling prices of user devices, the evolution of mobile applications, the widespread adoption of social media, and the recent advances in modern technologies such as the Internet of Things (IoT), cloud/fog computing, and Artificial Intelligence (AI). An expansion of mobile communication infrastructure to accommodate the rapidly growing demand and to migrate to new technologies (e.g., 4G/5G) have also resulted in a significant increase in the energy consumption of mobile networks. An attractive solution to reduce the carbon footprint of mobile networks and to reduce the energy bills of network operators is to deploy renewable energy systems(e.g., solar energy systems) to power base station sites. In this paper, we present a practical approach for dimensioning and evaluating renewable generation and storage systems for cellular base station sites. We use data collected from a base station site in Banda (North region of Cameroon) as input to the analytical model; we estimate the probability of service outage (when all the stored energy is consumed and the PV system is not able to generate energy).&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Dimensioning the renewable energy system of a Green Cellular Base Station Site</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling the Transient Evolution of Queues in Plugged-in Electric Vehicles(PEV) Fast Charging Stations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">25th International Conference on Computational Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Singapore</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Cham</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">07/2025</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-031-97635-3</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The transportation sector is responsible for approximately 23% of global greenhouse gas (GHG) emissions, with road transportation contributing nearly 70% of these emissions. The widespread adoption of electric vehicles (EVs) is transforming this sector by reducing emissions and decreasing reliance on fossil fuels. However, the growing number of EVs presents significant challenges for charging infrastructure, particularly in managing long queues, extended wait times, and limited station capacity. Most existing studies on the performance of electric vehicle charging stations assume Poisson arrivals and exponential charging times, simplifications that often overlook real-world variability. This paper introduces a generalized queueing model that leverages empirical interarrival and charging duration data for more accurate performance evaluation. A transient analysis is conducted, examining two operational optimization strategies aimed at minimizing queue sizes during peak demand: (1) a queue management policy that encourages charging only up to a predefined state-of-charge (SoC) threshold instead of the typical 80–100%, and (2) dynamic control of the number of active charging ports based on demand. The results show that these operational optimization policies improve the efficiency of the charging station and significantly improve the customer experience.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling the Transient Evolution of Queues in Plugged-in Electric Vehicles(PEV) Fast Charging Stations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Time-Dependent Analysis of the Interaction Between Energy Harvesting, Leakage, and Consumption Processes in a Green IoT Device</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"> IEEE Access </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Internet of Things (IoT) is transforming industries by enhancing productivity and efficiency; however, energy availability remains a significant challenge due to the limited capacity of batteries and supercapacitors powering IoT devices. The emergence of Green IoT (G-IoT) frameworks, which prioritize energy efficiency and renewable energy integration, offers a promising solution to address this challenge. Despite these advancements, energy storage systems (ESSs) face issues such as capacity degradation, leakage, and charge redistribution, which can lead to energy depletion and service disruptions. Traditional models often assume constant energy harvesting rates, overlooking the time-varying nature of environmental conditions that influence energy availability. In this paper, we propose a novel mathematical framework that incorporates time-dependent fluctuations in the energy harvesting rate to analyse the dynamic interactions between energy harvesting, leakage, and consumption in green IoT systems. Our approach includes an Energy Packet Network (EPN) model to represent transient energy dynamics and a Markov model to capture fluctuations in the energy harvesting rate. Through numerical simulations, we evaluate the impact of key design parameters, such as ESS capacity, mean energy consumption rate, energy leakage, and energy harvesting rate variations, on critical performance metrics including the probability of energy depletion and the transient mean number of stored energy packets. The results highlight the importance of considering time-varying energy harvesting in the design and optimization of IoT systems for long-term operation and sustainability.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Time-Dependent Analysis of the Interaction Between Energy Harvesting, Leakage, and Consumption Processes in a Green IoT Device</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zeynep Turgut</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Leveraging Packet Aggregation to Optimise QoS and Energy Trade-offs in 5G/6G Optical Fronthaul Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The 21st International Conference on Wireless and Mobile Computing, Networking and Communications.</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Marrakech, Morocco</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">02/12/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The growing demands of 5G and emerging 6G mobile networks—driven by the proliferation of IoT devices, immersive applications, and high-throughput services—necessitate more efficient and scalable fronthaul solutions. Open Radio Access Networks and cloud-RAN architectures offer promising frameworks by decoupling hardware and software and enabling centralised processing. However, the fronthaul segment still faces challenges related to bandwidth inefficiency, signalling overhead, and relatively high energy consumption, particularly due to the transmission of vast numbers of small packets. Packet aggregation emerges as a viable strategy to mitigate these challenges by grouping multiple small packets into larger payloads, thereby reducing protocol overhead, improving throughput efficiency, and lowering energy consumption in the network as a whole. This paper investigates the impact of packet aggregation on both quality of service (QoS) and energy efficiency in the fronthaul of 5G/6G mobile networks. While prior studies have examined its effects on throughput and latency, the implications for energy consumption remain underexplored. We evaluate how aggregation design parameters—such as time thresholds, size thresholds, and traffic intensity—influence performance metrics such as throughput and latency. We also propose ways to achieve an optimal trade-off between QoS and energy efficiency.&#160;Our findings offer insights into the design of energy-aware, delay-sensitive packet aggregation schemes tailored for next-generation mobile network architectures.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Leveraging Packet Aggregation to Optimise QoS and Energy Trade-offs in 5G/6G Optical Fronthaul Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy Dynamics of Green IoT Nodes with Time-Varying Energy Harvesting, Leakage, and Consumption Patterns</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">33rd International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication System</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Paris, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">12/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The growing proliferation of Internet of Things (IoT) devices has intensified the need for sustainable energy solutions, particularly in resource-constrained deployments where non-rechargeable batteries and supercapacitors are the primary energy sources. Green IoT (G-IoT) frameworks address this challenge by combining energy-saving techniques with energy harvesting from ambient sources such as solar power. However, the intermittent nature of renewable energy and the non-ideal behavior of energy storage systems—such as energy leakage and capacity degradation—complicate reliable energy provisioning. This paper presents a novel Markovian framework for modelling the coupled dynamics of time-varying solar energy harvesting, time-dependent energy consumption, and state-dependent energy leakage in G-IoT systems. Unlike traditional steady-state models, our approach uses Discrete-Time Markov Chains (DTMCs) to capture the stochastic variability in both energy harvesting and consumption processes. We also introduce a refined leakage model in which the leakage rate is dynamically dependent on the stored energy level, enabling a more realistic characterization of energy losses due to energy leakage. Through extensive analytical evaluation, we examine how key parameters—such as storage capacity, leakage rate coefficient, and energy harvesting and consumption patterns—affect critical performance metrics, including the mean stored energy and energy-related service outage probability. Furthermore, we propose a parameter tuning strategy to optimize energy reliability and storage efficiency. The proposed model provides valuable insights for the design and optimization of robust, energy-aware IoT systems powered by renewable energy sources.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy Dynamics of Green IoT Nodes with Time-Varying Energy Harvesting, Leakage, and Consumption Patterns</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analytical Power Efficiency Models for Open Radio Access Network (O-RAN)</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">33rd International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication System</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Paris, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">12/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The rapid deployment of 5G and the anticipated evolution to 6G have intensified the need for energy-efficient radio access networks, driven by rapidly growing power demands, rising energy costs, and environmental concerns. Open Radio Access Networks (O-RAN) offer a flexible and scalable architecture; however, their disaggregated nature requires accurate power modelling to optimise energy consumption. This paper proposes enhanced power consumption models for O-RAN that account for power efficiency gains from resource sharing across multiple radio units (O-RUs) and the offloading of highly parallel baseband processing tasks to specialised energy-efficient hardware accelerators such as ASICs, FPGAs, or GPUs. The models are used to analyse the scaling behavior of O-RUs, distributed units (O-DUs), and centralized units (O-CUs) under varying deployment scenarios. Results show that O-RUs dominate the total network power budget, while O-DUs benefit from sublinear growth due to statistical multiplexing, and O-CUs scale the slowest owing to centralised control-plane sharing. Furthermore, the study identifies optimal ranges of RU-to-DU aggregation and accelerator utilization for maximising energy efficiency in large-scale 5G/6G O-RAN deployments.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Analytical Power Efficiency Models for Open Radio Access Network (O-RAN)</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tulin Atmaca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Power models for O-RAN O-DU planning and optimisation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Consumer Communications and Networking Conference (CCNC 2026)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Las Vegas, NV, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The transition from 5G to 6G networks is driving an unprecedented densification of Radio Access Networks (RANs), resulting in increased energy demand and operational costs. Open RAN (O-RAN) architectures, which disaggregate baseband processing across commercial off-the-shelf (COTS) servers, further amplify these challenges due to the power sensitivity of the Distributed Unit (O-DU) to traffic load variations.&#160;This paper develops a nonlinear O-DU power model that captures load-dependent efficiency effects and integrates it into a dynamic core management framework, which activates or deactivates CPU cores based on instantaneous traffic demand. The effectiveness of the proposed dynamic core management framework is investigated in multi-RU O-RAN scenarios, comparing the proposed dynamic approach with a static baseline. Simulation results show that the dynamic scheme reduces energy consumption by up to $59.42\%$ on average under light traffic, with instantaneous savings exceeding $70\%$ during off-peak periods, while maintaining performance. These findings demonstrate that workload-aware core provisioning can deliver substantial energy efficiency gains in O-RAN deployments, particularly in lightly to moderately loaded networks.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Power models for O-RAN O-DU planning and optimisation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Strzoda</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lynda Mokdad</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The impact of CSMA on LoRaWAN gateways' performance in IoT networks</style></TITLE></TITLES><KEYWORDS><KEYWORD><style face="normal" font="default" size="100%">LoRa</style></KEYWORD></KEYWORDS><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Las Vegas USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">02/2026</style></DATE><KEYWORD><style face="normal" font="default" size="100%"/></KEYWORD><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The CSMA mode of operation was recently added to the LoRaWAN standard. We investigate, using a queueing model, how the introduction of CSMA in the communication between devices and the gate in LoRaWan may increase the probability of successful transmission. &#160;In the proposed model, customers (transmissions) are served by a multichannel station (gate), and the number of channels corresponds to the number of transmissions that can be performed in parallel. We introduce a queueing model with multiple attempts to find a free channel and investigate their impact on transmission throughput and reliability.&lt;br /&gt;&#13;
&#160;&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/11366536</style></URL><title><style face="normal" font="default" size="100%">The impact of CSMA on LoRaWAN gateways' performance in IoT networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%"> Queueing Theory and Diffusion Approximation with their Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Materials for Lectures at UPES Univerity Dehradun, India</style></SECONDARY_TITLE><DATE><style face="normal" font="default" size="100%">05/2026</style></DATE><title><style face="normal" font="default" size="100%"> Queueing Theory and Diffusion Approximation with their Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Strzoda</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jean Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lynda Mokdad</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Monika Nycz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Nycz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Impact of CSMA on LoRaWAN Communication Efficiency: A Diffusion Approximation Model</style></TITLE></TITLES><KEYWORDS><KEYWORD><style face="normal" font="default" size="100%">Diffusion approximation; LPWAN; CSMA</style></KEYWORD></KEYWORDS><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Nineteen International Workshop on Selected Topics in Mobile and Wireless Computing WiMob</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Avignon, France</style></PLACE_PUBLISHED><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><KEYWORD><style face="normal" font="default" size="100%"/></KEYWORD><title><style face="normal" font="default" size="100%">The Impact of CSMA on LoRaWAN Communication Efficiency: A Diffusion Approximation Model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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%">S. Chmiel</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><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">JavaScript Frameworks and Ajax Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">57–68</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Java Script frameworks are useful in the development of interactive web pages. Ajax technology supports a dialog with the WWW server. This article compares performance and functionality of the Ajax libraries for major Web browsers. The size of the libraries, their load time and execution time is compared. The article also evaluates the Document Object Model(DOM) support provided by selected libraries.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">21th International Conference, Computer Networks 2014, Brunów, Poland,June 23-27, 2014</style></NOTES><title><style face="normal" font="default" size="100%">JavaScript Frameworks and Ajax Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</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%">M. Rostański</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Sieci komputerowe</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wyższa Szkoła Biznesu w Dąbrowie Górniczej</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">978-83-88936-34-0</style></ISBN><title><style face="normal" font="default" size="100%">Sieci komputerowe</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">D. Augustyn</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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A choice of optimal packet dropping function for active queue management</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science 79</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">A choice of optimal packet dropping function for active queue management</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Markowowskie modele natężenia przesyłów internetowych.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Pracownia Komputerowa Jacka Skalmierskiego</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Instytut Informatyki Teoretycznej i Stosowanej Polskiej Akademii Nauk</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">978-83-62652-69-3</style></ISBN><title><style face="normal" font="default" size="100%">Markowowskie modele natężenia przesyłów internetowych.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Int. J. Appl. Math. Comput. Sci.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">697–707</style></PAGES><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><title><style face="normal" font="default" size="100%">A red modified weighted moving average for soft real-time application</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">D. Augustyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The choice of optimal 3-rd order polynomial packet dropping function for NLRED in the presence of self-similar traffic</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">60</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><ABSTRACT><style face="normal" font="default" size="100%">Algorithms of queue management in IP routers determine which packet should be deleted when necessary. The article investigates the influence of the self-similarity on the optimal packet rejection probability function in a special case of NLRED queues. This paper describes another approach to the non-linear packet dropping function. We propose to use the solutions based on the polynomials with degree equals to 3. The process of obtaining the optimal dropping packets function has been presented. Our researches were carried out using the Discrete Event Simulator OMNET++. The AQM model was early verified using the discrete-time Markov chain. The obtained results show that the traffic characteristic has the great impact on the network node behavior, but self-similarity of network traffic has no influence on the choosing of the optimal dropping packet function.</style></ABSTRACT><title><style face="normal" font="default" size="100%">The choice of optimal 3-rd order polynomial packet dropping function for NLRED in the presence of self-similar traffic</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo WSB</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Active Queue Management in Linux based routers</style></SECTION><title><style face="normal" font="default" size="100%">Advanced problems of Internet technologies</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Impact of the Modified Weighted Moving Average on the Performance of the RED Mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">37–44</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Algorithms of queue management in IP routers determine which packet should be deleted shen necessary. the article investigates the influence of weighted movind average on the performance of the RED mechanism. The proposed average queue length calculating method is based on a difference equation (a recursive equation). Depending on a particular criterion of optimization a proper parameters of modified weighted moving average function may be chosen</style></ABSTRACT><title><style face="normal" font="default" size="100%">The Impact of the Modified Weighted Moving Average on the Performance of the RED Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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%">P. Kasprzyk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Widera</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Widera</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%">Systemy czasu rzeczywistego Projektowanie i aplikacje.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Analiza systemu rejestrującego sygnały biomedyczne</style></SECTION><title><style face="normal" font="default" size="100%">Systemy czasu rzeczywistego Projektowanie i aplikacje.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Kowalski</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%">Modeling of Internet 3D Traffic Using Hidden Markov Models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2009</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Advances in Intelligent and Soft Computing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer Verlag</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">64</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Modeling of Internet 3D Traffic Using Hidden Markov Models</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Artykuł podejmuje temat modelowania złożoności przesyłu siatek progresywnych 3D.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modeling of Internet 3D Traffic Using Hidden Markov Models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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%">Andrzej Grzywak</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%">Zastosowanie Internetu w społeczeństwie informacyjnym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo WSB</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Przegląd implementacji protokołu RSVP w systemie operacyjnym FreeBSD</style></SECTION><title><style face="normal" font="default" size="100%">Zastosowanie Internetu w społeczeństwie informacyjnym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cielplaka Str. 1c, 41-300 Dąbrowa Górnicza</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Academy of Business in Dabrowa Gornicza</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">AQM algorithms for aggressive network streams.</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-83-62897-40-7</style></ISBN><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><title><style face="normal" font="default" size="100%">Internet in the Information Society Computer Systems Architecture and Security</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">25</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">49–66</style></PAGES><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><title><style face="normal" font="default" size="100%">Analysis of CHOKe-Family Active Queue Management</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Developmental Period Medicine Medycyna Wieku Rozwojowego</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">XVII</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">224–231</style></PAGES><NOTES><style face="normal" font="default" size="100%">Badania Polskiej Sieci Neonatologicznej</style></NOTES><title><style face="normal" font="default" size="100%">Epidemiologia zakażeń noworodków z bardzo małą masą urodzeniową</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">A. Różańska</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. Gulczyń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%">P.B. Heczko</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Necrotising Enterocolitis in Preterm Infants: Epidemiology and Antibiotic Consumption in the Polish Neonatology Network Neonatal Intensive Care Units in 2009</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">PLOS One</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">9</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">e92865</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The aim of this study was to describe the epidemiology of necrotising enterocolitis (NEC), antibiotic consumption and the usefulness of microbiological tests in very low birth weight (VLBW) Polish newborns.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Necrotising Enterocolitis in Preterm Infants: Epidemiology and Antibiotic Consumption in the Polish Neonatology Network Neonatal Intensive Care Units in 2009</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">E. Gulczyńska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Nowiczewski</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%">A. Merritt</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. Gadzinowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Szczapa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P Adamski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Late-onset bloodstream infections of Very-Low-Birth-Weight infants: data from the Polish Neonatology Surveillance Network in 2009-2011</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">BMC Infectious Deseases</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><PAGES><style face="normal" font="default" size="100%">339–346</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Background: Late-Onset Bloodstream infections (LO-BSI) continue to be one of the most important complications associated with hospitalization of infants born with very low birth weight )VLBW). Ahe aims of this stydy were to assess the epidemiology of LO-BSI together with the risk factors and the distribution of causative pathogens at six Polish neonatal intensive care units that participated in the Polish Neonatology Surveillance Network from January 1, 2009 to December 31, 2011. Conclusions: Independent risk factor for LO-BSI in VLBV infants are: low gestational age and requirement for surgery. The incidence rates of LO-BSI especially CVC-BSI were higher in the Polish NICUs surveillance than those of other national networks, similar to the central- and peripheral utilization ratio.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Late-onset bloodstream infections of Very-Low-Birth-Weight infants: data from the Polish Neonatology Surveillance Network in 2009-2011</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The Pediatric Infectious Disease Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">31</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">7</style></NUMBER><PAGES><style face="normal" font="default" size="100%">691–695</style></PAGES><DATE><style face="normal" font="default" size="100%">7</style></DATE><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></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">M. Hubczyk</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%">Adrian Kapczyński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet - Technical developments and Applications 2</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Advances in Intelligent and Soft Computing</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">118</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Local and remote file inclusion.</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-3-642-25354-6</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">In this paper we have examined Local and Remote File Inclusion vulnerabilities in details. It is proven that these security flaws may lead to variety of problems including generation of big load to the server as well as disclosure of files which should not be accessible by the clients. These attacks are not so popular as SQL injection or Cross-Site Scripting but still they are subject of serious threat because of their consequences.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Internet - Technical developments and Applications 2</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Sieci Komputerowe Aplikacje i zastosowania</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">2</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Symulacja protokołu TCP/IP z wykorzystaniem pakietu INET/OMNET++</style></SECTION><title><style face="normal" font="default" size="100%">Sieci Komputerowe Aplikacje i zastosowania</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Simulation models of fair scheduling for the TCP and UDP streams</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2009</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Simulation models of fair scheduling for the TCP and UDP streams</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</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%">Symulator zdarzeń dyskretnych OMNeT++v.3.3</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2009</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WSB</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">978-83-88936-70-8</style></ISBN><title><style face="normal" font="default" size="100%">Symulator zdarzeń dyskretnych OMNeT++v.3.3</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Progressive 3D meshes transmission: traffic generating and simulation evaluation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">22</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">247–259</style></PAGES><DATE><style face="normal" font="default" size="100%">11</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The paper presents issues related to the progressive transmission of 3D meshes in clientserver architecture. A tool generating network traffic for different 3D scenes and scenarios is presented. The objective was to evaluate the transmission dynamics and possible impact of 3D traffic on the amount of data available in VR browsing client, which relates to browsing QoE (Quality of Experience). Simulation studies were carried out and HMM model of traffic generated by 3D server was worked out, planned for use in modeling works on future internet protocols, servicing 3D traffic.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">DOI: 10.2478/v10179-010-0012-2</style></NOTES><title><style face="normal" font="default" size="100%">Progressive 3D meshes transmission: traffic generating and simulation evaluation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">P. Pawlas</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%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Computer Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">291</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Universal Web pages content parser</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-3-642-31216-8</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">This article describes the universal web pages content parser-cross-platform application enhancing the process of data extraction from the web pages. In this implementation user friendly interface, possibility of significant automation and reusability of already created patterns had been the key elements. Moreover, the original approach to the issue of parsing the not well-formed HTML, stating the application`s core, is precisely presented. Universal web pages content parser shows that the simplified web scrapping utility may be available to masses and not well-formed HTML sources may feed useful tree-like data structures as well as the well-formed ones.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Computer Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jadwiga Wójkowska-Mach</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Allen Merritt</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Maria 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%">Ewa Gulczyńska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marek Nowiczewski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ewa Helwich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Agnieszka Kordek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dorota Pawlik</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paweł Adamski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Device-associated pneumonia of very low birth weight infants in Polish Neonatal Intensive Care Units</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Advances in Medical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">61</style></VOLUME><PAGES><style face="normal" font="default" size="100%">90 - 95</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;AbstractPurpose Late-Onset Pneumonia (LO-PNEU) is still the most important complication associated with the hospitalization of infants with very low birth weight (&lt;1501 g). The purpose of this paper is to summarize the results of an ongoing surveillance program defining LO-PNEU as associated or not associated with respiratory support in the \{NICU\} and distribution of causative pathogens from the Polish Neonatology Surveillance Network (PNSN). Materials and methods Surveillance of infections was conducted in the years 2009–2011 at six Polish NICUs. Results The incidence was 3.1/1000 \{NICU\} patient days (pds). The mean gestational age and birth weight among infants with LO-PNEU were significantly lower. The \{VAP\} incidence was of 18.2/1000 \{NICU\} pds for mechanically ventilated (MV) infants, while the rates for those receiving only \{CPAP\} were as low as 7.7/1000 \{NICU\} pds. \{MV\} significantly increased the risk of PNEU, but \{MV\} or \{CPAP\} for &lt;10 days did not increase the risk of LO-PNEU. Significantly associated with LO-PNEU was the use of central or peripheral venous catheters and total parenteral nutrition for longer periods. Microorganisms isolated in cases of LO-PNEU were Gram-positive cocci (53.5%) and Gram-negative rods, with predominating E. coli. Non fermentative bacilli were significantly more frequent in cases of \{VAP\} than in other cases. Conclusions Observed incidence rates associated with \{VAP\} and CPAP-PNEU, were higher than in other national surveillance systems and expressing the feasibility of lowering the risk of LO-PNEU and increasing patient safety. The incidence of pneumonia was found to be lower when using \{CPAP\} as compared to using MV.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S1896112615000498</style></URL><title><style face="normal" font="default" size="100%">Device-associated pneumonia of very low birth weight infants in Polish Neonatal Intensive Care Units</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Anna Różańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Jarynowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Kopeć-Godlewska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jadwiga Wójkowska-Mach</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Agnieszka Misiewska-Kaczur</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marzena Lech</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Małgorzata Rozwadowska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marlena Karwacka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Liberda</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Does surgical site infection after Caesarean section in Polish hospitals reflect high-quality patient care or poor postdischarge surveillance? Results from a 3-year multicenter study.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">American Journal of Infection Control</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">46</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><PAGES><style face="normal" font="default" size="100%">20-25</style></PAGES><SECTION><style face="normal" font="default" size="100%">20</style></SECTION><title><style face="normal" font="default" size="100%">Does surgical site infection after Caesarean section in Polish hospitals reflect high-quality patient care or poor postdischarge surveillance? Results from a 3-year multicenter study.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Cognitive Routing for Improvement of IoT Security</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2019 IEEE International Conference on Fog Computing ICFC</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Prague, Czechia</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">06/2019</style></DATE><ISBN><style face="normal" font="default" size="100%">978-1-7281-3236-5</style></ISBN><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/8822037</style></URL><title><style face="normal" font="default" size="100%">Cognitive Routing for Improvement of IoT Security</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Fröhlich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</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%">Self-Aware Networks that Optimize Security, QoS and Energy</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of the IEEE</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">108</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">7</style></ISSUE><DATE><style face="normal" font="default" size="100%">July 2020</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The need to adaptively manage computer systems and networks so as to offer good Quality of Service (QoS) and Quality of Experience (QoE), with secure operation at relatively low levels of energy consumption is challenged by their sheer complexity and the wide variability of the workloads. A possible way forward is through self-awareness, whereby self-measurement and self-observation, together with on-line control mechanisms which operate adaptively to attain the required performance and QoE. We survey the premises for these ideas coming from Cognitive Science and Active Networks, and review recent work on self-aware computer systems and networks, including those that propose the use of Software Defined Networks as a means to implement these concepts. Then we provide some examples from the literature on self-aware systems to illustrate the performance gains that they can provide. Finally we detail an example system and its working algorithms to allow the reader to understand how such a system may be implemented. Measurements showing how it can react rapidly to changing network conditions regarding Quality of Service (QoS) and security are also presented. Some conclusions and suggestions for further work are also presented&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/9103525</style></URL><title><style face="normal" font="default" size="100%">Self-Aware Networks that Optimize Security, QoS and Energy</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paweł Boryszko</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Optimum checkpoints for time and energy</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE MASCOTS 2020</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEEXpress</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">10/2020</style></DATE><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/9285959</style></URL><title><style face="normal" font="default" size="100%">Optimum checkpoints for time and energy</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</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%">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%">Long-Range Dependent Traffic Classification with Convolutional Neural Networks Based on Hurst Exponent Analysis</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Entropy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">22</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">10</style></ISSUE><DATE><style face="normal" font="default" size="100%">2020</style></DATE><title><style face="normal" font="default" size="100%">Long-Range Dependent Traffic Classification with Convolutional Neural Networks Based on Hurst Exponent Analysis</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Random Neural Network as a Bonding Model for Software Vulnerability Prediction</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Modelling, Analysis, and Simulation of Computer and Telecommunication Systems</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">12527</style></VOLUME><PAGES><style face="normal" font="default" size="100%">102-116</style></PAGES><TERTIARY_TITLE><style face="normal" font="default" size="100%">Computer Communication Networks and Telecommunications, LNCS</style></TERTIARY_TITLE><URL><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-68110-4_7</style></URL><title><style face="normal" font="default" size="100%">The Random Neural Network as a Bonding Model for Software Vulnerability Prediction</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Random Neural Network for Lightweight Attack Detection in the IoT</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">MASCOTS 2020: Modelling, Analysis, and Simulation of Computer and Telecommunication Systems</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">12527</style></VOLUME><PAGES><style face="normal" font="default" size="100%">79-91</style></PAGES><TERTIARY_TITLE><style face="normal" font="default" size="100%">Computer Communication Networks and Telecommunications, LNCS</style></TERTIARY_TITLE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Cyber-attack detection has become a basic component of all information processing systems, and once an attack is detected it may be possible to block or mitigate its effects. This paper addresses the use of a learning recurrent Random Neural Network (RNN) to build a lightweight detector for certain types of Botnet attacks on IoT systems. Its low computational cost based on a small 12-neuron recurrent architecture makes it particularly attractive for edge devices. The RNN can be trained off-line using a fast simplified gradient descent algorithm, and we show that it can lead to high detection rates of the order of 96%, with false alarm rates of a few percent.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-68110-4_5</style></URL><title><style face="normal" font="default" size="100%">Random Neural Network for Lightweight Attack Detection in the IoT</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paweł Boryszko</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Efficient Feature Selection for Static Analysis Vulnerability Prediction</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">21 (4)</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">Special Issue: Security and Privacy in Software Based Critical Contexts</style></ISSUE><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/1424-8220/21/4/1133</style></URL><title><style face="normal" font="default" size="100%">Efficient Feature Selection for Static Analysis Vulnerability Prediction</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">LIDAR Point Cloud generation for SLAM algorithm evaluation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">21 (10)</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">Special Issue: Advance in Sensors and Sensing Systems for Driving and Transportation: Part B</style></ISSUE><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/1424-8220/21/10/3313</style></URL><title><style face="normal" font="default" size="100%">LIDAR Point Cloud generation for SLAM algorithm evaluation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Szymon Mendla</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Supervised learning of Neural Networks for Active Queue Management in  the Internet</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">21(15)</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">Special Issue "Mathematical Modelling and Analysis in Sensors Networks"</style></ISSUE><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/1424-8220/21/15/4979</style></URL><title><style face="normal" font="default" size="100%">Supervised learning of Neural Networks for Active Queue Management in  the Internet</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Charalampos Marantos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tsoukalas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christos Lamprakos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lazaros Papadopoulos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paweł Boryszko</style></AUTHOR><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%">Apostolos Ampatzoglou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Alexander Chatzigeorgiou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dionysios Kehagias</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Soudris</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">SDK4ED: One-click platform for Energy-aware, Maintainable and Dependable Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">25th Design, Automation and Test in Europe Conference</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Belgium</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">03/2022</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;Developing&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;modern&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;secure&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;and&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;low-energy&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;applica&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;tions in a short time imposes new challenges and creates the need &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;of&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;designing&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;new&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;&#160;&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;software&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;tools&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;to&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;assist&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;developers&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;in&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;all&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;phases &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;of&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;application&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;development.&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;The&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;design&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;of&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;such&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;tools&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;cannot &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;be&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;considered&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;a&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;trivial&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;task,&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;as&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;they&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;should&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;be&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;able&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;to&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;provide&lt;/span&gt; &lt;span style="font-family:sans-serif; font-size:14.944px"&gt;optimization&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;of&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;multiple&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;quality&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;requirements.&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;In&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;this&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;paper,&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;we &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;introduce&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;the&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;SDK4ED&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;platform,&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;which&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;incorporates&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;advanced&lt;/span&gt; &lt;span style="font-family:sans-serif; font-size:14.944px"&gt;methods and tools for measuring and optimizing maintainability, &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;dependability&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;and&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;energy.&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;The&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;presented&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;solution&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;offers&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;a&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;com&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;plete&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;tool-flow&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;for&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;providing&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;indicators&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;and&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;optimization&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;meth&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;ods&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;with&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;emphasis&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;on&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;embedded&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;software.&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;Effective&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;forecasting&lt;/span&gt; &lt;span style="font-family:sans-serif; font-size:14.944px"&gt;models&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;and&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;decision-making&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;solutions&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;are&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;also&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;implemented&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;to &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;improve&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;the&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;quality&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;of&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;the&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;software,&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;respecting&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;the&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;constraints&lt;/span&gt; &lt;span style="font-family:sans-serif; font-size:14.944px"&gt;imposed&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;on&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;maintenance&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;standards,&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;energy&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;consumption&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;limits &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;and&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;security&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;vulnerabilities.&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;The&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;use&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;of&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;the&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;SDK4ED&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;platform&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;is&lt;/span&gt; &lt;span style="font-family:sans-serif; font-size:14.944px"&gt;demonstrated&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;in&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;a&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;healthcare&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;embedded&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; &lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;application.&lt;/span&gt;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">SDK4ED: One-click platform for Energy-aware, Maintainable and Dependable Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Duda</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Cost-Effective Filtering of Unreliable Proximity Detection Results Based on BLE RSSI and IMU Readings Using Smartphones</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">12</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><SECTION><style face="normal" font="default" size="100%">2440</style></SECTION><URL><style face="normal" font="default" size="100%">https://www.nature.com/articles/s41598-022-06201-y</style></URL><title><style face="normal" font="default" size="100%">Cost-Effective Filtering of Unreliable Proximity Detection Results Based on BLE RSSI and IMU Readings Using Smartphones</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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><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%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marta Szczygieł</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Adaptive Hurst-Sensitive Active Queue Management</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Entropy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3</style></ISSUE><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/1099-4300/24/3/418</style></URL><title><style face="normal" font="default" size="100%">Adaptive Hurst-Sensitive Active Queue Management</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">NAM: What Does a Neural Network See?</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Joint Conference on Neural Networks (IJCNN 2022), IEEE WCCI 2022</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Padova, 18-23 July, 2022</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/9892442</style></URL><title><style face="normal" font="default" size="100%">NAM: What Does a Neural Network See?</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Software Vulnerabilities in TensorFlow-Based Deep Learning Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">124</style></VOLUME><DATE><style face="normal" font="default" size="100%">10/2022</style></DATE><URL><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S0167404822003406?via%3Dihub</style></URL><title><style face="normal" font="default" size="100%">Software Vulnerabilities in TensorFlow-Based Deep Learning Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><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%">Adam Domański</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Finding the best hardware configuration for 2D SLAM in indoor environments via simulation based on Google Cartographer</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">12</style></VOLUME><URL><style face="normal" font="default" size="100%">https://www.nature.com/articles/s41598-022-22938-y</style></URL><title><style face="normal" font="default" size="100%">Finding the best hardware configuration for 2D SLAM in indoor environments via simulation based on Google Cartographer</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><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%">Adam Domański</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Building a real-time testing platform for unmanned ground vehicles with UDP Bridge</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">22</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">21</style></ISSUE><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/1424-8220/22/21/8493</style></URL><title><style face="normal" font="default" size="100%">Building a real-time testing platform for unmanned ground vehicles with UDP Bridge</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><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%">Rafał Cupek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Real-time testing of vision-based systems for AGVs with ArUco markers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE International Conference on Big Data</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Osaka, 17-20 December, 2022</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/10020817</style></URL><title><style face="normal" font="default" size="100%">Real-time testing of vision-based systems for AGVs with ArUco markers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Global Entropy Pooling Layer for Convolutional Neural Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Neurocomputing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">555</style></VOLUME><URL><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S0925231223007385</style></URL><title><style face="normal" font="default" size="100%">Global Entropy Pooling Layer for Convolutional Neural Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Recycling of Generic ImageNet-trained Models for Smart-city Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The 10th IEEE International Conference on Data Science and Advanced Analytics (DSAA)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Thessaloniki, Greece</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><title><style face="normal" font="default" size="100%">Recycling of Generic ImageNet-trained Models for Smart-city Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">HierAct: a Hierarchical Model for Human Activity Recognition in Game-Like Educational Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2023 IEEE International Conference on Big Data</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Sorrento, Italy </style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">01/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Constantly evolving landscape of modern education makes the integration of technology crucial to enable more interactive and immersive learning experiences. One of the key problems in this domain is Human Activity Recognition (HAR), which uses standard smartphone sensors to understand and recognize user movements. While HAR exhibits high potential in this area, its persistent challenge is to differentiating between similar activities, whose occurrences can often lead to misclassification and reduced quality of applications. To tackle this problem, we employ specialized classifiers and use them in a hierarchical manner instead of using monolith multi-class models. We propose HierAct - a Hierarchical model that solves the multi-class human activity recognition problem. We also release a new HAR dataset - EduAct - (https://github.com/iitis/HierAct-Dataset) focused on activities that could be used to create game-like educational applications.Our results show that the performance of the proposed model is substantially better than other state-of-the-art machine learning models. Our work shows the potential of hierarchical classifiers in HAR applications for education, by offering educators and students a more accurate, reliable, and engaging interactive experience.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/10386919</style></URL><title><style face="normal" font="default" size="100%">HierAct: a Hierarchical Model for Human Activity Recognition in Game-Like Educational Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marzena Halama</style></AUTHOR><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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Robust category recognition based on deep templates for educational mobile applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2023 IEEE International Conference on Big Data</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Sorrento, Italy</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE International Conference on Big Data</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">01/2024</style></DATE><title><style face="normal" font="default" size="100%">Robust category recognition based on deep templates for educational mobile applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">NetSat: Network Saturation Adversarial Attack</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE International Conference on Big Data (IEEE BigData 2023)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Sorrento, Italy</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">NetSat: Network Saturation Adversarial Attack</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marzena Halama</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Visual examination of relations between known classes for deep neural network classifiers.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2023 IEEE International Conference on Big Data</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Sorrento, Italy</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">01/2024</style></DATE><title><style face="normal" font="default" size="100%">Visual examination of relations between known classes for deep neural network classifiers.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tsoukalas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Charalambos Marantos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lazaros Papadopoulos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christos Lamprakos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Oliviu Matei</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christos Strydis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Muhammad Siddiqi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Philippe Chrobocinski</style></AUTHOR><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%">Paris Avgeriou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Apostolos Ampatzoglou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Soudris</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Alexander Chatzigeorgiou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dionysios Kehagias</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">SDK4ED: a platform for building energy efficient, dependable, and maintainable embedded software</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Automated Software Engineering</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">SDK4ED: a platform for building energy efficient, dependable, and maintainable embedded software</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Extracting coarse-grained classifiers from large Convolutional Neural Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Engineering Applications of Artificial Intelligence</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">138</style></VOLUME><DATE><style face="normal" font="default" size="100%">12/2024</style></DATE><URL><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S0952197624015355</style></URL><title><style face="normal" font="default" size="100%">Extracting coarse-grained classifiers from large Convolutional Neural Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><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><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Similarity-driven adversarial testing of neural networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Knowledge-Based Systems</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">305</style></VOLUME><DATE><style face="normal" font="default" size="100%">12/2024</style></DATE><URL><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S0950705124012553</style></URL><title><style face="normal" font="default" size="100%">Similarity-driven adversarial testing of neural networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>10</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Biernacki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Francisco Ferrão</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Shahid Mumtaz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Fideline Tchuenbou-Magaia</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Artificial Intelligence for Electronic-based Systems in Safety Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">02/2025</style></DATE><URL><style face="normal" font="default" size="100%">https://www.researchgate.net/publication/389204536_Artificial_Intelligence_for_Electronic-based_Systems_in_Safety_Applications</style></URL><title><style face="normal" font="default" size="100%">Artificial Intelligence for Electronic-based Systems in Safety Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">What is the doggest dog? Examination of typicality perception in ImageNet-trained networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Neural Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">188</style></VOLUME><SECTION><style face="normal" font="default" size="100%">107425</style></SECTION><title><style face="normal" font="default" size="100%">What is the doggest dog? Examination of typicality perception in ImageNet-trained networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Biernacki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Visual Encoding Method for Semantic Mapping with Federated Learning Concept</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">MobiHoc '25: Proceedings of the Twenty-sixth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (ACM Symposium on Mobile Ad Hoc Networking and Computing)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ACM</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">428 - 435</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We present a visual encoding method for semantic mapping in indoor environments, designed to minimize redundancy in image data and support federated learning across a fleet of service robots. Our pipeline combines 2D LiDAR-based segmentation with RGB image filtering based on geometric orientation, distance, visibility, and uniqueness. The result is a compact set of representative visual samples suitable for downstream semantic tasks such as object recognition or language grounding. We evaluate our method in a Gazebo simulation using a TurtleBot platform and compare it against a naive odometry-based sampling strategy. Our approach achieves up to 57.5\% reduction in collected images while preserving scene coverage. Additionally, we demonstrate how multiple robots can collaboratively improve the visual map in a federated setup, reducing collection time and enabling model generalization across diverse environments. The proposed method offers an efficient and scalable solution for semantic mapping under bandwidth and computation constraints.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1145/3704413.3765513</style></URL><title><style face="normal" font="default" size="100%">Visual Encoding Method for Semantic Mapping with Federated Learning Concept</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">How CNNs and ViTs perceive similarities between categories</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><URL><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-032-06078-5_2</style></URL><title><style face="normal" font="default" size="100%">How CNNs and ViTs perceive similarities between categories</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marzena Halama</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konrad Połys</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Speech-based analysis of aggression in social content: resistance of Large Language Models to signal degradation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2025 IEEE International Conference on Big Data</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Macau SAR, China</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE BigData 2025</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Artificial Intelligence (AI) systems, including robotic assistants and voice interfaces, are increasingly present in public spaces such as airports, train stations, hospitals, and government offices, offering new opportunities to enhance user safety and comfort. Detecting aggression and hate speech in audio data from such locations is critical to protecting users and creating safe spaces. Previous approaches in this area have mainly relied on classification using classical Machine Learning (ML) methods and Deep Learning (DL) techniques, primarily focused on pure text analysis. However, most systems do not take into account real-world challenges such as background noise, incomplete utterances, or transcription errors resulting from automatic speech recognition. In this work, we propose a comprehensive approach that exploits the potential of Large Language Models (LLMs) to classify aggressive content in degraded audio transcriptions. We create a realistic test environment by converting tagged social media posts with offensive content into recordings with simulated noise and compare the performance of the models under different data quality conditions. Our research provides practical guidance on how to build more resilient and accessible voice moderation systems using LLM.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Speech-based analysis of aggression in social content: resistance of Large Language Models to signal degradation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marzena Halama</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Gancarczyk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mirzokhid Abdirakhimov</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Tworzenie bazy danych zeolitów z użyciem LLM</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Praca dotyczy opracowania zautomatyzowanego systemu tworzenia i zarządzania bazą danych zeolitów z wykorzystaniem dużych modeli językowych (LLM). Zaprojektowane rozwiązanie umożliwia ekstrakcję, ujednolicanie i strukturyzację informacji dotyczących syntezy, właściwości oraz zastosowań zeolitów na podstawie dokumentów tekstowych, takich jak publikacje naukowe i raporty badawcze. W procesie budowy bazy wykorzystano dane International Zeolite Association – Structure Commission oraz model LLM do identyfikacji kluczowych parametrów syntezy. Opracowana baza danych stanowi fundament pod przyszły system rekomendacyjny wspierający dobór odpowiednich zeolitów do konkretnych zastosowań.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Tworzenie bazy danych zeolitów z użyciem LLM</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">When LLMs Speak ZigBee: Exploring Low-Latency and Reasoning Models for Network Traffic Generation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The generation of realistic network traffic is a critical requirement for testing, simulation, and security evaluation in ZigBee-based IoT systems. In this study, we propose a novel framework that extracts sample ZigBee traffic packets and generates semantically meaningful and protocol-compliant synthetic traffic by using Large Language Models (LLMs) such as GPT-4.1 and GPT-5. Unlike traditional rule-based or statistical generators, our approach is data-driven and incorporates sample-based few-shot learning, prompt engineering, and a human-in-the-loop feedback mechanism. To evaluate the effectiveness of the proposed framework, we conduct two sets of experiments. The first focuses on generating unidirectional traffic to emulate typical device-to-hub communication, while the second extends this setup to bidirectional exchanges, capturing realistic request--response dynamics and interaction patterns. The realism of the generated traffic is assessed using a multi-dimensional evaluation framework that includes statistical similarity measures, such as Jensen--Shannon Divergence, as well as protocol compliance, semantic correctness, temporal consistency, and diversity metrics. In addition, we compare the performance of LLM-based generators with classical deep learning baselines, including recurrent neural networks (RNNs) and generative adversarial networks (GANs). We further analyze the computational cost and the impact of internal reasoning effort on traffic generation by systematically evaluating different GPT-5 reasoning configurations. Experimental results show that both GPT-4.1 and GPT-5 successfully learn the temporal and structural dependencies of ZigBee traffic and significantly outperform RNN and GAN baselines in terms of semantic correctness and long-duration generation. Across all experiments, GPT-4.1 consistently generates traffic that more closely resembles real ZigBee traffic while requiring substantially lower computational resources. These findings highlight that low-latency, non-reasoning LLMs can be particularly well suited for highly structured, protocol-constrained network traffic generation tasks, and demonstrate the potential of LLM-based approaches for realistic IoT traffic generation in research and security evaluation.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.nature.com/articles/s41598-026-37246-y</style></URL><title><style face="normal" font="default" size="100%">When LLMs Speak ZigBee: Exploring Low-Latency and Reasoning Models for Network Traffic Generation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">CPU Utilization Forecasting in Large-Scale Cloud Clusters Using Gradient Boosting</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">7th Polish Conference on Artificial Intelligence (PP-RAI'2026)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Kraków, Poland </style></PLACE_PUBLISHED><PUBLISHER><style face="normal" font="default" size="100%">(This work was partly supported by the National Centre for Research and Development (NCBR) and co-funded by the European Union under the European Funds for ModernEconomy(FENG)Programme(SMARTKonsorcja),projectno.FENG.01.01-IP.01-A0GV/24-00,)</style></PUBLISHER><title><style face="normal" font="default" size="100%">CPU Utilization Forecasting in Large-Scale Cloud Clusters Using Gradient Boosting</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marzena Halama</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konrad Połys</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">AI-Assisted Zeolite Design through Retrieval-Augmented Scientific Language Models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SCIENCE TECHNOLOGY ENGINEERING MATHEMATICS</style></SECONDARY_TITLE><PUBLISHER><style face="normal" font="default" size="100%">2nd International Conference PUT STEM Day 2026: Book of Abstracts</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p style="border-style:none;line-height:normal;margin-bottom:.0001pt;text-align:justify;"&gt;&lt;span style="color:black;font-size:11.0pt;font-weight:normal;" lang="EN-US"&gt;Designing materials such as zeolites is a major challenge due to the wide range of possible structures and synthesis conditions. Furthermore, knowledge on this subject is widely scattered across numerous publications and experimental notes. Therefore, large language models (LLMs) represent a promising tool for building knowledge bases, supporting the analysis of scientific literature, although their responses may be incomplete or fallible. In addition, in the case of zeolites, the relationship between material properties and their topology is of crucial importance, which limits the effectiveness of approaches based solely on text. In this study, we investigate a Retrieval-Augmented Generation (RAG) approach extended with a multimodal component that combines textual and structural information.&lt;/span&gt;&lt;/p&gt;&lt;p style="border-style:none;line-height:normal;margin-bottom:.0001pt;text-align:justify;"&gt;&#160;&lt;/p&gt;&lt;p style="border-style:none;line-height:normal;margin-bottom:.0001pt;text-align:justify;"&gt;&#160;&lt;/p&gt;&lt;p style="border-style:none;line-height:normal;margin-bottom:.0001pt;text-align:justify;"&gt;&#160;&lt;/p&gt;</style></ABSTRACT><title><style face="normal" font="default" size="100%">AI-Assisted Zeolite Design through Retrieval-Augmented Scientific Language Models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marzena Halama</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konrad Połys</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">External Semantic Memory as a Cognitive Layer for Large Language Models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">PP-RAI 2026</style></SECONDARY_TITLE><PUBLISHER><style face="normal" font="default" size="100%">AGH University Press</style></PUBLISHER><title><style face="normal" font="default" size="100%">External Semantic Memory as a Cognitive Layer for Large Language Models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Reliability-Aware LLM Reasoning: Handling Uncertainty in Robot Perception</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE International Conference on Robot and Human Interactive Communication (IEEE RO-MAN 2026)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Kitakyushu, Japan</style></PLACE_PUBLISHED><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">10.08.2026</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Robots operating in human environments must often make decisions based on perceptual information that&lt;br&gt;is uncertain, incomplete, or ambiguous. This paper proposes a reliability-aware reasoning framework that enables large&lt;br&gt;language models (LLMs) to account for perceptual uncertainty when selecting actions in human-robot interaction scenarios.&lt;br&gt;The environment is represented as a structured scene composed of detected objects enriched with confidence estimates, attribute reliability, and spatial uncertainty information. Using this representation, the LLM evaluates candidate objects through a reliability scoring mechanism that integrates multiple sources of perceptual evidence and supports uncertainty-aware decision making.The proposed approach is evaluated using perception episodes with controlled levels of uncertainty and compared with a baseline LLM-based matching strategy that ignores perceptual&lt;br&gt;reliability. Experimental results show that incorporating uncertainty-aware reasoning substantially improves decision&lt;br&gt;robustness under medium and high uncertainty conditions while reducing safety-critical behaviors caused by overconfident&lt;br&gt;autonomous decisions.&lt;/p&gt;</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/11714851</style></URL><title><style face="normal" font="default" size="100%">Reliability-Aware LLM Reasoning: Handling Uncertainty in Robot Perception</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Risk-Aware Response Refinement for Safer LLM-Powered Socially Assistive Robots in Elderly Care</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE International Conference on Robot and Human Interactive Communication (IEEE RO-MAN 2026)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Kitakyushu, Japan</style></PLACE_PUBLISHED><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">10.08.2026</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Safe and reliable human–robot interaction remains a challenge, especially for Large Language Model (LLM)-powered socially assistive robots in elderly care. This paper proposes a risk-aware response framework that explicitly models the safety implications of user queries. &#160;We introduce a Query Risk Assessment Module (QRAM), which computes a Query Risk Score (QRS) using structured semantic indicators to classify user inputs into different risk levels. Based on this, we develop two strategies: risk-aware response refinement and risk-aware response generation. To assess safety, we introduce the Risk-Aware Response Safety Score (RRSS), a metric that captures both the presence of risk-bearing language and the absence of necessary safety-critical guidance. Experimental results across multiple LLMs demonstrate that incorporating query-level risk awareness reduces response-level risk, with both strategies outperforming raw responses.&lt;/p&gt;</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/11714788</style></URL><title><style face="normal" font="default" size="100%">Risk-Aware Response Refinement for Safer LLM-Powered Socially Assistive Robots in Elderly Care</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">From Plots to Words: Model-Aware Multimodal Explanations as a Foundation for Accessible, Non-Visual Interaction</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM International Conference on Multimodal Interaction (ICMI)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Naples, Italy</style></PLACE_PUBLISHED><DATE><style face="normal" font="default" size="100%">10/05/2026</style></DATE><URL><style face="normal" font="default" size="100%">https://dl.acm.org/doi/10.1145/3776591.3833865</style></URL><title><style face="normal" font="default" size="100%">From Plots to Words: Model-Aware Multimodal Explanations as a Foundation for Accessible, Non-Visual Interaction</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jorge Cruz-Duarte</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Korpyś</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kołodziej</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Gancarczyk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">El-Ghazali Talbi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Feature- and Similarity-Based Explainability of Experimental Materials Data via Black-Box Hyperparameter Optimization</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Parallel Problem Solving from Nature</style></SECONDARY_TITLE><URL><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-032-36226-1_11</style></URL><title><style face="normal" font="default" size="100%">Feature- and Similarity-Based Explainability of Experimental Materials Data via Black-Box Hyperparameter Optimization</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Knowledge-Graph-Grounded Multimodal Explanations for Trustworthy Time-Series Forecasting in DevOps Systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Semantic Web Conference (ISWC)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Bari, Italy</style></PLACE_PUBLISHED><title><style face="normal" font="default" size="100%">Knowledge-Graph-Grounded Multimodal Explanations for Trustworthy Time-Series Forecasting in DevOps Systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Obinna Nwadiuto</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zlatka Stoeva</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Fideline Tchuenbou-Magaia</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Lightweight Time-Series Representation for Battery State of Health Estimation from Graphene Sensor Data</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases</style></SECONDARY_TITLE><title><style face="normal" font="default" size="100%">Lightweight Time-Series Representation for Battery State of Health Estimation from Graphene Sensor Data</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Grounding LLM-Generated Network Traffic in Semantics: A Knowledge-Graph Framework for Detecting and Explaining Protocol Hallucinations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM International Conference on Information and Knowledge Management (CIKM)</style></SECONDARY_TITLE><title><style face="normal" font="default" size="100%">Grounding LLM-Generated Network Traffic in Semantics: A Knowledge-Graph Framework for Detecting and Explaining Protocol Hallucinations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">A. Bęben</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Śliwiński</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Krawiec</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">B. Belter</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Gutkowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ł. Łopatowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Białoń</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J.M. Batalla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Drwal</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Rygielski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Wojciech Burakowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Krawiec</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Inżynieria Internetu Przyszłości</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Politechnika Warszawska</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Architektura sieci świadomych treści w Systemie IIP</style></SECTION><title><style face="normal" font="default" size="100%">Inżynieria Internetu Przyszłości</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">B. Wieczorek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Połomski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">S. Deorowicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Kozielski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An Effective Way of Storing and Accessing Very Large Transition Matrices Using Multi-core CPU and GPU Architectures</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">BDAS 2014</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">323–334</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The topic of probabilistic model checking algoritms of Markov processes makes the problem of storing and processing of very large transition matrices crucial. While the symbolic approach utilises very effective storage and access methods, like Multi-terminal Binary Decision Diagrams, the traditional explicit method of representing and solving the model using sparse matrices has many advantages, especially when we concired the flexibility of computing of different properties. We show and examine a compact representation of a very large transition matrix in the sparse form. The technique employs an effective method of compression, storage, and accessing of the matrix and is suitable for use in mutli-core CPU and GPU environments. Such large transition matrices consume a lot of space and cannot be considered as typical types of data for storage in database systems. Nevertheless, their storage and efficient access to them could be beneficial for solving of Markov models, so constructing specialised compression methods is obviously the way to go.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">10th International Conference BDAS 2014, Ustroń, Poland May 27-30,</style></NOTES><title><style face="normal" font="default" size="100%">An Effective Way of Storing and Accessing Very Large Transition Matrices Using Multi-core CPU and GPU Architectures</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Markov chain model of RED active queuing management algorithm</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from HET-NETs 2006</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">The Markov chain model of RED active queuing management algorithm</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analiza wydajności mechanizmu RED za pomocą łańcuchów Markowa z czasem ciągłym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Materiały Konferencji Sieci Komputerowe</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Analiza wydajności mechanizmu RED za pomocą łańcuchów Markowa z czasem ciągłym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</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%">Content Identification in PI CAN Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">164–172</style></PAGES><title><style face="normal" font="default" size="100%">Content Identification in PI CAN Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Simulation and Analytical Evaluation of a Slotted Ring Optical Packet Switching Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2009</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Advances in Soft Computing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">64</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Simulation and Analytical Evaluation of a Slotted Ring Optical Packet Switching Network</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Optical Packet Switching (OPS) is a technology which thanks to its speed of operation may become popular in next-generation networks. Because optical packets are not buffered it is necessary to develop new mechanisms which would allow quality of service management in OPS networks. The paper discusses the architecture of OPS networks of the ring type with nodes enabling optical packet switching, equipped with the mechanism of Quality of Service (QoS) management. The differentiation of the quality of service was achieved by means of the proposed mechanism of priority registers with the timeout mechanism. This enables the network to be used for transporting various classes of data with varying requirements as to the quality of service. Simulation trials have been conducted and an analytical model for this type of network has been proposed.&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">10.1007/978-3-642-05019-0\_3</style></NOTES><title><style face="normal" font="default" size="100%">Simulation and Analytical Evaluation of a Slotted Ring Optical Packet Switching Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">S. Balandin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">R. Dunaytsev</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Y. Koucheryavy</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Smart Spaces and Next Generation Wired/Wireless Networking. Third Conference on Smart Spaces, ruSMART 2010, and 10th International Conference, NEW2AN 2010</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">6294</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Reducing the Number of States for Markovian Model of Optical Slotted Ring Network</style></SECTION><DATE><style face="normal" font="default" size="100%">8</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-642-14890-3</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">Modelling with use of Markov chains is difficult from computational point of view, because of a rapid increase in the number of states occurring even when there is only a slight increase in the model’s scale. However, thanks to the appropriate description of the model the number of states can be significantly reduced. This paper discusses a synchronous slotted-ring network with optical packet switching modelled by means of markovian chains with continuous time. Simplifying the description has made it possible to significantly reduce the model’s dimension without significantly diminishing the results’ accuracy.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">10.1007/978-3-642-14891-0\_21</style></NOTES><title><style face="normal" font="default" size="100%">Smart Spaces and Next Generation Wired/Wireless Networking. Third Conference on Smart Spaces, ruSMART 2010, and 10th International Conference, NEW2AN 2010</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Priority Registers Mechanism for fair access to ring-type OPS network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2009</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">21</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3-4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">181–191</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The paper discusses the architecture of ring-type OPS (Optical Packet Switching) networks with QoS management. The electronic-optical nodes of the network enable optical packet switching within the ring and electronic buffered interface for a client. The differentiation of the quality of service was achieved by means of the system of priorities, and thanks to proposed mechanism of priority registers fair access to the link was achieved. This enables the network to be used for transporting various classes of data with varying requirements as to the quality of service. Simulation trials have been conducted and an analytical model for this type of network has been proposed.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Priority Registers Mechanism for fair access to ring-type OPS network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Rozproszona baza danych dla lokalizacji treści w sieci PI CAN</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Przegląd Telekomunikacyjny i Wiadomości Telekomunikacyjne</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><NUMBER><style face="normal" font="default" size="100%">8-9</style></NUMBER><PAGES><style face="normal" font="default" size="100%">1481–1490</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Identyfikacja i lokalizacja treści stanowią podstawowe zagadnienia przy opracowywaniu sieci ukierunkowanych na treść (content-centric networks). W artykule przedstawiono implementację oraz badania wydajności mechanizmu Content Registry (CR), który został opracowany na potrzeby projektu Inżynieria Internetu Przyszłości, w części dotyczącej mechanizmów i wymagań dla sieci PI CAN (Paralel Internet Content Aware Network). CR umożliwia wydajne wyszukiwanie, w rozproszonej sieciowej bazie danych rekordów opisu treści, które zawierają podstawowe informacje o lokalizacji treści I wymaganiach w zakresie transmisji sieciowej. Rezultaty badań przedstawione w artykule potwierdzają wysoką efektywność proponowanego rozwiązania w różnych konfiguracjach i topologiach sieciowych.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Rozproszona baza danych dla lokalizacji treści w sieci PI CAN</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Content Registry - the distributed database of content localization for the PI CAN network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE Xplore</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">Content addressing and localization are basic issues in the structure of content-centric networks. This paper presents the implementation and performance evaluation of the Content Registry (CR), developed within the framework of the FIE (Future Internet Engineering) project to meet the requirements of the PI CAN network. The CR allows to find the desired Content Record (containing basic transmission parameters and localization of a content) in the network-distributed content database. The results confirm the CR is highly efficient in various configurations of the logical topology of connected nodes.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">NETWORKS 2012, 15th International Telecommunication Network Strategy and Planning Symposium, Rome, October 15th - 18th 2012</style></NOTES><title><style face="normal" font="default" size="100%">Content Registry - the distributed database of content localization for the PI CAN network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Software library for the Markov analysis of complex queuing models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings from Workshop “New Trends in Modelling, Quantitative Methods and Measurements”</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">11</style></DATE><title><style face="normal" font="default" size="100%">Software library for the Markov analysis of complex queuing models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sergey Balandin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Koucheryavy Yevgeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Hu Honglin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Smart Spaces and Next Generation Wired/Wireless Networking</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin / Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">6869</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Content Localization for Non-overlay Content-Aware Networks</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-3-642-22874-2</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">Content addressing and localization are the basic issues in design of content-aware networks (CAN). The paper summarizes assumptions for content-aware networks and presents content localization algorithm for PI-CAN, developed within FIE (Future Internet Engineering) project. The algorithm allows to find location of desired content in distributed content database in time O(1)</style></ABSTRACT><title><style face="normal" font="default" size="100%">Smart Spaces and Next Generation Wired/Wireless Networking</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling CTMC with a standard programming language and using conventions from computer networking</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3-4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">229–243</style></PAGES><title><style face="normal" font="default" size="100%">Modelling CTMC with a standard programming language and using conventions from computer networking</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Efektywne rozgłaszanie w wielohopowej sieci bezprzewodowej. Effective Broadcasts in Multihop Wireless Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Przegląd Telekomunikacyjny - Wiadomości Telekomunikacyjne</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ISSUE><style face="normal" font="default" size="100%">8-9</style></ISSUE><PAGES><style face="normal" font="default" size="100%">887-891</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Znanych jest wiele rozwiązań problemu rozgłaszania wiadomości w sieciach bezprzewodowych typu ad-hoc. Rozwiązania te różnią się w zależności od wielkości sieci, dostępności informacji o topologii, modelu komunikacji, wymagań gwarancji dostarczenia wiadomości itp. Sieci dedykowane są do różnych zastosowań i różnią się specyfiką występujących w nich problemów związanych z komunikacją. W artykule przedstawiono kilka znanych rozwiązań problemu rozgłaszania oraz przedstawiono autorskie rozwiązanie, dedykowane do specyficznego problemu sieci typu AMI (Advanced Metering Infrastructure - zaawansowana infrastruktura pomiarowa). Sieć ta zakładała model komunikacji jeden-do-wielu, stosunkowo niewielką dynamikę zmian w sieci, możliwość istnienia długich ścieżek na drodze transmisji oraz szereg innych wymagań. Analizowane algorytmy nie spełniały postawionych wymagań. Artykuł opisuje opracowaną motodę i porównuje ją do wybranych rozwiązań referencyjncych.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Efektywne rozgłaszanie w wielohopowej sieci bezprzewodowej. Effective Broadcasts in Multihop Wireless Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Sawicki</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Application of Fault-Tolerant GQP Algorithm in Multihop AMI Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks. CN 2017. Communications in Computer and Information Science, vol 718</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><NUMBER><style face="normal" font="default" size="100%">Communications in Computer and Information Science, vol 718.</style></NUMBER><PAGES><style face="normal" font="default" size="100%">70-80</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-59767-6</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The paper presents the evaluation of the GQP algorithm in AMI networks using real map based network topologies (low, medium and high density of buildings). The algorithm was compared to the reference algorithms: CB, SBA and DP. It was shown that the GQP algorithm presents the good scalability, relatively optimal number of selected forwarders and by introducing the redundancy factor, good fault tolerance. An improvement to GQP algorithm to add a redundancy factor is proposed, what allows to execute fault tolerant broadcast transmission.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-319-59767-6_6</style></URL><title><style face="normal" font="default" size="100%">Application of Fault-Tolerant GQP Algorithm in Multihop AMI Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A Zgrzywa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">K Choroś</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A Siemiński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Influence of message-oriented middleware on performance of network management system: a modelling study.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Multimedia and Network Information Systems. </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">Advances in Intelligent Systems and Computing, Vol. 506</style></VOLUME><PAGES><style face="normal" font="default" size="100%">379-393</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-43981-5</style></ISBN><URL><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007%2F978-3-319-43982-2_33</style></URL><title><style face="normal" font="default" size="100%">Influence of message-oriented middleware on performance of network management system: a modelling study.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Rataj</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%">Solving large Markov models described with standard programming language</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Int. Symposium on Computer and Information Sciences. ISCIS 2018</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">2018</style></DATE><title><style face="normal" font="default" size="100%">Solving large Markov models described with standard programming language</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Routing Algorithms Simulation for Self-Aware SDN</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Electronics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%"> 11</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><DATE><style face="normal" font="default" size="100%">12/2021</style></DATE><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/2079-9292/11/1/104</style></URL><title><style face="normal" font="default" size="100%">Routing Algorithms Simulation for Self-Aware SDN</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Pecka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Symulacja kolejki z negatywnymi klientami i wieloma serwerami</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"> Studia Informatica ; 1642-0489 [8] ; Zeszyty Naukowe Politechniki</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%"> Vol. 27, No. 4 = No. 69 [5]</style></VOLUME><SECTION><style face="normal" font="default" size="100%">54</style></SECTION><DATE><style face="normal" font="default" size="100%">06/2006</style></DATE><title><style face="normal" font="default" size="100%">Symulacja kolejki z negatywnymi klientami i wieloma serwerami</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</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%">Experimental rate distortion analysis of image coder with contourlet transform and SPIHT algorithm</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Experimental rate distortion analysis of image coder with contourlet transform and SPIHT algorithm</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">M. Wróbel</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%">Model of the network physical layer for modern wireless systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">147–159</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">In the article the detailed and flexible model of physical layer PHY for discrete events simulations (DES) in proposed. The model was implemented using SimPy simulator and evaluated using simplified 802.11 protocol model. To proof the correctness of the model some results of selected 802.11 parameters verification are presented.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Model of the network physical layer for modern wireless systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</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%">Synchronisation concept for distributed simulation of networks with packet loss</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2009</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">30</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">82</style></NUMBER><ABSTRACT><style face="normal" font="default" size="100%">We propose a concept of a new synchronisation method of distributed event-driven simulation of computer networks with non-zero rate of lost packets (frames), e.g. wireless networks. Thanks to treating straggler messages (all or some of them) as messages informing of damaged frames, better performance of distributed simulation is expected.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Synchronisation concept for distributed simulation of networks with packet loss</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</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%">Parallel simulations with modified INET simulation package</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">19</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">147–156</style></PAGES><title><style face="normal" font="default" size="100%">Parallel simulations with modified INET simulation package</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</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%">Nanotechnologia i nanoinformatyka w Europie i na Swiecie, Rozdział w książce Internet w Społeczeństwie Informacyjnym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Naukowo Technicze</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Współczesne problemy internetu: Nanotechnologia i nanoinformatyka w Europie i na Swiecie</style></SECTION><title><style face="normal" font="default" size="100%">Nanotechnologia i nanoinformatyka w Europie i na Swiecie, Rozdział w książce Internet w Społeczeństwie Informacyjnym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</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%">Internet w społęczeństwie informacyjnym</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wyższa Szkoła Biznesu w Dąbrowie Górniczej</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Nanotechnologiczne procesy wytwarzające</style></SECTION><title><style face="normal" font="default" size="100%">Internet w społęczeństwie informacyjnym</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pikiewicz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nowe Technologie w Komputerowych Systemach Zarządzania</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Systemy operacyjne w technicznych i biologicznych systemach informatyki</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie w Komputerowych Systemach Zarządzania</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>2</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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 realizujące bezpośrednio procesy wytwarzania produktów</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Ul. Bałtycka 5, 44-100 Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IITIS PAN</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">06</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">Organizacji i porządkowaniu ruchu służą, zarówno w systemach technicznych jak i w organizmach biologicznych systemy informatyki. Obecnie, jako najbardziej znane, można wymienić dwa następujące systemy: - systemy informatyki wspomagające realizację procesów obliczeniowych, oparte na komputerach, które będziemy nazywać technicznymi systemami informatyki. - systemy informatyki zawarte w organizmach biologicznych, realizujące bezpośrednie wytwarzanie niektórych materiałów i produktów, potrzebnych tym organizmom, które będziemy nazywali biologicznymi systemami informatyki. Teza pracy: możliwa jest, poza organizmami biologicznymi, techniczna realizacja systemów informatyki służących do bezpośredniej realizacji niektórych, potrzebnych nam materiałów i produktów.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">promotor: Stefan Węgrzyn</style></NOTES><title><style face="normal" font="default" size="100%">Systemy informatyki realizujące bezpośrednio procesy wytwarzania produktów</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Technical nanosystems based on the biological solutions</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Nano 2003</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><title><style face="normal" font="default" size="100%">Technical nanosystems based on the biological solutions</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The manufacturing nanosystems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3/2002</style></NUMBER><PAGES><style face="normal" font="default" size="100%">235–244</style></PAGES><title><style face="normal" font="default" size="100%">The manufacturing nanosystems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Model systemu informatycznego wzorowanego na systemach biologicznych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2A</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">53</style></NUMBER><PAGES><style face="normal" font="default" size="100%">87–95</style></PAGES><title><style face="normal" font="default" size="100%">Model systemu informatycznego wzorowanego na systemach biologicznych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The nanosystems structures of manufacturing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE-Nano 2002</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">381–384</style></PAGES><title><style face="normal" font="default" size="100%">The nanosystems structures of manufacturing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Koncepcje realizacji procesów nanotechnologicznych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2A</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">48</style></NUMBER><PAGES><style face="normal" font="default" size="100%">45–58</style></PAGES><title><style face="normal" font="default" size="100%">Koncepcje realizacji procesów nanotechnologicznych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wykorzystanie mechanizmu RED w regulacji ruchu sieciowego</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><NUMBER><style face="normal" font="default" size="100%">22</style></NUMBER><PAGES><style face="normal" font="default" size="100%">131–143</style></PAGES><title><style face="normal" font="default" size="100%">Wykorzystanie mechanizmu RED w regulacji ruchu sieciowego</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nanotechnology and Nanocomputers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2/2001</style></NUMBER><PAGES><style face="normal" font="default" size="100%">195–204</style></PAGES><title><style face="normal" font="default" size="100%">Nanotechnology and Nanocomputers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Debudaj-Grabysz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Evaluations of the new synchronization method for the parallel simulations of wireless networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Computer Theory and Engineering</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">5</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">698–702</style></PAGES><DATE><style face="normal" font="default" size="100%">8</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The article describes the implementation of the new synchronization method for parallel discrete event simulation and presents the experimental results obtained from parallel environment. In the proposed method the time steps are introduced and the synchronization occurs only at the end of a time step to achieve reduction of messages, exchanged between local processes of simulation. The method was implemented in C++, using the MPI libraty. The studies have shown that it is possible, under certain conditions and using appropriate hardware architecture, the significant acceleration of distributed simulations.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Evaluations of the new synchronization method for the parallel simulations of wireless networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Agnieszka Grabysz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Evaluation of the new synchronization method for the parallel simulations of wireless networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Computer Theory and Engineering</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">The article describes the implementation of the new synchronization method for parallel discrete event simulation and presents the experimental results obtained from parallel environment. The method, designed especially for wireless networks simulations, merges paradigms of optimistic and conservative synchronization to achieve reduction of messages, exchanged betweed local processes of simulation. The studies have shown that it is possible, under certain conditions and using appropriate hardware architecture, the significant acceleration of distributed simulations.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">4th International Conference on Computer Modeling and Simulation 24-25 februaty, Roma, Italy</style></NOTES><title><style face="normal" font="default" size="100%">Evaluation of the new synchronization method for the parallel simulations of wireless networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</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%">Simple Traffic Shaping Algorithm for All-optical Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">10th Polish Teletraffic Symposium PSRT 2003</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Information Society</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">413–418</style></PAGES><title><style face="normal" font="default" size="100%">Simple Traffic Shaping Algorithm for All-optical Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</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%">Wpływ mechanizmów kształtowania ruchu na wydajność sieci czysto optycznych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2A</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">53</style></NUMBER><PAGES><style face="normal" font="default" size="100%">221–228</style></PAGES><title><style face="normal" font="default" size="100%">Wpływ mechanizmów kształtowania ruchu na wydajność sieci czysto optycznych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">REMOTE VIRTUAL REALITY: EXPERIMENTAL INVESTIGATIONSOF PROGRESSIVE 3D MESH TRANSMISSION IN IP NETWORKS</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">Performance Modelling and Evaluation of Heterogeneous Networks, proc. HETNET 2010.</style></ABSTRACT><title><style face="normal" font="default" size="100%">REMOTE VIRTUAL REALITY: EXPERIMENTAL INVESTIGATIONSOF PROGRESSIVE 3D MESH TRANSMISSION IN IP NETWORKS</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Jędruś</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Detailed ATM Network Simulator</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of the 8th Polish Teletraffic Symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">193–202</style></PAGES><title><style face="normal" font="default" size="100%">A Detailed ATM Network Simulator</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Współczesne problemy sieci komputerowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WNT</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Samoorganizacja w nanosystemach</style></SECTION><title><style face="normal" font="default" size="100%">Współczesne problemy sieci komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Selforganization in nanosystems of informatics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">16</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4/2004</style></NUMBER><PAGES><style face="normal" font="default" size="100%">311–320</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">In the paper the problem of technical nanosystems of informatics able to creating compound structures with the use of selforganization phenomena is considered.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">supported by KBN Project no 4T11C03325</style></NOTES><title><style face="normal" font="default" size="100%">Selforganization in nanosystems of informatics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sergey Balandin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Koucheryavy Yevgeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Hu Honglin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Smart Spaces and Next Generation Wired/Wireless Networking</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin / Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">6869</style></VOLUME><SECTION><style face="normal" font="default" size="100%">New Synchronization Method for the Parallel Simulations of Wireless Networks</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-3-642-22874-2</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">We present a new synchronization method for parallel discrete event simulation for wireless networks. The method merges paradigms of time-stepped and event-driven simulations to achieve reduction of messages exchanged between local processes of simulation. The method is particularly suitable for wireless network simulation, in which objects share the same physical medium and parallel simulation involves a significant overhead for interprocess communication. The article describes the method and compare it to conservative and optimistic synchronization methods, on the basis of results of simulations of selected wireless network model.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Smart Spaces and Next Generation Wired/Wireless Networking</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</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><AUTHOR><style face="normal" font="default" size="100%">P. Stera</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">MAGANET - On the need of realistic topologies for AMI network simulations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">79–88</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The article proposes MAGANET (Map-based Generator of AMI Network Topology), new map-based topology generator, designated for Advanced Metering Infrastructure (AMI) networks as well as for the urban wireless sensor networks (WSNs). The correct, reliable representation of network topology is crucial for the correct performance evaluation on large multihop wireless networks. Most of the current work us different random topologies. In the article we describe proposed new tool and its features. The comparison of the properties of topology provided by MAGANET for three different generation modes: uniform random, grid and map based is also presented.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">21nd International Conference, CN 2014 Brunów, June 23-27, 2014</style></NOTES><title><style face="normal" font="default" size="100%">MAGANET - On the need of realistic topologies for AMI network simulations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Reproduction and multiplication in the distributed, manufacturing nanosystems of informatics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Nano 2003</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">860–862</style></PAGES><title><style face="normal" font="default" size="100%">Reproduction and multiplication in the distributed, manufacturing nanosystems of informatics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">18</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">3–14</style></PAGES><DATE><style face="normal" font="default" size="100%">5</style></DATE><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><title><style face="normal" font="default" size="100%">Systems of Informatics of the Direct Materials Production</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Self-organization Process Inside the Set of Elements Inspired by their Properties</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><NUMBER><style face="normal" font="default" size="100%">4/2005</style></NUMBER><PAGES><style face="normal" font="default" size="100%">231–240</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Systems of technical informatics are being used for the realization of computational processes performed on the indicated data in a form of numbers. Computations are not performed in biological systems of informatics but the sets of technological operations which material products are coming into existence for living organism construction. It is possible to create technical systems of informatics which such goals will be realizing like in the case of biological systems and so will be taken to manufacturing objects and products on the basis of the molecular nanotechnology. It leads to three problems connected with the realization of creating technical systems of informatics and it concerns: the nanosystems of informatics, the self-replication, and the self-organization processes. In the paper, a problem of transient states of the process occurred for the self-organization of the object with properties of basic elements constituting this object determined, have been presented.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Self-organization Process Inside the Set of Elements Inspired by their Properties</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">ul. Pszczyńska 44, 44-100 Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wyd. Pracowni Komputerowej Jacka Sklamierskiego</style></PUBLISHER><EDITION><style face="normal" font="default" size="100%">1</style></EDITION><ISBN><style face="normal" font="default" size="100%">83-89105-97-7</style></ISBN><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><title><style face="normal" font="default" size="100%">Systemy Informatyki Bezpośredniego Wytwarzania Materiałów</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</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%">IMAGE CODING WITH CONTOURLET / WAVELET TRANSFORMS AND SPIHT ALGORITHM:AN EXPERIMENTAL STUDY</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2009</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">proc. of IMAGAPP 2009, International Conference on Imaging Theory and Applications, Lisboa, Portugal, 2009.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">IMAGE CODING WITH CONTOURLET / WAVELET TRANSFORMS AND SPIHT ALGORITHM:AN EXPERIMENTAL STUDY</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Politechniki Śląskiej</style></PUBLISHER><title><style face="normal" font="default" size="100%">Nano i kwantowe systemy informatyki. Wyd.Drugie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Politechniki Śląskiej</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">83-7335-295-3</style></ISBN><title><style face="normal" font="default" size="100%">Nano i Kwantowe Systemy Informatyki</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">52</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">1–10</style></PAGES><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><title><style face="normal" font="default" size="100%">Nano and quantum systems of informatics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</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%">Properties of advanced metering infrastructure networks' topologies</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2014 IEEE Network Operations and Management Symposium (NOMS)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">May</style></DATE><title><style face="normal" font="default" size="100%">Properties of advanced metering infrastructure networks' topologies</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Gianmarco Baldini</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Fröhlich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jose Hernandez-Ramos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stavros Papadopoulos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anastasios Drosou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">IoT Network Risk Assessment and Mitigation: The  SerIoT Approach</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Security Risk Management for the Internet of Things: Technologies and Techniques  for IoT Security, Privacy and Data Protection</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Now Publishers</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">88–104</style></PAGES><EDITION><style face="normal" font="default" size="100%">John Soldatos</style></EDITION><title><style face="normal" font="default" size="100%">IoT Network Risk Assessment and Mitigation: The  SerIoT Approach</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Fröhlich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jose Hernandez-Ramos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gianmarco Baldini</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Autopolicy: Automated Traffic Policing for Improved IoT Network Security</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">20</style></VOLUME><SECTION><style face="normal" font="default" size="100%">4265</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;A 2.3Tbps DDoS attack was recently mitigated by Amazon, which is a new record after the 2018 GitHub attack, or the famous 2016 Dyn DNS attack launched from hundreds of thousands of hijacked IoT devices. These attacks may disrupt the lives of billions of people worldwide, as we increasingly rely on the Internet. In this paper, we tackle the problem that hijacked IoT devices are often the origin of these attacks. With the goal of protecting the Internet and local networks, we propose Autopolicy: a system that automatically limits the IP traffic bandwidth - and other network resources - available to IoT devices in a particular network. We make use of the fact that devices such as sensors, cameras, and smart home appliances rarely need their high-speed network interfaces for normal operation. We present a simple yet flexible architecture for Autopolicy, specifying its functional blocks, message sequences, and general operation in a Software Defined Network. We present experimental validation results, and release a prototype open source implementation.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Autopolicy: Automated Traffic Policing for Improved IoT Network Security</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gianmarco Baldini</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">José Hernandez-Ramos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Neisse</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Mitigation of Privacy Threats due to Encrypted Traffic Analysis through a Policy-Based Framework and MUD Profiles</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Symmetry</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">12</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">9</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1576</style></SECTION><DATE><style face="normal" font="default" size="100%">09/2020</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;It has been proven in research literature that the analysis of encrypted traffic with statistical analysis and machine learning can reveal the type of activities performed by a user accessing the network, thus leading to privacy risks. In particular, different types of traffic (e.g., skype, web access) can be identified by extracting time based features and using them in a classifier. Such privacy attacks are asymmetric because a limited amount of resources (e.g., machine learning algorithms) can extract information from encrypted traffic generated by cryptographic systems implemented with a significant amount of resources. To mitigate privacy risks, studies in research literature have proposed a number of techniques, but in most cases only a single technique is applied, which can lead to limited effectiveness. This paper proposes a mitigation approach for privacy risks related to the analysis of encrypted traffic which is based on the integration of three main components: (1) A machine learning component which proactively analyzes the encrypted traffic in the network to identify potential privacy threats and evaluate the effectiveness of various mitigation techniques (e.g., obfuscation), (2) a policy based component where policies are used to enforce privacy mitigation solutions in the network and (3) a network node profile component based on the Manufacturer Usage Description (MUD) standard to enable changes in the network nodes in the cases where the first two components are not effective in mitigating the privacy risks. This paper describes the different components and how they interact in a potential deployment scenario. The approach is evaluated on the public dataset ISCXVPN2016 and the results show that the privacy threat can be mitigated significantly by removing completely the identification of specific types of traffic or by decreasing the probability of their identification as in the case of VOIP by 50%, Chat by 40% and Browsing by 33%, thus reducing significantly the privacy risk.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/2073-8994/12/9/1576</style></URL><title><style face="normal" font="default" size="100%">Mitigation of Privacy Threats due to Encrypted Traffic Analysis through a Policy-Based Framework and MUD Profiles</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mariusz Słabicki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Gorawski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Efficient Universal Indoor Multicharacteristic Propagation model for indoor environments</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2023 International Wireless Communications and Mobile Computing (IWCMC)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Marrakesh, Morocco</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">1052-1058</style></PAGES><DATE><style face="normal" font="default" size="100%">07/2023</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Accurate indoor radio propagation modelling is a well-known problem that researchers tend to solve in many ways. Related methods differ in terms of accuracy and complexity. The article’s contribution is a new stochastic propagation model, Universal Indoor Multicharacteristic Propagation (UIMP), which results are statistically consistent with those measured in a real environment. The model could be used to verify real- world applications due to the low computational complexity and high accuracy level compared to state-of-the-art methods. This method can be especially beneficial for the efficient modelling of complex environments shared by many users using discrete events simulations (DES) based on a series of measurements in a real environment. In the article, we describe the method and present how to establish the model. The motivation was to develop an efficient method for use in an actual application: using the Bluetooth Low Energy (BLE) signal to estimate the position of users in indoor environments – the use of the proposed UIMP model allowed for a reliable assessment of the developed functionalities. Therefore we also present how the model was used to evaluate an example, real functionality, showing that the use of simplified models may falsify the assessment of the analyzed method and may lead e.g. to incorrect implementation assumptions.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/10183073</style></URL><title><style face="normal" font="default" size="100%">Efficient Universal Indoor Multicharacteristic Propagation model for indoor environments</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marzena Halama</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konrad Połys</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Semantic Orientation for Indoor Navigation System using Large Language Models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Autonomous robots play an important role in modern indoor navigation, but existing systems often struggle with seamless human interaction and semantic understanding of environments. This paper presents an Artificial Intelligence (AI)-driven object recognition system enhanced by Large Language Models (LLMs), such as GPT-4 Vision and Gemini, to bridge this gap. Our approach combines vision-based mapping techniques with natural language processing and interactions to enable intuitive collaboration in solving navigation tasks. By leveraging multimodal input and vector space analysis, our system achieves enhanced object recognition, semantic embedding, and context-aware responses, setting a new standard for autonomous indoor navigation. This approach provides a novel framework for improving spatial understanding and dynamic interaction, making it suitable for complex indoor environments.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1038/s41598-025-25281-0</style></URL><title><style face="normal" font="default" size="100%">Semantic Orientation for Indoor Navigation System using Large Language Models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</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%">Risk-Aware Semantic Grounding for Trustworthy LLM-Based Robot Planning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Naples, Italy</style></PLACE_PUBLISHED><title><style face="normal" font="default" size="100%">Risk-Aware Semantic Grounding for Trustworthy LLM-Based Robot Planning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rafał Gibała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Grygar</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%">Trend-based Multi-Modal Anomaly and Cyber Threat Detection with Traceable Explainability for Cloud Services</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD)</style></SECONDARY_TITLE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Multi-modal real-time monitoring systems based on AI are&lt;br&gt;essential for ensuring system reliability and cyber-defense in cloud computing,&lt;br&gt;but are challenged by context isolation, early-fusion computational&lt;br&gt;overhead, and insufficient transparency. In order to address these&lt;br&gt;issues, this paper introduces T-MATE, an explainable Trend-based Multimodal&lt;br&gt;Anomaly and Threat detector engineered for robust, secure cloud&lt;br&gt;infrastructure monitoring. Rather than treating multi-modal streams&lt;br&gt;monolithically, T-MATE structurally decouples data modalities into independent&lt;br&gt;neural network heads, using a specialized Recurrent Trend&lt;br&gt;Predictive Neural Network (rTPNN) to isolate underlying trends and levels&lt;br&gt;across quantitative performance telemetry, while qualitatively parsing&lt;br&gt;textual event logs via Gemini 2.5 Flash. These components output&lt;br&gt;bounded anomaly scores and are integrated at the decision level&lt;br&gt;using an Empirical Reliability-Weighted Max Fusion operator, which&lt;br&gt;scales individual outputs to enforce a max-safety posture and eliminate&lt;br&gt;parameter-explosion liabilities. In order to demonstrate operational deployment&lt;br&gt;readiness, the framework is thoroughly evaluated via 10-fold&lt;br&gt;cross-validation and compared against standalone rTPNN, LSTM, and&lt;br&gt;MLP models alongside the baseline Avg-Fuse paradigm on the public&lt;br&gt;CloudAnoBench dataset. The results reveal that T-MATE achieves a superior&lt;br&gt;overall F1 Score of 0.88, a top threshold-invariant AUC-ROC of&lt;br&gt;0.96, an exceptional True Positive Rate of 0.96, and a processing footprint&lt;br&gt;that confirms its viability for close to real-time inference in enterprise&lt;br&gt;cloud infrastructures.&lt;/p&gt;</style></ABSTRACT><title><style face="normal" font="default" size="100%">Trend-based Multi-Modal Anomaly and Cyber Threat Detection with Traceable Explainability for Cloud Services</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rafał Gibała</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%">Optimizing Information Retrieval in RAG Systems via Proactive Hyperparameter Selection</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD)</style></SECONDARY_TITLE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Information retrieval is a crucial operation for Retrieval-&lt;br&gt;Augmented Generation (RAG) systems, providing substantial gains in&lt;br&gt;factual accuracy and operational eciency. However, the performance of&lt;br&gt;a RAG system is highly sensitive to the selection of hyperparameters, optimization of which is computationally expensive and time-consuming. In&lt;br&gt;this paper, we propose a novel framework, called Proactive Hyperparameter&lt;br&gt;Estimation and Selection (ProHES), which introduces a paradigm&lt;br&gt;shift from reactive, brute-force search to an ecient, analytical approach.&lt;br&gt;The core novelty of the ProHES framework is its two-stage methodology.&lt;br&gt;First, it analytically estimates the most suitable similarity metric&lt;br&gt;for a given embedding and dataset by quantifying intrinsic embedding&lt;br&gt;properties, i.e. sparsity, magnitude meaning, feature independence, and&lt;br&gt;value spread. Then, it systematically selects the optimal number of retrieved&lt;br&gt;documents based on user preferences and system requirements.&lt;br&gt;We evaluate the performance of the ProHES framework across six different&lt;br&gt;embedding functions on the MS Marco and TriviaQA datasets.&lt;br&gt;Our results demonstrate that ProHES provides a near-optimal hyperparameter&lt;br&gt;conguration with 22- to 86-fold reduction in computation&lt;br&gt;time compared to exhaustive search, achieving an average of 94% of the&lt;br&gt;best possible performance. The proposed framework represents a significant&lt;br&gt;advancement by making hyperparameter tuning for RAG systems&lt;br&gt;more ecient and systematic, thereby paving the way for more accurate,&lt;br&gt;robust and scalable real-world applications.&lt;/p&gt;</style></ABSTRACT><title><style face="normal" font="default" size="100%">Optimizing Information Retrieval in RAG Systems via Proactive Hyperparameter Selection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">E.T Ceran</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy Packet Networks With Energy Harvesting</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE ACCESS</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">4</style></VOLUME><PAGES><style face="normal" font="default" size="100%">1321-1331</style></PAGES><DATE><style face="normal" font="default" size="100%">03/2016</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We investigate the cooperation among energy prosumers (unified energy provider and consumer) through the energy packet network (EPN) paradigm, which represents both the flow of work that requires energy, and the flow of energy itself, in terms of discrete units. This paper details a stochastic model of EPNs, which is inspired from a branch of queuing theory called G-networks. The model allows us to compute the equilibrium state of a system that includes energy storage units, energy transmission networks, and energy consumers, together with the intermittent energy sources. The model is then used to show how the flow of work and energy in the system can be optimized for certain utility functions that consider both the needs of the consumers, and the desire to maintain some reserve energy for potential future needs.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy Packet Networks With Energy Harvesting</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">O Brun</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">L Wang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Big Data for Autonomic Intercontinental Overlays</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Journal on Selected Areas in Communications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">34</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3</style></ISSUE><PAGES><style face="normal" font="default" size="100%">575-583</style></PAGES><DATE><style face="normal" font="default" size="100%">02/2016</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This paper uses big data and machine learning for the real-time management of Internet scale quality-of-service (QoS) route optimisation with an overlay network. Based on the collection of data sampled every 2 min over a large number of source-destinations pairs, we show that intercontinental Internet protocol (IP) paths are far from optimal with respect to QoS metrics such as end-to-end round-trip delay. We, therefore, develop a machine learning-based scheme that exploits large scale data collected from communicating node pairs in a multihop overlay network that uses IP between the overlay nodes, and selects paths that provide substantially better QoS than IP. Inspired from cognitive packet network protocol, it uses random neural networks with reinforcement learning based on the massive data that is collected, to select intermediate overlay hops. The routing scheme is illustrated on a 20-node intercontinental overlay network that collects some 2 × 106 measurements per week, and makes scalable distributed routing decisions. Experimental results show that this approach improves QoS significantly and efficiently&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Big Data for Autonomic Intercontinental Overlays</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">L. Wang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Real-Time Traffic over the Cognitive Packet Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">23rd International Conference on Computer Networks (CN)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Brunów, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">608</style></VOLUME><PAGES><style face="normal" font="default" size="100%">3-21</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Real-Time services over IP (RTIP) have been increasingly significant due to the convergence of data networks worldwide around the IP standard, and the popularisation of the Internet. Real-Time applications have strict Quality of Service (QoS) constraint, which poses a major challenge to IP networks. The Cognitive Packet Network (CPN) has been designed as a QoS-driven protocol that addresses user-oriented QoS demands by adaptively routing packets based on online sensing and measurement, and in this paper we design and experimentally evaluate the“Real-Time (RT) over CPN” protocol which uses QoS goals that match the needs of real-time packet delivery in the presence of other background traffic under varied traffic conditions. The resulting design is evaluated via measurements of packet delay, delay variation (jitter) and packet loss ratio.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Real-Time Traffic over the Cognitive Packet Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">F. Francois</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Towards a cognitive routing engine for software defined networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE International Conference on Communications (ICC)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Kuala Lumpur, Malaysia</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">1-6</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In Software Defined Networks (SDN), intensive traffic monitoring is used to optimize the Quality-of-Service (QoS) of the network paths which are selected. Thus, we introduce the use of the Cognitive Packet Network (CPN) algorithm to SDN in order to optimize the search for new high-QoS paths. We install the CPN algorithm in the Cognitive Routing Engine (CRE), a new application software for SDN, and show that with limited monitoring overhead we are able to determine the near-optimal paths for given QoS metrics that may be proposed by the end users. Measurements that we have conducted on an experimental replica of the GEANT network that our approach uses close to 10 times less monitoring data than conventional SDN, but that we are able to approach the optimal paths within 2%.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Towards a cognitive routing engine for software defined networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Omer Abdelrahman</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gokce Gorbil</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Detection and mitigation of signaling storms in mobile networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Conference on Computing, Networking and Communications (ICNC)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Kauai, Hawai, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">1-5</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-1-4673-8579-4</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Mobile Networks are subject to “signaling storms” launched by malware or apps, which overload the the bandwidth at the cell, the backbone signaling servers, and Cloud servers, and may also deplete the battery power of mobile devices. This paper&lt;br /&gt;&#13;
reviews the subject and discusses a novel technique to detect and mitigate such signaling storms. Through a mathematical analysis we introduce a technique based on tracking time-out transitions in the signaling system that can substantially reduce both the number of misbehaving mobiles and the signaling overload in the backbone.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Detection and mitigation of signaling storms in mobile networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">W. Serrano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An Intelligent Internet Search Assistant Based on the Random Neural Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">12th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations (AIAI)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Thessaloniki, Greece</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">475</style></VOLUME><PAGES><style face="normal" font="default" size="100%">141-153</style></PAGES><ISBN><style face="normal" font="default" size="100%">78-3-319-44943-2</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Even web services that are free of charge, typically offer access to online information based on some form of economic interest of the web service itself. Thus advertisers who put the information on the web will make a payment to the search services based on the clicks that their advertisements receive. Thus end users cannot know that the results they obtain from Web search engines are exhaustive, or that they actually respond to their needs. To fill the gap between user needs and the information that is presented to them on the web, Intelligent Search Assistants have been proposed to act at the interface between users and search engines to present data to users in a manner that reflects their actual needs or their observed or stated preferences. This paper presents an Intelligent Internet Search Assistant based on the Random Neural Network that tracks the user’s preferences and makes a selection on the output of one or more search engines using the preferences that it has learned. We also introduce a “relevance metric” to compare the performance of our Intelligent Internet Search Assistant against a few search engines, showing that it provides better performance.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">An Intelligent Internet Search Assistant Based on the Random Neural Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Omer Abdelrahman</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Diffusion Model for Energy Harvesting Sensor Nodes</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">24th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Imperial Coll Campus, London, England</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">154-158</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-1-5090-3432-1</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Energy harvesting has recently attracted much interest due to the emergence of the Internet of Things, and the increasing need to operate wireless sensing devices in challenging environments without much human intervention and maintenance. This paper presents a novel approach for modeling the performance of an energy harvesting wireless sensor node, which takes into account fluctuations in the amount of energy extracted from the environment, energy loss due to battery leakage, as well as the energy cost of sensing, data processing and communication. The proposed approach departs from the common queueing-theoretic framework used in the literature, and instead uses Brownian motion to represent more accurately the time evolution of the distribution of the node's battery level. The paper derives some performance measures of interest along with the stationary solution of the system, and discusses possible directions for reducing the number of parameters and states of the model without compromising accuracy.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Diffusion Model for Energy Harvesting Sensor Nodes</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">F. Francois</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Optimizing Secure SDN-Enabled Inter-Data Centre Overlay Networks through Cognitive Routing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Imperial Coll Campus, London, England</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">283-288</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;More and more businesses are deploying their application(s) with different cloud providers which are close to their customers in order to provide better Quality of Service (QoS) to their end customers. In this work, an optimized and secure software-defined overlay network is proposed as an efficient mechanism to interconnect these geographically-dispersed applications compared to using only plain IP routing. A logically centralized Cognitive Routing Engine (CRE), based on Random Neural Networks with Reinforcement Learning, was developed to find with minimal monitoring overhead the optimal overlay paths when the public Internet is used as the communication means between the overlay nodes. CRE was evaluated by using an overlay network composed of hosts from 5 different public clouds where it was shown that the latency of CRE paths is most of the time within 5% of the latency of the optimal IP paths. Furthermore, it was also demonstrated that CRE is able to do asymmetric path optimization where the forward path is different from the reverse path for a given data centre pair in order to further improve QoS.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Optimizing Secure SDN-Enabled Inter-Data Centre Overlay Networks through Cognitive Routing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Y Yin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Deep learning with random neural networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Joint Conference on Neural Networks (IJCNN)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Vancouver, Canada</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">1633-1638</style></PAGES><DATE><style face="normal" font="default" size="100%">06/2016</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This paper introduces techniques for Deep Learning in conjunction with spiked random neural networks that closely resemble the stochastic behaviour of biological neurons in mammalian brains. The paper introduces clusters of such random neural networks and obtains the characteristics of their collective behaviour. Combining this model with previous work on extreme learning machines, we develop multilayer architectures which structure Deep Learning Architectures a a “front end” of one or two layers of random neural networks, followed by an extreme learning machine. The approach is evaluated on a standard - and large - visual character recognition database, showing that the proposed approach can attain and exceed the performance of techniques that were previously reported in the literature.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Deep learning with random neural networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">L Wang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">O Brun</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Adaptive workload distribution for local and remote Clouds</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE International Conference on Systems, Man, and Cybernetics (SMC)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Budapest, Hungary</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">3984-3988</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Cloud systems include both locally based servers at user premises and remote servers and multiple Clouds that can be reached over the Internet. This paper describes a smart distributed system that combines local and remote Cloud facilities. It operates with a task allocation system that takes decisions to allocate tasks dynamically to the service that offers the best overall Quality of Service and a routing overlay which optimizes network delay for data transfer between clouds. Internet-scale experiments exhibit the effectiveness of our approach in adaptively distributing workload across multiple clouds.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Adaptive workload distribution for local and remote Clouds</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Agreement in Spins and Social Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM SIGMETRICS Performance Evaluation Review</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">44</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">2</style></ISSUE><PAGES><style face="normal" font="default" size="100%">15-17</style></PAGES><DATE><style face="normal" font="default" size="100%">09/2016</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We introduce a model of mutually influencing individuals who hold one of two opinions about some matter. This is similar to a system of particles that can have one of two spin states. The model considers N sub-systems where individuals stay for some time, and then move from one subnetwork to another independently of each other, or they may leave the overall network from any one of the sub-systems. They arrive externally to any sub-system according to independent Poisson processes. In each sub-system individuals can influence each other to align with their own opinion or spin, and their opinion can also fluctuate at random in either opinion. The system also allows for a bias or directional field in any of the sub-systems that influences the individuals or spins that are locally present. We show that even with a weak bias, when random fluctuations become small then all the individuals or spins in a given sub-network will align with probability one, to the opinion or spin direction represented by the bias or spin.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Agreement in Spins and Social Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Gokce Gorbil</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Omer Abdelrahman</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Pavloski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modeling and Analysis of RRC-Based Signalling Storms in 3G Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Transactions on Emerging Topics in Computing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">4</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><PAGES><style face="normal" font="default" size="100%">113-127</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Mobile networks are vulnerable to signaling attacks and storms that are caused by traffic patterns that overload the control plane, and differ from distributed denial of service attacks in the Internet since they directly affect the control plane, and also reserve wireless bandwidth and network resources without actually using them. Such storms can result from malware and mobile botnets, as well as from poorly designed applications, and can cause service outages in 3G and 4G networks, which have been experienced by mobile operators. Since the radio resource control (RRC) protocol in the 3G and 4G networks is particularly susceptible to such storms, we analyze their effect with a mathematical model that helps to predict the congestion that is caused by a storm. A detailed simulation model of a mobile network is used to better understand the temporal dynamics of user behavior and signaling in the network and to show how RRC-based signaling attacks and storms cause significant problems in both the control and user planes of the network. Our analysis also serves to identify how storms can be detected, and to propose how system parameters can be chosen to mitigate their effect.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modeling and Analysis of RRC-Based Signalling Storms in 3G Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Omer Abdelrahman</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gokce Gorbil</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ricardo Lent</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Information Sciences and Systems 2015 30th International Symposium on Computer and Information Sciences (ISCIS 2015)</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Electrical Engineering</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">363</style></VOLUME><PAGES><style face="normal" font="default" size="100%">457</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-319-22634-7</style></ISBN><title><style face="normal" font="default" size="100%">Information Sciences and Systems 2015 30th International Symposium on Computer and Information Sciences (ISCIS 2015)</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">J. Du</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">C. Jiang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">H. Zhang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Y. Ren</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Contract Design for Traffic Offloading and Resource Allocation in Heterogeneous Ultra-Dense Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Journal on Selected Areas in Communications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">35</style></VOLUME><PAGES><style face="normal" font="default" size="100%">2457-2467</style></PAGES><DATE><style face="normal" font="default" size="100%">Nov</style></DATE><title><style face="normal" font="default" size="100%">Contract Design for Traffic Offloading and Resource Allocation in Heterogeneous Ultra-Dense Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Y. Yin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Single-cell based random neural network for deep learning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2017 International Joint Conference on Neural Networks (IJCNN 2017), Anchorage, United States, May 14-19 2017.</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Anchorage, United States</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">2017</style></VOLUME><PAGES><style face="normal" font="default" size="100%">86-93</style></PAGES><DATE><style face="normal" font="default" size="100%">05/2017</style></DATE><title><style face="normal" font="default" size="100%">Single-cell based random neural network for deep learning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Y. Yin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">L. Wang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Multi-layer neural networks for quality of service oriented server-state classification in cloud servers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2017 International Joint Conference on Neural Networks (IJCNN 2017), Anchorage, United States, May 14-19 2017.</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Anchorage, United States</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">2017</style></VOLUME><PAGES><style face="normal" font="default" size="100%">1623-1627</style></PAGES><TERTIARY_TITLE><style face="normal" font="default" size="100%">Proceedings of the International Joint Conference on Neural Networks</style></TERTIARY_TITLE><DATE><style face="normal" font="default" size="100%">05/2017</style></DATE><title><style face="normal" font="default" size="100%">Multi-layer neural networks for quality of service oriented server-state classification in cloud servers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">H. Liu Jiang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">RK. Thulasiram</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Special Issue on Green Pervasive and Ubiquitous Systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Systems Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">11</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">2</style></ISSUE><PAGES><style face="normal" font="default" size="100%">806-812</style></PAGES><SECTION><style face="normal" font="default" size="100%">806</style></SECTION><DATE><style face="normal" font="default" size="100%">06/2017</style></DATE><title><style face="normal" font="default" size="100%">Special Issue on Green Pervasive and Ubiquitous Systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Y.M. Kadioglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wireless sensor with data and Energy Packets</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2017 IEEE International Conference on Communications Workshops  (ICC Workshops 2017)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Paris, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">2017</style></DATE><ISBN><style face="normal" font="default" size="100%">978-150901897-0</style></ISBN><title><style face="normal" font="default" size="100%">Wireless sensor with data and Energy Packets</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">E. Pankratova</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Farkhadov</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Research of Heterogeneous Queueing System SM|M(n)|∞</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science 16th International Conference, ITMM 2017</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Kazan, Russian Federation</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">2017</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-319-68068-2 </style></ISBN><title><style face="normal" font="default" size="100%">Research of Heterogeneous Queueing System SM|M(n)|∞</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">J Fourneau</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">G-networks with Adders</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Future Internet</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">9</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3</style></ISSUE><PAGES><style face="normal" font="default" size="100%">1-7</style></PAGES><SECTION><style face="normal" font="default" size="100%">1</style></SECTION><DATE><style face="normal" font="default" size="100%">07/2017</style></DATE><title><style face="normal" font="default" size="100%">G-networks with Adders</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">W. Serrano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Random Neural Network in a neurocomputing application for Web search</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Neurocomputing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">280</style></VOLUME><PAGES><style face="normal" font="default" size="100%">123-134 </style></PAGES><SECTION><style face="normal" font="default" size="100%">123</style></SECTION><DATE><style face="normal" font="default" size="100%">03/2018</style></DATE><title><style face="normal" font="default" size="100%">The Random Neural Network in a neurocomputing application for Web search</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">L. Wang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Adaptive Dispatching of Tasks in the Cloud</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Transactions on Cloud Computing </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">6</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><PAGES><style face="normal" font="default" size="100%">33-45 </style></PAGES><SECTION><style face="normal" font="default" size="100%">33</style></SECTION><DATE><style face="normal" font="default" size="100%">03/2018</style></DATE><title><style face="normal" font="default" size="100%">Adaptive Dispatching of Tasks in the Cloud</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">W. Serrano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Intelligent search with deep learning clusters</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Intelligent Systems Conference (IntelliSys) 2017</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">London, UK </style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE </style></PUBLISHER><DATE><style face="normal" font="default" size="100%">03/2018</style></DATE><ISBN><style face="normal" font="default" size="100%">978-1-5090-6435-9 </style></ISBN><title><style face="normal" font="default" size="100%">Intelligent search with deep learning clusters</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Y Yin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Deep Learning with Dense Random Neural Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Conference on Man–Machine Interactions</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Kraków, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Cham</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">09/2017</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-319-67792-7 </style></ISBN><title><style face="normal" font="default" size="100%">Deep Learning with Dense Random Neural Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">W. Serrano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Deep Learning Random Neural Network with a Management Cluster</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">9th KES International Conference on Intelligent Decision Technologies (KES-IDT 2017)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Vilamoura, Portugal</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Cham</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">2017</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-319-59423-1 </style></ISBN><title><style face="normal" font="default" size="100%">The Deep Learning Random Neural Network with a Management Cluster</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">J Du</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">C Jiang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">H Zhang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Z Han</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Y Ren</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Data Transaction Modeling in Mobile Networks: Contract Mechanism and Performance Analysis</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Global Telecommunications Conference</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Singapore, Singapore </style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">01/2018</style></DATE><ISBN><style face="normal" font="default" size="100%">978-1-5090-5019-2 </style></ISBN><title><style face="normal" font="default" size="100%">Data Transaction Modeling in Mobile Networks: Contract Mechanism and Performance Analysis</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mariacarla Staffa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Sgaglione</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Giovanni Mazzeo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Coppolino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Salvatore D'Antonio</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Romano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An OpenNCP-based Solution for Secure eHealth Data Exchange</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">JOURNAL OF NETWORK AND COMPUTER APPLICATIONS</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">116</style></VOLUME><PAGES><style face="normal" font="default" size="100%">65-85</style></PAGES><SECTION><style face="normal" font="default" size="100%">65</style></SECTION><DATE><style face="normal" font="default" size="100%">08/2018</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The European Commission is very focused on the development of possible solutions to allow effective cross border healthcare provisioning with the aim of guaranteeing a uniform Quality of Service (QoS) level of healthcare systems across Europe. One of the most relevant efforts in this direction was the epSOS Project, with the release of the OpenNCP platform overcoming interoperability issues in health information exchange between nations while complying with both National and European laws. Despite the OpenNCP platform has been adopted in several Member States, allowing them to securely interconnect their eHealth infrastructures, some security issues are still partially addressed, This work shows how the KONFIDO project will address these issues by building on and extending the results of OpenNCP through a sound holistic approach to security at a systemic level. This paper describes in detail the KONFIDO project approach and how it is being deployed via a combination of complementary security enhancing technologies with the ultimate goal of increasing trust and security of eHealth data exchange.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">An OpenNCP-based Solution for Secure eHealth Data Exchange</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Yasin Kadioglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Product-Form Solution for Cascade Networks With Intermittent Energy</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Systems Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">PP</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">99</style></ISSUE><PAGES><style face="normal" font="default" size="100%">1-10</style></PAGES><SECTION><style face="normal" font="default" size="100%">1</style></SECTION><DATE><style face="normal" font="default" size="100%">08/2018</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The power needs of digital devices, their installation in locations where it is difficult to connect them to the power grid and the difficulty of frequently replacing batteries, create the need to operate digital systems with harvested energy. In such cases, local storage batteries must overcome the intermittent nature of the energy supply. System performance then depends on the intermittent energy supply, possible energy leakage, and system workload. Queueing networks with product-form solution (PFS) are standard tools for analyzing the performance of interconnected systems, and predicting relevant performance metrics including job queue lengths, throughput, and system turnaround times and delays. However, existing queueing network models assume unlimited energy availability, whereas intermittently harvested energy can affect system performance due to insufficient energy supply. Thus, this paper develops a new PFS for the joint probability distribution of energy availability, and job queue length for an N-node tandem system. Such models can represent production lines in manufacturing systems, supply chains, cascaded repeaters for optical links, or a data link with multiple input data ports that feeds into a switch or server. Our result enables the rigorous computation of the relevant performance metrics of such systems operating with intermittent energy.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Product-Form Solution for Cascade Networks With Intermittent Energy</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yasin Kadioglu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy life-time of wireless nodes with network attacks and mitigation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2018 IEEE International Conference on Communications Workshops, ICC Workshops 2018; Kansas City; United States</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Kansas City, MO, USA </style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">07/2018</style></DATE><ISBN><style face="normal" font="default" size="100%">978-1-5386-4328-0 </style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In the Internet of Things (IoT), a simple form of attack can deplete the energy available to operate the sensor nodes. Some of these nodes may use batteries, while others may harvest ambient energy such as photovoltaic, or electromagnetic, or vibration based energy. We first briefly survey the types of attacks which aim at the nodes' energy provisioning systems. This paper analyses the effect of such attacks on the energy life- time of a wireless node. Then we provide models to estimate the effect of attacks that attempt to deplete the node's energy supply, both for a node that uses energy harvesting. We then examine a simple means of attack mitigation based on dropping both attack and «good» traffic. For nodes that use energy harvesting, we compute the fraction of traffic that must be dropped so as to offer a desired «energy life-time» of the node. We see that the required traffic drop rate depends in a non-linear manner on the nominal «good traffic rate» at which the node is expected to operate. Finally, we analyse the impact of attacks on the energy life-time of a node that operates with a replaceable battery&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy life-time of wireless nodes with network attacks and mitigation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Olivier Brun</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yonghua Yin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Deep Learning with Dense Random Neural Network for Detecting Attacks against IoT-connected Home Environments</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The 15th International Conference on Mobile Systems and Pervasive Computing (MobiSPC 2018) / The 13th International Conference on Future Networks and Communications (FNC-2018) / Affiliated Workshops</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gran Canaria, Spain </style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Elsevier</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">07/2018</style></DATE><ISBN><style face="normal" font="default" size="100%">1877-0509</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;div class="author"&gt;Yonghua Yin&lt;/div&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Deep Learning with Dense Random Neural Network for Detecting Attacks against IoT-connected Home Environments</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Olivier Brun</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yonghua Yin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Y. Murat Kadioglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Javier Augusto-Gonzalez</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Manuel Ramos</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Deep learning with dense random neural networks for detecting attacks against IoT-connected home environments</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">1st International Symposia on Computer and Information Sciences, ISCIS 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">London, United Kingdom</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">07/2018</style></DATE><ISBN><style face="normal" font="default" size="100%">978-331995188-1</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, we analyze the network attacks that can be launched against IoT gateways, identify the relevant metrics to detect them, and explain how they can be computed from packet captures. We also present the principles and design of a deep learning-based approach using dense random neural networks (RNN) for the online detection of network attacks. Empirical validation results on packet captures in which attacks were inserted show that the Dense RNN correctly detects attacks.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Deep learning with dense random neural networks for detecting attacks against IoT-connected home environments</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mariacarla Staffa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Coppolino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Sgaglione</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ioannis Komnios</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Evangelos Grivas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Oana Stan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Castaldo</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">KONFIDO: An OpenNCP-Based Secure eHealth Data Exchange System</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">1st International Symposia on Computer and Information Sciences, ISCIS 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">London, United Kingdom</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">07/2018</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-319-95189-8</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Allowing cross-border health-care data exchange by establishing a uniform QoS level of health-care systems across European states, represents one of the current main goals of the European Commission. For this purpose epSOS project was funded with the objective to overcome interoperability issues in patients health information exchange among European healthcare systems. A main achievement of the project was the OpenNCP platform. Settled over the results of the epSOS project, KONFIDO aims at increasing trust and security of eHealth data exchange by adopting a holistic approach, as well as at increasing awareness of security issues among the healthcare community. In this light, the paper describes the KONFIDO project’s approach and discusses its design and its representation as a system of interacting agents. It finally discusses the deployment of the provided platform&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">KONFIDO: An OpenNCP-Based Secure eHealth Data Exchange System</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dionysios Kehagias</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Static Analysis-Based Approaches for Secure Software Development</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">1st International Symposia on Computer and Information Sciences, ISCIS 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">London, United Kingdom</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">07/2018</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-319-95189-8</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Software security is a matter of major concern for software development enterprises that wish to deliver highly secure software products to their customers. Static analysis is considered one of the most effective mechanisms for adding security to software products. The multitude of static analysis tools that are available provide a large number of raw results that may contain security-relevant information, which may be useful for the production of secure software. Several mechanisms that can facilitate the production of both secure and reliable software applications have been proposed over the years. In this paper, two such mechanisms, particularly the vulnerability prediction models (VPMs) and the optimum checkpoint recommendation (OCR) mechanisms, are theoretically examined, while their potential improvement by using static analysis is also investigated. In particular, we review the most significant contributions regarding these mechanisms, identify their most important open issues, and propose directions for future research, emphasizing on the potential adoption of static analysis for addressing the identified open issues. Hence, this paper can act as a reference for researchers that wish to contribute in these subfields, in order to gain solid understanding of the existing solutions and their open issues that require further research.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Static Analysis-Based Approaches for Secure Software Development</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yunxiao Zhang</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance Optimization With Energy Packets</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Systems Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Performance Optimization With Energy Packets</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Khaled Hussain</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mohamed Bassyouni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Accurate, Energy-efficient Classification With Spiking Random Neural Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Probability in the Engineering and Informational Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">05/2019</style></DATE><title><style face="normal" font="default" size="100%">Accurate, Energy-efficient Classification With Spiking Random Neural Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Optimum checkpoints for programs with loops</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Simulation Modelling Practice and Theory</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">97</style></VOLUME><DATE><style face="normal" font="default" size="100%">07/2019</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Checkpoints are widely used to improve the performance of computer systems and programs inthe presence of failures, and they significantly reduce the overall cost of running a program, if the program or the underlying system, are subject to failures. Thus application level checkpointing has been proposed for programs which may execute on platforms which are prone to failures, and also to reduce the execution time of programs which are prone to internal failures. This paper develops a mathematical model to estimate the average execution time of a program in the presence of failures, without and with application level checkpointing, and we use it to predict the optimum interval number of instructions which should be executed between the placement of successive heckpoints. The case of programs with loops and nested loops is also discussed. The results are illustrated with several numerical examples.&#160;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Optimum checkpoints for programs with loops</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Fröhlich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Optimal fog services placement in SDN IoT network using Random Neural Networks and Cognitive Network Map</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The 19th International Conference on Artificial Intelligence and Soft Computing</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Zakopane</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">06/2020</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Due to massive increase in number of &lt;em&gt;IoT&lt;/em&gt;&#160;devices and number of cloud based services a crucial task arises of optimally placing (both topologically and resource-wise ) services in the network so that non of the clients will be victimized and receive best possible time of response. Also - there must be a balance not to instantiate a service on every possible machine - which would take too much resources. Task which must be solved is an optimization of parameters such as &lt;em&gt;QoS&lt;/em&gt;&#160;between service and client, equality of clients and usage of resources. Using &lt;em&gt;SDN&lt;/em&gt;&#160;- which is designed to answer some of the problems posed in this section such as &lt;em&gt;QoS&lt;/em&gt;&#160;and knowledge about topology of the whole network and newly connected clients - is a gateway to better fit service management. Machine learning provides less stiff rules to follow and more intelligent behaviour of the manager.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Optimal fog services placement in SDN IoT network using Random Neural Networks and Cognitive Network Map</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Fröhlich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stavros Papadopoulos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aikaterini Protogerou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anastasis Drosou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">IoT Network Attack Detection and Mitigation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The 9th Mediterranean Conference on Embedded Computing (MECO'2020)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Budva, Montenegro</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">June 2020</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">Cyberattacks on the Internet of Things (IoT) can cause major economic and physical damage, and disrupt production lines, manufacturing processes, supply chains, impact the physical safety of vehicles, and damage the health of human beings. Thus we describe and evaluate a distributed and robust attack detection and mitigation system for network environments where communicating decision agents use Graph Neural Networks to provide attack alerts. We also present an attack mitigation system that uses a Reinforcement Learning driven Software Defined Network to process the alerts generated by the attack detection system, together with Quality of Service measurements, so as to re-route sensitive traffic away from compromised network paths using. Experimental results illustrate both the detection and re-routing scheme.&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%"/></URL><title><style face="normal" font="default" size="100%">IoT Network Attack Detection and Mitigation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Pavloski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance of a Security Control Scheme for a Health Data Exchange System</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"> IEEE International Black Sea Conference on Communications and Networking</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">05/2020</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We propose an access control scheme to improve the security of a cross border health data access running under distributed systems such as OpenNCP that cooperate through message exchanges. The scheme allows messages that request data and services to cross different regional or national nodes after they are verified for security issues both by the sender and the receiver. It rejects those access requests that are detected to be malicious, and consequently throttles down the flow of permit messages via explicit feedback from threat detection software placed at the sender and the receiver. An analytical model is used to evaluate the message delay to determine the overhead caused by the enhanced security system, and numerical results illustrate the impact of attack rates and on the system’s performance.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance of a Security Control Scheme for a Health Data Exchange System</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Fröhlich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Smart SDN Management of Fog Services</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Global IoT Summit (GIOTS) 2020</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Dublin, Ireland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">June 2020</style></DATE><ISBN><style face="normal" font="default" size="100%">978-1-7281-6728-2</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">A Smart Service Manager is proposed to direct user requests (such as those coming from IoT devices) at the edge&#13;
towards appropriate servers where the requested services can be satisfied. Services are housed at different Fog locations, and the system is subject to variations in workload. The approach is based on using a Software Defined Network (SDN) controller as the means to take decisions with measurement data based machine learning that uses Reinforcement Learning to make the best choices. The system we have developed is illustrated with experimental results on a test-bed with time-varying loads that confirm its ability to adapt to significant changes in system load and preserve the users’ Quality of Service.</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/9119542</style></URL><title><style face="normal" font="default" size="100%">Smart SDN Management of Fog Services</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Introduction to the Special Issue on the French-Polish Collaboration in Mathematical Models of Computer Systems, Networks and Bioinformatics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"> SN Computer Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">1</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><PAGES><style face="normal" font="default" size="100%">44:1-44:10</style></PAGES><title><style face="normal" font="default" size="100%">Introduction to the Special Issue on the French-Polish Collaboration in Mathematical Models of Computer Systems, Networks and Bioinformatics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yunxiao Zhang</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Sharing Energy for Optimal Edge Performance</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SOFSEM 2020: Theory and Practice of Computer Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><NUMBER><style face="normal" font="default" size="100%"> Lecture Notes in Computer Science, vol 12011</style></NUMBER><EDITION><style face="normal" font="default" size="100%">Chatzigeorgiou A. et al.</style></EDITION><ABSTRACT><style face="normal" font="default" size="100%">Using the Energy Packet Network (EPN) model, we show how energy can be shared between heterogeneous servers at the edge to minimize the overall average response time of jobs. The system is modelled as a probabilistic network where energy and jobs are being dispatched to the edge servers using G-Networks with a product-form solution for the equilibrium probability distribution of system state. The approach can also be used to design energy dispatching systems when renewable energy is used to improve the sustainability of edge computing.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Sharing Energy for Optimal Edge Performance</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marco Nalin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ilaria Baroni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Giuliana Faiella</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Maria Romano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Flavia Matrisciano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">David Martinez</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jos Dumortier</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pantelis Natsiavas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kostas Votis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vassilis Koutkias</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Fabrizio Clemente</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The European cross-border health data exchange roadmap: Case study in the Italian setting</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Biomed. Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">94</style></VOLUME><URL><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.jbi.2019.103183</style></URL><title><style face="normal" font="default" size="100%">The European cross-border health data exchange roadmap: Case study in the Italian setting</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Rajkumar Buyya</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Satish Srirama</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Giuliano Casale</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rodrigo Calheiros</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yogesh Simmhan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Blesson Varghese</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bahman Javadi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luis Vaquero</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marco Netto</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adel Toosi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Maria Rodriguez</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ignacio Llorente</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sabrina di Vimercati</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pierangela Samarati</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dejan Milojicic</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Carlos Varela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rami Bahsoon</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marcos de Assunção</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Omer Rana</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Wanlei Zhou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Hai Jin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Wolfgang Gentzsch</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Albert Zomaya</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Haiying Shen</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Manifesto for Future Generation Cloud Computing: Research Directions for the Next Decade</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM Comput. Surv.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">51</style></VOLUME><PAGES><style face="normal" font="default" size="100%">105:1–105:38</style></PAGES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1145/3241737</style></URL><title><style face="normal" font="default" size="100%">A Manifesto for Future Generation Cloud Computing: Research Directions for the Next Decade</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Yasin Kadioglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Product-Form Solution for Cascade Networks With Intermittent Energy</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Systems Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><PAGES><style face="normal" font="default" size="100%">918–927</style></PAGES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/JSYST.2018.2854838</style></URL><title><style face="normal" font="default" size="100%">Product-Form Solution for Cascade Networks With Intermittent Energy</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jun Du</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Chunxiao Jiang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Haijun Zhang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yong Ren</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">H. Vincent Poor</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Peer Prediction-Based Trustworthiness Evaluation and Trustworthy Service Rating in Social Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Trans. Information Forensics and Security</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><PAGES><style face="normal" font="default" size="100%">1582–1594</style></PAGES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/TIFS.2018.2883000</style></URL><title><style face="normal" font="default" size="100%">Peer Prediction-Based Trustworthiness Evaluation and Trustworthy Service Rating in Social Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jun Du</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Chunxiao Jiang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Haijun Zhang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yong Ren</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tony Quek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Double Auction Mechanism Design for Video Caching in Heterogeneous Ultra-Dense Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Trans. Wireless Communications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">18</style></VOLUME><PAGES><style face="normal" font="default" size="100%">1669–1683</style></PAGES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/TWC.2019.2895076</style></URL><title><style face="normal" font="default" size="100%">Double Auction Mechanism Design for Video Caching in Heterogeneous Ultra-Dense Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Javier Augusto-Gonzalez</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anastasija Collen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">S. Evangelatos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Anagnostopoulos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Georgios Spathoulas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konstantinos Giannoutakis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konstantinos Votis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">B. Genge</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Niels Nijdam</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">From Internet of Threats to Internet of Things: A Cyber Security Architecture for Smart Homes</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">24th IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2019, Limassol, Cyprus, September 11-13, 2019</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/CAMAD.2019.8858493</style></URL><title><style face="normal" font="default" size="100%">From Internet of Threats to Internet of Things: A Cyber Security Architecture for Smart Homes</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Meikang Qiu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Optimum Interval for Application-level Checkpoints</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">6th IEEE International Conference on Cyber Security and Cloud Computing, CSCloud 2019 / 5th IEEE International Conference on Edge Computing and Scalable Cloud, EdgeCom 2019, Paris, France, June 21-23, 2019</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-4</style></URL><title><style face="normal" font="default" size="100%">Optimum Interval for Application-level Checkpoints</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Floriano De Rango</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Carlos Calafate</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Miroslav Voznák</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Alfredo Garro</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mauro Tropea</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy Consumption and Quality of Service in Computer Systems and Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">23rd IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications DS-RT 2019, Cosenza, Italy, October 7-9, 2019</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/DS-RT47707.2019.8958673</style></URL><title><style face="normal" font="default" size="100%">Energy Consumption and Quality of Service in Computer Systems and Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sotiris Diamantopoulos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marco Nalin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ilaria Baroni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Fabrizio Clemente</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Giuliana Faiella</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Charis Mesaritakis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Evangelos Grivas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Janne Rasmussen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jan Petersen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Isaac Cano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Elisa Puigdomènech</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitris Karamitros</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jos Dumortier</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Maja Voronkov</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Romano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Coppolino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vassilis Koutkias</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kostas Votis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Oana Stan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paolo Campegiani</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">David Martinez</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Secure Cross-Border Exchange of Health Related Data: The KONFIDO Approach</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">15th European Dependable Computing Conference, EDCC 2019, Naples, Italy, September 17-20, 2019</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/EDCC.2019.00024</style></URL><title><style face="normal" font="default" size="100%">Secure Cross-Border Exchange of Health Related Data: The KONFIDO Approach</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Alexander Frötscher</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bernhard Monschiebl</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anastasios Drosou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Martin Reed</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mays Al-Naday</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Improve cybersecurity of C-ITS Road Side Infrastructure Installations: the SerIoT - Secure and Safe IoT approach</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2019 IEEE International Conference on Connected Vehicles and Expo, ICCVE 2019, Graz, Austria, November 4-8, 2019</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/ICCVE45908.2019.8965056</style></URL><title><style face="normal" font="default" size="100%">Improve cybersecurity of C-ITS Road Side Infrastructure Installations: the SerIoT - Secure and Safe IoT approach</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sotiris Diamantopoulos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitris Karamitros</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Romano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Coppolino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vassilis Koutkias</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kostas Votis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Oana Stan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paolo Campegiani</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">David Martinez</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marco Nalin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ilaria Baroni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Fabrizio Clemente</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Giuliana Faiella</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Charis Mesaritakis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Evangelos Grivas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Janne Rasmussen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jan Petersen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Isaac Cano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Elisa Puigdomènech</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jos Dumortier</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Maja Voss-Knude</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Raffaele Montella</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Angelo Ciaramella</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Giancarlo Fortino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Antonio Guerrieri</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Antonio Liotta</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Secure Cross-Border Exchange of Health Related Data: The KONFIDO Approach</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Internet and Distributed Computing Systems - 12th International Conference, IDCS 2019, Naples, Italy, October 10-12, 2019, Proceedings</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-34914-1_30</style></URL><title><style face="normal" font="default" size="100%">Secure Cross-Border Exchange of Health Related Data: The KONFIDO Approach</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Khaled Hussain</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mohamed Bassyouni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Accurate and Energy-Efficient Classification with Spiking Random Neural Network: Corrected and Expanded Version</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">CoRR</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">abs/1906.08864</style></VOLUME><URL><style face="normal" font="default" size="100%">http://arxiv.org/abs/1906.08864</style></URL><title><style face="normal" font="default" size="100%">Accurate and Energy-Efficient Classification with Spiking Random Neural Network: Corrected and Expanded Version</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Huibo Bi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Emergency Management Systems and Algorithms: a Comprehensive Survey</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">CoRR</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">abs/1907.04136</style></VOLUME><URL><style face="normal" font="default" size="100%">http://arxiv.org/abs/1907.04136</style></URL><title><style face="normal" font="default" size="100%">Emergency Management Systems and Algorithms: a Comprehensive Survey</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pantelis Natsiavas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Janne Rasmussen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Maja Voss-Knude</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konstantinos Votis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Coppolino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paolo Campegiani</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Isaac Cano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">David Marí</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Giuliana Faiella</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Fabrizio Clemente</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marco Nalin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Evangelos Grivas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Oana Stan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jos Dumortier</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jan Petersen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luigi Romano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ioannis Komnios</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vassilis Koutkias</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Comprehensive user requirements engineering methodology for secure and interoperable health data exchange</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">18</style></VOLUME><PAGES><style face="normal" font="default" size="100%">85:1–85:16</style></PAGES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1186/s12911-018-0664-0</style></URL><title><style face="normal" font="default" size="100%">Comprehensive user requirements engineering methodology for secure and interoperable health data exchange</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jun Du</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Chunxiao Jiang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lei Xu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jianhua Li</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yong Ren</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Distributed Data Privacy Preservation in IoT Applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Wirel. Commun.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">25</style></VOLUME><PAGES><style face="normal" font="default" size="100%">68–76</style></PAGES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/MWC.2017.1800094</style></URL><title><style face="normal" font="default" size="100%">Distributed Data Privacy Preservation in IoT Applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ingrid Grenet</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yonghua Yin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jean-Paul Comet</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vera Kurková</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yannis Manolopoulos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Barbara Hammer</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lazaros Iliadis</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ilias Maglogiannis</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Machine Learning to Predict Toxicity of Compounds</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Artificial Neural Networks and Machine Learning - ICANN 2018 - 27th International Conference on Artificial Neural Networks, Rhodes, Greece, October 4-7, 2018, Proceedings, Part I</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-01418-6_33</style></URL><title><style face="normal" font="default" size="100%">Machine Learning to Predict Toxicity of Compounds</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yasin Kadioglu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy Life-Time of Wireless Nodes with Network Attacks and Mitigation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2018 IEEE International Conference on Communications Workshops, ICC Workshops 2018, Kansas City, MO, USA, May 20-24, 2018</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/ICCW.2018.8403561</style></URL><title><style face="normal" font="default" size="100%">Energy Life-Time of Wireless Nodes with Network Attacks and Mitigation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jun Du</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Chunxiao Jiang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zhu Han</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yong Ren</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mohsen Guizani</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Networked Data Transaction in Mobile Networks: A Prediction-based Approach Using Auction</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/IWCMC.2018.8450531</style></URL><title><style face="normal" font="default" size="100%">Networked Data Transaction in Mobile Networks: A Prediction-based Approach Using Auction</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jun Du</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Chunxiao Jiang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zhu Han</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yong Ren</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mohsen Guizani</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Cognitive Data Allocation for Auction-based Data Transaction in Mobile Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/IWCMC.2018.8450428</style></URL><title><style face="normal" font="default" size="100%">Cognitive Data Allocation for Auction-based Data Transaction in Mobile Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Huibo Bi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Survey of Algorithms and Systems for Evacuating People in Confined Spaces</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Electronics — Open Access Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%"> vol. 8</style></VOLUME><SECTION><style face="normal" font="default" size="100%"> vol. 8, p. 711</style></SECTION><DATE><style face="normal" font="default" size="100%">06/2019</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The frequency, destruction and costs of natural and human-made disasters in modern&lt;br /&gt;&#13;
highly-populated societies have resulted in research on emergency evacuation and wayfinding, which&lt;br /&gt;&#13;
has drawn considerable attention. The subject is now a multidisciplinary area of research where&lt;br /&gt;&#13;
information and communication technologies (ICT), and in particular the Internet of Things (IoT),&lt;br /&gt;&#13;
have a significant impact on sensing and computing dynamic reactions that mitigate or prevent&lt;br /&gt;&#13;
the worst outcomes of disasters. This paper offers state-of-the-art knowledge in this area so as to&lt;br /&gt;&#13;
share ongoing research results, identify the research gaps and address the need for future research.&lt;br /&gt;&#13;
We present a comprehensive review of research on emergency evacuation and wayfinding, focusing&lt;br /&gt;&#13;
on the algorithmic and system design aspects. Starting from the history of emergency management&lt;br /&gt;&#13;
research, we identify the emerging challenges concerning system optimisation, evacuee behaviour&lt;br /&gt;&#13;
optimisation and data analysis, and the additional energy consumption by ICT equipment that&lt;br /&gt;&#13;
operates the emergency management infrastructure.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Survey of Algorithms and Systems for Evacuating People in Confined Spaces</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Huibo Bi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yanyan Chen</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Incentive mechanism for collective coordination in an urban intelligent transportation system using G-networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE MASCOTS 2020</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEEXpress</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">10/2020</style></DATE><title><style face="normal" font="default" size="100%">Incentive mechanism for collective coordination in an urban intelligent transportation system using G-networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Will Serrano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yonghua Yin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Random Neural Network with Deep Learning Clusters in Smart Search</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Neurocomputing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">396</style></VOLUME><SECTION><style face="normal" font="default" size="100%">394</style></SECTION><DATE><style face="normal" font="default" size="100%">04/2020</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This paper proposes a Neurocomputing application that reorders the Web results obtained from different Web Search Engines emulating the way our brain takes decisions. The proposed application is based on the Random Neural Network with Deep Learning Clusters that evaluates and adapts Web result relevance by associating independently each Deep Learning Cluster to a specific Web Search Engine. In addition, this paper presents a Deep Learning Cluster to perform as a Management Cluster that decides the final result relevance based on the inputs from each independent Deep Learning cluster. The performance of the proposed Management Cluster is evaluated when included as an additional layer to the Deep Learning Clusters. On average; the proposed Deep Learning cluster structure improves Smart Search performance&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">The Random Neural Network with Deep Learning Clusters in Smart Search</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Will Serrano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Deep Learning Clusters in the Cognitive Packet Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Neurocomputing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">396</style></VOLUME><SECTION><style face="normal" font="default" size="100%">406</style></SECTION><DATE><style face="normal" font="default" size="100%">07/2020</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Cognitive&#160;&lt;a href="https://www.sciencedirect.com/topics/computer-science/packet-network" title="Learn more about Packet Network from ScienceDirect's AI-generated Topic Pages"&gt;Packet Network&lt;/a&gt;&#160;(CPN) bases its routing decisions and flow control on the Random&#160;&lt;a href="https://www.sciencedirect.com/topics/neuroscience/neural-networks" title="Learn more about Neural Networks from ScienceDirect's AI-generated Topic Pages"&gt;Neural Network&lt;/a&gt;&#160;(RNN) Reinforcement&#160;&lt;a href="https://www.sciencedirect.com/topics/computer-science/learning-algorithm" title="Learn more about Learning Algorithm from ScienceDirect's AI-generated Topic Pages"&gt;Learning algorithm&lt;/a&gt;; this paper proposes the addition of a Deep Learning (DL) Cluster management structure to the CPN for Quality of Service metrics (Delay Loss and Bandwidth), Cyber Security keys (User, Packet and Node) and Management decisions (QoS, Cyber and CEO). The RNN already models how neurons transmit information using positive and negative impulsive signals whereas the proposed additional Deep Learning structure emulates the way the brain learns and takes decisions; this paper presents a brain model as the combination of both learning algorithms, RNN and DL. The proposed model has been simulated under different network sizes and scenarios and it has been validated against the CPN itself without DL clusters. The simulation results are promising; the presented CPN with DL clusters as a mechanism to transmit, learn and make packet routing decisions is a step closer to emulate the way the brain transmits information, learns the environment and takes decisions.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Deep Learning Clusters in the Cognitive Packet Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jun Du</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Chunxiao Jiang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zhu Han</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yong Ren</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Auction-Based Data Transaction in Mobile Networks: Data Allocation Design and Performance Analysis</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Transactions on Mobile Computing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">19</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1040</style></SECTION><DATE><style face="normal" font="default" size="100%">05/2020</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Mobile data traffic is experiencing unprecedented increases due to the proliferation of highly capable smartphones, laptops and tablets, and mobile data offloading can be used to move traffic from cellular networks to other wireless infrastructures such as small-cell base stations. This work addresses the related issue of data allocation, by proposing a novel infrastructure independent method based on the hotspot function of smartphones. In the proposed scheme, smartphones transfer data allowances among mobile users, so that users with excess data allowances act as accessible Wi-Fi hotspots, selling their data allowance to other users who need extra data allowances. To achieve this objective, we propose to use auctions with single and multiple data sellers. Efficient schemes based on auction models are discussed to sell the data allowances over successive days in a month, and over different time slots during a single day. Overall system performance is considered based on the behavior of mobile users, such as changing demands for the sale or purchase of data allowances. Together with the analytical results presented, our simulation experiments also indicate that knowledge of user behavior can significantly improve the performance of data allowance transactions, leading to highly efficient allocations among users.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Auction-Based Data Transaction in Mobile Networks: Data Allocation Design and Performance Analysis</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Dionysios Kehagias</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marija Jankovic</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Investigating the Interaction between Energy Consumption, Quality of Service, Reliability, Security, and Maintainability of Computer Systems and Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SN Computer Science </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Conference on Energy Consumption, Quality of Service, Reliability, Security, and Maintainability of Computer Systems and Networks (EQSEM) was held as a virtual conference on October 20–21, 2020. This paper summarises the objectives and proceedings of this conference. It then briefly presents the keynotes and other papers which were presented. Then, in the context of the EU-funded research project SDK4ED which motivated this conference, we outline several solutions that are being developed for managing the potential inter-dependencies and corresponding trade-offs between design-time and runtime qualities in software applications, and review the key functionalities that have been implemented within the SDK4ED integrated platform as of this writing. Then, we briefly introduce four papers among those presented at the EQSEM Conference that are included in this issue of the journal SN Computer Science, presenting relevant research achievements of the SDK4ED Project on software maintainability, reliability, and energy efficiency.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Investigating the Interaction between Energy Consumption, Quality of Service, Reliability, Security, and Maintainability of Computer Systems and Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Minimizing Energy and Computation in Long-Running Software</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Applied Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">11</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3</style></ISSUE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Long-running software may operate on hardware platforms with limited energy resources&lt;br /&gt;&#13;
such as batteries or photovoltaic, or on high-performance platforms that consume a large amount&lt;br /&gt;&#13;
of energy. Since such systems may be subject to hardware failures, checkpointing is often used to&lt;br /&gt;&#13;
assure the reliability of the application. Since checkpointing introduces additional computation time&lt;br /&gt;&#13;
and energy consumption, we study how checkpoint intervals need to be selected so as to minimize a&lt;br /&gt;&#13;
cost function that includes the execution time and the energy. Expressions for both the program’s&lt;br /&gt;&#13;
energy consumption and execution time are derived as a function of the failure probability per&lt;br /&gt;&#13;
instruction. A first principle based analysis yields the checkpoint interval that minimizes a linear&lt;br /&gt;&#13;
combination of the average energy consumption and execution time of the program, in terms of the&lt;br /&gt;&#13;
classical “Lambert function”. The sensitivity of the checkpoint to the importance attributed to energy&lt;br /&gt;&#13;
consumption is also derived. The results are illustrated with numerical examples regarding programs&lt;br /&gt;&#13;
of various lengths and showing the relation between the checkpoint interval that minimizes energy&lt;br /&gt;&#13;
consumption and execution time, and the one that minimizes a weighted sum of the two. In addition,&lt;br /&gt;&#13;
our results are applied to a popular software benchmark, and posted on a publicly accessible web&lt;br /&gt;&#13;
site, together with the optimization software that we have developed.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Minimizing Energy and Computation in Long-Running Software</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Guy Brasseur</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luc Cheffneux</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Véronique Dehant</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Véronique Halloin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jean-Paul Haton</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michel Judkiewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bernard Rentier</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Romain Weikmans</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Réflexions sur la diffusion des connaissances a travers les grands colloques internationaux, les revues scientifiques, et la communication libre et rapide entre chercheurs et innovateurs dans un contexte de reduction de l'empreinte climatique</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">1024, Bulletin de la Société Informatique de France</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">17</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><SECTION><style face="normal" font="default" size="100%">155-265</style></SECTION><DATE><style face="normal" font="default" size="100%">04/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">Au début de l’année 2019, la classe Technologie et société de l’Académie royale de Belgique a suivi la proposition de son directeur d’orienter principalement ses travaux, durant deux ans, sur le thème de la Transition vers un futur désirable. Personne à ce moment n’imaginait que nous allions vivre une crise de l’ampleur de celle que nous traversons. La pandémie révèle le manque de résilience du monde dans lequel nous vivons ; elle en souligne particulièrement la complexité tout comme les interactions multiples qui lient les douze domaines que la classe avait souhaité aborder dans sa démarche. Si la santé est concernée au premier chef par la crise sanitaire, le monde de l’entreprise et du travail n’a pas manqué d’être directement impacté. Notre modèle économique et financier a été interpelé et la nécessité fut relevée de disposer d’infrastructures de bon niveau de même que d’une gouvernance capable de faire face à des situations critiques qui peuvent générer des risques touchant à la paix et à la sécurité. Il est aussi apparu combien les valeurs de solidarité, de civisme et de cohésion sociale retrouvent toute leur importance, tandis que la nécessité des connaissances scientifiques et de l’expertise est mise en exergue. Les technologies disruptives (en particulier le numérique) nous offrent la possibilité de garder le contact, tout en suscitant parfois de sérieux problèmes de respect de la vie privée et des droits humains. Notre système d’éducation s’en trouve lourdement perturbé et l’impact sur l’environnement et le climat est tangible tandis que la nature retrouve (un peu) ses droits (ressources naturelles). Or, dès avant l’apparition de la pandémie, un large consensus s’était dégagé au sein du monde politique et économique ainsi que dans la population des pays européens sur la nécessité de réagir énergiquement face à la crise climatique de plus en plus manifeste, qui menace l’humanité à l’horizon d’une génération. Aussi, a fortiori, le redémarrage de l’économie mondiale au lendemain d’un lock-down sanitaire ne peut-il faire l’impasse sur la prise en compte du changement climatique et de ses conséquences sociales, potentiellement beaucoup plus graves encore que celles causées par la pandémie elle-même. Face à un défi aussi colossal, les Académies ne peuvent se contenter de poursuivre quiètement leurs activités comme par le passé. La classe Technologie et société de l’Académie royale de Belgique, en particulier, se doit d’apporter une contribution, même modeste, à la réflexion générale nécessaire à l’éveil de la conscience des citoyens et dont nos dirigeants devraient pouvoir se nourrir afin de prendre les décisions qui s’imposent. Cette problématique, dont il serait naïf de ré- duire le niveau de grande complexité, est promue à un intérêt croissant, car au cœur d’un développement harmonieux des sociétés. Si l’innovation technologique ne peut seule prétendre résoudre les problèmes auxquels le monde est confronté, elle devrait en effet être en mesure d’apporter des réponses efficaces qui, sans cesse, seront pourtant confrontées à la question de la transparence des procédures de recherche et à la publicité des résultats. Dans ce débat, l’Union européenne et ses États membres, dans leurs champs d’action respectifs, auront à intervenir et à se choisir une ligne de conduite, responsable et soucieuse du bien commun.&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">{https://www.societe-informatique-de-france.fr/wp-content/uploads/2021/04/1024_17_2021_155.pdf</style></URL><title><style face="normal" font="default" size="100%">Réflexions sur la diffusion des connaissances a travers les grands colloques internationaux, les revues scientifiques, et la communication libre et rapide entre chercheurs et innovateurs dans un contexte de reduction de l'empreinte climatique</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Randomization of Data Generation Times Improves Performance of Predictive IoT Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">7th IEEE World Forum on the Internet of Things</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">New Orleans, Louisiana, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Input traffic from Internet of Things (IoT) devices is often both periodic and requires to be received by a given deadline. This can create congestion at instants of time when traffic flowing from multiple devices arrives at a shared input port or gateway, resulting in missed deadlines at the receiver. As a consequence, scheduling techniques such as the “Earliest Deadline First” (EDF) and “Priority based on Average Load” (PAL) are used to schedule the flow from different devices so as to try to satisfy the needs of the largest number of traffic flows in a timely fashion. In this paper, we propose the Randomization of flow Genaration Times (RGT) in order to smooth the total incoming traffic to the input port or gateway, on top of the use of EDF and PAL. We then evaluate the performance of RGT together with PAL and EDP, for traffic load with a varying number of up to 6400 IoT devices. Our simulation results show that RGT provides significantly better performance when added to EDF and PAL. Also, the additional computation required by RGT at each device can be quite small, suggesting that RGT is a very useful addition for improving the performance of IoT networks.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://wfiot2021.iot.ieee.org</style></URL><title><style face="normal" font="default" size="100%">Randomization of Data Generation Times Improves Performance of Predictive IoT Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Renforcer la place des universités européennes dans le concert mondial</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Revue des Electriciens et Electroniciens</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2</style></VOLUME><SECTION><style face="normal" font="default" size="100%">102-107</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Les pays de l’UE peuvent se targuer de posséder quelques-unes des plus prestigieuses universités et organismes de recherche dans le monde. Pourtant la part des innovations technologiques que produit le continent reste faible au regard du potentiel de recherches que l’UE représente. Comment redresser la barre et mieux armer les universités européennes dans la compétition exacerbée que se livrent les grandes puissances ? Après une analyse du financement et du mode de fonctionnement comparés des universités dans le monde occidental, l’auteur propose quelques recommandations fortes pour donner à la France et l’Europe de la recherche les moyens de se confronter à armes égales avec ses concurrents.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Renforcer la place des universités européennes dans le concert mondial</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nan Li</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Xiping Hu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Edith Ngai</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Cooperative Wireless Edges with Composite Resource Allocation in Hierarchical Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;With the expansion of the IoT, it is important to optimize available bandwidth to reliably support edge to device communications. Thus we propose a wireless network where each edge server communicates with its end devices using its wireless band as a primary channel, assisted by a secondary edge server that can relay communications via its own wireless band as a secondary channel. The network can optimize capacity by balancing load between primary and secondary wireless bands, and we analyze the geometry of achievable rate regions, depending on the state of bands modeled as Rayleigh fading channels. The allocation of a connection to the primary or secondary band is formulated as an optimization problem which is then solved, and illustrated with numerical examples. Index Terms—Edge computing, cooperation, non-orthogonal multiple access, resource allocation&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Cooperative Wireless Edges with Composite Resource Allocation in Hierarchical Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Fröhlich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Fiołka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jacek Chęciński</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zdzisław Filus</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Smart SDN Management of Fog Services to Optimize QoS and Energy</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">21(9)</style></VOLUME><SECTION><style face="normal" font="default" size="100%">3105</style></SECTION><DATE><style face="normal" font="default" size="100%">April 2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The short latency required by IoT devices that need to access specific services have led to the development of Fog architectures that can serve as a useful intermediary between IoT systems and the Cloud. However, the massive numbers of IoT devices that are being deployed raise concerns about the power consumption of such systems as the number of IoT devices and Fog servers increase. Thus, in this paper, we describe a software-defined network (SDN)-based control scheme for client–server interaction that constantly measures ongoing client–server response times and estimates network power consumption, in order to select connection paths that minimize a composite goal function, including both QoS and power consumption. The approach using reinforcement learning with neural networks has been implemented in a test-bed and is detailed in this paper. Experiments are presented that show the effectiveness of our proposed system in the presence of a time-varying workload of client-to-service requests, resulting in a reduction of power consumption of approximately 15% for an average response time increase of under 2%.</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/1424-8220/21/9/3105</style></URL><title><style face="normal" font="default" size="100%">Smart SDN Management of Fog Services to Optimize QoS and Energy</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Dan Larhammar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Maria Baghramian</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piero Bianucci</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Garvin Brod</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dalibor Dobiáš</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Risto Kunelius</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefano Leonardi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stephan Lewandowsky</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mariëtte Samenweten</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Alison Powell</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jane Suiter</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Fact or Fake? Tackling Science Disinformation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ALLEA General Assembly Paper</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ALLEA - All European Academies</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">paper 5</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The information landscape has undergone dramatic changes with the expansion of the internet and digital social media platforms. Information can be spread more rapidly and can reach more people than ever before. While this offers excellent possibilities to teach and educate and to disseminate information about research results and scientific evidence, it also comes with a downside: False information can be propagated with equal ease and speed. This discussion paper describes and discusses the problems and the consequences of science disinformation in three areas of concern, namely climate change, vaccines and pandemics, and what we can do to increase awareness and minimize harm caused by the spread of disinformation. It does so by highlighting the societal value of the scientific method, research integrity, open science communication and the resulting trust in science. The underlying question is how to protect the pillars of science from the severe consequences of disinformation while maintaining openness and democratic principles. This paper presents the central characteristics of science disinformation, its roots, its spread, and potential solutions. The mere existence of disinformation is hard to prevent in open societies with strong protection of individual rights and freedom of expression. The paper identifies underlying cognitive, social and economic mechanisms that amplify the spread of disinformation and evaluates potential solutions. Extensive research over the past several years has identified cognitive features of the human mind, as well as fast and efficient transmission channels, that contribute to the prevalence of science disinformation in our societies. Potential solutions cover a range of psychological, technical and political measures including inoculation, debunking, recommender systems, fact-checking, raising awareness, media literacy, and innovations in science communication and public engagement. Together, they contribute to tackling problems such as knowledge resistance, pseudoscience, undermining of trust, confirmation bias, filter bubbles, echo chambers, and other problems related to science disinformation.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Fact or Fake? Tackling Science Disinformation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sabu Thampi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mohammed Atiquzzaman</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vipin Chaudhary</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kuan-Ching Li</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Advances in Computing and Network Communications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1</style></VOLUME><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Fourth International Conference on Computing and Network Communications (CoCoNet’20) provided a forum for sharing original research outcomes and practical development experiences among experts in the emerging areas of computing and communications. The conference was organized by Vellore Institute of Technology (VIT), Chennai, India. Due to the recent pandemic situation, the conference was conducted as a virtual event during October 14–17, 2020. The material was presented in a program that consisted of keynote talks, technical sessions, lightning talks, tutorials, symposiums, parallel sessions, workshops and hot off the press. CoCoNet’20 convened a well-tailored and handpicked collection of eminent speakers from renowned universities and industries in and outside India. The array of speakers included Dr. Ian T. Foster, Dr. Arumugam Nallanathan, Dr. Mohammed Atiquzzaman, Dr. Vipin Chaudhary, Dr. Dilip Krishnaswamy and Dr. Ljiljana Trajkovic. The conference received 181 submissions this year, out of which 98 papers (58 regular papers and 40 short papers) had been accepted. The papers were subjected to a rigorous review process that examined the significance, novelty and technical quality of the submission. The papers were presented in different sessions, namely the best paper sessions, regular paper sessions and short paper sessions. The proceedings of the conference is organized into two volumes. This volume is comprised of 51 papers, and the topical sections include Communications, Control and Signal Processing, Data Analytics and Networked Systems and Security. The success of the conference depends ultimately on the numerous people who have worked with us to plan and organize both the technical program and local arrangements. In particular, the wise advice and brilliant ideas of the program chairs, workshop and symposium chairs and industry track chairs in the organization of the technical program are gratefully appreciated. We would like to extend our heartfelt gratitude to the organizing committee and advisory committee members. The accomplishment of the motives of the conference is powered by the tireless efforts of many individuals. We would like to express our sincere gratitude to the TPC chairs, TPC members and additional reviewers who shared their technical expertise and assisted us in reviewing all the submitted papers. We would like to thank the general chairs, organizing committee members, steering committee, keynote speakers, session chairs and the conference attendees. We are thankful to&#160;all the authors for choosing this conference as a venue for presenting their research works. We express our wholehearted appreciation to the contributions of all those who apportioned their valuable time for the success of CoCoNet’20. We are grateful to Vellore Institute of Technology (VIT), Chennai, for organizing the conference. Recognition should go to the local organizing committee members who all have worked extremely hard for the details of important aspects of the conference programs. We appreciate the contributions of all the faculty and staff of VIT and the student volunteers who have selflessly contributed their time to make this virtual conference successful. We would like to express our gratitude to Senior Editor of Springer Nature, Aninda Bose, for his help and cooperation. We sincerely hope that CoCoNet’20 turned out to be a forum for excellent discussions that enabled new ideas to come about, promoting collaborative research. We are confident that the proceedings will serve as a momentous source of research references and knowledge, which will lead not only to the scientific and engineering findings but also to the development of new products and technologies.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Advances in Computing and Network Communications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Guy Brasseur</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luc Chefneux</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Véronique Devant</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Véronique Halloin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jean-Paul Haton</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michel Judkiewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bernard Rentier</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Romain Weikmans</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">On	Sharing	Knowledge	And	Fostering	 “Open	Science”</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Ubiquity (ACM Journal)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2021</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1-13</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The crucial importance of science and technology and its accurate peer reviewed dissemination, has once again been demonstrated during the current pandemic. Thus the COVID-19 pandemic together with the inevitable energy transition required by climate change, lead us to consider the issue of scientific and technical communication, both for the written papers and proceedings that have largely moved online (but not always in open access), and the various types of seminars, workshops, and symposia that frequently involve air travel with substantial CO2 impact. Online meetings that have become recently very popular, as well as online repositories for publications, themselves have a significant CO2—as well as environmental—impact, due to the massive use of electricity by information and communication technologies (ICT) and of the environmentally unfriendly manufacturing processes and decommissioning of ICT equipment. Presented is a broad overview of these aspects, and some recommendations regarding the future organization of scientific and technical communication, including: (1) peer-reviewed journals and proceedings with online open access; (2) the importance of face to face seminars and symposia, together with online meetings, to maintain the serendipity and importance of direct human contact while reducing the need for air travel; (3) the peer evaluation of research and of academic and research staff and its dependence on publications and their qualitative—rather than excessively quantitative—evaluation, where the concept of impact should include the usefulness of research to education, industry and society; (4) and the crucial role of ICT in all these aspects and the questions raised by the sustainability of ICT itself.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">On	Sharing	Knowledge	And	Fostering	 “Open	Science”</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dionysios Kehagias</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A hierarchical model for quantifying software security based on static analysis alerts and software metrics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Software Quality Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">29</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">2</style></ISSUE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Despite the acknowledged importance of quantitative security assessment in secure software development, current literature still lacks an efcient model for measuring internal software security risk. To this end, in this paper, we introduce a hierarchical security assessment model (SAM), able to assess the internal security level of software products based on low-level indicators, i.e., security-relevant static analysis alerts and software metrics. The model, following the guidelines of ISO/IEC 25010, and based on a set of thresholds and weights, systematically aggregates these low-level indicators in order to produce a high-level security score that refects the internal security level of the analyzed software. The proposed model is practical, since it is fully automated and operationalized in the form of a standalone tool and as part of a broader Computer-Aided Software Engineering (CASE) platform. In order to enhance its reliability, the thresholds of the model were calibrated based on a repository of 100 popular software applications retrieved from Maven Repository. Furthermore, its weights were elicited in a way to chiefy refect the knowledge expressed by the Common Weakness Enumeration (CWE), through a novel weights elicitation approach grounded on popular decision-making techniques. The proposed model was evaluated on a large repository of 150 open-source software applications retrieved from GitHub and 1200 classes retrieved from the OWASP Benchmark. The results of the experiments revealed the capacity of the proposed model to reliably assess internal security at both product level and class level of granularity, with sufcient discretion power. They also provide preliminary evidence for the ability of the model to be used as the basis for vulnerability prediction. To the best of our knowledge, this is the frst fully automated, operationalized and sufciently evaluated security assessment model in the modern literature&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A hierarchical model for quantifying software security based on static analysis alerts and software metrics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Fröhlich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Reinforcement Learning and Energy-Aware Routing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM 4th FlexNets'21 Workshop, ACM SIGCOMM 2021</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ACM</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We present an approach that uses Reinforcement Learning (RL) with the Random Neural Network (RNN) acting as an adaptive critic, to route traffic in a SDN network, so as to minimize a composite Goal function that includes both packet delay and energy consumption per packet. We directly measure the traffic dependent energy consumption characeristics of the hardware that we use (including energy expended per packet) so as to parametrize the Goal function. The RL based algorithm with the RNN is implemented in a SDN controller that manages a multi-hop network which assigns service requests to specific servers so as to minimize the desired Goal. The overall system’s performance is evaluated through experimental measurements of packet delay and energy consumption under different traffic load values, demonstrating the effectiveness of the proposed approach.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://dl.acm.org/doi/pdf/10.1145/3472735.3473390</style></URL><title><style face="normal" font="default" size="100%">Reinforcement Learning and Energy-Aware Routing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">MIRAI Botnet Attack Detection with Auto-Associative Dense Random Neural Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2021 IEEE Global Communications Conference</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Barcelona</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">7-11 Dec 2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">Internet connected IoT devices have often been particularly vulnerable to Botnet attacks of the Mirai family in recent years. Thus we develop an attack detection scheme for Mirai Botnets, using the Auto-Associative Dense Random Neural Network that has recently been successful for other attacks such as the SYN attack. The resulting method is trained with normal traffic and tested with attack traffic, and shown to result in high accuracy detection of attacks with low false alarms. The approach is compared on the same data set with two other common Machine learning methods (Lasso and KNN) and shown to have higher accuracy, and much lower computation times than KNN and slightly higher (but comparable) computation times with respect to Lasso.</style></ABSTRACT><title><style face="normal" font="default" size="100%">MIRAI Botnet Attack Detection with Auto-Associative Dense Random Neural Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">NOBEL PRIZE 50 YEARS AGO</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Europhysics News </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">52</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5</style></ISSUE><SECTION><style face="normal" font="default" size="100%">40-42</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;As we recall the major contributions of Professor Dennis Gabor that resulted in his Nobel Prize in Physics in 1971 for the invention of holography, it is interesting to put his impact on science, technology, as well as humanity, in a broader context so as to better understand his experiences, and recognize the very significant role that he played in his time.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">NOBEL PRIZE 50 YEARS AGO</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Botnet Attack Detection with Incremental Online Learning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">EuroCybersec 2021</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In recent years, IoT devices have often been the target of Mirai Botnet attacks. This paper develops an intrusion detection method based on Auto-Associated Dense Random Neural Network with incremental online learning, targeting the detection of Mirai Botnet attacks. The proposed method is trained only on benign IoT traffic while the IoT network is online; therefore, it does not require any data collection on benign or attack traffic. Experimental results on a publicly available dataset have shown that the performance of this method is considerably high and very close to that of the same neural network model with offline training. In addition, both the training and execution times of the proposed method are highly acceptable for real-time attack detection.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Botnet Attack Detection with Incremental Online Learning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tsoukalas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ilias Kalouptsoglou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Maria Mathioudaki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dionysios Kehagias</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dimitrios Tzovaras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The IoTAC Software Security-by-Design Platform: Concept, Challenges, and Preliminary Overview</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">18th International Conference on the Design of Reliable Communication Networks (DRCN)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Vilanova i la Geltrú, Spain</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Critical everyday activities handled by modern IoT Systems imply that security is of major concern both for the end-users and the industry. Securing the IoT System Architecture is commonly used to strengthen its resilience to malicious attacks. However, the security of software running on the IoT must be considered as well, since the exploitation of its vulnerabilities can infringe the security of the overall system, regardless of how secure its architecture may be. Thus, we present an IoT Software Security-by-Design (SSD) Platform, which provides mechanisms for monitoring and optimizing the security of IoT software applications throughout their development lifecycle, to validate the broader security of the IoT software. This paper describes the proposed SSD platform that leverages security information from all phases of development, using some novel mechanisms that have been implemented, and which can lead to a holistic security evaluation and future security certification.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">The IoTAC Software Security-by-Design Platform: Concept, Challenges, and Preliminary Overview</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">G-Networks Can Detect Different Types of Cyberattacks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2022 Mascots: 30th International Symposium on the Modelling, Analysis and Simulation of Computer and Telecommunication Systems</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Malicious network attacks are a serious source of concern, and machine learning techniques are widely used to build Attack Detectors with off-line training with real attack and non-attack data, and used online to monitor system entry points connected to networks. Many machine learning based Attack Detectors are typically trained to identify specific types attacks, and the training of such algorithms to cover several types of attacks may be excessively time consuming. This paper shows that G-Networks, which are queueing networks with product form solution and special customers such as negative customers and triggers, can be trained just with “non-attack” traffic, can accurately detect several different attack types. This is established with a special case of G-Networks with triggerred customer movement. A DARPA attack and non-attack traffic repository is used to train and test the the G-Network, yielding comparable or clearly better accuracy than most known attack detection techniques.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">G-Networks Can Detect Different Types of Cyberattacks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Karl Sigman</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">IoT Traffic Shaping and the Massive Access Problem</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ICC 2022, IEEE International Conference on Communications, 16–20 May 2022, Seoul, South Korea</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Seoul, South Korea </style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE Xplore, CC 2022 - IEEE International Conference on Communications, 2022, pp. 2732-2737</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">08/2022</style></DATE><ISBN><style face="normal" font="default" size="100%">978-1-5386-8347-7</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;IoT gateways aim to meet the deadlines and QoS&#160;needs of packets from as many IoT devices as possible, though this can lead to a form of congestion known as the Massive&#160;Access Problem (MAP). While much work was conducted on&#160;predictive or reactive scheduling schemes to match the arrival&#160;process of packets to the service capabilities of IoT gateways, such&#160;schemes may use substantial computation and communication&#160;between gateways and IoT devices. This paper proves that&#160;the recently proposed “Quasi-Deterministic-Transmission-Policy&#160;(QDTP)” traffic shaping approach which delays packets at IoT&#160;devices, substantially alleviates the MAP: QDTP does not increase&#160;overall end-to-end delay and reduces gateway queue length. We&#160;then introduce the Adaptive Non-Deterministic Transmission Policy (ANTP) that requires only one packet buffer at the gateway,&#160;offering substantial QoS improvement over FIFO scheduling.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">IoT Traffic Shaping and the Massive Access Problem</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Huibo Bi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Searching and Rescuing Victims in Emergency: A Comprehensive Survey</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">CECNet 2021</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IOS Press</style></PUBLISHER><title><style face="normal" font="default" size="100%">Searching and Rescuing Victims in Emergency: A Comprehensive Survey</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marija Jankovic</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dionysios Kehagias</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Marton</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andras Vilmos</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Security in Computer and Information Sciences: Second International Symposium</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">EuroCybersec 2021</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer Nature</style></PUBLISHER><title><style face="normal" font="default" size="100%">Security in Computer and Information Sciences: Second International Symposium</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Fröhlich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Fiolka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jacek Chęciński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy, QoS and Security Aware Edge Services</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International ISCIS Security Workshop</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><title><style face="normal" font="default" size="100%">Energy, QoS and Security Aware Edge Services</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>10</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Guy Brasseur</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luc Cheffneux</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Véronique Dehant</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Fabjanska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Véronique Halloin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michel Judkiewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vladimir Mrsa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ignacio Llorente</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Challenges for European Science and Technology Driven Innovation in Europe</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><URL><style face="normal" font="default" size="100%">https://www.euro-case.org/challenges-for-european-science-and-technology-driven-innovation-in-europe/</style></URL><title><style face="normal" font="default" size="100%">Challenges for European Science and Technology Driven Innovation in Europe</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Fröhlich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Fiolka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jacek Chęciński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy, QoS and Security Aware Edge Services</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">EuroCybersec 2021</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;With the development of communication technologies and the increasing bandwidth of optical fibres and transmission speeds in current 5G and future 6G wireless networks, there is a growing demand for solutions organising traffic in such networks, taking into account both end-to-end transmissions and the possibility of data processing by edge services. The most pressing problems of today’s computer networks are not only bandwidth and transmission delays, but also security and energy consumption, which is becoming increasingly important in today’s climate. This paper presents a solution based on neural networks that organises network traffic taking into account the above criteria - quality of service (QoS), energy consumption and security.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy, QoS and Security Aware Edge Services</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">NOBEL PRIZE 50 YEARS AGO</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">EPN</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">52</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5</style></ISSUE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;As we recall the major contributions of Professor Dennis Gabor that resulted in his&lt;br /&gt;&#13;
Nobel Prize in Physics in 1971 for the invention of holography, it is interesting to put&lt;br /&gt;&#13;
his impact on science, technology, as well as humanity, in a broader context so as&lt;br /&gt;&#13;
to better understand his experiences, and recognize the very significant role that he&lt;br /&gt;&#13;
played in his time.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">NOBEL PRIZE 50 YEARS AGO</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paul Pearce</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">V. Kaptan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yu Wang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">N.S Walmsley</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Gardiner</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Moffat</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Dynamic Model for Identifying Enemy Collective Behaviour</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">11th ICCRTS Coalition Command and Control in the Networked Era</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Recent advances in Command and Control (C2) modelling have developed&lt;br /&gt;&#13;
algorithmic representations of the command decision making process at both&lt;br /&gt;&#13;
the tactical (Rapid Planning) and operational (Deliberate Planning) levels of&lt;br /&gt;&#13;
command. In this paper, the development of methods by which indicators of&lt;br /&gt;&#13;
enemy/group behaviour can be extracted is discussed. The aim of this work&lt;br /&gt;&#13;
is to use the grouping techniques to establish, with more certainty, force size&lt;br /&gt;&#13;
and direction. We describe a multi-agent model approach, based on a&lt;br /&gt;&#13;
hierarchical framework, suitable for identifying indicators of collaborative&lt;br /&gt;&#13;
behaviour associated with enemy agile mission groups that commonly feature&lt;br /&gt;&#13;
in the modern Networked Era.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Dynamic Model for Identifying Enemy Collective Behaviour</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Debanjan Konar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Soham Bhandary</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aditya Sarma</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Attila Cangi</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Random Quantum Neural Networks (RQNN) for Noisy Image Recog- nition</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Xplore</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Classical Random Neural Networks (RNNs) have demonstrated effective applications in decision&lt;br /&gt;&#13;
making, signal processing, and image recognition tasks. However, their implementation has been&lt;br /&gt;&#13;
limited to deterministic digital systems that output probability distributions in lieu of stochastic be-&lt;br /&gt;&#13;
haviors of random spiking signals. We introduce the novel class of supervised Random Quantum&lt;br /&gt;&#13;
Neural Networks (RQNNs) with a robust training strategy to better exploit the random nature of&lt;br /&gt;&#13;
the spiking RNN. The proposed RQNN employs hybrid classical-quantum algorithms with super-&lt;br /&gt;&#13;
position state and amplitude encoding features, inspired by quantum information theory and the&lt;br /&gt;&#13;
brain’s spatial-temporal stochastic spiking property of neuron information encoding. We have ex-&lt;br /&gt;&#13;
tensively validated our proposed RQNN model, relying on hybrid classical-quantum algorithms via&lt;br /&gt;&#13;
the PennyLane Quantum simulator with a limited number of qubits. Experiments on the MNIST,&lt;br /&gt;&#13;
FashionMNIST, and KMNIST datasets demonstrate that the proposed RQNN model achieves an av-&lt;br /&gt;&#13;
erage classification accuracy of 94.9%. Additionally, the experimental findings illustrate the proposed&lt;br /&gt;&#13;
RQNN’s effectiveness and resilience in noisy settings, with enhanced image classification accuracy&lt;br /&gt;&#13;
when compared to the classical counterparts (RNNs), classical Spiking Neural Networks (SNNs), and&lt;br /&gt;&#13;
the classical convolutional neural network (AlexNet). Furthermore, the RQNN can deal with noise,&lt;br /&gt;&#13;
which is useful for various applications, including computer vision in NISQ devices. The PyTorch&lt;br /&gt;&#13;
code 1 is made available on GitHub to reproduce the results reported in this manuscript.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Random Quantum Neural Networks (RQNN) for Noisy Image Recog- nition</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jankovic Marija</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kehagias Dionysios</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marton Anna</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Vilmos Andras</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Security in Computer and Information Sciences</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Second International Symposium, EuroCybersec 2021</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Nice, France</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><title><style face="normal" font="default" size="100%">Security in Computer and Information Sciences</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Traffic Based Sequential Learning During Botnet Attacks to Identify Compromised IoT Devices</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">10</style></VOLUME><SECTION><style face="normal" font="default" size="100%">126536</style></SECTION><DATE><style face="normal" font="default" size="100%">10/2022</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;A novel online Compromised Device Identification System (CDIS) is presented to identify IoT devices and/or IP addresses that are compromised by a Botnet attack, within a set of sources and destinations that transmit packets. The method uses specific metrics that are selected for this purpose and which are easily extracted from network traffic, and trains itself online during normal operation with an Auto-Associative Dense Random Neural Network (AADRNN) using traffic metrics measured as traffic arrives. As it operates, the AADRNN is trained with auto-associative learning only using traffic that it estimates as being benign, without prior collection of different attack data. The experimental evaluation on publicly available Mirai Botnet attack data shows that CDIS achieves high performance with Balanced Accuracy of 97%, despite its low on-line training and execution time. Experimental comparisons show that the AADRNN with sequential (online) auto-associative learning, provides the best performance among six different state-of-the-art machine learning models. Thus CDIS can provide crucial effective information to prevent the spread of Botnet attacks in IoT networks having multiple devices and IP addresses.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/9969594</style></URL><title><style face="normal" font="default" size="100%">Traffic Based Sequential Learning During Botnet Attacks to Identify Compromised IoT Devices</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Real-Time Cyberattack Detection with Offline and Online Learning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE International Symposium on Local and Metropolitan Area Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">London, United Kingdom</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This paper presents several novel algorithms for real-time cyberattack detection using the Auto-Associative Deep Random Neural Network, which were developed in the HORIZON 2020 IoTAC Project. Some of these algorithms require offline learning, while others require the algorithm to learn during its normal operation while it is also testing the flow of incoming traffic to detect possible attacks. Most of the methods we present are designed to be used at a single node, while one specific method collects data from multiple network ports to detect and monitor the spread of a Botnet. The evaluation of the accuracy of all the methods is carried out with real attack traces. These novel methods are also compared with other state-of-the-art approaches, showing that they offer better or equal performance,&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/10189812</style></URL><title><style face="normal" font="default" size="100%">Real-Time Cyberattack Detection with Offline and Online Learning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mohammed Nasereddin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Measurement Based Evaluation and Mitigation of Flood Attacks on a LAN Test-Bed</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The 48th IEEE Conference on Local Computer Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Daytona Beach, Florida, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The IoT is vulnerable to network attacks, and Intrusion Detection Systems (IDS) can provide high attack detection accuracy and are easily installed in IoT Servers. However, IDS are seldom evaluated in operational conditions which are seriously impaired by attack overload. Thus a Local Area Network testbed is used to evaluate the impact of UDP Flood Attacks on an IoT Server, whose first line of defence is an accurate IDS. We show that attacks overload the multi-core Server and paralyze its IDS. Thus a mitigation scheme that detects attacks rapidly, and drops packets within milli-seconds after the attack begins, is proposed and experimentally evaluated.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/10223358</style></URL><title><style face="normal" font="default" size="100%">Measurement Based Evaluation and Mitigation of Flood Attacks on a LAN Test-Bed</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mohammed Nasereddin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Protecting IoT Servers Against Flood Attacks with the Quasi Deterministic Transmission Policy</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The 22nd IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom-2023)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Exeter, UK</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Servers at Supply Chains that receive packets from IoT devices should meet the QoS needs of incoming packets, and protect the system from Cyberattacks. UDP Floods are often part of Cyberattacks that overwhelm Supply Chains and the IoT through congestion that paralyzes their operation and limits their ability for timely Attack Detection.Thus this paper proposes an architecture that protects a connected Server using a Smart Quasi-Deterministic Transmission Policy Forwarder placed at its input port. This Forwarder shapes the incoming traffic, sends it to the Server without modifying the overall packet delay, and avoids Server congestion. The relevant theoretical background is reviewed, and measurements during a UDP Flood Attack are provided to compare the Server performance, with and without the Forwarder. It is seen that during a UDP Flood Attack, the Forwarder protects the Server from congestion allowing it to effectively identify Attack Packets. The resulting Forwarder congestion is also eliminated with “drop” commands generated by the Forwarder, or sent by the Server to the Forwarder.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/10538961</style></URL><title><style face="normal" font="default" size="100%">Protecting IoT Servers Against Flood Attacks with the Quasi Deterministic Transmission Policy</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Baran Gül</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Decentralized Online Federated G-Network Learning for Lightweight Intrusion Detection</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Modeling, Analysis, and Simulation On Computer and Telecommunication Systems (MASCOTS)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Cyberattacks are increasingly threatening networked systems, often with the emergence of new types of unknown (zero-day) attacks and the rise of vulnerable devices. While Machine Learning (ML)-based Intrusion Detection Systems (IDSs) have been shown to be extremely promising in detecting these attacks, the need to learn large amounts of labeled data often limits the applicability of ML-based IDSs to cybersystems that only have access to private local data. To address this issue, this paper proposes a novel Decentralized and Online Federated Learning Intrusion Detection (DOF-ID) architecture. DOF-ID is a collaborative learning system that allows each IDS used for a cybersystem to learn from experience gained in other cybersystems in addition to its own local data without violating the data privacy of other systems. As the performance evaluation results using public Kitsune and Bot-IoT datasets show, DOF-ID significantly improves the intrusion detection performance in all collaborating nodes simultaneously with acceptable computation time for online learning.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Decentralized Online Federated G-Network Learning for Lightweight Intrusion Detection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Online Self-Supervised Deep Learning for Intrusion Detection Systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Transactions on Information Forensics and Security</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">19</style></VOLUME><SECTION><style face="normal" font="default" size="100%">5668</style></SECTION><DATE><style face="normal" font="default" size="100%">05/2024 </style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This paper proposes a novel Self-Supervised Intrusion Detection (SSID) framework, which enables a fully online {Deep Learning (DL)} based Intrusion Detection System (IDS) that requires no human intervention or prior off-line learning. The proposed framework analyzes and labels incoming traffic packets based only on the decisions of the IDS itself using an Auto-Associative Deep Random Neural Network, and on an online estimate of its statistically measured trustworthiness. The SSID framework enables IDS to adapt rapidly to time-varying characteristics of the network traffic, and eliminates the need for offline data collection. This approach avoids human errors in data labeling, and human labor and computational costs of model training and data collection. The approach is experimentally evaluated on public datasets and compared with well-known {machine learning and deep learning} models, showing that this SSID framework is very useful and advantageous as an accurate and online learning DL-based IDS for IoT systems.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;This paper proposes a novel Self-Supervised Intrusion Detection (SSID) framework, which enables a fully online Deep Learning (DL) based Intrusion Detection System (IDS) that requires no human intervention or prior off-line learning. The proposed framework analyzes and labels incoming traffic packets based only on the decisions of the IDS itself using an Auto-Associative Deep Random Neural Network, and on an online estimate of its statistically measured trustworthiness. The SSID framework enables IDS to adapt rapidly to time-varying characteristics of the network traffic, and eliminates the need for offline data collection. This approach avoids human errors in data labeling, and human labor and computational costs of model training and data collection. The approach is experimentally evaluated on public datasets and compared with well-known machine learning and deep learning models, showing that this SSID framework is very useful and advantageous as an accurate and online learning DL-based IDS for IoT systems.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/10531267</style></URL><title><style face="normal" font="default" size="100%">Online Self-Supervised Deep Learning for Intrusion Detection Systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">IoT Network Cybersecurity Assessment with the Associated Random Neural Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This paper proposes a method to assess the security of an n device, or IP address, IoT network by simultaneously identifying all the compromised IoT devices and IP addresses. It uses a specific Random Neural Network (RNN) architecture composed of two mutually interconnected sub-networks that complement each other in a recurrent structure, called the Associated RNN (ARNN). For each of the n devices or IP addresses in the IoT network, two distinct neurons of the ARNN advocate opposite views: compromised or not compromised. The fully interconnected 2 n neuron ARNN structure of paired neurons learns offline from ground truth data. Thus rather than requiring a separate attack detector at each network node, the ARNN offers a single overall attack detector that observes the incoming traffic at each node, learns about the interdependencies between network nodes, and formulates a recommendation for each device or IP address in an IoT network. The ARNN weight initialization and learning algorithm are discussed, and the ARNN performance is evaluated using real attack data, and compared against several learning and testing techniques. Results are obtained both for off-line learning with ground truth data, and for on-line incremental learning using a simplified average metric measured from incoming packet traffic. Comparisons with the best state-of-the-art techniques show that the ARNN significantly outperforms previously known approaches.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">IoT Network Cybersecurity Assessment with the Associated Random Neural Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Electricity Consumption by ICT: Facts, trends, and measurements</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM Ubiquity</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2023</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">August</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1-15</style></SECTION><DATE><style face="normal" font="default" size="100%">08/2023</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This paper considers key issues surrounding energy consumption by information and communication technologies (ICT), which has been steadily growing and is now attaining approximately 10% of the worldwide electricity consumption with a significant impact on greenhouse gas emissions. The perimeter of ICT systems is discussed, and the role of the subsystems that compose ICT is considered. Data from recent years is used to understand how each of these sub-systems contribute to ICT's energy consumption. The quantitatively demonstrated positive correlation between the penetration of ICT in the world's different economies and the same economies' contributions to undesirable greenhouse gas emissions is also discussed. The paper also examines how emerging technologies such as 5G, AI, edge computing, and cryptocurrencies are contributing to the worldwide increase in electricity consumption by ICT, despite the increases in ICT efficiency, in terms of energy consumed per bit processed, stored, or transmitted. The measurement of specific ICT systems' electricity consumption is also addressed, and the manner in which this consumption can be minimized in a specific edge computing context is discussed.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Electricity Consumption by ICT: Facts, trends, and measurements</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">System-wide vulnerability of multi-component software</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">196</style></VOLUME><SECTION><style face="normal" font="default" size="100%">110453</style></SECTION><DATE><style face="normal" font="default" size="100%">10/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In software systems comprised of many interconnected components, the vulnerability of each component will affect the vulnerability of other components and of the system as a whole. Existing techniques allow the quantification of the vulnerability of individual components taken singly, but the assessment of their vulnerability when they are interconnected or interdependent remains a challenge. The present work addresses this problem with a novel System-Wide Vulnerability Assessment (SWVA) framework for interconnected software components, based on an Associated Random Neural Network (ARNN) that estimates the system-wide vulnerability of all software components from known local vulnerabilities of individual components, and from their interconnections. The ARNN uses a problem-specific weight initialization, and learns from existing software system examples with a gradient-based deep learning algorithm. The ARNN is then used to assess the vulnerability of hitherto unseen software systems. The performance of the proposed ARNN-based SWVA framework is evaluated and compared against several well-known machine learning techniques on 13 different versions of a real-world software system with up to 11 components. The experimental results show the superior performance of the ARNN achieving above 85% median accuracy and good high scalability with respect to the number of connected software components.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">System-wide vulnerability of multi-component software</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Baran Gül</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">DISFIDA: Distributed Self-Supervised Federated Intrusion Detection Algorithm with Online Learning for Health Internet of Things and Internet of Vehicles  </style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Internet of Things</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">28</style></VOLUME><SECTION><style face="normal" font="default" size="100%">101340</style></SECTION><DATE><style face="normal" font="default" size="100%">12/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Networked health systems are often the victims of cyberattacks with serious consequences for patients and healthcare costs, with the Internet of Things (IoT) being an additional prime target. In future systems we can imagine that the Internet of Vehicles (IoV) will also be used for conveying patients for diagnosis and treatment in an integrated manner. Thus the medical field poses very significant and specific challenges since even for a single patient, several providers may carry out tests or offer healthcare services, and may have distinct interconnected sub-contractors for services such as ambulances and connected cars, connected devices or temporary staff providers, that have distinct confidentiality requirements on top of possible commercial competition. On the other hand, these distinct entities can be subject to similar or coordinated attacks, and could benefit from each others’ cybersecurity experience to better detect and mitigate cyberattacks. Thus the present work proposes a novel Distributed Self-Supervised Federated Intrusion Detection Algorithm (DISFIDA), with Online Self-Supervised Federated Learning, that uses Dense Random Neural Networks (DRNN). In DISFIDA learning data is private, and neuronal weights are shared among Federated partners. Each partner in DISFIDA combines its synaptic weights with those it receives other partners, with a preference for those weights that have closer numerical values to its own weights which it has learned on its own. DISFIDA is tested with three open-access datasets against five benchmark methods, for two relevant IoT healthcare applications: networks of devices (e.g., body sensors), and Connected Smart Vehicles (e.g., ambulances that transport patients). These tests show that the DISFIDA approach offers 100% True Positive Rate for attacks (one percentage point better than comparable state of the art methods which attain 99%) so that it does better at detecting attacks, with 99% True Negative Rate similar to state-of-the-art Federated Learning, for Distributed Denial of Service (DDoS) attacks.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">DISFIDA: Distributed Self-Supervised Federated Intrusion Detection Algorithm with Online Learning for Health Internet of Things and Internet of Vehicles  </style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mohammed Nasereddin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Deep Learning Intrusion Detection and Mitigation of DoS Attacks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">32nd International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS24)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Krakow, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Internet of Things (IoT) networks are highly vulnerable to common network DoS and DDoS attacks, which flood limited system resources or IoT devices, overwhelming them with large numbers of attack packets. In order to mitigate such attacks, this paper develops a lightweight yet effective Intrusion Detection and Prevention System (IDPS), that sequentially detects and mitigates the attack via a Deep Random Neural Network (DRNN) and a Drop-Idle-Repeat process. The IDPS is evaluated for UDP Floods, attacks on an experimental test-bed. The results show that UDP Flood attacks can be mitigated with the proposed IDPS, allowing the system to continue routine operations, and resume communications when the attack ends.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/10786560</style></URL><title><style face="normal" font="default" size="100%">Deep Learning Intrusion Detection and Mitigation of DoS Attacks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Guoliang Zhou</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yijia Liu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zheng Yan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Is ChatGPT Trustworthy Enough? A Review</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Consumer Electronics Magazine </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;ChatGPT, as an advanced model that seamlessly integrates into diverse digital interactions,&lt;br /&gt;&#13;
shows great potential to enhance the performance of consumer technology and reshape its&lt;br /&gt;&#13;
landscape. The critical question of its trustworthiness and associated challenges becomes&lt;br /&gt;&#13;
increasingly prominent. However, the literature still lacks a thorough review to study its trust. This&lt;br /&gt;&#13;
comprehensive review explores whether ChatGPT is trustworthy enough by navigating the&lt;br /&gt;&#13;
multifaceted realm of large language models, placing a significant focus on its exemplar model,&lt;br /&gt;&#13;
ChatGPT. Our exploration traverses the complex interplay of factors impacting user trust, including&lt;br /&gt;&#13;
trust in ChatGPT itself and trust in its utilization and dissemination. By delving into insightful&lt;br /&gt;&#13;
perspectives on the ChatGPT trustworthiness regarding a set of evaluation criteria including&lt;br /&gt;&#13;
fundamental properties, subjective properties, security and privacy, we find that ChatGPT is far from&lt;br /&gt;&#13;
trustworthy based on related literature review. This paper sheds light on the weakness of ChatGPT&lt;br /&gt;&#13;
trust and provides the trajectory of future development in the realm of large language models&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.researchgate.net/publication/385065063_Is_ChatGPT_Trustworthy_Enough_A_Review#fullTextFileContent</style></URL><title><style face="normal" font="default" size="100%">Is ChatGPT Trustworthy Enough? A Review</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jacob Bergquist</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Karl Sigman</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">On an Adaptive-Quasi-Deterministic Transmission Policy Queueing Model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">32nd IEEE MASCOTS'24 Conference on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, October 21-23, 2024, Krakow Poland</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEEXplore</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We analyze, further and deeper, a recently proposed&lt;br /&gt;&#13;
technique for addressing the Massive Access Problem (MAP), an&lt;br /&gt;&#13;
issue in telecommunications which arises when too many devices&lt;br /&gt;&#13;
transmit packets to a gateway in quick succession. This technique,&lt;br /&gt;&#13;
the Adaptive-Quasi-Deterministic Transmission Policy (AQDTP)&lt;br /&gt;&#13;
is a special case of “traffic shaping” which involves delaying&lt;br /&gt;&#13;
some packets at the points of origin to alleviate congestion at&lt;br /&gt;&#13;
the routers. One nice feature of AQDTP is that it loses no&lt;br /&gt;&#13;
packets and allows an infinite buffer. In this work, to clarify&lt;br /&gt;&#13;
the approach in a general queueing theory framework, and to&lt;br /&gt;&#13;
move beyond the original telecommunications application, we&lt;br /&gt;&#13;
frame these potential delays as time spent at a caf´e by customers&lt;br /&gt;&#13;
before proceeding to a service facility. We first present some&lt;br /&gt;&#13;
sample-path results that significantly refine and expand upon&lt;br /&gt;&#13;
what was shown in previous work, and then present further&lt;br /&gt;&#13;
results under a general stationary ergodic stochastic framework.&lt;br /&gt;&#13;
In the sample-path realm, we give conditions that ensure AQDTP&lt;br /&gt;&#13;
will not change the total delay and sojourn time of any customer&lt;br /&gt;&#13;
as compared to what that customer would have experienced if&lt;br /&gt;&#13;
there was no caf´e; but we also prove that AQDTP can never&lt;br /&gt;&#13;
reduce the total delay. The difference is that, under AQDTP, some&lt;br /&gt;&#13;
of that delay is spent at the caf´e instead of in the queue/line at the&lt;br /&gt;&#13;
service facility. In a stochastic framework, our focus is on stability&lt;br /&gt;&#13;
and constructing proper stationary versions of the model. Under&lt;br /&gt;&#13;
i.i.d. assumptions we dig deeper by proving Harris recurrence&lt;br /&gt;&#13;
of an underlying two-dimensional Markov process, and explicitly&lt;br /&gt;&#13;
find positive recurrent regeneration points.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.researchgate.net/publication/384288968_On_an_Adaptive-Quasi-Deterministic_Transmission_Policy_Queueing_Model#fullTextFileContent</style></URL><title><style face="normal" font="default" size="100%">On an Adaptive-Quasi-Deterministic Transmission Policy Queueing Model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Yuting Ma</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">K Liu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Impact of IoT system imperfections and passenger errors on cruise ship evacuation delay</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><DATE><style face="normal" font="default" size="100%">03/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Cruise ships and other naval vessels include automated Internet of Things (IoT)-based evacuation systems for the passengers and crew to assist them in case of emergencies and accidents. The technical challenges of assisting passengers and crew to safety during emergencies include various aspects such as sensor failures, imperfections in the sound or display systems that are used to direct evacuees, the timely selection of optimum evacuation routes for the evacuees, as well as computation and communication delays that may occur in the IoT infrastructure due to intense activities during an emergency. In addition, during an emergency, the evacuees may be confused or in a panic, and may make mistakes in following the directions offered by the evacuation system. Therefore, the purpose of this work is to analyze the effect of two important aspects that can have an adverse effect on the passengers’ evacuation time, namely (a) the computer processing and communication delays, and (b) the errors that may be made by the evacuees in following instructions. The approach we take uses simulation with a representative existing cruise ship model, which dynamically computes the best exit paths for each passenger, with a deadline-driven Adaptive Navigation Strategy (ANS). Our simulation results reveal that delays in the evacuees’ reception of instructions can significantly increase the total time needed for passenger evacuation. In contrast, we observe that passenger behavior errors also affect the evacuation duration, but with less effect on the total time needed to evacuate passengers. These findings demonstrate the importance of the design of passenger evacuation systems in a way that takes into account all realistic features of the ship’s indoor evacuation environment, including the importance of having high-performance data processing and communication systems that will not result in congestion and communication delays.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%"> https://doi.org/10.3390/s24061850</style></URL><title><style face="normal" font="default" size="100%">Impact of IoT system imperfections and passenger errors on cruise ship evacuation delay</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Yuting Ma</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kezhong Liu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">IoT Performance for Maritime Passenger Evacuation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2024 IEEE 10th World Forum on Internet of Things (WF-IoT)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Ottawa, ON, Canada</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">11/2024</style></DATE><title><style face="normal" font="default" size="100%">IoT Performance for Maritime Passenger Evacuation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Minqiang Yang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Edith Ngai</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Xiping Hu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bin Hu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jiangchuan Liu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Victor Leung</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Digital Phenotyping and Feature Extraction on Smartphone Data for Depression Detection</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of the IEEE</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">112</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">12</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1773-1798</style></SECTION><DATE><style face="normal" font="default" size="100%">12/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Smartphones are widely used as portable data collectors for wearable and healthcare sensors that can passively collect data streams related to the environment, health status, and behaviors. Recent research shows that the collected data can be used to monitor not only the physical states but also the mental health of individuals. However, extracting the features of digital phenotypes that characterize major depressive disorder (MDD) is technically challenging and may raise significant privacy concerns. Addressing such challenges has become the focus of many researchers. This article provides a comprehensive analysis of several key issues related to ubiquitous sensing to aid in detecting MDD. Specifically, this article analyzes existing methodologies and feature extraction algorithms used to detect possible MDD through digital phenotyping from smartphone data. In particular, five types of features are summarized and explained, namely, location, movement, rhythm, sleep, and social and device usage. Finally, related limitations and challenges are discussed to provide paths for further research and engineering.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Digital Phenotyping and Feature Extraction on Smartphone Data for Depression Detection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Minimizing delay and power consumption at the edge</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">25</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">2</style></ISSUE><SECTION><style face="normal" font="default" size="100%">502</style></SECTION><DATE><style face="normal" font="default" size="100%">02/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Edge computing systems must offer low latency at low cost and low power consumption for sensors and other applications, including the IoT, smart vehicles, smart homes, and 6G. Thus, substantial research has been conducted to identify optimum task allocation schemes in this context using non-linear optimization, machine learning, and market-based algorithms. Prior work has mainly focused on two methodologies: (i) formulating non-linear optimizations that lead to NP-hard problems, which are processed via heuristics, and (ii) using AI-based formulations, such as reinforcement learning, that are then tested with simulations. These prior approaches have two shortcomings: (a) there is no guarantee that optimum solutions are achieved, and (b) they do not provide an explicit formula for the fraction of tasks that are allocated to the different servers to achieve a specified optimum. This paper offers a radically different and mathematically based principled method that explicitly computes the optimum fraction of jobs that should be allocated to the different servers to (1) minimize the average latency (delay) of the jobs that are allocated to the edge servers and (2) minimize the average energy consumption of these jobs at the set of edge servers. These results are obtained with a mathematical model of a multiple-server edge system that is managed by a task distribution platform, whose equations are derived and solved using methods from stochastic processes. This approach has low computational cost and provides simple linear complexity formulas to compute the fraction of tasks that should be assigned to the different servers to achieve minimum latency and minimum energy consumption.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/1424-8220/25/2/502</style></URL><title><style face="normal" font="default" size="100%">Minimizing delay and power consumption at the edge</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Miltiadis Siavvas</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">System Wide Vulnerability and Trust in Multi-Component Communication System Software</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Network </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">39</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">2</style></ISSUE><SECTION><style face="normal" font="default" size="100%">108-114</style></SECTION><DATE><style face="normal" font="default" size="100%">09/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In the software rich environment of 6G,&#160;systems will be surrounded by edge devices that support distributed software&#160;systems which are critical to&#160;operations. Such systems may also be subject to frequent&#160;updates or uploads of individual software components.&#160;Trust in such systems will therefore depend on our ability&#160;to rapidly ensure that such software is not vulnerable to&#160;cyberattacks or malicious compromises. Thus this paper&#160;presents a novel System-Wide Vulnerability Assessment&#160;(SWVA) framework based on Machine Learning, that&#160;can be frequently activated to assess the vulnerability of&#160;interconnected software components over edge systems.&#160;The performance of the SWVA framework is illustrated&#160;by assessing the vulnerability of 13 versions of a real world 11 component software system, and comparingthe ARNN results against the well-known ML models&#160;MLP, KNN, and Lasso. The results show the superior&#160;performance of SWVA, offering over 85% median accuracy&#160;and good scalability as the number of connected software&#160;components increases.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://drive.google.com/file/d/1123-TES0XmyG8_l1XlmAfdWV5Jf6QPeo/view </style></URL><title><style face="normal" font="default" size="100%">System Wide Vulnerability and Trust in Multi-Component Communication System Software</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mohammed Nasereddin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Adaptive attack mitigation for IoV Flood Attacks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE  Internet of Things Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">12</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5</style></ISSUE><SECTION><style face="normal" font="default" size="100%">4701-4714</style></SECTION><DATE><style face="normal" font="default" size="100%">03/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Gateway Servers for the Internet of Vehicles (IoV)&#160;must meet stringent Security and Quality of Service (QoS)&#160;requirements, including cyberattack protection, low delays and&#160;minimal packet loss, to offer secure real-time data exchange for&#160;human and vehicle safety and efficient road traffic management.&#160;Therefore, it is vital to protect these systems from cyberattacks&#160;with adequate Attack Detection (AD) and Mitigation mechanisms. Such attacks often include packet Floods that impair&#160;the QoS of the networks and Gateways and even impede the&#160;Gateways’ capability to carry out AD. Thus, this paper first&#160;evaluates these effects using system measurements during Flood&#160;attacks. It then demonstrates how a Smart Quasi-Deterministic&#160;Policy Forwarder (SQF) at the entrance of the Gateway can&#160;regulate the incoming traffic to ensure that the Gateway supports&lt;br /&gt;&#13;
the AD to operate promptly during an attack. Since Flood attacks&#160;create substantial packet backlogs, we propose a novel Adaptive&#160;Attack Mitigation (AAM) system that is activated after an attack&#160;is detected to dynamically sample the incoming packet stream,&#160;determine whether the attack is continuing, and also drop batches&#160;of packets at the input to reduce the effects of the attack. The&#160;AAM is designed to minimize a cost function that includes the&#160;sampling overhead and the cost of lost benign packets. We show&#160;experimentally that the Optimum AAM approach is effective&#160;in mitigating attacks and present theoretical and experimental&#160;results that validate the proposed approach.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%"> https://drive.google.com/file/d/1UPsgRyMDKUv4sT6oiOQQXxDgQ8bFTXQM/view</style></URL><title><style face="normal" font="default" size="100%">Adaptive attack mitigation for IoV Flood Attacks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zhaozheng Li</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jiahe Lan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zheng Yan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Backdoor attacks and defense mechanisms in federated learning: A survey</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Information Fusion </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">123</style></VOLUME><ISSUE><style face="normal" font="default" size="100%"> 103248 </style></ISSUE><DATE><style face="normal" font="default" size="100%">05/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Federated Learning (FL) is a distributed machine learning framework that enables the collaborative training of machine learning models by multiple entities. However, FL is vulnerable to various potential risks, especially backdoor attacks. A backdoor attack aims to implant hidden backdoors into a global model by compromising one or more clients and making them provide poisoned model updates. Consequently, the global model misclassifies inputs with triggers as adversary-desired classes/labels while performing well on benign inputs. Despite its severity, existing literature lacks a comprehensive review on backdoor attacks and their defense mechanisms of FL, especially for vertical FL. This paper comprehensively reviews and evaluates recent advances in backdoor attacks and defense mechanisms on FL. We first introduce foundational concepts about FL, backdoor attacks, and defense mechanisms, along with their respective security models. Then, we propose two sets of evaluation criteria that a sound backdoor attack and a defense mechanism should meet, respectively. After that, we provide taxonomies of existing backdoor attacks and defense mechanisms of FL and review them by employing the proposed criteria to evaluate their pros and cons. We also explore a positive application of backdoors in FL, i.e., backdoor-based watermarking. Finally, we discuss a number of open issues and suggest promising future research directions.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S1566253525003215</style></URL><title><style face="normal" font="default" size="100%">Backdoor attacks and defense mechanisms in federated learning: A survey</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tingxi Luo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jie Wang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zheng Yan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Graph Neural Networks for Trust Evaluation: Criteria, State-of-the-Art, and Future Directions</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Network (Early Access), IEEEXplore</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">03/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The process of quantifying trust considers the factors that affect it, which can be applied to identify malicious behavior, reduce uncertainty, and facilitate decision-making. Traditional trust evaluation methods based on statistics and reasoning, rely heavily on domain knowledge, which limits their practical applications. Graph Neural Networks (GNNs) are a new Machine Learning (ML) paradigm that can revolutionize the evaluation of trust, by modeling relationships as graphs to simplify relevant data and automating end-to-end evaluation. Thus, a variety of GNN-based trust evaluation models have been developed for different applications. However, there is still a gap in the literature regarding a review on these advances with discussion about remaining challenges. To bridge this gap, we conduct the first review on GNN-based trust evaluation. We first propose a set of criteria in terms of trust-related attributes, correctness, functionality, and overhead. Then, we propose a taxonomy of existing GNN-based trust evaluation models, followed by a review using the proposed criteria to analyze their pros and cons. A quantitative analysis of the recent cutting-edge models is also provided. Based on the review and experimental results, we identify key challenges and suggest future research directions.&#160;&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/10925363 </style></URL><title><style face="normal" font="default" size="100%">Graph Neural Networks for Trust Evaluation: Criteria, State-of-the-Art, and Future Directions</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zitong Zhang</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Haoxiang Han</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zheng Yan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Survey on Cross-Shard Transaction Allocation Optimization and Processing Mechanisms</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Communications Surveys and Tutorials</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Sharding is one of the most effective technologies for improving blockchain scalability by dividing a blockchain network into multiple shards that process transactions in parallel. However, many existing sharded blockchain systems can include a large number of cross-shard transactions, resulting in high communication overhead and processing latency. Two solutions have emerged to address these issues. One of them focuses on optimizing the allocation of transactions to reduce the cross-shard communication while ensuring workload balance. The other emphasizes the design of an efficient cross-shard transaction processing mechanism to reduce the latency caused by confirming cross-shard transactions. However, the literature still lacks a comprehensive review on the advances of Cross-shard Transaction Allocation Optimization and Processing (CTAOP) mechanisms, which would be a valuable addition to the literature. This paper is a comprehensive survey of existing CTAOP mechanisms, and first introduces cross-shard transactions and related concepts. Then, we propose two sets of criteria for evaluating the two types of CTAOP mechanisms, and provide a taxonomy of CTAOP mechanisms, followed by a thorough review based on our proposed criteria. A list of open issues is also highlighted, and corresponding future research directions are suggested to advance our understanding of CTAOP mechanisms.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Survey on Cross-Shard Transaction Allocation Optimization and Processing Mechanisms</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mohammed Nasereddin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Parameter Sensitivity of AADRNN-Based Attack Detection</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">31st Symposium on Computers and Communications (IEEE ISCC 2026)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Vilamoura, Algarve, Portugal</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The growing prevalence of cyberattacks against network-connected systems increases the need for accurate intrusion and attack detection (AD) systems that can react rapidly at the network access ports. Machine learning has often been used for AD because of the high accuracy it can offer, and its fast testing speed for real-time attack detection. On the other hand, the data sampling methods used to transform incoming traffic streams into data for real-time testing by AD systems can have an important effect on the detection accuracy, and are seldom discussed in the literature. Here, we address this often neglected aspect, with the Auto-Associative Dense Random Neural Network (AADRNN), a state-of-the-art AD system. After briefly reviewing the literature and comparing the AADRNN attack detector with other state-of-the-art approaches, this paper focuses on choosing the values of the data sampling parameters and the decision threshold to obtain the best accuracy from this AD method. Experiments regarding Botnet attack detection using the Mirai dataset, as well as synthetic flood attacks conducted on an experimental IoT test-bed are used to illustrate the results, and to guide the parameter choices that maximize the AADRNN’s True Positive Rate and minimize its False Positive Rate.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieee-iscc.computer.org/2026/</style></URL><title><style face="normal" font="default" size="100%">Parameter Sensitivity of AADRNN-Based Attack Detection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Q. Ren</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Z. Yan</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Probabilistic Dynamic Network Trust Model for IoT Systems with Lost Messages and Cyberattacks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><SECONDARY_TITLE><style face="normal" font="default" size="100%">33rd International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Paris, France</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Paris</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;trust model, the Random Neural Network Trust Model (RNNTM),&#160;which incorporates the dynamics of trust formation in&#160;a network through a sequence of “votes” from each entity&#160;regarding all other entities. The model assures fairness among&#160;entities through a fixed replenishment rate of “voting rights”&#160;for each entity, whose voting rights are reduced each time the&#160;entity votes. A positive vote received by an entity increases&lt;br /&gt;&#13;
its voting rights and its trustworthiness, while a negative vote&#160;reduces its voting rights and also its trustworthiness, and a&#160;non-negative integer represents each entity’s instantaneous “trust&#160;value”. An important property of the RNNTM is that an entity&lt;br /&gt;&#13;
cannot express its trust or distrust of the other entities, and&#160;hence affect their trust values, when its trust level is down to&#160;zero, so that untrustworthy entities are not allowed to express&#160;trust or distrust. After developing the theoretical characteristics&lt;br /&gt;&#13;
for the RNNTM model, this paper details its use to evaluate&#160;the trust value of multiple entities in a network of Internet of&#160;Things (IoT) devices and gateways, where&#160;cyberattacks against&#160;the gateways, and messages that should be received from IoT&#160;devices at regular intervals, modify the parameters that express&#160;the trust or distrust between entities. To illustrate its use for&#160;a network of interaction gateways, servers and user equipment,&#160;several detailed time-dependent simulations of the RNNTM are&#160;conducted in the presence of cyberattacks.&#160;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Probabilistic Dynamic Network Trust Model for IoT Systems with Lost Messages and Cyberattacks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Omer Abdelrahman</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Signalling Storms and Taylor’s Law</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><SECONDARY_TITLE><style face="normal" font="default" size="100%">33rd International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Paris, France</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Paris</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Signalling storms have occurred in several generations&lt;br /&gt;&#13;
of mobile networks due to malevolent end users, as well as&lt;br /&gt;&#13;
a consequence of service disruptions and system failures. Due to&lt;br /&gt;&#13;
the massive increase in the volume of traffic and the diversity of&lt;br /&gt;&#13;
end users and applications in 6G, including the massive access of&lt;br /&gt;&#13;
the Internet of Things, signalling storms and other cyberattacks&lt;br /&gt;&#13;
will require attention with research on adequate detection and&lt;br /&gt;&#13;
mitigation schemes, as we move towards the next generation of&lt;br /&gt;&#13;
mobile networks. Thus, in the present paper, we conduct discrete&lt;br /&gt;&#13;
event simulations of a signalling storm, measure its effects in a&lt;br /&gt;&#13;
simulated environment, and observe that it results in deviations&lt;br /&gt;&#13;
from the well-known and naturally observed statistical property&lt;br /&gt;&#13;
known as “Taylor’s Law”. We then discuss a mathematical model&lt;br /&gt;&#13;
of storms, linking the fraction of malevolent or malfunctioning&lt;br /&gt;&#13;
users to the rate of call establishment requests, and show that&lt;br /&gt;&#13;
the mathematical model also exhibits a violation of Taylor’s&lt;br /&gt;&#13;
Law. Since the detection of cyberattacks from network behaviour&lt;br /&gt;&#13;
parameters is a challenging problem, we suggest that the violation&lt;br /&gt;&#13;
of Taylor’s Law may be a useful tool for designing detectors for&lt;br /&gt;&#13;
signalling attacks, or other network attacks or malfunctions.&lt;br /&gt;&#13;
Index Terms—Attack Detection and Mitigation, 6G, Signalling&lt;br /&gt;&#13;
Attacks, Taylor’s Law&lt;br /&gt;&#13;
&#160;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Signalling Storms and Taylor’s Law</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mohammed Nasereddin</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Data Driven Optimum Cyberattack Mitigation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE DSAA'25: Data Science and Advanced Analytics Conference, Birmingham, UK</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Gateways to the Internet of Things (IoT) are typically servers that communicate with IoT devices, providing them with low-latency services, and connecting them to the internet and other backbone networks. Since IoT devices are often simple and have limited storage and computational capabilities, gateways can be equipped with Attack Detection (AD) software to analyze incoming traffic, detect potential cyberattacks, and protect both the gateway and connected devices from threats that could overwhelm the system as a whole. This paper presents an enhanced gateway system that combines a traffic shaping technique with an attack detection module and an optimum attack mitigation scheme aimed at protecting the gateway and the overall system from cyberattacks. The optimum mitigation approach selects a sampling interval for the AD, that minimizes the total overhead of AD and mitigation. The proposed approach is implemented in a practical test-bed, so that the performance of the mitigation scheme may be evaluated in the presence of flood attacks. The experiments show its practical value and illustrate the agreement obtained between the analysis and the measurements obtained from several experiments.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Data Driven Optimum Cyberattack Mitigation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jacob Bergquist</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mohammed Nasereddin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Karl Sigman</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Mitigating massive access with Quasi-Deterministic Transmission: Experiments and stationary analysis</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Performance Evaluation </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">170</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">102512</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1 - 12</style></SECTION><DATE><style face="normal" font="default" size="100%">11/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Massive Access Problem arises due to devices that forward packets simultaneously to servers in rapid succession, or by malevolent software in devices that flood network nodes with high-intensity traffic. To protect servers from such events, attack detection (AD) software is installed on servers, and the Quasi-Deterministic Transmission Policy (QDTP) has been proposed to “shape traffic” and protect servers, allowing attack detection to proceed in a timely fashion by delaying some of the incoming packets individually based on their arrival times. QDTP does not cause packet loss, and can be designed so that it does not increase end-to-end packet delay. Starting with measurements taken on an experimental test-bed where the QDPT algorithm is installed on a dedicated processor, which precedes the server itself, we show that QDPT protects the server from attacks by accumulating arriving packets at the input of the QDTP processor, then forwarding them at regular intervals to the server. We compare the behaviour of the server, with and without the use of QDTP, showing the improvement it achieves, provided that its “delay” parameter is correctly selected. We analyze the sample paths associated with QDTP and prove that when its delay parameter is chosen in a specific manner, the end-to-end delay of each packet remains unchanged as compared to an ordinary First-In-First-Out system. An approach based on stationary ergodic processes is developed for the stability conditions. Assuming mutually independent and identically distributed inter-arrival times, service times and QDTP delays, we exhibit the positive recurrent structure of a two-dimensional Markov process and its regeneration points.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Mitigating massive access with Quasi-Deterministic Transmission: Experiments and stationary analysis</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An Associated Random Neural Network Detects Intrusions and Estimates Attack Graphs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">32nd International Conference on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Krakow, Poland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">12/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Cyberattacks, especially Botnet Distributed Denial of Service (DDoS), increasingly target networked systems, compromise interconnected nodes by constantly spreading malware. In order to prevent these attacks in their early stages, which includes stopping the spread of malware, it is vital to identify compromised nodes and successfully predict potential attack paths. To this end, this paper proposes a novel system based on an Associated Random Neural Network (ARNN) that simultaneously detects intrusion at the network-level and estimates the network attack graph. In this system, ARNN is trained online to minimize problem-specific multi-task loss so that it identifies compromised network nodes, while the neural network connection weights also estimate the attack path. The performance of the method is calculated using the Kitsune attack dataset, showing that the method achieves a recall rate above 0.95 in estimating the network attack graph, and provides a near-perfect classification of compromised nodes. The ARNN-based system for dynamic and continuous estimation of compromised nodes and network attack graphs, can pave the way for enhancing security measures, and stopping Botnet DDoS attacks from spreading in networked systems.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">An Associated Random Neural Network Detects Intrusions and Estimates Attack Graphs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Baran Gül</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Federated Intrusion Detection for Smart Vehicles</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE International Conference on Intelligent Transportation Systems (ITSC)</style></SECONDARY_TITLE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Cybersecurity threats endanger networked systems consisting of multiple nodes, such as the Internet of Things (IoT), Supply Chains and Smart Cars, due to the emergence of new types of unknown (zero-day) attacks against vulnerable IoT devices. While earlier research has shown that Machine Learning (ML)-based Intrusion Detection Systems (IDSs) enhance security, the efficacy and practicality of ML-based IDSs often require large training datasets based on private data. This challenge becomes more pronounced in the case of a distributed system, where each node must ensure the confidentiality of local data, yet faces attacks that are similar to those faced by other nodes in the system. Thus, this paper proposes a novel Decentralized Asynchronous IDS with Online Self-Supervised Federated Learning called the iDAF system, that improves overall security by providing collaborative confidentiality-preserving learning among all nodes. iDAF enables self-supervised learning without human intervention or large labelled data, and avoids time-consuming local training sessions. iDAF’s performance is evaluated for DoS and DDoS attacks in two different scenarios of Collaborating IoT Networks and Connected Smart Cars using three online datasets, and compared with five benchmark methods. The results show high intrusion detection accuracy with an acceptable computation time and low communication overhead.&lt;/p&gt;</style></ABSTRACT><title><style face="normal" font="default" size="100%">Federated Intrusion Detection for Smart Vehicles</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mohammed Nasereddin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erol Gelenbe</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Deployment-Aware Parameter Optimization for IoT Attack Detection</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2026 IEEE International Conference on Smart Computing Workshops and Other Affiliated events (SmartComp Companion)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Messina, Sicily, Italy</style></PLACE_PUBLISHED><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Smart IoT environments require attack detection (AD) mechanisms that operate reliably under real-time and resource-constrained deployment conditions. Although machine learning models can achieve high detection accuracy, their practical performance is strongly influenced by internal configuration parameters, including the way traffic metrics are derived from streaming packets and the selection of the decision threshold. This paper presents a deployment-aware parameter optimization study for IoT attack detection based on the Auto- Associative Dense Random Neural Network (AADRNN). Rather than focusing solely on peak detection accuracy, we examine how the extraction of traffic metrics from successive packets and the choice of the decision threshold influence detection behavior under realistic operating conditions. Experiments conducted on a physical IoT test-bed with controlled flooding attacks and on the Mirai Botnet dataset identify stable operating regions that maintain high detection rates while limiting false alarms, and reveal parameter ranges that lead to performance degradation. The results provide practical configuration guidelines for lightweight IoT attack detection deployed at network access points.&lt;/p&gt;</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/11627605</style></URL><title><style face="normal" font="default" size="100%">Deployment-Aware Parameter Optimization for IoT Attack Detection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">On different ways to classify Internet traffic: a short review of selected publications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">25</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">119–136</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Traffic classification is an important tool for network management. It reveals the source of observed network traffic and has many potential applications in Quality of Service, network security, traffic visualization, and more. In the last decade, traffic classification evolved quickly due to the raise of peer-to-peer traffic. Nowadays, researchers still find new methods in order to withstand the rapid changes in the Internet. In this paper, we review 13 papers on traffic classification and related topics that were published during 2009-2012. We show diversity in recent algorithms and we highlight possible directions for the future research on traffic classification: relevance of multi-level classification, importance of experimental validation, and the need for common traffic datasets.</style></ABSTRACT><title><style face="normal" font="default" size="100%">On different ways to classify Internet traffic: a short review of selected publications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Tracedump: A Novel Single Application IP Packet Sniffer</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><ABSTRACT><style face="normal" font="default" size="100%">The article introduces a novel Internet diagnosis utility - an open source IP packet sniffer which captures TCP and UDP packets sent and received by a single Linux process only. Preliminary evaluation results are presented. The utility can be applied in the field of IP traffic classification.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Tracedump: A Novel Single Application IP Packet Sniffer</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>2</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Statistical, real-time classification of IP traffic in Linux operating system</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Politechnika Śląska</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">The thesis introduces a practical system for statistical classification of IP traffic. Two novel algorithms are applied and extended. They are based on feature vector classification using SVM. A software library written in C language is presented. Resultant system can monitor network interfaces in realtime and read off-line packet trace files. Simultaneous classification, system training, and performance evaluation is possible. The system yields very good results, in terms of quality and packet processing speed, achieving %TP&gt;97 and %FP=0 on average.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Statistical, real-time classification of IP traffic in Linux operating system</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">C. Callegari</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Pagano</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%">Waterfall traffic identification: optimizing classification cascades</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">1–10</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The Internet transports data generated by programs whch cause various phenomena in IP flows. By means of machine learning techniques, we can automatically discern between flows generated by different traffic sources and gain a more informed view of the Internet. In this paper, we optimize Waterfall, a promising architecture for cascade traffic classification. We present a new heuristic approach to optimal design of cascade classifiers. On the example of Waterfall, we show how to determine the order of modules in a cascade so that the classification speed in maximized, while keeping the number of errors and unlabeled flows at minimum. We validate our method experimentally on 4 real traffic datasets, showing significant improvements over random cascades.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">22nd International Conference, CN 2015 Brunów, Poland, June 16-19, 2015</style></NOTES><title><style face="normal" font="default" size="100%">Waterfall traffic identification: optimizing classification cascades</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">C. Callegari</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Pagano</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">DNS-Class: Immediate classification of IP flows using DNS</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Network Management</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">Nowadays we see a tremendous growth of the Internet, especially in terms of the amount of data being transmitted and new network protocols being introduced. This poses a challenge for network administrators, who need adequate tools for network management. Recent findings show that DNS can contribute valuable information on IP flows and improve traffic visibility in a computer network. In this paper, we apply these findings on DNS to propose a novel traffic classification algorithm with interesting features. We experimentally show that the information carried in domain names and port numbers is sufficient for immediate classification of a highly significant portion of the traffic. We present DNS-Class: an innovative, fast, and reliable flow-based traffic classification algorithm, which on average yields 99.8% of True Positives and</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.iitis.pl/ pjf/pub/2014-dnsclass-preprint.pdf</style></URL><title><style face="normal" font="default" size="100%">DNS-Class: Immediate classification of IP flows using DNS</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">C. Callegari</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Pagano</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Waterfall: Rapid identification of IP flows using cascade classification</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">In the last years network traffic classification has attracted much research effort, given that it represents the foundation of many Internet functionalities such as Quality of Service (QoS) enforcement, monitoring, and security. Nonetheless, the proposed works are not able to satisfactorily solve the problem, usually being suitable for only addressing a given portion of the whole network traffic and thus none of them can be considered an ultimate solution for network classification. In this paper, we address network traffic classification by proposing a new architecture-named Waterfall architecture-that, by combining several classification algorithms together according to a cascade principle, is able to correctly classify the whole mixture of network traffic.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Waterfall: Rapid identification of IP flows using cascade classification</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Gorawski</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%">Source Model of TCP Traffic in LTE Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Information Sciences and Systems 2014</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">We propose a generator that represents traffic transmitted in wireless mobile networks. It is based on the measurements of traffic in large scale LTE networks. The proposed tool generates TCP flow sizes and duration. We verify the proposed generator by comparison with traces available in the literature and propose application in discrete event simulators.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Source Model of TCP Traffic in LTE Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Gorawski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konrad Połys</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy-Efficient Crowdsensing of Human Mobility and Signal Levels in Cellular Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">15</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">9</style></NUMBER><DATE><style face="normal" font="default" size="100%">9</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The paper presents a practical application of the crowdsensing idea to measure human mobility and signal coverage in cellular networks. Currently, virtually everyone is carrying a mobile phone, which may be used as a sensor to gather research data by measuring, e.g., human mobility and radio signal levels. However, many users are unwilling to participate in crowdsensing experiments. This work begins with the analysis of the barriers for engaging people in crowdsensing. A survey showed that people who agree to participate in crowdsensing expect a minimum impact on their battery lifetime and phone usage habits. To address these requirements, this paper proposes an application for measuring the location and signal strength data based on energy-efficient GPS tracking, which allows one to perform the measurements of human mobility and radio signal levels with minimum energy utilization and without any engagement of the user. The method described combines measurements from the accelerometer with effective management of the GPS to monitor the user mobility with the decrease in battery lifetime by approximately 20%. To show the applicability of the proposed platform, the sample results of signal level distribution and coverage maps gathered for an LTE network and representing human mobility are shown.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy-Efficient Crowdsensing of Human Mobility and Signal Levels in Cellular Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</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%">LTE or WiFi? Client-Side Internet link selection for smartphones.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Springer International Publishing Switzerland</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">43–53</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Current mobile phones and tablets are equipped with two technologies for accessing the Internet: WiFi and Cellular. Deciding which of these two interfaces provides faster data transfer is often non-trivial, but most of the currently used devices use a simple priority scheme that prefers WiFi to Cellular. In this paper, we propose a novel system that automatically selects the best link available in the current user location. The system periodically probes the bandwidth available on both links and makes statistical predictions, while avoiding excessive data and battery usage. We experimentally validated our approach using a dedicated application for Android.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">22nd International Conference, CN 2015 Brunów, Poland, June 16-19, 2015</style></NOTES><title><style face="normal" font="default" size="100%">LTE or WiFi? Client-Side Internet link selection for smartphones.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Demo: Wireless Link Selection on Smartphone: Throughput vs Battery Drain</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">MobiCom '15 Proceedings of the 21st Annual International Conference on Mobile Computing and Networking</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ACM</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">190–192</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The method for automatic selection of wireless interface on smart phones is presented. We consider the selection between WiFi and LTE / 3G radios to maximize the throughput of the data transmission and minimize the amount of energy used to scan and measure the throughput of the network. The proposed selection algorithm defines when to measure and how to estimate the network throughput to balance between the accuracy of the selection and the battery drain caused by the measurements. The link speed estimation method optimized for LTE and WiFi networks is also demonstrated.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Demo: Wireless Link Selection on Smartphone: Throughput vs Battery Drain</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christian Callegari</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michele Pagano</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Waterfall Traffic Classification: A Quick Approach to Optimizing Cascade Classifiers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Wireless Personal Communications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PAGES><style face="normal" font="default" size="100%">1–16</style></PAGES><DATE><style face="normal" font="default" size="100%">10/2016</style></DATE><URL><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s11277-016-3751-5</style></URL><title><style face="normal" font="default" size="100%">Waterfall Traffic Classification: A Quick Approach to Optimizing Cascade Classifiers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">David Plonka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arthur Berger</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Entropy/IP: Uncovering Structure in IPv6 Addresses</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM Internet Measurement Conference 2016</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Santa Monica</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">11/2016</style></DATE><URL><style face="normal" font="default" size="100%">http://www.entropy-ip.com/</style></URL><title><style face="normal" font="default" size="100%">Entropy/IP: Uncovering Structure in IPv6 Addresses</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Oliver Gasser</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Quirin Scheitle</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Qasim Lone</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Maciej Korczynski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stephen Strowes</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Luuk Hendriks</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Georg Carle</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Clusters in the Expanse: Understanding and Unbiasing IPv6 Hitlists</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM Internet Measurement Conference 2018</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Boston, MA, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ACM</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Network measurements are an important tool in understanding the Internet. Due to the expanse of the IPv6 address space, exhaustive scans as in IPv4 are not possible for IPv6. In recent years, several studies proposed to use target lists of IPv6 addresses, called hitlists. In this paper, we show that addresses in IPv6 hitlists are heavily clustered. We present novel techniques that allow to push IPv6 hitlists from quantity to quality. We perform a longitudinal active measurement study over 6 months, targeting more than 50 M addresses. We develop a rigorous method to detect aliased prefixes, which identifies 1.5% of our prefixes as aliased, pertaining to about half of our target addresses. Using entropy clustering, we group the entire hitlist into just 6 distinct addressing schemes. Furthermore, we perform client measurements by leveraging crowdsourcing. To encourage reproducibility in network measurement research and serve as a starting point for future IPv6 studies, we publish source code, analysis tools, and data.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ipv6hitlist.github.io/</style></URL><title><style face="normal" font="default" size="100%">Clusters in the Expanse: Understanding and Unbiasing IPv6 Hitlists</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Oliver Gasser</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Giovane Moura</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">DNS Observatory: The Big Picture of the DNS</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM Internet Measurement Conference 2019</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Amsterdam</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ACM</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">10/2019</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Domain Name System (DNS) is thought of as having the simple-sounding task of resolving domains into IP addresses. With its stub resolvers, different layers of recursive resolvers, authoritative nameservers, a multitude of query types, and DNSSEC, the DNS ecosystem is actually quite complex.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;DNS Observatory provides a bird's-eye view and allows to analyze the big picture of DNS. As data source DNS Observatory leverages globally distributed DNS probes acquiring a peak of 200K DNS queries per second between recursive resolvers and authoritative nameservers. For each observed query we extract traffic features, aggregate them, and track the top k DNS objects.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;This allows us to characterize DNS deployments and evaluate the median response delays of DNS queries, where we find that the top 10% nameservers (which handle about half the traffic) have indeed a shorter response time than less popular nameservers. We also leverage DNS Observatory to show correlations between decreasing TTLs and increasing DNS traffic. Furthermore, the TTL data allows us to anticipate upcoming changes in the DNS infrastructure. Another aspect that we analyze in depth is the effect of the Happy Eyeballs algorithm in combination with low negative caching TTLs, which results in a share of up to 90% empty responses for some domains. Finally, we propose actionable measures to improve uncovered DNS issues and shortcomings and we offer interested researchers access to DNS Observatory.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">DNS Observatory: The Big Picture of the DNS</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Oliver Gasser</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Giovane Moura</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">DNS Observatory: The Big Picture of the DNS</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM Internet Measurement Conference 2019</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Amsterdam, Netherlands</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ACM</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">10/2019</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Domain Name System (DNS) is thought of as having the simple-sounding task of resolving domains into IP addresses. With its stub resolvers, different layers of recursive resolvers, authoritative nameservers, a multitude of query types, and DNSSEC, the DNS ecosystem is actually quite complex.&lt;br /&gt;&#13;
&lt;br /&gt;&#13;
DNS Observatory provides a bird's-eye view and allows to analyze the big picture of DNS. As data source DNS Observatory leverages globally distributed DNS probes acquiring a peak of 200K DNS queries per second between recursive resolvers and authoritative nameservers. For each observed query we extract traffic features, aggregate them, and track the top k DNS objects.&lt;br /&gt;&#13;
&lt;br /&gt;&#13;
This allows us to characterize DNS deployments and evaluate the median response delays of DNS queries, where we find that the top 10% nameservers (which handle about half the traffic) have indeed a shorter response time than less popular nameservers. We also leverage DNS Observatory to show correlations between decreasing TTLs and increasing DNS traffic. Furthermore, the TTL data allows us to anticipate upcoming changes in the DNS infrastructure. Another aspect that we analyze in depth is the effect of the Happy Eyeballs algorithm in combination with low negative caching TTLs, which results in a share of up to 90% empty responses for some domains. Finally, we propose actionable measures to improve uncovered DNS issues and shortcomings and we offer interested researchers access to DNS Observatory.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">DNS Observatory: The Big Picture of the DNS</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Xander Bouwman</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Victor Le Pochat</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tom Van Goethem</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Carlos Hernandez-Ganan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Giovane Moura</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Samaneh Tajalizadehkhoob</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Wouter Joosen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michel van Eeten</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Helping hands: Measuring the impact of a large threat intelligence sharing community</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">USENIX Security Symposium (USENIX Security '22 Summer)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Boston</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">USENIX</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">08/2022</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">We tracked the largest volunteer security information sharing community known to date: the COVID-19 Cyber Threat Coalition, with over 4,000 members. This enabled us to address long-standing questions on threat information sharing. First, does collaboration at scale lead to better coverage? And second, does making threat data freely available improve the ability of defenders to act? We found that the CTC mostly aggregated existing industry sources of threat information. User-submitted domains often did not make it to the CTC’s blocklist as a result of the high threshold posed by its automated quality assurance using VirusTotal. Although this ensured a low false positive rate, it also caused the focus of the blocklist to drift away from domains related to COVID-19 (1.4%-3.6%) to more generic abuse, such as phishing, for which established mitigation mechanisms already exist. However, in the slice of data that was related to COVID-19, we found promising evidence of the added value of a community like the CTC: just 25.1% of these domains were known to existing abuse detection infrastructures at time of listing, as compared to 58.4% of domains on the overall blocklist. From the unique experiment that the CTC represented, we draw three lessons for future threat data sharing initiatives.&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Helping hands: Measuring the impact of a large threat intelligence sharing community</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>15</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arthur Berger</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">David Plonka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet address structure analysis, and applications thereof</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Akamai Technologies, Inc.</style></PUBLISHER><NUMBER><style face="normal" font="default" size="100%">15618303</style></NUMBER><SECTION><style face="normal" font="default" size="100%">US10944639B2</style></SECTION><DATE><style face="normal" font="default" size="100%">03/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">An analysis system automates IP address structure discovery by deep analysis of sample IPv6 addresses using a set of computational methods, namely, information-theoretic analysis, machine learning, and statistical modeling. The system receives a sample set of IP addresses, computes entropies, discovers and mines address segments, builds a network model of address segment inter-dependencies, and provides a graphical display with various plots and tools to enable a network analyst to navigate and explore the exposed IPv6 address structure. The structural information is then applied as input to applications that include: (a) identifying homogeneous groups of client addresses, e.g., to assist in mapping clients to content in a CDN; (b) supporting network situational awareness efforts, e.g., in cyber defense; (c) selecting candidate targets for active measurements, e.g., traceroutes campaigns, vulnerability assessments, or reachability surveys; and (d) remotely assessing a network's addressing plan and address assignment policy.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Internet address structure analysis, and applications thereof</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Lars Prehn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pawel Foremski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Oliver Gasser</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Kirin: Hitting the Internet with Distributed BGP Announcements</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ACM Asia Conference on Computer and Communications Security (AsiaCCS 2024)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Singapore</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">ACM</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">07/2024</style></DATE><ISBN><style face="normal" font="default" size="100%">9798400704826</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Internet is a critical resource in the daily life of billions of users. To support the growing number of users and their increasing demands, operators continuously scale their network footprint–-e.g., by joining Internet Exchange Points (IXPs)–-and adopt relevant technologies–-such as IPv6–-which provides a vastly larger address space than its predecessor.In this paper, we revisit prefix de-aggregation attacks in the light of these two changes and introduce Kirin–-an advanced BGP prefix de-aggregation attack that announces millions of IPv6 routes via thousands of IXP connections to overflow the memory of routers within remote ASes. Kirin's highly distributed nature allows it to bypass traditional route-flooding defense mechanisms, such as per-session prefix limits or route flap damping.We analyze Kirin's theoretical feasibility by formulating it as a mathematical optimization problem, test for practical hurdles by deploying enough infrastructure to perform a micro-scale Kirin attack using 4 IXPs, and validate our assumptions via BGP data analysis, real-world measurements, and router testbed experiments. Despite its low deployment cost, we find that Kirin may inject lethal amounts of routes into the routers of thousands of ASes.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://kirin-attack.github.io/</style></URL><title><style face="normal" font="default" size="100%">Kirin: Hitting the Internet with Distributed BGP Announcements</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ernest Molua</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</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%">An Architectural Framework Proposal for IoT Driven Agriculture</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Network 2019</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Cham</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">June 2019</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-030-21951-2</style></ISBN><title><style face="normal" font="default" size="100%">An Architectural Framework Proposal for IoT Driven Agriculture</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bhavneet Soodan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rakesh Kumar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance Evaluations of a Cloud Computing Physical Machine with Task Reneging and Task Resubmission (Feedback)</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Networks 2020</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Cham</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">June 2020</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-030-50719-0</style></ISBN><title><style face="normal" font="default" size="100%">Performance Evaluations of a Cloud Computing Physical Machine with Task Reneging and Task Resubmission (Feedback)</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rakesh Kumar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bhavneet Soodan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Multi-Server Queuing Model With Balking and Correlated Reneging With Application in Health Care Management</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">8</style></VOLUME><PAGES><style face="normal" font="default" size="100%">169623–169639</style></PAGES><title><style face="normal" font="default" size="100%">A Multi-Server Queuing Model With Balking and Correlated Reneging With Application in Health Care Management</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Tokarz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gabriel Drabik</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jarosław Paduch</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Salvatore Distefano</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Riccardo Di Pietro</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Giovanni Merlino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Carlo Scaffidi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Raivo Sell</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet of Things Network Infrastructure for The Educational Purpose</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2020 IEEE Frontiers in Education Conference (FIE)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Uppsala, Sweeden</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span style="background-color:rgb(255, 255, 255); color:rgb(51, 51, 51); font-family:sans-serif; font-size:15px"&gt;In this innovative practice full paper we present the implementation of the distant laboratory for the Internet of Things teaching and training. The recent outbreak of the SARS-COV-2 virus and related COVID-19 pandemic throughout the world has caused governments across the world to shut down schools and universities, to slow down the spread of the coronavirus that is causing the disease. As a result, some universities and schools have switched from physical classrooms to virtual or online classrooms. This approach is working well for theoretical subjects and courses, but it is not straight forward in the case of laboratory subjects and courses that require access to hardware resources. The IOT-OPEN.EU remote laboratory infrastructure presented in this paper is a timely solution. In this paper, we present current advances in distant learning, distant laboratory models, and the IOT-OPEN.EU remote laboratory implemented as part of the IOT-OPEN.EU ERASMUS+ project, along with short analysis on current advances in distant learning, where students are interacting with physical hardware remote way.&lt;/span&gt;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Internet of Things Network Infrastructure for The Educational Purpose</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bhavneet Soodan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rakesh Kumar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analysis of the Performance of a Cloud Computing Processing Queue with Correlated Reneging of Tasks and Resubmission</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2021 International Conference on Electrical, Computer and Energy Technologies (ICECET)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cape Town-South Africa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Quality of Service (QoS) experienced by the packets that constitute a cloud computing task does not only depend on the performance of the cloud computing network infrastructure at the data centre but also on the performance of the access networks and the internet core networks traversed by the packets before the task is fully submitted to the cloud computing or processing servers for execution or processing. Sometimes, some of the tasks that are submitted and are waiting in queues to be processed could be removed from the queues without being processed (task reneging or dropping). Removing tasks from the queue could result from the user's impatience, missing execution deadline, security reasons, or an active queue management strategy. The reneged or dropped tasks could be resubmitted depending on the reason for which it was dropped. The resubmission of tasks decreases QoS and increases the energy consumption overhead as more energy is required to transport the resubmitted tasks through the access, core, and data centre networks. In this paper, we propose a multiserver queueing model with correlated reneging and resubmission to analyse the performance of a cloud computing server.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Analysis of the Performance of a Cloud Computing Processing Queue with Correlated Reneging of Tasks and Resubmission</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Rakesh Kumar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bhavneet Soodan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sapana Sharma</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance Analysis of a Cloud Computing System using Queuing Model with Correlated Task Reneging</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Physics: Conference Series, presented in 5th International Scientific Conference on Information, Control, and Communication Technologies (ICCT-2021) 4-7 October 2021, Astrakhan, Russian Federation</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2091 </style></VOLUME><ISSUE><style face="normal" font="default" size="100%">012003</style></ISSUE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Queuing theory has been extensively used in the modelling and performance analysis of cloud computing systems. The phenomenon of the task (or request) reneging, that is, the dropping of requests from the request queue often occur in cloud computing systems, and it is important to consider it when developing performance evaluations models for cloud computing infrastructures. Majority of studies in the performance evaluation of cloud computing data centres with the use of queuing theory do not consider the fact that the tasks could be removed from queue without being serviced. The removal of tasks from the queue could be due to the user impatience, execution deadline expiration, security reasons, or as an active queue management strategy. The reneging could be correlated in nature, that is, if a request is dropped (or reneged) at any time epoch, and then there is a probability that a request may or may not be dropped at the next time epoch. This kind of dropping (or reneging) of requests is referred to as correlated request reneging. In this paper we have modelled a cloud computing infrastructure with correlated request reneging using queuing theory. An M/M/1/N queuing model with correlated reneging has been used to study the performance analysis of the load balancing server of a cloud computing system. The steady-state as well as the transient performance analyses have been carried out. Important measures of performance like a vera ge queue size, average delay, probability of task blocking, and the probability of no waiting in the queue are studied. Finally, some comparisons are performed which describe the effect of correlated task reneging over simple exponential reneging&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance Analysis of a Cloud Computing System using Queuing Model with Correlated Task Reneging</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bhavneet Soodan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rakesh Kumar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Queueing-theoretic Analysis of the Performance of a Cloud Computing Infrastructure: Accounting for Task Reneging or Dropping</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of the 2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Maldives</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">978-1-6654-7095-7</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Cloud computing has revolutionized the information technology era. It offers high-speed computing, storage, and ICT resources on demand. One of the significant challenges in cloud computing is the impact of impatient users or request (task) reneging. When a request has been compromised, missed its execution deadline, or depends on other rejected ones, it must be removed from the queue without being processed. The reneging or removal of tasks from queues may trigger the reneging or removal of other tasks that depend of them. We refer to this reneging of requests from the load balancing or computing queues as correlated reneging. We presented the performance analysis of a network of queues that constitute a queueing model of a simplified cloud computing infrastructure. We show the relationship between the load, delay, and probability of buffer saturation (blocking probability). It is seen that at about 80% utilization, a small increase in utilization (due to a small increase in the arrival rate Δλ for a fixed service rate μ) results in a sharp increase in the delay experienced by the tasks, and on the probability of task rejection or blocking.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Queueing-theoretic Analysis of the Performance of a Cloud Computing Infrastructure: Accounting for Task Reneging or Dropping</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Tokarz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Julius Tangka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kjartan Siggursson</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Agris Nikitenko</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Karlis Berkolds</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Raivo Sell</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An IoT Course Program to Foster the Adoption of IoT Driven Food and Agriculture in Sub-Saharan Africa (SSA)</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of the 2022 International Conference on Electrical, Computer and Energy Technologies (ICECET)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Prague, Czech Republic</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">978-1-6654-7087-2</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Internet of Things (IoT) technologies, together with other technological advances such as big data analytics, Artificial Intelligence (AI), automation, and unmanned electrical vehicles (e.g., self-driving vehicles and drones), are currently being used to transform the food and agriculture industry to increase yields significantly with minimal damage to the environment. These recent advances in Information and Communication Technologies and advances in biotechnology are driving the transition into the fourth agricultural revolution or agriculture 4.0. Some research studies on the adoption of IoT in the agriculture sector in Sub-Saharan Africa concluded that some of the reasons the rate of adoption of IoT in Africa is still very low are gaps in knowledge, skills, finance, and infrastructure. The knowledge and skills gaps are partly a result of an educational curriculum that is not up to date with current advances in the food and agricultural industry. To foster IoT adoption in the food and agriculture sectors and other sectors or industries in Sub-saharan Africa, we propose an IoT course program consisting of lectures and laboratory modules. The course is accompanied by textbooks, video lectures that are freely available on Edx, and remote online laboratories with the hardware resources hosted in some European countries but accessible through the Internet. These courses can also be adapted by vocational training schools, Higher Institutes, and universities in Sub-Saharan Africa or could be used by professionals and enthusiasts to improve their skills.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">An IoT Course Program to Foster the Adoption of IoT Driven Food and Agriculture in Sub-Saharan Africa (SSA)</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sapana Sharma</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rakesh Kumar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bhavneet Soodan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pradeep Singh</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance and Cost Evaluation of an Adaptive Queuing System with Customer Reneging and Retention: Steady-state and Transient Analysis</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Services, Economics and Management</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">15</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3</style></ISSUE><SECTION><style face="normal" font="default" size="100%">pp 254-272</style></SECTION><DATE><style face="normal" font="default" size="100%">01/05/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;pre&gt;&#13;
Customers are often required to wait when they arrive at service facilities and see the servers are busy, or when they find other customers who arrived earlier waiting. The longer customers wait, the more dissatisfied they are likely to be and may leave the queue without receiving service (reneging). The objective of the service provider is to improve the quality of service in order to minimise the possibility of customer reneging since it increases cost and reduces revenue. Therefore, a trade-off between performance and cost should be considered when designing, planning and reducing the queues at service facilities. In this paper, we propose an adaptive queuing model with the retention of reneging customers. We derive the steady-state and transient-state performance parameters, and also discuss performance and cost evaluation. We demonstrate the utility of the model in the evaluation of waiting lines in the service industry using numerical examples.&lt;/pre&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Performance and Cost Evaluation of an Adaptive Queuing System with Customer Reneging and Retention: Steady-state and Transient Analysis</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Onyeka Nwobodo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Raivo Sell</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Agris Nikitenko</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Karlis Berkolds</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kenedy Tanko</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Smart Sustainable Agrivoltaics Systems: The Future of Sustainable Agricultural Technology (Agri-tech) and Green Energy</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proc. of the 2023 3rd International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME 2023)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Agricultural productivity depends primarily on energy, water, and land resources, which are increasingly becoming more scarce and expensive. Electricity generation with photovoltaic (PV) solar energy technology requires significant amounts of space, especially in densely populated countries, generating a societal debate about allocating land (that may have alternative uses) for deploying PV systems. Rather than dedicating vast amounts of agricultural land to be used as solar farms, PV systems are deployed in agricultural lands so that a given piece of land can be used for agriculture and energy generation (the so-called agrivoltaics). A framework based on systems thinking is essential for the design and operation of smart, sustainable agrivoltaics systems to meet the design goals or to satisfy the expectation of all stakeholders (farmers, energy developers, policymakers, and local community members that may be impacted). In this paper, we propose a system-based conceptual and design framework for smart, sustainable agrivoltaics. We also discuss the benefits of agrivoltaics and the challenges to their adoption.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Smart Sustainable Agrivoltaics Systems: The Future of Sustainable Agricultural Technology (Agri-tech) and Green Energy</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Onyeka Nwobodo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Kukuczka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Wereszczyński</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Cyran</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analysis of Marker and SLAM-based Tracking for Advanced Augmented Reality (AR)-based Flight Simulation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The International Conference on Computational Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Augmented reality (AR)-based flight simulation reshapes how pilots are trained, offering an immersive environment where commercial&lt;br /&gt;&#13;
and fighter pilots can be trained at low cost with minimal use of fuel and safety concerns. This study conducts a pioneering comparative analysis of marker-based tracking and SLAM technologies within the Microsoft HoloLens 2 platform, mainly focusing on their efficacy in landing manoeuvre simulations. Our investigation incorporates an experimental setup where marker-based tracking overlays interactive video tutorials onto a simulated cockpit, enhancing the realism and effectiveness of landing procedures. The experiment demonstrates that marker-based systems ensure high precision within 5 cm and 15 cm from the HoloLens 2 camera, proving indispensable for procedural training that requires exact overlay precision. Conversely, the native SLAM algorithm, while lacking the same level of precision, offers flexibility and adaptability by accurately mapping the cockpit and superimposing virtual information in dynamic, markerless conditions. The study juxtaposes these technologies, revealing a trade-off between precision and adaptability, and suggests an integrative approach to leverage their respective strengths. Our findings provide pivotal insights for developers and training institutions to optimize AR flight simulation training, contributing to advanced, immersive pilot training programs.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Analysis of Marker and SLAM-based Tracking for Advanced Augmented Reality (AR)-based Flight Simulation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Onyeka Nwobodo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Kukuczka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil Wereszczyński</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Cyran</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analysis of Marker and SLAM-based Tracking for Advanced Augmented Reality (AR)-based Flight Simulation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The International Conference on Computational Science (ICCS 2024)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Málaga, Spain</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">29/06/2024</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-031-63783-4</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Augmented reality (AR)-based flight simulation reshapes how pilots are trained, offering an immersive environment where commercial&lt;br /&gt;&#13;
and fighter pilots can be trained at low cost with minimal use of fuel and safety concerns. This study conducts a pioneering comparative analysis of marker-based tracking and SLAM technologies within the Microsoft HoloLens 2 platform, mainly focusing on their efficacy in landing manoeuvre simulations. Our investigation incorporates an experimental setup where marker-based tracking overlays interactive video tutorials onto a simulated cockpit, enhancing the realism and effectiveness of landing procedures. The experiment demonstrates that marker-based systems ensure high precision within 5 cm and 15 cm from the HoloLens 2 camera, proving indispensable for procedural training that requires exact overlay precision. Conversely, the native SLAM algorithm, while lacking the same level of precision, offers flexibility and adaptability by accurately mapping the cockpit and superimposing virtual information in dynamic, markerless conditions. The study juxtaposes these technologies, revealing a trade-off between precision and adaptability, and suggests an integrative approach to leverage their respective strengths. Our findings provide pivotal insights for developers and training institutions to optimize AR flight simulation training, contributing to advanced, immersive pilot training programs.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Analysis of Marker and SLAM-based Tracking for Advanced Augmented Reality (AR)-based Flight Simulation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Onyeka Nwobodo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Fabien Mieyeville</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet of Things Adoption in Technology Ecosystems within the Central African Region: The Case of Silicon Mountain</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Future Internet</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">16</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">10</style></ISSUE><DATE><style face="normal" font="default" size="100%">16/10/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Internet of Things (IoT) has emerged as a transformative technology with the potential to revolutionize various sectors and industries worldwide. Despite its global significance, the adoption and implementation of IoT technologies in emerging technology ecosystems within the Central African region still need to be studied and explored. This paper presents a case study of the Silicon Mountain technology ecosystem, located in the Fako division of the southwest region of Cameroon, focusing on the barriers and challenges to adopting and integrating IoT technologies within this emerging tech ecosystem. Through a survey research method, we investigate the factors influencing IoT adoption in the Silicon Mountain tech ecosystem, including technological, economic, social, and regulatory factors. Our study reveals key insights into the current state of IoT adoption, opportunities for growth and innovation, and IoT adoption challenges. Key among the challenges identified for impeding IoT uptake were issues related to standardization and financial resources, labor shortage in the industry, educational and knowledge gaps, market challenges, government policies, security and data privacy concerns, and inadequate power supply. Based on our findings, we provide recommendations for policymakers, industry stakeholders, and academic institutions to promote and facilitate the widespread adoption of IoT technologies in Silicon Mountain and the Central African region at large.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Internet of Things Adoption in Technology Ecosystems within the Central African Region: The Case of Silicon Mountain</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mangeh Jaja</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Akum Acha</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Onyeka Nwobodo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Eric Djomadji</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pierre Tsafack</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pierre Brosselard</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Comprehensive Crop Recommendation System Lever- aging Internet of Things and Machine Learning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><SECONDARY_TITLE><style face="normal" font="default" size="100%">EAI/Springer Innovations in Communication and Computing </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In the pursuit of sustainable agriculture and food security, the efficient use of soil nutrients is paramount. This paper presents the development of an Internet of Things (IoT) and Machine Learning (ML)-based system for crop recommendation. The system features a sensor that leverages visible infrared spectroscopy to accurately determine the nitrogen-phosphorus-potassium (NPK) concentration in soil. Integrated into a sensor node comprising of the ESP32 system-on-chip&#160;(SoC), this device collects real-time soil data and transmits it to the cloud. In the cloud, a web application employs a machine learning model developed from the random forest ML algorithm to analyze the NPK data and recommend the most suitable crops for cultivation on the given land. The developed model achieved a 91.1% overall accuracy. This approach not only optimizes crop selection but also promotes sustainable agricultural practices by ensuring that crops are matched to the soil's nutrient profile, consequently leading to improved crop yield while reducing environmental impact.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Comprehensive Crop Recommendation System Lever- aging Internet of Things and Machine Learning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Fabien Mieyeville</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Tokarz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Wirnkar Nsanyuy</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Eric Djomadji</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Musong Katche</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pierre Tsafack</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Zieliński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Evaluation of Green Strategies for Prolonging the Lifespan of Linear Wireless Sensor Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">21</style></ISSUE><DATE><style face="normal" font="default" size="100%">31/10/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Battery-powered sensor nodes encounter substantial energy constraints, especially in linear wireless sensor network (LWSN) applications like border surveillance and road, bridge, railway, powerline, and pipeline monitoring, where inaccessible locations exacerbate battery replacement challenges. Addressing these issues is crucial for extending a network’s lifetime and reducing operational costs. This paper presents a comprehensive analysis of the factors affecting WSN energy consumption at the node and network levels, alongside effective energy management strategies for prolonging the WSN’s lifetime. By categorizing existing strategies into node energy reduction, net-&lt;br /&gt;&#13;
work energy balancing, and energy replenishment, this study assesses their effectiveness when im- plemented in LWSN applications, providing valuable insights to assist engineers during the design of green and energy-efficient LWSN monitoring systems.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Evaluation of Green Strategies for Prolonging the Lifespan of Linear Wireless Sensor Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Onyeka Nwobodo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil Wereszczyński</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">PRZEMYSłAW SKUROWSKI</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">KRZYSZTOF CYRAN</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An Adaptation of Fitts’ Law for Performance Evaluation and Optimization of Augmented Reality (AR) Interfaces</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE ACCESS</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">12</style></VOLUME><SECTION><style face="normal" font="default" size="100%">169614 - 169627</style></SECTION><DATE><style face="normal" font="default" size="100%">14/11/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;There is growing widespread adoption of augmented reality (AR) in tech-driven industries and sectors of society, such as medicine, gaming, flight simulation, education, interior design and modelling, entertainment, construction, tourism, repair and maintenance, public safety, agriculture, and quantum computing. However, ensuring smooth and intuitive interactions with augmented objects is challenging, requiring practical performance evaluation and optimization models to assess and improve users’ experiences with AR-enhanced systems. In this paper, we apply Fitts’ Law to model and predict interaction task difficulty with objects distributed across four spatial quadrants. We use genetic optimization algorithms to fine-tune Fitts’s Law parameters, achieving a model that significantly enhances predictive accuracy. Our optimized model demonstrates an approximately 40% reduction in interaction task difficulty across all quadrants, leading to a more ergonomic and intuitive user interface. This study contributes to the Human-Computer Interaction (HCI) field by offering a refined metric for evaluating and optimizing AR interfaces and addressing the unique challenges of three-dimensional interaction environments. Therefore, we propose a practical framework for the performance evaluations and optimization of augmented reality and other user interfaces.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">An Adaptation of Fitts’ Law for Performance Evaluation and Optimization of Augmented Reality (AR) Interfaces</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Onyeka Nwobodo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil Wereszczyński</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">KRZYSZTOF CYRAN</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Hybrid Adaptive Filter for Head Tracking in Augmented Reality (AR)-based Flight Simulators</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Transactions on Computers</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">A Hybrid Adaptive Filter for Head Tracking in Augmented Reality (AR)-based Flight Simulators</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An Analytical Design Framework for Dimensioning Solar-powered Green IoT Nodes</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Abu Dhabi, UAE</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">02/07/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The rapid adoption of the Internet of Things (IoT) across various industries has significantly enhanced productivity and efficiency. However, the widespread deployment of battery-powered IoT devices raises concerns about energy sustainability, battery longevity, and environmental impact. Frequent battery replacements pose logistical challenges, particularly in large-scale networks and remote locations. To address these issues, the Green IoT (G-IoT) design framework has been introduced, emphasizing energy-efficient strategies such as duty cycling, transceiver optimization, energy-aware routing, and the integration of renewable energy sources like photovoltaic (PV) energy harvesting. Despite advancements in G-IoT, a major challenge remains: the dynamic and unpredictable nature of both IoT energy consumption and harvested energy. In this paper, we propose a design framework for Green IoT that models the interplay between energy harvesting, storage, and consumption processes. By incorporating time-varying energy dynamics, the proposed framework enables efficient dimensioning of energy harvesters and storage systems, ensuring optimal energy management in IoT networks. This approach allows for the evaluation of various energy-saving strategies and enhances the long-term sustainability of IoT deployments. Numerical examples and simulation results demonstrate the effectiveness of the framework in maintaining energy balance and extending the operational lifetime of IoT nodes.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">An Analytical Design Framework for Dimensioning Solar-powered Green IoT Nodes</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Onyeka Nwobodo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil Wereszczyński</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">KRZYSZTOF CYRAN</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Enhancing Learning in Augmented Reality (AR): A Deep Learning Framework for Predicting Memory Retention in AR Environments</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">25th International Conference on Computational Science</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Singapore</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer, Cham</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">07/2025</style></DATE><ISBN><style face="normal" font="default" size="100%">978-3-031-97573-8</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The integration of Artificial Intelligence (AI) with Augmented Reality (AR) has transformed human-computer interaction, offering new opportunities for immersive learning and cognitive assessment. However, the relationship between user engagement in AR environments and memory retention remains underexplored. This study proposes an AI-driven framework for predicting memory retention using behavioural interaction data captured through Microsoft HoloLens 2 sensors. The model estimates the likelihood of object recall in AR-based learning environments by analyzing key interaction metrics such as gaze duration, interaction frequency, revisit counts, and head movement stability.&lt;br /&gt;&#13;
To validate the AI predictions, we compared model-generated retention scores with user-reported recall, demonstrating a strong alignment between predicted and actual memory performance. Our findings align with established cognitive theories, indicating that increased interaction and attentional engagement enhance memory retention. Furthermore, comparisons with prior research on perceptual judgments and spatial memory reinforce the model’s effectiveness in capturing real-world cognitive processes. This study introduces a scalable, non-invasive approach to cognitive modeling, bridging AI-driven analytics with AR-based learning. The results have broad implications for education, medical training, AR-based flight simulation training, and workforce development, where optimizing learning efficiency is crucial. By leveraging AI for real-time memory prediction, this research paves the way for more adaptive and personalized AR learning experiences.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Enhancing Learning in Augmented Reality (AR): A Deep Learning Framework for Predicting Memory Retention in AR Environments</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Raivo Sell</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Tokarz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Agris Nikitenko</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Karlis Berkolds</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lukasz Lipka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An international hands-on IoT education platform towards Industry</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Proceedings of the Estonian Academy of Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">74</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">2</style></ISSUE><DATE><style face="normal" font="default" size="100%">07/05/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This paper presents VREL NextGen, an international Internet of Things (IoT) education platform developed through European university collaboration. The platform addresses hands-on IoT education needs in the Industry 5.0 context through three distinct implementations: a microcontroller laboratory at the Silesian University of Technology, a building management sensor network at Riga Technical University, and a human-robot collaboration platform at Tallinn University of Technology. The system enables remote access to physical hardware while promoting resource sharing and standardized educational approaches. Implementation results demonstrate effective integration of theoretical knowledge with practical skills, supporting both fundamental engineering concepts and advanced IoT applications while emphasizing human-centric design principles of Industry 5.0&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">An international hands-on IoT education platform towards Industry</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An Analytical Framework for Optimizing the Renewable Energy Dimensioning of Green IoT Systems in Pipeline Monitoring</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sensors</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">25</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">10</style></ISSUE><DATE><style face="normal" font="default" size="100%">15/05/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The increasing demand for sustainable and autonomous monitoring solutions in critical infrastructure has driven interest in Green Internet of Things (G-IoT) systems. This paper presents an analytical and experimental framework for designing energy-efficient, self-sustaining pipeline monitoring systems that leverage renewable energy harvesting and low-power operation techniques. We propose a hybrid approach combining solar energy harvesting with energy-saving strategies such as adaptive sensing, duty cycling, and distributed computing to extend the lifetime of IoT nodes without human intervention. Using real-world irradiance data and energy profiling from a prototype testbed, we analyze the impact of solar panel sizing, energy storage capacity, energy-saving strategies, and energy leakage on the energy balance of IoT nodes. The simulation results show that, with optimal dimensioning, harvested solar energy can sustain pipeline monitoring operations over multi-year periods, even under variable environmental conditions. We investigated the influence of design parameters such as duty cycling, solar panel area, the capacity of the energy storage system, and the energy leakage coefficient on energy performance metrics such as the autonomy or lifetime of the node (time required to drain all the stored energy), which is an important design object. This framework provides practical design insights for the scalable deployment of G-IoT systems in energy-constrained outdoor environments.&lt;/span&gt;&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/1424-8220/25/10/3137</style></URL><title><style face="normal" font="default" size="100%">An Analytical Framework for Optimizing the Renewable Energy Dimensioning of Green IoT Systems in Pipeline Monitoring</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Tokarz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Raivo Sell</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Agris Nikitenko</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Karlis Berkolds</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Lipka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Design and Implementation of a Next-Generation Remote Lab for IoT and Industry 4.0</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">29th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Osaka, Japan</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Elsevier</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The rapid adoption of the Internet of Things (IoT) across various industries, including manufacturing, healthcare, transportation, energy, and smart cities, has created a significant demand for skilled professionals in IoT hardware design, software development, deployment, and maintenance. However, the educational landscape has struggled to keep pace with this demand, as many universities lack dedicated IoT programs or fail to integrate IoT education into non-IT disciplines. This gap has led to a shortage of professionals skilled in IoT, posing a challenge for industries seeking to harness IoT technologies effectively. To address this challenge, next-generation remote laboratory infrastructures have emerged as a viable solution, enabling hands-on learning with IoT devices without the constraints of physical access to hardware. These infrastructures are particularly valuable for lifelong learners, students in remote areas, and institutions with limited resources, offering scalable and flexible access to IoT experimentation platforms via the Internet. Furthermore, the COVID-19 pandemic underscored the necessity of resilient and accessible online learning solutions, reinforcing the role of Virtual and Remote E-Laboratory (VREL) platforms in modern education. This paper presents the design, implementation, and operation of a next-generation remote laboratory infrastructure for IoT and Industry 4.0 education and research. Our approach builds upon the outcomes of two European Commission-funded projects—IOT-OPEN.EU (2016-2019) and IOT-OPEN.EU Reloaded (2022-2025) focuses on providing scalable, secure, and accessible remote IoT education solutions. We outline the architectural framework, key components, and technical challenges of deploying such infrastructures, including connectivity, security, scalability, and user management. Additionally, we discuss the educational impact of these platforms and their role in addressing the global IoT skills gap. Our findings demonstrate that remote IoT laboratories can be an effective and scalable alternative to traditional hands-on learning, supporting academic institutions and industry professionals in acquiring practical IoT skills. These infrastructures can enhance IoT education and workforce readiness by leveraging open-source technologies and modular architectures, ensuring broader accessibility and fostering innovation in the field.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Design and Implementation of a Next-Generation Remote Lab for IoT and Industry 4.0</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Czekalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mirosław Borowiecki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopie´</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An Analysis and Implementation of the Switching Sequence Table Method</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">29th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Osaka, Japan</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Elsevier</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;&lt;br /&gt;&#13;
This paper details the algorithm implementation of the Switching Sequence Table method in asynchronous sequential circuit Boolean switching system design. The algorithm is theoretically analysed in terms of its computational complexity and validated through actual experiments. It discusses the multidimensional problem of various parameters and their impact on performance. It then presents analytical evidence that reducing this multidimensional problem to a standard, one-dimensional problem is feasible. The authors consider method challenges when implementing computing modules for the Switching Sequence Table method.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">An Analysis and Implementation of the Switching Sequence Table Method</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Kinge Osee</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Valery Nkemeni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michael Sone</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Godlove Kuaban</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Hybrid Ensemble-Based QoE Prediction from QoS and User Satisfaction Data: A case study on Cameroon’s 3G/4G Mobile Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE ACCESS</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%"> 25-Nov-2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The rapid growth of mobile internet and social media usage in Sub-Saharan Africa has amplified the need for accurate Quality of Experience (QoE) assessment in resource-constrained network environments. This paper introduces a novel hybrid Machine Learning (ML) framework for predicting user QoE in Cameroon’s Third Generation and Fourth Generation (3G/4G) networks, leveraging a unique real-world dataset that integrates crowdsourced Quality of Service (QoS) measurements with subjective user satisfaction surveys. Addressing the limitations of existing QoE studies that focus on well-resourced regions, our approach proposes &lt;em&gt;QoE Predictor (QoEPredict)&lt;/em&gt;. This stacking ensemble combines eXtreme Gradient Boosting&#160;(XGBoost) and Random Forest classifiers with an XGBoost meta-learner. A key innovation is the use of disagreement features to capture divergences between base model predictions, allowing the meta-learner to resolve conflicts and enhance predictive accuracy.&#160;The proposed five-stage pipeline incorporates data preprocessing, feature engineering via Uniform Manifold Approximation and Projection (UMAP), unsupervised clustering, and Bayesian hyperparameter optimisation using Hyperopt, ensuring a robust and transferable methodology. Explainable AI (XAI) is integrated through SHapley Additive exPlanations (SHAP) analysis to provide feature-level interpretability and actionable insights for network operators. An experimental evaluation of 1,934 user sessions demonstrates that &lt;em&gt;QoEPredict&lt;/em&gt;&#160;achieves a 90% F1 Score and accuracy, outperforming single-model baselines across all metrics.&#160;This work represents one of the first large-scale, interpretable QoE prediction frameworks for mobile social media applications in Sub-Saharan Africa. By combining ensemble modelling with explainability and contextualised insights, the study offers both methodological advances and practical guidance for implementing QoE-aware network management strategies in developing regions facing infrastructural and operational constraints.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Hybrid Ensemble-Based QoE Prediction from QoS and User Satisfaction Data: A case study on Cameroon’s 3G/4G Mobile Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Gustavo Machado-Guillen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jorge Cruz-Duarte</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Santiago Conant-Pablos</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%">Harnessing Machine Learning for Reliable Weather Forecasting: Meteorological Impact on Sustainable Energy in Monterrey</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Congress on Evolutionary Computation</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/10611993</style></URL><title><style face="normal" font="default" size="100%">Harnessing Machine Learning for Reliable Weather Forecasting: Meteorological Impact on Sustainable Energy in Monterrey</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sebastian Pokuciński</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Mrozek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Finding the Perfect Cut: Selection of the Best Cutting Point in Equirectangular Panoramas for Object Detection</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><URL><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S1877050924024724</style></URL><title><style face="normal" font="default" size="100%">Finding the Perfect Cut: Selection of the Best Cutting Point in Equirectangular Panoramas for Object Detection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Romaszewski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Żarski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Semantic Depth Matters: Explaining Errors of Deep Vision Networks through Perceived Class Similarities</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><SECONDARY_TITLE><style face="normal" font="default" size="100%">arXiv preprint</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><URL><style face="normal" font="default" size="100%">arXiv:2504.09956</style></URL><title><style face="normal" font="default" size="100%">Semantic Depth Matters: Explaining Errors of Deep Vision Networks through Perceived Class Similarities</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Żarski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Beyond Accuracy: Uncovering the Role of Similarity Perception and its Alignment with Semantics in Supervised Learning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><SECONDARY_TITLE><style face="normal" font="default" size="100%">arXiv preprint</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Similarity manifests in various forms, including semantic similarity that is particularly important, serving as an approximation of human object categorization based on e.g. shared functionalities and evolutionary traits. It also offers practical advantages in computational modeling via lexical structures such as WordNet with constant and interpretable similarity. As in the domain of deep vision, there is still not enough focus on the phenomena regarding the similarity perception emergence. We introduce Deep Similarity Inspector (DSI) -- a systematic framework to inspect how deep vision networks develop their similarity perception and its alignment with semantic similarity. Our experiments show that both Convolutional Neural Networks' (CNNs) and Vision Transformers' (ViTs) develop a rich similarity perception during training with 3 phases (initial similarity surge, refinement, stabilization), with clear differences between CNNs and ViTs. Besides the gradual mistakes elimination, the mistakes refinement phenomenon can be observed.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2505.21338</style></URL><title><style face="normal" font="default" size="100%">Beyond Accuracy: Uncovering the Role of Similarity Perception and its Alignment with Semantics in Supervised Learning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Pokuciński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">SPHEREA: Synthetic dataset generation for equirectangular panoramas of home environments</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Knowledge-Based Systems</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">2025</style></DATE><URL><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S0950705125017897?via%3Dihub</style></URL><title><style face="normal" font="default" size="100%">SPHEREA: Synthetic dataset generation for equirectangular panoramas of home environments</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jorge Cruz-Duarte</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Target Selection for Adversarial Evaluation of Vision Models Using Language Models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE International Joint Conference on Neural Networks</style></SECONDARY_TITLE><title><style face="normal" font="default" size="100%">Target Selection for Adversarial Evaluation of Vision Models Using Language Models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Żarski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Inspecting Training Dynamics of Similarity Development in Supervised Vision Networks </style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases</style></SECONDARY_TITLE><title><style face="normal" font="default" size="100%">Inspecting Training Dynamics of Similarity Development in Supervised Vision Networks </style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Pokuciński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Measuring Monosemanticity in Sparse Autoencoders via Latent Activation Coherence</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases</style></SECONDARY_TITLE><title><style face="normal" font="default" size="100%">Measuring Monosemanticity in Sparse Autoencoders via Latent Activation Coherence</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil Faber</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Roberto Corizzo</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christopher Kanan</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Lost or Hidden? A Concept-Level Forgetting in Supervised Continual Learning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Neural Information Processing Systems (NeurIPS)</style></SECONDARY_TITLE><title><style face="normal" font="default" size="100%">Lost or Hidden? A Concept-Level Forgetting in Supervised Continual Learning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Osman Yıldız</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Recurrent Trend Predictive Neural Network for Multi-Sensor Fire Detection</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">9</style></VOLUME><SECTION><style face="normal" font="default" size="100%">84204</style></SECTION><DATE><style face="normal" font="default" size="100%">10/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We propose a Recurrent Trend Predictive Neural Network (rTPNN) for multi-sensor fire detection based on the trend as well as level prediction and fusion of sensor readings. The rTPNN model significantly differs from the existing methods due to recurrent sensor data processing employed in its architecture. rTPNN performs trend prediction and level prediction for the time series of each sensor reading and captures trends on multivariate time series data produced by multi-sensor detector. We compare the performance of the rTPNN model with that of each of the Linear Regression (LR), Nonlinear Perceptron (NP), Multi-Layer Perceptron (MLP), Kendall-τ combined with MLP, Probabilistic Bayesian Neural Network (PBNN), Long-Short Term Memory (LSTM), and Support Vector Machine (SVM) on a publicly available fire data set. Our results show that rTPNN model significantly outperforms all of the other models (with 96% accuracy) while it is the only model that achieves high True Positive and True Negative rates (both above 92%) at the same time. rTPNN also triggers an alarm in only 11 s from the start of the fire, where this duration is 22 s for the second-best model. Moreover, we present that the execution time of rTPNN is acceptable for real-time applications.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/9451553</style></URL><title><style face="normal" font="default" size="100%">Recurrent Trend Predictive Neural Network for Multi-Sensor Fire Detection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Volkan Rodoplu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Roozbeh Qorbanian</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Deniz Eliiyi</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Multi-Channel Joint Forecasting-Scheduling for the Internet of Things</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">8</style></VOLUME><SECTION><style face="normal" font="default" size="100%">217324 </style></SECTION><DATE><style face="normal" font="default" size="100%">11/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We develop a methodology for Multi-Channel Joint Forecasting-Scheduling (MC-JFS) targeted at solving the Medium Access Control (MAC) layer Massive Access Problem of Machine-to-Machine (M2M) communication in the presence of multiple channels, as found in Orthogonal Frequency Division Multiple Access (OFDMA) systems. In contrast with the existing schemes that merely react to current traffic demand, Joint Forecasting-Scheduling (JFS) forecasts the traffic generation pattern of each Internet of Things (IoT) device in the coverage area of an IoT Gateway and schedules the uplink transmissions of the IoT devices over multiple channels in advance, thus obviating contention, collision and handshaking, which are found in reactive protocols. In this paper, we present the general form of a deterministic scheduling optimization program for MC-JFS that maximizes the total number of bits that are delivered over multiple channels by the delay deadlines of the IoT applications. In order to enable real-time operation of the MC-JFS system, first, we design a heuristic, called Multi-Channel Look Ahead Priority based on Average Load (MC-LAPAL), that solves the general form of the scheduling problem. Second, for the special case of identical channels, we develop a reduction technique by virtue of which an optimal solution of the scheduling problem is computed in real time. We compare the network performance of our MC-JFS scheme against Multi-Channel Reservation-based Access Barring (MC-RAB) and Multi-Channel Enhanced Reservation-based Access Barring (MC-ERAB), both of which serve as benchmark reactive protocols. Our results show that MC-JFS outperforms both MC-RAB and MC-ERAB with respect to uplink cross-layer throughput and transmit energy consumption, and that MC-LAPAL provides high performance as an MC-JFS heuristic. Furthermore, we show that the computation time of MC-LAPAL scales approximately linearly with the number of IoT devices. This work serves as a foundation for building scalable JFS schemes at IoT Gateways in the near future.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/9260218</style></URL><title><style face="normal" font="default" size="100%">Multi-Channel Joint Forecasting-Scheduling for the Internet of Things</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Alperen Helva</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Volkan Rodoplu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Subspace-Based Emulation of the Relationship Between Forecasting Error and Network Performance in Joint Forecasting-Scheduling for the Internet of Things</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">7th IEEE World Forum on the Internet of Things</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">New Orleans</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We develop a novel methodology that discovers the relationship between the forecasting error and the performance of the application that utilizes the forecasts. In our methodology, an Artificial Neural Network (ANN) learns this relationship while the forecasting error is kept inside a subspace of the entire space of forecasting errors during training. We apply our methodology to the case of Joint Forecasting-Scheduling (JFS) for the Internet of Things (IoT). Our results hold potential to improve the performance of JFS in next-generation networks and can be applied to a much wider range of problems beyond IoT.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Subspace-Based Emulation of the Relationship Between Forecasting Error and Network Performance in Joint Forecasting-Scheduling for the Internet of Things</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kubilay Karakayali</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Volkan Rodoplu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An End-to-End Trainable Feature Selection-Forecasting Architecture Targeted at the Internet of Things</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We develop a novel end-to-end trainable feature selection-forecasting (FSF) architecture for predictive networks targeted at the Internet of Things (IoT). In contrast with the existing filter-based, wrapper-based and embedded feature selection methods, our architecture enables the automatic selection of features dynamically based on feature importance score calculation and gamma-gated feature selection units that are trained jointly and end-to-end with the forecaster. We compare the performance of our FSF architecture on the problem of forecasting IoT device traffic against the following existing (feature selection, forecasting) technique pairs: Autocorrelation Function (ACF), Analysis of Variance (ANOVA), Recurrent Feature Elimination (RFE) and Ridge Regression methods for feature selection, and Linear Regression, Multi-Layer Perceptron (MLP), Long Short Term Memory (LSTM), 1 Dimensional Convolutional Neural Network (1D CNN), Autoregressive Integrated Moving Average (ARIMA), and Logistic Regression for forecasting. We show that our FSF architecture achieves either the best or close to the best performance among all of the competing techniques by virtue of its dynamic, automatic feature selection capability. In addition, we demonstrate that both the training time and the execution time of FSF are reasonable for IoT applications. This work represents a milestone for the development of predictive networks for IoT in smart cities of the near future.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/9477183</style></URL><title><style face="normal" font="default" size="100%">An End-to-End Trainable Feature Selection-Forecasting Architecture Targeted at the Internet of Things</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Erdem Çakan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aral Şahin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Volkan Rodoplu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Multi-Layer Perceptron Decomposition Architecture for Mobile IoT Indoor Positioning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">7th IEEE World Forum on the Internet of Things</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We develop a Multi-Layer Perceptron (MLP) Decomposition&lt;br /&gt;&#13;
architecture for mobile Internet Things (IoT) indoor&lt;br /&gt;&#13;
positioning. We demonstrate the performance of our architecture&lt;br /&gt;&#13;
on an indoor system that utilizes ultra-wideband (UWB) positioning.&lt;br /&gt;&#13;
Our architecture outperforms the following benchmark&lt;br /&gt;&#13;
processing techniques on the same data: MLP, Linear Regression,&lt;br /&gt;&#13;
Ridge Regression, Support Vector Regression, and the Least&lt;br /&gt;&#13;
Squares Method for indoor positioning. The results show that our&lt;br /&gt;&#13;
architecture can significantly advance the positioning accuracy&lt;br /&gt;&#13;
of indoor positioning systems and enable indoor applications&lt;br /&gt;&#13;
such as navigation, proximity marketing, asset tracking, collision&lt;br /&gt;&#13;
avoidance, and social distancing.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Multi-Layer Perceptron Decomposition Architecture for Mobile IoT Indoor Positioning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Alper Saylam</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rifat Cikmazel</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Volkan Rodoplu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy-Efficient Indoor Positioning for Mobile Internet of Things Based on Artificial Intelligence</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ASYU2021 </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We develop an energy-efficient indoor positioning system based on Artificial Intelligence (AI). In our system, first, at the positioning layer, a Multi-Layer Perceptron (MLP) estimates the current indoor position of an IoT device based on positioning indicators obtained from the anchors. Second, at the forecasting layer, a pair of MLPs estimate the future positions of the device based on the past position estimates obtained when the device woke up as well as the forecast positions of the device during the sleep periods. Third, the device is awakened to send a positioning beacon at intervals over which a significant displacement is predicted to occur by the forecasting layer. Our results demonstrate that our indoor positioning system saves significant energy via adaptive sleep cycles whose duration is determined by the &#160;prediction of a significant displacement. This work establishes a foundation for indoor positioning that utilizes AI-based positioning and trajectory forecasting.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy-Efficient Indoor Positioning for Mobile Internet of Things Based on Artificial Intelligence</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Onur Çopur</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Comparative Study of Forecasting Models for COVID-19 Outbreak in Turkey</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ASYU2021 </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This paper gives an explanation for the failure of machine learning models for the prediction of the cases and the other future trends of Covid-19 pandemic. The paper shows that simple Linear Regression models provide high prediction accuracy values reliably but only for a 2-weeks period and that relatively complex machine learning models, which have the potential of learning long-term predictions with low errors, cannot achieve to obtain good predictions with possessing a high generalization ability. It is suggested in the paper that the lack of a sufficient number of samples is the source of the low prediction performance of the forecasting models. To exploit the information, which is of most relevant with the active cases, we perform feature selection over a variety of variables such as the numbers of active cases, deaths, recoveries, and population. Furthermore, we compare Linear Regression, Multi-Layer Perceptron, and Long-Short Term Memory models each of which is used for prediction of active cases together with various feature selection methods. Our results show that the accurate forecasting of the active cases with high generalization ability is possible up to 3 days because of the small sample size of COVID-19 data. We observe that the Linear Regression model has much better prediction performance with high generalization ability as compared to the complex models but, as expected, its performance decays sharply for more than 14-days prediction horizons.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Comparative Study of Forecasting Models for COVID-19 Outbreak in Turkey</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Alper Saylam</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rifat Cikmazel</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Volkan Rodoplu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Dynamic Positioning Interval Based On Reciprocal Forecasting Error (DPI-RFE) Algorithm for Energy-Efficient Mobile IoT Indoor Positioning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Conference on Computer, Information and Telecommunication Systems (CITS)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Istanbul, Turkey</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We develop an algorithm called “Dynamic Positioning Interval based on Reciprocal Forecasting Error (DPIRFE)” for energy-efficient mobile Internet of Things (IoT) Indoor Positioning (IP). In contrast with existing IP algorithms, DPIRFE forecasts the future trajectory of a mobile IoT device by using machine learning and dynamically adjusts the positioning interval based on the reciprocal instantaneous forecasting error, thereby dynamically trading off transmit energy consumption against forecasting error. We compare the performance of DPIRFE with respect to the total transmit energy consumption and the average forecasting error against Constant Positioning Interval (CPI) and Positioning Interval based on Displacement (PID) algorithms. Our results show that DPI-RFE significantly outperforms both of these benchmark algorithms with respect to transmit energy consumption while achieving a competitive average forecasting error performance. These results open the way to the design of machine learning based trajectory forecasting algorithms that can be utilized for energy-efficient positioning in next-generation wireless networks.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Dynamic Positioning Interval Based On Reciprocal Forecasting Error (DPI-RFE) Algorithm for Energy-Efficient Mobile IoT Indoor Positioning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arda Asut</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cennet Kocabıyık</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A Smart Home Demand Response System based on Artificial Neural Networks Augmented with Constraint Satisfaction Heuristic</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">13th INTERNATIONAL CONFERENCE on ELECTRICAL and ELECTRONICS ENGINEERING (ELECO)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Bursa, Turkey</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Distributing the peak load and alleviating grid stress by considering hourly electricity prices are some of the main research problems for current smart grid systems. This paper deals with the scheduling problem of home appliances' operating hours in smart grids, which aims to achieve minimum cost in user-defined operation intervals. To this end, scheduling via Artificial Neural Networks Augmented with Constraint Satisfaction Heuristic (ANN-AH) method that emulates the operation of the optimization for smart home demand response is developed. Our results show that a home demand response via ANN-AH achieves close to optimal performance with 10 times lower execution time than the optimal scheduling. These results suggest that the ANN-AH based demand response is highly successful and practical, and it is promising for future applications in micro-grid and decentralized renewable energy systems.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">A Smart Home Demand Response System based on Artificial Neural Networks Augmented with Constraint Satisfaction Heuristic</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Erdem Çakan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Volkan Rodoplu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Dynamic Automatic Forecaster Selection via Artificial Neural Network Based Emulation to Enable Massive Access for the Internet of Things</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Network and Computer Applications (JNCA)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Massive Access Problem of the Internet of Things (IoT) occurs at the uplink Medium Access Control (MAC) layer when a massive number of IoT devices seek to transfer their data to an IoT gateway. Although recently proposed predictive access solutions that schedule the uplink traffic based on forecasts of IoT device traffic achieve high network performance, these solutions depend heavily on the performance of forecasters. Hence, the design and selection of forecasting schemes are key to enabling massive access for such predictive access solutions. To this end, in this paper, first, we develop a framework that emulates the relationship between the IoT device class composition in the coverage area of an IoT gateway and the resulting network performance by virtue of an Artificial Neural Network (ANN). Second, based on this framework, we develop the Dynamic Automatic Forecaster Selection (DAFS) method, which selects the best-performing forecasting scheme for predictive access, in particular for &#160;Joint Forecasting-Scheduling (JFS), in a manner that adapts dynamically to a changing number of IoT devices in each device class in the coverage area. We evaluate the performance of DAFS via simulations and show that our method is able to achieve at least $80\%$ of the best performance that can be attained for both throughput and energy consumption. Furthermore, we demonstrate that DAFS is robust with respect to the selection of architectural parameters and has a reasonable computation time for real-time IoT applications. These results imply that DAFS holds the potential for practical implementation at IoT gateways in order to enable massive access under a dynamically changing composition of IoT devices.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Dynamic Automatic Forecaster Selection via Artificial Neural Network Based Emulation to Enable Massive Access for the Internet of Things</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Onur Çopur</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Simone Scardapane</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jürgen Slowack</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Engagement Detection with Multi-Task Training in E-Learning Environments</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Conference on Image Analysis and Processing (ICIAP)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Recognition of user interaction, in particular engagement detection, became highly crucial for online working and learning environments, especially during the COVID-19 outbreak. Such recognition and detection systems significantly improve the user experience and efficiency by providing valuable feedback. In this paper, we propose a novel Engagement Detection with Multi-Task Training (ED-MTT) system which minimizes mean squared error and triplet loss together to determine the engagement level of students in an e-learning environment. The performance of this system is evaluated and compared against the state-ofthe-art on a publicly available dataset as well as videos collected from real-life scenarios. The results show that ED-MTT achieves 6% lower MSE than the best state-of-the-art performance with highly acceptable training time and lightweight feature extraction.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Engagement Detection with Multi-Task Training in E-Learning Environments</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Baran Gül</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Volkan Rodoplu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Predictability of Internet of Things Traffic at the Medium Access Control Layer Against Information-Theoretic Bounds</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">10</style></VOLUME><SECTION><style face="normal" font="default" size="100%">55602</style></SECTION><DATE><style face="normal" font="default" size="100%">05/2022</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Most of the existing Medium Access Control (MAC) layer protocols for the Internet of Things (IoT) model the traffic generated by each IoT device via random arrivals such as those in a Poisson process. Under this model, since it is implied that IoT device traffic cannot be predicted, only reactive MAC-layer protocols in which the network responds to the current traffic are viable. In contrast, recent work has demonstrated that the traffic generated by an individual IoT device can be predictable, thus enabling predictive network protocols at the MAC layer. In this paper, we investigate information-theoretic bounds on the predictability of IoT traffic of individual devices. To this end, first, we compare the performance achieved by the following state-of-the-art forecasters on individual IoT device traffic: Logistic Regression, Multi-Layer Perceptron (MLP), 1-Dimensional Convolutional Neural Network (1D CNN), and Long Short Term Memory (LSTM) as well as MLP under feature selection based on Analysis of Variance (ANOVA) and Auto-Correlation Function (ACF). Second, we quantify the gap between the performance of these forecasters against information-theoretic bounds as follows: For IoT devices that generate a fixed number of bits at each generation instance, we measure the gap between the forecasting accuracy and the information-theoretic bound established by Fano’s inequality on the probability of correct prediction. Our empirical results show that existing forecasting schemes perform close to the information-theoretic bound in this case. For IoT devices that generate a variable number of bits, we measure the gap between the Mean Square Error (MSE) and the estimation-theoretic counterpart to Fano’s inequality. Our empirical results show that the performance of existing forecasting schemes is far from the information-theoretic bound in this case. This work motivates the machine learning community to develop forecasting schemes that approach information-theoretic bounds. Furthermore, this work is expected to impact the development of predictive MAC-layer protocols that exploit these bounds.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Predictability of Internet of Things Traffic at the Medium Access Control Layer Against Information-Theoretic Bounds</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Arif Dayı</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Volkan Rodoplu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Buse Pehlivan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Multi-Channel Subset Iteration with Minimal Loss in Available Capacity (MC-SIMLAC) Algorithm for Joint Forecasting-Scheduling in the Internet of Things</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications (JoWUA)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">2</style></ISSUE><SECTION><style face="normal" font="default" size="100%">68</style></SECTION><DATE><style face="normal" font="default" size="100%">06/2022</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Massive Access Problem of the Internet of Things (IoT) refers to the problem of scheduling the uplink transmissions of a massive number of IoT devices in the coverage area of an IoT gateway. Joint Forecasting-Scheduling (JFS) is a recently developed methodology in which an IoT gateway forms predictions of the future uplink traffic generation pattern of each IoT device in its coverage area via machine learning algorithms and uses these predictions to schedule the uplink traffic of all of the IoT devices in advance. In this paper, we develop a novel algorithm, which we call “Multi-Channel Subset Iteration with Minimal Loss in Available Capacity” (MC-SIMLAC), for multi-channel joint forecasting-scheduling. Our multi-channel scheduling algorithm iterates over subsets of all of the bursts of IoT device traffic and selects channel-slot pairs by targeting the minimization of loss in total available capacity. In this regard, our algorithm contrasts sharply with Multi-Channel Look Ahead Priority based on Average Load (MC-LAPAL), which is the best-performing heuristic that has been developed so far for multi-channel JFS. In the general case, our algorithm outperforms MC-LAPAL, especially when wireless links operate in the power-limited regime and the number of devices is large. For the special case of identical channels, our algorithm achieves a performance that is closer than MC-LAPAL to that of the optimal scheduler. Furthermore, we prove that the time complexity and the space complexity of MC-SIMLAC in the worst case are polynomial in each of the system parameters, which indicates practical feasibility. These results pave the way to the widespread use of multi-channel joint forecasting-scheduling at IoT gateways in the near future.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Multi-Channel Subset Iteration with Minimal Loss in Available Capacity (MC-SIMLAC) Algorithm for Joint Forecasting-Scheduling in the Internet of Things</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Alperen Helva</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Volkan Rodoplu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">MOSAL: A Subspace Based Forecasting Algorithm for Throughput Maximization in IoT Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Sensors Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">11/2022</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Predictive solution techniques have been developed recently in order to solve the Massive Access Problem of the Internet of Things (IoT). These techniques forecast the traffic generation patterns of individual IoT devices in the coverage area of an IoT gateway and schedule the MAC-layer resources at the gateway in advance based on these forecasts. Although predictive solutions have achieved high network performance, a key problem is that their performance depends highly on the performance of forecasters. In this paper, in order to minimize the effects of forecasting errors on the performance of predictive networks, we develop a subspace based forecasting algorithm called “Motion On a Subspace under Adaptive Learning rate (MOSAL)”. First, our algorithm trains a forecaster by minimizing the performance loss of an IoT network based on the emulation of an Application-Specific Error Function by an Artificial Neural Network. Second, the algorithm moves close to a subspace of the forecasting errors while it aims to maximize network throughput. Our results show that MOSAL achieves a throughput performance that surpasses the performance of commonly used standard gradient descent training algorithms at a reasonable execution time. These results open the way to the deployment of predictive solutions at IoT Gateways in practice in the near future.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/9942929</style></URL><title><style face="normal" font="default" size="100%">MOSAL: A Subspace Based Forecasting Algorithm for Throughput Maximization in IoT Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Onur Çopur</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Emrah Biyik</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Renewable energy management in smart home environment via forecast embedded scheduling based on Recurrent Trend Predictive Neural Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Applied Energy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">340</style></VOLUME><SECTION><style face="normal" font="default" size="100%">121014</style></SECTION><DATE><style face="normal" font="default" size="100%">03/2023</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Smart home energy management systems help the distribution grid operate more efficiently and reliably, and enable effective penetration of distributed renewable energy sources. These systems rely on robust forecasting, optimization, and control/scheduling algorithms that can handle the uncertain nature of demand and renewable generation. This paper proposes an advanced ML algorithm, called Recurrent Trend Predictive Neural Network based Forecast Embedded Scheduling (rTPNN-FES), to provide efficient residential demand control. rTPNN-FES is a novel neural network architecture that simultaneously forecasts renewable energy generation and schedules household appliances. By its embedded structure, rTPNN-FES eliminates the utilization of separate algorithms for forecasting and scheduling and generates a schedule that is robust against forecasting errors. This paper also evaluates the performance of the proposed algorithm for an IoT-enabled smart home. The evaluation results reveal that rTPNN-FES provides near-optimal scheduling 37.5 times faster than the optimization while outperforming state-of-the-art forecasting techniques.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://authors.elsevier.com/a/1gr4J15eif8Fs5</style></URL><title><style face="normal" font="default" size="100%">Renewable energy management in smart home environment via forecast embedded scheduling based on Recurrent Trend Predictive Neural Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Pervin Bulucu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Multi-Sensor E-Nose based on Online Transfer Learning Trend Predictive Neural Network</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Electronic Nose (E-Nose) systems, widely applied across diverse fields, have revolutionized quality control, disease diagnostics, and environmental management through their odor detection and analysis capabilities. The decision and analysis of E-Nose systems often enabled by Machine Learning (ML) models that are trained offline using existing datasets. However, despite their potential, offline training efforts often prove intensive and may still fall short in achieving high generalization ability and specialization for considered application. To address these challenges, this paper introduces the e-rTPNN decision system, which leverages the Recurrent Trend Predictive Neural Network (rTPNN) combined with online transfer learning. The recurrent architecture of the e-rTPNN system effectively captures temporal dependencies and hidden sequential patterns within E-Nose sensor data, enabling accurate estimation of trends and levels. Notably, the system demonstrates the ability to adapt quickly to new data during online operation, requiring only a small offline dataset for initial learning. We evaluate the performance of the e-rTPNN decision system in two domains: beverage quality assessment and medical diagnosis, using publicly available wine quality and Chronic Obstructive Pulmonary Disease (COPD) datasets, respectively. Our evaluation indicates that the proposed e-rTPNN achieves decision accuracy exceeding 97% while maintaining low execution times. Furthermore, comparative analysis against established Machine Learning (ML) models reveals that the e-rTPNN decision system consistently outperforms these models by a significant margin in terms of accuracy.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Multi-Sensor E-Nose based on Online Transfer Learning Trend Predictive Neural Network</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Fire Detection and Risk Assessment via Support Vector Regression with Flattening-Samples Based Augmented Regularization</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Applied Soft Computing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">164</style></VOLUME><SECTION><style face="normal" font="default" size="100%">112023</style></SECTION><DATE><style face="normal" font="default" size="100%">10/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We propose a Hybrid Support Vector Regression (SVR) with Flattening-Samples Based Augmented Regularization (Hybrid FSR-SVR) architecture for multi-sensor fire detection and forest fire risk assessment. The Hybrid FSR-SVR is a lightweight architecture built upon the novel Flattening-Samples Based Augmented Regularization (FSR) approach and temporal trends of environmental variables. The FSR approach augments&#160;l2&#160;norm based smoothing term into an&#160;l1-l2&#160;combination, facilitating the integration of&#160;l1&#160;regularization into the SVR method, thereby enhancing generalization with minimal computational load. We evaluate the performance of Hybrid FSR-SVR using two distinct datasets covering indoor and forest fires, benchmarking against 15 machine learning models, including state-of-the-art techniques, such as Recurrent Trend Predictive Neural Network (rTPNN), Long-Short Term Memory (LSTM), Multi-Layer Perceptron (MLP), Gated Recurrent Unit (GRU), and Gradient Boosting. Our findings demonstrate that Hybrid FSR-SVR effectively assesses the risk of forest fire, enabling early preventive measures. Notably, it achieves a remarkable accuracy of 0.95 for forest fire detection and ranks third with 0.88 accuracy for indoor fire detection. Importantly, it exhibits computation times significantly lower – by 1 to 2 orders of magnitude – than the majority of compared techniques. The superior generalization ability of Hybrid FSR-SVR, facilitated by flattening-samples based augmented regularization, allows for high detection performance even with smaller training sets.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Fire Detection and Risk Assessment via Support Vector Regression with Flattening-Samples Based Augmented Regularization</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analysis of the QoS Prediction via Recurrent Trend Predictive Neural Network under Low-Rate DoS Attacks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The 10th International Conference on Next Generation Computing</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Philippines (Hybrid)</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Korean Institute of Next Generation Computing</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">11/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Low-Rate Denial of Service (LDoS) attacks raise an increasingly frequent and significant threat to performancecritical and sensitive networks. Due to their slowly evolving nature, it is challenging –but crucial– to detect such attacks during their early phases in order to mitigate their impact on network performance, e.g. Quality of Service (QoS), in longterm operation. To this end, this paper investigates the prediction of QoS via a modified version of the Recurrent Trend Predictive Neural Network (rTPNN) and the use of the prediction towards detracting LDoS attacks. The presented rTPNN-based QoS predictor is evaluated and compared against benchmark models for five scenarios using an open-access dataset. The results have shown that the modified rTPNN model can predict QoS with under 2% SMAPE, and the QoS prediction is a promising approach for developing LDoS attack detectors in future works.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.earticle.net/Article/A468884</style></URL><title><style face="normal" font="default" size="100%">Analysis of the QoS Prediction via Recurrent Trend Predictive Neural Network under Low-Rate DoS Attacks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Taylan Mert</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Self-Supervised Online Learning Algorithm for rTPNN to Reduce False Alarms in Fire Detection</style></TITLE></TITLES><KEYWORDS><KEYWORD><style face="normal" font="default" size="100%">Fire detection</style></KEYWORD><KEYWORD><style face="normal" font="default" size="100%">Self-Supervised</style></KEYWORD><KEYWORD><style face="normal" font="default" size="100%">online learning</style></KEYWORD><KEYWORD><style face="normal" font="default" size="100%">human-in-the-loop</style></KEYWORD><KEYWORD><style face="normal" font="default" size="100%">multi-sensor</style></KEYWORD></KEYWORDS><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Knowledge-Based Systems</style></SECONDARY_TITLE><VOLUME><style face="normal" font="default" size="100%">350</style></VOLUME><PAGES><style face="normal" font="default" size="100%">14</style></PAGES><DATE><style face="normal" font="default" size="100%">07/2026</style></DATE><TYPE_OF_WORK><style face="normal" font="default" size="100%">Research article</style></TYPE_OF_WORK><KEYWORD><style face="normal" font="default" size="100%"/></KEYWORD><title><style face="normal" font="default" size="100%">Self-Supervised Online Learning Algorithm for rTPNN to Reduce False Alarms in Fire Detection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A predictive neural network architecture for early detection of low-rate cyberattacks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Knowledge-Based Systems</style></SECONDARY_TITLE><SECTION><style face="normal" font="default" size="100%">115995</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Low-Rate Denial of Service (LDoS) attacks pose a significant challenge to IoT networks due to their subtle and prolonged nature, often evading traditional intrusion detection systems. This paper presents IDQS (Intrusion Detection via QoS Prediction), a lightweight and proactive framework for early LDoS attack detection. IDQS integrates two new key components: (i) RTP-QoS, a Recurrent Trend Predictive Neural Network that learns and forecasts future Quality of Service (QoS) based on historical traffic patterns, and (ii) PDM, a Pairwise Decision Model that evaluates discrepancies between predicted and actual QoS to identify potential attacks. Evaluated on the public SDN-SlowRate-DDoS and CIC-IDS2017 datasets, IDQS respectively achieves over 79% and 91% detection accuracy across most attack scenarios with high recall and low false negatives, while maintaining an end-to-end inference time of just 0.28 seconds. The results demonstrate the effectiveness and efficiency of IDQS for real-time deployment in resource-constrained IoT environments.&lt;/p&gt;</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S0950705126007215</style></URL><title><style face="normal" font="default" size="100%">A predictive neural network architecture for early detection of low-rate cyberattacks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mikołaj Macura</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Performance, Energy Efficiency, and Security of Distributed rTPNN for TinyML-Enabled Smart Homes</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">32nd International Conference on Telecommunications (ICT)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Thessaloniki, Greece</style></PLACE_PUBLISHED><PUBLISHER><style face="normal" font="default" size="100%">IEEE</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span style="-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);color:rgb(34, 34, 34);display:inline !important;float:none;font-family:Arial, sans-serif;font-size:13px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:400;letter-spacing:normal;orphans:2;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-transform:none;white-space:normal;widows:2;word-spacing:0px;"&gt;Tiny Machine Learning (TinyML) brings AI capabilities to low-power edge devices, enabling local data processing without cloud reliance. This paper evaluates a distributed Recurrent Trend Predictive Neural Network (rTPNN) deployed on ESP8266 and ESP32 microcontrollers within a smart home IoT network. The rTPNN achieves superior accuracy with fewer parameters than standard models while incurring negligible computational costs. Energy profiling demonstrates that constant WiFi connectivity extends battery life eight-fold compared to periodic reconnection. However, security assessments reveal that constant connectivity is highly susceptible to Denial of Service (DoS) saturation, and parameter injection can degrade accuracy by over 70%. These results substantiate the feasibility of rTPNN as a TinyML for sustained operation while highlighting the critical need for codesigned security mechanisms.&lt;/span&gt;&lt;/p&gt;</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/11594667</style></URL><title><style face="normal" font="default" size="100%">Performance, Energy Efficiency, and Security of Distributed rTPNN for TinyML-Enabled Smart Homes</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pervin Bulucu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Osman Yıldız</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Cüneyt Güzeliş</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Trends and Multidimensional Analysis of Performance-Influencing Components in Electronic Noses: A Survey</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><PAGES><style face="normal" font="default" size="100%">27</style></PAGES><SECTION><style face="normal" font="default" size="100%">104834</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;div class="abstract-text row g-0" style="--bs-gutter-x:0;--bs-gutter-y:0;-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);box-sizing:border-box;clear:both;color:rgb(51, 51, 51);display:flex;flex-wrap:wrap;font-family:"HelveticaNeue Regular", sans-serif;font-size:18px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:400;letter-spacing:normal;margin:0px 0px 1em !important;orphans:2;outline:none !important;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-transform:none;white-space:normal;widows:2;word-spacing:0px;" _ngcontent-ng-c1231153542=""&gt;&lt;div class="col-12" style="box-sizing:border-box;flex:0 0 auto;margin-top:0px;max-width:100%;outline:none !important;padding-left:0px;padding-right:0px;width:886.963px;" _ngcontent-ng-c1231153542=""&gt;&lt;div class="u-mb-1" style="box-sizing:border-box;margin-bottom:1em !important;outline:none !important;" _ngcontent-ng-c1231153542=""&gt;&lt;div class="abstract-text-content" style="box-sizing:border-box;outline:none !important;" _ngcontent-ng-c1231153542="" xplmathjax=""&gt;Electronic Nose (E-Nose) systems have emerged as powerful analytical tools engineered to mimic the mammalian olfactory system, offering rapid, non-invasive, and cost-effective alternatives to traditional chemical analysis methods. Given the vast and multifaceted nature of recent research, this paper presents a detailed and multidimensional analysis of the primary components dictating E-Nose efficacy: target analytes, gas sensors, and Machine Learning (ML) algorithms. Based on a structured review of literature published between 2019 and 2025, we quantitatively explore the interdependencies among these components to identify key trends and performance drivers. Our statistical analysis reveals a continued reliance on Metal Oxide Semiconductor (MOS) sensors due to their cost-effectiveness, alongside a significant paradigm shift from traditional statistical methods toward Deep Learning (DL) architectures, particularly Convolutional Neural Networks (CNNs) and hybrid models, which are increasingly utilized to handle high-dimensional sensor data. Furthermore, we provide a granular review of applications across major sectors, including Food and Beverage, covering quality assessment, fraud detection, and flavor characterization, as well as Healthcare, and Environmental and Agricultural Monitoring. Finally, this survey critically evaluates persistent challenges such as sensor drift, detection performance, data scarcity, and explainability, while outlining emerging research opportunities in novel nanomaterials, IoT integration, Edge Computing, and multi-modal sensing to facilitate the transition from laboratory prototypes to robust commercial applications.&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/11599553</style></URL><title><style face="normal" font="default" size="100%">Trends and Multidimensional Analysis of Performance-Influencing Components in Electronic Noses: A Survey</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Baran Gül</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Nasser Jazdi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michael Weyrich</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">QoS-Aware Federated Learning for Multimodal In-Cabin Interaction in Smart Vehicles</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD)</style></SECONDARY_TITLE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Modern smart vehicles leverage multimodal sensors, ranging from high-bandwidth vision systems to low-rate physiological monitors, to provide personalized in-cabin services. However, integrating high-fidelity multimodal fusion with collaborative training is often hindered by the heterogeneous and time-varying Quality of Service (QoS) constraints of vehicular networks. Standard Federated Learning (FL) approaches enforce rigid synchronous rounds that fail to account for these resource asymmetries, leading to safety-critical timing violations and energy exhaustion. In this paper, we propose FedQoS, a novel asynchronous, event-triggered FL framework that decouples local computation from global communication via a two-phase gating mechanism. First, we introduce a resource-aware training gate that initializes local learning only when sensing buffers and energy reserves meet safety thresholds, preventing ML tasks from compromising core vehicle mobility. Second, a QoS-aware transmission policy gates uplink updates based on an efficiency score that balances model novelty against instantaneous latency and energy costs. Locally, clients optimize an objective featuring a staleness-aware proximal term that dynamically adjusts the global anchor strength based on update age. Extensive experiments on multimodal vehicular datasets demonstrate that FedQoS achieves competitive personalized accuracy with only marginal performance loss compared to FedAvg, while substantially reducing QoS violations, cutting communication overhead by 76.7%, and lowering latency cost by 26.0%, demonstrating a highly favorable accuracy and efficiency balance for real-world vehicular deployments.&lt;/p&gt;</style></ABSTRACT><title><style face="normal" font="default" size="100%">QoS-Aware Federated Learning for Multimodal In-Cabin Interaction in Smart Vehicles</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rafał Gibała</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">An LLM-Guided Agentic Optimization Toolbox for Edge-Deployable Neural Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">35th ACM International Conference on Information and Knowledge Management</style></SECONDARY_TITLE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span style="-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);color:rgb(0, 0, 0);display:inline !important;float:none;font-family:"Helvetica Neue", Helvetica, Arial, sans-serif;font-size:12px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:400;letter-spacing:normal;orphans:2;text-align:left;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-transform:none;white-space:normal;widows:2;word-spacing:0px;"&gt;Deploying neural networks on resource-constrained edge devices is limited by severe envelopes on storage, memory, compute, and energy. Manual compression through pruning, weight clustering, and quantization can reduce footprint substantially, yet selecting an appropriate strategy and its hyperparameters remains a search-heavy process. In this paper, we present an automated Edge AI Optimization Toolbox that closes the loop between weight-distribution profiling, user-defined multi-objective preferences, and Large Language Model (LLM)-guided strategy synthesis for Neural Networks targeting edge export. Given a pretrained model, a calibration and evaluation dataset, and constraints on minimum accuracy together with maximum model size and RAM, the toolbox profiles layer-wise weight statistics, proposes a compression strategy among pruning, clustering, or their combination, always applies int8 quantization, re-evaluates the candidate, and iterates until the preferences are met or a maximum iteration budget is exhausted, returning either an ideal or closest-matching model. The approach is aligned with Green AI goals of reducing unnecessary computational and memory footprints at deployment time. On occupancy estimation models spanning MLP, CNN, LSTM, and public pretrained architectures, the toolbox reduces model size by roughly 72%-92% while largely preserving predictive quality. Inference latency significantly improves for several models, whereas energy and carbon impacts remain architecture-dependent under the current operator scope. These results show that preference-constrained, LLM-guided compression is an effective and promising path toward edge-deployable and resource-aware neural networks.&lt;/span&gt;&lt;/p&gt;</style></ABSTRACT><title><style face="normal" font="default" size="100%">An LLM-Guided Agentic Optimization Toolbox for Edge-Deployable Neural Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Baran Gül</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mert Nakip</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Nasser Jazdi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michael Weyrich</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energy- and QoS-Gated Federated Learning for Sustainable Wearable Stress Detection</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">35th ACM International Conference on Information and Knowledge Management</style></SECONDARY_TITLE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Federated Learning (FL) is increasingly deployed on battery-powered edge and wearable devices, where every communication round and local training step carries a direct energy and carbon cost. Most FL evaluations, however, still report predictive accuracy alone, leaving the environmental footprint of the learning process itself unmeasured. This paper presents a two-phase, QoS- and energy-gated FL approach, FedEQ, which restricts local training to moments when a client's sensing buffer and residual energy meet safety thresholds, and restricts transmission to updates whose novelty justifies their instantaneous latency and energy cost. We evaluate FedEQ on a federated stress-detection task built from the public WESAD dataset, benchmarking it against three established aggregation schemes: FedAvg, FedProx, and the adaptive server-side optimizer FedAdam. Beyond accuracy and F1, we report communication volume, wall-clock-measured compute energy (via CodeCarbon), analytically modeled communication energy, CO2eq emissions, and floating-point operations, averaged over five random seeds. FedAdam attains the highest raw accuracy of the four methods (93.2%) at the shortest horizon we test (20 rounds); FedEQ retains 97.0% of that accuracy at the same horizon while cutting communication volume by 63.9%, total energy and CO2eq by 68.9-69.7%, and FLOPs by 78.6% relative to all three baselines, for 2.7-3.2x higher accuracy-per-resource-unit (per MB, per Wh, and per gCO2eq) than the strongest competing method. We further show this accuracy gap is a short-horizon artifact rather than a fixed property of the method: extending training to 60 rounds closes it to within 0.5 points of the best baseline - and FedEQ overtakes FedAdam outright - while its communication savings simultaneously grow to 69.1%. Across the full range tested, FedEQ is the Pareto-dominant choice among the four once predictive performance and resource cost are considered jointly.&lt;/p&gt;</style></ABSTRACT><title><style face="normal" font="default" size="100%">Energy- and QoS-Gated Federated Learning for Sustainable Wearable Stress Detection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Biernacki</style></AUTHOR><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%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jarosław Flak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Caban</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pawlas</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analysis of web-based geo-visualization methods applied for Automated Guided Vehicle using Satellite Navigation Systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2022 IEEE International Conference on Big Data</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Osaka, Japan</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">12/2022</style></DATE><title><style face="normal" font="default" size="100%">Analysis of web-based geo-visualization methods applied for Automated Guided Vehicle using Satellite Navigation Systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">ZigBeeNet: Decrypted ZigBee IoT Network Traffic Dataset in Smart Home Environment</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Applied Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">23</style></ISSUE><SECTION><style face="normal" font="default" size="100%">10844</style></SECTION><DATE><style face="normal" font="default" size="100%">11/2024</style></DATE><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/2076-3417/14/23/10844</style></URL><title><style face="normal" font="default" size="100%">ZigBeeNet: Decrypted ZigBee IoT Network Traffic Dataset in Smart Home Environment</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Aygün Varol</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Kołodziej</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Romaszewski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Naser Motlagh</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mirka Leino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Johanna Virkki</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Enabling Cloud-Level Accuracy in Edge AI through IoT Data Preprocessing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Internet of Things Journal</style></SECONDARY_TITLE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Large language models (LLMs) offer a natural-language interface for interpreting Internet of Things (IoT) sensor data in smart environments; however, cloud deployment introduces latency, privacy, and connectivity concerns. Local LLMs can reduce these limitations, but compact edge-deployable models often show weaker numerical reasoning when raw sensor readings are provided directly. This paper investigates whether prompt-side preprocessing can improve the accuracy--latency trade-off of local LLMs for environmental monitoring. We propose a structured prompt construction framework that transforms raw air-quality and thermal-comfort measurements into progressively enriched textual representations: raw sensor values, threshold-aware descriptions, and compact environmental summary flags. The approach is evaluated using indoor Raspberry Pi/BME680 datasets from Tampere University and outdoor air-quality datasets from Helsinki, Katowice, and Warsaw. We construct a binary LLM query dataset covering air quality, thermal comfort, and joint environmental conditions, and evaluate five local and five cloud LLMs across three prompt variants and two inference modes, with and without chain-of-thought prompting. The results show that prompt enrichment substantially improves local-model accuracy. In No-CoT mode, local accuracy increases from 50.9\% to 81.7\% indoors and from 63.7\% to 89.3\% outdoors from the raw to the most enriched prompt. Local No-CoT inference is the fastest configuration, with mean latency close to 0.22 s, while CoT substantially increases inference time. These findings suggest that lightweight prompt-side preprocessing can narrow the local--cloud performance gap and support low-latency IoT analytics in smart environments.&lt;/p&gt;</style></ABSTRACT><title><style face="normal" font="default" size="100%">Enabling Cloud-Level Accuracy in Edge AI through IoT Data Preprocessing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Aygün Varol</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Kołodziej</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Romaszewski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Naser Motlagh</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mirka Leino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Johanna Virkki</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Enabling Cloud-Level Accuracy in Edge AI through IoT Data Preprocessing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">arXiv preprint arXiv </style></SECONDARY_TITLE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Large language models (LLMs) offer a natural-language interface for interpreting Internet of Things (IoT) sensor data in smart environments; however, cloud deployment introduces latency, privacy, and connectivity concerns. Local LLMs can reduce these limitations, but compact edge-deployable models often show weaker numerical reasoning when raw sensor readings are provided directly. This paper investigates whether prompt-side preprocessing can improve the accuracy--latency trade-off of local LLMs for environmental monitoring. We propose a structured prompt construction framework that transforms raw air-quality and thermal-comfort measurements into progressively enriched textual representations: raw sensor values, threshold-aware descriptions, and compact environmental summary flags. The approach is evaluated using indoor Raspberry Pi/BME680 datasets from Tampere University and outdoor air-quality datasets from Helsinki, Katowice, and Warsaw. We construct a binary LLM query dataset covering air quality, thermal comfort, and joint environmental conditions, and evaluate five local and five cloud LLMs across three prompt variants and two inference modes, with and without chain-of-thought prompting. The results show that prompt enrichment substantially improves local-model accuracy. In No-CoT mode, local accuracy increases from 50.9\% to 81.7\% indoors and from 63.7\% to 89.3\% outdoors from the raw to the most enriched prompt. Local No-CoT inference is the fastest configuration, with mean latency close to 0.22 s, while CoT substantially increases inference time. These findings suggest that lightweight prompt-side preprocessing can narrow the local--cloud performance gap and support low-latency IoT analytics in smart environments.&lt;/p&gt;</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2606.22496 </style></URL><title><style face="normal" font="default" size="100%">Enabling Cloud-Level Accuracy in Edge AI through IoT Data Preprocessing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Aygün Varol</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Kołodziej</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Romaszewski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Naser Motlagh</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mirka Leino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Johanna Virkki</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">AIRWISE: Environmental Sensor and LLM Query Dataset for Edge AI-Based Air-Quality and Thermal-Comfort Analytics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;AIRWISE is an open benchmark dataset for edge AI, IoT environmental monitoring, and large language model (LLM) evaluation on real sensor data. It combines indoor air-quality and thermal-comfort measurements, outdoor air-quality and meteorological time series, and a labeled binary question-answering benchmark for threshold-aware reasoning and anomaly detection. The dataset supports the study “Enabling Cloud-Level Accuracy in Edge AI through IoT Data Preprocessing”:&#160;https://doi.org/10.48550/arXiv.2606.22496&lt;br&gt;AIRWISE provides three core resources:&lt;br&gt;Indoor environmental sensor dataset (BME680, 1-minute resolution). 146,000+ minute-averaged readings from Raspberry Pi + Bosch BME680 nodes in three real micro-environments (office, kitchen, hallway) at Tampere, Finland (2025-11-14 to 2025-12-18): temperature, relative humidity, barometric pressure, gas resistance, indoor air quality (IAQ) proxy, z-score anomaly detectors, and limit-annotated long-format tables with ground-truth anomaly flags.&lt;br&gt;Outdoor air-quality and meteorological time series (hourly, full-year 2023). Helsinki (Finland), Katowice and Warsaw (Poland): NO₂, CO, O₃, PM₂.₅, temperature, and relative humidity assembled from national monitoring networks (FMI, GIOŚ, IMGW-PIB), as cleaned single-series city tables (≈8,760 hourly records per city) and limit-annotated long-format tables with anomaly flags.&lt;br&gt;Binary LLM query benchmark (1,440 labeled yes/no questions). 240 natural-language questions per site across six sites, balanced by task type (80 air quality, 80 thermal comfort, 80 joint environmental condition), each with ground-truth answer, violation label, offending factors, and rationale — ready for benchmarking local/edge and cloud LLMs on sensor-grounded reasoning.&lt;br&gt;Also included: reference air-quality and thermal-comfort limits (EU air-quality standards and Finnish/Polish national guidelines); the unmodified institutional source files for the outdoor component (FMI exports, GIOŚ archive workbooks and station metadata, IMGW-PIB synoptic tables); the complete dataset-generation scripts covering every pipeline step (raw sources → cleaned tables → limit-annotated data → LLM queries) with a requirements.txt for a verified minimal Python environment; SHA-256 checksums; and a dependency-free validation script. Schemas, exact row counts, coverage, and usage examples are documented in README.md and MANIFEST.md.&lt;/p&gt;</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://zenodo.org/doi/10.5281/zenodo.20783874 </style></URL><title><style face="normal" font="default" size="100%">AIRWISE: Environmental Sensor and LLM Query Dataset for Edge AI-Based Air-Quality and Thermal-Comfort Analytics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Sobczak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Why the Robot Said No: Knowledge-Graph-Grounded Explanations for LLM-Based Robot Planning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Semantic Web Conference (ISWC)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Bari, Italy</style></PLACE_PUBLISHED><title><style face="normal" font="default" size="100%">Why the Robot Said No: Knowledge-Graph-Grounded Explanations for LLM-Based Robot Planning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marzena Halama</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Strzoda</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Enhancing LoRa-based Outdoor Localization Accuracy Using Machine Learning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><DATE><style face="normal" font="default" size="100%">07/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Internet of Things is gaining significant relevance, driving increasing interest in location-&lt;br /&gt;&#13;
based services using wireless signals, particularly Low Power Wide Area Network (LPWAN) technology.&lt;br /&gt;&#13;
LoRa (Long Range), together with LoRaWAN, is a prominent LPWAN standard that provides long-range&lt;br /&gt;&#13;
connectivity and low energy consumption, making it viable for IoT-based positioning systems in smart&lt;br /&gt;&#13;
cities. For localization systems leveraging LoRa signals, Machine Learning (ML) approaches are being&lt;br /&gt;&#13;
increasingly explored, as ML-based solutions offer a powerful way to enhance the accuracy of positioning.&lt;br /&gt;&#13;
In this study, we propose various ML approaches for LoRa-based positioning in outdoor environments. We&lt;br /&gt;&#13;
evaluate six different ML models: k-NN, CNN, SVR, ANN, XG-Boost, and LightGBM-using an open-&lt;br /&gt;&#13;
source urban LoRaWAN dataset. We further propose a Hybrid Model that combines convolutional feature&lt;br /&gt;&#13;
extraction with gradient-boosted regression. This architecture integrates the strengths of deep learning and&lt;br /&gt;&#13;
tree-based models, aiming to capture both temporal signal patterns and structured input correlations for&lt;br /&gt;&#13;
improved localization accuracy. The models are trained offline and tested for performance in terms of&lt;br /&gt;&#13;
localization accuracy, mean square error, and computational efficiency. Additionally, we investigate the&lt;br /&gt;&#13;
impact of different Feature Vector (FV) subsets on localization performance by analyzing the significance of&lt;br /&gt;&#13;
LoRaWAN signal attributes. Our results highlight the effectiveness of ML models in enhancing localization&lt;br /&gt;&#13;
accuracy for LoRa-based outdoor positioning systems, demonstrating performance improvements ranging&lt;br /&gt;&#13;
from 10% to 73% compared to previous ML studies in outdoor localization.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/11080010</style></URL><title><style face="normal" font="default" size="100%">Enhancing LoRa-based Outdoor Localization Accuracy Using Machine Learning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Nur Kelesoglu</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Judging Turn-Taking Through a Monocultural Lens: A Parallel-Corpus Probe of Cultural Bias in LLMs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"> ACM International Conference on Multimodal Interaction (ICMI)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Naples, Italy</style></PLACE_PUBLISHED><DATE><style face="normal" font="default" size="100%">10/05/2026</style></DATE><URL><style face="normal" font="default" size="100%">https://dl.acm.org/doi/10.1145/3776591.3836647</style></URL><title><style face="normal" font="default" size="100%">Judging Turn-Taking Through a Monocultural Lens: A Parallel-Corpus Probe of Cultural Bias in LLMs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Wojciech Kempa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Rydarowska-Kurzbauer</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marzena Halama</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Elżbieta Smuda</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Maciej Biel</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Statistical and Econometric Analysis  of Selected Effects of COVID-19 Pandemic</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Multidisciplinary Aspects of Production Engineering </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">4</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><SECTION><style face="normal" font="default" size="100%">395</style></SECTION><DATE><style face="normal" font="default" size="100%">06/2021</style></DATE><title><style face="normal" font="default" size="100%">Statistical and Econometric Analysis  of Selected Effects of COVID-19 Pandemic</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marzena Halama</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Optimization for Pre-trained CNNs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SCIENCE TECHNOLOGY ENGINEERING MATHEMATICS</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Poznań, Polska</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">1st International Conference PUT STEM Day 2025: Book of Abstracts</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">01/2025</style></DATE><ISBN><style face="normal" font="default" size="100%">978-83-955437-7-7</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">Convolutional neural networks (CNNs) constitute a fundamental cornerstone of computer vision. With increasing complexity, the need for effective optimisation strategies remains crucial. Techniques such as transfer learning (TL), utilising pre-trained networks, enable the deployment of advanced models on mobile devices with limited computing capacity, including autonomous vehicles and educational applications. The study explores optimisation strategies for Keras models, focusing on the impact of different algorithms on performance and accuracy. The results demonstrate that appropriate optimiser selection enhances learning efficiency, mitigates overlearning, and supports accurate image recognition.</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://putpoznanpl-my.sharepoint.com/personal/stemday_put_poznan_pl/_layouts/15/onedrive.aspx?id=%2Fpersonal%2Fstemday%5Fput%5Fpoznan%5Fpl%2FDocuments%2FKN%20PUT%20STEM%2FStemDay%2FSTEM%20Day%202026%2FPUT%20STEM%20Day%202025%2F1st%20International%20Confe</style></URL><title><style face="normal" font="default" size="100%">Optimization for Pre-trained CNNs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marzena Halama</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Natalia Polańska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Bielik i GPT w analizie polskiego prawa karnego: wpływ RAG  i grafów wiedzy na jakość odpowiedzi</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Management and Digital Transformation</style></SECONDARY_TITLE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span style="font-family:"Times New Roman",serif;font-size:11.0pt;" lang="EN-US"&gt;Rozwój dużych modeli językowych stwarza nowe możliwości wspomagania wyszukiwania i analizy informacji prawnych. Problemem pozostaje ryzyko, że modele generują wiarygodnie brzmiące odpowiedzi, które nie mają podstaw w przepisach lub orzecznictwie, zwłaszcza gdy trzeba połączyć informacje z kilku źródeł prawnych. Celem badania było porównanie jakości odpowiedzi modeli językowych na pytania z zakresu polskiego prawa karnego z wykorzystaniem różnych sposobów dostępu do wiedzy zewnętrznej. Analizie poddano 4 warianty: model bez kontekstu; Retrieval-Augmented Generation (RAG) oparty na wyszukiwaniu wektorowym; rozwiązanie wykorzystujące graf wiedzy oraz architekturę hybrydową łączącą wyszukiwanie wektorowe i&#160;grafowe. Badanie obejmowało ocenę podobieństwa semantycznego i&#160;kompletności odpowiedzi, jakości wyszukiwania źródeł oraz zdolności do rozpoznawania braku informacji w&#160;korpusie. Szczególną uwagę poświęcono pytaniom wymagającym łączenia informacji pochodzących z wielu źródeł.&lt;/span&gt;&lt;/p&gt;</style></ABSTRACT><title><style face="normal" font="default" size="100%">Bielik i GPT w analizie polskiego prawa karnego: wpływ RAG  i grafów wiedzy na jakość odpowiedzi</style></title></RECORD></records></xml>
