Filters
total: 1379
filtered: 1022
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: GRAPH COLORING
-
The aluminium and polycarbonate covering of the canopy above the stadium in Gdansk
PublicationW artykule przestawiono informacje o elementach konstrukcyjnych poszycia zadaszenia stadionu piłkarskiego w Gdańsku zrealizowanego z okazji rozgrywanych w Polsce i Ukrainie mistrzostw Europy w piłce nożnej. Omówione zostały elementy poszycia z poliwęglanu wraz z jego konstrukcją nośną oraz układem odwodnienia. Podano informacje o testach i badaniach przeprowadzonych przed wykonaniem obiektu, które zadecydowały o przyjętych rozwiązaniach...
-
Modeling of the internal combustion engine cooling system
PublicationThe article concerns computer modelling of processes in cooling systems of internal combustion engines. Modelling objectives and existing commercial programs are presented. It also describes Author’s own method of binding graphs used to describe phenomena in the cooling system of a spark ignition engine. The own model has been verified by tests on the engine dynamometer. An example of using a commercial program for experimental...
-
Structural optimization of microjet array cooling system
PublicationThe single phase heat transfer from an upward facing, horizontal copper surface to arrays of impinging water jets was experimentally investigated. Experimental configuration allows for a free-surface unconfined jets flow. Square nozzles 50 × 100 μm arranged in four different geometries were used. Additionally, for the set of two jets array geometry was varied by adjusting the nozzle to nozzle distance. The area averaged heat transfer...
-
New generation cooling systems for car engines
PublicationNormy czystości spalin silników samochodowych wymusiły rozwój elektronicznego sterowania pracą silników samochodowych. Do niedawna układy chłodzenia były bardzo tradycyjnymi - niesterowanymi programowo. W artykule przedstawiono możliwości wprowadzenia zaawansowanego sterowania mikroprocesorowego do układów chłodzenia silników spalinowych. Rozważania zilustrowano badaniami z literatury i własnymi pomiarami autora.
-
Development trends of automotive engine cooling systems
PublicationDzięki daleko idącym modyfikacjom układów zasilania i zapłonu silników samochodowych oraz udoskonaleniom układów oczyszczania spalin uzyskano znaczne zmniejszenie emisji związków toksycznych. Układy chłodzenia z pompą cieczy napędzaną mechanicznie stają się archaiczne nie pozwalając na swobodne sterowanie obiegiem cieczy. Również różna wartość temperatury potrzebnej do schładzania różnych procesów wymaga sterowanych zaworów trójdrożnych...
-
Performance of a hybrid microjet – microchannel cooling module
PublicationThe paper presents the experimental investigation of a microjet- microchannel cooling module. In which microjets of water are impinging into the microchannels and forming a liquid film on the impingement surface. Applied technology takes benefits from two very attractive heat removal techniques. When lminar jets are impinging on the surface have a very high kinetic energy at the stagnation point, also in microchannels boundary...
-
Cooling of electronic equipment by means of jets and microjets
PublicationW pracy przedstawiono rozwiązanie sprzężonej wymiany ciepła od uderzającej strugi cieczy oraz przewodzenia ciepła w łytce. Uzyskano proste zależności opisujące rozkład temperatur na płytce. Umożliwia to przeprowadzenie analizy wpływu różnych parametró na wymianę ciepła podczas chłodzenia urządzeń elektronicznych generujących ciepło.
-
Some aspects surface cooling by impinging jet
PublicationW pracy przedstawiono wyniki badań wymiany ciepła, uskoku hydraulicznego i stabilności podczas napływu strugi na powierzchnię ciała stałego.
-
Advanced Macromodel Matrix Structure Cloning for FDTD
PublicationWe propose an improved macromodel-based techniquefor efficient analysis of the structures based on PhotonicCrystals (PhC). The technique involves a new structure of thecoupling matrix and advanced cloning of not only the macromodel matrices, but also the coupling matrices SE and SH.The method allows one to shorten considerably the preprocessingtime, the RAM usage and also the iterating speed of performingFDTD. With this...
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublicationThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Application of Graph Theory Algorithms in Non-disjoint Functional Decomposition of Specific Boolean Functions
Publication -
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublicationA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(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 domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
PublicationA team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...
-
Graphs with equal domination and certified domination numbers
PublicationA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
SELECTED ASPECTS OF THE EVALUATION OF THE QUALITY OF GRAPE WINE
PublicationDevelopment of the domestic grape wine market has been presented. The number of grape wine producing entities, acreage, and volume of production over last five years are presented. The composition of red grape wine has been discussed involving health promoting aspects. Two methods of wine quality determination: analytical and sensory meth ods have been described. Physicochemical parameters influencing wine quali ty (acidity, sweetness)...
-
Synchronous black hole search in directed graphs
PublicationThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
Domination-Related Parameters in Rooted Product Graphs
PublicationAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.
-
Towards Increasing Density of Relations in Category Graphs
PublicationIn the chapter we propose methods for identifying new associations between Wikipedia categories. The first method is based on Bag-of-Words (BOW) representation of Wikipedia articles. Using similarity of the articles belonging to different categories allows to calculate the information about categories similarity. The second method is based on average scores given to categories while categorizing documents by our dedicated score-based...
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
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...
-
Total Domination Versus Domination in Cubic Graphs
PublicationA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Strong weakly connected domination subdivisible graphs
PublicationArtykuł dotyczy wpływu podziału krawędzi na liczbę dominowania słabo spójnego. Charakteryzujemy grafy dla których podział dowolnej krawędzi zmienia liczbę dominowania słabo spójnego oraz grafy dla których podział dowolnych dwóch krawędzi powoduje zmianę liczby dominowania słabo spójnego.
-
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...
-
On bipartization of cubic graphs by removal of an independent set
PublicationWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
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...
-
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
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.
-
Progress on Roman and Weakly Connected Roman Graphs
PublicationA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
Graphs hard-to-process for greedy algorithm MIN
PublicationWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
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.
-
Cholesky factorization of matrices in parallel and ranking of graphs.
PublicationUporządkowane kolorowanie znajduje zastosowanie przy równoległej faktoryzacji macierzy metodą Cholesky'ego. Praca zawiera opis tego zastosowania. Podano także algorytmy optymalnego uporządkowanego kolorowania krawędzi pewnych klas grafów: grafów pełnych dwudzielnych oraz powstałych z pełnych dwudzielnych przez usunięcie O(log n) krawędzi.
-
Graphs with convex domination number close to their order
PublicationW pracy opisane są grafy z liczbą dominowania wypukłego bliską ilości ich wierzchołków.
-
The selected roof covering technologies in the aspect of their life cycle costs
PublicationIn the article is presented an analysis of the life cycle costs calculation for selected roof coverings. The scope of research includes costs of construction, maintenance and demolition of the roof covering structure for two alternative technologies – the traditional and new generation. On the presented example of an industrial building with a roof area of 1000 m², the above costs are taken to consideration for the roof covering...
-
DESIGN AND EXECUTION ERRORS AS A CAUSE OF DAMAGE TO ANTI- ELECTROSTATIC FLOORING
PublicationApart from technological lines, industrial floors are a key element in the scope of maintaining the continuity of work of both production plants and logistics centers. The constantly developing industry of industrial flooring includes both classic design and technological flooring solutions, as well as specialist solutions used in facilities where technological processes or storage require system protection against static electricity....
-
CAUSALITY IN MODELS OF THERMAL PROCESSES IN SHIP ENGINE ROOMS WITH THE USE OF BOND GRAPH (BG) METHOD
PublicationWith a single approach to modeling elements of different physical nature, the method of Bond Graph (BG) is particularly well suited for modeling energy systems consisting of mechanical, thermal, electrical and hydraulic elements that operate in the power system engine room. The paper refers to the earlier presented new concept of thermal process modeling using the BG method. The authors own suggestions for determining causality...
-
Effects of cooking on the bioactivity of lotus roots and white onions
PublicationW pracy przedstawiono wyniki badań wpływu obróbki termicznej (gotowanie) na zawartość związków bioaktywnych i potencjału przeciwutleniającego korzenia lotosu i cebuli białej.Wyniki badań jednoznacznie wskazują na fakt, że taki proces obróbki wpływa w znaczącym stopniu na spadek stężenia związków bioaktywnych i potencjału przeciwutleniającego.
-
An advanced Thermal-FSI approach to flow heating/cooling
PublicationActually, two-way thermal-energy exchange between working fluid and solid material of a casing is a leading problem for modern – semi automatic – design techniques. Many questions should be solved, especially, the turbulent mode of thermal energy transport both in fluid and solid, should be re-examined and reformulated from the primary principles. In the present paper, a group of researchers from Energy Conversion Department of...
-
A System for Cooling Electronic Elements with EHD Coolant Flow
PublicationA system for cooling electronic components where the liquid coolant flow is forced with ion-drag type EHD micropumps was tested.
-
Experimental and theoretical investigation of microjet cooling in metalurgical applications
PublicationW pracy zaprezentowano model wrzącej strugi uderzającej o powierzchnię i wytwarzającej cienki film cieczowy, w którym tworzą się pęcherzyki pary.
-
The automation of test stand for engine cooling system testing
PublicationW rozdziale przedstawiono budowę stanowiska do badań układu chłodzenia silnika samochodowego typu M111920. Układ był wyposażony w obwód podgrzewania paliwa gazowego i układ akumulacji ciepła. Stanowisko wyposażono w liczne termopary do pomiaru temperatur płynów i części metalowych silnika. Ważnym opracowanym zagadnieniem było rejestrowanie wielu pomiarów w czasie rzeczywistym, do czego użyto sieci transmisji danych CAN.
-
Active management of equipment cooling in hoteling data centers
PublicationHoteling data centers are designated for housing computing and storage units of many, usually small customers, as opposed to traditional data centers supporting own computing and storage resources of a bigger company. One of the services to be provided to consumer’s equipment is cooling. Cooling in data centers is prevalently achieved by circulating air in computer room. Efficient cooling requires delivering cold air from central...
-
The saga of a fish: from a survival guide to closing lemmas
PublicationIn the paper by D. Burago, S. Ivanov and A. Novikov, “A survival guide for feeble fish”, it has been shown that a fish with limited velocity can reach any point in the (possibly unbounded) ocean provided that the fluid velocity field is incompressible, bounded and has vanishing mean drift. This result extends some known global controllability theorems though being substantially nonconstructive. We give a fish a different recipe...
-
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...
-
Edge-chromatic sum of trees and bounded cyclicity graphs
Publication -
Graphs with equal domination and 2-distance domination numbers
PublicationW publikacji scharakteryzowane są wszystkie te drzewa i grafy jednocykliczne, w których liczba dominowania oraz liczba 2-dominowania na odległość są sobie równe.
-
An approximation algorithm for maximum P3-packing in subcubic graphs
PublicationW pracy podano algorytm 4/3-przyliżony dla trudnego obliczeniowo problemu umieszczania wierzchołkowo rozłącznych dwukrawędziowych ścieżek w grafach o stopniu maksymalnym 3 i stopniu minimalnym 2. Poprawiono tym samym wcześniejsze wyniki dla grafów kubicznych (A. Kelmans, D. Mubayi, Journal of Graph Theory 45, 2004).
-
Easy and hard instances of arc ranking in directed graphs
PublicationArtykuł dotyczy uporządkowanego kolorowania łuków grafów skierowanych. Problem polega na takim przyporządkowaniu liczb łukom digrafu, aby każda skierowana ścieżka łącząca dwa łuki o tej samej liczbie (kolorze) zawierała łuk o kolorze wyższym. Praca podaje liniowy optymalny algorytm dla pewnego szczególnego przypadku, oraz zawiera dowód, iż problem ten jest obliczeniowo trudny dla 3-dzielnych acyklicznych digrafów i stałej liczby...
-
Early detection of imminent threats in social relation graphs
PublicationWczesne wykrywanie zagrożeń i anomalii w sieciach społecznych jest dziś prawdziwym wyzwaniem. Ludzie w realnym świecie tworzą wiele złożonych relacji społecznych, które mogą być przedstawione za pomocą grafów, w których węzły reprezentują aktorów (pojedyncze osoby lub organizacje) a krawędzie wskazują na powiązania pomiędzy nimi. Analiza nieustannie zmieniających się relacji pomiędzy aktorami może wskazać konkretne nadciągające...