Publikacje

Rok Autorzy Tytuł W Abstrakt Słowa kluczowe Cytowanie PN Link do publikacji
2020 M. Hajder, 
P. Hajder,
M. Nycz
Low-Cost Architecture of the Universal Security Threat Detection System for Industrial IoT Handbook of Wireless Sensor Networks: Issues and Challenges in Current Scenario's The chapter presents the new architecture of the distributed threat detection system for broadly understood information system security. Unlike existing systems, the system is heterogeneous in terms of information, communication, operation and hardware, architecturally using industrial Internet of Things solutions. Additionally, it is separated from the entity’s basic IT structure and based on the extensive use of parallel and distributed processing. In most of the available literature, improvements are sought in the way of wireless communication. In this work, the wired communication environment is examined, that is the backbone of any wireless sensor network. From the algorithmic point of view, it uses intelligent data analysis and biologically inspired methods. Communication environment is described using mainly graph theory, graph algebra and probability. The data collected by a heterogeneous group of autonomous traffic analyzers located at all levels of the communication hierarchy of the industrial information system is subjected to permanent analysis. Depending on the operating mode, the analyzers communicate with the central security node in one of three possible, complementary modes of transmission. Operating mode also determine how data is processed. In the simplest case it is carried out on the central node resources. On the other hand, in the most advanced one the system is in fact a parallel computer based on analyzers resources. The proposed architecture in the standard operating mode is integrated with the classic information system, in each of the emergency modes is separated from it. The work ends with the presentation of the empirical research results on the effectiveness of the proposed architecture. Industrial information system, Industrial networks, Self-adjusting communication architecture, Attack detection system, IDEF0 diagrams 

Hajder M., Hajder P., Nycz M. (2020) Low-Cost Architecture of the Universal Security Threat Detection System for Industrial IoT. In: Singh P., Bhargava B., Paprzycki M., Kaushal N., Hong WC. (eds) Handbook of Wireless Sensor Networks: Issues and Challenges in Current Scenario's. Advances in Intelligent Systems and Computing, vol 1132. Springer, Cham

RIS:
TY - CHAP
AU - Hajder, M.
AU - Hajder, P.
AU - Nycz, M.
ED - Singh, Pradeep Kumar
ED - Bhargava, Bharat K.
ED - Paprzycki, Marcin
ED - Kaushal, Narottam Chand
ED - Hong, Wei-Chiang
PY - 2020
DA - 2020//
TI - Low-Cost Architecture of the Universal Security Threat Detection System for Industrial IoT
BT - Handbook of Wireless Sensor Networks: Issues and Challenges in Current Scenario's
SP - 301
EP - 324
PB - Springer International Publishing
CY - Cham
SN - 978-3-030-40305-8
UR - https://doi.org/10.1007/978-3-030-40305-8_15
DO - 10.1007/978-3-030-40305-8_15
ID - Hajder2020
ER -

Link
2020 Hadaj P., Strzałka D. Modelling Selected Parameters of Power Grid Network in the South-Eastern Part of Poland: The Case Study Energies In this paper, a case study is conducted based on the real data obtained from the local Distribution System Operator (DSO) of electrical energy. The analyzed network represents connections and high-voltage switchgears of 110 kV. Selected graph parameters—vertex degree distribution, the average vertex degree, the graph density, network efficiency, the clustering coefficient, the average path length, and the graph diameter were examined, taking into account that in the analysis, some nodes were removed due to the different failures. For each failure, the possible effects on network parameters were tested. As a final result, it was shown that in the analyzed case, the removal of only five nodes could cause a significant (almost four times) fall of graph efficiency. In turn, this means that the whole analyzed network cannot be considered as a fault-tolerant. View Full-Text complex networks; network theory (graphs), systems interaction; power industry; power system security

P. Hadaj, D. Strzałka: Modelling Selected Parameters of Power Grid Network in the South-Eastern Part of Poland: The Case Study, Energies, vol. 13, p. 239, 2020

RIS:
TY - JOUR
AU - Hadaj, Piotr
AU - Strzalka, Dominik
PY - 2020
DA - 01.2020
TI - Modelling Selected Parameters of Power Grid Network in the South-Eastern Part of Poland: The Case Study
BT - Energies
SP - 239
EP -
VL - 13
DO - 10.3390/en13010239
ER -

BibTeX
@article{article,
author = {Hadaj, Piotr and Strza{\l}ka, Dominik},
year = {2020},
pages = {239},
title = {Modelling Selected Parameters of Power Grid Network in the South-Eastern Part of Poland: The Case Study},
volume = {13},
journal = {Energies},
doi = {10.3390/en13010239}
}

Link
2019 Paszkiewicz A., Iwaniec K. Evolutionary Approach Based on the Ising Model to Analyze Changes in the Structure of the IT Networks International Conference on Information Systems Architecture and Technology The paper presents a solution based on the Ising model considering the long-term nature of changes taking place in the network infrastructure. It takes into account the individual nature of separate nodes expressed through the parameter of their susceptibility to possible changes. This parameter directly affects the conviction of a given node about the need to change the state in which it is currently to another one, dominating in its environment. Thanks to the introduced modification of the algorithm, modeled processes occurring in IT networks are more peaceful and changes have an evolutionary character. Ising model, Complex networks, Social networks, Computer networks, IoT, IoE, Phase transitions

A. Paszkiewicz, K. Iwaniec: Evolutionary Approach Based on the Ising Model to Analyze Changes in the Structure of the IT Networks, Advances in Intelligent Systems and Computing: Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology – ISAT 2019, L. Borzemski et al. (Eds.), Springer International Publishing, ISBN: 978-3-030-30439-3, vol. 1050, pp. 48–57, 2020

LINK
2019 Hajder P., Rauch Ł., Nycz M., Hajder M. A Heterogeneous Parallel Processing System Based on Virtual Multi-Bus Connection Network Federated Conference on Computer Science and Information Systems This work presents organization, architecture and synthesis as well as analysis of the reconfigurable heterogeneous parallel processing system. Reconfiguration takes place on two levels of the connection network: physical and logical. For its implementation, passive multi-channel optical networks were used. Due to its dynamic nature, the system is designed to handle computational and communication load of an explosive nature and is addressed in the first place to the production sphere of economy. The dynamically combined connection network not only prevents traffic bursts, but also based on the physical and logical circuit commutation gives the possibility of adapting to the existing traffic pattern. Although the described solution is addressed to the optical transmission environment, its effective functioning in the Ethernet networks with circuit switching and partly in wireless networks has been confirmed empirically. The theoretical foundations were verified in the design and construction of a reconfigurable super-microcomputer and the intelligent system detection of attacks addressed to industrial Internet. multi-bus connection, reliability network, computer network traffic

Hajder P., Rauch Ł., Nycz M., Hajder M.: A Heterogeneous Parallel Processing System Based on Virtual Multi-Bus Connection Network, Applied Sciences, ACSIS, Vol. 19, pp. 9–17, DOI: 10.15439/2019F356

RIS:
TY - CONF
AU - Hajder, Piotr
AU - Rauch, Lukasz
AU - Nycz, Mariusz
AU - Hajder, Miroslaw

PY - 2019
DA - 2019//
TI - A Heterogeneous Parallel Processing System Based on Virtual Multi-Bus Connection Network
BT - Federated Conference on Computer Science and Information Systems
SP - 9
EP - 17
VL - 19
DO - 10.15439/2019F356
ER -

LINK
2019 Paszkiewicz A., Bolanowski M., Zapała P. Phase Transitions in Wireless MESH Networks and Their Application in Early Detection of Network Coherence Loss Applied Sciences The paper focuses on the phenomenon of phase transitions related to changes taking place directly in a network structure; i.e., in physical topology. Although these changes are related to the physical layer, they directly affect the functioning of higher layers, and thus the quality and efficiency of network transmission. The research presented herein was focused in particular on phase transformations in MESH type wireless topologies. The dependence between the values of radius (transmitter power) nodes and the coherence of the MESH network is presented. These considerations are important for understanding the dynamics of processes occurring in topological structures, and for optimizing the use of power sources for individual nodes. The paper also presents the use of phase transition analysis for early detection of network coherence loss at the physical layer level. A new mechanism for assessing the level of network communication and an active method of preventing its failure using the arbiter and a set of limited diagnostic information are described. The solution presented can be used both in Internet of Things (IoT) systems and Industry 4.0 to create a high level of reliability wireless connection infrastructure between mobile and fixed devices. wireless networks, MESH, phase transitions, transmitter power, IoT, Industry 4.0, network management, computer network

A. Paszkiewicz, M. Bolanowski, P. Zapała: Phase Transitions in Wireless MESH Networks and Their Application in Early Detection of Network Coherence Loss, Applied Sciences, 9(24), 5508, 2019

RIS:
TY - JOUR
AU - Paszkiewicz, Andrzej
AU - Bolanowski, Marek
AU - Zapała, Przemysław
PY - 2019
DA - 2019//
TI - Phase Transitions in Wireless MESH Networks and Their Application in Early Detection of Network Coherence Loss
BT - Applied Sciences
SP - 1
EP - 18
VL - 9
DO - 10.3390/app9245508
ER -

BibTeX
@article{article,
author = {Paszkiewicz, Andrzej and Bolanowski, Marek and Zapała, Przemysław},
year = {2019},
pages = {1-18},
title = {Phase Transitions in Wireless MESH Networks and Their Application in Early Detection of Network Coherence Loss},
volume = {9},
journal = {Applied Sciences},
doi = {10.3390/app9245508}
}

LINK
2019 Paszkiewicz A., Bolanowski M. Software for Integration of Manufacturing Resources in the Hybrid Cloud Model for Industry 4.0 Integrating Research and Practice in Software Engineering In the paper, the authors presented a new model of software development for the implementation of a service supporting the design and manufacturing process intended mainly for Industry 4.0. This model is based on distributed resources which integration and control occurs using centralized components. This approach has enabled the development of a hybrid cloud model that combines the advantages of centralized and distributed processing. Thanks to this, there is easy access to individual tools and devices used in the design and manufacturing process, which collection in one place is very limited or even impossible. The developed model guarantees many benefits. Among other things, it shortens the time necessary for the implementation of design and production tasks. This is done by controlling and coordinating partial tasks as well as assigning IT and production tools necessary for their implementation. Therefore, it is possible to ensure cooperation of independent components within broadly understood IoT infrastructure. Industry 4.0, Cloud computing, Distributed system, Hybrid cloud, IoE, Software development

A. Paszkiewicz, M. Bolanowski: Software for Integration of Manufacturing Resources in the Hybrid Cloud Model for Industry 4.0, Integrating Research and Practice in Software Engineering, Studies in Computational Intelligence, S. Jarząbek, A. Poniszewska-Marańda, L. Madeyski (Eds.), Springer International Publishing, vol. 851, pp. 223-236, 2020

RIS:
TY - CHAP
AU - Paszkiewicz, Andrzej
AU - Bolanowski, Marek
ED - Jarzabek, Stan
ED - Poniszewska-Marańda, Aneta
ED - Madeyski, Lech
PY - 2020
DA - 2020//
TI - Software for Integration of Manufacturing Resources in the Hybrid Cloud Model for Industry 4.0
BT - Integrating Research and Practice in Software Engineering
SP - 223
EP - 236
PB - Springer International Publishing
SN - 978-3-030-26574-8
UR - https://doi.org/10.1007/978-3-030-26574-8_16
DO - 10.1007/978-3-030-26574-8_16
ER -

BibTex
@Inbook{Paszkiewicz2020,
author="Paszkiewicz, Andrzej
and Bolanowski, Marek",
editor="Jarzabek, Stan
and Poniszewska-Maranda, Aneta
and Madeyski, Lech",
title="Software for Integration of Manufacturing Resources in the Hybrid Cloud Model for Industry 4.0",
bookTitle="Integrating Research and Practice in Software Engineering",
year="2020",
publisher="Springer International Publishing",
pages="223--236",
isbn="978-3-030-26574-8",
doi="10.1007/978-3-030-26574-8_16",
url="https://doi.org/10.1007/978-3-030-26574-8_16"
}

LINK
2019 Oleksy M., Budzik G., Bolanowski M., Paszkiewicz A. Cz. II. Uwarunkowania w obszarze technologii wytwarzania i architektury systemu informatycznego w przetwórstwie tworzyw polimerowych Polimery The article is the second part of the paper [1], which describes the possibilities of applying the Industry 4.0 concept in production processes related to the processing of polymer materials. In this part, the structure of the information system architecture has been analyzed, which can be used in the plastics processing. An architecture dedicated to complex industrial production systems based on the spiral life cycle of the product implemented in the Industry 4.0 structure has been proposed. The presented model is flexible, hence it is possible to use it both to create a completely new infrastructure, as well as to modernize and extend the existing infrastructure of the processing industry. Industry 4.0, processing of polymer materials, integrated IT systems.

M. Oleksy, G. Budzik, M. Bolanowski, A. Paszkiewicz: Przemysł 4.0. Cz. II. Uwarunkowania w obszarze technologii wytwarzania i architektury systemu informatycznego w przetwórstwie tworzyw polimerowych, Polimery, Vol. 64, nr 5, pp. 32-36, 2019, DOI: dx.doi.org/10.14314/polimery.2019.5.5

RIS:
TY - JOUR
AU - Oleksy, Mariusz
AU - Budzik, Grzegorz

AU - Paszkiewicz, Andrzej
AU - Bolanowski, Marek
PY - 2019
DA - 2019//
TI - Cz. II. Uwarunkowania w obszarze technologii wytwarzania i architektury systemu informatycznego w przetwórstwie tworzyw polimerowych
BT - Polimery
SP - 348
EP - 352
VL - 64
DO - 10.14314/polimery.2019.5.5
ER -

LINK
2019 Mazur D., Paszkiewicz A., Bolanowski M., Budzik G., Oleksy M. Analysis of possible SDN use in the rapid prototyping process as part of the Industry 4.0 Bulletin of the Polish Academy of Sciences: Technical Sciences The article refers to the idea of using the software defined network (SDN) as an effective hardware and software platform enabling the creation and dynamic management of distributed ICT infrastructure supporting the rapid prototyping process. The authors proposed a new layered reference model remote distributed rapid prototyping that allows the development of heterogeneous, open systems of rapid prototyping in a distributed environment. Next, the implementation of this model was presented in which the functioning of the bottom layers of the model is based on the SDN architecture. Laboratory tests were carried out for this implementation which allowed to verify the proposed model in the real environment, as well as determine its potential and possibilities for further development. Thus, the approach described in the paper may contribute to the development and improvement of the efficiency of rapid prototyping processes which individual components are located in remote industrial, research and development units. Thanks to this, it will be possible to better integrate production processes as well as optimize the costs associated with prototyping. The proposed solution is also a response in this regard to the needs of industry 4.0 in the area of creating scalable, controllable and reliable platforms. rapid prototyping, software-defined networking, industry 4.0, computer networks.

D. Mazur, A. Paszkiewicz, M. Bolanowski , G.Budzik, M. Oleksy: Analysis of possible SDN use in the rapid prototyping processas part of the Industry 4.0 . Bulletin of the Polish Academy of Sciences: Technical Sciences, 2019, Vol. 67, No. 1, pp. 21-30, DOI: 10.24425/bpas.2019.127334

RIS:
TY - JOUR
AU - Mazur, Damian
AU - Paszkiewicz, Andrzej
AU - Bolanowski, Marek
AU - Budzik, Grzegorz

AU - Oleksy, Mariusz

PY - 2019
DA - 2019//
TI - Analysis of possible SDN use in the rapid prototyping process as part of the Industry 4.0
BT - Bulletin of the Polish Academy of Sciences: Technical Sciences
SP - 21
EP - 30
VL - 67
DO - 10.24425/bpas.2019.127334
ER -

LINK
2019 Dymora P., Mazurek M. Anomaly Detection in IoT Communication Network Based on Spectral Analysis and Hurst Exponent Applied Sciences Internet traffic monitoring is a crucial task for the security and reliability of communication networks and Internet of Things (IoT) infrastructure. This description of the traffic statistics is used to detect traffic anomalies. Nowadays, intruders and cybercriminals use different techniques to bypass existing intrusion detection systems based on signature detection and anomalies. In order to more effectively detect new attacks, a model of anomaly detection using the Hurst exponent vector and the multifractal spectrum is proposed. It is shown that a multifractal analysis shows a sensitivity to any deviation of network traffic properties resulting from anomalies. Proposed traffic analysis methods can be ideal for protecting critical data and maintaining the continuity of internet services, including the IoT. IoT, anomaly detection, Hurst exponent, multifractal spectrums, TCP/IP, computer network traffic, communication security, Industry 4.0

Dymora P, Mazurek M. Anomaly Detection in IoT Communication Network Based on Spectral Analysis and Hurst Exponent. Applied Sciences. 2019; 9(24):5319

RIS:
TY - JOUR
AU - Dymora, Paweł
AU - Mazurek, Mirosław
PY - 2019
DA - 2019//
TI - Anomaly Detection in IoT Communication Network Based on Spectral Analysis and Hurst Exponent
BT - Applied Sciences
SP - 1
EP - 20
VL - 9
DO - 10.3390/app9245319
ER -

BibTeX
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw},
year = {2019},
pages = {1-20},
title = {Anomaly Detection in IoT Communication Network Based on Spectral Analysis and Hurst Exponent},
volume = {9},
journal = {Applied Sciences},
doi = {10.3390/app9245319}
}

LINK
2019 Dymora P., Niemiec K. Gamification as a Supportive Tool for School Children with Dyslexia Informatics Gamification, in its nature, combines not only games but also the whole psychological environment. Thanks to this, a properly prepared implementation of gameplaying can encourage people to compete with others and achieve the set tasks and goals. A person feels fulfilled that through his actions has performed a mission or reached a new level. It stimulates them to continue their activity and self-improvement to be better and beat their records. Its advantage is also that it does not have to be limited to one technology or method—it can be realized both through a simple scenario and a corkboard with results, it can also be embedded, e.g., in a virtual or augmented reality. This article focuses on the gamification of dyslexia, a common disorder of developmental disorders among pupils. It affects about 10%–15% of school-age children. The research narrowed the field of the study to one of the aspects of developmental dyslexia—dysorthography and making spelling mistakes by people affected by this disorder. This work aims to present an original application which is using gamification as a supportive tool for the learning of school children with diagnosed dyslexia. The conducted study was based on the implementation of original algorithms and scenarios of gamification on mobile devices, especially smartphones. School children are following a gamification approach for a specified period. As a conclusion, it can be stated that the proposed framework and gamification can help in the learning of people with dyslexia. gamification in learning, playful experiences, smartphone applications, immersive learning, dyslexia

Dymora, P., Niemiec, K. Gamification as a Supportive Tool for School Children with Dyslexia. Informatics 2019, 6, 48.

RIS:
TY - JOUR
AU - Dymora, Paweł
AU - Niemiec, Karol
PY - 2019
DA - 2019//
TI - Gamification as a Supportive Tool for School Children with Dyslexia
BT - Informatics
SP - 1
EP - 24
VL - 6
DO - 10.3390/informatics6040048
ER -

BibTeX
@article{article,
author = {Dymora, Pawel and Niemiec, Karol},
year = {2019},
pages = {1-24},
title = {Gamification as a Supportive Tool for School Children with Dyslexia},
volume = {6},
journal = {Informatics},
doi = {10.3390/informatics6040048}
}

LINK
2019 Dymora P., Koryl M., Mazurek M. Process Discovery in Business Process Management Optimization Information Appropriate business processes management (BPM) within an organization can help attain organizational goals. It is particularly important to effectively manage the lifecycle of these processes for organizational effectiveness in improving ever-growing performance and competitivity-building across the company. This paper presents a process discovery and how we can use it in a broader framework supporting self-organization in BPM. Process discovery is intrinsically associated with the process lifecycle. We have made a pre-evaluation of the usefulness of our facts using a generated log file. We also compared visualizations of the outcomes of our approach with different cases and showed performance characteristics of the cash loan sales process. business processes management (BPM), process discovery, BPMN, CMMN, process-aware information system, business process redesign (BPR)

Dymora, P., Koryl, M., Mazurek, M. Process Discovery in Business Process Management Optimization. Information 2019, 10, 270.

RIS:
TY - JOUR
AU - Dymora, Paweł
AU - Koryl, Maciej
AU - Mazurek, Mirosław
PY - 2019
DA - 2019//
TI - Process Discovery in Business Process Management Optimization
BT - Information
SP - 1
EP - 16
VL - 10
DO - 10.3390/info10090270
ER -

BibTeX
@article{article,
author = {Dymora, Pawel and Koryl, Maciej and Mazurek, Miroslaw},
year = {2019},
pages = {1-16},
title = {Process Discovery in Business Process Management Optimization},
volume = {10},
journal = {Information},
doi = {10.3390/info10090270}
}

LINK
2019 Koczkodaj W., Dymora P., Mazurek M., Strzałka D. Consistency-Driven Pairwise Comparisons Approach to Software Product Management and Quality Measurement DepCoS-RELCOMEX 2018: Contemporary Complex Systems and Their Dependability In this study, the software product quality measurement, based on the consistency-drive pairwise comparisons (PC) is proposed as a new way of approaching this complicated problem. The assessment of software quality (SQ) is a complex process. It is usually done by experts who use their knowledge and experience. Their subjective assessments certainly involve inaccuracy (which is difficult to control) and consistency of assessments (which can be measured and may influence accuracy). The inconsistency analysis, which is proposed in this approach, is used to improve assessments. Weights, reflecting the relative importance of the attributes, are computed as opposed to the commonly practiced arbitrary assignment. The PC method allows to define a consistency measure and use it as a validation technique. A consistency-driven knowledge acquisition, supported by a properly designed software, contributes to the improvement of quality of knowledge-based systems. Software quality, Pairwise comparison, Complex system, Concluder

Koczkodaj W., Dymora P., Mazurek M.. Strzałka D., Consistency-Driven Pairwise Comparisons Approach to Software Product Management and Quality Measurement, DepCoS-RELCOMEX 2018: Contemporary Complex Systems and Their Dependability, pp 292-305, 2019

RIS:
TY - CONF
AU - Koczkodaj, Waldemar W.
AU - Dymora, Paweł
AU - Mazurek, Mirosław
AU - Strzałka, Dominik
PY - 2019
DA - 2019//
TI - Consistency-Driven Pairwise Comparisons Approach to Software Product Management and Quality Measurement
BT - Contemporary Complex Systems and Their Dependability
SP - 292
EP - 305
PB - Springer International Publishing
SN - 978-3-319-91446-6
ID - 10.1007/978-3-319-91446-6_28
ER -

BibTeX:
@InProceedings{10.1007/978-3-319-91446-6_28,
author="Koczkodaj, Waldemar W.
and Dymora, Pawel
and Mazurek, Miroslaw
and Strzalka, Dominik",
title="Consistency-Driven Pairwise Comparisons Approach to Software Product Management and Quality Measurement",
booktitle="Contemporary Complex Systems and Their Dependability",
year="2019",
publisher="Springer International Publishing",
pages="292--305",
isbn="978-3-319-91446-6"
}

LINK
2019 Borkowski M., Moldovan I.M. On rank-deficiency in direct Trefftz method for 2D Laplace problems Engineering Analysis with Boundary Elements The application of the direct Trefftz method to the solution of Laplace equation defined on a 2D domain is frequently hindered by the numerical instability of the solving system, which may become ill-conditioned or even rank-deficient. Ill-conditioning is typically caused by a lack of domain scaling or by the oscillatory nature of the functions included in the weighting basis. Conversely, rank-deficiency may occur even for scaled domains and for low-order weighting bases. Its causes are related to the regularity properties of the weighting functions and to a lack of completeness of the weighting basis. The objective of this paper is to contribute to a better understanding of the mathematical grounds of rank-deficiency, and of its sensitivity to the definition of the referential and the (over-)determination of the basis. It shows that, while frequent, rank-deficiency can be avoided by slightly skewing the referential and by meshing the boundary such as to ensure that the basis is complete. Direct Trefftz method, Rank-deficiency, 2D potential problem

Borkowski M, Moldovan I.M., On rank-deficiency in direct Trefftz method for 2D Laplace problems. Engineering Analysis with Boundary Elements. 2019, vol. 106, pp. 102-115

RIS:
TY - JOUR
AU - Borkowski, Mariusz
AU - Moldovan, Ionut
PY - 2019/09/01
SP - 102
EP - 115
T1 - On rank-deficiency in direct Trefftz method for 2D Laplace problems
VL - 106
DO - 10.1016/j.enganabound.2019.05.003
JO - Engineering Analysis with Boundary Elements
ER -

BibTeX:
@article{article,
author = {Borkowski, Mariusz and Moldovan, Ionut},
year = {2019},
month = {09},
pages = {102-115},
title = {On rank-deficiency in direct Trefftz method for 2D Laplace problems},
volume = {106},
journal = {Engineering Analysis with Boundary Elements},
doi = {10.1016/j.enganabound.2019.05.003}
}

LINK
2019 Strzałka D., Mazurek M., Zabrodskii P., Masiak J., Koczkodaj W. Massive health record breaches evidenced by the office for civil rights data Iranian Journal of Public Health Using data collected by the Office for Civil Rights, Department of Health and Human Services (HHS), over half of the population in the USA might have been affected by security breaches since Oct 2009. This study provided analysis of the data, presenting the numbers of individuals affected in one breach and the number of breaches. Health, Civil rights, Health data breaches

Strzałka D., Mazurek M., Zabrodskii P., Masiak J., Koczkodaj W. Massive health record breaches evidenced by the office for civil rights data. Iranian Journal of Public Health. 2019, vol. 48, No. 2, pp. 278-288

RIS: TY - JOUR
AU - Koczkodaj, Waldemar
AU - Jolanta, Masiak
AU - Mazurek, Miroslaw
AU - Strzalka, Dominik
AU - Zabrodskii, P.F.
PY - 2019/02/01
SP - 278
EP - 288
T1 - Massive Health Record Breaches Evidenced by the Office for Civil Rights Data
VL - 48
DO - 10.18502/ijph.v48i2.826
JO - Iranian Journal of Public Health
ER -

BibTeX
@article{article,
author = {Koczkodaj, Waldemar and Jolanta, Masiak and Mazurek, Miroslaw and Strzalka, Dominik and Zabrodskii, P.F.},
year = {2019},
month = {02},
pages = {278-288},
title = {Massive Health Record Breaches Evidenced by the Office for Civil Rights Data},
volume = {48},
journal = {Iranian Journal of Public Health},
doi = {10.18502/ijph.v48i2.826}
}

LINK
2019 Borkowski M., Kuras R. Application of conformal mappings and the numerical analysis of conditioning of the matrices in Trefftz method for some boundary value problems Engineering Analysis with Boundary Elements Provided that the boundary value problem can be equivalently solved in conformally transformed domain, one can consider its mapping into unit disk domain. The problem can be solved for the new geometry and the solution can be retransformed back to the original problem domain. The paper presents this approach in order to validate whether it can be applied for improving ill-conditioning of the matrices and solutions obtained in indirect Trefftz methods. Trefftz methods, Conformal mapping, 2D potential problem, Ill-conditioning

Borkowski M., Kuras R. Application of conformal mappings and the numerical analysis of conditioning of the matrices in Trefftz method for some boundary value problems. Engineering Analysis with Boundary Elements. 2018, vol. 98, pp. 1-7

RIS:
TY - JOUR
AU - Borkowski, M.
AU - Kuras, Romuald
PY - 2019/01/01
SP - 1
EP - 7
T1 - Application of conformal mappings and the numerical analysis of conditioning of the matrices in Trefftz method for some boundary value problems
VL - 98
DO - 10.1016/j.enganabound.2018.09.010
JO - Engineering Analysis with Boundary Elements
ER -

BibTeX
@article{article,
author = {Borkowski, Mariusz and Kuras, Romuald},
year = {2019},
month = {01},
pages = {1-7},
title = {Application of conformal mappings and the numerical analysis of conditioning of the matrices in Trefftz method for some boundary value problems},
volume = {98},
journal = {Engineering Analysis with Boundary Elements},
doi = {10.1016/j.enganabound.2018.09.010}
}

LINK
2019 Koczkodaj W., Mazurek M., Strzałka D., Wolny-Dolniak A., Woodbury-Smith M. Electronic health record breaches as social indicators Social Indicators Research This study presents compelling social indicators of such magnitude that they cannot be ignored. The statistical evidence shows that data breaches of electronic health records have taken place at an unprecedented scale. Currently, the number of individuals affected, as regulations of Health Insurance Portability and Accountability Act refers to us, has surpassed the half of the US population (some data is breached several times lowering the number of victims but increasing the possibility of being sold quickly). The data breaches are recorded and posted by Department of Health and Human Services. Security breach, Office for Civil Rights, Departament of Health and Human Services

Koczkodaj W., Mazurek M., Strzałka D., Wolny-Dolniak A., Woodbury-Smith M. Electronic health record breaches as social indicators. Social Indicators Research, 2019, vol. 141 (2), pp. 861-871

RIS:
TY - JOUR
AU - Koczkodaj Waldemar
AU - Mazurek, Miroslaw
AU - Strzalka, Dominik
AU - Wolny-Dominiak, Alicja
AU - Woodbury-Smith, Marc
PY - 2019/01/01
SP - 861
EP - 871
T1 - Electronic Health Record Breaches as Social Indicators
VL - 141
DO - 10.1007/s11205-018-1837-z
JO - Social Indicators Research
ER -

BibTeX
@article{article,
author = {Koczkodaj, Waldemar and Mazurek, Miroslaw and Strzalka, Dominik and Wolny-Dominiak, Alicja and Woodbury-Smith, Marc},
year = {2019},
month = {01},
pages = {861-871},
title = {Electronic Health Record Breaches as Social Indicators},
volume = {141},
journal = {Social Indicators Research},
doi = {10.1007/s11205-018-1837-z}
}

LINK
2019 Dymora P., Mazurek M., Kowal B. Dydaktyczne aspekty projektowania aplikacji w środowisku Unity 3D EDUKACJA - TECHNIKA - INFORMATYKA W artykule przedstawiono zagadnienia związane z etapami tworzenia aplikacji i gier z prze-znaczeniem do wykorzystania w edukacji w oparciu o silnik gier Unity. Skupiono się na możliwościach, jakie daje ten silnik, opisano proces tworzenia prostych gier oraz wykorzystania technologii VR. Zagadnienia te mogą mieć szerokie zastosowanie w procesie dydaktyki przedmiotów informatycznych, szkoleniach itp. W szczególności tematyka odpowiada aktualnym wyzwaniom jak np. Przemysł 4.0. Unity, Unreal, silnik gier, grafika generowana komputerowo, Przemysł 4.0

Dymora P., Mazurek M., Kowal B., Dydaktyczne aspekty projektowania aplikacji w środowisku Unity 3D, Edukacja – Technika – Informatyka, No 1/27/2019, 2019 pp. 185-193, DOI: 10.15584/eti.2019.1.24

RIS:
TY - JOUR
AU - Dymora, Paweł
AU - Mazurek, Mirosław
AU - Kowal, Bartosz
PY - 2019/01/01
SP - 185
EP - 193
T1 - Dydaktyczne aspekty projektowania aplikacji w środowisku Unity 3D
VL - 27
DO - 10.15584/eti.2019.1.24
ER -

BibTeX
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Kowal, Bartosz},
year = {2019},
month = {01},
pages = {185-193},
title = {Dydaktyczne aspekty projektowania aplikacji w srodowisku Unity 3D},
volume = {27},
doi = {10.15584/eti.2019.1.24}
}

LINK
2018 Brański A., Prędka E. Nonsingular Meshless Method in an Acoustic Indoor Problem Archives of Acoustics An efficiency of the nonsingular meshless method is analyzed in an acoustic indoor problem. The solution is assumed in the form of the series of radial bases functions. The Hardy’s multiquadratic functions, as the bases, are taken into account. The room acoustic field with uniform, impedance walls is considered. The representative, rectangular cross section of the room is chosen. Practical combinations of acoustic boundary conditions, expressed through absorption coefficient values, are considered. The classical formulation of the boundary problem is used. It is established any coefficient in the multiquadratic functions depend on the number of influence points, the frequency and the absorption coefficient. All approximate results are calculated in relation to the exact ones. This way, it is proved that the meshless method based on the multiquadratic functions is simple and efficient method in the description of the complicated acoustic boundary problems for the low and medium ranges of frequency. architectural acoustics, meshless method; radial bases functions, impedance boundary condition

Brański A., Prędka E. Nonsingular Meshless Method in an Acoustic Indoor Problem. Archives of Acoustics. 2018, vol. 43, No. 1, pp. 75-82

RIS:
TY - JOUR
AU - Branski, Adam
AU - Predka, Edyta
PY - 2018/01/01
SP - 75
EP - 82
T1 - Nonsingular meshless method in an acoustic indoor problem
VL - 43
DO - 10.24425/118082
JO - Archives of Acoustics
ER -

BibTeX
@article{article,
author = {Branski, Adam and Predka, Edyta},
year = {2018},
month = {01},
pages = {75-82},
title = {Nonsingular meshless method in an acoustic indoor problem},
volume = {43},
journal = {Archives of Acoustics},
doi = {10.24425/118082}
}

LINK
2018 Brański A., Kocan-Krawczyk A. A Rough Estimation of Acoustics of the Cuboidal Room with Impedance Walls Archives of Acoustics The cuboidal room acoustics field is modelled with the Fourier method. A combination of uniform, impedance boundary conditions imposed on walls is assumed, and they are expressed by absorption coefficient values. The absorption coefficient, in the full range of its values in the discrete form, is considered. With above assumptions, the formula for a rough estimation of the cuboidal room acoustics is derived. This approximate formula expresses the mean sound pressure level as a function of the absorption coefficient, frequency, and volume of the room separately. It is derived based on the least-squares approximation theory and it is a novelty in the cuboidal room acoustics. Theoretical considerations are illustrated via numerical calculations performed for the 3D acoustic problem. Quantitative results received with the help of the approximate formula may be a point of reference to the numerical calculations. Fourier analysis, room acoustics, absorption coefficient, boundary-value problem, impedance boundary conditions

Brański A., Kocan-Krawczyk A. A Rough Estimation of Acoustics of the Cuboidal Room with Impedance Walls. Archives of Acoustics. 2018, vol. 43, No. 2, pp. 227-233

RIS:
TY - JOUR
AU - Kocan-Krawczyk, Anna
AU - Branski, Adam
PY - 2018/01/01
SP - 227
EP - 233
T1 - A rough estimation of acoustics of the cuboidal room with impedance walls
VL - 43
DO - 10.24425/122370
JO - Archives of Acoustics
ER -

BibTeX
@article{article,
author = {Kocan-Krawczyk, Anna and Branski, Adam},
year = {2018},
month = {01},
pages = {227-233},
title = {A rough estimation of acoustics of the cuboidal room with impedance walls},
volume = {43},
journal = {Archives of Acoustics},
doi = {10.24425/122370}
}

LINK
2018 Dymora P., Mazurek M., Koryl M. Odkrywanie procesów po stronie klienta za pomocą dziennika API systemu centralnego Elektronika : konstrukcje, technologie, zastosowania Powszechnym podejściem budowania systemów informatycznych spełniających złożone wymagania współczesnych użytkowników korporacyjnych jest rozproszenie tradycyjnych systemów monolitycznych na zestaw wielu różnorodnych usług połączonych przez API. środowisko finansowe, zwłaszcza bankowe, nadal jest przykładem "dinozaurów", w których główną rolę odgrywają systemy scentralizowane, ale nawet tam coraz częściej pojawia się dystrybucja przetwarzania danych. Wiedza o procesach zachodzących w firmie, tradycyjnie zakodowana w silnikach workflow, instrukcjach biurowych czy umysłach pracowników, jest teraz "gdzieś" rozproszona i nowo pojawiającym wyzwaniem jest aby ją uchwycić. Proponowane podejście opiera się na logach, które są zwykle tworzone podczas wywołań API. Wiedza ukryta w takich dziennikach może zostać ujawniona i uwidoczniona za pomocą techniki odkrywania procesów. Podano przykład rzeczywistego przedsiębiorstwa finansowego, a wyniki odkrywania procesów przebadano i porównywano z wiedzą dziedzinową. odkrywanie procesów, System informacyjny zorientowane na procesy (PAIS)

Dymora P., Mazurek M., Koryl M. Odkrywanie procesów po stronie klienta za pomocą dziennika API systemu centralnego. Elektronika : konstrukcje, technologie, zastosowania. 2018, vol. 59, No. 10, pp. 18-20

RIS:
TY - JOUR
AU - Koryl, Maciej
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2018/10/05
SP - 18
EP - 20
T1 - Odkrywanie procesów po stronie klienta za pomocą dziennika API systemu centralnego
VL - 59
DO - 10.15199/13.2018.10.4
JO - Elektronika - konstrukcje, technologie, zastosowania
ER -

BibTeX
@article{article,
author = {Koryl, Maciej and Dymora, Pawel and Mazurek, Miroslaw},
year = {2018},
month = {10},
pages = {18-20},
title = {Odkrywanie procesów po stronie klienta za pomocą dziennika API systemu centralnego},
volume = {59},
journal = {Elektronika - konstrukcje, technologie, zastosowania},
doi = {10.15199/13.2018.10.4}
}

LINK
2018 Dymora P., Mazurek M. Pairwise comparisons in IT system security analysis Elektronika : konstrukcje, technologie, zastosowania The article presents a pairwise comparison method for assessing the security of an IT system. A new approach to the assessment of inconsistencies of parameters and their mutual relations was applied. The main system security criteria and the process of their analysis in the Concluder program were determined. The proposed solution allows to locate the inconsistency of the adopted model. Pair comparison method is one of the most amazing solutions to help solve difficult problems. data security, audit, inconsistency

Dymora P., Mazurek M. Pairwise comparisons in IT system security analysis. Elektronika : konstrukcje, technologie, zastosowania. 2018, vol. 59, No. 10, pp. 24-26

RIS:
TY - JOUR
AU - Mazurek, Miroslaw
AU - Dymora, Pawel
PY - 2018/10/05
SP - 24
EP - 26
T1 - Pairwise comparisons in IT system security analysis
VL - 59
DO - 10.15199/13.2018.10.6
JO - Elektronika - konstrukcje, technologie, zastosowania
ER -

BibTeX
@article{article,
author = {Mazurek, Miroslaw and Dymora, Pawel},
year = {2018},
month = {10},
pages = {24-26},
title = {Pairwise comparisons in IT system security analysis},
volume = {59},
journal = {Elektronika - konstrukcje, technologie, zastosowania},
doi = {10.15199/13.2018.10.6}
}

LINK
2018 Bolanowski M., Paszkiewicz A. Detekcja anomalii w systemach autonomicznych Internetu Rzeczy Elektronika : konstrukcje, technologie, zastosowania Internet Rzeczny obejmuje swoim zasięgiem coraz większą grupę urządzeń. Wielu producentów sprzętu, którzy do tej pory nie oferowali wbudowanych interfejsów sieciowych zaczyna je implementować w swoich systemach. Brak specjalizacji w tym zakresie oraz traktowanie systemów komunikacyjnych jako dodatku funkcjonalnego powoduje, że elementy Internetu Rzeczy stają się coraz bardziej podatne na zagrożenia i awarie. W artykule zaproponowano podejście do detekcji anomalii dla grupy elementów tworzących System Autonomiczny Internetu Rzeczy (SAIR). Zaproponowano model detekcji anomalii bazujący na podejściu scentralizowanym dedykowanym dla pojedynczego systemu SAIR. Internet Rzeczy, detekcja anomalii, sieci komputerowe, systemy autonomiczne

Bolanowski M., Paszkiewicz A. Detekcja anomalii w systemach autonomicznych Internetu Rzeczy. Elektronika : konstrukcje, technologie, zastosowania. 2018, vol. 59, No. 10, pp. 14-17

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
PY - 2018/10/05
SP - 14
EP - 17
T1 - Detekcja anomalii w systemach autonomicznych Internetu Rzeczy
VL - 59
DO - 10.15199/13.2018.10.3
JO - Elektronika - konstrukcje, technologie, zastosowania
ER -


BibTeX
@article{article,
author = {Bolanowski, Marek},
year = {2018},
month = {10},
pages = {14-17},
title = {Detekcja anomalii w systemach autonomicznych Internetu Rzeczy},
volume = {59},
journal = {Elektronika - konstrukcje, technologie, zastosowania},
doi = {10.15199/13.2018.10.3}
}

LINK
2018 Paszkiewicz A., Zapała P. The modified metric for self-organization wireless MESH networks ITM Web of Conferences This paper concerns the modified metrics for MESH wireless networks. This metric is important when a specific data transmission path is being chosen. The parameters regarding the connection quality and overload are introduced in it. Therefore, the proposed metric takes a closer look at changing conditions of the wireless environment and contributes to a better self-organization functioning of this type of network. Its importance increases for networks characterized by the transmission of converged traffic. The paper also presents the results of a simulation showing the dependence of metric values on transmission parameters for selected wireless transmission technologies.

Paszkiewicz A., Zapała P. The modified metric for self-organization wireless MESH networks. ITM Web of Conferences. 2018, vol. 21, pp. 1-9

RIS:
TY - JOUR
AU - Paszkiewicz, Andrzej
AU - Zapala, Przemyslaw
PY - 2018/01/01
SP - 1
EP - 9
T1 - The modified metric for self-organization wireless MESH networks
VL - 21
DO - 10.1051/itmconf/20182100010
JO - ITM Web of Conferences
ER -

BibTeX
@article{article,
author = {Paszkiewicz, Andrzej and Zapala, Przemyslaw},
year = {2018},
month = {01},
pages = {1-9},
title = {The modified metric for self-organization wireless MESH networks},
volume = {21},
journal = {ITM Web of Conferences},
doi = {10.1051/itmconf/20182100010}
}

LINK
2018 Paszkiewicz A.  The use of the power law designing wireless networks ITM Web of Conferences The paper concerns the use of the scale-free networks theory and the power law in designing wireless networks. An approach based on generating random networks as well as on the classic Barabási-Albert algorithm were presented. The paper presents a new approach taking the limited resources for wireless networks into account, such as available bandwidth. In addition, thanks to the introduction of opportunities for dynamic node removal it was possible to realign processes occurring in wireless networks. After introduction of these modifications, the obtained results were analyzed in terms of a power law and the degree distribution of each node.

Paszkiewicz A.  The use of the power law designing wireless networks. ITM Web of Conferences. 2018, vol. 21, pp. 1-7

RIS:
TY - JOUR
AU - Paszkiewicz, Andrzej
PY - 2018/01/01
SP - 1
EP - 7
T1 - The use of the power law for designing wireless networks
VL - 21
DO - 10.1051/itmconf/20182100012
JO - ITM Web of Conferences
ER -

BibTeX
@article{article,
author = {Paszkiewicz, Andrzej},
year = {2018},
month = {01},
pages = {1-7},
title = {The use of the power law for designing wireless networks},
volume = {21},
journal = {ITM Web of Conferences},
doi = {10.1051/itmconf/20182100012}
}

LINK
2018 Mazurek M., Dymora P., Kowal B. Open data - an introduction to the issue ITM Web of Conferences Rapidly developing of internet technologies and digitalization of government generate more and more data. Databases from various public institutions and private sectors, e.g. in the fields of economics, transport, environment and public safety are publishing in the global Internet network, so that any user can browse them without additional charges. Most of this data is published on the open data portals. Open data - that is, “open”, public data can allow the processing and analysis of information contained in them completely free of charge. This article is an introduction to a fairly new area of issues such as “open data” or “open government”, presents the main mechanisms of accessing to data in public open data portals and also propose a conceptual open data/government model.

Mazurek M., Dymora P., Kowal B. Open data - an introduction to the issue. ITM Web of Conferences. 2018, vol. 21, pp. 1-13

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Kowal, Bartosz
PY - 2018/01/01
SP - 1
EP - 13
T1 - Open data – an introduction to the issue
VL - 21
DO - 10.1051/itmconf/20182100017
JO - ITM Web of Conferences
ER -

BibTeX
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Kowal, Bartosz},
year = {2018},
month = {01},
pages = {1-13},
title = {Open data – an introduction to the issue},
volume = {21},
journal = {ITM Web of Conferences},
doi = {10.1051/itmconf/20182100017}
}

LINK
2018 Dymora P., Mazurek M., Strzałka D. Multifractal analysis of selected multicas routing protocols in IP Networks ITM Web of Conferences The article presents results of studies using simulations on computer network devices, designed to examine the effectiveness of routing protocols with the video streaming and generated traffic for Jperf applications. In order to demonstrate the effectiveness of the selected protocols several simulation scenarios were made using different sized UDP packets. The traffic was analyzed in terms of statistical self-similarity. Multifractal analysis has also been made, using two kinds of spectrums. The study determined the relationship between them. These tasks were designed to determine the multifractal and long-term relationship for a given process.

Dymora P., Mazurek M., Strzałka D. Multifractal analysis of selected multicas routing protocols in IP Networks. ITM Web of Conferences. 2018, vol. 21, pp. 1-14

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Strzalka, Dominik
PY - 2018/01/01
SP - 1
EP - 14
T1 - Multifractal Analysis Of Selected Multicast Routing Protocols In IP Networks
VL - 21
DO - 10.1051/itmconf/20182100016
JO - ITM Web of Conferences
ER -

BibTeX
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Strzalka, Dominik},
year = {2018},
month = {01},
pages = {1-14},
title = {Multifractal Analysis Of Selected Multicast Routing Protocols In IP Networks},
volume = {21},
journal = {ITM Web of Conferences},
doi = {10.1051/itmconf/20182100016}
}

LINK
2018 Bolanowski M., Cisło P. The possibility of using LACP protocol in anomaly detection systems ITM Web of Conferences This article presents the use of the Link Aggregation Control Protocol (LACP) for detection of anomalies in network traffic. The idea itself is based on checking the representativeness of a single LACP link for the whole traffic transmitted by the aggregation. This approach allows to reduce the requirements for the performance of threat detection systems, and thus reduce their implementation costs and the gives a possibility of using probes (IDS or IPS) directly in the core of the network. The authors also examine the influence of hashing algorithms used for the particular LACP link on the possibility of using of developed method and on the level of intrusion detection.

Bolanowski M., Cisło P. The possibility of using LACP protocol in anomaly detection systems. ITM Web of Conferences. 2018, vol. 21, pp. 1-8

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Cislo, Piotr
PY - 2018/01/01
SP - 1
EP - 8
T1 - The possibility of using LACP protocol in anomaly detection systems
VL - 21
DO - 10.1051/itmconf/20182100014
JO - ITM Web of Conferences
ER -

BibTeX
@article{article,
author = {Bolanowski, Marek and Cislo, Piotr},
year = {2018},
month = {01},
pages = {1-18},
title = {The possibility of using LACP protocol in anomaly detection systems},
volume = {21},
journal = {ITM Web of Conferences},
doi = {10.1051/itmconf/20182100014}
}

LINK
2018 Bolanowski M., Byczek T. Measure  and  compare  the  convergence  time  of network routing protocols ITM Web of Conferences Currently, IT systems require more and more reliability. It can be guaranteed only by using redundancy both in the connectivity and network devices. The authors attempted to measure the convergence time for EIGRP and OSPF routing protocols after link or network nodes failure. Research have been conducted with the real devices and hardware traffic generator. In case of both protocols, failures have been simulated in various places in the network topology. On this basis, time in which tested protocol restored full connectivity for a specific topology with backup links have been precisely determined. Knowledge of the time required to restore the network after a failure can be useful during designing services based on networks with implemented routing. This can improve a tolerance of connectivity interruptions.

Bolanowski M., Byczek T. Measure  and  compare  the  convergence  time  of network routing protocols. ITM Web of Conferences. 2018, vol. 21, pp. 1-9

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Byczek, Tomasz
PY - 2018/01/01
SP - 1
EP - 9
T1 - Measure and compare the convergence time of network routing protocols
VL - 21
DO - 10.1051/itmconf/20182100013
JO - ITM Web of Conferences
ER -

BibTeX
@article{article,
author = {Bolanowski, Marek and Byczek, Tomasz},
year = {2018},
month = {01},
pages = {1-9},
title = {Measure and compare the convergence time of network routing protocols},
volume = {21},
journal = {ITM Web of Conferences},
doi = {10.1051/itmconf/20182100013}
}

LINK
2018 Strzałka D., Dymora P., Mazurek M. Modified stretched exponential model of computer system resources management limitations-The case of cache memory Physica A-Statistical Mechanics and its Applications In this paper we present some preliminary results in the field of computer systems management with relation to Tsallis thermostatistics and the ubiquitous problem of hardware limited resources. In the case of systems with non-deterministic behaviour, management of their resources is a key point that guarantees theirs acceptable performance and proper working. This is very wide problem that stands for many challenges in financial, transport, water and food, health, etc. areas. We focus on computer systems with attention paid to cache memory and propose to use an analytical model that is able to connect non-extensive entropy formalism, long-range dependencies, management of system resources and queuing theory. Obtained analytical results are related to the practical experiment showing interesting and valuable results. Complex systems, Computer systems performance, Interaction, Management of system resources, Stretched exponential

Strzałka D., Dymora P., Mazurek M. Modified stretched exponential model of computer system resources management limitations-The case of cache memory. Physica A-Statistical Mechanics and its Applications. 2018, vol. 491, pp. 490-497

RIS:
TY - JOUR
AU - Strzalka, Dominik
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2018/02/01
SP - 490
EP - 497
T1 - Modified stretched exponential model of computer system resources management limitations—The case of cache memory
VL - 491
DO - 10.1016/j.physa.2017.09.012
JO - Physica A: Statistical Mechanics and its Applications
ER -

BibTeX
@article{article,
author = {Strzalka, Dominik and Dymora, Pawel and Mazurek, Miroslaw},
year = {2018},
month = {02},
pages = {490-497},
title = {Modified stretched exponential model of computer system resources management limitations—The case of cache memory},
volume = {491},
journal = {Physica A: Statistical Mechanics and its Applications},
doi = {10.1016/j.physa.2017.09.012}
}

LINK
2018 Bolanowski M., Paszkiewicz A., Oleksy M., Budzik G., Sanocka-Zajdel A., Oliwa R., Mazur Ł. Industry 4.0 Part I.Selected applications in processing of polymer materials Polimery Examples of applications of the Industry 4.0 concept in manufacturing operations connected with processing of polymer materials were presented. Implementation of Industry 4.0 structure aims at increasing the speed of manufacturing with simultaneous decrease in the number of defective products. Such results are enabled by the use of integrated information systems coupled with automated manufacturing and quality control processes. On the basis of literature and own experience, it was found that the processing industry requires the use of such integrated systems, and further improvement of competitiveness will be difficult to achieve without implementing the developed Industry 4.0 concepts. Industry 4.0, processing of polymer materials, integrated information systems

Bolanowski M., Paszkiewicz A., Oleksy M., Budzik G., Sanocka-Zajdel A., Oliwa R., Mazur Ł. Industry 4.0 Part I.Selected applications in processing of polymer materials. Polimery. 2018, vol. 63, No. 7-8, pp. 531-535

RIS:
TY - JOUR
AU - Oleksy, Mariusz
AU - Budzik, Grzegorz
AU - Sanocka-Zajdel, Agnieszka
AU - Paszkiewicz, Andrzej
AU - Bolanowski, Marek
AU - Oliwa, Rafal
AU - Mazur, Lukasz
PY - 2018/07/01
SP - 531
EP - 535
T1 - Industry 4.0. Part I. Selected applications in processing of polymer materials
VL - 63
DO - 10.14314/polimery.2018.7.7
JO - Polimery
ER -

BibTeX@article{article,
author = {Oleksy, Mariusz and Budzik, Grzegorz and Sanocka-Zajdel, Agnieszka and Paszkiewicz, Andrzej and Bolanowski, Marek and Oliwa, Rafal and Mazur, Lukasz},
year = {2018},
month = {07},
pages = {531-535},
title = {Industry 4.0. Part I. Selected applications in processing of polymer materials},
volume = {63},
journal = {Polimery},
doi = {10.14314/polimery.2018.7.7}
}

LINK
2018 Salach M., Trybus B., Pawłowicz B., Kuryło K. Application of RFID Technology and Cloud Computing in Car Park Management System Poznan University of Technology Academic Journals. Electrical Engineering The purpose of this paper is to present the idea of using cloud computing and RFID identification system in a car park. The presented system is able to navigate a vehicle to a parking space in the shortest time and to reduce traffic jams thanks to RFID transponders built in parking spaces. The system uses a combination of autonomous and master control to navigate the vehicles. It can execute different traffic scenarios depending on the availability of park spaces and navigate each vehicle using an autonomous route. A dedicated software algorithm for the navigation was also proposed and developed. The system utilizes an external cloud-based database of RFID transponders. A prototype model of car park equipped with RFID technology was designed and built to demonstrate the presented idea. RFID, cloud computing, intelligent car park.

Salach M., Trybus B., Pawłowicz B., Kuryło K. Application of RFID Technology and Cloud Computing in Car Park Management System. Poznan University of Technology Academic Journals. Electrical Engineering. 2018, No. 95, pp. 299-308

RIS:
TY - JOUR
AU - Kurylo, Kazimierz
AU - Pawlowicz, Bartosz
AU - Salach, Mateusz
AU - Trybus Bartosz
PY - 2018/01/01
SP - 299
EP - 308
T1 - Application of RFID technology and cloud computing in car park management system
DO - 10.21008/j.1897-0737.2018.95.0028
VL - 95
JO - Poznan University of Technology Academic Journals: Electrical Engineering
ER -

BibTeX
@article{article,
author = {Kurylo, Kazimierz and Pawlowicz, Bartosz and Salach, Mateusz and Trybus, Bartosz},
year = {2018},
month = {01},
pages = {299-308},
title = {Application of RFID technology and cloud computing in car park management system},
volume = {95}
journal = {Poznan University of Technology Academic Journals: Electrical Engineering},
doi = {10.21008/j.1897-0737.2018.95.0028}
}

LINK
2018 Gotówko K., Kuryło K., Łakomy K., Pawłowicz B., Salach M.

Application of Unattended Installation Systems and Image Management in Research and Didactic Laboratories Poznan University of Technology Academic Journals. Electrical Engineering The purpose of this article is to present image management and unattended systems in research and teaching laboratories. Both types of laboratories are specific from the point of view of IT personnel. In this work environment, unlike computers used for example in offices, frequent and advanced changes in configurations and settings are necessary. Maintaining such machines is a challenge for IT staff due to time-consuming processes and downtime in laboratories. The system proposed within the framework of this study is aimed at shortening and simplifying the service of laboratories. It help in increase of usage time of laboratories by reducing the downtimes necessary to maintain the IT infrastructure. Didactic laboratory, MDT, image management.

Gotówko K., Kuryło K., Łakomy K., Pawłowicz B., Salach M. Application of Unattended Installation Systems and Image Management in Research and Didactic Laboratories. Poznan University of Technology Academic Journals. Electrical Engineering. 2018, No. 96, pp. 287-296

RIS:
TY - JOUR
AU - Gotowko, Krzysztof
AU - Kurylo, Kazimierz
AU – Lakomy, Kinga
AU - Pawlowicz, Bartosz
AU - Salach, Mateusz
PY - 2018/01/01
VL - 96
SP - 287
EP - 296
T1 - Application of Unattended Installation Systems and Image Management in Research and Didactic Laboratories
DO - 10.21008/j.1897-0737.2018.96.002
JO - Poznan University of Technology Academic Journals: Electrical Engineering
ER -

BibTeX
@article{article,
author = {Gotowko, Krzysztof and Kurylo, Kazimierz and Lakomy, Kinga and Pawlowicz, Bartosz and Salach, Mateusz},
year = {2018},
month = {01},
pages = {287-296},
title = {Application of Unattended Installation Systems and Image Management in Research and Didactic Laboratories},
volume = {96},
journal = {Poznan University of Technology Academic Journals: Electrical Engineering},
doi = {10.21008/j.1897-0737.2018.96.002}
}

LINK
2017 Nycz M.,  Nienajadło S.,
Hajder M.
Koncepcja niskokosztowej platformy edukacyjnej EDUKACJA - TECHNIKA - INFORMATYKA W pracy przedstawiono koncepcje niskokosztowej platformy edukacyjnej. Autorzy prezentują rozwiązania sprzętowe oraz programowe, których głównym celem jest podniesienie jakości edukacji informatycznej w szkołach podstawowych i gimnazjalnych. Raspberry Pi, Scratch, nauka programowania

Nycz M., Nienajadło S.. Hajder M. Koncepcja niskokosztowej platformy edukacyjnej. EDUKACJA - TECHNIKA - INFORMATYKA. 2017, No. 2 (20)/2017, pp. 237-241

RIS:
TY - JOUR
AU - Nycz, Mariusz
AU - Nienajadlo, Sara
AU - Hajder, Miroslaw
PY - 2017/01/01
SP - 237
EP - 241
T1 - Koncepcja niskokosztowej platformy edukacyjnej
VL - 20
DO - 10.15584/eti.2017.2.31
JO - Edukacja-Technika-Informatyka
ER -

BibTeX
@article{article,
author = {Nycz, Mariusz and Nienajadlo, Sara and Hajder, Miroslaw},
year = {2017},
month = {01},
pages = {237-241},
title = {Koncepcja niskokosztowej platformy edukacyjnej},
volume = {20},
journal = {Edukacja-Technika-Informatyka},
doi = {10.15584/eti.2017.2.31}
}

LINK
2017 Nycz M., Hajder M., Gerka A. Edukacja w zakresie metod i środków ochrony tożsamości w sieci EDUKACJA - TECHNIKA - INFORMATYKA W opracowaniu przedstawiono problematykę ochrony tożsamości oraz metody i środki zapewnienia bezpieczeństwa użytkowników. Autorzy zwracają uwagę na fakt, iż odpowiednia edukacja w zakresie ochrony tożsamości jest kluczowa dla zapewnienia bezpieczeństwa użytkowników sieci. ochrona tożsamości, kradzież tożsamości, cyberbezpieczeństwo

Nycz M., Hajder M., Gerka A. Edukacja w zakresie metod i środków ochrony tożsamości w sieci. EDUKACJA - TECHNIKA - INFORMATYKA. 2017, No. 3 (21)/2017, pp. 261-265

RIS:
TY - JOUR
AU - Nycz, Mariusz
AU - Gerka, Alicja
AU - Hajder, Miroslaw
PY - 2017/01/01
JO - Edukacja-Technika-Informatyka
SP - 261
EP - 265
T1 - Edukacja w zakresie metod i środków ochrony tożsamości w sieci
VL - 21
DO - 10.15584/eti.2017.3.37
ER -

BibTeX
@article{article,
author = {Nycz, Mariusz and Gerka, Alicja and Hajder, Miroslaw},
year = {2017},
month = {01},
pages = {261-265},
journal = {Edukacja-Technika-Informatyka},
title = {Edukacja w zakresie metod i środków ochrony tożsamości w sieci},
volume = {21},
doi = {10.15584/eti.2017.3.37}
}

LINK
2017 Strzałka D.  Initial Results of Testing Some Statistical Properties of Hard Disks Workload in Personal Computers in Terms of Non-Extensive Entropy and Long-Range Dependencies Entropy The aim of this paper is to present some preliminary results and non-extensive statistical properties of selected operating system counters related to hard drive behaviour. A number of experiments have been carried out in order to generate the workload and analyse the behaviour of computers during man–machine interaction. All analysed computers were personal ones, worked under Windows operating systems. The research was conducted to demonstrate how the concept of non-extensive statistical mechanics can be helpful in the description of computer systems behaviour, especially in the context of statistical properties with scaling phenomena, long-term dependencies and statistical self-similarity. The studies have been made on the basis of perfmon tool that allows the user to trace operating systems counters during processing. complex systems; non-extensive entropy; operating systems; human computer interaction;workload; physics of processing

Strzałka D.  Initial Results of Testing Some Statistical Properties of Hard Disks Workload in Personal Computers in Terms of Non-Extensive Entropy and Long-Range Dependencies. Entropy. 2017, vol. 19, No. 7, pp. 1-19

RIS:
TY - JOUR
AU - Strzalka, Dominik
PY - 2017/07/05
SP - 1
EP - 19
T1 - Initial Results of Testing Some Statistical Properties of Hard Disks Workload in Personal Computers in Terms of Non-Extensive Entropy and Long-Range Dependencies
VL - 19
DO - 10.3390/e19070335
JO - Entropy
ER -

BibTeX
@article{article,
author = {Strzalka, Dominik},
year = {2017},
month = {07},
pages = {1-19},
title = {Initial Results of Testing Some Statistical Properties of Hard Disks Workload in Personal Computers in Terms of Non-Extensive Entropy and Long-Range Dependencies},
volume = {19},
journal = {Entropy},
doi = {10.3390/e19070335}
}

LINK
2017 Strzałka D., Koczkodaj W., Magnot J., Mazurek J., Rakhshani H., Peters J., Sołtys M., Szybowski J., Tozzi A. On normalization of inconsistency indicators in pairwise comparisons International Journal of Approximate Reasoning In this study, we provide mathematical and practice-driven justification for using [0,1] normalization of inconsistency indicators in pairwise comparisons. The need for normalization, as well as problems with the lack of normalization, is presented. A new type of paradox of infinity is described. Pairwise comparisonsInconsistency indicatorNormalizationDecision making

Strzałka D., Koczkodaj W., Magnot J., Mazurek J., Rakhshani H., Peters J., Sołtys M., Szybowski J., Tozzi A. On normalization of inconsistency indicators in pairwise comparisons. International Journal of Approximate Reasoning. 2017, vol. 86, pp. 73-79

RIS:
TY - JOUR
AU - Koczkodaj, Waldemar
AU - Magnot, Jean-Pierre
AU - Mazurek, Jiri
AU - Peters, James
AU - Rakhshani, Hojjat
AU - Soltys, Michael
AU - Strzalka, Dominik
AU - Szybowski, Jacek
AU - Tozzi, Arturo
PY - 2017/07/01
SP - 73
EP - 79
T1 - On normalization of inconsistency indicators in pairwise comparisons
VL - 86
JO - International Journal of Approximate Reasoning
ER -

BibTeX
@article{article,
author = {Koczkodaj, Waldemar and Magnot, Jean-Pierre and Mazurek, Jiri and Peters, James and Rakhshani, Hojjat and Soltys, Michael and Strzalka, Dominik and Szybowski, Jacek and Tozzi, Arturo},
year = {2017},
month = {07},
pages = {73-79},
title = {On normalization of inconsistency indicators in pairwise comparisons},
volume = {86},
journal = {International Journal of Approximate Reasoning}
}

LINK
2017 Strzałka D., Koczkodaj W., Kakiashvili T., Szymańska A., Montero-Marin J., Araya R., Garcia-Campayo J., Rutkowski K. How to reduce the number of rating scale items without predictability loss? Scientometrics Rating scales are used to elicit data about qualitative entities (e.g., research collaboration). This study presents an innovative method for reducing the number of rating scale items without the predictability loss. The “area under the receiver operator curve method” (AUC ROC) is used. The presented method has reduced the number of rating scale items (variables) to 28.57% (from 21 to 6) making over 70% of collected data unnecessary. Results have been verified by two methods of analysis: Graded Response Model (GRM) and Confirmatory Factor Analysis (CFA). GRM revealed that the new method differentiates observations of high and middle scores. CFA proved that the reliability of the rating scale has not deteriorated by the scale item reduction. Both statistical analysis evidenced usefulness of the AUC ROC reduction method Rating scale; Prediction; Receiver operator characteristic; Reduction

Strzałka D., Koczkodaj W., Kakiashvili T., Szymańska A., Montero-Marin J., Araya R., Garcia-Campayo J., Rutkowski K. How to reduce the number of rating scale items without predictability loss?. Scientometrics. 2017, vol. 111, No. 2, pp. 581-593

RIS:
TY - JOUR
AU - Koczkodaj Waldemar
AU - Kakiashvili, Tamar
AU - Szymanska, Agnieszka
AU - Montero-Marin, Jesus
AU - Araya, Rodolfo
AU - Garcia-Campayo, Javier
AU - Rutkowski, Krzysztof
AU - Strzalka, Dominik
PY - 2017/02/16
SP - 581
EP - 593
T1 - How to reduce the number of rating scale items without predictability loss?
VL - 111
DO - 10.1007/s11192-017-2283-4
JO - Scientometrics
ER -

BibTeX
@article{article,
author = {Koczkodaj, Waldemar and Kakiashvili, Tamar and Szymanska, Agnieszka and Montero-Marin, Jesus and Araya, Rodolfo and Garcia-Campayo, Javier and Rutkowski, Krzysztof and Strzałka, Dominik},
year = {2017},
month = {02},
pages = {581-593},
title = {How to reduce the number of rating scale items without predictability loss?},
volume = {111},
journal = {Scientometrics},
doi = {10.1007/s11192-017-2283-4}
}

LINK
2017 Szarek M., Nycz M.,  Nienajadło S. The analysis of efficiency and performance of intrusion prevention systems Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika This article aims at presenting a comparative analysis of two intrusion detection and prevention systems, namely Snort and Suricata, run in the af-packet mode in the context of the efficiency of their protection against the denial of service attacks. The paper sets out, in statistical terms, the denial of service attacks and distributed denial-of-service attacks occurring around the world. In the further part of the re-search, penetration tests were conducted in order to assess comparatively analysis of the efficiency of IDS/IPS systems was carried out in the context of starting vari-ous numbers of network connected devices as well as in the case of sending pack-ets with different sizes. This article is addressed to security systems administrators as well as to people involved in security systems implementation. security, network, test, protection, detection, service, denial, intrusion, system, DDoS, DoS, attack

Nycz M., Szarek M., Nienajadło S. The analysis of efficiency and performance of intrusion prevention systems. Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika. 2017, vol. XXV, No. 36 (1/2017), pp. 53-65

RIS:
TY - JOUR
AU - Szarek, Mariusz
AU - Nycz, Mariusz
AU - Nienajadlo, Sara
PY - 2017/01/01
SP - 53
EP - 65
VL – XXV
T1 - The analysis of efficiency and performance of intrusion prevention systems
DO - 10.7862/re.2017.5
JO - Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics
ER -

BibTeX
@article{article,
author = {Szarek, Mariusz and Nycz, Mariusz and Nienajadlo, Sara},
year = {2017},
month = {01},
pages = {53-65},
volume = {XXV},
title = {The analysis of efficiency and performance of intrusion prevention systems},
journal = {Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics},
doi = {10.7862/re.2017.5}
}

LINK
2017 Nycz M., Szeliga T., Hajder P. Assessment of the vulnerability of the apache server to DDoS attacks Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika The article presents an analysis of the vulnerability of the Apache server with re-gard to common DDoS attacks. The paper begins with presenting the statistical overview of the issue of denial-of-service attacks. We also discuss the methods used for performing DDoS attacks. Working with the virtual systems, the authors designed a test environment, where the assessment was conducted of the vulnera-bility of selected WWW systems. At the end of the article, actions are proposed to implement effective methods of defending against the denial-of-service attacks. The paper is written for the specialists in the field of web systems security. DDoS Attack; security; the Apache; web server

Nycz M., Hajder P., Szeliga T. Assessment of the vulnerability of the apache server to DDoS attacks. Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika. 2017, vol. XXV, No. 36 (1/2017), pp. 67-76

RIS:
TY - JOUR
AU - Nycz, Mariusz
AU - Szeliga, Tomasz
AU - Hajder, Piotr
PY - 2017/01/01
SP - 67
EP - 76
VL – XXV
T1 - Assessment of the vulnerability of the Apache server to DDoS attaks
DO - 10.7862/re.2017.6
JO - Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics
ER -

BibTeX
@article{article,
author = {Nycz, Mariusz and Szeliga, Tomasz and Hajder, Piotr},
year = {2017},
month = {01},
pages = {67-76},
volume = {XXV},
title = {Assessment of the vulnerability of the Apache server to DDoS attaks},
journal = {Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics},
doi = {10.7862/re.2017.6}
}

LINK
2017 Kałucki P., Dymora P., Mazurek M. Badanie wydajności wybranych systemów wirtualizacji Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika Obecnie koncepcja wirtualizacji wkroczyła praktycznie do każdej dziedziny informatyki. Wzrost mocy obliczeniowej serwerów sprawił, że optymalne wykorzystanie ich zasobów stało się istotnym problemem. Celem artykułu jest scharakteryzowanie wybranych rozwiązań technologicznych umożliwiających wirtualizację fizycznych serwerów. W artykule przedstawiono wybrane oprogramowanie do wirtualizacji systemów, a następnie przedstawiono badanie ich wydajności. wirtualizacja, hyperwizor, ESXi, Hyper-V, XenServer

Kałucki P., Dymora P., Mazurek M. Badanie wydajności wybranych systemów wirtualizacji. Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika. 2017, vol. XXV, No. 36 (2/2017), pp. 51-65

RIS:
TY - JOUR
AU - Kalucki, Przemyslaw
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2017/01/01
SP - 51
EP - 65
VL – XXV
T1 - Badanie wydajności wybranych systemów wirtualizacji
DO - 10.7862/re.2017.11
JO - Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics
ER -

BibTeX
@article{article,
author = {Kalucki, Przemyslaw and Dymora, Pawel and Mazurek, Miroslaw},
year = {2017},
month = {01},
pages = {51-65},
volume = {XXV},
title = {Badanie wydajności wybranych systemów wirtualizacji},
journal = {Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics},
doi = {10.7862/re.2017.11}
}

LINK
2017 Margol P., Dymora P., Mazurek M. Strategie archiwizacji i odtwarzania baz danych Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika Systemy bazodanowe są narażone na różnego rodzaju awarie, które mogą być spowodowane zarówno uszkodzeniem sprzętu, jak i błędem użytkownika czy systemu. Jednym ze skutecznych sposobów ochrony danych przed utratą jest tworzenie kopii zapasowych. Artykuł omawia kluczowe elementy dotyczące tworzenia strategii archiwizacji i odtwarzania danych. Ma na celu uświadomienie jak ważnym elementem pracy administratorów baz danych jest tworzenie odpowiednich strategii tworzenia kopii zapasowych i ich testowanie. systemy bazodanowe, bazy danych, archiwizacja, odtwarzanie

Dymora P., Mazurek M., Margol P. Strategie archiwizacji i odtwarzania baz danych. Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika. 2017, vol. XXV, No. 36 (3/2017), pp. 31-41

RIS:
TY - JOUR
AU - Margol, Patrycja
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2017/01/01
SP - 31
EP - 41
T1 - Strategie archiwizacji i odtwarzania baz danych
VL – XXV
DO - 10.7862/re.2017.15
JO - Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics
ER -

BibTeX
@article{article,
author = {Margol, Patrycja and Dymora, Pawel and Mazurek, Miroslaw},
year = {2017},
month = {01},
pages = {31-41},
volume = {XXV},
title = {Strategie archiwizacji i odtwarzania baz danych},
journal = {Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics},
doi = {10.7862/re.2017.15}
}

LINK
2017 Kowal B., Dymora P., Mazurek M. NS2 - Jako środowisko symulacyjne do badań nad bezprzewodowymi sieciami sensorowymi Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika Wraz z rozwojem bezprzewodowych systemów sensorowych rośnie zainteresowanie Internetem Rzeczy (ang. Internet of Things). Celem artykułu jest przybliżenie możliwości jakie dostarcza środowisko symulacyjne NS2 do badań nad bezprzewodowymi sieciami sensorowymi. W artykule opisano symulator sieci NS2, scharakteryzowano główne funkcje symulatora, przedstawiono i opisano przykładowy proces budowy skryptu sieci WSN oraz analizę wyników symulacji testowanej sieci. sensory, WSN, NS2, bezprzewodowa sieć sensorowa

Dymora P., Mazurek M., Kowal B. NS2 - Jako środowisko symulacyjne do badań nad bezprzewodowymi sieciami sensorowymi. Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika. 2017, vol. XXV, No. 36 (3/2017), pp. 19-29

RIS:
TY - JOUR
AU - Kowal, Bartosz
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2017/01/01
SP - 19
EP - 29
VL – XXV
T1 - NS2 – jako środowisko symulacyjne do badań nad bezprzewodowymi sieciami sensorowymi
DO - 10.7862/re.2017.14
JO - Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics
ER -

BibTeX
@article{article,
author = {Kowal, Bartosz and Dymora, Pawel and Mazurek, Miroslaw},
year = {2017},
month = {01},
pages = {19-29},
volume = {XXV},
title = {NS2 – jako środowisko symulacyjne do badań nad bezprzewodowymi sieciami sensorowymi},
journal = {Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics},
doi = {10.7862/re.2017.14}
}

LINK
2017 Czarnik E., Dymora P., Mazurek M.  Mechanizmy wyszukiwania obrazem w Oracle 11g Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika W bazach danych zawierających dane graficzne (np. zdjęcia), niejednokrotnie zachodzi potrzeba szybkiego odnalezienia podobnego obrazu. W bazach danych np. firm magazynowych, ważną kwestią może być eliminacja duplikującego się asortymentu posiadającego różne opisy, dokumentację, a faktycznie posiadającego te same właściwości fizyczne, np. poprzez porównanie wyglądu poszczególnych produktów na podstawie posiadanego zdjęcia. Naprzeciw takim potrzebom wychodzi Oracle ze standardem SQL/MM, który udostępnia metody umożliwiające przeszukiwanie baz danych za pomocą właściwości wizualnych tzw. wyszukiwanie obrazem. Artykuł prezentuje możliwości technologii Oracle 11g obsługującej typy składowania danych multimedialnych (w tym danych graficznych) oraz przykład stworzonej aplikacji internetowej umożliwiającej implementację tych mechanizmów i wyszukiwanie obrazem. Aplikacja została wykorzystana do przeprowadzenia badań wydajnościowych różnych metod wyszukiwania obrazem. Oracle 11g, SCORE, wyszukiwanie obrazem.

Dymora P., Mazurek M., Czarnik E. Mechanizmy wyszukiwania obrazem w Oracle 11g. Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika. 2017, vol. XXV, No. 36 (3/2017), pp. 5-18

RIS:
TY - JOUR
AU - Czarnik, Ewa
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2017/01/01
SP - 5
EP - 18
VL – XXV
T1 - Mechanizmy wyszukiwania obrazem w Oracle 11g
DO - 10.7862/re.2017.13
JO - Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics
ER -

BibTeX
@article{article,
author = {Czarnik, Ewa and Dymora, Pawel and Mazurek, Miroslaw},
year = {2017},
month = {01},
pages = {5-18},
volume = {XXV},
title = {Mechanizmy wyszukiwania obrazem w Oracle 11g},
journal = {Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics},
doi = {10.7862/re.2017.13}
}

LINK
2017 Burdacki M., Dymora P., Mazurek M. Analiza ruchu w sieci komputerowej w oparciu o modele multifraktalne Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika Celem badań była analiza ruchu w sieci komputerowej z wykorzystaniem wybranych modeli multifraktalnych. W części teoretycznej omówiono podstawowe zagadnienia związane z oprogramowaniem zbierającym dane w sieci komputerowej, klasyfikacją przebiegów czasowych przy użyciu wykładnika Hurst’a. Opisano metody wykorzystane do wyznaczenia widm multifraktalnych. W części badawczej dokonano analizy przepływu ruchu w sieci komputerowej na podstawie liczby pakietów oraz prędkości przesyłania danych. Wykonano analizę wykładnika Hurst’a wyznaczanego dla poszczególnych przebiegów czasowych. Dokonano analizy widm multifraktalnych utworzonych dla badanych rodzajów ruchu sieciowego. analiza ruchu sieciowego, sniffing, analiza samopodobieństwa, analiza multifraktalna, wykładnik Hursta

Dymora P., Mazurek M., Burdacki M. Analiza ruchu w sieci komputerowej w oparciu o modele multifraktalne. Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika. 2017, vol. XXV, No. 36 (3/2017), pp. 43-52

RIS:
TY - JOUR
AU - Burdacki, Maksymilian
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2017/01/01
SP - 43
EP - 52
VL – XXV
T1 - Analiza ruchu w sieci komputerowej w oparciu o modele multifraktalne
DO - 10.7862/re.2017.16
JO - Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics
ER -

BibTeX
@article{article,
author = {Burdacki, Maksymilian and Dymora, Pawel and Mazurek, Miroslaw},
year = {2017},
month = {01},
pages = {43-52},
volume = {XXV},
title = {Analiza ruchu w sieci komputerowej w oparciu o modele multifraktalne},
journal = {Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics},
doi = {10.7862/re.2017.16}
}

LINK
2017 Balasa M., Dymora P., Mazurek M. Czy nasze dane w chmurze są bezpieczne Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika Błyskawiczny rozwój technologii oprogramowania oraz zwiększenie wydajności urządzeń przyczynia się do tworzenia nowoczesnych rozwiązań problemów, z którymi borykają się korporacje, firmy jak i zwykli użytkownicy chmury. Obecnie większość przedsiębiorstw nie wyobraża sobie pracy bez wykorzystania chmury do przechowywania swoich danych. Jednak jednym z największych problemów wykorzystania chmury to jej bezpieczeństwo. W artykule przedstawiono modele usług wraz z modelem rozmieszczenia chmur oraz rodzaje ataków chmura obliczeniowa, bezpieczeństwo, ataki

Balasa M., Dymora P., Mazurek M. Czy nasze dane w chmurze są bezpieczne. Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika. 2017, vol. XXV, No. 36 (2/2017), pp. 67-78

RIS:
TY - JOUR
AU - Balasa, Michal
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2017/01/01
SP - 67
EP - 78
VL – XXV
T1 - Czy nasze dane w chmurze są bezpieczne
DO - 10.7862/re.2017.12
JO - Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics
ER -

BibTeX
@article{article,
author = {Balasa, Michal and Dymora, Pawel and Mazurek, Miroslaw},
year = {2017},
month = {01},
pages = {67-78},
volume = {XXV},
title = {Czy nasze dane w chmurze są bezpieczne},
journal = {Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics},
doi = {10.7862/re.2017.12}
}

LINK
2016 Strzałka D.  Influence of Long-Term Dependences on Hard Drives Performance during Human Computer Interaction Acta Physica Polonica A Today, computer systems become one of the most important systems in technology and our life. They have a plenty of possible applications but most of them can be described as a transformation of (electrical) energy into useful work = calculations. This process is not so simple as it seems to be because the structure of computers hardware is very complicated and processed tasks are also very complex. Because the expectations of computer users are very high, a lot of computer resources are used only for operating systems normal work. Some existing solutions, especially in the memory system, guarantee that computer systems have acceptable performance but this parameter depends on many important system features. In this paper we will focus on one parameter, namely average disk time s/ transfer, in order to show the complex behavior of this memory system part during man– computer interaction. This is one of the most important counters in computer systems that works under Windows family operating systems and describes measurement related to hard drive based on the complete roundtrip time of any request.

Strzałka D.  Influence of Long-Term Dependences on Hard Drives Performance during Human Computer Interaction. Acta Physica Polonica A. 2016, vol. 129, No. 5, pp. 1064-1070

RIS:
TY - JOUR
AU - Strzalka, Dominik
PY - 2016/05/01
SP - 1064
EP - 1070
T1 - Influence of Long-Term Dependences on Hard Drives Performance during Human Computer Interaction
VL - 129
DO - 10.12693/APhysPolA.129.1064
JO - Acta Physica Polonica A
ER -

BibTeX
@article{article,
author = {Strzalka, Dominik},
year = {2016},
month = {05},
pages = {1064-1070},
title = {Influence of Long-Term Dependences on Hard Drives Performance during Human Computer Interaction},
volume = {129},
journal = {Acta Physica Polonica A},
doi = {10.12693/APhysPolA.129.1064}
}

LINK
2016 Strzałka D.  Some preliminary results of memory cache analysis with the use of non-extensive Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica The problem of modelling different parts of computer systems requires accurate statistical tools. Cache memory systems is an inherent part of nowadays computer systems, where the memory hierarchical structure plays a key point role in behavior and performance of the whole system. In the case of Windows operating systems, cache memory is a place in memory subsystem where the I/O system puts recently used data from disk. In paper some preliminary results about statistical behavior of one selected system counter behavior are presented. Obtained results shown that the real phenomena, which have appeared during human-computer interaction, can be expressed in terms of non-extensive statistics that is related to Tsallis proposal of new entropy definition. complex systems; cache memory; system counters;Tsallis entropy

Strzałka D.  Some preliminary results of memory cache analysis with the use of non-extensive. Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica. 2016, vol. 16, No. 2 (2016), pp. 43-47

RIS:
TY - JOUR
AU - Strzalka, Dominik
PY - 2017/12/22
SP - 43
EP - 47
T1 - Some preliminary results of memory cache analysis with the use of non-extensive statistics
VL - 16
DO - 10.17951/AI.2016.16.2.43
JO - Annales Universitatis Mariae Curie-Sklodowska, Sectio AI–Informatica
ER -

BibTeX
@article{article,
author = {Strzalka, Dominik},
year = {2017},
month = {12},
pages = {43-47},
title = {Some preliminary results of memory cache analysis with the use of non-extensive statistics},
volume = {16},
journal = {Annales Universitatis Mariae Curie-Sklodowska, Sectio AI–Informatica},
doi = {10.17951/AI.2016.16.2.43}
}

LINK
2016 Nycz M., Hajder M., Nienajadło S. Methods for increasing security of web servers Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica This article is addressed in most part to people dealing with security of web servers. This paper begins with presenting the statistical dimension of the issue of data security in the modern Internet. This paper begins with presenting statistics dealing with issues of data security on the modern World Wide Web. The authors main focus in this work is presenting the challenges of dealing with security and protection of web communication. The work analyses the security of implementing SSL/TLS (Secure Socket Layer/Transport Layer Security) protocol and proposes a new method of increasing security of web servers. This article is addressed to people dealing with analysis and security of web servers security; web server; intrusion detection; intrusion prevension

Nycz M., Hajder M., Nienajadło S. Methods for increasing security of web servers. Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica. 2016, vol. 16, No. 2 (2016), pp. 39-42

RIS:
TY - JOUR
AU - Nycz, Mariusz
AU - Hajder, Miroslaw
AU - Nienajadlo, Sara
PY - 2017/12/22
SP - 39
EP - 42
T1 - Methods for increasing security of web servers
VL - 16
DO - 10.17951/ai.2016.16.2.39
JO - Annales UMCS, Informatica
ER -

BibTeX
@article{article,
author = {Nycz, Mariusz and Hajder, Miroslaw and Nienajadlo, Sara},
year = {2017},
month = {12},
pages = {39-42},
title = {Methods for increasing security of web servers},
volume = {16},
journal = {Annales UMCS, Informatica},
doi = {10.17951/ai.2016.16.2.39}
}

LINK
2016 Nycz M., Hajder M., Gerka A. New architecture of system intrusion detection and prevention Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica In this article there has been presented new intrusion detection and prevention algorithm implemented on Raspberry Pi platform. The paper begins with the presentation of research methodology in the field of Intrusion Detection Systems. Adequate supervision and control over network traffic is crucial for the security of information and communication technology. As a result of the limited budget allocated for the IT infrastructure of small businesses and the high price of dedicated solutions, many companies do not use mentioned systems. Therefore, in this order, there has been proposed monitoring solution based on the generally available Raspberry Pi platform. The paper is addressed to network administrators intrusion detection; network security; DS; IPS;

Nycz M., Hajder M., Gerka A. New architecture of system intrusion detection and prevention. Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica. 2016, vol. 16, No. 2 (2016), pp. 20-24

RIS:
TY - JOUR
AU - Nycz, Mariusz
AU - Hajder, Miroslaw
AU - Gerka, Alicja
PY - 2017/12/22
SP - 20
EP - 24
T1 - New architecture of system intrusion detection and prevention
VL - 16
DO - 10.17951/ai.2016.16.2.20
JO - Annales UMCS, Informatica
ER -

BibTeX
@article{article,
author = {Nycz, Mariusz and Hajder, Miroslaw and Gerka, Alicja},
year = {2017},
month = {12},
pages = {20-24},
title = {New architecture of system intrusion detection and prevention},
volume = {16},
journal = {Annales UMCS, Informatica},
doi = {10.17951/ai.2016.16.2.20}
}

LINK
2016 Dymora P., Mazurek M., Jaskółka S. VoIP Anomaly Detection - selected methods of statistical analysis Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica Self-similarity analysis and anomaly detection in networks are interesting fields of research and scientific work of scientists around the world. Simulation studies have demonstrated that the Hurst parameter estimation can be used to detect traffic anomaly. The actual network traffic is self-similar or long-range dependent. The dramatic expansion of applications on modern networks gives rise to a fundamental challenge to network security. The Hurst values are compared with confidence intervals of normal values to detect anomaly in VoIP Hurst factor; anomaly detection; self-similarity long-range dependence

Dymora P., Mazurek M., Jaskółka S. VoIP Anomaly Detection - selected methods of statistical analysis. Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica. 2016, vol. 16, No. 2 (2016), pp. 14-19

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Jaskolka, Slawomir
PY - 2017/12/22
SP - 14
EP - 19
T1 - VoIP Anomaly Detection - selected methods of statistical analysis
VL - 16
DO - 10.17951/ai.2016.16.2.14
JO - Annales UMCS, Informatica
ER -

BibTeX
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Jaskolka, Slawomir},
year = {2017},
month = {12},
pages = {14-19},
title = {VoIP Anomaly Detection - selected methods of statistical analysis},
volume = {16},
journal = {Annales UMCS, Informatica},
doi = {10.17951/ai.2016.16.2.14}
}

LINK
2016 Strzałka D.  Selected Remarks about Computer Processing in Terms of Flow Control and Statistical Mechanics Entropy Despite the fact that much has been said about processing in computer science, it seems that there is still much to do. A classical approach assumes that the computations done by computers are a kind of mathematical operation (calculations of functions values) and have no special relations to energy transformation and flow. However, there is a possibility to get a new view on selected topics, and as a special case, the sorting problem is presented; we know many different sorting algorithms, including those that have complexity equal to O(n lg(n)), which means that this problem is algorithmically closed, but it is also possible to focus on the problem of sorting in terms of flow control, entropy and statistical mechanics. This is done in relation to the existing definitions of sorting, connections between sorting and ordering and some important aspects of computer processing understood as a flow that are not taken into account in many theoretical considerations in computer science. The proposed new view is an attempt to change the paradigm in the description of algorithms' performance by computational complexity and processing, taking into account the existing references between the idea of Turing machines and their physical implementations. This proposal can be expressed as a physics of computer processing; a reference point to further analysis of algorithmic and interactive processing in computer systems. sorting; insertion sort; entropy; physics of processing; flow control; complex system

Strzałka D.  Selected Remarks about Computer Processing in Terms of Flow Control and Statistical Mechanics. Entropy. 2016, vol. 18, No. 3, pp. 1-19

RIS:
TY - JOUR
AU - Strzalka, Dominik
PY - 2016/03/12
SP - 1
EP - 19
T1 - Selected Remarks about Computer Processing in Terms of Flow Control and Statistical Mechanics
VL - 18
DO - 10.3390/e18030093
JO - Entropy
ER -

BibTeX
@article{article,
author = {Strzalka, Dominik},
year = {2016},
month = {03},
pages = {1-19},
title = {Selected Remarks about Computer Processing in Terms of Flow Control and Statistical Mechanics},
volume = {18},
journal = {Entropy},
doi = {10.3390/e18030093}
}

LINK
2016 Bolanowski M., Paszkiewicz A., Wroński M., Żegleń R.  Representativeness analysis and possible applications of partial network data flows Measurement Automation Monitoring - Pomiary Automatyka Kontrola A new approach to statistical analysis of network flows and its possible application to statistical anomaly detection in high bandwidth communication networks are presented in the paper. The whole data stream was divided into smaller flows using Link Aggregation Control Protocol (LACP). A statistical analysis of the resulting flows shows that a single stream separated from the overall network traffic is representative when it comes to statistical anomaly detection. Such an approach allows the reduction of hardware resources needed to detect anomalies, and makes such a detection possible in high traffic communication systems. link aggregation control protocol; network security; network anomaly detection

Bolanowski M., Paszkiewicz A., Wroński M., Żegleń R.  Representativeness analysis and possible applications of partial network data flows. Measurement Automation Monitoring - Pomiary Automatyka Kontrola. 2016, vol. 62, No. 1, pp. 29-32

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
AU - Wronski, Michal
AU - Zeglen, Robert 
PY - 2016
SP - 29
EP - 32
T1 - Representativeness analysis and possible applications of partial network data flows
VL - 62
DO -
JO - Measurement Automation Monitoring - Pomiary Automatyka Kontrola 

BibTeX
@article{article,
author = {Bolanowski, Marek and Paszkiewicz, Andrzej and Wronski, Michal and Zeglen, Robert},
year = {2016},
pages = {29-32},
title = {Representativeness analysis and possible applications of partial network data flows},
volume = {62},
journal = {British Journal of Applied Science \& Technology},
}

LINK
2015 Buczek K., Masłowski G., Strzałka D. 50th Anniversary of the Faculty of Electrical and Computer Engineering, Rzeszów University of Technology Archives of Electrical Engineering Deans foreword In 2015 celebrated the 50th anniversary of the Faculty of Electrical and Computer Engineering , Ignacy Łukasiewicz Rzeszów University of Technology. The first students began their education at the Faculty of Electrical Engineering in 1965 that is less than two years after the establishment of the First Degree Engineering School in Rzeszów. In the fifty years of the history of our Faculty we have educated almost eleven thousand graduates who have successfully found employment, occupying responsible positions in business companies and public administration. Many of them have chosen a career in science achieving significant successes, including at our Faculty. The high level of education was confirmed by the Polish Accreditation Commission, which granted a positive assessment of the Faculty as an institution. We make every effort to ensure to still be seen as a leader in the region and a significant unit in the Polish education system in the fields of electrical engineering, computer science, electronics and telecommunications, power engineering, automation control and robotics. Currently, 121 university teachers work at the Faculty. They teach more than 2,800 undergraduate and graduate students. The Faculty Council is authorized to confer a D.Sc. degree in technical sciences in the discipline of electrical engineering and authorized to confer doctoral degrees in electrical engineering and computer science disciplines. Moreover, there are doctoral studies in both disciplines. To celebrate the anniversary , a series of scientific peer meetings and accompanying events were planned. A solemn joint meeting of the Faculty Council and the Economic Council (June 17th 2015) was a unique occasion to remind ourselves of the history and many achieved successes of the Faculty in the areas of education, research and collaboration with companies. We will remember with affection, those who have gone and those without whom the Faculty would not have achieved its unique position. In this paper we are presenting a short story of our Faculty; the presented information was collected and edited by Prof., Ph.D., D.Sc., Eng. Kazimierz Buczek, who for many years was a Faculty Dean.

Buczek K., Masłowski G., Strzałka D. 50th Anniversary of the Faculty of Electrical and Computer Engineering, Rzeszów University of Technology. Archives of Electrical Engineering. 2015, vol. 64, No. 4, pp. 679-689

RIS:
TY - JOUR
AU - Buczek, Kazimierz.
AU - Maslowski, Grzegorz.
AU - Strzalka, Dominik
PY - 2015/01/01
SP - 679
EP - 689
T1 - 50th Anniversary of the Faculty of Electrical and Computer Engineering, Rzeszow University of Technology
VL - 64
JO - Archives of Electrical Engineering
ER -

BibTeX
@article{article,
author = {Buczek, Kazimierz and Maslowski, Grzegorz and Strzalka, Dominik},
year = {2015},
month = {01},
pages = {679-689},
title = {50th Anniversary of the Faculty of Electrical and Computer Engineering, Rzeszow University of Technology},
journal = {Archives of Electrical Engineering}
}

LINK
2015 Strzałka D.  A simple method for calculations of the number of inversions in permutation British Journal of Applied Science & Technology The aim of this paper is to show the recurrence method for obtaining the number of inversions In(k) in input sets with different sizes n, when the information about In−1(k) is given. The proposed method is based on a simple observation that the use of recursive approach gives an elegant way for obtaining those numbers in contradiction to the so far existing approach based on binomial coefficients and pentagonal numbers. The complexity of this method is O(n 3). The results of this proposal can be used for interesting exercises in education of maths and also for problem of inversions description in sorting algorithms. Inversions; combinatorics

Strzałka D.  A simple method for calculations of the number of inversions in permutation. British Journal of Applied Science & Technology. 2015, vol. 9, No. 3, pp. 313-317

RIS:
TY - JOUR
AU - Strzalka, Dominik
PY - 2015/01/10
SP - 313
EP - 317
T1 - A Simple Method for Calculations of the Number of Inversions in Permutation
VL - 9
DO - 10.9734/BJAST/2015/17570
JO - British Journal of Applied Science & Technology
ER -

BibTeX
@article{article,
author = {Strzalka, Dominik},
year = {2015},
month = {01},
pages = {313-317},
title = {A Simple Method for Calculations of the Number of Inversions in Permutation},
volume = {9},
journal = {British Journal of Applied Science & Technology},
doi = {10.9734/BJAST/2015/17570}
}

LINK
2015 Paszkiewicz A., Pękala R. Analiza wydajności sieci konwergentnych za pomocą programowego generatora ruchu EDUKACJA - TECHNIKA - INFORMATYKA W artykule przedstawiono zagadnienia związane z wykorzystaniem programowych generatorów ruchu w celu dokonania analizy wydajności rzeczywistej infrastruktury sieciowej w odniesieniu do współcześnie występujących usług sieciowych o charakterze konwergentnym. sieci konwergentne; testy wydajności sieci; generatory ruchu

Paszkiewicz A., Pękala R. Analiza wydajności sieci konwergentnych za pomocą programowego generatora ruchu. Edukacja-Technika-Informatyka. 2015, vol. 6, No. 3, pp. 278-283

RIS:
TY - JOUR
AU - Paszkiewicz, Andrzej
AU - Pekala, Robert
PY - 2015
SP - 278
EP - 283
T1 - Analiza wydajnosci sieci konwergentnych za pomoca programowego generatora ruchu
VL - 6
JO - Edukacja-Technika-Informatyka 

BibTeX
@article{article,
author = {Paszkiewicz, Andrzej and Pekala, Robert},
year = {2015},
pages = {278-283},
title = { Analiza wydajnosci sieci konwergentnych za pomoca programowego generatora ruchu},
volume = {6},
journal = {Edukacja-Technika-Informatyka}
}

LINK
2015 Kwater T.,  Krutys P., Bolanowski M. Interfejs graficzny do badań identyfikacji bramek logicznych z zastosowaniem sztucznych sieci neuronowych EDUKACJA - TECHNIKA - INFORMATYKA Zaprojektowany i wykonany interfejs graficzny do zastosowania w sztucznych sieciach neuronowych pozwala na lepsze zrozumienie zagadnień sztucznej inteligencji oraz przyszłych innych zastosowań. Dalsze prace mogą być prowadzone jako rozwiniecie tej idei. bramki logiczne; sieci nauronowe; interfejs

Kwater T., Bolanowski M., Krutys P. Interfejs graficzny do badań identyfikacji bramek logicznych z zastosowaniem sztucznych sieci neuronowych. Edukacja-Technika-Informatyka 2015, vol. 6, No. 3, pp. 333-338

RIS:
TY - JOUR
AU - Kwater, Tadeusz
AU - Kurtys, Pawel
AU - Bolanowski, Marek
PY - 2015
SP - 333
EP - 338
T1 - Interfejs graficzny do badan identyfikacji bramek logicznych z zastosowaniem sztucznych sieci neuronowych
VL - 6
JO - Edukacja-Technika-Informatyka

BibTeX
@article{article,
author = {Kwater, Tadeusz and Bolanowski, Marek and Kurtys, Pawel},
year = {2015},
pages = {333-338},
title = {Interfejs graficzny do badan identyfikacji bramek logicznych z zastosowaniem sztucznych sieci neuronowych},
volume = {6},
journal = {Edukacja-Technika-Informatyka}
}

LINK
2015 Koniuszko M.,  Pękala R., Paszkiewicz A. Wspomaganie certyfikacji witryn internetowych za pomocą urzędów lokalnych EDUKACJA - TECHNIKA - INFORMATYKA W artykule przedstawiono zagadnienia związane z problematyką technologii SSL wykorzystującej certyfikaty. Zaproponowano aplikację, która w znaczący sposób ułatwia wdrażanie technologii SSL. Aplikacja ta posiada wszystkie niezbędne funkcjonalności pozwalające na zarządzanie kluczami i certyfikatami w połączeniu z technologiami bazodanowymi. certyfikat SSL; urząd certyfikacji; OpenSSL

Koniuszko M., Pękala R., Paszkiewicz A.  Wspomaganie certyfikacji witryn internetowych za pomocą urzędów lokalnych. Edukacja-Technika-Informatyka. 2015, vol. 6, No. 4, pp. 62-67

RIS:
TY - JOUR
AU - Koniuszko, Michal
AU - Pekala, Robert
AU - Paszkiewicz, Andrzej
PY - 2015
SP - 62
EP - 67
T1 - Wspomaganie certyfikacji witryn internetowych za pomocą urzedow lokalnych
VL - 6
JO - Edukacja-Technika-Informatyka 

BibTeX
@article{article,
author = {Koniuszko, Michal and Pekala, Robert and Paszkiewicz, Andrzej},
year = {2015},
pages = {62-67},
title = {Wspomaganie certyfikacji witryn internetowych za pomocą urzedow lokalnych},
volume = {6},
journal = {Edukacja-Technika-Informatyka}
}

LINK
2015 Dymora P.,  Mazurek M., Rywka J. Dydaktyczne aspekty projektowania aplikacji webowych z wykorzystaniem frameworka Djano w Pythonie EDUKACJA - TECHNIKA - INFORMATYKA W artykule przedstawiono proces tworzenia interaktywnych aplikacji webowych wykorzystujących język programowania wysokiego poziomu Python, framework sieciowy Django, język znaczników HTML, kaskadowe arkusze stylów CSS oraz skryptowy język programowania JavaScript. Celem artykułu jest zapoznanie studenta z procesem opracowania całego projektu technicznego obejmującego zarówno środowisko programistyczne, wzorce projektowe, biblioteki wraz z przygotowaniem analizy funkcjonalnej aplikacji. nauczanie; Python; bazy danych; SQLite; Django

Dymora P., Mazurek M., Rywka J. Dydaktyczne aspekty projektowania aplikacji webowych z wykorzystaniem frameworka Djano w Pythonie. Edukacja-Technika-Informatyka. 2015, vol. 6, No. 3, pp. 302-307

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Rywka, Jakub
PY - 2015
SP - 302
EP - 307
T1 - Dydaktyczne aspekty projektowania aplikacji webowych z wykorzystaniem frameworka Djano w Pythonie
VL - 6
JO - Edukacja-Technika-Informatyka

BibTeX
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Rywka, Jakub},
year = {2015},
pages = {302-307},
title = {Dydaktyczne aspekty projektowania aplikacji webowych z wykorzystaniem frameworka Djano w Pythonie},
volume = {6},
journal = {Edukacja-Technika-Informatyka}
}

LINK
2015 Dymora P., Mazurek M., Mroczka B. Wykorzystanie multimedialnych rozszerzeń baz danych w dydaktyce przedmiotów informatycznych EDUKACJA - TECHNIKA - INFORMATYKA W artykule przedstawiono właściwości współczesnych baz danych w zakresie mechanizmów składowania i obsługi multimedialnych typów danych. Zaprezentowano możliwość budowy interaktywnej aplikacji internetowej opartej na relacyjno-obiektowej bazzie danych wykorzystującej multimedialne typy danych dostępne w bibliotekach Oracle Multimedia oraz technologii JSP. Tematyka ta może być z powodzeniem wykorzystana w dydaktyce przedmiotów bazodanowych oraz programistycznych. nauczanie; przedmioty bazodanowe i programistyczne; typy multimedialne; środowisko Oracle; JSP

Dymora P., Mazurek M., Mroczka B.Wykorzystanie multimedialnych rozszerzeń baz danych w dydaktyce przedmiotów informatycznych. Edukacja-Technika-Informatyka. 2015, vol. 6, No. 4, pp. 308-322

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Mroczka, Bogumil 
PY - 2015
SP - 308
EP - 322
T1 - Wykorzystanie multimedialnych rozszerzen baz danych w dydaktyce przedmiotow informatycznych
VL - 6
JO - Edukacja-Technika-Informatyka

BibTeX
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Mroczka, Bogumil},
year = {2015},
pages = {308-322},
title = {Wykorzystanie multimedialnych rozszerzen baz danych w dydaktyce przedmiotow informatycznych},
volume = {6},
journal = {Edukacja-Technika-Informatyka}
}

LINK
2015 Bolanowski M., Krutys P. Metody i środki zarządzania infrastrukturą sieciową w złożonym środowisku laboratoryjnym EDUKACJA - TECHNIKA - INFORMATYKA W artykule przedstawiono metody i środki zarządzania oraz optymalizacji dostępu do zasobów laboratorium sieci komputerowych. Zaprezentowano aplikacje do automatyzacji zapisu, odtwarzania konfiguracji urządzeń i gromadzenia wyników oraz wskazano protokoły, które mogą być użyte w tym celu. Zaproponowana została również metoda automatyzacji zmian konfiguracyjnych uzależniona od bieżącej analizy parametrów pomiarowych. sieci komputerowe; dostęp do zasobów laboratoryjnych; zarządzanie sieciami

Bolanowski M., Krutys P. Metody i środki zarządzania infrastrukturą sieciową w złożonym środowisku laboratoryjnym. Edukacja-Technika-Informatyka. 2015, vol. 6, No. 3, pp. 238-243

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Krutys, Pawel
PY - 2015
SP - 238
EP - 243
T1 - Metody i srodki zarzadzania infrastruktura sieciowa w zlolonym srodowisku laboratoryjnym
VL - 6
JO - Edukacja-Technika-Informatyka

BibTeX
@article{article,
author = {Bolanowski, Marek and Krutys, Pawel},
year = {2015},
pages = {238-243},
title = {Metody i srodki zarzadzania infrastruktura sieciowa w zlolonym srodowisku laboratoryjnym},
volume = {6},
journal = {Edukacja-Technika-Informatyka}
}

LINK
2015 Gomółka Z., Żesławska E., Twaróg B., Paszkiewicz A. The use of the Circular Hough Transform for counting coins Measurement Automation Monitoring - Pomiary Automatyka Kontrola The paper presents the circular Hough transform in the process of detecting and counting coins. The issues of linear and circular Hough transform are discussed. An algorithm for counting coins in a threedimensional image using the discrete Hough space is demonstrated. Moreover, the results of the application for detecting and counting coins in a static image and video stream are presented. Observations of histograms for HSV and RGB color palettes, for different camera resolutions and various parameters of image segmentation, edge detection and smoothing filter have been made Hough transform, image detection, segmentation, digital image processing, edge detection

Gomółka Z., Żesławska E., Twaróg B., Paszkiewicz A. The use of the Circular Hough Transform for counting coins. Measurement Automation Monitoring - Pomiary Automatyka Kontrola. 2015, vol. 61, No. 9, pp. 434-437

RIS:
TY - JOUR
AU - Gomolka, Zbigniew
AU - Zeslawska, Ewa
AU - Twarog, Boguslaw
AU - Paszkiewicz, Andrzej
PY - 2015
SP - 434
EP - 437
T1 - The use of the Circular Hough Transform for counting coins
VL - 61
JO - Measurement Automation Monitoring - Pomiary Automatyka Kontrola 

BibTeX
@article{article,
author = {Gomolka, Zbigniew and Zeslawska, Ewa and Twarog, Boguslaw and Paszkiewicz, Andrzej},
year = {2015},
pages = {434-437},
title = {The use of the Circular Hough Transform for counting coins},
volume = {61},
journal = {Measurement Automation Monitoring - Pomiary Automatyka Kontrola}
}

LINK
2015 Paszkiewicz A., Więch P., Gomółka Z.  Performance of a router based on NetFPGA-1Gb/s cards Measurement Automation Monitoring - Pomiary Automatyka Kontrola Providing a flexible platform that also allows prototyping new network solutions opens new possibilities for designers, researchers and administrators. This solution are NetFPGA systems. Their additional advantage is the possibility of testing new networking protocols in a real heterogeneous environment. Until now, it has been mainly possible by using software tools such as, e.g. Opnet Modeler. Despite the very good mapping network environment in this type of solutions, it is necessary to carry out tests in the real network for their correct evaluation. The paper focuses on the analysis of the solution performance based on NetFPGA-1G cards as an alternative to the network nodes based on ASICs. Therefore a series of tests was carried out. They demonstrated the applicability of the platform in different layers of the network, e.g. access, aggregation, or core. Thus, the paper goal is to show the possibilities of using NetFPGA solutions in a network environment mainly of enterprise class. NetFPGA; computer networks; routing protocols; performance

Paszkiewicz A., Gomółka Z., Więch P. Performance of a router based on NetFPGA-1Gb/s cards. Measurement Automation Monitoring - Pomiary Automatyka Kontrola. 2015, vol. 61, No. 9, pp. 446-449

RIS:
TY - JOUR
AU - Paszkiewicz, Andrzej
AU - Wiech, Pawel
AU - Gomolka, Zbigniew
PY - 2015/09/01
SP - 446
EP - 449
T1 - The use of the Circular Hough Transform for counting coins
VL - 61
JO - Measurement Automation Monitoring
ER -

BibTeX
@article{article,
author = {Paszkiewicz, Andrzej and Wiecj, Pawel and Gomolka, Zbigniew},
year = {2015},
month = {09},
pages = {446-449},
title = {The use of the Circular Hough Transform for counting coins},
volume = {61},
journal = {Measurement Automation Monitoring}
}

LINK
2015 Bolanowski M., Twaróg B., Mlicki R. Anomalies detection in computer networks with the use of SDN Measurement Automation Monitoring - Pomiary Automatyka Kontrola In the paper, the authors present a method of anomalies detection and identification in network traffic using statistical signatures. There is also shown a new system architecture based on the Software-Defined Networking (SDN) which allows for application of statistical anomaly detection in computer networks. With the proposed hardware-software model, it becomes possible to implement custom algorithms for the threats detection with the use of recognized and secure communications standards. The proposed architecture has been built based on an open-source solutions and can be used directly in production environments. anomaly detection, statistical signature, computer network, software defined network Bolanowski M., Twaróg B., Mlicki R. Anomalies detection in computer networks with the use of SDN. Measurement Automation Monitoring - Pomiary Automatyka Kontrola. 2015, vol. 61, No. 9, pp. 443-445

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Twarog, Boguslaw
AU - Mlicki, Rafal.
PY - 2015/09/01
SP - 443
EP - 445
T1 - Anomalies detection in computer networks with the use of SDN
VL - 61
JO - Measurement Automation Monitoring
ER -

BibTex:
@article{article,
author = {Bolanowski, Marek and Twarog, Boguslaw and Mlicki, Rafal.},
year = {2015},
month = {09},
pages = {443-445},
title = {Anomalies detection in computer networks with the use of SDN},
volume = {61},
journal = {Measurement Automation Monitoring}
}

LINK
2015 Bolanowski M., Gomółka Z., Żesławska E., Twaróg B. Restitution of 3D scenery with coherent and structured light scanner technologies Measurement Automation Monitoring - Pomiary Automatyka Kontrola In the paper, there is presented the comparison of the quality of three-dimensional object measurement by scanning devices using a coherent light beam and a structured light field. Several selected issues from the fringe pattern analysis, as well as the characteristics of terrestrial laser scanning are also presented. The comparative analysis was performed to scan a crankshaft in order to assess the measurement accuracy of both scanners. By applying the appropriate software for the resulting point clouds we created a three-dimensional model of the crankshaft and made adequate comparative measures. 3D scenery restitution, coherent light scanner, a structured light scanner, point clouds Bolanowski M., Gomółka Z., Żesławska E., Twaróg B. Restitution of 3D scenery with coherent and structured light scanner technologies. Measurement Automation Monitoring - Pomiary Automatyka Kontrola. 2015, vol. 61, No. 9, pp. 430-433

RIS:
TY - JOUR
AU - Gomolka, Zbigniew
AU - Zeslawska, Ewa
AU - Twarog, Boguslaw
AU - Bolanowski, Marek
PY - 2015/09/01
SP - 430
EP - 433
T1 - Restitution of 3D scenery with coherent and structured light scanner technologies
VL - 61
ER -

BibTex:
@article{article,
author = {Gomolka, Zbigniew and Zeslawska, Ewa and Twarog, Boguslaw and Bolanowski, Marek},
year = {2015},
month = {09},
pages = {430-433},
title = {Restitution of 3D scenery with coherent and structured light scanner technologies},
volume = {61}
}

LINK
2015 Dymora P., Mazurek M., Jaskółka S. Analiza statystyczna pracy sieci komputerowej w środowisku LabView Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika Analiza ruchu sieciowego oraz metod wykrywania nieprawidłowości pracy urządzeń sieciowych stanowi ciekawy problem dla analityków badających sieci komputerowe. Poprawna interpretacja anomalii oraz odpowiednia reakcja na nie może poprawić jakość działania sieci, zapobiec awarii lub skrócić jej czas. W artykule przedstawiono oryginalną aplikację utworzoną w środowisku LabVIEW, z zaimplementowanymi algorytmami do wyznaczania współczynnika Hursta, będącego miarą samopodobieństwa i określenia zależności długoterminowych oraz multifraktalności ruchu sieciowego. Celem aplikacji było zaimplementowanie znanych metod wyznaczania współczynnika Hursta m.in. metody statystyki R/S, metody wartości bezwzględnej oraz zagregowanej wariancji - jako aparatu statystycznego do określenia cech ruchu sieciowego. W badaniach wykorzystano wirtualną sieć testową, której model utworzono w środowisku OPNET Modeler. Przeprowadzona w programie analiza statystyczna wskazała, że poziom samopodobieństwa ruchu sieciowego zawiera się w przedziale od 0,5 do 1, zaś jego wartość przybiera wyższe wartości wraz z rosnącym wypełnieniem pasma sieci. Nieprzerwany ruch sieciowy o małym natężeniu (np. ruch typu VoIP) posiada samopodobieństwo porównywalne do szumu białego równe 0,5 co zaprezentowano w artykule. współczynnik Hursta, wykrywanie anomalii sieci komputerowych, samopodobieństwo, zależności długoterminowe, systemy złożone

Dymora P., Mazurek M., Jaskółka S. Analiza statystyczna pracy sieci komputerowej w środowisku LabView. Zeszyty Naukowe Politechniki Rzeszowskiej. Elektrotechnika. 2015, vol. XXIII, No. 34 (2/2015), pp. 323-340

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Jaskolka, Slawomir
PY - 2015/01/01
SP - 323
EP - 340
T1 - Analiza statystyczna pracy sieci komputerowej w srodowisku LabView
DO - 10.7862/re.2015.24
JO - Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics
VL - XXIII 

BibTeX
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Jsakolka, Slawomir},
year = {2015},
month = {01},
pages = {323-340},
title = { Analiza statystyczna pracy sieci komputerowej w srodowisku LabView },
journal = {Scientific Journals of Rzeszów University of Technology, Series: Electrotechnics},
doi = {10.7862/re.2015.24}
}

LINK
2014 Grabowski F.,  Paszkiewicz A., Bolanowski M. Load balancing of communication channels with the use of routing protocols Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica In the article the authors propose a method for load-balancing of network resources for the case which uses a routing protocols. In the first part of the article the authors present currently used algorithms for load balancing and possibilities of their modification. Through the introduction of additional hardware components for each node: the agent and the probe; it is possible to monitor and control the current system performance. The whole analyzed network is treated as a complex system. This allows to eliminate overloading of route nodes (through ongoing analysis of the optimal operating point for a given node). Load balancing can be achieved using a modified mechanism of ECMP. The proposed approach allows for dynamic adjustment of load to network resources and thus effectively to balance network traffic. Grabowski F., Paszkiewicz A., Bolanowski M.Load balancing of communication channels with the use of routing protocols. Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica. 2014, vol. 14, No. 3 (2014), pp. 77-85

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Paszkiewicz, Andrzej
AU - Bolanowski, Marek
PY - 2014/11/20
SP - 77
EP - 85
T1 - Load balancing of communication channels with the use of routing protocols
VL - 14
DO - 10.2478/umcsinfo-2014-0024
JO - Annales UMCS, Informatica
ER -

BibTex:
@article{article,
author = {Grabowski, Franciszek and Paszkiewicz, Andrzej and Bolanowski, Marek},
year = {2014},
month = {11},
pages = {77-85},
title = {Load balancing of communication channels with the use of routing protocols},
volume = {14},
journal = {Annales UMCS, Informatica},
doi = {10.2478/umcsinfo-2014-0024}
}

LINK
2014 Grabowski F., Bolanowski M., Paszkiewicz A. Queuing in terms of complex systems Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica Limited resources are a natural feature of most real systems, both artificial and natural ones. This causes the need for effective management of access to existing resources. In this area, queuing systems are of special application. However, they are treated as simple systems for which two states are characteristic: work underload and work on the border of thermodynamic equilibrium. This approach is reflected in existing queue management mechanisms, that need to keep them in one of two mentioned states. On the other hand, they should be considered from the point of complex systems view, for which the third operation states: overload state is natural as well. In order to be closer to this issue, in this paper the authors consider queues performance from the perspective of complex systems. Grabowski F., Bolanowski M., Paszkiewicz A. Queuing in terms of complex systems. Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica. 2014, vol. 14, No. 3 (2014), pp. 7-14

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Paszkiewicz, Andrzej
AU - Bolanowski, Marek
PY - 2014/11/20
SP - 7
EP - 14
T1 - Queuing in terms of complex systems
VL - 14
DO - 10.2478/umcsinfo-2014-0016
JO - Annales UMCS, Informatica
ER -

BibTex:
@article{article,
author = {Grabowski, Franciszek and Paszkiewicz, Andrzej and Bolanowski, Marek},
year = {2014},
month = {11},
pages = {7-14},
title = {Queuing in terms of complex systems},
volume = {14},
journal = {Annales UMCS, Informatica},
doi = {10.2478/umcsinfo-2014-0016}
}

LINK
2014 Dymora P., Mazurek M., Żelazny K. Operating system efficiency evaluation on the base on measurements analysis with the use of non-extensive statistics elements Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica The major goal of this article was to evaluate the efficiency of Linux operating system using statistical self-similarity and multifractal analysis. In order to collect the necessary data, the tools available in Linux such as vmstat, top and iostat were used. The measurement data collected with those tools had to be converted into a format acceptable by applications which analyze statistical selfsimilarity and multifractal spectra. Measurements collected while using the MySQL database system in a host operating system were therefore analyzed with the use of statistical self-similarity and allowed to determine the occurrence of long-range dependencies. Those dependencies were analyzed with the use of adequately graduated diagrams. Multifractal analysis was conducted with the help of FracLab application. Two methods were applied to determine the multifractal spectra. The obtained spectra were analyzed in order to establish the multifractal dependencies. Dymora P., Mazurek M., Żelazny K. Operating system efficiency evaluation on the base on measurements analysis with the use of non-extensive statistics elements. Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica. 2014, vol. 14, No. 3 (2014), pp. 65-75

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Zelazny, Kamil
PY - 2014/11/20
SP - 65
EP - 75
T1 - Operating system efficiency evaluation on the base of measurements analysis with the use of non-extensive statistics elements
VL - 14
DO - 10.2478/umcsinfo-2014-0015
JO - Annales UMCS, Informatica
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Zelazny, Kamil},
year = {2014},
month = {11},
pages = {65-75},
title = {Operating system efficiency evaluation on the base of measurements analysis with the use of non-extensive statistics elements},
volume = {14},
journal = {Annales UMCS, Informatica},
doi = {10.2478/umcsinfo-2014-0015}
}

LINK
2014 Dymora P., Mazurek M., Pilecki T. Performance analysis of VPN remote access tunnels Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica The purpose of the study is to analyze the efficiency of communication with the server using the methods of secure remote access, as well as checking and comparing the quality of services provided by the server depending on the method of secure remote connection. The article focuses on VPN technology implemented in the latest Windows Server 2012 R2 operating system. Dymora P., Mazurek M., Pilecki T. Performance analysis of VPN remote access tunnels. Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica. 2014, vol. 14, No. 3 (2014), pp. 53-64

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Pilecki, Tomasz
PY - 2014/09/01
SP - 53
EP - 64
T1 - Performance Analysis of VPN Remote Access Tunnels
VL - 14
DO - 10.2478/umcsinfo-2014-0014
JO - Annales UMCS, Informatica
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Pilecki, Tomasz},
year = {2014},
month = {09},
pages = {53-64},
title = {Performance Analysis of VPN Remote Access Tunnels},
volume = {14},
journal = {Annales UMCS, Informatica},
doi = {10.2478/umcsinfo-2014-0014}
}

LINK
2014 Grabowski F., Paszkiewicz A., Bolanowski M. Wykorzystanie teorii małych światów w e-learningu EDUKACJA - TECHNIKA - INFORMATYKA The article presents the issues related to the use of the small worlds theory in order to determine a group of people potentially interested in the educational offer in the form of e-learning. Proposed mechanism which allows selection of the group on the basis of information collected available in social networks. small world, e-learning

Grabowski F., Paszkiewicz A., Bolanowski M. Wykorzystanie teorii małych światów w e-learningu. Edukacja-Technika-Informatyka. 2014, vol. 5, No. 2, pp. 245-251

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Paszkiewicz, Andrzej
AU - Bolanowski, Marek
PY - 2014
SP - 245
EP - 251
T1 - Wykorzystanie teorii malych swiatow w e-learningu
VL - 5
JO - Edukacja-Technika-Informatyka

BibTeX
@article{article,
author = {Grabowski, Franciszek and Paszkiewicz, Andrzej and Bolanowski, Marek},
year = {2014},
pages = {245-251},
title = {Wykorzystanie teorii malych swiatow w e-learningu},
volume = {5},
journal = {Edukacja-Technika-Informatyka}
}

LINK
2014 Bolanowski M., Paszkiewicz A. Metody i środki zapewnienia dostępu do specjalizowanych zasobów laboratoryjnych EDUKACJA - TECHNIKA - INFORMATYKA W artykule przedstawiono metody i środki zarządzania oraz optymalizacji dostępu do zasobów laboratorium sieci komputerowych. Zaprezentowano apli-kacje do automatyzacji zapisu, odtwarzania konfiguracji urządzeń i gromadzenia wyników oraz wskazano protokoły, które mogą być użyte w tym celu. Zaproponowana została również metoda automatyzacji zmian konfiguracyjnych uzależniona od bieżącej analizy parametrów pomiarowych. sieci komputerowe, dostęp do zasobów laboratoryjnych, zarządzanie sieciami

Bolanowski M., Paszkiewicz A. Metody i środki zapewnienia dostępu do specjalizowanych zasobów laboratoryjnych. Edukacja-Technika-Informatyka. 2014, vol. 5, No. 2, pp. 334-341

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
PY - 2014
SP - 334
EP - 341
T1 - Metody i srodki zapewnienia dostepu do specjalizowanych zasobow laboratoryjnych
VL - 5
JO - Edukacja-Technika-Informatyka

BibTeX
@article{article,
author = {Bolanowski, Marek and Paszkiewicz, Andrzej},
year = {2014},
pages = {334-341},
title = {Metody i srodki zapewnienia dostepu do specjalizowanych zasobow laboratoryjnych},
volume = {5},
journal = {Edukacja-Technika-Informatyka}
}

LINK
2014 Dymora P., Mazurek M., Hadaj P. Education set for collecting and visualizing data using sensor system based on AVR microcontroller International Journal of Modern Engineering Research This article presents the issues of the wireless sensor measuring systems design which might be used in education process of computer science faculty. The work shows the integration of a simple measuring system, data management system, visual system and the hardware. Education set is designed to consolidate knowledge in many fields of computer science and the interdependence between them, as programming techniques, database, Web server, communications protocols, software and hardware. Presented measuring sensor system consists of a number of measurement nodes, whose role is to provide information about certain desirable characteristics, warning against natural hazards or violation of the physical safety. An important part of the sensor system is a measuring subsystem and the collecting measurement data subsystem. The article presents the temperature measurement sensor system concepts and measurement data storage and visualization methods. microcontrollers AVR, sensor, wireless sensor networks protocols, measuring system

Dymora P., Mazurek M., Hadaj P. Education set for collecting and visualizing data using sensor system based on AVR microcontroller. International Journal of Modern Engineering Research. 2014, vol. 4, No. 10, pp. 38-42

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Hadaj, Piotr
PY - 2014
SP - 334
EP - 341
T1 - Education set for collecting and visualizing data using sensor system based on AVR microcontroller
VL - 4
JO - International Journal of Modern Engineering Research
DO - 10.6084/m9.figshare.1241222

BibTeX
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw, and Hadaj, Piotr},
year = {2014},
pages = {334-341},
title = {Education set for collecting and visualizing data using sensor system based on AVR microcontroller},
volume = {4},
journal = {International Journal of Modern Engineering Research}
doi = {10.6084/m9.figshare.1241222}
}

LINK
2014 Strzałka D.  Long-range dependencies and statistical self-similarity in computer memory system Journal of Circuits Systems and Computers This paper shows the problem of possible existence of statistical self-similarity and long-range (long-term) dependencies in behavior of computer memory systems. It will be shown, that the hierarchical structure of memory and the dispersion of time constants during accessing successive levels of such a structure, lead to "memory effect" and self-similarity. These effects have not been taken into account so far in computer systems design, management and description. A few methods were used to calculate the Hurst H coefficient, which reflects the statistical self-similarity in time series and the d parameter that represents the problem of long-range dependencies. Statistical self-similarity, computer memory systemprocessing, complex systems Strzałka D.  Long-range dependencies and statistical self-similarity in computer memory system. Journal of Circuits Systems and Computers. 2015, vol. 24, No. 3, p. 1550031

RIS:
TY - JOUR
AU - Strzalka, Dominik
PY - 2015/03/01
SP - 1550031
T1 - Long-Range Dependencies and Statistical Self-Similarity in Computer Memory System
VL - 24
DO - 10.1142/S0218126615500310
JO - Journal of Circuits, Systems and Computers
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik},
year = {2015},
month = {03},
pages = {1550031},
title = {Long-Range Dependencies and Statistical Self-Similarity in Computer Memory System},
volume = {24},
journal = {Journal of Circuits, Systems and Computers},
doi = {10.1142/S0218126615500310}
}

LINK
2014 Grabowski F., Bolanowski M., Paszkiewicz A. Wireless networks environment and complex networks Lecture Notes in Electrical Engineering The process of creating software for modeling and simulation of phenomena taking place in computer networks should take into account many aspects of their functioning. However, until now, the creation of such software was based on a reductionist approach. This approach is typical for simple or most complicated systems. In contrast, software for modeling and simulation of computer networks should be treated as a complex system. Therefore, the process of its creation should take into account such properties of complex systems as: feedback loop, non-extensivity, indeterminacy, self-similarity, non-additivity, etc. The authors use computer simulators in their work on everyday basis. However, they have generally an outdated, static architecture that prevents their easy and continuous development. Therefore, the authors started working on developing their own model of creating such software and this paper is an introduction to this issue. The authors focused on the selected features of complex systems in the context of the software development process. Based on the feedback loop, a new spiral of software development and modeling for computer networks is presented. The paper also defines the notion of process and functional non-additivity and its importance in the software development process. The presented approach allows for flexible development of the software under consideration in terms of their functionality. The authors also presented examples of application of complex system properties when creating selected functional modules of software for modeling and simulation of computer networks. Grabowski F., Bolanowski M., Paszkiewicz A. Wireless networks environment and complex networks. Lecture Notes in Electrical Engineering. 2014, vol. 324, pp. 261-270

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Paszkiewicz, Andrzej
AU - Bolanowski, Marek
PY - 2015/11/01
SP - 261
EP - 270
T1 - Wireless Networks Environment and Complex Networks
VL - 324
DO - 10.1007/978-3-319-11248-0_20
JO - Lecture Notes in Electrical Engineering
ER -

BibTex:
@article{article,
author = {Grabowski, Franciszek and Paszkiewicz, Andrzej and Bolanowski, Marek},
year = {2015},
month = {11},
pages = {261-270},
title = {Wireless Networks Environment and Complex Networks},
volume = {324},
journal = {Lecture Notes in Electrical Engineering},
doi = {10.1007/978-3-319-11248-0_20}
}

LINK
2014 Dymora P., Mazurek M. Network Anomaly Detection Based on the Statistical Self-similarity Factor Lecture Notes in Electrical Engineering Self-similarity analysis and anomaly detection in networks are interesting fields of research and scientific work of scientists around the world. Simulation studies have demonstrated that the Hurst parameter estimation can be used to detect traffic anomaly. The actual network traffic is self-similar or long-range dependent. The dramatic expansion of applications on modern networks gives rise to a fundamental challenge to network security. The Hurst values are compared with confidence intervals of normal values to detect anomaly in VoIP. Hurst factor, anomaly detection, self-similarity, long-range dependence Dymora P., Mazurek M. Network Anomaly Detection Based on the Statistical Self-similarity Factor. Lecture Notes in Electrical Engineering. 2014, vol. 324, pp. 271-287

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2015/11/01
SP - 271
EP - 287
T1 - Network Anomaly Detection Based on the Statistical Self-similarity Factor
VL - 324
DO - 10.1007/978-3-319-11248-0_21
JO - Lecture Notes in Electrical Engineering
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw},
year = {2015},
month = {11},
pages = {271-287},
title = {Network Anomaly Detection Based on the Statistical Self-similarity Factor},
volume = {324},
journal = {Lecture Notes in Electrical Engineering},
doi = {10.1007/978-3-319-11248-0_21}
}

LINK
2014 Bolanowski M., Paszkiewicz A. The use of statistical signatures to detect anomalies in computer network Lecture Notes in Electrical Engineering This article presents a new approach for detecting anomalies in the computer network. The approach is based on the determination of the network traffic statistical parameters in case of normal condition. When network anomaly happens, usually more than one statistical parameter is change. A set of parameters that have changed can be used to identify threats. Currently, anomaly detection mechanisms used in the network traffic are computationally complex and cannot be used in case of high speed connection. The presented method does not guarantee the anomaly identification but can be used as one of the indicators used for the isolation of suspicious flows (through ongoing modifications the routing or switching rules). Separated flow is subjected to further analysis with use of classical methods for anomaly detection. With this approach it is possible to make a rough anomaly identification in the core of high speed computer network.

Bolanowski M., Paszkiewicz A. The use of statistical signatures to detect anomalies in computer network. Lecture Notes in Electrical Engineering. 2014, vol. 324, pp. 251-260

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
PY – 2014/11/01
SP - 251
EP - 260
T1 - The use of statistical signatures to detect anomalies in computer network
VL - 324
DO - 10.1007/978-3-319-11248-0_19
JO - Lecture Notes in Electrical Engineering
ER -

BibTex:
@article{article,
author = {Bolanowski, Marek and Paszkiewicz, Andrzej},
year = {2014},
month = {01},
pages = {251-260},
title = {The use of statistical signatures to detect anomalies in computer network },
volume = {324},
journal = {Lecture Notes in Electrical Engineering},
doi = {10.1007/978-3-319-11248-0_19}
}

LINK
2014 Paszkiewicz A., Bolanowski M., Zawodnik D. Measurements of routing protocols performace for high-throughput computer networks in OPNET environment Pomiary Automatyka Kontrola W ostatnich latach jesteśmy światkami gwałtownego rozwoju systemów informatycznych, zwłaszcza systemów rozproszonych. Jednym z istotnych składników tychże systemów jest infrastruktura komunikacyjna, składająca się zarówno z topologii połączeniowej, jak również z protokołów routingu. W artykule przedstawiono analizę powszechnie wykorzystywanych protokołów routingu w wysokoprzepustowych sieciach komputerowych przeprowadzoną w środowisku Opnet. Zaprezentowano możliwości analizy takich protokołów dla różnych środowisk topologicznych. Dokonano pomiarów istotnych parametrów takich jak czas zbieżności, obciążenie łącza, itp. z punktu widzenia wydajności funkcjonowania protokołów routingu. Dodatkowo, zaproponowano wykorzystanie topologii Butterfly dla stworzenia efektywnego środowiska routingu w sieciach komputerowych bazujących na klasycznym trójwarstwowym systemie połączeniowym. Sieci komputerowe, protokoły routingu, OPNET Paszkiewicz A., Bolanowski M., Zawodnik D. Measurements of routing protocols performace for high-throughput computer networks in OPNET environment. Pomiary Automatyka Kontrola. 2014, vol. 60, No. 10, pp. 858-861

RIS:
TY - JOUR
AU - Paszkiewicz, Andrzej
AU - Bolanowski, Marek
AU - Zawodnik Damian
PY - 2014/09/02
SP - 858
EP - 861
T1 - Measurements of routing protocols performace for high-throughput computer networks in OPNET environment
VL - 60
JO - Pomiary Automatyka Kontrolag
ER -

BibTex:
@article{article,
author = { Paszkiewicz, Andrzej and Bolanowski, Marek and Zawodnik Damian},
year = {2014},
month = {09},
pages = {858-861},
title = {Measurements of routing protocols performace for high-throughput computer networks in OPNET environment },
volume = {60},
journal = {Pomiary Automatyka Kontrolag},

LINK
2014 Dymora P., Mazurek M., Maciąg P. System monitorujacy prace bezprzewodowej sieci sensorowej oparty na przestrzennych typach danych Pomiary Automatyka Kontrola Sieci sensorowe znajdują zastosowanie nie tylko w budowie systemów ostrzegających przed zagrożeniami naturalnymi, ale również w projektowaniu inteligentnych budynków czy specjalistycznej aparatury medycznej. System sensorowy składa się zazwyczaj z pewnej liczby węzłów pomiarowych, których zadaniem jest dostarczanie informacji o pewnych pożądanych parametrach. Parametry te mogą mówić np. o stanie poziomu wód rzecznych, stężeniu niebezpiecznych gazów czy występowaniu substancji niebezpiecznych dla środowiska naturalnego. Dobrze zaprojektowana sieć sensorowa powinna cechować się redundancją, możliwością routowania danych pomiędzy węzłami pomiarowymi oraz wykorzystaniem odpowiedniego mechanizmu dostępu do pasma komunikacyjnego. Istotną część systemu sensorowego stanowi aplikacja monitorująca oraz wizualizująca stan sensorów. W niniejszym artykule przedstawiono oryginalne podejście do budowy sieci sensorowej i wizualizacji jej działania z użyciem przestrzennych typów danych. Przestrzenne typy danych, mikroprocesor AVR, protokoły bezprzewodowych sieci sensorowych Dymora P., Mazurek M., Maciąg P. System monitorujacy prace bezprzewodowej sieci sensorowej oparty na przestrzennych typach danych. Pomiary Automatyka Kontrola. 2014, vol. 60, No. 10, pp. 849-853

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Maciag Piotr
PY - 2014/09/02
SP - 849
EP - 853
T1 - System monitorujacy prace bezprzewodowej sieci sensorowej oparty na przestrzennych typach danych
VL - 60
JO - Pomiary Automatyka Kontrolag
ER -

BibTex:
@article{article,
author = { Dymora Pawel and Mazurek Miroslaw and Maciag Piotr},
year = {2014},
month = {09},
pages = {849-853},
title = {System monitorujacy prace bezprzewodowej sieci sensorowej oparty na przestrzennych typach danych },
volume = {60},
journal = {Pomiary Automatyka Kontrolag},

LINK
2014 Bolanowski M., Paszkiewicz A., Zapała P., Żak R. Stress test of network devices with maximum traffic load for second and third layer of ISO/OSI model Pomiary Automatyka Kontrola Odpowiedni dobór urządzeń sieciowych ma kluczowy wpływ na cały proces projektowania i budowy współczesnego systemu komunikacyjnego. W chwili obecnej testy wydajnościowe urządzeń sieciowych realizowane są najczęściej przez wyspecjalizowane laboratoria lub przez samych producentów urządzeń sieciowych. Do ich przeprowadzenia wymagane jest wygenerowanie ruchu testowego charakteryzującego się niejednokrotnie przepustowościami na poziomie 100 i więcej Gb/s. Autorzy w artykule zaproponowali własne topologie testowe które pozwalają wysycić wszystkie porty testowanego urządzenia. Bazują one na zapętlaniu ruchu pomiędzy portami lub instancjami rutingu. We wstępie autorzy prezentują jak aktualnie realizowane są tego typu testy urządzeń. W rozdziale drugim zaprezentowane zostały elementy składowe stanowiska badawczego. W rozdziale trzecim zaprezentowana została topologia wykorzystywana do realizacji testów w warstwie drugiej modelu ISO/OSI, oraz pokazano wpływ ruchu testowego na wybrane elementy sprzętowe urządzenia. W rozdziale czwartym zaproponowano topologie wysycania ruchem dwóch urządzeń testowych bazującą na zapętleniu ruchu z wykorzystaniem VRF i protokołu OSPF. Takie podejście, bazujące na otwartych standardach pozwala na samodzielną realizację testów urządzeń przez klienta końcowego, który może sprawdzić działanie interesujących go protokołów w środowisku granicznie wysyconego ruchem urządzenia sieciowego. Należy jednak pamiętać, że przedstawiona metoda służy jedynie do generowania obciążenia na portach urządzenia. Może to być dobra podstawa do zrealizowania właściwych testów określonych usług lub protokołów. Sieci komputerowe, testy wydajnościowe, urządzenia sieciowe, model ISO/OSI Bolanowski M., Paszkiewicz A., Zapała P., Żak R. Stress test of network devices with maximum traffic load for second and third layer of ISO/OSI model. Pomiary Automatyka Kontrola. 2014, vol. 60, No. 10, pp. 854-857

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
AU - Zapala Przemyslaw
AU - Zak Rafal
PY - 2014/09/02
SP - 854
EP - 857
T1 - Stress test of network devices with maximum traffic load for second and third layer of ISO/OSI model
VL - 60
JO - Pomiary Automatyka Kontrolag
ER -

BibTex:
@article{article,
author = { Bolanowski Marek and Paszkiewicz Andrzej and Zapala Przemyslaw and Zak Rafal},
year = {2014},
month = {09},
pages = {854-857},
title = {Stress test of network devices with maximum traffic load for second and third layer of ISO/OSI model },
volume = {60},
journal = {Pomiary Automatyka Kontrolag},

LINK
2014 Dymora P., Mazurek M., Strzałka D. Long-range dependencies in quick-sort algorithm Przegląd Elektrotechniczny Sortowanie jest jednym z najczęstszych wykorzystywanych typów przetwarzania w systemach komputerowych. W prezentowanym podejściu sortowanie będzie rozważane jako wprowadzenie porządku w przetwarzanym zadaniu wejściowym oraz algorytm jako fizyczny system (odpowiedzialny za obliczenia). Zazwyczaj analiza zachowania dowolnego algorytmu jest realizowana w kontekście klasycznej złożoności obliczeniowej. W niniejszej pracy istnienie zależności długoterminowych w dynamice przetwarzania jest wyznaczane w oparciu o współczynnik Hurst’a. Zależności długoterminowe, algorytm szybkiego sortowania, współczynnik Hursta, samopodobieństwo Dymora P., Mazurek M., Strzałka D. Long-range dependencies in quick-sort algorithm. Przegląd Elektrotechniczny. 2014, vol. 90, No. 1, pp. 149-152

RIS:
TY - JOUR
AU - Strzalka, Dominik
AU - Mazurek, Miroslaw
AU - Dymora, Pawel
PY - 2014/01/01
SP - 149
EP - 152
T1 - Long-range dependencies in quick-sort algorithm
VL - 90
JO - Przeglad Elektrotechniczny
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik and Mazurek, Miroslaw and Dymora, Pawel},
year = {2014},
month = {01},
pages = {149-152},
title = {Long-range dependencies in quick-sort algorithm},
volume = {90},
journal = {Przeglad Elektrotechniczny}
}

LINK
2014 Dymora P., Mazurek M. Network anomaly detection based on the statistical self-similarity factor for HTTP protocol Przegląd Elektrotechniczny Analiza samopodobieństwa i wykrywania nieprawidłowości działania sieci stanowi interesujący problem dla naukowców na całym świecie. W artykule pokazano wykorzystanie współczynnika Hursta, jako parametru na podstawie którego można wykryć wszelkie anomalia pracy sieci. Odchylenia od wartości bazowej parametru Hursta w czasie pracy mogą sygnalizować nieprawidłowości działania. Badania mogą obejmować dowolny typ ruchu np. usługi HTTP. Współczynnik Hursta, wykrywanie anomalii, samopodobieństwo, zależności długozasięgowe Dymora P., Mazurek M. Network anomaly detection based on the statistical self-similarity factor for HTTP protocol. Przegląd Elektrotechniczny. 2014, vol. 90, No. 1, pp. 127-130

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2014/09/02
SP - 127
EP - 130
T1 - Network anomaly detection based on the statistical self-similarity factor for HTTP protocol
VL - 90
DO - 10.12915/pe.2014.01.30
JO - Przeglad Elektrotechniczny
ER -

BibTex:
@article{article,
author = { Dymora Pawel and Mazurek Miroslaw },
year = {2014},
month = {01},
pages = {127-130},
title = {Network anomaly detection based on the statistical self-similarity factor for HTTP protocol },
volume = {90},
journal = {Przeglad Elektrotechniczny},
doi = {10.12915/pe.2014.01.30}
}

LINK
2014 Dymora P., Mazurek M. A comparative study of self-adopting fault tolerant protocols in wireless sensor networks Przegląd Elektrotechniczny Technologia bezprzewodowych sieci sensorowych pojawia się w wielu obszarach współczesnego życia. Ważną rolę w tej technologii odgrywają samoadaptacyjne protokoły poprzez które sieć reaguje na zachodzące w niej zmiany i uszkodzenia, dostosowuje się i efektywnie zarządza dostępnymi zasobami. W pracy przedstawiono analizę porównawczą istniejących rozwiązań w dziedzinie odpornych na uszkodzenia samoadaptacyjnych protokołów. Symulacje realizowano w środowisku OMNeT++. Bezprzewodowe sieci sensorowe, odporność na uszkodzenia, samoadaptacyjne protokoły OMNeT++ Dymora P., Mazurek M. A comparative study of self-adopting fault tolerant protocols in wireless sensor networks. Przegląd Elektrotechniczny. 2014, vol. 90, No. 1, pp. 167-170

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2014/01/01
SP - 167
EP - 170
T1 - A comparative study of self-adopting fault tolerant protocols in wireless sensor networks
VL - 90
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw},
year = {2014},
month = {01},
pages = {167-170},
title = {A comparative study of self-adopting fault tolerant protocols in wireless sensor networks},
volume = {90}
}

LINK
2014 Nycz M., Mlicki R., Michno B. Analiza podatności na ataki socjotechniczne w Jednostce Samorządu Terytorialnego Zeszyty Naukowe WSEI seria TRANSPORT i INFORMATYKA Celem tej analizy było sprawdzenie po- datności na ataki socjotechniczne w lo- kalnej siedzibie samorządu terytorial- nego. W tym celu została opracowana ankieta, w których poruszono problemy bezpieczeństwa informacji na poziomie zarówno podstawowym jak i bardziej rozbudowanym. Ankietowani odpowia- dali na około 20 pytań. Wyniki ankiety dały podstawy do zbudowania przybli- żonych profili ankietowanych wraz z po- ziomem ich podatności na określone zagrożenia socjotechniczne, m. in. w In- ternecie. Ze względów bezpieczeństwa ankieta oraz jej bezpośrednie wyniki nie będą ujawniane. socjotechnika, ankieta, bezpieczeństwo, analiza, podatność Nycz M., Mlicki R., Michno B. Analiza podatności na ataki socjotechniczne w Jednostce Samorządu Terytorialnego. Zeszyty Naukowe WSEI seria TRANSPORT i INFORMATYKA. 2014, vol. 4, No. 1 (2014), pp. 5-10

RIS:
TY - JOUR
AU - Nycz, Mariusz
AU - Mlicki, Rafal
AU - Michno Bartosz
PY - 2014/09/01
SP - 5
EP - 10
T1 - Analiza podatnosci na ataki socjotechniczne w Jednostce Samorzadu Terytorialnego
VL - 90
JO - Zeszyty Naukowe WSEI seria TRANSPORT i INFORMATYKA
ER -

BibTex:
@article{article,
author = { Nycz, Mariusz and Mlicki, Rafal and Michno Bartosz },
year = {2014},
month = {01},
pages = {5-10},
title = {Analiza podatnosci na ataki socjotechniczne w Jednostce Samorzadu Terytorialnego },
volume = {4},
journal = {Zeszyty Naukowe WSEI seria TRANSPORT i INFORMATYKA}

LINK
2013 Dymora P., Mazurek M., Strzałka D. Computer network traffic analysis with the use of statistical self-similarity factor Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica The optimal computer network performance models require accurate traffic models, which can capture the statistical characteristic of actual traffic. If the traffic models do not represent traffic accurately, one may overestimate or underestimate the network performance. The paper presents confirmation of the self-similar nature of the selected protocols in the computer network communication layer. It shows that the good measure of self-similarity is a Hurst factor. BRAK Dymora P., Mazurek M., Strzałka D. Computer network traffic analysis with the use of statistical self-similarity factor. Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica. 2013, vol. 13, No. 1 (2013), pp. 69-81

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslw
AU - Strzalka, Dominik
PY - 2013/01/01
SP - 69
EP - 81
T1 - Computer network traffic analysis with the use of statistical self-similarity factor
VL - 13
DO - 10.2478/v10065-012-0040-0
JO - Annales UMCS, Informatica
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Strzalka, Dominik},
year = {2013},
month = {01},
pages = {69-81},
title = {Computer network traffic analysis with the use of statistical self-similarity factor},
volume = {13},
journal = {Annales UMCS, Informatica},
doi = {10.2478/v10065-012-0040-0}
}

LINK
2013 Dymora P., Mazurek M., Płonka P. Simulation of reconfiguration problems in sensor networks using OMNeT++softwere Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica The paper presents a comparative analysis of reallocation algorithms in a structureof wireless sensor network in the event of a failure of network nodes. The article contains detailedresearch results of wireless sensor networks technology, with particular emphasis on thte network-layerprotocols - routing protocols. In the research the simulation environment OMNeT++ was used tostudy the properties of reconfiguration and reallocation problems in the wireless sensor network. BRAK Dymora P., Mazurek M., Płonka P. Simulation of reconfiguration problems in sensor networks using OMNeT++softwere. Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica. 2013, vol. 13, No. 1 (2013), pp. 49-67

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Plonka, Piotr
PY - 2013/01/01
SP - 49
EP - 67
T1 - Simulation of reconfiguration problems in sensor networks using OMNeT++ software
VL - 13
DO - 10.2478/v10065-012-0041-z
JO - Annales UMCS, Informatica
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Plonka, Piotr},
year = {2013},
month = {01},
pages = {49-67},
title = {Simulation of reconfiguration problems in sensor networks using OMNeT++ software},
volume = {13},
journal = {Annales UMCS, Informatica},
doi = {10.2478/v10065-012-0041-z}
}

LINK
2013 Bolanowski M., Paszkiewicz A., Zapała P. Convergent traffic in the environment of wireless MESH technology Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica The paper presents a performance study of wireless MESH networks in the contextof the convergent transmission. Nowadays, the integration of voice, video and data is becoming the norm. However, the wireless LAN environment, and especially MESH technology is an unfriendly environment due to its characteristics. Therefore, the impact of the size of transmitted frames to delays in the network based on mesh technology was analyzed. The sizes of transmitted framescorresponded to standards for Voice over IP, Video over IP that are commonly used. Additionally, a model of effective load balancing in mesh networks was presented. Then, the reliability and flexibility of these networks will be increased. BRAK Bolanowski M., Paszkiewicz A., Zapała P. Convergent traffic in the environment of wireless MESH technology. Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica. 2013, vol. 13, No. 2 (2013), pp. 83-95

RIS:
TY - JOUR
AU - Paszkiewicz, Andrzej
AU - Bolanowski, Marek
AU - Zapala, Przemyslaw
PY - 2013/01/01
SP - 83
EP - 95
T1 - Convergent traffic in the environment of wireless MESH technology
VL - 13
DO - 10.2478/v10065-012-0042-y
JO - Annales UMCS, Informatica
ER -

BibTex:
@article{article,
author = {Paszkiewicz, Andrzej and Bolanowski, Marek and Zapala, Przemyslaw},
year = {2013},
month = {01},
pages = {83-95},
title = {Convergent traffic in the environment of wireless MESH technology},
volume = {13},
journal = {Annales UMCS, Informatica},
doi = {10.2478/v10065-012-0042-y}
}

LINK
2013 Bolanowski M., Paszkiewicz A. A set of connection network synthesis based on the linear Diophantine constraints solution in area (0,1) Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica In the paper we present a method for synthesis of a set of connection networks, which fulfill the designer’s assumption. In order to do that, the designed network is presented as a system of Diophantine constraints in a special form. A method to resolve those systems is proposed, which is characterized by lower computational complexity, especially in the case of rare topologies design. BRAK Bolanowski M., Paszkiewicz A. A set of connection network synthesis based on the linear Diophantine constraints solution in area (0,1). Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica. 2013, vol. 13, No 1 (2013), pp. 11-21

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
PY - 2013/01/01
SP - 11
EP - 21
T1 - A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}
VL - 13
DO - 10.2478/v10065-012-0043-x
JO - Annales UMCS, Informatica
ER -

BibTex:
@article{article,
author = {Bolanowski, Marek and Paszkiewicz, Andrzej},
year = {2013},
month = {01},
pages = {11-21},
title = {A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}},
volume = {13},
journal = {Annales UMCS, Informatica},
doi = {10.2478/v10065-012-0043-x}
}

LINK
2013 Bolanowski M., Paszkiewicz A. Performance test of network devices Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica Selection of components in contemporary computer networks is extremely important, not only because of the project budget but also because of the network performance. Therefore, it is necessary to perform tests before deploying devices. In this paper the authors show that the performance of test network devices is dependent on the nature of network traffic including its statistical properties. Also a new hybrid model of the system for testing the network device based on the q-additivity of traffic flows was proposed. BRAK Bolanowski M., Paszkiewicz A. Performance test of network devices. Annales Universitatis Mariae Curie-Skłodowska, Sectio AI: Informatica. 2013, vol. 13, No. 2 (2013), pp. 29-36

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
PY - 2014/12/09
SP - 29
EP - 36
T1 - Performance test of network devices
VL - 13
DO - 10.2478/v10065-012-0044-9
JO - Annales UMCS, Informatica
ER -

BibTex:
@article{article,
author = { Bolanowski, Marek and Paszkiewicz, Andrzej },
year = {2014},
month = {12},
pages = {29-36},
title = {Performance test of network devices },
volume = {13},
journal = { Annales UMCS, Informatica},
doi = {10.2478/v10065-012-0044-9}
}

LINK
2013 Grabowski F.  Nonextensive model of self-organizing systems Complexity The article concerns the new nonextensive model of self‐organizing systems and consists of two interrelated parts. The first one presents a new nonextensive model of interaction between elements of systems. The second one concerns the relationship between microscopic and macroscopic processes in complex systems. It is shown that nonextensivity and self‐organization of systems is a result of mismatch between its elements. © 2013 Wiley Periodicals, Inc. Complexity 18: 28–36, 2013 Nonextensive, matching, self‐organization, systems Grabowski F.  Nonextensive model of self-organizing systems. Complexity. 2013, vol. 18, No 5, pp. 28-36

RIS:
TY - JOUR
AU - Grabowski, Franciszek
PY - 2013/05/01
SP - 28
EP - 36
T1 - Nonextensive model of self-organizing systems
VL - 18
DO - 10.1002/cplx.21438
JO - Complexity
ER -

BibTex:
@article{article,
author = {Grabowski, Franciszek},
year = {2013},
month = {05},
pages = {28-36},
title = {Nonextensive model of self-organizing systems},
volume = {18},
journal = {Complexity},
doi = {10.1002/cplx.21438}
}

LINK
2013 Dymora P., Mazurek M., Gawron R. Cluster computing performance in the context of nonextensive statistics International Journal of Modern Engineering Research This work presents the problem of clusters computing performance in the context of nonextensive statistics. Simulation studies have demonstrated that the cluster computing process is self-similar or long-range dependent and the Hurst coefficient estimation can be used to specify computing performance. The paper presents a comparison of several methods for estimating Hurst coefficient, characterized by simplicity of implementation and convergence results. Long-memory effect, complex system, cluster, stationarity, Hurst coefficient, nonextensive statistics Dymora P., Mazurek M., Gawron R. Cluster computing performance in the context of nonextensive statistics. International Journal of Modern Engineering Research. 2013, vol. 3, No 6, pp. 3872-3877

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Gawron, Rafal
PY - 2014/12/09
SP - 3872
EP - 3877
T1 - Cluster computing performance in the context of nonextensive statistics
VL - 3
JO - International Journal of Modern Engineering Research
ER -

BibTex:
@article{article,
author = { Dymora, Pawel and Mazurek, Miroslaw and Gawron, Rafal },
year = {2014},
month = {12},
pages = {3872-3877},
title = {Cluster computing performance in the context of nonextensive statistics},
volume = {13},
journal = { International Journal of Modern Engineering Research}

LINK
2013 Grabowski F., Bolanowski M., Paszkiewicz A. Computer networks as complex systems in nonextensive approach Journal of Applied Computer Science Contemporary computer networks fit into the category of complexsystems. However, many models still are based on an idealistic paradigmof simple systems based on thermodynamic equilibrium. In order to under-stand and optimize the design of real networks it is necessary to understandand describe their nonextensive operation aspects. Therefore, it is necessaryto explain such concepts as self-organization, self-adaptation and matchingload to finite resources. Complex systems, computer networks, nonextensive. Grabowski F., Bolanowski M., Paszkiewicz A. Computer networks as complex systems in nonextensive approach. Journal of Applied Computer Science. 2013, vol. 21, No. 2, pp. 31-44

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
PY - 2013
SP - 31
EP - 44
T1 - Computer networks as complex systems in nonextensive approach
VL - 21
JO - Journal of Applied Computer Science
ER -

BibTex:
@article{article,
author = { Grabowski, Franciszek and Bolanowski, Marek and Paszkiewicz, Andrzej },
year = {2013},
pages = { 31-44},
title = {Computer networks as complex systems in nonextensive approach},
volume = {13},
journal = { Journal of Applied Computer Science}

LINK
2013 Bolanowski M., Paszkiewicz A. Reconfiguration of logical communication channels Journal of Theoretical and Applied Computer Science In this paper a new reconfiguration of interconnection networks algorithm was proposed for the computational systems and the logical network connection. The proposed solution is based on the presentation of the network and base requirements in the form of linear Diophantine constraints solution in area {0,1}. A set of topologies that meet initial assumptions is obtained as the solution of the system of constrains. In the next step, the final topology is selected, which can be used to reconfigure the interconnection network. It is done using the proposed method of selecting the optimal solution from the set of acceptable solutions, taking into account a certain level of indeterminacy. Multibus network, graph, linear Diophantine constraints, reconfiguration, indeterminacy Bolanowski M., Paszkiewicz A. Reconfiguration of logical communication channels. Journal of Theoretical and Applied Computer Science. 2013, vol. 7, No. 3, pp. 21-28

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
PY - 2013
SP - 21
EP - 28
T1 - Reconfiguration of logical communication channels
VL - 3
JO - Journal of Theoretical and Applied Computer Science
ER -

BibTex:
@article{article,
author = {Bolanowski, Marek and Paszkiewicz, Andrzej },
year = {2013},
pages = { 21-28},
title = {Reconfiguration of logical communication channels},
volume = {3},
journal = { Journal of Theoretical and Applied Computer Science}

LINK
2013 Paszkiewicz A., Bolanowski M. The method for taking into account the indeterminacy in designing distributed connection systems Pomiary Automatyka Kontrola Projektowanie systemów rozproszonych, tak jak wiele innych procesów projektowych, wymaga uwzględnienia licznych, zwykle sprzecznych ze sobą parametrów opisujących charakterystyki techniczne, ekonomiczne, uwarunkowania społeczne itp. projektowanych (modelowanych) obiektów. Próba odwzorowania złożonych relacji pomiędzy tymi charakterystykami prowadzi w większości przypadków do zadań NP-zupełnych. Z drugiej zaś strony, próby uproszczenia w tym zakresie modeli projektowanych obiektów, bazując na wybranych kryteriach (pojedynczych obszarach parametrów opisujących obiekt) nie pozwalają uzyskać pożądanych rezultatów. Problem wyboru i dostosowania dostępnych rozwiązań do zbioru potencjalnych zadań, z uwzględnieniem niejednoznaczności oceny oraz zmiennością charakterystyk opisujących obiekty przyczynia się do powstania nieokreśloności. Ponieważ w trakcie eksploatacji systemów rozproszonych część parametrów uwzględnianych w procesie projektowania zmienia swoje znaczenie, stworzony wcześniej projekt może nie spełniać stawianych przed nim wymagań. Konieczne staje się zatem uwzględnienie w projektowaniu zmienności w czasie wybranych charakterystyk systemu czy sieci komputerowej [1]. W artykule zaprezentowano sposób uwzględniania nieokreśloności w procesie projektowania systemów rozproszonych, a szczególnie systemów połączeniowych. Zaprezentowane własności uwzględniania nieokreśloności pozwalają na szerokie zastosowanie ich w przypadku projektowania systemów charakteryzujących się złożonością modeli ich opisujących oraz zmiennością warunków funkcjonowania. Sieci komputerowe, systemy rozproszone, nieokreśloność Paszkiewicz A., Bolanowski M. The method for taking into account the indeterminacy in designing distributed connection systems. Pomiary Automatyka Kontrola. 2013, vol. 59, No. 10, pp. 1067-1069

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
PY – 2013
SP - 1067
EP - 1069
T1 - The method for taking into account the indeterminacy in designing distributed connection systems
VL - 59
JO - Pomiary Automatyka Kontrola
ER -

BibTex:
@article{article,
author = {Bolanowski, Marek and Paszkiewicz, Andrzej },
year = {2013},
pages = { 1067-1069},
title = {The method for taking into account the indeterminacy in designing distributed connection systems},
volume = {59},
journal = { Pomiary Automatyka Kontrola}

LINK
2013 Grabowski F., Bolanowski M., Paszkiewicz A. Self organization and self adaptation of computer networks in nonextensive approach Pomiary Automatyka Kontrola Współczesne sieci komputerowe wpisują się w kategorię systemów złożonych. Jednakże wiele sosowanych modeli sieci ciągle bazuje na idealistycznym paradygmacie systemów prostych opartym na termodynamice równowagowej. W celu zrozumienia i optymalizacji procesu projektowania rzeczywistych sieci komputerowych konieczne staje się zrozumienie i opisanie nieekstensywnych aspektów ich działania. Dlatego należy wyjaśnić takie pojęcia ja samoorganizacja, samoadaptacja, w systemie rozproszonym, dostosowanie obciążenia, równowagowy i nierównowagowy stan sieci komputerowej postrzeganej jako system. W artykule autorzy pokazują że samoadaptacja i samoorganizacja w sieci komputerowej ma charakter nieekstensywny, jak również analizują ich wpływ na wzajemne dopasowanie pomiędzy obciążeniem i ograniczonymi zasobami systemu rozproszonego. Analizowany jest również wpływ samoadaptacji i samoorganizacji na czas odpowiedzi systemu. Zaproponowany model pozwoli na doprecyzowanie i ulepszenie procesu projektowania i kontroli sieci komputerowych, który uwzględniać będzie zjawiska krótko i długoterminowe w nich zachodzące. Wpłynie to również na poprawę zarządzania sieciami realizowanego z wykorzystaniem sztucznej inteligencji, algorytmów genetycznych i logiki rozmytej. Sieci komputerowe, termodynamika nieekstensywna, samoorganizacja, samoadaptacja Grabowski F., Bolanowski M., Paszkiewicz A. Self organization and self adaptation of computer networks in nonextensive approach. Pomiary Automatyka Kontrola. 2013, vol. 59, No. 10, pp. 1049-1053

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
PY - 2013
SP - 1049
EP - 1053
T1 - Self organization and self adaptation of computer networks in nonextensive approach
VL - 59
JO - Pomiary Automatyka Kontrola
ER -

BibTex:
@article{article,
author = { Grabowski, Franciszek and Bolanowski, Marek and Paszkiewicz, Andrzej},
year = {2013},
pages = { 1049-1053},
title = {Self organization and self adaptation of computer networks in nonextensive approach},
volume = {59},
journal = { Pomiary Automatyka Kontrola}

LINK
2013 Dymora P., Mazurek M. Delay analysis in wireless sensor network protocols Pomiary Automatyka Kontrola Dynamiczny rozwój miniaturyzacji oraz niskie zapotrzebowanie na energię przyczyniło się do wzrostu popularności bezprzewodowych sieci sensorowych. Sieci te tworząc specjalną grupę rozproszonych systemów pomiarowych, mogą być wykorzystane do obsługi szerokiej gamy aplikacji, mających silne wymagania co do opóźnień w przesyle informacji między węzłami, jak również strat powstałych podczas transmisji danych. Zakres wykorzystania sieci jest praktycznie nieograniczony, od systemów sieci czujników przeznaczonych m.in. do monitorowania środowiska (pożary, powodzie itp.), kontroli i monitoringu stanu zdrowia, zastosowań w automatyce domowej, systemach bezpieczeństwa czy systemach militarnych. Aby zapewnić prawidłowe działanie systemu wymagana jest duża stabilność pracy sieci, a więc niski poziom opóźnień w działaniu, uwarunkowany m.in. odpornością sieci na uszkodzenia. Sieć czujników musi reagować na zmiany w topologii sieci, wywołane przez awarię węzłów, brak zasilania czy różnego rodzaju zakłócenia elektromagnetyczne. Istotną kwestią dla zapewnienia odpowiedniego poziomu jakości transmisji jest zapewnienie maksymalnej wydajności, energooszczędności i minimalnego poziomu błędów. Można to osiągnąć poprzez zastosowanie odpowiednich algorytmów odpowiedzialnych za trasowanie pakietów. Przeprowadzone badania opóźnień komunikacyjnych pokazują, które architektury lub protokoły mogą zostać wykorzystane do zapewnienia wsparcia QoS dla obsługiwanych przez sieć sensorową aplikacji. Problem ten stanowi duże wyzwanie dla naukowców. W niniejszej pracy przedstawiono analizę porównawczą wybranych algorytmów trasowania i ich wpływ na opóźnienia w pracy. Jakość usług, protokoły bezprzewodowych sieci sensorowych, analiza opóźnień pakietów Dymora P., Mazurek M. Delay analysis in wireless sensor network protocols. Pomiary Automatyka Kontrola. 2013, vol. 59, No. 10, pp. 1054-1056

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2013
SP - 1054
EP - 1056
T1 - Delay analysis in wireless sensor network protocols
VL - 59
JO - Pomiary Automatyka Kontrola
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw },
year = {2013},
pages = { 1054-1056},
title = {Delay analysis in wireless sensor network protocols},
volume = {59},
journal = { Pomiary Automatyka Kontrola}

LINK
2013 Grabowski F., Bolanowski M., Paszkiewicz A. Lokalne sieci bezprzewodowe w kontekście systemów złożonych Przegląd Elektrotechniczny Procesy zachodzące w sieciach bezprzewodowych charakteryzują się dużą dynamiką zmian. Z tej perspektywy, przyjęcie tradycyjnego modelu ich opisu bazującego na redukcjonistycznym paradygmacie systemów prostych jest dużym uproszczeniem. Dlatego też, w pracy postaramy się przybliżyć sieci WLAN w ujęciu systemów złożonych. Dodatkowo, zaprezentowane zostaną obszary wykorzystania właściwości sieci dowolnej skali do poprawy funkcjonowania sieci WLAN. WLAN, sieć złożona, sieć bezprzewodowa, sieć lokalna Grabowski F., Bolanowski M., Paszkiewicz A. Lokalne sieci bezprzewodowe w kontekście systemów złożonych. Przegląd Elektrotechniczny. 2013, vol. 89, No. 11, pp. 312-316

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
PY - 2013
SP - 312
EP - 316
T1 - Lokalne sieci bezprzewodowe w kontekscie systemow zlozonych
VL - 89
JO - Przeglad Elektrotechniczny
ER -

BibTex:
@article{article,
author = {Grabowski, Franciszek and Bolanowski, Marek and Paszkiewicz, Andrzej },
year = {2013},
pages = { 312-316},
title = {Lokalne sieci bezprzewodowe w kontekscie systemow zlozonych},
volume = {89},
journal = { Przeglad Elektrotechniczny}

LINK
2013 Bolanowski M., Paszkiewicz A. Nowy model detekcji zagrożeń w sieci komputerowej Przegląd Elektrotechniczny W artykule przedstawiony został nowy model detekcji zagrożeń w sieciach komputerowych z wykorzystaniem metody opartej na sygnaturach statystycznych. Proponowana metoda pozwala na dynamiczne zamiany polityki w obszarze strefy zdemilitaryzowanej, które wyzwalane będą poprzez zmianę wartości statystycznych ruchu sieciowego reprezentowanego przez szereg czasowy. Zaprezentowane zostaną wybrane deskryptory statystyczne stosowane do detekcji określonych zagrożeń. Sieć komputerowa, bezpieczeństwo, sieci komputerowych, anomalia Bolanowski M., Paszkiewicz A. Nowy model detekcji zagrożeń w sieci komputerowej. Przegląd Elektrotechniczny. 2013, vol. 89, No. 11, pp. 308-311

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Paszkiewicz, Andrzej
PY - 2013
SP - 308
EP - 311
T1 - Nowy model detekcji zagrozen w sieci komputerowej
VL - 89
JO - Przeglad Elektrotechniczny
ER -

BibTex:
@article{article,
author = {Bolanowski, Marek and Paszkiewicz, Andrzej },
year = {2013},
pages = { 308-311},
title = {Nowy model detekcji zagrozen w sieci komputerowej},
volume = {89},
journal = { Przeglad Elektrotechniczny}

LINK
2012 Dymora P., Strzałka D., Mazurek M. Long-range dependencies in reading memory pages in the man-computer system interaction Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica The modern computer systems consist of many interdependent subsystems. There are two possible approaches to their analysis. The first one is based on the idea of reductionism proposed by Descrates[1] and can be considered as a still ruling paradigm in the case of computer science and engineering. The second one can be related to the still new idea of the complex systems approach, where in order to understand the behaviour of such systems one needs to have the knowledge about the behaviour of system components and also, that is more important, how they act together [2, 3, 4, 5, 6, 7, 8]. This specific paradigm change can be even shown in the case of the idea of Turing machines and new approach for consideration in the case of interactive processing – even the opinion that “the computer engineering is not a mathematical science” was presented [9]. It should be noted that the Turing machine is a mathematical idea [10] while its implementations are the physical ones [11], but if the physical nature of computer systems was indicated, there is a need to have an appropriate physical (thermodynamical) basis for deliberations in such a case. In [12] it has been shown that the analysis of processes in the computer systems can be based on non-extensive thermodynamics. However, this analysis considers only spatial correlations, meanwhile in this paper we will focus on time dependencies leading to a long-memory effect. The paper is divided into 5 sections. In Section 2 the conception of the hierarchical structure of memory system in the computer is presented. This proposal was given in [11] where its influence on computer thermodynamics was discussed. In Section 3 there is a short survey about long-range dependencies whereas Section 4 discusses practical usage of theoretical considerations. The last section concludes the paper. BRAK Dymora P., Strzałka D., Mazurek M. Long-range dependencies in reading memory pages in the man-computer system interaction. Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica. 2012, vol. 12, No. 2 (2012), pp. 49-58

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Strzalka, Dominik
AU - Mazurek, Miroslaw
PY - 2012
SP - 49
EP - 58
T1 - Long-range dependencies in reading memory pages in the man-computer system interaction
VL - 12
JO - Annales Universitatis Mariae Curie-Sklodowska Sectio AI Informatica
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Strzalka, Dominik and Mazurek, Miroslaw },
year = {2012},
pages = { 49-58},
title = {Long-range dependencies in reading memory pages in the man-computer system interaction},
volume = {12},
journal = { Annales Universitatis Mariae Curie-Sklodowska Sectio AI Informatica}

LINK
2012 Dymora P., Mazurek M., Strzałka D., Piękoś M. Influence of batch structure on cluster computing performance - complex systems approach Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica This work presents the problem of clusters computing performance optimization. An assessment of the impact of computing architecture, applications, and communications equipment on the system performance was done. Processing bottlenecks were identified, showing that in order to obtain an optimum usage of computational structure the system should be treated as a complex one in which it is impossible to isolate and optimize each element independently. BRAK Dymora P., Mazurek M., Strzałka D., Piękoś M. Influence of batch structure on cluster computing performance - complex systems approach. Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica. 2012, vol. 12, No. 1 (2012), pp. 57-66

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Strzalka, Dominik
AU - Piekos, Marcin
PY - 2012
SP - 57
EP - 66
T1 - Influence of batch structure on cluster computing performance - complex systems approach
VL - 12
DO - 10.2478/v10065-012-0012-4
JO - Annales Universitatis Mariae Curie-Sklodowska Sectio AI Informatica
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Strzalka, Dominik and Piekos, Marcin },
year = {2012},
pages = { 57-66},
title = {Influence of batch structure on cluster computing performance - complex systems approach},
volume = {12},
journal = { Annales Universitatis Mariae Curie-Sklodowska Sectio AI Informatica},
doi = {10.2478/v10065-012-0012-4}
}

LINK
2012 Dymora P., Mazurek M., Nieroda S. Sensor network infrastructure for intelligent building monitoring and management system Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica The aim of this study was to present that it is possible to design and implement an efficient and functional intel-ligent building management system based on free tools, own project and self-realization of sensor network sys-tem which may be a low cost alternative to commercial ones. The paper presents the designed system consisting of implemented devices on the basis of sensor network technology and own hardware project in a building manage-ment system. At the application level there was designed and implemented the building management system which allows communication between the sensors, data exchange between the sensors and the database as well as the system parameters visualization panel used for intelligent building monitoring. BRAK Dymora P., Mazurek M., Nieroda S. Sensor network infrastructure for intelligent building monitoring and management system. Annales Universitatis Mariae Curie-Skłodowska Sectio AI Informatica. 2012, vol. 12, No. 2 (2012), pp. 59-71

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Nieroda, Slawomir
PY - 2012/01/01
SP - 59
EP - 71
T1 - Sensor network infrastructure for intelligent building monitoring and management system
VL - 12
DO - 10.2478/v10065-012-0010-6
JO - Annales UMCS, Informatica
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Mazurek, Miroslaw and Nieroda, Slawomir},
year = {2012},
month = {01},
pages = {59-71},
title = {Sensor network infrastructure for intelligent building monitoring and management system},
volume = {12},
journal = {Annales UMCS, Informatica},
doi = {10.2478/v10065-012-0010-6}
}

LINK
2012 Strzałka D.  Fractal Properties of Linux Kernel Maps Computer Science and Engineering Many different measures were proposed to describe the problem of possible software co mplexity-the nu mber of lines of code sometimes referred as a source lines of code (SLOC), Halstead's volume V, McCabe cyclo matic number V(G), among others. However, any of them doesn't take into account the possible fractal properties of software source code emerging fro m develop ment process. The ma in aim of this paper is to show that in the case of successive Linu x OS kernels fractal self-organization of the system can be seen. This is done in the relation to: (i) the analysis of rate of growth for number of files and source lines of Linu x kernels code, (ii) by the presentation of some v isualizations indicating self-similar graphical structure of OS kernels, (iii) by the calculations of fractal dimensions D b basing on box dimension method. Basing on obtained results it can be assumed that: (i) calculated rate of growth in the case of lines and files in the simplest approach can be approximated by the polynomial with degree 2 with R = 0.96 and R = 0.94 respectively, (ii) this system becomes more and more co mple x with self-similar structure, (iii) its fractal dimension is still growing. Presented analysis opens new possibilit ies for description of co mputer programs in terms of comp le x systems approach. Linux Kernel Maps, Fractal Dimension, Emergence, Complex Systems Strzałka D.  Fractal Properties of Linux Kernel Maps. Computer Science and Engineering. 2012, vol. 2, No. 6, pp. 112-117 TY - JOUR

RIS:
AU - Strzalka, Dominik
PY - 2012/10/01
SP - 112
EP - 117
T1 - Fractal Properties of Linux Kernel Maps
VL - 2
DO - 10.5923/j.computer.20120206.05
JO - Computer Science and Engineering
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik},
year = {2012},
month = {10},
pages = {112-117},
title = {Fractal Properties of Linux Kernel Maps},
volume = {2},
journal = {Computer Science and Engineering},
doi = {10.5923/j.computer.20120206.05}
}

LINK
2012 Strzałka D., Dymora P., Strzałka B. Queue Performance in Presence of Long-Range Dependencies - an Empirical Study International Journal of Information Science The queuing, as an inherent feature of each real system, plays a very important role in teletraffic networks as well. It is known that the queuing system consists of three basic components: the input stream of requests, the service processes and the queue discipline. The optimal performance of system can be achieved only in the case when all components are “matched” together. The teletraffic models that describe the early telephone services (e.g. Poisson and Markov) have been very successful. One of the main reasons for this success with models, which accurately resembles the real-world behavior, has been due to the highly static, low varying nature of early development phase of telephone voice traffic. This means that the whole environment of early telephone networks can be treated as a simple system. The main features of such systems can be described by: thermodynamic quasi-equilibrium, homogenous topologies, random graph theory, short-range dependencies, Poisson distribution, circuit switching, etc. However, the evolution of teletraffic from voice to new data traffic and integrated services inevitably leads to the vastly different statistical characteristics that are much more irregular and variable and as a result undermine the basis for the traditional traffic models. In this paper we show that taking into account the complex systems approach the existence of long-range dependencies (expressed by 1/ f noise) influence queue performance. This is done basing on analytical approach with presentation of long-range dependent queue model and also by experimental study of traffic behavior in computer network during daily workload generated by computer user. Long-Range Dependencies, Hurst Parameter, Powers Spectral Density, Queues, Complex Systems Strzałka D., Dymora P., Strzałka B. Queue Performance in Presence of Long-Range Dependencies - an Empirical Study. International Journal of Information Science. 2012, vol. 2, No. 4, pp. 47-53

RIS:
TY - JOUR
AU - Strzalka, Barbara
AU - Strzalka, Dominik
AU - Strzal, Dominik
PY - 2012/07/09
SP - 47
EP - 53
T1 - Queue Performance in Presence of Long-Range Dependencies - an Empirical Study
VL - 2
DO - 10.5923/j.ijis.20120204.04
JO - International Journal of Information Science
ER -

BibTex:

@article{article,
author = {Strzalka, Barbara and Strzalka, Dominik and Strzal, Dominik},
year = {2012},
month = {07},
pages = {47-53},
title = {Queue Performance in Presence of Long-Range Dependencies - an Empirical Study},
volume = {2},
journal = {International Journal of Information Science},
doi = {10.5923/j.ijis.20120204.04}
}

LINK
2012 Dymora P., Mazurek M., Kryvyi S.L. The computational algorithm for supported solutions set of linear diophantine equations systems in a ring of integer numbers International Journal of Modern Engineering Research The algorithm for computation of minimal supported set of solutions and base solutions of linear Diophantine equations systems in a ring of integer numbers is proposed. This algorithm is founded on the modified TSS-method. Ring of integer numbers, linear Diophantine equations, supported set, supported set of solutions Dymora P., Mazurek M., Kryvyi S.L. The computational algorithm for supported solutions set of linear diophantine equations systems in a ring of integer numbers. International Journal of Modern Engineering Research. 2012, vol. 2, No. 6, pp. 4133-4137

RIS:
TY - JOUR
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
AU - Kryvyi, Serigiy
PY - 2012
SP - 4133
EP - 4137
T1 - The computational algorithm for supported solutions set of linear diophantine equations systems in a ring of integer numbers
VL - 2
JO - International Journal of Modern Engineering Research
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Strzalka, Dominik and Kryvyi, Serigiy },
year = {2012},
pages = { 4133-4137},
title = {The computational algorithm for supported solutions set of linear diophantine equations systems in a ring of integer numbers},
volume = {2},
journal = { International Journal of Modern Engineering Research}

LINK
2011 Dymora P., Hajder M. A novel approach to fault tolerant multichannel networks designing problems Annales Universitatis Mariae Curie-Skłodowska Sectio AI: Informatica This work presents solution of a bus interconnection network set designing task on the base of a hypergraph model. In order to do this the interconnection network is presented as a multipartite hypergraph. A system with virtual bus connections functioning in an environment of common physical channel was analyzed, which is characteristic of the networks based on the WDM technology. The mathematical reliability model was proposed for two modes of system functioning: with redundancy of communication subsystem and division of communication load. As solution estimation criteria the expected changes of processing efficiency changes were used as also a communication delay change criteria and system reliability criteria. The designing task solution is searched in a Pareto set composed of Pareto optima. The selection procedure of a specific solution in the case of its equivalency in relation to a vector goal function was presented. BRAK Dymora P., Hajder M. A novel approach to fault tolerant multichannel networks designing problems. Annales Universitatis Mariae Curie-Skłodowska Sectio AI: Informatica. 2011, vol. 11, No. 1 (2011), pp. 67-77

RIS:
TY - JOUR
AU - Hajder, Miroslaw
AU - Dymora, Pawel
PY - 2011/12/01
SP - 67
EP - 77
T1 - A novel approach to fault tolerant multichannel networks designing problems
VL - 11
DO - 10.2478/v10065-011-0029-0
JO - Annales UMCS, Informatica
ER -

BibTex:
@article{article,
author = {Hajder, Miroslaw and Dymora, Pawel},
year = {2011},
month = {12},
pages = {67-77},
title = {A novel approach to fault tolerant multichannel networks designing problems},
volume = {11},
journal = {Annales UMCS, Informatica},
doi = {10.2478/v10065-011-0029-0}
}

LINK
2011 Strzałka D., Szurlej P. Power-Law Distributions in Hard Drive Behavior Journal of Software Engineering and Applications Taking into account the fact that the computer systems, as the implementations of Turing machine, are physical devices, the paper shows considerations in which hard drive behavior will be presented in terms of statistical mechanics. Because computer is a machine, its analysis cannot be based only on mathematical models apart of physical conditions. In the paper it will be presented a very narrow part this problem – an analysis of hard drive behavior in the context of the power-law distributions. We will focus only on four selected hard drive parameters, i.e. the rate of transfer bytes to or from the disk during the read or write, the number of pending requests to the disk and the rate of read operations. Our research was performed under the Windows operating system and this allows to make a statistical analysis for the possible occurrence of power-laws representing the lack of characteristic scale for considered processes. This property will be confirmed in all analyzed cases. A presented study can help describing the behavior of the whole computer system in terms of physics of computer processing. Power Laws, Hard Drive Behavior, Performance Monitor, Windows Operating System, Physics of Computer Processing Strzałka D., Szurlej P. Power-Law Distributions in Hard Drive Behavior. Journal of Software Engineering and Applications. 2011, vol. 4, No. 12, pp. 710-717

RIS:
TY - JOUR
AU - Strzalka, Dominik
AU - Szurlej, Piotr
PY - 2011
SP - 710
EP - 717
T1 - Power-Law Distributions in Hard Drive Behavior
VL - 2
JO - Journal of Software Engineering and Applications
ER -

BibTex:
@article{article,
author = {Dymora, Pawel and Szurlej, Piotr },
year = {2011},
pages = { 710-717},
title = {Power-Law Distributions in Hard Drive Behavior},
volume = {2},
journal = { Journal of Software Engineering and Applications}

LINK
2011 Strzałka D., Dymora P., Mazurek M. Statistical mechanics of memory pages reads during man-computer system interaction Metody Informatyki Stosowanej The paper shows that the hierarchical structure of computer system memory organization during man-computer interaction can lead to the existence of phenomena that can be considered in terms of non-equilibrium statistical mechanics. The analysis of probability distribution shows the existence of power-laws in the rate at which operating system resolves data from hard drive caused by the hardware page faults in virtual memory mechanism. Man-computer interaction, non-equilibrium statistical mechanics, power-laws, hard drive behavior. Strzałka D., Dymora P., Mazurek M. Statistical mechanics of memory pages reads during man-computer system interaction. Metody Informatyki Stosowanej. 2011, vol. 1 (26), pp. 15-21

RIS:
TY - JOUR
AU - Strzalka, Dominik
AU - Dymora, Pawel
AU - Mazurek, Miroslaw
PY - 2011/01/01
SP - 15
EP - 21
T1 - Statistical mechanics of memory pages reads during man-computer system interaction
VL - 1
JO - Metody Informatyki Stosowanej
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik and Dymora, Pawel and Mazurek, Miroslaw},
year = {2011},
month = {01},
pages = {15-21},
title = {Statistical mechanics of memory pages reads during man-computer system interaction},
volume = {1},
journal = {Metody Informatyki Stosowanej}
}

LINK
2010 Strzałka D.  Non-Extensive Statistical Mechanics - a Possible Basis for Modelling Processes in Computer Memory System Acta Physica Polonica A Tsallis definition of non-extensive entropy introduced in 1988 has been considered to obtain new possibilities to construct generalized thermodynamical basis for statistical physics expanding classical Boltzmann–Gibbs thermodynamics for nonequilibrium states. During the last two decades this q-generalized theory has been successfully applied to considerable number of physically interesting complex phenomena. In the paper the possible thermodynamical basis of processes will be presented in nowadays computer systems in the case of memory behaviour. BRAK Strzałka D.  Non-Extensive Statistical Mechanics - a Possible Basis for Modelling Processes in Computer Memory System. Acta Physica Polonica A. 2010, vol. 117, No. 4, pp. 652-657

RIS:
TY - JOUR
AU - Strzalka, Dominik
PY - 2010/04/07
SP - 652
EP - 657
T1 - Non-Extensive Statistical Mechanics--a Possible Basis for Modelling Processes in Computer Memory System
VL - 117
DO - 10.12693/APhysPolA.117.652
JO - Acta Physica Polonica Series a
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik},
year = {2010},
month = {04},
pages = {652-657},
title = {Non-Extensive Statistical Mechanics--a Possible Basis for Modelling Processes in Computer Memory System},
volume = {117},
journal = {Acta Physica Polonica Series a},
doi = {10.12693/APhysPolA.117.652}
}

LINK
2010 Grabowski F., Strzałka D. Dynamics of Algorithmic Processing in Computer Systems Complex Systems This paper presents a new analytical and experimental approach to the insertion sort algorithm and task processing dynamics. The dependencies that exist in the task structure can influence the algorithm’s behavior, especially in the number of dominant operations that are needed to compute the computational complexity. The proposed approach is based on a Tsallis definition of entropy suitable for all systems that are far from thermodynamical equilibrium. The ideas presented show how a complex systems approach can provide a good perspective for analyzing the processing dynamics of computer systems that are no longer simple. BRAK Grabowski F., Strzałka D. Dynamics of Algorithmic Processing in Computer Systems. Complex Systems. 2010, vol. 19, No. 1, pp. 73-87

RIS:
TY - JOUR
AU - Strzalka, Dominik
AU - Grabowski, Franciszek
PY - 2010/01/01
SP - 73
EP - 87
T1 - Dynamics of algorithmic processing in computer systems
VL - 19
JO - Complex Systems
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik and Grabowski, Franciszek},
year = {2010},
month = {01},
pages = {73-87},
title = {Dynamics of algorithmic processing in computer systems},
volume = {19},
journal = {Complex Systems}
}

LINK
2010 Strzałka D.  Paradigms Evolution in Computer Science Egitania Sciencia This paper presents a problem of paradigm evolution in computer science. A brilliant idea of Turing machine, which is the basis of all theoretical considerations in the contemporary computer engineering, seems to be from the system analysis point of view, only a complicated system that works only under an algorithmic processing mode. Meanwhile, taking into account the physical structure, the character of realized tasks and interactive processing mode of nowadays computer systems, it seems that they are complex ones and their analysis requires a definitely different approach. The ancient rule “divide and conquer” (reductionist approach) can’t be used in the case of complex systems, because they are governed by Aristotle rule “a whole is more that sum of its parts”. Thus the analysis of modern computer systems requires the understanding of general laws that govern them as a whole and this also requires a different, system approach that takes into account the long-range dependencies in time and space domain, i.e., the paradigm of complex systems. Complex systems, computer systems, paradigms evolution Strzałka D.  Paradigms Evolution in Computer Science. Egitania Sciencia. 2010, vol. 6, pp. 203-220

RIS:
TY - JOUR
AU - Strzalka, Dominik
PY - 2010/01/01
SP - 203
EP - 220
T1 - Paradigms evolution in computer science
VL - 6
JO - Egitania Sciencia
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik},
year = {2010},
month = {01},
pages = {203-220},
title = {Paradigms evolution in computer science},
volume = {6},
journal = {Egitania Sciencia}
}

LINK
2010 Strzałka D.  On some properties of Benford's Law Journal of the Korean Mathematical Society In present paper there are studied some properties of Benford’s law. The existence of this law in not necessary large sets of numbers is a very interesting example that can show how the complex phenomena can appear in the positional number systems. Such systems seem to be very simple and intuitive and help us proceed with numbers. However, their simplicity in the case of usage in our lifetime is not necessary connected with the simplicity in the case of laws that govern them. Even if this laws indicate the existence of self-similar properties. Benford's law, self-similarity, complex systems Strzałka D.  On some properties of Benford's Law. Journal of the Korean Mathematical Society. 2010, vol. 47, No. 5, pp. 1055-1075

RIS:
TY - JOUR
AU - Strzalka, Dominik
PY - 2010/01/01
SP - 1055
EP - 1075
T1 - On some properties of Benford's law
VL - 47
DO - 10.4134/JKMS.2010.47.5.1055
JO - Journal of the Korean Mathematical Society
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik},
year = {2010},
month = {01},
pages = {1055-1075},
title = {On some properties of Benford's law},
volume = {47},
journal = {Journal of the Korean Mathematical Society},
doi = {10.4134/JKMS.2010.47.5.1055}
}

LINK
2010 Grabowski F.  Logistic equation of arbitrary order Physica A: Statistical Mechanics and its Applications The paper is concerned with the new logistic equation of arbitrary order which describes the performance of complex executive systems X vs. number of tasks N, operating at limited resources K, at non-extensive, heterogeneous self-organization processes characterized by parameter f. In contrast to the classical logistic equation which exclusively relates to the special case of sub-extensive homogeneous self-organization processes at f=1, the proposed model concerns both homogeneous and heterogeneous processes in sub-extensive and super-extensive areas. The parameter of arbitrary order f, where −∞<f<+∞, depends on both the coefficient of external resource utilization u=N/K, where 0<u<1, and the internal microscopic character of realized processes related to the depth of feedback β. The coefficient β directly influences self-organization of processes by the change of microscopic parameters Vi, Si, i and Z, where Vi is the number of references (visit) to the ith component of the system during the service of each task, Si is the time of serving the task by the ith component, and Z is the think time of a given process. In the general case of complex system, parameters Vi, Si, i and Z can have values in the range from 0 to +∞. In this way the new equation includes all possible cases of a complex executive system’s operation. Furthermore, it allows us to define the optimal matching point between X and N with f as the parameter. It also helps to balance the load in complex systems and to equip artificial systems with self-optimization mechanisms similar to those observed in natural systems. Logistic equation, Arbitrary order, Feedback, Self-organization, Matching point Grabowski F.  Logistic equation of arbitrary order. Physica A: Statistical Mechanics and its Applications. 2010, vol. 389, No. 16, pp. 3081-3093

RIS:
TY - JOUR
AU - Grabowski, Franciszek
PY - 2010/08/01
SP - 3081
EP - 3093
T1 - Logistic equation of arbitrary order
VL - 389
DO - 10.1016/j.physa.2010.03.024
JO - Physica A: Statistical Mechanics and its Applications
ER -

BibTex:
@article{article,
author = {Grabowski, Franciszek},
year = {2010},
month = {08},
pages = {3081-3093},
title = {Logistic equation of arbitrary order},
volume = {389},
journal = {Physica A: Statistical Mechanics and its Applications},
doi = {10.1016/j.physa.2010.03.024}
}

LINK
2009 Strzałka D.  Connections between Von Foerster coalition growth model and Tsallis q-exponential Acta Physica Polonica B The paper will show the direct connections between q-Malthusian growth model, i.e. the classical exponential growth model generalized in Tsallis statistics, and the coalition growth model introduced by von Foerster in 1960. As it will turn out, the equations that have been taken into account when the coalition model was introduced, are closely related to the equations that describe the non-extensive generalization of entropy. BRAK Strzałka D.  Connections between Von Foerster coalition growth model and Tsallis q-exponential. Acta Physica Polonica B. 2009, vol. 40, No. 1, pp. 41-47

RIS:
TY - JOUR
AU - Strzalka, Domini
PY - 2009
SP - 41
EP - 47
T1 - Connections between Von Foerster coalition growth model and Tsallis q-exponential
VL - 40
JO - Acta Physica Polonica B
ER -

BibTex:
@article{article,
author = {Dymora, Pawel },
year = {2009},
pages = { 41-47},
title = {Connections between Von Foerster coalition growth model and Tsallis q-exponential},
volume = {40},
journal = { Acta Physica Polonica B}

LINK
2009 Grabowski F., Strzałka D. Influence of Excess 1/f Noise on Channel Capacity Complex Systems This paper deals with new analytical and experimental aspects of a channel's capacity in the presence of excess nonwhite Gaussian noise with long-range dependencies described by the Hurst parameter H. Shannon's theory of information based on the assumptions given by the Boltzmann|Gibbs extensive thermodynamical basis, does not allow description of many different phenomena directly connected with the ideas of a complex systems approach. This theory is also a basis of many considerations in communication, but a new approach to transmission channels is needed. The transmission channels are no longer simple systems built with only one wire connection, but consist of many different transmission media. For each type of partial connection in such channels there are many various interferences that influence some parts of the channel in different ways. We suggest that in many cases the real capacity of the whole channel can no longer be determined by Shannon's equation without taking into account the problem of excess 1 ë f noise, which appears as an intrinsic feature of dynamically packet switched networks. The ideas presented in this paper show how the complex system approach can provide a good perspective for analyzing the whole transmission channel. BRAK Grabowski F., Strzałka D. Influence of Excess 1/f Noise on Channel Capacity. Complex Systems. 2009, vol. 18, No. 2, pp. 255-266

RIS:
TY - JOUR
AU - Strzalka, Dominik
AU - Grabowski, Franciszek
PY - 2009/01/01
SP - 255
EP - 266
T1 - Influence of excess 1/f noise on channel capacity
VL - 18
JO - Complex Systems
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik and Grabowski, Franciszek},
year = {2009},
month = {01},
pages = {255-266},
title = {Influence of excess 1/f noise on channel capacity},
volume = {18},
journal = {Complex Systems}
}

LINK
2009 Grabowski F., Strzałka D. Conception of paradigms evolution in science towards the complex systems approach Egitania Sciencia An article shows a wide depiction of conception of paradigms evolution in science and surrounding reality. The presented approach is based on a new formula of system paradigm approach, which assumes wide depiction in analysis, description and synthesis of real systems as complex systems governed by long-range dependencies in space and time domain. A process of deepening science knowledge within a given time is strictly connected with ruling paradigm of perceiving reality; each paradigm change is based on a scientific revolution and leads to the change of reality perceiving and science problems too. It seems that the lack of awareness of this process itself and its consequences don't allow to have a wide depiction of many scientific problems. paradigms evolution, complex systems science Grabowski F., Strzałka D. Conception of paradigms evolution in science towards the complex systems approach. Egitania Sciencia. 2009, vol. 4, No. 1, pp. 197-210

RIS:
TY - JOUR
AU - Strzalka, Dominik
AU - Grabowski, Franciszek
PY - 2009/01/01
SP - 197
EP - 210
T1 - Conception of paradigms evolution in science - towards the complex systems approach
VL - 4
JO - Egitania Scienca
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik and Grabowski, Franciszek},
year = {2009},
month = {01},
pages = {197-210},
title = {Conception of paradigms evolution in science - towards the complex systems approach},
volume = {4},
journal = {Egitania Scienca}
}

LINK
2009 Grabowski F., Zarychta M., Hawro P. Agent technologies for WEB mining from a non-extensive thermodynamics perspective International Journal Information Technologies and Knowledge  Motivated by the works that reveal the small-world effect and scale-free property of various real-life networks, many scientists devote themselves into studying complex networks. One of the ultimate goals is to understand how the topological structures of networks affect the dynamics upon them. In this paper, we give a brief review on the studies of agent technology appliances for Web mining which is performed in complex network environment ruled by non-extensive thermodynamics. Non-extensive thermodynamics, web mining, complex networks, multi-agent technology. Grabowski F., Zarychta M., Hawro P. Agent technologies for WEB mining from a non-extensive thermodynamics perspective. International Journal Information Technologies and Knowledge . 2009, vol. 3, No. 13, pp. 125-130

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Zarychta, Marek
AU - Hawro, Przemyslaw
PY - 2009
SP - 125
EP - 130
T1 - Agent technologies for WEB mining from a non-extensive thermodynamics perspective
VL - 3
JO - International Journal Information Technologies and Knowledge&nbsp
ER -

BibTex:
@article{article,
author = {Grabowski, Franciszek and Zarychta, Marek and Hawro, Przemyslaw },
year = {2009},
pages = { 125-130},
title = {Agent technologies for WEB mining from a non-extensive thermodynamics perspective},
volume = {3},
journal = { International Journal Information Technologies and Knowledge }

LINK
2009 Nycz M., Filipiak-Karasińska A. The Improvement of Wireless Network Performance Functioning Based on Diffusive Moving The Loads of Cells Journal of Applied Computer Science In the paper, the original method of balancing cell loads in wireless networks has been presented. It allows for diffusing the load to the area assembling cells with decreased load and, thus, improving the total network capacity. The method is highly effective in load balancing and acceptable as far as computational complexity is concerned. Its performance has been proved by experimental tests. Load balancing, cells networks, networks design, graph theory Nycz M., Filipiak-Karasińska A. The Improvement of Wireless Network Performance Functioning Based on Diffusive Moving The Loads of Cells. Journal of Applied Computer Science. 2009, vol. 17, No. 2, pp. 41-56

RIS:
TY - JOUR
AU - Filipiak-Karasi, Aneta
AU - Nycz, Mariusz
PY - 2009/01/01
SP - 41
EP - 56
T1 - The Improvement of a Wireless Network Performance Functioning Based on Diffusive Moving The Loads of Cells
VL - 17
ER -

BibTex:
@article{article,
author = {Filipiak-Karasi, Aneta and Nycz, Mariusz},
year = {2009},
month = {01},
pages = {41-56},
title = {The Improvement of a Wireless Network Performance Functioning Based on Diffusive Moving The Loads of Cells},
volume = {17}
}

LINK
2009 Strzałka D.  Stany nierównowagowe procesów w przetwarzaniu algorytmicznym Metody Informatyki Stosowanej W artykule zostały zaprezentowane rozważania dotyczące istnienia możliwych związków pomiędzy nieekstensywnmą definicją entropii zaproponowaną przez C. Tsallisa a przetwarzaniem algorytmicznym na przykładzie sortowania przez wstawianie. Wykresy rozkładów empirycznych w skali log-lin pokazujące istnienie wolno zanikających ogonów rozkładów prawdopodobieństwa wskazują, że uwarunkowania termodynamiczne pracy analizowanego algorytmu wyłaniają się dopiero dla odpowiednio dużych przetwarzanych zbiorów danych. W pewnym sensie jest to cecha o charakterze emergentnym, która w klasycznej analizie algorytmów nie jest w ogóle brana pod uwagę. W artykule [23] pokazano, że taką cechą może być także przenoszenie pewnych własności sortowanych zbiorów danych (efekt zależności długoterminowych) na poziom dynamiki zachowań algorytmu i liczby operacji dominujących, jakie są wykonywane w czasie jego pracy. Jest to podejście odmienne od dotychczas zakładanego, kiedy to w klasycznej analizie złożoności obliczeniowej przyjmowano, że najbardziej interesującym i miarodajnym jest przypadek pesymistyczny (najgorszy z możliwych) lub w niektórych przypadkach tzw. przypadek średni. Tymczasem analiza pracy algorytmu w połączeniu z wiedzą nt. przetwarzanych danych pokazuje, że istnieją pewne charakterystyczne cechy, które mogą mieć fundamentalne znaczenie w przypadku analizy maszyn Turinga traktowanych nie jako model matematyczny, ale rozważanych w kontekście fizycznych właściwości implementacji. Przetwarzanie algorytmiczne, entropia nieekstensywna, sortowanie przez wstawianie, uwarunkowania termodynamiczne Strzałka D.  Stany nierównowagowe procesów w przetwarzaniu algorytmicznym. Metody Informatyki Stosowanej. 2009, vol. 19, No. 2, pp. 145-160

RIS:
TY - JOUR
AU - Strzalka, Dominik
PY - 2009/01/01
SP - 145
EP - 160
T1 - Stany nierownowagowe procesow w przetwarzaniu algorytmicznym
VL - 2/2009
JO - Metody Informatyki Stosowanej
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik},
year = {2009},
month = {01},
pages = {145-160},
title = {Stany nierownowagowe procesow w przetwarzaniu algorytmicznym},
volume = {2/2009},
journal = {Metody Informatyki Stosowanej}
}

LINK
2009 Grabowski F., Strzałka D. Wybrane właściwości statystyczne dynamiki procesu sortowania przez wstawianie Metody Informatyki Stosowanej W artykule pokazano, że pełne zrozumienie dynamiki struktury wykonawczej wymaga w pierwszej kolejności zrozumienia mechanizmów rządzących stykiem algorytm struktura danych wejściowych. Procesy generowane na szczycie tej struktury są następnie przenoszone na kolejne warstwy struktury wykonawczej powodując ich kumulowanie się, co w efekcie sprawia, że spada wydajność całego systemu komputerowego. Zrozumienie i próba zamodelowania tych procesów pozostaje kluczową kwestią nie tylko w kontekście nowego spojrzenia na dynamikę całej struktury wykonawczej oraz nowego spojrzenia na problem złożoności obliczeniowej, ale także z punktu widzenia dalszego rozwoju systemów operacyjnych i zastosowanych w nich metod dostępu do zasobów. Algorytm sortowania przez wstawianie, przetwarzanie algorytmiczne, zależności dalekiego zasięgu, systemy złożone Grabowski F., Strzałka D. Wybrane właściwości statystyczne dynamiki procesu sortowania przez wstawianie. Metody Informatyki Stosowanej. 2009, vol. 18, No. 1, pp. 85-98

RIS:
TY - JOUR
AU - Strzalka, Dominik
AU - Grabowski, Franciszek
PY - 2009/01/01
SP - 85
EP - 98
T1 - Wybrane wlasciwosci statystyczne dynamiki procesu sortowania przez wstawianie
VL - 1/2009
JO - Metody Informatyki Stosowanej
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik and Grabowski, Franciszek},
year = {2009},
month = {01},
pages = {85-98},
title = {Wybrane wlasciwosci statystyczne dynamiki procesu sortowania przez wstawianie},
volume = {1/2009},
journal = {Metody Informatyki Stosowanej}
}

LINK
2008 Paszkiewicz A., Hajder M. Interconnection distributed systems designed with hierarchical organization Annales Universitatis Mariae Curie-Skłodowska, Sectio AI, Informatica In this paper an origin approach to distributed systems design is shown. It allows to include complete costs of their life circuit. In order to simplify complexity of a design procedure we assume that a created system will have a regional hierarchical structure. A model based on the equivalence relation can describe that problem. In this way, it is possible to describe hierarchical regionalization simply for n-levels. BRAK Paszkiewicz A., Hajder M. Interconnection distributed systems designed with hierarchical organization. Annales Universitatis Mariae Curie-Skłodowska, Sectio AI, Informatica. 2008, vol. 8, No. 1 (2008), pp. 177-184

RIS:
TY - JOUR
AU - Hajder, Miroslaw
AU - Paszkiewicz, Andrzej
PY - 2008/01/01
SP - 177
EP - 184
T1 - Interconnection distributed systems designed with hierarchical organization
VL - 8
DO - 10.2478/v10065-008-0017-1
JO - Annales Umcs, Informatica
ER -

BibTex:
@article{article,
author = {Hajder, Miroslaw and Paszkiewicz, Andrzej},
year = {2008},
month = {01},
pages = {177-184},
title = {Interconnection distributed systems designed with hierarchical organization},
volume = {8},
journal = {Annales Umcs, Informatica},
doi = {10.2478/v10065-008-0017-1}
}

LINK
2008 Grabowski F., Strzałka D. Processes in Systems with Limited Resources in the Context of Non-extensive Thermodynamics Fundamenta Informaticae This paper presents a preliminary analysis of the system behavior that works far from the thermodynamical equilibrium states in the environment with limited resources. The examples of such systems are the real computer systems. Nowadays in such systems the runoff characteristic of the information flow is very turbulent in contradiction to the current existing laminar models. These systems work under constant overload, which means a permanent thermodynamical non-equilibrium (from the thermodynamical point of view). For such a situation the classical approach to their modeling is still based on Boltzmann-Gibbs (BG) thermodynamics,which is proper only for systems that are in equilibriumstate (sometimes called thermostatic) or very close to it. The changing number of tasks N in such systems and the limited resourcesK of the environment cause its chaotic behavior and generate the dependencies that have got a long-termproperty. Such processes degrade the system performance X and elongate the response time R; in other words degrade the Quality of Service (QoS). To understand the whole behavior of such systems one needs a proper thermodynamical basis that seems to be the Tsallis formula of the non-extensive entropy. Limited resources, non-extensive entropy, thermodynamic non-equilibrium Grabowski F., Strzałka D. Processes in Systems with Limited Resources in the Context of Non-extensive Thermodynamics. Fundamenta Informaticae. 2008, vol. 85, No. 1-4, pp. 455-464

RIS:
TY - JOUR
AU - Strzalka, Dominik
AU - Grabowski, Franciszek
PY - 2008/01/01
SP - 455
EP - 464
T1 - Processes in Systems with Limited Resources in the Context of Non-extensive Thermodynamics
VL - 85
JO - Fundam. Inform.
ER -

BibTex:
@article{article,
author = {Strzalka, Dominik and Grabowski, Franciszek},
year = {2008},
month = {01},
pages = {455-464},
title = {Processes in Systems with Limited Resources in the Context of Non-extensive Thermodynamics},
volume = {85},
journal = {Fundam. Inform.}
}

LINK
2008 Grabowski F., Strzałka D. Towards possible non-extensive thermodynamics of algorithmic processing -statistical mechanics of insertion sort algorithm International Journal of Modern Physics C BRAK BRAK Grabowski F., Strzałka D. Towards possible non-extensive thermodynamics of algorithmic processing -statistical mechanics of insertion sort algorithm. International Journal of Modern Physics C. 2008, vol. 19, No. 9, pp. 1443-1458

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Strzalka, Dominik
PY - 2008
SP - 1443
EP - 1458
T1 - Towards possible non-extensive thermodynamics of algorithmic processing -statistical mechanics of insertion sort algorithm
VL - 19
JO - International Journal of Modern Physics C
ER -

BibTex:
@article{article,
author = {Grabowski, Franciszek and Strzalka, Dominik },
year = {2008},
pages = { 1443-1458},
title = {Towards possible non-extensive thermodynamics of algorithmic processing -statistical mechanics of insertion sort algorithm},
volume = {19},
journal = { International Journal of Modern Physics C }

LINK
2008 Grabowski F., Strzałka D. A short review of elementary properties and possible applications of deformed q-algebra derived from non-extensive Tsallis entropy Modern Physics Letters B Tsallis entropy introduced in 1988 is considered to have obtained new possibilities to construct generalized thermodynamical basement for statistical physics expanding classical Boltzmann–Gibbs–Shannon thermodynamics for non-equilibrium states. During the last two decades this q-generalized theory has been successfully applied to a considerable amount of physically interesting complex phenomena. The authors would like to present a short rewiev, the applications and the elementary properties of some operators in deformed q-algebra derived from Tsallis definition of non-extensive entropy based on the definitions of the q-logarithm and the q-exponential. The new definition of the q-root is also introduced. Non-extensive entropy, q-generalized algebra Grabowski F., Strzałka D. A short review of elementary properties and possible applications of deformed q-algebra derived from non-extensive Tsallis entropy. Modern Physics Letters B. 2008, vol. 22, No. 16, pp. 1525-1534

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Strzalka, Dominik
PY - 2008
SP - 1525
EP - 1534
T1 - A short review of elementary properties and possible applications of deformed q-algebra derived from non-extensive Tsallis entropy
VL - 22
JO - Modern Physics Letters B
ER -

BibTex:
@article{article,
author = {Grabowski, Franciszek and Strzalka, Dominik },
year = {2008},
pages = { 1525-1534},
title = {A short review of elementary properties and possible applications of deformed q-algebra derived from non-extensive Tsallis entropy},
volume = {22},
journal = { Modern Physics Letters B }

LINK
2008 Grabowski F., Strzałka D. Towards possible q-generalizations of the Malthus and Verhulst growth models Physica A: Statistical Mechanics and its Applications Tsallis entropy introduced in 1988 based on the equation Sq=1−∑ipiqq−1 has been considered to obtain new possibilities for constructing a generalized thermodynamical basis for statistical physics, expanding classical Boltzmann–Gibbs thermodynamics for non-equilibrium states. During the last two decades this q-generalized theory has been successfully applied to a considerable amount of physically interesting complex phenomena. The authors wish to present a mathematical analysis of the possible q-generalizations of the Malthus and the Verhulst growth models based on Tsallis definitions of the q-logarithm and the q-exponential. Non-extensive entropy; Population dynamics (ecology); Complex systems Grabowski F., Strzałka D. Towards possible q-generalizations of the Malthus and Verhulst growth models. Physica A: Statistical Mechanics and its Applications. 2008, vol. 387, No. 11, pp. 2511-2518

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Strzalka, Dominik
PY - 2008
SP - 2511
EP - 2518
T1 - Towards possible q-generalizations of the Malthus and Verhulst growth models
VL - 387
JO -Physica A: Statistical Mechanics and its Applications
ER -

BibTex:
@article{article,
author = {Grabowski, Franciszek and Strzalka, Dominik },
year = {2008},
pages = { 2511-2518},
title = {Towards possible q-generalizations of the Malthus and Verhulst growth models},
volume = {387},
journal = { Physica A: Statistical Mechanics and its Applications }

LINK
2008 Paszkiewicz A., Hajder M. Selecting Communication Means in Conditions of Incomplete Information for Distributed Systems with Hierarchy of Topology Polish Journal of Environmental Studies Paszkiewicz A., Hajder M. Selecting Communication Means in Conditions of Incomplete Information for Distributed Systems with Hierarchy of Topology. Polish Journal of Environmental Studies. 2008, vol. 17, No. 2A, pp. 19-23

RIS:
TY - JOUR
AU - Paszkiewicz, Andrzej
AU - Hajder, M
PY - 2008
SP - 19
EP - 23
T1 - Selecting Communication Means in Conditions of Incomplete Information for Distributed Systems with Hierarchy of Topology
VL - 17
JO -Polish Journal of Environmental Studies
ER -

BibTex:
@article{article,
author = {Paszkiewicz, Andrzej and Hajder, M },
year = {2008},
pages = { 19-23},
title = {Selecting Communication Means in Conditions of Incomplete Information for Distributed Systems with Hierarchy of Topology},
volume = {17},
journal = { Polish Journal of Environmental Studies}

LINK
2008 Bolanowski M., Hajder M. Connectivity Analysis in the Computational Systems with Distributed Communications in the Multichanel Environment Polish Journal of Environmental Studies Bolanowski M., Hajder M. Connectivity Analysis in the Computational Systems with Distributed Communications in the Multichanel Environment. Polish Journal of Environmental Studies. 2008, vol. 17, No. 2A, pp. 14-18

RIS:
TY - JOUR
AU - Bolanowski, Marek
AU - Hajder, M
PY - 2008
SP - 14
EP - 18
T1 - Connectivity Analysis in the Computational Systems with Distributed Communications in the Multichanel Environment
VL - 17
JO -Polish Journal of Environmental Studies
ER -

BibTex:
@article{article,
author = {Bolanowski, Marek and Hajder, M },
year = {2008},
pages = { 14-18},
title = {Connectivity Analysis in the Computational Systems with Distributed Communications in the Multichanel Environment},
volume = {17},
journal = { Polish Journal of Environmental Studies}

LINK
2008 Grabowski F., Strzałka D. Rekonfigurowalność systemów w kontekście statystyki nie-ekstensywnej Pomiary Automatyka Kontrola W artykule pokazano, że czas życia systemów rekonfigurowalnych wpisuje się w przypadek super-ekstensywny, nieaddytywnej termodynamiki nierównowagowej i entropii Tsallisa, która oprócz składnika addytywnego o charakterze ilościowym, opisującym nierekonfigurowane struktury klasyczne, zawiera dodatkowy człon jakościowy wpisujący się w charakter struktur rekonfigurowalnych. Podejście to stanowi rozszerzenie klasycznej, addytywnej formuły entropii Boltzmanna-Gibbsa-Shannona. Badania dotyczą relacji pomiędzy postępem technologicznym określonym przez prawo Moore'a a czasem życia produktu w odniesieniu do struktur klasycznych i rekonfigurowalnych. Rekonfigurowalność, entropia nieekstensywna Grabowski F., Strzałka D. Rekonfigurowalność systemów w kontekście statystyki nie-ekstensywnej. Pomiary Automatyka Kontrola. 2008, vol. 54, No. 8, pp. 556-558

RIS:
TY - JOUR
AU - Grabowski, Franciszek
AU - Strzalka, Dominik
PY - 2008
SP - 556
EP - 558
T1 - Rekonfigurowalnosc systemow w kontekscie statystyki nie-ekstensywnej
VL - 54
JO -Pomiary Automatyka Kontrola
ER -

BibTex:
@article{article,
author = {Grabowski, Franciszek and Strzalka, Dominik },
year = {2008},
pages = { 556-558},
title = {Rekonfigurowalnosc systemow w kontekscie statystyki nie-ekstensywnej},
volume = {54},
journal = { Pomiary Automatyka Kontrola}

LINK

Nasze serwisy używają informacji zapisanych w plikach cookies. Korzystając z serwisu wyrażasz zgodę na używanie plików cookies zgodnie z aktualnymi ustawieniami przeglądarki, które możesz zmienić w dowolnej chwili. Więcej informacji odnośnie plików cookies.

Akceptuję