displaying 1000 best results Help
Search results for: CONVEX DOMINATING SET
-
Images of apples for the use of the Viola-Jones method. Data set no. 2 - grey scale
Open Research DataThe database contains pictures of apples made at different angles, from different sides and containing different varieties. In this way, two bases of apple images were created (each database contains 1,100 images). This set is data set no. 2 - grey scale: processed images in shades of gray. The photos were prepared for the best possible detection process...
-
Automatic music set organizatio based on mood of music / Automatyczna organizacja bazy muzycznej na podstawie nastroju muzyki
PublicationThis work is focused on an approach based on the emotional content of music and its automatic recognition. A vector of features describing emotional content of music was proposed. Additionally, a graphical model dedicated to the subjective evaluation of mood of music was created. A series of listening tests was carried out, and results were compared with automatic mood recognition employing SOM (Self Organizing Maps) and ANN (Artificial...
-
Towards a universal embedded-atom method: empirically adjusted and consistent set of atomic densities for all elements of the periodic table
PublicationModel atomu HFS został zmodyfikowany poprzez wyznaczenie indywidualnych parametrów αex dla atomów. Parametry αex wyznaczono w oparciu o energię jonizacji atomów. W oparciu o tak zmodyfikowaną metodę HFS wyznaczono rozkłady gęstości elektronów w atomach.
-
Global defensive sets in graphs
PublicationIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
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...
-
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,...
-
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,...
-
Softly switched robustly feasible mpc for constrained linear systems under set bounded uncertainty- LQ-MPC with IC action
PublicationNie jest możliwe efektywne sterowanie procesem w szerokim zakresie zmian warunków operacyjnych przy użyciu jednego uniwersalnego regulatora. W pracy zaproponowano koncepcję sposobu regulacji polegającego na przełączaniu wielu regulatorów uzależnionego od stanu operacyjnego systemu. Często twarde przełączanie regulatorów nie jest pożądane lub wręcz możliwe, alternatywą jest ich miękkie przełączanie. W pracy rozważany jest problem...
-
Financial impact analysis of going public at the Warsaw Stock Exchange: Using Fuzzy Set Theory to understand behaviours of mature companies
Publication -
GRAPHICAL REPRESENTATION OF MUSIC SET BASED ON MOOD OF MUSIC. GRAFICZNA PREZENTACJA ZBIORU MUZYCZNEGO OPARTA NA ANOTACJI NASTROJU MUZYKI
PublicationOne of the features for music recommendation, which is useful and intuitive for music listen-ers, is “mood”. The paper presents an approach to graphical representation of mood of music pieces. Subjective evaluation based on listening tests is performed for assigning mood labels of 150 pieces of music and placing them on the 2D mood plane. As a result, a map of songs is created, where music excerpts with similar mood are organized...
-
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...
-
2-outer-independent domination in graphs
PublicationWe initiate the study of 2-outer-independent domination in graphs. A 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 at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
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...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
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...
-
On trees attaining an upper bound on the total domination number
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. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
Propagation in the Open Cylindrical Guide of Arbitrary Cross Section With the Use of Field Matching Method
PublicationA simple solution to propagation problem in open waveguides and dielectric fibers of arbitrary convex cross section is presented. The idea of the analysis is based on the direct field matching technique involving the usage of the field projection at the boundary on a fixed set of orthogonal basis functions. A complex root tracing algorithm is utilized to find the propagation coefficients of the investigated guides. Different convex...
-
Paired domination versus domination and packing number in graphs
PublicationGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
All graphs with paired-domination number two less than their order
PublicationLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Independent Domination Subdivision in Graphs
PublicationA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
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...
-
Effectiveness of either short-duration ischemic pre-conditioning, single-set high-resistance exercise, or their combination in potentiating bench press exercise performance
Publication -
Effects of Acute Caffeine Intake on Power Output and Movement Velocity During a Multiple-Set Bench Press Exercise Among Mild Caffeine Users
Publication -
Simultaneous determination of hydrophobicity and dissociation constant for a large set of compounds by gradient reverse phase high performance liquid chromatography–mass spectrometry technique
Publication -
Zagospodarowanie ciepła odpadowego z biogazowych agregatów kogeneracyjnych w oczyszczalni ścieków = Waste heat utilisation from cogeneration set in sewage plant
PublicationW pracy opisano koncepcję współpracy biogazowych modułów kogeneracyjnych z niskotemperaturowym obiegiem parowym. Proponowana modernizacja pozwoliłaby na wykorzystanie entalpii fizycznej spalin, tym samym zwiększając sprawność urządzeń wytwarzających ciepło i energię elektryczną. Tego typu rozwiązanie umożliwiłoby częściowe pokrycie zapotrzebowania własnego na energię elektryczną, generując oszczędności w przedsiębiorstwie. W artykule...
-
Joanna Janczewska prof. dr hab.
PeopleJoanna Janczewska obtained her PhD degree at the University of Gdansk in 2002. From October 1999 to September 2004 she was an assistant at the University of Gdansk. Since October 2004 she has been an assistant professor at the Gdansk University of Technology. Moreover, from October 2008 to September 2010 she had a visiting position in the Institute of Mathematics of the Polish Academy of Sciences. Her mathematical interests...
-
Methane (CH4) calibration set of FTIR spectra
Open Research DataThe calibration spectra for CH4 concentration calibration were supplied with this dataset
-
Isolation Number versus Domination Number of Trees
PublicationIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
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...
-
Mutual Interaction between Temperature and DO Set Point on AOB and NOB Activity during Shortcut Nitrification in a Sequencing Batch Reactor in Terms of Energy Consumption Optimization
PublicationRecently, many wastewater treatment plants (WWTPs) have had to deal with serious problems related to the restrictive requirements regarding the euent quality, as well as significant energy consumption associated with it. In this situation, mainstream deammonification and/or shortened nitrification-denitrification via nitrite (so-called “nitrite shunt”) is a new promising strategy. This study shows the mechanisms and operating conditions...
-
Quadratic stochastic operators on Banach lattices
PublicationWe study the convergence of iterates of quadratic stochastic operators that are mean monotonic. They are defined on the convex set of probability measures concentrated on a weakly compact order interval S = [0, f] of a fixed Banach lattice F. We study their regularity and identify the limits of trajectories either as the “infimum” or “supremum” of the support of initial distributions.
-
Carbon dioxide (CO2) calibration set of FTIR spectra
Open Research DataThe calibration spectra for CO2 concentration calibration were supplied with this dataset
-
Polish bibliological journals - publishing policy data set
Open Research DataThe file contains the results of an analysis of the publishing policies of Polish bibliological journals conducted by librarians of the Library of the Gdansk University of Technology. Among the elements studied were Open Access status, Creative Commons license type and self-archiving practices.The survey was conducted from 2018 to 2023 on the basis...
-
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...
-
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.
-
2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
Scattering From a Cylindrical Object of Arbitrary Cross Section With the Use of Field Matching Method
PublicationA simple and intuitive solution to scattering problems in shielded and open structures is presented. The main idea of the analysis is based on the direct field matching technique involving the usage of projection of the fields at the boundary on a fixed set of orthogonal basis functions. Different convex shapes and various obstacle materials are considered to verify the validity of the method in open and closed structures. The...
-
Double bondage in graphs
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) 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, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
Carbon (II) oxide (CO) calibration set of FTIR spectra
Open Research DataThe calibration spectra for CO concentration calibration were supplied with this dataset
-
Non-isolating 2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
Non-isolating bondage in graphs
PublicationA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
Specimen running-in. Prep. to sliding friction tests. Ring-on-ring contact. Sintered alumina ceramics (98%). Paraffin oil lubrication. Specimen set #24 - #25.
Open Research DataSpecimen running-in procedure. Preparation to sliding friction tests in ring-on-ring contact. Sintered alumina ceramics (98%) in self-mated contact. Lubrication: paraffin oil. Sliding velocity: 0.2 m/s. Mean contact stress: 10 MPa. Test rig: PT-3 Tribometer. Specimen set #24 (upper, rotating), #25 (lower, non-rotating)CZ_PRZYS.MAT - accelerometerMOM_TAR.MAT...
-
Specimen running-in. Prep. to sliding friction tests. Ring-on-ring contact. Sintered alumina ceramics (98%). Paraffin oil lubrication. Specimen set #28 - #29.
Open Research DataSpecimen running-in procedure. Preparation to sliding friction tests in ring-on-ring contact. Sintered alumina ceramics (98%) in self-mated contact. Lubrication: paraffin oil. Sliding velocity: 0.2 m/s. Mean contact stress: 10 MPa. Test rig: PT-3 Tribometer. Specimen set #28 (upper, rotating), #29 (lower, non-rotating)CZ_PRZYS.MAT - accelerometerMOM_TAR.MAT...
-
Specimen running-in. Prep. to sliding friction tests. Ring-on-ring contact. Sintered alumina ceramics (98%). Paraffin oil lubrication. Specimen set #30 - #31.
Open Research DataSpecimen running-in procedure. Preparation to sliding friction tests in ring-on-ring contact. Sintered alumina ceramics (98%) in self-mated contact. Lubrication: paraffin oil. Sliding velocity: 0.2 m/s. Mean contact stress: 10 MPa. Test rig: PT-3 Tribometer. Specimen set #30 (upper, rotating), #31 (lower, non-rotating)CZ_PRZYS.MAT - accelerometerMOM_TAR.MAT...
-
Specimen running-in. Prep. to sliding friction tests. Ring-on-ring contact. Sintered alumina ceramics (98%). Paraffin oil lubrication. Specimen set #20 - #21.
Open Research DataSpecimen running-in procedure. Preparation to sliding friction tests in ring-on-ring contact. Sintered alumina ceramics (98%) in self-mated contact. Lubrication: paraffin oil. Sliding velocity: 0.2 m/s. Mean contact stress: 10 MPa. Test rig: PT-3 Tribometer. Specimen set #20 (upper, rotating), #21 (lower, non-rotating)CZ_PRZYS.MAT - accelerometerMOM_TAR.MAT...
-
Specimen running-in. Prep. to sliding friction tests. Ring-on-ring contact. Sintered alumina ceramics (98%). Paraffin oil lubrication. Specimen set #22 - #23.
Open Research DataSpecimen running-in procedure. Preparation to sliding friction tests in ring-on-ring contact. Sintered alumina ceramics (98%) in self-mated contact. Lubrication: paraffin oil. Sliding velocity: 0.2 m/s. Mean contact stress: 10 MPa. Test rig: PT-3 Tribometer. Specimen set #22 (upper, rotating), #23 (lower, non-rotating)CZ_PRZYS.MAT - accelerometerMOM_TAR.MAT...
-
Specimen running-in. Prep. to sliding friction tests. Ring-on-ring contact. Sintered alumina ceramics (98%). Paraffin oil lubrication. Specimen set #28 - #29.
Open Research DataSpecimen running-in procedure. Preparation to sliding friction tests in ring-on-ring contact. Sintered alumina ceramics (98%) in self-mated contact. Lubrication: paraffin oil. Sliding velocity: 0.2 m/s. Mean contact stress: 10 MPa. Test rig: PT-3 Tribometer. Specimen set #28 (upper, rotating), #29 (lower, non-rotating)CZ_PRZYS.MAT - accelerometerMOM_TAR.MAT...
-
Specimen running-in. Prep. to sliding friction tests. Ring-on-ring contact. Sintered alumina ceramics (98%). Paraffin oil lubrication. Specimen set #26 - #27.
Open Research DataSpecimen running-in procedure. Preparation to sliding friction tests in ring-on-ring contact. Sintered alumina ceramics (98%) in self-mated contact. Lubrication: paraffin oil. Sliding velocity: 0.2 m/s. Mean contact stress: 10 MPa. Test rig: PT-3 Tribometer. Specimen set #26 (upper, rotating), #27 (lower, non-rotating)CZ_PRZYS.MAT - accelerometerMOM_TAR.MAT...
-
Certified domination
PublicationImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Michał Tomasz Kucewicz dr
PeopleMichal Kucewicz was born in 1986 in Gdansk. In 2005 he completed International Baccalaureate programme in Topolowka (III High School in Gdańsk). Thanks to the G. D. Fahrenheit scholarship, he moved to the United Kingdom to study neuroscience. He received his Bachelor’s and Master’s degree from the Cambridge University, and his doctoral degree from the University of Bristol specializing in electrophysiology of memory and cognitive...