Search
Filters
total: 402
filtered: 365
-
Catalog
Chosen catalog filters
Search results for: DOMINATION NUMBER, ALGORITHM, TREE
-
On-line ranking of split graphs
PublicationA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
Comparative study on total nitrogen prediction in wastewater treatment 1 plant and effect of various feature selection methods on machine learning algorithms performance
PublicationWastewater 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...
-
Perfect hashing tree automata
PublicationWe present an algorithm that computes a function that assigns consecutive integers to trees recognized by a deterministic, acyclic, finite-state, bottom-up tree automaton. Such function is called minimal perfect hashing. It can be used to identify trees recognized by the automaton. Its value may be seen as an index in some other data structures. We also present an algorithm for inverted hashing.Przedstawiamy algorytm, który oblicza...
-
The design of an intelligent medical space supporting automated patient interviewing
PublicationThe article presents the architecture and results of implementing an application for the intelligent medical space UbiDoDo (Ubiquitous Domestic Doctor's Office). The main purpose of the application is real-time monitoring of the biomedical parameters of a patient in his domestic environment. It allows an immediate reaction to appearing symptoms and provides means to automatically interview the patient and deliver his results to...
-
Parity vertex colouring of graphs
PublicationA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
Effect of the Road Environment on Road Safety in Poland
PublicationRun-off-road accidents tend to be very severe because when a vehicle leaves the road, it will often crash into a solid obstacle (tree, pole, supports, front wall of a culvert, barrier). A statistical analysis of the data shows that Poland's main roadside hazard is trees and the severity of vehicles striking a tree in a run-off-road crash. The risks are particularly high in north-west Poland with many of the roads lined up with...
-
Double bondage in graphs
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
Vehicle classification based on soft computing algorithms
PublicationExperiments and results regarding vehicle type classification are presented. Three classes of vehicles are recognized: sedans, vans and trucks. The system uses a non-calibrated traffic camera, therefore no direct vehicle dimensions are used. Various vehicle descriptors are tested, including those based on vehicle mask only and those based on vehicle images. The latter ones employ Speeded Up Robust Features (SURF) and gradient images...
-
METHOD OF ROUTING SHIPS SAILING IN DEDICATED ENVIRONMENT
PublicationThe method for determining the suboptimal route of sailing vessels operating in a restricted area of the sea are proposed in the paper. The dynamics of the environment including weather conditions and speed characteristics of ships sailing are considered. As optimiza-tion criterion, measure sailing time T, and the number of maneuvers performed ω, are taken into account. An heuristic algorithm, and the appropriate application routing...
-
A Simplified SVPWM Technique for Five-leg Inverter with Dual Three-phase Output
PublicationThis article proposes a simplified space vector pulse-width modulation (SVPWM) technique five-leg inverter with dual three-phase output. An idea to fed the dual tree-phase machine by the multiphase voltage source inverters (VSIs) is not new. Dual- and multi-motor drive systems are widely used in the industry applications. The most popular fields are: electric vehicles (EVs) and traction systems. Moreover, the specific characteristic...
-
Collision-Free Network Exploration
PublicationA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
Fast Calibration-Free Single-Anchor Indoor Localization Based on Limited Number of ESPAR Antenna Radiation Patterns
Publication— In this article, we investigate how the calibrationfree single-anchor indoor localization algorithm developed for base stations equipped with electronically steerable parasitic array radiator (ESPAR) antennas can further be improved. By reducing the total number of ESPAR antenna radiation patterns used in localization process, one can significantly reduce the time needed for an object localization. Performed localization measurements...
-
Minimising the Churn Out of the Service by Using a Fairness Mechanism
PublicationThe paper proposes an algorithm of bandwidth distribution, ensuring fairness to end-users in computer networks. The proposed algorithm divides users into satisfied and unsatisfied users. It provides fairness in terms of quality of experience (QoE) for satisfied users and quality of service (QoS) for unsatisfied users. In this paper, we present detailed comparisons relevant to service providers to show the advantages of the proposed...
-
Comparison of the Efficiency of Turbo Codes with Mechanisms of Reducing the Number of Iterations
PublicationThe paper presents the construction of encoders and decoders turbo codes with different number of states. Simulation results of the transmission quality of the turbo codes were presented. Decoders for turbo codes have worked with a fixed number of iterations and with the mechanisms reducing the number of iterations. Data were transmitted in Outdoor to Indoor & Pedestrian B environment for data rate 384 kbps. The SOVA algorithm...
-
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...
-
Efficient algorithm for blinking LED detection dedicated to embedded systems equipped with high performance cameras
PublicationThis paper presents the concept and implementation of an efficient algorithm for detection of blinking LED or similar signal sources. Algorithm is designed for embedded devices equipped with high performance cameras being a part of an indoor positioning embedded system. An algorithm to be implemented in such a system should be efficient in terms of computational power what is hard to be achieved when large amount of data from camera...
-
Efektywna metoda wyznaczania trasy statków żaglowych
PublicationZaproponowano metodę wyznaczania suboptymalnej trasy statków żaglowych poruszających się w ograniczonym akwenie morskim. Uwzględniono przy tym dynamikę tego środowiska w tym warunki pogodowe oraz charakterystyki prędkościowe statków żaglowych. Jako kryterium optymalizacji przyjęto czas żeglugi T oraz liczbę wykonanych manewrów ω. Zaprojektowano heurystyczny algorytm oraz odpowiednią aplikację wyznaczania trasy dla ustalonych punktów...
-
Graphs hard-to-process for greedy algorithm MIN
PublicationWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
The reliability of tree and star networks.
PublicationOne of the important parameters characterizing the quality of computer networks is the network's reliability with respect to failures of the communication links and nodes. This chapter investigated the reliability of tree and star networks. The tree and star topology is used in centralized computer networks. In centralized computer networks all communication must take place through some central computer. Following measures of network...
-
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...
-
Neural Network-Based Sequential Global Sensitivity Analysis Algorithm
PublicationPerforming global sensitivity analysis (GSA) can be challenging due to the combined effect of the high computational cost, but it is also essential for engineering decision making. To reduce this cost, surrogate modeling such as neural networks (NNs) are used to replace the expensive simulation model in the GSA process, which introduces the additional challenge of finding the minimum number of training data samples required to...
-
Examining Classifiers Applied to Static Hand Gesture Recognition in Novel Sound Mixing System
PublicationThe main objective of the chapter is to present the methodology and results of examining various classifiers (Nearest Neighbor-like algorithm with non-nested generalization (NNge), Naive Bayes, C4.5 (J48), Random Tree, Random Forests, Artificial Neural Networks (Multilayer Perceptron), Support Vector Machine (SVM) used for static gesture recognition. A problem of effective gesture recognition is outlined in the context of the system...
-
Parallel Background Subtraction in Video Streams Using OpenCL on GPU Platforms
PublicationImplementation of the background subtraction algorithm using OpenCL platform is presented. The algorithm processes live stream of video frames from the surveillance camera in on-line mode. Processing is performed using a host machine and a parallel computing device. The work focuses on optimizing an OpenCL algorithm implementation for GPU devices by taking into account specific features of the GPU architecture, such as memory access,...
-
Optimal shape design of multi-element trawl-doors using local surrogate models
PublicationTrawl-doors have a large influence on the fuel consumption of fishing vessels. Design and optimiza-tion of trawl-doors using computational models are a key factor in minimizing the fuel consump-tion. This paper presents an optimization algorithm for the shape design of trawl-door shapes using computational fluid dynamic (CFD) models. Accurate CFD models are computationally expensive. Therefore, the direct use of traditional optimization...
-
A method for counting people attending large public events
PublicationThe algorithm for people counting in crowded scenes, based on the idea of virtual gate which uses optical flow method is presented. The concept and practical application of the developed algorithm under real conditions is depicted. The aim of the work is to estimate the number of people passing through entrances of a large sport hall. The most challenging problem was the unpredicted behavior of people while entering the building....
-
Performance Evaluation of the Parallel Codebook Algorithm for Background Subtraction in Video Stream
PublicationA background subtraction algorithm based on the codebook approach was implemented on a multi-core processor in a parallel form, using the OpenMP system. The aim of the experiments was to evaluate performance of the multithreaded algorithm in processing video streams recorded from monitoring cameras, depending on a number of computer cores used, method of task scheduling, image resolution and degree of image content variability....
-
Efficient uncertainty quantification using sequential sampling-based neural networks
PublicationUncertainty quantification (UQ) of an engineered system involves the identification of uncertainties, modeling of the uncertainties, and the forward propagation of the uncertainties through a system analysis model. In this work, a novel surrogate-based forward propagation algorithm for UQ is proposed. The proposed algorithm is a new and unique extension of the recent efficient global optimization using neural network (NN)-based...
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublicationA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...
-
A machine learning approach to classifying New York Heart Association (NYHA) heart failure
PublicationAccording to the European Society of Cardiology, globally the number of patients with heart failure nearly doubled from 33.5 million in 1990 to 64.3 million in 2017, and is further projected to increase dramatically in this decade, still remaining a leading cause of morbidity and mortality. One of the most frequently applied heart failure classification systems that physicians use is the New York Heart Association (NYHA) Functional...
-
Improved magnitude estimation of complex numbers using alpha max and beta min algorithm
PublicationThe paper presents an improved algorithm for calculating the magnitude of complex numbers. This problem, which is a special case of square rooting, occurs for example, in FFT processors and complex FIR filters. The proposed method of magnitude calculation makes use of the modified alpha max and beta min algorithm. The improved version of the algorithm allows to control the maximum magnitude approximation error by using an adequate...
-
Clearing directed subgraphs by mobile agents
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
-
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
PublicationW pracy rozważamy problem szukania, dla danego grafu prostego, drzewa spinającego, którego uporządkowana liczba chromatyczna jest minimalna. K.~Miyata i inni dowiedli w [Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem,Discrete Appl. Math. 154 (2006) 2402-2410], że odpowiedni problem decyzyjny jest NP-trudny już w przypadku pytania o istnienie uporządkowanego 4-pokolorowania....
-
The Potential of Greed for Independence
PublicationThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
Spectral measurement of birefringence using particle swarm optimization analysis
PublicationThe measurement of birefringence is useful for the examination of both technical and biological objects. One of the main problems is that the polarization state of light in birefringent media changes periodically. Without the knowledge of the period number, the birefringence of a given medium cannot be determined reliably. We propose to analyse the spectrum of light in order to determine the birefringence. We use a Particle Swarm...
-
New potential functions for greedy independence and coloring
PublicationA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Performance of data transmission in UMTS with turbo code about decreased number of states
PublicationIn the paper a structure of turbo encoder and decoder about decreased number of states has been described. The simulation results of transmission performance based on turbo coding without the reduction of the number of iterations for the uplink and downlink of WCDMA/FDD interface have been presented. The SOVA algorithm for turbo decoding has been used. The investigations have been carried out for Outdoor to Indoor & Pedestrian...
-
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...
-
Novel structure and design of compact UWB slot antenna
PublicationIn this paper, a novel structure of a compact UWB slot antenna is presented along with a simulation-driven design optimization algorithm for adjusting geometry parameters of the device. Our primary objective is to obtain small footprint of the structure while maintaining its acceptable electrical performance. It is achieved by introducing sufficiently large number of geometry degrees of freedom, including increased number of parameterized...
-
Theoretical modelling of efficient fire safety water networks by certified domination
PublicationThis paper explores a new way of designing water supply networks for fire safety using ideas from graph theory, focusing on a method called certified domination. Ensuring a good water supply is crucial for fire safety in communities, this study looks at the rules and problems in Poland for how much water is needed to fight fires in different areas and how this can be achieved at a lowest possible cost. We present a way to plan...
-
Dynamic coloring of graphs
PublicationDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Weakly connected Roman domination in graphs
PublicationA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
Arterial cannula shape optimization by means of the rotational firefly algorithm
PublicationThe article presents global optimization results of arterial cannula shapes by means of the newly modified firefly algorithm. The search for the optimal arterial cannula shape is necessary in order to minimize losses and prepare the flow that leaves the circulatory support system of a ventricle (i.e. blood pump) before it reaches the heart. A modification of the standard firefly algorithm, the so-called rotational firefly algorithm,...
-
On the independence number of some strong products of cycle-powers
PublicationIn the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers alpha((C^2_10)^⊠3) = 30 and alpha((C^4 _14)^⊠3) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm used to establish the independence number of the third strong power of cycle-powers. Moreover, our results establish...
-
An Improvement of Global Complex Roots and Poles Finding Algorithm for Propagation and Radiation Problems
PublicationAn improvement of the recently developed global roots finding algorithm has been proposed. The modification allows to shorten the computational time by reducing the number of function calls. Moreover, both versions of the algorithms (standard and modified) have been tested for numerically defined functions obtained from spectral domain approach and field matching method. The tests have been performed for three simple microwave...
-
Application of virtual gate for counting people participating in large public events
PublicationThe concept and practical application of the developed algorithm forpeople counting in crowded scene is presented. The aim of the work is to estimatethe number of people passing towards entrances of a large sport hall. Thedetails of implemented the Virtual Gate algorithm are presented. The video signalfrom the camera installed in the building constituted the input for the algorithm.The most challenging problem was the unpredicted...
-
A Point Set Connection Problem for Autonomous Mobile Robots in a Grid
PublicationConsider an orthogonal grid of streets and avenues in a Manhattan-like city populated by stationary sensor modules at some intersections and mobile robots that can serve as relays of information that the modules exchange, where both module-module and module-robot communication is limited to a straight line of sight within the grid. The robots are oblivious and move asynchronously. We present a distributed algorithm that, given...
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublicationThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Adversarial attack algorithm for traffic sign recognition
PublicationDeep learning suffers from the threat of adversarial attacks, and its defense methods have become a research hotspot. In all applications of deep learning, intelligent driving is an important and promising one, facing serious threat of adversarial attack in the meanwhile. To address the adversarial attack, this paper takes the traffic sign recognition as a typical object, for it is the core function of intelligent driving. Considering...
-
Detection and size estimation of crack in plate based on guided wave propagation
PublicationThe paper presents results of the comprehensive theoretical and experimental investigation of crack detection in metallic plate using guided wave propagation. The main aim of the paper is to develop the novel method which would allow for linear crack size estimation with the use of minimal number of the transducers. In general, there exists the relation between length of the propagation path and the wave amplitude value. However,...
-
Scaling of numbers in residue arithmetic with the flexible selection of scaling factor
PublicationA scaling technique of numbers in resudue arithmetic with the flexible selection of the scaling factor is presented. The required scaling factor can be selected from the set of moduli products of the Residue Number System (RNS) base. By permutation of moduli of the number system base it is possible to create many auxilliary Mixed-Radix Systems associated with the given RNS with respect to the base, but they have different sets...