Filters
total: 8603
-
Catalog
displaying 1000 best results Help
Search results for: approximation algorithm, graph coloring, incompatible job, polynomial algorithm, scheduling, uniform machine, unit-time job
-
On Algorithm Details in Multibeam Seafloor Classification
PublicationRemote sensing of the seafloor constitutes an important topic in exploration, management, protection and other investigations of the marine environment. In the paper, a combined approach to seafloor characterisation is presented. It relies on calculation of several descriptors related to seabed type using three different types of multibeam sonar data obtained during seafloor sensing, viz.: 1) the grey-level sonar images (echograms)...
-
An optimal sliding mode control based on immune-wavelet algorithm for underwater robotic manipulator
PublicationIn this paper, a robust optimal Sliding Mode Controller (SMC) based on new algorithm of Artificial Immune System (AIS) is proposed for trajectory tracking of underwater manipulators. A new AIS algorithm is used to derive optimal values of surface parameters and boundary layer thickness in SMC with considering minimum torques and error. Surface parameters and boundary layer thickness are considered as antibody in AIS and Morlet...
-
Equitable coloring of corona products of graphs
PublicationIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
The choice of parameters of induction motor model using a genetic algorithm.
PublicationRozważano problem doboru parametrów modeli matematycznych dużych 3 -fazowych silników indukcyjnych. Modele o prawidłowo dobranych parametrach mogą być pomocne podczas procedur projektowych. Podane silniki mogą być używane jako napędy sterów strumieniowych statków. Symulacje w środowisku Matlab, uwzględniają modele statyczne silników. Parametry silników dobierane są za pomocą przybornika Genetic Algorithm Toolbox. Skuteczność metody...
-
Evolutional algorithm in stock control
Publication -
FPGA-Based Real-Time Implementation of Detection Algorithm for Automatic Traffic Surveillance Sensor Network
PublicationArtykuł opisuje sprzętową implementację w układzie FPGA algorytmu wykrywającego pojazdy, przeznaczonego do zastosowania w autonomicznej sieci sensorowej. Zadaniem algorytmu jest detekcja poruszających się pojazdów w obrazie z kamery pracującej w czasie rzeczywistym. Algorytm ma na celu oszacowanie parametrów ruchu ulicznego, takich jak liczba pojazdów, ich kierunek ruchu i przybliżona prędkość, przy wykorzystaniu sprzętu sieci...
-
EvOLAP Graph – Evolution and OLAP-Aware Graph Data Model
PublicationThe objective of this paper is to propose a graph model that would be suitable for providing OLAP features on graph databases. The included features allow for a multidimensional and multilevel view on data and support analytical queries on operational and historical graph data. In contrast to many existing approaches tailored for static graphs, the paper addresses the issue for the changing graph schema. The model, named Evolution...
-
The Algorithm of Modelling and Analysis of Latent Semantic Relations: Linear Algebra vs. Probabilistic Topic Models
PublicationThis paper presents the algorithm of modelling and analysis of Latent Semantic Relations inside the argumentative type of documents collection. The novelty of the algorithm consists in using a systematic approach: in the combination of the probabilistic Latent Dirichlet Allocation (LDA) and Linear Algebra based Latent Semantic Analysis (LSA) methods; in considering each document as a complex of topics, defined on the basis of separate...
-
Integrated algorithm for selecting the location and control of energy storage units to improve the voltage level in distribution grids
PublicationThis paper refers to the issue that mainly appears in distribution grids, where renewable energy sources (RES) are widely installed. In such grids, one of the main problems is the coordination of energy production time with demand time, especially if photovoltaic energy sources are present. To face this problem, battery energy storage units (ESU) can be installed. In recent years, more and more attention has been paid to optimizing...
-
MICROSEISMIC EVENT DETECTION USING DIFFERENT ALGORITHMS ON REAL DATA FROM PATCH ARRAY GEOPHONE GRID FROM EASTERN POMERANIA FRACTURING JOB
PublicationThe microseismic monitoring is a method of monitoring of fracture propagation during hydraulic fracturing process. Hydraulic fracturing is a method of reservoir stimulation used especially for unconventional gas recovery. A matrix of several thousand geophones is placed on the surface of earth to record every little tremor of ground induced by fracturing process. Afterwards, the signal is analysed and the place of tremor occurrence...
-
An optimized system for sensor ontology meta-matching using swarm intelligent algorithm
PublicationIt is beneficial to annotate sensor data with distinct sensor ontologies in order to facilitate interoperability among different sensor systems. However, for this interoperability to be possible, comparable sensor ontologies are required since it is essential to make meaningful links between relevant sensor data. Swarm Intelligent Algorithms (SIAs), namely the Beetle Swarm Optimisation Algorithm (BSO), present a possible answer...
-
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...
-
Adaptive Algorithm of a Tap-Changer Controller of the Power Transformer Supplying the Radial Network Reducing the Risk of Voltage Collapse
Publicationhe development of renewable energy, including wind farms, photovoltaic farms as well as prosumer installations, and the development of electromobility pose new challenges for network operators. The results of these changes are, among others, the change of network load profiles and load flows determining greater volatility of voltages. Most of the proposed solutions do not assume a change of the transformer regulator algorithm....
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationIn this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.
-
Convex set of quantum states with positive partial transpose analysed by hit and run algorithm
PublicationThe convex set of quantum states of a composite K×K system with positive partial transpose is analysed. A version of the hit and run algorithm is used to generate a sequence of random points covering this set uniformly and an estimation for the convergence speed of the algorithm is derived. For K >3 or K=3 this algorithm works faster than sampling over the entire set of states and verifying whether the partial transpose is positive....
-
Atomic Force Microscope data post-processing algorithm for higher harmonics imaging
PublicationPrevious works have proved that higher harmonics topography imaging using atomic force microscope (AFM) can significantly enhanced its measurement capabilities. Integrated tools dedicated to most of microscopes allow to visualize the investigated surface only by one selected harmonic. Because of the different characteristics of a sample, scanning tip and the environment, appropriate harmonic selection is time consuming and requires...
-
Hardware implementation of digital image stabilization using optical flow algorithm and FPGA technology
PublicationW artykule przedstawiono efektywną procedurę uproszczenia algorytmu przepływu optycznego oraz jego realizację w układzie programowalnym FPGA. Zmodyfikowany algorytm wykorzystuję metodę blokowego dopasowania podobszarów oraz jednowymiarową reprezentację podobszarów. Dodatkowo, funkcja korelacji oparta jest o normę L1. W rezultacie uzyskano zmniejszenie zużytych zasobów kosztem nieznacznej utraty dokładności. Zarówno dokładność,...
-
Obtaining a Well-Trained Artificial Intelligence Algorithm from Cross-Validation in Endoscopy
PublicationThe article shortly discusses endoscopic video analysis problems and artificial intelligence algorithms supporting it. The most common method of efficiency testing of these algorithms is to perform intensive cross-validation. This allows for accurately evaluate their performance of generalization. One of the main problems of this procedure is that there is no simple and universal way of obtaining a specific instance of a well-trained...
-
Minimum order of graphs with given coloring parameters
PublicationA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Measuring Tilt with an IMU Using the Taylor Algorithm
PublicationThis article addresses the important problem of tilt measurement and stabilization. This is particularly important in the case of drone stabilization and navigation in underwater environments, multibeam sonar mapping, aerial photogrammetry in densely urbanized areas, etc. The tilt measurement process involves the fusion of information from at least two different sensors. Inertial sensors (IMUs) are unique in this context because...
-
Implementation of magnitude calculation of complex numbers using improved alpha max plus beta min algorithm
PublicationThe paper presents the hardware implementation of the improved alpha max plus beta min algorithm for calculating the magnitude of complex numbers. This version of the algorithm requires the general division which is performed using a noniterative multiplicative division algorithm. We analyze in detail the division algorithm, its error and the impact of finite word-length signal representations on the assumed total computation error....
-
TensorHive: Management of Exclusive GPU Access for Distributed Machine Learning Workloads
PublicationTensorHive is a tool for organizing work of research and engineering teams that use servers with GPUs for machine learning workloads. In a comprehensive web interface, it supports reservation of GPUs for exclusive usage, hardware monitoring, as well as configuring, executing and queuing distributed computational jobs. Focusing on easy installation and simple configuration, the tool automatically detects the available computing...
-
Uniform solvability for families of linear systems on time scales
Publication -
A comparative study of English viseme recognition methods and algorithm
PublicationAn elementary visual unit – the viseme is concerned in the paper in the context of preparing the feature vector as a main visual input component of Audio-Visual Speech Recognition systems. The aim of the presented research is a review of various approaches to the problem, the implementation of algorithms proposed in the literature and a comparative research on their effectiveness. In the course of the study an optimal feature vector...
-
A Self-Adaptive Complex Root Tracing Algorithm for the Analysis of Propagation and Radiation Problem
PublicationAn improved complex root tracing algorithm for radiation and propagation issues is proposed. The approach is based on a self-adaptive discretization of Cauchy’s argument principle for a C × R space and requires a reduced number of function calls in comparison to other procedures presented in the literature. A few different examples concerning propagation and radiation problems have been considered to verify the validity and efficiency...
-
Optimization algorithm and filtration using the adaptive TIN model at the stage of initial processing of the ALS point cloud
PublicationAirborne laser scanning (ALS) provides survey results in the form of a point cloud. The ALS point cloud is a source of data used primarily for constructing a digital terrain model (DTM). To generate a DTM, the set of ALS observations must be first subjected to the point cloud processing methodology. A standard methodology is composed of the following stages: acquisition of the ALS data, initial processing (including filtration),...
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publication -
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...
-
Fast Collaborative Graph Exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Fast collaborative graph exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
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...
-
Utilization of a Non-Linear Error Function in a Positioning Algorithm for Distance Measurement Systems Designed for Indoor Environments
PublicationA new positioning algorithm for distance measurement systems is outlined herein. This algorithm utilizes a non-linear error function which allows us to improve the positioning accuracy in highly difficult indoor environments. The non-linear error function also allows us to adjust the performance of the algorithm to the particular environmental conditions. The well-known positioning algorithms have limitations, mentioned by their...
-
Stability by linear approximation for time scale dynamical systems
Publication -
Implementation of power transformer controlled switching algorithm
PublicationThe article presents two new algorithms of controlled switching the power transformer. The main aim of the paper is to obtain formulas that determine the moments of closing of the circuit breaker poles. The study contains projects of control systems for both algorithms. Mathematical formulas for the time instants of the breaker poles closing were developed on the basis of electric circuit theory and magnetic circuit theory. The...
-
Safe-Guarded Agent Design Pattern for Mechatronic Systems
Publication -
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublicationConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Graph classes generated by Mycielskians
PublicationIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
APPLYING RANSAC ALGORITHM FOR FITTING SCANNING STRIPS FROM AIRBORNE LASER SCANNING
PublicationDuring the development of the data acquired by airborne laser scanning the important issue is the fitting and georeferencing of ALS point clouds by means of the tie surfaces and the reference planes. The process of scanning strips adjustment is based on mutual integration of point clouds (scanning strips) and their adaptation to the reference planes.In simultaneous adjustment all strips are combined into one geometrically coherent...
-
Homology algorithm based on acyclic subspace
Publication -
An efficient algorithm for finding ideal schedules
PublicationPodejmujemy problem szeregowania zadań jednostkowych z zadanymi czasamy przybycia i zależnościami kolejnościowymi. Uszeregowanie jest idealne jeśli jednocześnie minimalizuje maksymalny oraz średni czas zakończenia zadania. Podajemy przyklad pokazujący, że uszeregowania idealne nie istnieją dla relacji zależności zadań będącej drzewem, gdy dopuścimy możliwość wystąpienia przerwań. Z drugiej strony podajemy algorytm o złożoności...
-
An efficient incremental DFA minimization algorithm
PublicationW tym artykule przedstawiamy nowy algorytm minimalizacji deterministycznego automatu skończonego. Algorytm jest przyrostowy - może być zatrzymany w dowolnym momencie, dając częściowo zminimalizowany automat. Wszystkie inne (znane) algorytmy minimalizacji dają wyniki pośrednie nieprzydatne dla częściowej minimalizacji. Ponieważ pierwszy algorytm jest łatwo zrozumiały ale mało wydajny, rozważamy trzy praktyczne, znaczące usprawnienia....
-
Backprojection algorithm for current mode EIT.
PublicationW pracy przedstawiono algorytm rekonstrukcyjny dla TEI wykorzystujący informację o rozpływie prądu pomiędzy elektrody pomiarowe zwarte do potencjału wspólnego. Pokazano, że algorytm jest analogiczny do znanego wcześniej algorytmu określanego jako Backprojection. Przedstawiono przykładowe wyniki rekonstrukcji dla obiektu kołowego.
-
Flow Control Algorithm for UMTS HSDPA
PublicationHSDPA (High Speed Downlink Packet Access) jest istotnym etapem ewolucji systemu UMTS. Pozwala na transmisję do użytkownika z prędkością dochodzącą do 14.4 Mbit/s; aby to umożliwić, wprowadzono w wersji 5 UMTS szereg nowych mechanizmów w warstwie fizycznej oraz MAC. W tej pracy przedstawiono szczegółową analizę jednego z nowych mechanizmów - algorytmu kontroli natężenia ruchu między MAC-hs i MAC-d. Zaproponowano nowy, efektywny...
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublicationThe domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...
-
Ellipse-fitting algorithm implementation in the impedance measurement system based on DAQ card with FPGA
PublicationThe paper presents an implementation of the ellipse-fitting algorithm in the impedance measurement system based on DAQ card equipped with FPGA chip. The method implementation was tested by simulation means as well as experimentally in the designed and presented measurement system. Finally, the limit values of sampling parameters which assures satisfying accuracy were given.
-
On Computational Aspects of Greedy Partitioning of Graphs
PublicationIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
Evaluation of Sound Enhancement in Mobile Device Using Virtual Bass Synthesiss Algorithm
PublicationAn experiment conducted to validate possibility of use virtual bass synthesis (VBS) algorithm in a portable computer is presented. The subjective listening tests based on the procedure of pairwise comparison between VBS, based on the so-called missing fundamental phenomenon, and standard bass boost technique are employed. The evaluation was carried out in two types of conditions: in a professional listening room and employing an...
-
A reactive algorithm for deducing nodal forwarding behavior in a multihop ad-hoc wireless network in the presence of errors
PublicationA novel algorithm is presented to deduce individual nodal forwarding behavior from standard end-to-end acknowledgments. The algorithm is based on a well-established mathematical method and is robust to network related errors and nodal behavior changes. The proposed solution was verified in a network simulation, during which it achieved sound results in a challenging multihop ad-hoc network environment.
-
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...