Filters
total: 461
filtered: 412
Search results for: VERTEX-EDGE DOMINATION
-
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...
-
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.
-
Modelling of Edge Insulation Depending on Boundary Conditions for the Ground Level
Publication -
A Method and Device for 3D Recognition of Cutting Edge Micro Geometry
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.
-
Investigation on the edge forces in ball end milling of inclined surfaces
Publication -
Nordhaus-Gaddum results for the weakly convex domination number of a graph
PublicationArtykuł dotyczy ograniczenia z góry i z dołu (ze względu na ilość wierzchołków) sumy i iloczynu liczb dominowania wypukłego grafu i jego dopełnienia.
-
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...
-
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,...
-
All graphs with restrained domination number three less than their order
PublicationW pracy opisana jest rodzina wszystkich grafów, dla których liczbadominowania zewnętrznego jest o trzy mniejsza od ich rzędu.
-
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...
-
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...
-
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...
-
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...
-
The domination of ionic conductivity in tetragonal phase of the organometal halide perovskite CH3NH3PbI3-xClx
PublicationOrganometal trihalide perovskites have recently gained extreme attention due to their high solar energy conversion in photovoltaic cells. Here, we investigate the contribution of iodide ions to a total conductivity of the mixed lead halide perovskite CH3NH3PbI3−xClx with a use of the modified DC Hebb–Wagner polarization method. It has been identified that an ionic conductivity dominates in tetragonal phase which is associated with room...
-
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 -
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...
-
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...
-
Proposal of edge-area form removal of cylindrical surfaces containing wide dimples by application of various robust processing techniques
Publication -
On proper (1,2)‐dominating sets in graphs
PublicationIn 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
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...
-
Bondage number of grid graphs
PublicationThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
On extremal sizes of locally k-tree graphs
PublicationA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...
-
Some Progress on Total Bondage in Graphs
PublicationThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
On the partition dimension of trees
PublicationGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
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...
-
Dynamic F-free Coloring of Graphs
PublicationA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
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...
-
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...
-
Super Dominating Sets in Graphs
PublicationIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
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...
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublicationIn the paper, we show that the incidence chromatic number of a complete k-partite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
-
3D Hand Shape Modeling for Automatic Assessing Motor Performance in Parkinson's Disease
PublicationIn this paper a method for hand pattern processing to create a 3D hand model is presented. By applying a complete hand armature to the model obtained, an interpolation of three motor tests for an individual Parkinson's disease patient can be performed. To obtain the 3D hand model the top view of the hand from a web cam is analyzed. The hand contour is examined to find characteristic points that allows for dividing hand image into...
-
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...
-
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,...
-
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...
-
Turán numbers for odd wheels
PublicationThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
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.
-
Optimal backbone coloring of split graphs with matching backbones
PublicationFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.
-
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...
-
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...
-
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.
-
Global defensive sets in graphs
PublicationIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
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...
-
Preface of guest editors
PublicationA special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 12th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 16-21 September 2007 in Karpacz, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, 2003 and 2005 in Karpacz. About 70 participants formed the audience of six invited lectures and 68...
-
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.