Search results for: EDGE DETECTION
-
Comparison of edge detection algorithms for electric wire recognition
PublicationEdge detection is the preliminary step in image processing for object detection and recognition procedure. It allows to remove useless information and reduce amount of data before further analysis. The paper contains the comparison of edge detection algorithms optimized for detection of horizontal edges. For comparison purposes the algorithms were implemented in the developed application dedicated to detection of electric line...
-
Automatic Detection of Nerves in Confocal Corneal Images with Orientation-Based Edge Merging
PublicationThe paper presents an algorithm for improving results of automatic nerve detections in confocal microscopy images of human corneal. The method is designed as a postprocessing step of regular detection. After the nerves are initially detected, the algorithms attempts to improve the results by filling unde-sired gaps between single nerves detections in order to correctly mark the entire nerve instead of only parts of it. This approach...
-
Optimal edge-coloring with edge rate constraints
PublicationWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Global edge alliances in graphs
PublicationIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
The edge of the [dis]order
Publication -
On minimum cost edge searching
PublicationWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublicationGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
Edge-coloring of 3-uniform hypergraphs
PublicationWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
Interval Edge-Coloring of Graphs
Publication -
Mixed graph edge coloring
PublicationW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
Interval edge-coloring of graphs.
PublicationRozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.
-
Influence of edge subdivision on the convex domination number
PublicationWe study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
Badanie jakości transmisji w podsystemie EDGE.
PublicationPrzedstawiono wyniki badań symulacyjnych jakości transmisji w podsystemie EDGE, będącego rozwinięciem systemu GSM w kierunku systemu trzeciej generacji. Uzyskane wyniki odnoszą się do szybkiej transmisji danych, realizowanej w oparciu o komutację kanałów ECSD oraz komutację pakietów EGPRS dla wybranych środowisk propagacyjnych.
-
Edge ranking and searching in partial orders
PublicationArtykuł jest poświęcony problemowi konstrukcji optymalnej (wymagającej minimalnej ilości porównań/zapytań) strategii wyszukiwania elementu w częściowym porządku. W pracy wskazano związki pomiędzy tym problemem oraz uporządkowanym kolorowaniem krawędzi grafów, co implikuje liniowy algorytm dla częściowych porządków o strukturze drzewa. Pokazano również, że znalezienie optymalnej strategii jest problemem obliczeniowo trudnym dla...
-
Compact cyclic edge-colorings of graphs
PublicationArtykuł jest poświęcony modelowi zwartego cyklicznego kolorowania krawędzi grafów. Ten wariant kolorowania jest stosowany w modelowaniu uszeregowań w systemach produkcyjnych, w których proces produkcyjny ma charakter cykliczny. W pracy podano konstrukcje grafów, które nie zezwalają na istnienie pokolorowania w rozważanym modelu. Wykazano także kilka własności teoretycznych, takich jak ograniczenia górne na liczbę kolorów w optymalnym...
-
Entrepreneurship nests in a polish edge city
PublicationThe last two decades in Poland have been a period of both a dynamic development of the small and medium-sized enterprise sector and a transformation of the city surrounding territories. This development began during the economy transformation after 1989. Population migration and movement of economic entities away from central cities resulted in development of territorial structures within some Polish suburban areas, defined as...
-
A framework for automatic detection of abandoned luggage in airport terminal
PublicationA framework for automatic detection of events in a video stream transmitted from a monitoring system is presented. The framework is based on the widely used background subtraction and object tracking algorithms. The authors elaborated an algorithm for detection of left and removed objects based on mor-phological processing and edge detection. The event detection algorithm collects and analyzes data of all the moving objects in...
-
Tight bounds on global edge and complete alliances in trees
PublicationIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
Pupil detection supported by Haar feature based cascade classifier for two-photon vision examinations
PublicationThe aim of this paper is to present a novel method, called Adaptive Edge Detection (AED), of extraction of precise pupil edge coordinates from eye image characterized by reflections of external illuminators and laser beams. The method is used for monitoring of pupil size and position during psychophysical tests of two-photon vision performed by dedicated optical set-up. Two-photon vision is a new phenomenon of perception of short-pulsed...
-
Edge-Computing based Secure E-learning Platforms
PublicationImplementation of Information and Communication Technologies (ICT) in E-Learning environments have brought up dramatic changes in the current educational sector. Distance learning, online learning, and networked learning are few examples that promote educational interaction between students, lecturers and learning communities. Although being an efficient form of real learning resource, online electronic resources are subject to...
-
Interval edge coloring of a graph with forbidden colors
Publication -
program verification strategy and edge ranking of graphs
PublicationW artykule rozważamy model, w którym zakładamy, że dany jest zbiór asercji/testów dla pewnych bloków programu. Celem jest znalezienie optymalnej, tzn. wymagającej wykonania minimalnej liczby testów strategii wyszukiwania błędu w kodzie programu. Pomimo założenia w modelu, iż program posiada dokładnie jeden błąd, rozważania można uogólnić na testowanie kodu z dowolną liczbą błędów. Analizujemy teoretyczne własności tego modelu oraz...
-
Edge effects for heat flux in fibrous composites
Publication -
DFT modelling of the edge dislocation in 4H-SiC
Publication -
Parallel query processing and edge ranking of graphs
PublicationArtykuł poświęcony jest problemowi szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym. Jednym z zastosowań jest poszukiwanie optymalnych harmonogramów w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie funkcji dobroci przybliżonego algorytmu autorstwa Makino, Uno i Ibaraki wraz z rezultatami testów komputerowych przeprowadzonych dla grafów losowych.
-
Self-stabilizing algorithm for edge-coloring of graphs
PublicationReferat ten poświęcony jest kolorowaniu grafów w modelu rozproszonym.Podano samostabilizujący się algorytm kolorowania krawędzi grafu wraz z dowodem poprawności oraz oszacowaniem jego czasu działania.
-
The maximum edge-disjoint paths problem in complete graphs
PublicationRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
POLDER AND CITY: SUSTAINING WATER LANDSCAPES ON AN URBAN EDGE
PublicationThe question investigated in this paper is how to maintain the environmental quality of the polder landscape encompassing the city in the condition of urban pressure on this landscape. On the basis of theoretical approaches, historical surveys and introductory study models new ideas are tested on the case study of Gdansk, a city located in the Vistula River delta in northern Poland. Research shows that the city was created as a...
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Big Data and the Internet of Things in Edge Computing for Smart City
PublicationRequests expressing collective human expectations and outcomes from city service tasks can be partially satisfied by processing Big Data provided to a city cloud via the Internet of Things. To improve the efficiency of the city clouds an edge computing has been introduced regarding Big Data mining. This intelligent and efficient distributed system can be developed for citizens that are supposed to be informed and educated by the...
-
On the approximation of the UWB dipole elliptical arms with stepped-edge polygon
PublicationA simple method of approximation of the ellipticalpatch with stepped-edge polygon is proposed as an introductionto wider studies over the planar ultrawideband (UWB) antennas.The general idea is to replace the elliptical patch with an equivalentpolygonal patch, with minimum loss in the performance. Theprinciples of the proposed method are presented in this letter, aswell as the results of performed numerical studies and its experimentalverification....
-
A Method and Device for 3D Recognition of Cutting Edge Micro Geometry
PublicationA very useful method was successfully applied in the investigation of tools for machining wood and wood based composites. It allows scanning of the cutting edge micro geometry in three dimensions and reproducing it in a virtual space as a 3D surface. The application of the method opens new possibilities of studying tool wear by scanning, including the calculation of volume loss and other analysis of tool wedge geometry along and...
-
Edge coloring of graphs of signed class 1 and 2
PublicationRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...
-
Edge-chromatic sum of trees and bounded cyclicity graphs
Publication -
A linear time algorithm for edge coloring of binomial trees
Publication -
A note on compact and compact circular edge-colorings of graphs
PublicationW pracy rozważamy dwa warianty kolorowania krawędzi grafów prostych i ważonych, mianowicie kolorowania zwarte oraz zwarte cyrkularne. Rozważamy relacje pomiędzy nimi. Dowodzimy, że każdy zewnętrznie planarny graf dwudzielny posiada zwarte pokolorowanie krawędziowe oraz, że problem ten dla grafów ogólnych jest NP-zupełny. Podajemy również wielomianowy 1.5-przybliżony algorytm oraz pseudowielomianowy dokładny algorytm zwartego cyrkularnego...
-
Domination numbers in graphs with removed edge or set of edges
PublicationW artykule przedstawiony jest wpływ usuwania krawędzi lub zbioru krawędzi na liczby dominowania spójnego i słabo spójnego.
-
Algorytmy wykrywania krawędzi w obrazie
PublicationWykrywanie krawędzi jest pierwszym etapem w cyfrowym przetwarzaniu obrazów. Operacja ta polega na usunięciu informacji takich jak kolor czy też jasność, a pozostawieniu jedynie krawędzi. Efektem tej operacji jest znaczna redukcja ilości danych do dalszej analizy. Pozwala to na zastosowanie w następnych etapach bardziej złożonych algorytmów rozpoznawania obiektów na podstawie kształtu. W artykule zaprezentowano zastosowanie algorytmów...
-
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...
-
Novel Analytic-Numerical Model of Free Convection: with Leading Edge Considered
PublicationA novel solution of the free convection boundary problem is represented in analytical form for velocity and temperature for an isothermal vertical plate, as an example. These fields are built as a Taylor Series in the x coordinate with coefficients as functions of the vertical coordinate (y). We restrict ourselves by cubic approximation for both functions. The basic Navier-Stokes and Fourier-Kirchhoff equations and boundary conditions...
-
A Method and Device for 3D Recognition of Cutting Edge Micro Geometry
Publication -
Approximating the maximum 2- and 3-edge-colorable subgraph problems
PublicationDla ustalonej wartości parametru k>=2, problem maksymalnego podgrafu krawędziowo k-kolorowalnego polega na wskazaniu k rozłącznych skojarzeń w grafie prostym, a kryterium optymalizacji jest maksymalizacja całkowitej liczby użytych krawędzi. W pracy podano algorytmy 5/6- i 4/5-przybliżone odpowiednio dla przypadków k=2 i k=3, poprawiając wyniki znane z literatury.
-
Investigation on the edge forces in ball end milling of inclined surfaces
Publication -
Examination of tools of different materials edge geometry for MDF milling
Publication -
Approximation strategies for routing edge disjoint paths in complete graphs
PublicationPraca dotyczy problemu ścieżek krawędziowo rozłącznych w nieskierowanych grafach pełnych, dla którego podano nowe algorytmy przybliżone: 3.75-przybliżony (model off-line) i 6.47-przybliżony (model on-line). Stosując podobną metodologię, uzyskano algorytm 4.5-przybliżony (off-line) i 6-przybliżony (on-line) dla problemu routingu i kolorowania ścieżek w grafach pełnych.
-
Equitable 4-coloring of cacti and edge-cacti in polynomial time
PublicationRozważono problem wyznaczania sprawiedliwej liczby chromatycznej kaktusów i drzew wielokątowych bez trójkątów i krawędzi wiszących. Podano wielomianowy algorytm wyznaczający pokolorowanie optymalne, oparty na paradygmacie programowania dynamicznego. Tym samym znaleziona została kolejna klasa grafów planarnych, dla której kolorowanie sprawiedliwe jawi się jako zagadnienie obliczeniowo łatwe.
-
Edge-Guided Mode Performance and Applications in Nonreciprocal Millimeter-Wave Gyroelectric Components
PublicationThe analogies between the behavior of gyromagnetic and gyroelectric nonreciprocal structures, the use of the simple transfer matrix approach, and the edge-guided (EG) wave property, supported in a parallel plate model for integrated magnetized semiconductor waveguide, are investigated in those frequency regions, where the effective permittivity is negative or positive. As with their ferrite counterparts, the leakage of the EG waves...
-
Some Artificial Intelligence Driven Algorithms For Mobile Edge Computing in Smart City
PublicationSmart mobile devices can share computing workload with the computer cloud that is important when artificial intelligence tools support computer systems in a smart city. This concept brings computing on the edge of the cloud, closer to citizens and it can shorten latency. Edge computing removes a crucial drawback of the smart city computing because city services are usually far away from citizens, physically. Besides, we introduced...
-
Deep Learning Optimization for Edge Devices: Analysis of Training Quantization Parameters
PublicationThis paper focuses on convolution neural network quantization problem. The quantization has a distinct stage of data conversion from floating-point into integer-point numbers. In general, the process of quantization is associated with the reduction of the matrix dimension via limited precision of the numbers. However, the training and inference stages of deep learning neural network are limited by the space of the memory and a...
-
CNN-CLFFA: Support Mobile Edge Computing in Transportation Cyber Physical System
PublicationIn the present scenario, the transportation Cyber Physical System (CPS) improves the reliability and efficiency of the transportation systems by enhancing the interactions between the physical and cyber systems. With the provision of better storage ability and enhanced computing, cloud computing extends transportation CPS in Mobile Edge Computing (MEC). By inspecting the existing literatures, the cloud computing cannot fulfill...
-
How to teach architecture? – Remarks on the edge of Polish transformation processes after 1989
PublicationThe political changes in Poland after 1989 have resulted in a whole range of dynamic processes including the transformation of space. Until that time the established institutional framework for spatial, urban and architectural planning policy was based on uniform provisions of the so-called planned economy. The same applied to the training of architects, which was based on a unified profile of education provided at the state’s...
-
The Taste of Waste: The Edge of Eggshell Over Calcium Carbonate in Acrylonitrile Butadiene Rubber
PublicationRubber technology experiences a new age by the use of biowaste or natural fillers. In this regard, taking properties of reinforcing agents from biowaste fillers remains as the challenging matter. Chicken eggshell (ES) biowaste has recently been introduced to substitute calcium carbonate (CaCO3) duo to its superior properties and low price. In this work, composites based on acrylonitrile butadiene rubber (NBR) reinforced with ES...
-
Fully Separated Flow Control Using DBD Plasma Actuators Located at the Leading Edge of an Airfoil
PublicationIn the framework of the PLASMAERO European project, experiments were conducted to investigate the authority of surface DBD plasma actuators to alter a fully separated flow around an airfoil in order to improve its aerodynamic performances in its natural stall regime. In this paper, unsteady excitation control is more specifically investigated. The key control parameter studied here is the burst frequency which periodically imposes...
-
Big Data from Sensor Network via Internet of Things to Edge Deep Learning for Smart City
PublicationData from a physical world is sampled by sensor networks, and then streams of Big Data are sent to cloud hosts to support decision making by deep learning software. In a smart city, some tasks may be assigned to smart devices of the Internet of Things for performing edge computing. Besides, a part of workload of calculations can be transferred to the cloud hosts. This paper proposes benchmarks for division tasks between an edge...
-
Local Structure and Stability of SEI in Graphite and ZFO Electrodes Probed by As K-edge Absorption Spectroscopy
PublicationThe evolution of the solid electrolyte interphase (SEI) during the first Li uptake in advanced Li-ion electrodes is studied by X-ray absorption spectroscopy (XAS). The As atoms present in the electrolyte solution were used as a local probe for monitoring the SEI growth on different electrodes. High-quality As K-edge spectra were collected in fluorescence mode for a set of graphite and carbon-coated ZnFe2O4 electrodes. XAS measurements...
-
Implementacja w FPGA algorytmu detekcji krawędzi obrazu w czasie rzeczywistym
PublicationW artykule przedstawiono projekt architektury oraz implementację układową toru przetwarzania wstępnego obrazu z modułem detekcji krawędzi. Układ został zaimplementowany w FPGA Intel Cyclone. Zrealizowany moduł wykorzystuje pięć wybranych algorytmów wykrywania krawędzi, w tym Robertsa, Sobela i Prewitt.
-
Detection of Anomalies in the Operation of a Road Lighting System Based on Data from Smart Electricity Meters
PublicationSmart meters in road lighting systems create new opportunities for automatic diagnostics of undesirable phenomena such as lamp failures, schedule deviations, or energy theft from the power grid. Such a solution fits into the smart cities concept, where an adaptive lighting system creates new challenges with respect to the monitoring function. This article presents research results indicating the practical feasibility of real‐time...
-
Trailing-Edge Separation Control of a NACA 0015 Airfoil Using Dielectric-Barrier-Discharge Plasma Actuators
PublicationThis paper presents a part of the works conducted in the Plasmaero European project (task 3.1), where the trailing-edge flow separation of a NACA 0015 airfoil has been controlled using four different dielectric barrier discharge (DBD) actuator types at three institutions across Europe. The results show that it is possible to enhance the aerodynamic performance of aircraft at speeds up to 40 m/s. Dielectric-barrier-discharge vortex...
-
Snapshot of micro-animals and associated biotic and abiotic environmental variables on the edge of the south-west Greenland ice sheet
PublicationMicroinvertebrates play a role as top consumers on glaciers. In this study we tested what kind of cryoconite material the animals inhabit (mud vs granules) on the edge of the Greenland ice sheet (GrIS) in the south-west. We also tested the links between the densities of micro-fauna in cryoconite material and selected biotic (algae, cyanobacteria, bacterial abundances) and abiotic (water depth, pH, ion content, radionuclides) factors....
-
Fully Automated AI-powered Contactless Cough Detection based on Pixel Value Dynamics Occurring within Facial Regions
PublicationIncreased interest in non-contact evaluation of the health state has led to higher expectations for delivering automated and reliable solutions that can be conveniently used during daily activities. Although some solutions for cough detection exist, they suffer from a series of limitations. Some of them rely on gesture or body pose recognition, which might not be possible in cases of occlusions, closer camera distances or impediments...
-
ARTIFICIAL MODEL IN THE ASSESSMENT OF THE ALGORITHM OF OBJECTS RECORDED BY LASER SCANNING SHAPE DETECTION (ALS/TLS)
PublicationBrief description of the study and used methods. Brief description of the study and used As part of the preparatory work aimed to create the application solution allowing for the automation of searching objects in data, obtained in the scanning process using ALS (Airborne Laser Scanning) or TLS (Terrestrial Laser Scanning), the authors prepared a artificial (synthetic, theoretical) model of space, used for the verification of operation...
-
Innovations in Wastewater Treatment: Harnessing Mathematical Modeling and Computer Simulations with Cutting-Edge Technologies and Advanced Control Systems
PublicationThe wastewater treatment landscape in Central Europe, particularly in Poland, has undergone a profound transformation due to European Union (EU) integration. Fueled by EU funding and rapid technological advancements, wastewater treatment plants (WWTPs) have adopted cutting-edge control methods to adhere to EU Water Framework Directive mandates. WWTPs contend with complexities such as variable flow rates, temperature fluctuations,...
-
Formation of Surface Topography During Turning of AISI 1045 Steel Considering the Type of Cutting Edge Coating
Publication -
A study of optical properties and annealing effect on the absorption edge of pristine- and iodine-doped polyazomethine thin films
Publication -
Microstrip line with short-circuited edge as a high-pass filter operating up to millimeter-wave frequencies
PublicationPrzedstawiono prosty planarny filtr górnoprzepustowy wykorzystujący linię mikropaskową ze zwartym brzegiem. Układy zaprojektowano w taki sposób, aby pasmo przepustowe rozpoczynało się w zakresie K lub Ka. Wykonano dwa prototypy: na podłożu w postaci warstwy dielektrycznej wykonanej z ceramiki alundowej oraz na podłożu organicznym o niskiej przenikalności elektrycznej. Wykazano dużą zgodność teoretycznych i pomierzonych charakterystyk...
-
The analysis of resistante to noise and edge jitter of the chosen methodsof recovering the data transmitted over a radio link.
PublicationW artykule porównano odporność na szumy i zakłócenia wybranych metod synchronizacji danych przesyłanych drogą radiową. Wybrano następujące metody:próbkowanie nadmiarowe i decyzja większościowa w odniesieniu do ciągu danych NRZ oraz metoda korelacyjna przeznaczona dla ciągu danych zakodowanych sposobem Manchester. Efektywność wyrażono jako liczbę pakietów, które osiągnęły synchronizację ramki do całkowitej liczby nadanych...
-
Experimental study of the impact of notches and holes made in the front edge of adherends on the properties of static and fatigue strength of adhesive joints
PublicationThe paper presents the results of experimental studies aimed at determining the effect of holes and notches at the front edge of adherends on the strength of adhesive joints. Single-lap joints made of S235JR steel sheets joined with Araldite 2014-2 epoxy adhesive were tested. Comparative tests of static strength in the shear test as well as high-cycle fatigue strength tests were carried out. Joints with three holes with a diameter...
-
A New Adaptive Method for the Extraction of Steel Design Structures from an Integrated Point Cloud
Open Research DataA new automatic and adaptive algorithm for edge extraction from a random point cloud was developed and presented herein. The proposed algorithm was tested using real measurement data. The developed algorithm is able to realistically reduce the amount of redundant data and correctly extract stable edges representing the geometric structures of a studied...
-
Scene Segmentation Basing on Color and Depth Images for Kinect Sensor
PublicationIn this paper we propose a method for segmenting single images from Kinect sensor by considering both color and depth information. The algorithm is based on a series of edge detection procedures designed for particular features of the scene objects. RGB and HSV color planes are separately analyzed in the first step with Canny edge detector, resulting in overall color edges mask. In depth images both clear boundaries and smooth...
-
Proposal of edge-area form removal of cylindrical surfaces containing wide dimples by application of various robust processing techniques
Publication -
Direct determination of paraquat herbicide by square-wave voltammetry by two-step transfer mechanism at heterogeneous boron-doped carbon nanowall electrodes
PublicationBoron-doped carbon nanowalls (B:CNW) versus boron-doped diamond (BDD) materials were investigated for the effective electrochemical detection of highly toxic herbicide paraquat (PQ). Depending on the surface morphology and functional groups of BDD and B:CNWs, the electrochemical absorption and detection of the target analyte PQ revealed different detection mechanisms. The surface absorption mechanism was mainly observed for BDD,...
-
Tool Wear Monitoring Using Improved Dragonfly Optimization Algorithm and Deep Belief Network
PublicationIn recent decades, tool wear monitoring has played a crucial role in the improvement of industrial production quality and efficiency. In the machining process, it is important to predict both tool cost and life, and to reduce the equipment downtime. The conventional methods need enormous quantities of human resources and expert skills to achieve precise tool wear information. To automatically identify the tool wear types, deep...
-
Stable Field Electron Emission and Plasma Illumination from Boron and Nitrogen Co‐Doped Edge‐Rich Diamond‐Enhanced Carbon Nanowalls
PublicationSuperior field electron emission (FEE) characteristics are achieved in edge-rich diamond-enhanced carbon nanowalls (D-ECNWs) grown in a single-step chemical vapor deposition process co-doped with boron and nitrogen. The structure consists of sharp, highly conductive graphene edges supplied by a solid, diamond-rich bottom. The Raman and transmission electron microscopy studies reveal a hybrid nature of sp3-diamond and sp2-graphene...
-
Contour Analysis of Bleeding Regions in Endoscopic Images
PublicationThis paper investigates the problem of detecting bleeding regions in images acquired from endoscopic examinations of gastrointestinal tract. The purpose is to identify the characteristic features of bleeding areas' contours in order to develop an accurate method for discriminating between true bleeding regions and missed detections, which could lead to a significant reduction of the false alarm rate of existing blood-detection...
-
Rozpoznawanie oraz lokalizacja w obrazie przewodów linii wysokiego napięcia
PublicationW pracy przedstawiono opracowany algorytm rozpoznawania oraz lokalizacji przewodów linii wysokiego napięcia na podstawie obrazu horyzontalnego. Procedura detekcji przewodu została podzielona na trzy etapy. Pierwszy etap zawiera algorytm wykrywania krawędzi wykazujący największą czułość na krawędzie poziome, a jednocześnie brak czułości na krawędzie pionowe. Efektem jest znaczna redukcja liczby wykrytych krawędzi w porównaniu do...
-
Wykorzystanie sztucznych sieci neuronowych do wykrywania i rozpoznawania tablic rejestracyjnych na zdjęciach pojazdów
PublicationW artykule przedstawiono koncepcję algorytmu wykrywania i rozpoznawania tablic rejestracyjnych (AWiRTR) na obrazach cyfrowych pojazdów. Detekcja i lokalizacja tablic rejestracyjnych oraz wyodrębnienie z obrazu tablicy rejestracyjnej poszczególnych znaków odbywa się z wykorzystaniem podstawowych technik przetwarzania obrazu (przekształcenia morfologiczne, wykrywanie krawędzi) jak i podstawowych danych statystycznych obiektów wykrytych...
-
AN ALGORITHM FOR PORTAL HYPERTENSIVE GASTROPATHY RECOGNITION ON THE ENDOSCOPIC RECORDINGS
PublicationSymptoms recognition of portal hypertensive gastropathy (PHG) can be done by analysing endoscopic recordings, but manual analysis done by physician may take a long time. This increases probability of missing some symptoms and automated methods may be applied to prevent that. In this paper a novel hybrid algorithm for recognition of early stage of portal hypertensive gastropathy is proposed. First image preprocessing is described....
-
Adaptacyjny system oświetlania dróg oraz inteligentnych miast
PublicationPrzedmiotem rozprawy jest zbadanie praktycznej możliwości wykrywania w czasie rzeczywistym anomalii w systemie oświetlenia drogowego w oparciu o analizę danych ze inteligentnych liczników energii. Zastosowanie inteligentnych liczników energii elektrycznej (Smart Meter) w systemach oświetlenia drogowego stwarza nowe możliwości w zakresie automatycznej diagnostyki takich niepożądanych zjawisk jak awarie lamp, odstępstwa od harmonogramu...
-
A New Adaptive Method for the Extraction of Steel Design Structures from an Integrated Point Cloud
PublicationThe continuous and intensive development of measurement technologies for reality modelling with appropriate data processing algorithms is currently being observed. The most popular methods include remote sensing techniques based on reflected-light digital cameras, and on active methods in which the device emits a beam. This research paper presents the process of data integration from terrestrial laser scanning (TLS) and image data...
-
Hardware-Software Implementation of a Sensor Network for CityTraffic Monitoring Using the FPGA- and ASIC-Based Sensor Nodes
PublicationArtykuł opisuje prototypową sieć sensorową do monitorowania ruchu pojazdów w mieście. Węzły sieci sensorowej, wyposażone w kamerę o niskiej rozdzielczości, obserwują ulice i wykrywają poruszające się obiekty. Detekcja obiektów jest realizowana w oparciu o własny algorytm segmentacji obrazów, wykorzystujący podwójne odejmowanie tła, wykrywanie krawędzi i cieni, działający na dedykowanym systemie mikroelektronicznym typu ''System...
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Open Research DataFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Open Research DataFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Open Research DataFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Open Research DataFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Open Research DataFor K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...
-
Dataset of non-isomorphic graphs of the coloring types (K4,K4;n), 1<n<R(4,4)
Open Research DataFor K4 graph, a coloring type (K4,K4;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the K4 subgraph in the second color (representing by edges in the graph).The Ramsey number R(4,4) is the smallest natural number n such that for any edge coloring of...
-
Searching by Heterogeneous Agents
PublicationIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Open Research DataFor Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...
-
Terrestrial Survey Images - Multispectral Exterior Model - Gdansk Church Pw. Św. Wojciecha - Micasense Dual
Open Research DataDataset description: Raw images from photogrammetric survey. Object: Kościół Rzymskokatolicki Pw. Św. WojciechaLocation: Gdansk, Pomerania, PolandDrone type: N/A (terrestrial images)Flight plan: Free - walk around the object with camera. 3 images taken at the point.Target Product: 3D Model - Multispectral ModelDate: 24.04.2022Direct georeferencing:...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Open Research DataFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...
-
Searching by heterogeneous agents
PublicationIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
-
LDRAW based renders of LEGO bricks moving on a conveyor belt with extracted models
Open Research DataThe set contains renders of LEGO bricks moving on a white conveyor belt. The images were prepared for training neural network for recognition of LEGO bricks. For each brick starting position, alignment and color was selected (simulating the brick falling down on the conveyour belt) and than 10 images was created while the brick was moved across the...
-
Evolution of Edges and Porosity of Urban Blue Spaces: A Case Study of Gdańsk
PublicationCurrent waterfront studies focus mainly on a land-based perspective, failing to include the water side. Water is, however, not just a resource for port and industrial purposes and an edge to the waterfront; it is also a feature of the waterfront and the complex relation between water and city. Thus, the article suggests that water-land edges need to be re-contextualised, taking into consideration also their shape, functionality,...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Open Research DataFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
Analysis of the Surface Stereometry of Alloyed Austenitic Steel after Fibre Laser Cutting using Confocal Microscopy
PublicationThe paper extends the concept of cut edge quality and examines the fibre laser cutting process. A Prima Power Platino Fiber Evo device with a reference speed (RS) of 3500 mm/min was used for laser cutting. In order to analyse the influence of the laser cutting speed on the cut edge quality of X5CrNi18-10 stainless steel sheets, macroscopic studies were conducted on a stereoscopic microscope and surface stereometry on a confocal...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...