Filters
total: 13346
filtered: 11525
-
Catalog
- Publications 11525 available results
- Journals 359 available results
- Conferences 67 available results
- People 341 available results
- Projects 11 available results
- Laboratories 2 available results
- e-Learning Courses 371 available results
- Events 6 available results
- Open Research Data 664 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: algorithm design and analysis
-
Performance evaulation of video object tracking algorithm in autonomous surveillance system
PublicationResults of performance evaluation of a video object tracking algorithm are presented. The method of moving objects detection and tracking is based on background modelling with mixtures of Gaussians and Kalman filters. An emphasis is put on algorithm's efficiency with regards to its settings. Utilized methods of performance evaluation based on comparison of algorithm output to manually prepared reference data are introduced. The...
-
Performance evaluation of video object tracking algorithm in autonomous surveillance system
PublicationResults of performance evaluation of a video object tracking algorithm are presented. The method of moving objects detection and tracking is based on background modelling with mixtures of Gaussians and Kalman filters. An emphasis is put on algorithm's efficiency with regards to its settings. Utilized methods of performance evaluation based on comparison of algorithm output to manually prepared reference data are introduced. The...
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublicationArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...
-
A telemedical and an outpatient thoracic impedance measurements - a validation algorithm of the electrodes placement
PublicationThis paper presents the algorithm for validation of electrodes locations for the thoracic impedance measurements. In particular the presented algorithm was designed to perform the telemetric sleep apnea monitoring. One of the problems, during the clinical tests of a developed device, was to preserve the repeatability of measurements. It strongly depended on the appropriate electrodes placement on the examined person’s thorax. It...
-
An Algorithm for Optimizing the Determination of Cycling Routes on the Example of the Gdansk Agglomeration
PublicationPhysical activity is an essential part of a healthy lifestyle. One of the manifestations of the change in a society type from consumer to information one is the understanding of the importance of ecology and a healthy lifestyle. This is evident, inter alia, in the inventiveness and involvement of the society in the start-up and solutions referred to as the Smart City. One example is the development of e-bike rental and local investments...
-
Global Complex Roots and Poles Finding Algorithm in C × R Domain
PublicationAn algorithm to find the roots and poles of a complex function depending on two arguments (one complex and one real) is proposed. Such problems are common in many fields of science for instance in electromagnetism, acoustics, stability analyses, spectroscopy, optics, and elementary particle physics. The proposed technique belongs to the class of global algorithms, gives a full picture of solutions in a fixed region ⊂ C × R and...
-
FPGA realization of an improved alpha max plus beta min algorithm
PublicationThe generalized improved version of the alpha max plus beta min square-rooting algorithm and its realization in the Field Programmable Gate Array (FPGA) are presented. The algorithm computes the square root to calculate the approximate magnitude of a complex sample. It is especially useful for pipelined calculations in the DSP. In case of four approximation regions it is possible to reduce the peak error form 3.95% to 0.33%. This...
-
Simulation model for evaluation of QoS routing algorithm in large packet networks
PublicationThe variety of traffic transferred via current telecommunication networks includes also voice, which should meet quality requirements. One of mechanisms, which can support QoS in current packet networks, is routing. There exist many routing proposals which should introduce the QoS into the network but practically they don't. Following paper presents the realization of simulation model for evaluation of a new routing algorithm DUMBRA...
-
Performance evaluation of the parallel object tracking algorithm employing the particle filter
PublicationAn algorithm based on particle filters is employed to track moving objects in video streams from fixed and non-fixed cameras. Particle weighting is based on color histograms computed in the iHLS color space. Particle computations are parallelized with CUDA framework. The algorithm was tested on various GPU devices: a desktop GPU card, a mobile chipset and two embedded GPU platforms. The processing speed depending on the number...
-
The Usage of the BP-Layers Stereo Matching Algorithm with the EBCA Camera Set
PublicationThis paper is concerned with applying a stereo matching algorithm called BP-Layers to a set of many cameras. BP Layers is designed for obtaining disparity maps from stereo cameras. The algorithm takes advantage of convolutional natural networks. This paper presents using this algorithm with a set called Equal Baseline Camera Array. This set consists of up to five cameras with one central camera and other ones aground it. Such a...
-
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublicationAn algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.
-
Pareto Ranking Bisection Algorithm for Expedited Multi-Objective Optimization of Antenna Structures
PublicationThe purpose of this letter is introduction of a novel methodology for expedited multi-objective design of antenna structures. The key component of the presented approach is fast identification of the initial representation of the Pareto front (i.e., a set of design representing the best possible trade-offs between conflicting objectives) using a Pareto-ranking bisection algorithm. The algorithm finds a discrete set of Pareto-optimal...
-
Distributed measurement system with data transmission secured using XXTEA algorithm
PublicationThe paper deals with wireless data transmission security in the distributed measurement and control system. An overview of cryptographic algorithms was presented paying special attention to the algorithm dedicated to units with low processing power, which is important due to minimization of energy consumption. Measurement modules equipped with simple microcontrollers send data wirelessly to the central unit. The transmission was...
-
Hybrid DUMBRA: an efficient QoS routing algorithm for networks with DiffServ architecture
PublicationDynamic routing is very important issue of current packet networks. It may support the QoS and help utilize available network resources. Unfortunately current routing mechanisms are not sufficient to fully support QoS. Although many research has been done in this area no generic QoS routing algorithm has been proposed that could be used across all network structures. Existing QoS routing algorithms are either dedicated to limited...
-
Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns
PublicationThe Clairvoyant algorithm proposed in “A novel MPI reduction algorithm resilient to imbalances in process arrival times” was analyzed, commented and improved. The comments concern handling certain edge cases in the original pseudocode and description, i.e., adding another state of a process, improved cache friendliness more precise complexity estimations and some other issues improving the robustness of the algorithm implementation....
-
Method of selecting the LS-SVM algorithm parameters in gas detection process
PublicationIn this paper we showed the method of resistive gas sensors data processing. The UV irradiation and temperature modulation was applied to improve gas sensors’ selectivity and sensitivity. Noise voltage across the sensor’s terminals (proportional to its resistance fluctuations) was recorded to estimate power spectral density. This function was an input data vector for LS-SVM (least squares – support vector machine) algorithm, which...
-
Selection of energy storage units by genetic algorithm for mitigating voltage deviations
PublicationIn recent years, energy storage units have become very popular. They are applied both for economic and technical purposes. Unfortunately, the cost of such devices is still high and selecting their proper location and rated power have to be performed precisely. In this paper, a Genetic-Algorithm-based optimization method for selecting the best configuration of energy storage units in the power network is proposed. The presented...
-
Interpretable deep learning approach for classification of breast cancer - a comparative analysis of multiple instance learning models
PublicationBreast cancer is the most frequent female cancer. Its early diagnosis increases the chances of a complete cure for the patient. Suitably designed deep learning algorithms can be an excellent tool for quick screening analysis and support radiologists and oncologists in diagnosing breast cancer.The design of a deep learning-based system for automated breast cancer diagnosis is not easy due to the lack of annotated data, especially...
-
FPGA computation of magnitude of complex numbers using modified CORDIC algorithm
PublicationIn this work we present computation of the magnitude of complex numbers using a modified version of the CORDIC algorithm that uses only five iterations. The relationship between the computation error and the number of CORDIC iterations are presented for floating-point and integer arithmetics. The proposed modification of CORDIC for integer arithmetic relies upon the introduction of correction once basic computations are performed...
-
Smart Virtual Bass Synthesis Algorithm Based on Music Genre Classification
PublicationThe aim of this paper is to present a novel approach to the Virtual Bass Synthesis (VBS) algorithms applied to portable computers. The proposed algorithm employed automatic music genre recognition to determine the optimum parameters for the synthesis of additional frequencies. The synthesis was carried out using the non-linear device (NLD) and phase vocoder (PV) methods depending on the music excerpt genre. Classification of musical...
-
An Optimal Power Point Tracking Algorithm in a Solar PV Generation System
PublicationThe non-linearity in I-V characteristics of a PV panel requires to be operated at knee point to extract maximum power. In order to operate the panel at optimal point, maximum power point tracking (MPPT) algorithm is employed in the control structure. The main objective of MPP tracking is to keep the operation at knee point of I-V characteristics under varying condition of temperature and solar insolation. Under non uniform solar...
-
Updating the Coupling Algorithm between HYDRUS and MODFLOW in the HYDRUS Package for MODFLOW
PublicationThe HYDRUS-based flow package for MODFLOW (the HPM or the HYDRUS package) is an existing unsaturated zone flow package for MODFLOW. In MODFLOW with the HPM, the groundwater modeling domain is discretized into regular grids that can be combined into multiple zones based on similarities in soil hydrology, topographical characteristics, and the depth to the groundwater. Each of these zones is assigned one unsaturated soil profile...
-
Non-Least Square GNSS Positioning Algorithm for Densely Urbanized Areas
PublicationThe paper introduces an essentially new algorithm for calculating the GNSS position as an alternative to the least-square method. The proposed approach can be widely applied to any positioning method that uses multiple position lines for position calculation and is an example ofhow using a numerical solution can improve position accuracy without access to historical data. In essence, the method is based on the adaptation of the...
-
Things You Might Not Know about the k-Nearest Neighbors Algorithm
PublicationRecommender Systems aim at suggesting potentially interesting items to a user. The most common kind of Recommender Systems is Collaborative Filtering which follows an intuition that users who liked the same things in the past, are more likely to be interested in the same things in the future. One of Collaborative Filtering methods is the k Nearest Neighbors algorithm which finds k users who are the most similar to an active user...
-
The use of a two-phase Monte Carlo material model to reflect the dispersion of asphalt concrete fracture parameters
PublicationThe work covers comprehensive laboratory tests of semi-circular bending (SCB) of asphalt concrete samples. The results of two test series, including four and 32 SCB specimens, indicate a substantial scatter of force–deflection (F-d) histories. The numerical analysis is aimed to reflect the maximum breaking load and fracture energy of the samples, pointing out their random character. The original simulation-based fictitious Monte...
-
Generalized Pareto ranking bisection for computationally feasible multi-objective antenna optimization
PublicationMulti-objective optimization (MO) allows for obtaining comprehensive information about possible design trade-offs of a given antenna structure. Yet, executing MO using the most popular class of techniques, population-based metaheuristics, may be computationally prohibitive when full-wave EM analysis is utilized for antenna evaluation. In this work, a low-cost and fully deterministic MO methodology is introduced. The proposed generalized...
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublicationWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
Numerically efficient algorithm for compact microwave device optimization with flexible sensitivity updating scheme
PublicationAn efficient trust-region algorithm with flexible sensitivity updating management scheme for electromagnetic (EM)-driven design optimization of compact microwave components is proposed. During the optimization process, updating of selected columns of the circuit response Jacobian is performed using a rank-one Broyden formula (BF) replacing finite differentiation (FD). The FD update is omitted for directions sufficiently well aligned...
-
SOLUTIONS OF THE INTERMEDIATE SUPPORT STRUC- TURES OF THE NORTHERN MARMARA HIGHWAY (ISTAN- BUL’S RING ROAD) IN THE CONTEXT OF SEISMIC ACTIVITY
PublicationIn 2014–2018, as a result of the expansion of the city of Istanbul in Turkey, a project was imple- mented consisting of building a northern ring road, called the Northern Marmara Highway. The concept of the structural design of the ring road’s intermediate supports aims at constructing sup- ports that according to the TURKISH DLH 2008 standard must comply with the design require- ments for the three calculated earthquake insensitivity...
-
Hybrid evolutionary partitioning algorithm for heat transfer enhancement in VLSI circuits
PublicationW niniejszym artykule przedstawiono metodę pozwalającą na polepszenie transferu ciepła z układu scalonego do otoczenia poprzez zwiększenie liczby połączeń zewnętrznych, co pozwoliło na polepszenie przewodności cieplnej układu scalonego. Dla osiągnięcia tego celu opracowano nowy, hybrydowy, ewolucyjny algorytm podziału (ang. Hybrid Evolutionary Partitioning Algorithm - HEPA). Obliczenia przeprowadzone dla wybranych przykładów testowych...
-
Adjusted SpikeProp algorithm for recurrent spiking neural networks with LIF neurons
PublicationA problem related to the development of a supervised learning method for recurrent spiking neural networks is addressed in the paper. The widely used Leaky-Integrate-and-Fire model has been adopted as a spike neuron model. The proposed method is based on a known SpikeProp algorithm. In detail, the developed method enables gradient descent learning of recurrent or multi-layer feedforward spiking neural networks. The research included...
-
FPGA and ASIC implementation of the algorithm for traffic monitoring in urban areas
PublicationW artykule przedstawiono algorytm detekcji obrazu oraz jego realizację sprzętową w technikach FPGA i ASIC. Algorytm ten dedykowany jest do detekcji ruchu pojazdów i jest realizowany w czasie rzeczywistym. Użyto pojedynczą, umieszczoną na stałe kamerę monochromatyczną o niskiej rozdzielczości. Wykonywane są również operacje eliminacji cieni i rozjaśnień obrazu. Nachodzenie obiektów na siebie nie jest brane pod uwagę. Realizacja...
-
Implementation of localization and identification of ferromagnetic objects algorithm in labview enviroment
PublicationThe problem with detecting dangerous objects is still a matter of concern today. One of the methods of detecting dangerous objects is the magnetic method. While measuring a magnetic field in the surrounding of objects with ferromagnetic properties, it is possible to detect, localize and identify such object.
-
A technique of stabilizing FDTD-subgridding algorithm using reciprocity principle
PublicationW artykule przedstawiono wykorzystanie zasady wzajemności w procesie stabilizacji zagęszczania siatki dla fdtd. Metoda ta oryginalnie służyła tylko do sprawdzenia stabilności algorytmów zagęszczających siatki fdtd, jednak pozwala ona na zmianę współczynnika sprzężenia pomiędzy polami występującymi na brzegach w ten sposób, że algorytm siatkowania jest stabilny. Zaprezentowana metoda została zweryfikowana testami numerycznymi pod...
-
A Tabu Search Algorithm for Optimization of Survivable Overlay Computing Systems
PublicationParadygmat obliczeń rozproszonych ostatnio zyskuje coraz większą uwagę, ponieważ zarówno instytucje przemysłowe, jak i uczelnie wymagają coraz większej mocy obliczeniowej do przetwarzania i analizy danych. Z uwagi na dużą podatność systemów obliczeń na awarie różnych typów (podobnie do systemów sieciowych), gwarancje przeżywalności niniejszych systemów są nieodzowne w celu zapewnienia nieprzerwanego działania usług. Z tego powodu,...
-
Agent-Based Population Learning Algorithm for RBF Network Tuning
Publication -
Implementation and performance evaluation of the agent-based algorithm for ANN training
Publication -
Hybrid Algorithm to Protect Java’s Code from Reverse Engineering
Publication -
Ship Collision Risk Assessment Based on Collision Detection Algorithm
Publication -
A COMPUTATIONAL ALGORITHM FOR THE NUMERICAL SOLUTION OF NONLINEAR FRACTIONAL INTEGRAL EQUATIONS
Publication -
A polynomial algorithm for some preemptive multiprocessor task scheduling problems.
Publication.
-
An EIT reconstruction algorithm: comparison of one-step and iterative versions.
PublicationW pracy przeprowadzono dyskusję problemu rekonstrukcji jednokrokowej i iteracyjnej w tomografii elektroimpedancyjnej. Zbadano zależność błędu rekonstrukcji od parametrów zaburzenia dla wersji jednokrokowej algorytmu i porównano z wynikami rekonstrukcji iteracyjnej. W przeprowadzonych symulacjach wykorzystano algorytm Levenberga-Marquardta.
-
Genetic operators of evolutionary algorithm in problem of collision avoidance at sea
Publication...
-
Development of visual evoked potentials detection algorithm for objective perimetry
PublicationOpisano nową propozycję algorytmu detekcji potencjałów wzrokowych w zapisie EEG. Nowy algorytm bazuje na dekompozycji statystycznej ICA. Algorytm wstępnie przetestowano na danych eksperymentalnych.
-
A polynomial algorithm for solving a general max‐min fairness problem
Publication -
Head movement compensation algorithm in multi-display communication by gaze
PublicationAn influence of head movements on the gaze estimation accuracy when using a head mounted eye tracking system is discussed in the paper. This issue has been examined for a multi-display environment. It was found that head movement (rotation) to some extent does not influence on the gaze estimation accuracy seriously. Acceptable results were obtained when using eye-tracker to communicate with a computer via in two displays simultaneously.
-
An algorithm to generate high dense packing of particles with various shapes
PublicationDiscrete Element Method (DEM) is one of available numerical methods to compute movement of particles in large scale simulations. The method has been frequently applied to simulate the cases of grain or bulk material as the major research issue. The paper describes a new method of generating high dense packing with mixed material of two different shape used in DEM simulation. The initial packing is an important parameter to control,...
-
Testing the Accuracy of the Modified ICP Algorithm with Multimodal Weighting Factors
Publication -
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
Self-Adaptive Mesh Generator for Global Complex Roots and Poles Finding Algorithm
PublicationIn any global method of searching for roots and poles, increasing the number of samples increases the chances of finding them precisely in a given area. However, the global complex roots and poles finding algorithm (GRPF) (as one of the few) has direct control over the accuracy of the results. In addition, this algorithm has a simple condition for finding all roots and poles in a given area: it only requires a sufficiently dense...