Papers by Zbigniew F Marszałek
In the paper we discuss performance of classic bubble sort algorithm for large data sets. Researc... more In the paper we discuss performance of classic bubble sort algorithm for large data sets. Research results discussed and described in this article help to evaluate computer methods used in NoSQL database systems for large amounts of the input data. Therefore we try to analyze one of the most common sorting algorithms and its properties for large data sets. Streszczenie. Artykuł ma na celu przedstawienie analizy wydajności algorytmu sortowania bąbelkowego w postaci klasycznej dla dużych zbiorów danych. Podjęty temat ma duże znaczenie dla rozwoju współczesnej informatyki ze względu na to, że komputery muszą pracować na coraz większych ilościach danych.
Sorting is a one of very important topics for computer science. In the modern computing, computer... more Sorting is a one of very important topics for computer science. In the modern computing, computers must operate on bigger and bigger amounts of data. Therefore we try to analyze modified version of bubble sort algorithm and its properties for large data sets. Article aims to show and analyze the possible behavior of bubble sort with logic control of order for large scale data sets. Streszczenie. Sortowanie jest jednym z bardzo ważnych tematów współczesnej informatyki. We współczesnej informatyce komputery muszą pracować na coraz większej liczbie danych, dlatego staramy się analizować jeden z podstawowych algorytmów sortowania i jego właściwości dla dużych zbiorów danych. Artykuł ma na celu przeanalizowanie możliwego zachowania badanej wersji algorytmu z funkcją logicznej kontroli ułożenia dla dużych zbiorów danych.
It is characterized by the computational complexity and time complexity, which represent the poss... more It is characterized by the computational complexity and time complexity, which represent the possibility of using it for large data sets. The present work is to describe this algorithm and describe it's performance when sorting large scale data sets. Streszczenie. Algorytm sortowania przez wstawianie jest jednym z algorytmów opisywanych w literaturze. Omawiana metoda została scharakteryzowana poprzez złożoność czasową i obliczeniową algorytmu, która opisuje możliwość stosowania tego algorytmu do sortowania dużych zbiorów danych. Praca ta ma na celu opisanie zachowania algorytmu i jego wydajności dla dużych zbiorów danych.
Complexity, Dec 2, 2018
The development in multicore architectures gives a new line of processors that can flexibly distr... more The development in multicore architectures gives a new line of processors that can flexibly distribute tasks between their logical cores. These need flexible models of efficient algorithms, both fast and stable. A new line of efficient sorting algorithms can support these systems to efficiently use all available resources. Processes and calculations shall be flexibly distributed between cores to make the performance as high as possible. In this article we present a fully flexible sorting method designed for parallel processing. The idea we describe in this article is based on modified merge sort, which in parallel form is designed for multicore architectures. The novelty of this idea is in particular way of processing. We have developed a fully flexible method that can be implemented for a number of processors. The tasks are flexibly distributed between logical cores to increase the efficiency of sorting. The method preserves separation of concerns; therefore, each of the processors works separately without any cross actions and interruptions. The proposed method was described in theoretical way, examined in tests, and compared to other methods. The results confirm high efficiency and show that with each newly added processor sorting becomes faster and more efficient.
Sensors, 2020
The herpesvirus, polyomavirus, papillomavirus, and retrovirus families are associated with breast... more The herpesvirus, polyomavirus, papillomavirus, and retrovirus families are associated with breast cancer. More effort is needed to assess the role of these viruses in the detection and diagnosis of breast cancer cases in women. The aim of this paper is to propose an efficient segmentation and classification system in the Mammography Image Analysis Society (MIAS) images of medical images. Segmentation became challenging for medical images because they are not illuminated in the correct way. The role of segmentation is essential in concern with detecting syndromes in human. This research work is on the segmentation of medical images based on intuitionistic possibilistic fuzzy c-mean (IPFCM) clustering. Intuitionist fuzzy c-mean (IFCM) and possibilistic fuzzy c-mean (PFCM) algorithms are hybridised to deal with problems of fuzzy c-mean. The introduced clustering methodology, in this article, retains the positive points of PFCM which helps to overcome the problem of the coincident clust...
Mobile Networks and Applications, 2022
In view of the fact that the existing methods are easy to be affected by nonlinear factors in the... more In view of the fact that the existing methods are easy to be affected by nonlinear factors in the incident process of the light source, resulting in the received shock wave inconsistent with the reality and large calculation error, a two-color laser field imaging waveform simulation and enhancement method based on the Internet of things is proposed. According to the automatic transformation characteristics of augmented reality technology, the waveform simulation control process of two-color laser field imaging is constructed. The Gaussian distribution characteristics are used to analyze the target, the optical grid and double oscillation device are used to control the results, the spectrum Fourier transform is used to adjust the phase of the waveform, and finally the simulated modulated laser waveform is output. Through the comparison of laser waveform spectrum and peak value, the results show that this method is closest to the actual laser waveform, saves calculation time, and has ...
Mobile Networks and Applications, 2021
Traditional large-scale enterprise cloud system has the problem of large delay. Therefore, a dela... more Traditional large-scale enterprise cloud system has the problem of large delay. Therefore, a delay tolerant data congestion avoidance algorithm based on modular computing is designed. The resource allocation rules of rbfr strategy in traditional enterprise cloud are improved to change the traditional interactive overall mode and make it modular.Using modular thinking to construct the data congestion control algorithm, mainly in the control layer to achieve the model, through the introduction of ant colony algorithm in modularization, the design of delay tolerant data congestion avoidance algorithm is realized. In order to verify the algorithm’s congestion avoidance effect, comparative experiments are designed. Experimental results show that the packet loss rate of large enterprise cloud system under this algorithm is lower than that of traditional delay tolerant data congestion avoidance algorithm.
IEEE Access, 2022
Software quality inspection will generate too much data, and removing duplicate data can improve ... more Software quality inspection will generate too much data, and removing duplicate data can improve the efficiency of software quality inspection. This paper studies the automatic de-duplication method of software quality inspection data based on density-based spatial clustering of applications with noise(DBSCAN) clustering. Intelligent optimization algorithm is used to generate software quality inspection data by initializing individuals, calculating fitness function value, improving individuals and splitting individuals that meet the conditions. Local linear embedding algorithm is selected to extract software quality inspection data features by searching neighborhood points, calculating reconstruction weight and projection vector. The extracted features are used to select DBSCAN multi-density clustering algorithm of regional division, and the automatic de-duplication of software quality inspection data is realized by grid division, data bin dividing and grid merging. The experimental results show that the precision and recall of this method are higher than 99%, and the resource consumption rate is low, which can effectively improve the efficiency of software quality inspection.
Proceedings of the 2018 Federated Conference on Computer Science and Information Systems, 2018
Parallel programming is a field of science with a great potential nowadays due to the development... more Parallel programming is a field of science with a great potential nowadays due to the development of advanced computers architectures. Appropriate usage of this tool can be therefore highly beneficial in multimedia applications and significantly decreases the time of calculations. In this article, we analyze how the speed of calculations is influenced by the usage of parallel algorithms in image filtering processes. We present a method based on multithreading and the division of the image for rectangles. The filter is applied parallel on each part of the image. Results show that in some cases our proposition can bring over 90% benefit when compared to the classical approach.
Summary. In the paper we discuss performance of bubble sort algori-thm. Research results discusse... more Summary. In the paper we discuss performance of bubble sort algori-thm. Research results discussed and described in this article help to evaluate this method when used in NoSQL database systems for large amounts of the input data. In the article is analyzed bubble sort algorithm for large scale data sets in two versions: classic version and modified version with logic control of order.
Symmetry, 2021
Due to Internet of Things (IoT), it has become easy to surveil the critical regions. Images are i... more Due to Internet of Things (IoT), it has become easy to surveil the critical regions. Images are important parts of Surveillance Systems, and it is required to protect the images during transmission and storage. These secure surveillance frameworks are required in IoT systems, because any kind of information leakage can thwart the legal system as well as personal privacy. In this paper, a secure surveillance framework for IoT systems is proposed using image encryption. A hyperchaotic map is used to generate the pseudorandom sequences. The initial parameters of the hyperchaotic map are obtained using partial-regeneration-based non-dominated optimization (PRNDO). The permutation and diffusion processes are applied to generate the encrypted images, and the convolution neural network (CNN) can play an essential role in this part. The performance of the proposed framework is assessed by drawing comparisons with competitive techniques based on security parameters. It shows that the propose...
This paper illustrates combinatorial summation numbers by means of computer operations. The aim o... more This paper illustrates combinatorial summation numbers by means of computer operations. The aim of the research is to give a definition of all different primes which sum is equal 100, where the smallest combination has only two elements and the biggest has nine elements. This paper presents some ways to deal with this problem. There are analyzed two methods. One of them uses nested loops (non-recursive method), second way is connected with stacks (recursive method).
Sensors, 2019
Rapid development and conducted experiments in the field of the introduction the fifth generation... more Rapid development and conducted experiments in the field of the introduction the fifth generation of the mobile network standard allow for the flourishing of the Internet of Things. This is one of the most important reasons to design and test systems that can be implemented to increase the quality of our lives. In this paper, we propose a system model for managing tasks in smart homes using multi-agent solutions. The proposed solution organizes work and distributes tasks to individual family members. An additional advantage is the introduction of gamification, not only between household members, but also between families. The solution was tested to simulate the entire solution as well as the individual components that make up the system. The proposal is described with regard to the possibility of implementing smart homes in future projects.
Information Technology And Control, 2019
This article shows the energy consumption analysis by parallel sorting algorithms. Sort algorithm... more This article shows the energy consumption analysis by parallel sorting algorithms. Sort algorithms are used in information systems and databases, to select and organize the information. The tests carried out confirm the reduction of energy consumption by using parallel sorting algorithms.
2014 IEEE Symposium on Computational Intelligence for Human-like Intelligence (CIHLI), 2014
In order to identify an object, human eyes firstly search the field of view for points or areas w... more In order to identify an object, human eyes firstly search the field of view for points or areas which have particular properties. These properties are used to recognise an image or an object. Then this process could be taken as a model to develop computer algorithms for images identification. This paper proposes the idea of applying the simplified firefly algorithm to search for key-areas in 2D images. For a set of input test images the proposed version of firefly algorithm has been examined. Research results are presented and discussed to show the efficiency of this evolutionary computation method.
Modification of Parallelization for Fast Sort Algorithm
One of the most important issues in NoSQL databases is to develop applications and facilitates fo... more One of the most important issues in NoSQL databases is to develop applications and facilitates for the parallel processing in information systems. In the work the author presents some improvements for the parallel algorithm for merging strings and use this algorithm to sort large data sets. Tested sorting for a parallel merging algorithm confirms the reduction of the time complexity and improved stability of the algorithm.
Parallelization of Fast Sort Algorithm
Sorting algorithms are widely used in databases and various information systems to organize and s... more Sorting algorithms are widely used in databases and various information systems to organize and search for information. In this paper, author describes version of parallization of fast sort algorithm for large data sets. Examination of the paralization of fast sort algorithm performance was subject to performance tests, that showed validity.
Modification of Parallelization of Modified Merge Sort Algorithm
An important issue in sorting large data sets in the NoSQL databases is the ability to sort proce... more An important issue in sorting large data sets in the NoSQL databases is the ability to sort process parallelism in order to accelerate the application. The work presents the use of the parallelized method for merging strings in a modified merge sort algorithm. The static tests of the proposed sort algorithm verify the stability and the theoretical time complexity of the method.
The use of encryption methods such as secure multiparty computation is an important issue in appl... more The use of encryption methods such as secure multiparty computation is an important issue in applications. Applications that use encryption of information require special algorithms of sorting data in order to preserve the secrecy of the information. This proposition is composed for parallel architectures. Presented algorithm works with a number of logical processors. Operations are flexibly distributed among them. Therefore sorting of data sets takes less time. Results of the experimental tests confirm the effectiveness of the proposed flexible division of tasks between logical processors and show that this proposition is a valuable method that can find many practical applications in high performance computing.
Streszczenie. Sortowanie jest jednym z ważniejszych problemów współczesnej informatyki. Obecnie k... more Streszczenie. Sortowanie jest jednym z ważniejszych problemów współczesnej informatyki. Obecnie komputery muszą pracować na coraz większych ilościach danych, dlatego w niniejszym artykule przedstawiamy analizę algorytmu sortowania bąbelkowego pod względem jego własności dla dużych zbiorów danych i baz tybu NoSQL. W analizie zbadaliśmy wersję klasyczną i zmodyfikowaną z funkcją kotroli ułożenia elementów.
Uploads
Papers by Zbigniew F Marszałek