Filters
total: 1336
filtered: 1031
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: SUBCUBIC GRAPHS
-
Polyvalent Mechanical Bacterial Lysate Administration Improves the Clinical Course of Grass Pollen–Induced Allergic Rhinitis in Children: A Randomized Controlled Trial
Publication -
Preliminary study on the influence of UV-C irradiation on microorganism viability and polyphenol compounds content during winemaking of ‘Regent’ red grape cultivar
Publication -
Role of nitrogen in optical and electrical band gaps of hydrogenated/hydrogen free carbon nitride film
PublicationWe report the optical and electrical band gap energy of amorphous hydrogenated carbon nitride (a-HCNx) and carbon nitride (a-CNx) as a function of nitrogen concentration (N/C). The optical band gap of a-HCNx and a-CNx films has been determined by means of Ellipsometry and UV-VIS. Both optical and electrical band gaps increase with elevated nitrogen concentration. Experimentally obtained electrical band gap is compared with the...
-
Perspective Chapter: Reducing the Social Inequality Gaps in Older Ages in Low- and Middle-Income Countries
Publication -
Collaborative planning? Not yet seen in Poland. Identifying procedural gaps in the planning system 2003–2023
PublicationCollaborative planning aims to increase the legitimacy of decision-making in spatial development. In this approach, planning involves debate and engagement in discourse, and participation and interaction between actors are thus at the heart of the planning process. This article examines whether the planning system in Poland as defined for the period 2003–2025 provides a level of participation and deliberation and other qualities...
-
The trophic state of the Vistula Lagoon: an assessment based on selected biotic and abiotic parameters according to the Water Framework Directive**This work was supported by the Norway grants PNRF 82 A I.
Publication -
Caveolin 2: a facultative marker of unfavourable prognosis in long-term patency rate of internal thoracic artery grafts used in coronary artery bypass grafting. Preliminary report
Publication -
Non-volatile molecular composition and discrimination of single grape white of chardonnay, riesling, sauvignon blanc and silvaner using untargeted GC–MS analysis
PublicationThis study developed and applied a GC–MS method aiming at molecular fingerprinting of 120 commercial single grape white wines (Chardonnay, Riesling, Sauvignon Blanc and Silvaner) for possible authentication according to grape variety. The method allowed detection of 372 peaks and tentative identification of 146 metabolites including alcohols, organic acids, esters, amino acids and sugars. The grape variety effect explained 8.3%...
-
A policy view: gaps and weaknesses of substitution between biological products in law and economics dimension: the example of insulin
Publication -
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublicationA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
High performance filtering for big datasets from Airborne Laser Scanning with CUDA technology
PublicationThere are many studies on the problems of processing big datasets provided by Airborne Laser Scanning (ALS). The processing of point clouds is often executed in stages or on the fragments of the measurement set. Therefore, solutions that enable the processing of the entire cloud at the same time in a simple, fast, efficient way are the subject of many researches. In this paper, authors propose to use General-Purpose computation...
-
Clearing directed subgraphs by mobile agents
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
-
Communication and Load Balancing Optimization for Finite Element Electromagnetic Simulations Using Multi-GPU Workstation
PublicationThis paper considers a method for accelerating finite-element simulations of electromagnetic problems on a workstation using graphics processing units (GPUs). The focus is on finite-element formulations using higher order elements and tetrahedral meshes that lead to sparse matrices too large to be dealt with on a typical workstation using direct methods. We discuss the problem of rapid matrix generation and assembly, as well as...
-
Studenckie Staże Zawodowe - Analiza Procesu Kwalifikacji w Kontekście Dopasowania Człowiek - Organizacja
PublicationProces kwalifikacji studentów na staże zawodowe ma charakter intuicyjny, główną rolę odgrywają w nich studenci oraz pracodawcy - oferenci staży. Skuteczność procesu można pokazać poprzez analizę sytuacji krytycznych. Artykuł omawia sytuacje, jakie pojawiły się w dwóch edycjach kwalifikowania na staże zawodowe. Do analizy procesu zastosowano dwie koncepcje teoretyczne: model ASA oraz dopasowanie organizacyjne, stosowane w doborze...
-
Properties of the triset metric for phylogenetic trees
Publicationthe following paper presents a new polynomial time metric for unrootedphylogenetic trees (based on weighted bipartite graphs and the method ofdetermining a minimum perfect matching) and its properties. also many its properties are presented.
-
On trees with double domination number equal to total domination number plus one
PublicationA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Auto/bio/géo/graphies : les enjeux spatiaux de la mémoire dans les récits autobiographiques et testimoniaux du temps de la guerre chez Durocher, Langfus, Rawicz
Publication -
Collision-Free Network Exploration
PublicationA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
Polynomial triset metric for unrooted phylogenetic trees
Publicationthe following paper presents a polynomial triset metric for unrooted phylogenetic trees (based on weighted bipartite graphs and the method of determining a minimum edge cover) and its basic characteristics. also a list of further directions of research and examples of the wider use of this metric is presented.
-
The Complexity of Zero-Visibility Cops and Robber
PublicationIn this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.
-
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...
-
Brushing with additional cleaning restrictions
PublicationIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
Leader election for anonymous asynchronous agents in arbitrary networks
PublicationWe consider the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents is by exploiting asymmetries in their initial positions in the graph. Agents do not know the graph or their positions in it, hence they must gain this knowledge by navigating in the graph...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
Computational algorithm for the analysis of mechatronic systems with distributed parameter elements
PublicationThe paper presents a systematic computational package for analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The algorithm is based on the transfer function method (DTFM). With this algorithm, a bond graph technique for the modelling is developed to simplify computations. Analysis of different systems requires only changing the inputs data in the form of the bond graph diagram
-
Modelling of Mechatronic Systems with Distributed Parameter Components
PublicationThe paper presents an uniform, port-based approach to modelling of both lumped and distributed parameter systems. Port-based model of distributed system has been defined by application of the bond graph methodology and the distributed transfer function method (DTFM). The proposed method of modelling enables to formulate input data for computer analysis by application of the DTFM. The computational package for the analysis of complex...
-
An upper bound for the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
CRVG - a new model for wireless networks topology generation
PublicationThis paper presents a new model of wireless network topology generator. Its main advantage is the possibility of relatively sparse networks generation. Because no iteration is needed, the model can be used for massive generation of networks for testing. The topological properties of produced graphs place them in the class of scale free networks, resembling real ones.
-
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.
-
Detection, identification and determination of resveratrol in wine. Problems and challenges
PublicationResveratrol is a compound synthesized by plants in response to unfavorable conditions of growth like mechanical injury, siege of bacteria or fungi and UV exposure. It is concentrated mostly in grapes skin and further more in the products made from grapes especially red wines. Each wine is characterized by different amount of given stilbene since its occurrence is affected by many factors like: types of grapes, environment (climate,...
-
Total chromatic sum for trees
PublicationThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
A lower bound on the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
PublicationWe study two variants of delivery problems for mobile robots sharing energy. Each mobile robot can store at any given moment at most two units of energy, and whenever two robots are at the same location, they can transfer energy between each other, respecting the maximum capacity. The robots operate in a simple graph and initially each robot has two units of energy. A single edge traversal by an robot reduces its energy by one...
-
The complexity of zero-visibility cops and robber
PublicationWe consider the zero-visibility cops & robber game restricted to trees. We produce a characterisation of trees of copnumber k and We consider the computational complexity of the zero-visibility Cops and Robber game. We present a heavily modified version of an already-existing algorithm that computes the zero-visibility copnumber of a tree in linear time and we show that the corresponding decision problem is NP-complete on a nontrivial...
-
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...
-
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...
-
On the connected and weakly convex domination numbers
PublicationIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
On the Hat Problem on the Cycle C7
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. In this version every player can...
-
Independence in uniform linear triangle-free hypergraphs
PublicationThe independence number a(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show a new lower bound for a(H) for an r-uniform linear triangle-free hypergraph H with r>=2.
-
Evaluation of the geranyl esters-containing pheromone traps used for monitoring Elateridae family beetles in crops Ocena pułapek feromonowych zawierających estry geranylu stosowanych do monitorowania chrząszczy z rodziny Elateridae w uprawach
Publication -
A lower bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
Numerical modelling of POC dynamics in the southern Baltic under possible future conditions determined by nutrients, light and temperature**The study was financially supported by the Polish Ministry of Science and Higher Education (grants: NN305 111636 and NN306 404338) and Baltic-C – the BONUS funded project.
Publication -
Arch bridges under test loadings
PublicationThis paper illustrates experience in arch bridges test loadings of the research team of Department of Structural Mechanics and Bridge Structures from the Gdansk University of Technology. The presented calculations results constist the analysis of spatial construction schemes made using the finite elements method (FEM) and its comparison to the field studies. Arch bridges with the longest spans, visualisation of the computational...
-
Factory Acceptance Test – Strain Gauge Measurement, Report no: WOiO /II/123/2014
PublicationTested object was 40 meters long jib and its foundation, placed in Gdansk Shiprepair Yard, manufactured by KMK. The contruction was dedicated to the passenger cruise vessel "Quantum of the Seas" The Strain Gauge measurement in different location and load situation was done in order to validate calculation finite element models used during strength analysis for project. The expertise contains: methodology of the measurements, description...
-
Factory Acceptance Test – Strain Gauge Measurement - Report no: WOiO /II/88/2014
PublicationTested object was 40 meters long jib and its foundation, placed in Gdansk Shiprepair Yard, manufactured by KMK. The contruction was dedicated to the passenger cruise vessel "North Star" The Strain Gauge measurement in different location and load situation was done in order to validate calculation finite element models used during strength analysis for project. The expertise contains: methodology of the measurements, description...
-
Finding small-width connected path decompositions in polynomial time
PublicationA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
An upper bound on the 2-outer-independent domination number of a tree
PublicationA 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
On trees with double domination number equal to 2-domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...