Filtry
wszystkich: 1369
-
Katalog
- Publikacje 1064 wyników po odfiltrowaniu
- Czasopisma 39 wyników po odfiltrowaniu
- Konferencje 35 wyników po odfiltrowaniu
- Osoby 46 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Projekty 7 wyników po odfiltrowaniu
- Kursy Online 23 wyników po odfiltrowaniu
- Wydarzenia 4 wyników po odfiltrowaniu
- Dane Badawcze 150 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: BIPARTITE GRAPHS
-
Simple sufficient condition for subspace to be completely or genuinely entangled
PublikacjaWe introduce a simple sufficient criterion, which allows one to tell whether a subspace of a bipartite or multipartite Hilbert space is entangled. The main ingredient of our criterion is a bound on the minimal entanglement of a subspace in terms of entanglement of vectors spanning that subspace expressed for geometrical measures of entanglement. The criterion is applicable to both completely and genuinely entangled subspaces. We...
-
Engineering Graphics II, PG_00040167
Kursy OnlineEngineering Graphics
-
Jacek Ryl dr hab. inż.
OsobyStopień doktora nauk technicznych uzyskał w roku 2010. W tym samym roku podjął pracę w Katedrze Elektrochemii, Korozji i Inżynierii Materiałowej na Wydziale Chemicznym. W 2018 roku uzyskał stopień doktora habilitowanego nauk technicznych w dyscyplinie technologia chemiczna. Od 2021 roku zatrudniony w Instytucie Nanotechnologii i Inżynierii Materiałowej Wydziału Fizyki Technicznej i Matematyki Stosowanej PG. W pracy naukowej skupia...
-
Thermodynamical approach to quantifying quantum correlations
PublikacjaWe consider the amount of work which can be extracted from a heat bath using a bipartite state ρ shared by two parties. In general it is less then the amount of work extractable when one party is in possession of the entire state. We derive bounds for this “work deficit” and calculate it explicitly for a number of different cases. In particuar, for pure states the work deficit is exactly equal to the distillable entanglement of...
-
On trees with double domination number equal to total domination number plus one
PublikacjaA 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
Publikacja -
Collision-Free Network Exploration
PublikacjaA 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...
-
Bożena Kotarska-Lewandowska dr inż.
Osoby -
South African International Graph Theory Conference
Konferencje -
Krzysztof Nyka dr hab. inż.
OsobyKrzysztof Nyka, absolwent Wydziału Elektroniki Telekomunikacji i Informatyki Politechniki Gdańskiej (WETI PG), gdzie uzyskał tytuł magistra inżyniera (1986, telekomunikacja) stopień doktora nauk technicznych (2002, elektronika) i doktora habilitowanego (2020 automatyka, elektronika i elektrotechnika). Obecnie jest zatrudniony na stanowisku profesora uczelni w Katedrze Inżynierii Mikrofalowej i Antenowej WETI PG. Zainteresowania...
-
The Complexity of Zero-Visibility Cops and Robber
PublikacjaIn 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
PublikacjaWe 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
PublikacjaWe 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
PublikacjaIn 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...
-
Michał Czubenko dr inż.
OsobyMichał Czubenko jest wyróżniającym się absolwentem z 2009 roku Wydziału Elektroniki, Telekomunikacji i Informatyki Politechniki Gdańskiej, specjalizującym się w dyscyplinie automatyka i robotyka. Obecnie pełni funkcję adiunkta w Katedrze Systemów Decyzyjnych i Robotyki tej samej uczelni. W 2012 roku odbył trzymiesięczny staż na Kingston University London, poszerzając swoje horyzonty w tej dziedzinie. Od obrony pracy magisterskiej...
-
International Conference on Image and Graphics
Konferencje -
Applied Perception in Graphics and Visualization
Konferencje -
Spring Conference on Computer Graphics
Konferencje -
TG and DTG profiles for plastics: LDPE, HDPE, PP, PD and PET
Dane BadawczeThe dataset includes:
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublikacjaA 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
PublikacjaWe 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...
-
Towards the boundary between easy and hard control problems in multicast Clos networks
PublikacjaIn this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. We identify some polynomially...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 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...
-
Nonrelational Databases DE 2024_2025
Kursy OnlineThis course discusses three types of non-relational databases (i.e., document, graph, and key-value). The course is aimed at students in the 5th semester of data engineering.
-
Nonrelational Databases DE 2023_2024
Kursy OnlineThis course discusses three types of non-relational databases (i.e., document, graph, and key-value). The course is aimed at students in the 5th semester of data engineering.
-
Computational algorithm for the analysis of mechatronic systems with distributed parameter elements
PublikacjaThe 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
PublikacjaThe 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
PublikacjaA 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
PublikacjaThis 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.
-
Engineering Graphics II, W/P, Design and Production engineering, sem. letni 2021/2022, (PG_00040167)
Kursy OnlineCourse for Engineering Graphics II classes of Design and Production engineering students
-
Southeastern International Conference on Combinatorics, Graph Theory, and Computing
Konferencje -
Kyoto International Conference on Computational Geometry and Graph Theory
Konferencje -
International Workshop on Graph-Theoretic Concepts in Computer Science
Konferencje -
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.
-
Detection, identification and determination of resveratrol in wine. Problems and challenges
PublikacjaResveratrol 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,...
-
Non-relational Databases 2022/2023
Kursy OnlineThis course discusses the three types of non-relational databases (i.e. document, graph, key-value). The course is aimed at students in the 7th semester of computer science.
-
Non-relational Databases 2023/2024
Kursy OnlineThis course discusses the three types of non-relational databases (i.e. document, graph, key-value). The course is aimed at students in the 7th semester of computer science.
-
Non-relational Databases 2024/2025
Kursy OnlineThis course discusses the three types of non-relational databases (i.e. document, graph, key-value). The course is aimed at students in the 7th semester of computer science.
-
Total chromatic sum for trees
PublikacjaThe 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.
-
Krzysztof Kutt dr inż.
OsobyComputer 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).
-
Nonrelational Databases DE 2022_2023
Kursy OnlineWithin 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.
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA 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...
-
Sylwester Kaczmarek dr hab. inż.
OsobySylwester Kaczmarek ukończył studia w 1972 roku jako mgr inż. Elektroniki, a doktorat i habilitację uzyskał z technik komutacyjnych i inżynierii ruchu telekomunikacyjnego w 1981 i 1994 roku na Politechnice Gdańskiej. Jego zainteresowania badawcze ukierunkowane są na: sieci IP QoS, sieci GMPLS, sieci SDN, komutację, ruting QoS, inżynierię ruchu telekomunikacyjnego, usługi multimedialne i jakość usług. Aktualnie jego badania skupiają...
-
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
Dane BadawczeThis 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
Dane BadawczeThis 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
Dane BadawczeThis 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
Dane BadawczeThis 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
Dane BadawczeThis 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
Dane BadawczeThis 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.
-
Andrzej Klimczuk
OsobyAndrzej Klimczuk, doktor nauk społecznych w zakresie nauki o polityce publicznej oraz socjolog. Adiunkt w Katedrze Polityki Społecznej Kolegium Ekonomiczno-Społecznego Szkoły Głównej Handlowej w Warszawie. W latach 2002-2009 redaktor i korespondent wydawnictw o grach komputerowych. W latach 2011-2013 wiceprezes Fundacji Laboratorium Badań i Działań Społecznych "SocLab". Ekspert zewnętrzny m.in. Komisji Europejskiej, programu URBACT,...