Filtry
wszystkich: 462
wybranych: 417
Wyniki wyszukiwania dla: SEMI-EQUITABLE COLORING
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublikacjaIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publikacja -
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaWe 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.
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaIn 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.
-
Equitable coloring of hypergraphs
PublikacjaA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Equitable vertex coloring of graphs
PublikacjaW pracy podajemy wartości sprawiedliwej liczby chromatycznej dla niektórych klas grafów. Podajemy również dwa algorytmy heurystyczne dla sprawiedliwego kolorowania grafów z suboptymalna liczba koloru.
-
Equitable coloring of corona multiproducts of graphs
PublikacjaWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
-
Equitable coloring of corona products of graphs
PublikacjaIn 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 complexity of equitable vertex coloring graphs
PublikacjaW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.
-
Equitable 4-coloring of cacti and edge-cacti in polynomial time
PublikacjaRozważ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.
-
Equitable coloring of graphs. Recent theoretical results and new practical algorithms
PublikacjaIn this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
-
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
Publikacja -
Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych
PublikacjaW pracy rozpatrywane są sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych. Pokazano, że w odróżnieniu od tego pierwszego, który jest łatwy, problem istnienia pokolorowań półsprawiedliwych jest NP-zupełny w szerokim zakresie parametrów grafów.
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublikacjaA 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...
-
Equitable colorings of some variation of corona products of cubic graphs
PublikacjaThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
Four-node semi-EAS element in six-field nonlineartheory of shells
PublikacjaW pracy sformułowano 4-węzłowy powłokowy element skończony dla konstrukcji powłokowych. Element opracowano w ramach nieliniowej 6-parametrowej teorii powłok z niesymetrycznymi miarami odkształceń membranowych. Kinematyka powłoki jest opisana przez dwa pola: translacji i obrotów, przy czym wszystkie trzy parametry obrotu traktowane są jako niezależne. W wyniku tego sformułowany element nadaje się do analizy struktur powłokowych...
-
Smartphones as tools for equitable food quality assessment
PublikacjaBackground: The ubiquity of smartphones equipped with an array of sophisticated sensors, ample processing power, network connectivity and a convenient interface makes them a promising tool for non-invasive, portable food quality assessment. Combined with the recent developments in the areas of IoT, deep learning algorithms and cloud computing, they present an opportunity for advancing wide-spread, equitable and sustainable food...
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublikacjaIn 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.
-
Dynamic coloring of graphs
PublikacjaDynamics 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...
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Interval incidence graph coloring
PublikacjaIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Interval incidence coloring of subcubic graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
Interval incidence coloring of bipartite graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
Dynamic F-free Coloring of Graphs
PublikacjaA 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...
-
The Backbone Coloring Problem for Small Graphs
PublikacjaIn this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...
-
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Parallel tabu search for graph coloring problem
PublikacjaTabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...
-
Optimal backbone coloring of split graphs with matching backbones
PublikacjaFor 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.
-
Chromatic cost coloring of weighted bipartite graphs
PublikacjaGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublikacjaAn 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...
-
Minimum order of graphs with given coloring parameters
PublikacjaA 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),...
-
Parallel immune system for graph coloring
PublikacjaThis paper presents a parallel artificial immune system designed forgraph coloring. The algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and amigration mechanism is used to allow processors to exchange information. Experimental results show that migration improves the performance of the algorithm. The experiments were performed using a high performance cluster on a set...
-
Green and equitable analytical chemistry
PublikacjaGreen analytical chemistry introduces the ideas of reduction ofanalytical activities impact on the environment. However, to bemore sustainable, analytical chemistry should include socialaspects in greater manner. In this light‘equitable’analyticalprocedures, which are easily available in terms of price andapplicability by everyday user, are developed. These positivetrends are observed as many procedures, based on commonlyused for...
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublikacjaGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublikacjaIn 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:...
-
Semi-definite programming and quantum information
PublikacjaThis paper presents a comprehensive exploration of semi-definite programming (SDP) techniques within the context of quantum information. It examines the mathematical foundations of convex optimization, duality, and SDP formulations, providing a solid theoretical framework for addressing optimization challenges in quantum systems. By leveraging these tools, researchers and practitioners can characterize classical and quantum correlations,...
-
Relationship between semi- and fully-device-independent protocols
PublikacjaWe study the relation between semi and fully device independent protocols. As a tool, we use the correspondence between Bell inequalities and dimension witnesses. We present a method for converting the former into the latter and vice versa. This relation provides us with interesting results for both scenarios. First, we find new random number generation protocols with higher bit rates for both the semi and fully device independent...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublikacjaIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
TEORIA DECYZYJNYCH PROCESÓW SEMI-MARKOWA I JEJ ZASTOSOWANIE W PROJEKTOWANIU I EKSPLOATACJI OKRĘTOWYCH SILNIKÓW GŁÓWNYCH I INNYCH URZĄDZEŃ SIŁOWNI OKRĘTOWYCH
PublikacjaW referacie zaprezentowano znaczenie teorii procesów semi-Markowa w naukach technicznych, zwłaszcza w teorii niezawodności urządzeń technicznych, teorii bezpieczeństwa ich działania oraz statystycznej teorii podejmowania decyzji eksploatacyjnych. W referacie wyeksponowano także przydatność teorii procesów semi-Markowa w teorii i praktyce eksploatacji wspomnianych urządzeń technicznych na przykładzie tak istotnych urządzeń w transporcie...
-
New polish catalogue of typical flexible and semi-rigid pavements
PublikacjaThe paper covers the following topics important for the development of the new Polish Catalogue of typical flexible and semi-rigid pavements: reasons for preparing the new issue of the Catalogue of typical flexible and semi-rigid pavements, items introduced in the new issue, organise the terminology related to pavements, design traffic calculations and new equivalent axle load factors,...
-
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublikacjaArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...
-
Applications of semi-definite optimization in quantum information protocols
PublikacjaThis work is concerned with the issue of applications of the semi-definite programming (SDP) in the field of quantum information sci- ence. Our results of the analysis of certain quantum information protocols using this optimization technique are presented, and an implementation of a relevant numerical tool is introduced. The key method used is NPA discovered by Navascues et al. [Phys. Rev. Lett. 98, 010401 (2007)]. In chapter...
-
Rank Coloring of Graphs.
PublikacjaRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Harmonions Coloring of Graphs.
PublikacjaProblem kolorowania grafów jest motywowany radionawigacją lotniczą, kompresją obrazów i in. W rozdziale podano podstawowe fakty dotyczące tego modelu kolorowania, a wsród nich dolne i górne oszacowania na liczbę harmoniczną i algorytm o złożoności 0 (mm3) dający bardzo dobre pokolorowania przybliżone.
-
T-coloring of graphs.
PublikacjaNiniejszy rozdział omawia kontrastowe kolorowanie grafów. Podana została jego definicja i podstawowe własności, zastosowania oraz złożoność obliczeniowa problemów rozważanych w ramach tej dziedziny.
-
Classical coloring of graphs.
PublikacjaRozdział obejmuje klasyczne kolorowanie krawędzi i wierzołków w grafach prostych. Oprócz podstawowych definicji podane zostały najczęściej stosowane metody przybliżone oraz ich właściwości. Dodatkowo rozdział zawiera przegląd znanych benczmarków dla podanych metod w kontekście klasycznego modelu kolorowania.
-
Sum Coloring of Graphs.
PublikacjaRozdział jest poświęcony sumacyjnemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Bio-based semi-aromatic polyesters for coating applications
PublikacjaLinear and branched bio-based semi-aromatic (co)polyesters were evaluated as resins for solvent-basedand powder coatings. Dimethyl-2,5-furandicarboxylate (DMF), 2,3-butanediol and various multifunc-tional comonomers were used to synthesize amorphous hydroxyl-end-capped (co)polyesters. The resinswere cross-linked using the -caprolactam blocked trimer of isophorone diisocyanate. Both the solvent-based and powder coatings proved to...
-
Koala graph coloring library: an open graph coloring library for real-world applications
PublikacjaPomimo intensywnej pracy naukowej na polu kolorowania grafów, nie jest znana kompletna i dedykowana biblioteka programistyczna. Celem artykułu jest zaproponowanie architektury takiej biblioteki. Celem jest spełnienie oczekiwań wypływających z rzeczywistych zastosowań, w szczególności spełnienie potrzeb wydajnościowych. Zaimplementowano szereg algorytmów cheurystycznego kolorowania grafów. Przyjętym językiem programowania jest C++....
-
Structural design and sensitivity analysis of semi-rigid pavement of a motorway
PublikacjaThis paper presents application of mechanistic-empirical methods in design of semi-rigid pavement for a section of a motorway in Poland. The stage construction was assumed. Three fatigue criteria were applied in the design. For asphalt fatigue cracking and subgrade soil the criteria from the Asphalt Institute (USA) were applied. For fatigue cracking of cement stabilized bases the Dempsey (USA) and De Beer (South Africa) criteria...
-
Interval Edge-Coloring of Graphs
Publikacja -
A note on mixed tree coloring
PublikacjaZaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].
-
On efficient coloring of chordless graphs
PublikacjaArtykuł omawia zagadnienie optymalnego, wielomianowego rozpoznawania i kolorowania grafów bezcięciwowych. Zawiera dowód tego, że takie grafy są zawsze 4-kolorowalne oraz opis wielomianowego algorytmu, który koloruje je minimalną możliwą liczbą kolorów.
-
On the complexity of distributed greedy coloring
PublikacjaW pracy rozważono problem kolorowania grafów przy dodatkowym założeniu, że kolor żadnego wierzchołka nie może zostać zmniejszony bez zmiany kolorów przynajmniej jednego z jego sąsiadów. Przeprowadzone rozważania dotyczyły złożoności obiczeniowej problemu w modelu Liniala obliczeń rozproszonych. Podano ograniczenia dolne i górne złożoności problemu oraz zestawiono problem z innymi pokrewnymi zagadnieniami grafowymi.
-
Mixed graph edge coloring
PublikacjaW 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.
PublikacjaRozdział 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.
-
Path Coloring and Routing in Graphs.
PublikacjaW rozdziale omówione zostały problemy kolorowania ścieżek i routingu w grafach. Podano podstawowe definicje związane z tymi problemami, znane wyniki wraz z dyskusją złożoności obliczeniowej dla grafów ogólnych i dla kilku podstawowych klas grafów oraz zastosowania.
-
Application of semi-Markov processes for evaluation of diesel engines reliability with regards to diagnostics
PublikacjaThe paper presents semi-Markov models of technical state transitions for diesel engines, useful for determination of their reliability, as a result of the conducted statistical empirical studies. Interpretation of technical states provided for this sort of engines refers to ship main engines, i.e. engines employed in propulsion systems of sea-going ships. The considerations recognize diesel engine as a diagnosed system (SDN), of...
-
Structural Design and Sensitivity Analysis of Semi-Rigid Pavement of a Motorway
PublikacjaThis paper presents application of mechanistic-empirical methods in design of semi-rigid pavement for a section of a motorway in Poland. The stage construction was assumed. Three fatigue criteria were applied in the design. For asphalt fatigue cracking and subgrade soil the criteria from the Asphalt Institute (1981) were applied. For fatigue cracking of cement stabilized bases the Dempsey (1984) and De Beer (1992) criteria were...
-
USEFULNESS OF SEMI-MARKOV PROCESSES AS MODELS OF THE OPERATION PROCESSES FOR MARINE MAIN ENGINES AND OTHER MACHINES OF SHIP POWER PLANTS
PublikacjaThe paper describes the properties of semi-Markov processes and the opportunities and benefits from their use as models of the operation processes for marine combustion engines and other machines of ship power plants. The emphasis is put on the importance of the theory of semi-Markov processes for development of the theory of marine combustion engines and other machines of ship power plants, as well as for development of the operational...
-
Experimentally feasible semi-device-independent certification of four-outcome positive-operator-valued measurements
PublikacjaRecently the quantum information science community devoted a lot of attention to the theoretical and practical aspects of generalized measurements, the formalism of all possible quantum operations leading to acquisition of classical information. On the other hand, due to imperfections present in quantum devices, and limited thrust to them, a trend of formulating quantum information tasks in a semi-device-independent manner emerged....
-
Ocena przydatności stosowania komory semi-bezechowej w przyczepie badawczej SLIPSONIC służącej do pomiarów hałasu opon.
PublikacjaOmówiono sposoby pomiaru odbić dźwięku oraz izolacyjności komory semi-bezechowej zastosowanej w przyczepie SLIPSONIC. Przedstawiono wyniki badań wykazujących jednoznacznie konieczność stosowania komór semi-bezechowych w przyczepach do badania hałasu opon.
-
Edge-coloring of 3-uniform hypergraphs
PublikacjaWe 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.
-
On greedy graph coloring in the distributed model
PublikacjaArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Zaprezentowano nowy probabilistyczny algorytm dający w wyniku pokolorowanie LF. Udowodniono, że jakakolwiek rozproszona implementacja LF wymaga co najmniej D rund, gdzie D jest maksymalnym stopniem wierzchołka w grafie.
-
Application of the theory of semi-markov processes to the development of a reliability model of an automotiv vrhicle = Zastosowanie teorii procesów semi-Markowa do opracowania modelu niezawodnościowego samochodu
PublikacjaW artykule przedstawiono możliwość zastosowania teorii procesów semi-Markowa (semimarkowskich) do opisu niezawodności samochodu, na przykładzie samochodu osobowego. W rozważaniach uwzględniony został samochód, w którym wyróżniono takie węzły konstrukcyjne (zespoły funkcjonalne) jak: silnik z układami zasilania czynnikami energetycznymi (paliwem, olejem smarowym i cieczą chłodzącą), sprzęgło, skrzynia biegów, wał napędowy, most...
-
Increased Certification of Semi-device Independent Random Numbers using Many Inputs and More Postprocessing
PublikacjaQuantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements...
-
Enhancing seismic performance of rigid and semi-rigid connections equipped with SMA bolts incorporating nonlinear soil-structure interaction
PublikacjaNowadays, using smart connections can improve the performance of buildings with some recentering features that are from the superelastic behavior of Shape Memory Alloys (SMAs). It seems that there is different rigidity between the designed connection and the real one in Steel Moment-Resisting Frames (SMRFs), which can be considered as a problematic issue due to the importance of connections in seismic performance assessment. This...
-
Sum Coloring of Bipartite Graphs with Bounded Degree
Publikacja -
A better practical algorithm for distributed graph coloring
Publikacja -
Interval vertex-coloring of a graph with forbidden colors
Publikacja -
Interval Vertex-Coloring of a Graph With Forbidden Colors
Publikacja -
Interval edge coloring of a graph with forbidden colors
Publikacja -
Optimal edge-coloring with edge rate constraints
PublikacjaWe 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....
-
New potential functions for greedy independence and coloring
PublikacjaA 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...
-
Sum coloring of bipartite graphs with bounded degree.
PublikacjaArtykuł poświęcony jest złożoności obliczeniowej zagadnienia sumacyjnego kolorowania grafów dwudzielnych o ograniczonym stopniu. Zawiera dowód tego, że sumacyjne kolorowanie grafów dwudzielnych stopnia mniejszego równego 5 jest NP-zupełne oraz opis wielomianowego algorytmu, który optymalnie sumacyjnie koloruje grafy dwudzielne podkubiczne.
-
Distributed largest-first algorithm for graph coloring.
PublikacjaW artykule zaprezentowano rozproszony, probabilistyczny algorytm kolorowania grafów. Kolorowanie uzyskane jest optymalne lub prawie optymalne dla takich klas grafów jak koła dwudzielne, gąsienice czy korony. Udowodniono, że algorytm ten działa w czasie O(D^2 log n) rund dla dowolnego grafu n wierzchołkowegoo stopniu maksymalnym D.
-
An experimental study of distributed algorithms for graph coloring.
PublikacjaW pracy podano algorytm rozproszonego kolorowania grafówi porównano ze znanym wcześniej algorytmem.
-
Self-stabilizing algorithm for edge-coloring of graphs
PublikacjaReferat 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.
-
Synthesis and characterisation of polyurethane elastomers with semi-products obtained from polyurethane recycling
PublikacjaIn this work polyurethane elastomers were synthesised by using different mixtures of a petrochemical and glycerolysate polyols and 4,4-diphenylmethane diisocyanate (MDI). Glycerolysate polyol was produced from polyurethane foam decomposition using crude glycerine as a decomposition agent. The structure and thermal properties of obtained semi-product were similar to the polyol used in the synthesis of original foam. Glycerolysate...
-
Assesment of operation of ship main diesel engine using the theory of semi-markovian and markov processes.
PublikacjaTo precisely determine the task it is necessary to specify also its duration time, apart from conditions in which it will be realized. When considering propulsion engine, i.e. the main element of ship propulsion system, especially important becomes not only the problem which amount of energy could be at one's disposal but also within which time interval it could be delivered. Therefore apart from applying the commonly used reliability...
-
Testing and sampling devices for monitoring volatile and semi-volatile organic compounds in indoor air
PublikacjaAdults spend most of their time in enclosed spaces (e.g., apartment, office and public buildings). According to research conducted by scientists, air quality indoors is much worse than the ambient air quality outdoors. Hazardous chemicals found in air indoors can adversely affect the functioning of the human body and cause many respiratory and circulatory diseases. Harmful chemical compounds (mainly volatile organic compounds and...
-
Application Isssues of the Semi-Markov Reliability Model
PublikacjaPredicting the reliability of marine internal combustion engines, for instance, is of particular importance, as it makes it possible to predict their future reliability states based on the information on the past states. Correct reliability prediction is a complex process which consists in processing empirical results obtained from operating practice, complemented by analytical considerations. The process of technical state changes...
-
Ecology and Conservation of Steppes and Semi-Natural Grasslands
Publikacja -
Semi-Markov Approach to the Shipping Safety Modelling
Publikacja -
Investigations of transverse stability of semi-displacement ships
PublikacjaPrzedstawiono wyniki eksperymentalnych badań modelowych poprzecznej stateczności jednostek półślizgowych, których celem było określenie wpływu prędkości oraz parametrów kształtu kadłuba na stateczność poprzeczną. Na podstawie wyników badań opracowano algorytmy, uwzględniające zmiany ramienia prostującego w funkcji prędkości, kąta przechyłu i parametrów geometrycznych kadłuba które mogą być wykorzystane do oceny stateczności poprzecznej...
-
A semi-empirical model for flow boiling heat transfer with account of the reduced pressure effect
PublikacjaIn the present study the attention was focused on the influence of reduced pressure on the predictions of heat transfer during flow boiling at the extensive range of pressures. The results of calculations were to test the sensitivity of the in-house flow boiling model with respect to the selection of the appropriate two-phase flow multiplier, which is one of the distinctive elements of that model. For this purpose a few two-phase...
-
COMPARATIVE ANALYSIS OF RESULTS OF APPLICATION OF MARKOV AND SEMI-MARKOV PROCESSES TO RELIABILITY MODELS OF MULTI-STATE TECHNICAL OBJECTS
PublikacjaDuring rational operation of technical objects and systems various operational decisions are made and decision-making process itself should be consisted in selecting that considered most favourable out of all possible to be taken. Choice of such decision is possible after taking into account many different information items but it never be completely correct without accounting for data and indices dealing with reliability. In...
-
The time of the first transition of the semi-Markov process in the evaluation of diesel engine operation
PublikacjaW referacie przedstawiono rozwinięcie prezentowanej w literaturze metody ilościowej oceny działania na przykładzie okrętowego silnika głównego z zapłonem samoczynnym. Według tej interpretacji, działanie silnika może zostać przedstawione jako wielkość fizyczna. W tym aspekcie, na przykładzie okrętowego silnika napędu głównego dokonano oceny przydatności tej wielkości do opisu własności niezawodnościowych silnika. Precyzyjne określenie...
-
Semi-transparent ordered TiO2 nanostructures prepared by anodization of titanium thin films deposited onto the FTO substrate
PublikacjaIn a significant amount of cases, the highly ordered TiO2nanotube arrays grow through anodic oxidationof a titanium metal plate immersed in electrolyte containing fluoride ions. However, for some practicalapplications, e.g. solar cells or electrochromic windows, the semi-transparent TiO2formed directly onthe transparent, conductive substrate is very much desired. This work shows that high-quality Ti coatingcould be formed at room...
-
The complexity of the T-coloring problem for graphs with small degree
Publikacja -
Some results on a trading model in a consensus list coloring
Publikacja -
A linear time algorithm for edge coloring of binomial trees
Publikacja -
Some results on trading model in a consensus list coloring
PublikacjaKonsensusowy model kolorowania grafów - uogólnienie kolorowania listowego, został zdefiniowany przez Mahadeva i Robertsa w 2002 jako użyteczne narzędzie teoretyczne w niektórych zagadnieniach bioinformatycznych. Pozostaje on jednak słabo rozpoznany pod względem własności algorytmicznych. Wykazujemy, że problem kolorowania grafów pełnych w tym modelu jest wielomianowy, co można uogólnić na częściowe k-drzewa przy ustalonym ograniczeniu...
-
Greedy algorithms for backbone graph coloring in KOALA library
Publikacja -
On the complexity of distributed graph coloring with local minimality constraints
PublikacjaArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Omówiono algorytmy rozproszone, dające w wyniku pokolorowanie spełniające warunki dla pokolorowań sekwencyjnych typu S oraz Largest-First (LF). Udowodniono również, że każda rozproszona implementacja algorytmu S wymaga co najmniej Omega(log n / log log n) rund, a algorytmu LF co najmniej Omega (n^{1/2}) rund, gdzie n oznacza liczbę wierzchołków grafu.
-
The complexity of the T-coloring problem for graphs with small degree.
PublikacjaW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
Edge coloring of graphs of signed class 1 and 2
PublikacjaRecently, 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...
-
Morphology and local chain structure of polyamide 6 modified in the solid state with a semi-aromatic nylon salt
PublikacjaStructural and conformational differences between the polyamide 6 (PA6) homopolymer and two copolymers of PA6 modified in the solid state with 20 and 30 wt% of the semi-aromatic nylon salt of 1,5-diamino-2-methylpentane (Dytek A) and isophthalic acid (IPA) in the feed were investigated. Room temperature wide-angle X-ray diffraction (WAXD) analysis together with 13C{1H} cross-polarization/magic-angle spinning solid-state (CP/MAS)...
-
A model of fuel combustion process in the marine reciprocating engine work space taking into account load and wear of crankshaft-piston assembly and the theory of semi-Markov processes
PublikacjaThe ar ticle analyses the operation of reciprocal internal combu stion engines, with mar ine engines u sed a s an example. The analysis takes into account types of energy conversion in the work spaces (cylinders) of these engines, loads of their crankshaft-piston assemblies, and types of fuel combustion which can take place in these spaces during engine operation. It is highlighted that the analysed time-dependent loads of marine...