Filters
total: 1322
-
Catalog
displaying 1000 best results Help
Search results for: MYCIELSKI GRAPHS
-
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.
-
Nonrelational Databases DE 2022_2023
e-Learning CoursesWithin this course the four types of non-relational databases (i.e. document, graph, key-value and column-oriented) are discussed. The course is aimed at students of the 5th semester of data engineering.
-
Krzysztof Kutt dr inż.
PeopleComputer scientist and psychologist trying to combine expertise from both disciplines into something cool. My research activity focuses on the development of affective HCI/BCI interfaces (based on multimodal fusion of signals and contextual data), methods for processing sensory data (including semantization of such data) and the development of knowledge-based systems (in particular knowledge graphs and semantic web systems).
-
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...
-
Continuation classes for a population model with harvesting. Case He-S1: Equal harvesting of juveniles and adults, survival rates of juveniles and adults add up to 1
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Continuation classes for a population model with harvesting. Case Ha-S1: Harvesting adults only, survival rates of juveniles and adults add up to 1
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Continuation classes for a population model with harvesting. Case He-Se: Equal harvesting and equal survival rates of juveniles and adults
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Continuation classes for a population model with harvesting. Case Hj-S1: Harvesting juveniles only, survival rates of juveniles and adults add up to 1
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Continuation classes for a population model with harvesting. Case Hj-Se: Harvesting juveniles only, equal survival rates of juveniles and adults
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Continuation classes for a population model with harvesting. Case Ha-Se: Harvesting adults only, equal survival rates of juveniles and adults
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Sylwester Kaczmarek dr hab. inż.
PeopleSylwester Kaczmarek received his M.Sc in electronics engineering, Ph.D. and D.Sc. in switching and teletraffic science from the Gdansk University of Technology, Gdansk, Poland, in 1972, 1981 and 1994, respectively. His research interests include: IP QoS and GMPLS and SDN networks, switching, QoS routing, teletraffic, multimedia services and quality of services. Currently, his research is focused on developing and applicability...
-
Eurographics Symposium on Parallel Graphics and Visualization
Conferences -
ACM-SIGRAPH Interactive 3D Graphics
Conferences -
International Conference on Computer Vision and Graphics
Conferences -
Pacific Conference on Computer Graphics and Applications
Conferences -
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...
-
Andrzej Klimczuk
PeopleAndrzej Klimczuk, PhD, a sociologist and public policy expert, assistant professor in the Department of Social Policy of the Collegium of Socio-Economics at the SGH Warsaw School of Economics, Poland. Editor and correspondent of publications about computer and video games in the years 2002-2009. In 2011-2013, Vice President of the Foundation's Laboratory Research and Social Action "SocLab." External expert of institutions such...
-
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...
-
Engineering Graphics I, PG_00055216
e-Learning Courses -
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 -
Study of the influence of the presence of Dr fimbriae on the sedimentation of recombinant Escherichia coli strains: AAEC191A and BL21(DE3)
Open Research DataCell sedimentation in the medium is a common phenomenon in most bacterial enviroments. This study specifically investigated the impact of Dr fimbriae presence on cell deposition. To explore this, recombinant Escherichia coli strains were employed, including BL21(DE3)/pCC90, BL21(DE3)/pACYCpBAD, BL21(DE3)/pCC90 Dra D-mut, BL21(DE3)/pCC90 D54-STOP, AAEC191A/pCC90,...
-
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 -
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...
-
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...
-
Tight bounds on global edge and complete alliances in trees
PublicationIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
Software tool for modelling of mechatronic systems with elastic continua
PublicationThe paper presents a systematic computational package for modelling and analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The constructed computer program enables the frequency domain analysis of a class of linear systems and to obtain reduced order model in the form of bond graph. Obtained modal bond graph can be directly exported into 20-Sim package to further processing including nonlinear...
-
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,...
-
Weighted 2-sections and hypergraph reconstruction
PublicationIn the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: (1) Given a weighted graph , is there a hypergraph H such that is its weighted 2-section? (2) Given a weighted 2-section , find a hypergraph H such that is its weighted 2-section. We show that (1) is NP-hard even if G is a complete graph or integer weights w does not exceed...
-
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...
-
Joanna Rymaszewska prof. dr hab. n. med.
PeopleCV Joanna Rymaszewska Wroclaw University of Science and Technology, Wroclaw, Poland +48 601 98 26 24, joanna.rymaszewska@pwr.edu.pl orcid.org/0000-0001-8985-3592 2023 → Professor of Wroclaw University of Science and Technology (WUST), Poland 2011 → 2023 Professor of Wroclaw Medical University (WMU), PL 2016 → 2022 Head of the Department of Psychiatry, Wroclaw Medical University 2016 → 2022 Head of the Clinic of Psychiatry,...
-
A Note on Shannon Capacity for Invariant and Evolving Channels
PublicationIn the paper we discuss the notion of Shannon capacity for invariant and evolving channels. We show how this notion is involved in information theory, graph theory and Ramsey theory.
-
An upper bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G=(V(G),E(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 tree T of order n >= 4, with l leaves and s support vertices we have...
-
Michał Ryms dr inż.
PeopleMichał Ryms, PhD, Eng. is the physicist, graduate of the Gdańsk University of Technology. PhD thesis defended at the Chemical Faculty. Since 2011 an employee at the Department of Chemical Apparatus and Theory of Machines, Chemical Faculty, Gdansk University of Technology, POLAND – now as an assistant professor. His research interests includes: improvement of energy efficiency and possibilities of new application of phase change...
-
International Conference Computer Graphics, Imaging and Visualization
Conferences -
Soft Computing in Computer Graphics, Imaging, and Vision
Conferences -
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...
-
3D Computer Model of the Hip Joint Cartilage
PublicationThis paper presents 3D computer model of the hip joint cartilage in the ANSYS program. Model is made on the basis of anatomy and collected data on the material constants of bone and cartilage components. Analysis and comparison of biochemical model, viscoelastic and molecular mixed - aggregation serves to facilitate the creation of the next model of reality, which could be used in the design of joint prostheses. The correctness...
-
Towards Effective Processing of Large Text Collections
PublicationIn the article we describe the approach to parallelimplementation of elementary operations for textual data categorization.In the experiments we evaluate parallel computations ofsimilarity matrices and k-means algorithm. The test datasets havebeen prepared as graphs created from Wikipedia articles relatedwith links. When we create the clustering data packages, wecompute pairs of eigenvectors and eigenvalues for visualizationsof...
-
Detecting type of hearing loss with different AI classification methods: a performance review
PublicationHearing is one of the most crucial senses for all humans. It allows people to hear and connect with the environment, the people they can meet and the knowledge they need to live their lives to the fullest. Hearing loss can have a detrimental impact on a person's quality of life in a variety of ways, ranging from fewer educational and job opportunities due to impaired communication to social withdrawal in severe situations. Early...
-
Engineering Graphics I, W/P, MiBM, sem 01, zimowy 2021/2022 (PG_00055216)
e-Learning CoursesKurs dla zajęć z Grafiki Inżynierskiej I dla MiBM spec. DaPE --- Course for the Enginnering Graphics I for DaPE
-
Brief Announcement: Energy Constrained Depth First Search
PublicationDepth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...