Wyszukiwarka
Filtry
wszystkich: 402
wybranych: 399
-
Katalog
Filtry wybranego katalogu
Wyniki wyszukiwania dla: algorithms performance
-
Study of Multi-Class Classification Algorithms’ Performance on Highly Imbalanced Network Intrusion Datasets
PublikacjaThis paper is devoted to the problem of class imbalance in machine learning, focusing on the intrusion detection of rare classes in computer networks. The problem of class imbalance occurs when one class heavily outnumbers examples from the other classes. In this paper, we are particularly interested in classifiers, as pattern recognition and anomaly detection could be solved as a classification problem. As still a major part of...
-
Performance Evaluation of Preemption Algorithms in MPLS Networks
PublikacjaPreemption is a traffic engineering technique in Multiprotocol Switching Networks that enables creation of high priority paths when there is not enough free bandwidth left on the route. Challenging part of any preemption method is to select the best set of paths for removal. Several heuristic methods are available but no wider comparison had been published before. In this paper, we discuss the dilemmas in implementing preemption...
-
Comparative study on total nitrogen prediction in wastewater treatment 1 plant and effect of various feature selection methods on machine learning algorithms performance
PublikacjaWastewater characteristics prediction in wastewater treatment plants (WWTPs) is valuable and can reduce the number of sampling, energy, and cost. Feature Selection (FS) methods are used in the pre-processing section for enhancing the model performance. This study aims to evaluate the effect of seven different FS methods (filter, wrapper, and embedded methods) on enhancing the prediction accuracy for total nitrogen (TN) in the WWTP...
-
PERFORMANCE COMPARISON OF MACHINE LEARNING ALGORITHMS FOR PREDICTIVE MAINTENANCE
Publikacja -
Self-stabilizing algorithms for graph coloring with improved performance guarantees
PublikacjaW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm kolorowania grafów oparty na konstrukcji drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm z gwarantowaną wielomianową liczbą ruchów, który dokładnie koloruje grafy dwudzielne.
-
Performance evaluation of IEEE 802.11 fast BSS transition algorithms
PublikacjaSimultation experiments are conducted to answer the questions if multimedia services can be properly supported in IEEE 802.11r networks. The authors prove that handover delay can be reduced to 22 ms in the average case.
-
PERFORMANCE OF ENDOSCOPIC IMAGE ANALYSIS ALGORITHMS IN LARGE BOWEL VIDEOS PROCESSING
PublikacjaComputer-assisted endoscopy is a rapidly developing eld of study. Many image anal- ysis algorithms exist, achieving very high rates of eciency at processing single endoscopic images. However, most of them were never tested in processing real-life endoscopic videos. In the article such tests of 16 endoscopy image analysis algorithms are presented and dis- cussed. Tests were performed on two real-life endoscopic videos of a human...
-
Performance analysis of mobility protocols and handover algorithms for IP-based networks
PublikacjaA rapid growth of IP-based networks and services has created the vast collection of resources and functionality available to users by means of a universal method of access - an IP protocol. At the same time, advances in design of mobile electronic devices have allowed them to reach utility level comparable to stationary, desktop computers, while still retaining their mobility advantage. Following this trend multiple extensions...
-
Influence of Self-Similar Traffic Type on Performance of QoS Routing Algorithms
PublikacjaProviding a Quality of Services (QoS) into current telecommunication networks based on packet technology is a big challenge nowadays. Network operators have to support a number of new services like voice or video which generate new type of traffic. This traffic serviced with QoS in consequence requires access to appropriate network resources. Additionally, new traffic type is mixed with older one, like best-effort. Analysis of...
-
Performance Evaluation of Selected Parallel Object Detection and Tracking Algorithms on an Embedded GPU Platform
PublikacjaPerformance evaluation of selected complex video processing algorithms, implemented on a parallel, embedded GPU platform Tegra X1, is presented. Three algorithms were chosen for evaluation: a GMM-based object detection algorithm, a particle filter tracking algorithm and an optical flow based algorithm devoted to people counting in a crowd flow. The choice of these algorithms was based on their computational complexity and parallel...
-
Investigation of Performance and Energy Consumption of Tokenization Algorithms on Multi-core CPUs Under Power Capping
PublikacjaIn this paper we investigate performance-energy optimization of tokenizer algorithm training using power capping. We focus on parallel, multi-threaded implementations of Byte Pair Encoding (BPE), Unigram, WordPiece, and WordLevel run on two systems with different multi-core CPUs: Intel Xeon 6130 and desktop Intel i7-13700K. We analyze execution times and energy consumption for various numbers of threads and various power caps and...
-
Finite-window RLS algorithms
PublikacjaTwo recursive least-squares (RLS) adaptive filtering algorithms are most often used in practice, the exponential and sliding (rectangular) window RLS algorithms. This popularity is mainly due to existence of low-complexity versions of these algorithms. However, these two windows are not always the best choice for identification of fast time-varying systems, when the identification performance is most important. In this paper, we...
-
Parallelization of video stream algorithms in kaskada platform
PublikacjaThe purpose of this work is to present different techniques of video stream algorithms parallelization provided by the Kaskada platform - a novel system working in a supercomputer environment designated for multimedia streams processing. Considered parallelization methods include frame-level concurrency, multithreading and pipeline processing. Execution performance was measured on four time-consuming image recognition algorithms,...
-
Comparison and Analysis of Service Selection Algorithms
PublikacjaIn Service Oriented Architecture, applications are developed by integration of existing services in order to reduce development cost and time. The approach, however, requires algorithms that select appropriate services out of available, alternative ones. The selection process may consider both optimalization requirements, such as maximalization of performance, and constraint requirements, such minimal security or maximum development...
-
STRUCTURE AND ALGORITHMS OF A DIAGNOSTIC DEVICE IN A WHEELED TRACTOR
PublikacjaDiagnostic device monitors the tractor’s technical condition and identifies the location of damaged components during operation. The diagnostic device detects and identifies the following types of defects: functional defects (uf) which affect performance, exhaust defects (ue) which increase toxic emissions and fuel consumption, defects that jeopardize driving safety (us), defects that affect engine performance (ud). The key component...
-
Robust and Efficient Machine Learning Algorithms for Visual Recognition
PublikacjaIn visual recognition, the task is to identify and localize all objects of interest in the input image. With the ubiquitous presence of visual data in modern days, the role of object recognition algorithms is becoming more significant than ever and ranges from autonomous driving to computer-aided diagnosis in medicine. Current models for visual recognition are dominated by models based on Convolutional Neural Networks (CNNs), which...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublikacjaA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
Design of control algorithms for mobile robots in an environment with static and dynamic obstacles
PublikacjaThis article proposes the construction of autonomous mobile robots and designing of obstacle avoidance algorithms for them. Nowadays, mobile robots are gaining more and more popularity on the customer as well as industrial market, for example as automatic vacuum cleaners or lawnmowers. Obstacle avoidance algorithms play an important role in performance of this types of robots. The proposed algorithms were designed for builds with...
-
Modern Platform for Parallel Algorithms Testing: Java on Intel Xeon Phi
PublikacjaParallel algorithms are popular method of increasing system performance. Apart from showing their properties using asymptotic analysis, proof-of-concept implementation and practical experiments are often required. In order to speed up the development and provide simple and easily accessible testing environment that enables execution of reliable experiments, the paper proposes a platform with multi-core computational accelerator:...
-
Impact of Visual Image Quality on Lymphocyte Detection Using YOLOv5 and RetinaNet Algorithms
PublikacjaLymphocytes, a type of leukocytes, play a vital role in the immune system. The precise quantification, spatial arrangement and phenotypic characterization of lymphocytes within haematological or histopathological images can serve as a diagnostic indicator of a particular lesion. Artificial neural networks, employed for the detection of lymphocytes, not only can provide support to the work of histopathologists but also enable better...
-
Process arrival pattern aware algorithms for acceleration of scatter and gather operations
PublikacjaImbalanced process arrival patterns (PAPs) are ubiquitous in many parallel and distributed systems, especially in HPC ones. The collective operations, e.g. in MPI, are designed for equal process arrival times (PATs), and are not optimized for deviations in their appearance. We propose eight new PAP-aware algorithms for the scatter and gather operations. They are binomial or linear tree adaptations introducing additional process...
-
Design of three control algorithms for an averaging tank with variable filing
PublikacjaAn averaging tank with variable filling is a nonlinear multidimensional system and can thus be considered a complex control sys-tem. General control objectives of such object include ensuring stability, zero steady state error and achieving simultaneously shortest possible settling time and minimal overshoot. The main purpose of this research work was the modelling and synthesis of three control systems for an averaging tank. In...
-
Analysis of the Capability of Deep Learning Algorithms for EEG-based Brain-Computer Interface Implementation
PublikacjaMachine learning models have received significant attention for their exceptional performance in classifying electroencephalography (EEG) data. They have proven to be highly effective in extracting intricate patterns and features from the raw signal data, thereby contributing to their success in EEG classification tasks. In this study, we explore the possibilities of utilizing contemporary machine learning algorithms in decoding...
-
On the fast BSS transition algorithms in the IEEE 802.11r local area wireless networks
PublikacjaHandover performance is critical to support multimedia services that are becoming increasingly available over the wireless devices. The high transition delay can be unaccepted for such services or can be a source of disruption on the session. On the other side, IEEE 802.11 standard is being extended with new functionalities. Security and QoS features, included in recent IEEE 802.11-2007 standard, add management frames that are...
-
Optimal and suboptimal algorithms for identification of time-varying systems with randomly drifting parameters
PublikacjaNoncausal estimation algorithms, which involve smoothing, can be used for off-line identification of nonstationary systems. Since smoothingis based on both past and future data, it offers increased accuracy compared to causal (tracking) estimation schemes, incorporating past data only. It is shown that efficient smoothing variants of the popular exponentially weighted least squares and Kalman filter-based parameter trackers can...
-
Parallel implementation of background subtraction algorithms for real-time video processing on a supercomputer platform
PublikacjaResults of evaluation of the background subtraction algorithms implemented on a supercomputer platform in a parallel manner are presented in the paper. The aim of the work is to chose an algorithm, a number of threads and a task scheduling method, that together provide satisfactory accuracy and efficiency of a real-time processing of high resolution camera images, maintaining the cost of resources usage at a reasonable level. Two...
-
Endoscopic Videos Deinterlacing and On-Screen Text and Light Flashes Removal and Its Influence on Image Analysis Algorithms' Efficiency
PublikacjaIn this article, deinterlacing and removing on- screen text and light flashes methods on endoscopic video images are discussed. The research is intended to improve disease recognition algorithms' performance. In the article, four configurations of deinterlacing methods and another four configurations of text and flashes removal methods are described and examined. The efficiency of endoscopic video analysis algorithms is measured...
-
Forewarned Is Forearmed: Machine Learning Algorithms for the Prediction of Catheter-Induced Coronary and Aortic Injuries
PublikacjaCatheter-induced dissections (CID) of coronary arteries and/or the aorta are among the most dangerous complications of percutaneous coronary procedures, yet the data on their risk factors are anecdotal. Logistic regression and five more advanced machine learning techniques were applied to determine the most significant predictors of dissection. Model performance comparison and feature importance ranking were evaluated. We identified...
-
Parallelization of Selected Algorithms on Multi-core CPUs, a Cluster and in a Hybrid CPU+Xeon Phi Environment
PublikacjaIn the paper we present parallel implementations as well as execution times and speed-ups of three different algorithms run in various environments such as on a workstation with multi-core CPUs and a cluster. The parallel codes, implementing the master-slave model in C+MPI, differ in computation to communication ratios. The considered problems include: a genetic algorithm with various ratios of master processing time to communication...
-
On Improved-Reliability Design Optimization of High-Frequency Structures Using Local Search Algorithms
PublikacjaThe role of numerical optimization has been continuously growing in the design of high-frequency structures, including microwave and antenna components. At the same time, accurate evaluation of electrical characteristics necessitates full-wave electromagnetic (EM) analysis, which is CPU intensive, especially for complex systems. As rigorous optimization routines involve repetitive EM simulations, the associated cost may be significant....
-
Application of fiber optic sensors using Machine Learning algorithms for temperature measurement of lithium-ion batteries
PublikacjaOptical fiber sensorsusing low-coherence interferometry require processing ofthe output spectrum or interferogramto quickly and accurately determine the instantaneous value of the measured quantity, such as temperature.Methods based on machine learning are a good candidate for this application. The application of four such methods in an optical fiber temperature sensoris demonstrated.Using aZnO-coated...
-
Exergy and Energy Analyses of Microwave Dryer for Cantaloupe Slice and Prediction of Thermodynamic Parameters Using ANN and ANFIS Algorithms
PublikacjaThe study targeted towards drying of cantaloupe slices with various thicknesses in a microwave dryer. The experiments were carried out at three microwave powers of 180, 360, and 540 W and three thicknesses of 2, 4, and 6 mm for cantaloupe drying, and the weight variations were determined. Artificial neural networks (ANN) and adaptive neuro-fuzzy inference systems (ANFIS) were exploited to investigate energy and exergy indices of...
-
Continuous Optimisation Algorithms
PublikacjaKsiążka poświęcona jest zagadnieniom optymalizacji ciągłej. Oprócz klasycznych algorytmów gradientowych omawiane są w współczesne algorytmy bezgradientowe, które stosowane są z powodzeniem w optymalizacji globalnej. Większość prezentowanych algorytmów określona może być mianem metaheurystycznych. Zaliczyć do nich można metody optymalizacji inspirowane procesami zachodzącymi w przyrodzie, które dalej można dzielić na inspirowane...
-
Prediction of maximum tensile stress in plain-weave composite laminates with interacting holes via stacked machine learning algorithms: A comparative study
PublikacjaPlain weave composite is a long-lasting type of fabric composite that is stable enough when being handled. Open-hole composites have been widely used in industry, though they have weak structural performance and complex design processes. An extensive number of material/geometry parameters have been utilized for designing these composites, thereby an efficient computational tool is essential for that purpose. Different Machine Learning...
-
Subspace Algorithms for Face Verification
PublikacjaW rzeczywistych zastosowaniach problem weryfikacji wydaje się ważniejszy od klasyfikacji. Na ogół dysponujemy jedynie niewielkim zbiorem obrazów uczących reprezentujących daną osobę, a naszym zadaniem jest podjęcie decyzji odnośnie tego, czy nowo pozyskana fotografia jest do nich wystarczająco podobna - bez użycia oddzielnego zbioru przykładów negatywnych. W takim przypadku uzasadnione wydaje się zastosowanie metody podprzestrzeni,...
-
Algorithms for testing security in graphs
PublikacjaIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
Data-driven Models for Predicting Compressive Strength of 3D-printed Fiber-Reinforced Concrete using Interpretable Machine Learning Algorithms
Publikacja3D printing technology is growing swiftly in the construction sector due to its numerous benefits, such as intricate designs, quicker construction, waste reduction, environmental friendliness, cost savings, and enhanced safety. Nevertheless, optimizing the concrete mix for 3D printing is a challenging task due to the numerous factors involved, requiring extensive experimentation. Therefore, this study used three machine learning...
-
Comparative Analysis of microRNA-Target Gene Interaction Prediction Algorithms - The Attempt to Compare the Results of Three Algorithms
Publikacja -
Marine and Cosmic Inspirations for AI Algorithms
PublikacjaArtificial Intelligence (AI) is a scientific area that currently sees an enormous growth. Various new algorithms and methods are developed and many of them meets practical, successful applications. Authors of new algorithms draw different inspirations. Probably the most common one is the nature. For example, Artificial Neural Networks were inspired by the structure of human brain and nervous system while the classic Genetic Algorithm...
-
Evolutionary Algorithms in MPLS network designing
PublikacjaMPLS technology become more and more popular especially in core networks giving great flexibility and compatibility with existing Internet protocols. There is a need to optimal design such networks and optimal bandwidth allocation. Linear Programming is not time efficient and does not solve nonlinear problems. Heuristic algorithms are believed to deal with these disadvantages and the most promising of them are Evolutionary Algorithms....
-
Compression algorithms for multibeam sonar records
PublikacjaJednym z najczęściej używanych urządzeń służących do szeroko rozumianego telemonitoringu morskiego są sonary wielowiązkowe (ang. Multibeam systems MBS). Ich wysoka wydajność w tworzeniu informacji o obiektach znajdujących się pod wodą skutkuje w dużych ilościach danych pozyskiwanych podczas rejsów badawczych i pomiarowych. W tym kontekście, proces przechowywania i zarządzania takim magazynem danych staje się istotnym problemem...
-
Prototype selection algorithms for distributed learning
Publikacja -
Iterative Algorithms for Multilayer Optimizing Control
PublikacjaMonografia przedstawia struktury, koncepcje i algorytmy dla wielowarstwowego sterowania optymalizującego procesami przemysłowymi będące w przeważającym stopniu wynikiem badań prowadzonych przez jej autorów. Metodologie i algorytmy sterowania są starannie ilustrowane wynikami symulacji dla wybranych przykładowych systemów. Oprócz tego przedstawione są zastosowania do realnych obiektów przemysłowych: kolumny destylacyjnej etyliny,...
-
New Algorithms for Adaptive Notch Smoothing
PublikacjaThe problem of extraction/elimination of a nonstationary complex sinusoidal signal buried in noise is considered. This problem is usually solved using adaptive notch filtering (ANF)algorithms. It is shown that accuracy of signal estimation can be increased if the results obtained from ANF are further processed using a cascade of appropriately designed filters. The resulting adaptive notch smoothing (ANS) algorithms can be employed...
-
Interoperability Constraints in Service Selection Algorithms
PublikacjaIn Service Oriented Architecture, composite applications are developed by integration of existing, atomic services that may be available in alternative versions realizing the same functionality but having different Quality of Service (QoS) attributes. The development process requires effective service selection algorithms that balance profits and constraints of QoS attributes. Additionally, services operate in a heterogeneous environment,...
-
Extinction Event Concepts for the Evolutionary Algorithms
PublikacjaThe main goal of this present paper is to propose a structure for a tool helping to determine how algorithm would react in a real live application, by checking it's adaptive capabilities in an extreme situation. Also a different idea of an additional genetic operator is being presented. As Genetic Algorithms are directly inspired by evolution, extinction events, which are elementary in our planet's development history, became...
-
Performance of LSP preemption methods in different MPLS networks
PublikacjaPreemption in Multiprotocol Label Switching (MPLS) is an optional traffic engineering technique used to create a new path of high priority when there is not enough bandwidth available. In such case the path is admitted by removing one or more previously allocated paths of lower priority. As there are usually many possible sets of low priority paths which can be selected, a preemption algorithm is being started to select the best...
-
Investigation into MPI All-Reduce Performance in a Distributed Cluster with Consideration of Imbalanced Process Arrival Patterns
PublikacjaThe paper presents an evaluation of all-reduce collective MPI algorithms for an environment based on a geographically-distributed compute cluster. The testbed was split into two sites: CI TASK in Gdansk University of Technology and ICM in University of Warsaw, located about 300 km from each other, both connected by a fast optical fiber Ethernet-based 100 Gbps network (900 km part of the PIONIER backbone). Each site hosted a set...
-
On bidirectional preestimates and their application to identification of fast time-varying systems
PublikacjaWhen applied to the identification of time-varying systems, such as rapidly fading telecommunication channels, adaptive estimation algorithms built on the local basis function (LBF) principle yield excellent tracking performance but are computationally demanding. The subsequently proposed fast LBF (fLBF) algorithms, based on the preestimation principle, allow a substantial reduction in complexity without significant performance...
-
On zero-error codes produced by greedy algorithms
PublikacjaWe present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.