Wyszukiwarka
Filtry
wszystkich: 3451
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: connected dominating set
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor 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 in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
Graphs with equal domination and certified domination numbers
PublikacjaA 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...
-
Rediscovering Automatic Detection of Stuttering and Its Subclasses through Machine Learning—The Impact of Changing Deep Model Architecture and Amount of Data in the Training Set
PublikacjaThis work deals with automatically detecting stuttering and its subclasses. An effective classification of stuttering along with its subclasses could find wide application in determining the severity of stuttering by speech therapists, preliminary patient diagnosis, and enabling communication with the previously mentioned voice assistants. The first part of this work provides an overview of examples of classical and deep learning...
-
The basis set, scattering wavefunction and Schwinger variational principle: an application for low energy positron-atom scattering
Publikacja -
Description of the solution set of the von Karman equations for a circular plate in a small neighbourhood of a simple bifurcation point
PublikacjaW niniejszej pracy badamy równania von Karmana dla cienkiej, sprężystej, kołowej płyty na sprężystym podłożu, poddawanej działaniu sił ściskających wzdłuż brzegu. Są to równania różniczkowe cząstkowe IV rzędu. Stosując metody analizy nieliniowej, opisujemy zbiór rozwiązań równań von Karmana w małym otoczeniu jednokrotnego punktu bifurkacji.Badania były finansowane przez grant nr 1 P03A 042 29.
-
Comprehensive Analysis of MILE Gene Expression Data Set Advances Discovery of Leukaemia Type and Subtype Biomarkers
Publikacja -
A Text as a Set of Research Data. A Number of Aspects of Data Acquisition and Creation of Datasets in Neo-Latin Studies
PublikacjaIn this paper, the authors, who specialise in part in neo-Latin studies and the his-tory of early modern education, share their experiences of collecting sources for Open Research Data sets under the Bridge of Data project. On the basis of inscription texts from St. Mary’s Church in Gdańsk, they created 29 Open Research Data sets. In turn, the text of the lectures of the Gdańsk scholar Michael Christoph Hanow, Praecepta de arte...
-
Support interlinking of design and process planning by set of experience knowledge structure and decisional DNA: Conceprual Approach
PublikacjaKoncepcja wspomagania planowania procesow p-rzy pomocy SOEKS oraz Decyzjnego DNA.
-
LED Light Sources and Their Complex Set-Up for Visually and Biologically Effective Illumination for Ornamental Indoor Plants
PublikacjaOrnamental plants are often used in indoor environments as part of biophilic design to improve the health and wellbeing of occupants, and to support sustainable, green architecture. Unfortunately, many plants do not thrive and need to be continuously replaced, which is economically unsustainable. The wavelengths and spectrum ratio of commonly used light sources such as light emitting diode (LED), and the lack of an appropriate...
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA 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,...
-
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,...
-
Rapid multi-objective antenna design using point-by-point Pareto set identification and local surrogate models
PublikacjaAntenna design is inherently a multicriterial problem.Determination of the best possible tradeoffs between conflicting objectives (a so-called Pareto front), such as reflection response, gain, and antenna size, is indispensable from the designer’s point of view, yet challenging when high-fidelity electromagnetic (EM) simulations are utilized for performance evaluation. Here, a novel and computationally...
-
The convex domination subdivision number of a graph
PublikacjaLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
Images of apples for the use of the Viola-Jones method. Data set no. 1 - multicolor.
Dane BadawczeThe 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 over 1,100 images). This set is data set no. 1 - multicolor: processed images in multicolor. The photos were prepared for the best possible detection process...
-
Images of apples for the use of the Viola-Jones method. Data set no. 2 - grey scale
Dane BadawczeThe 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...
-
Weakly convex domination subdivision number of a graph
PublikacjaA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
Towards a universal embedded-atom method: empirically adjusted and consistent set of atomic densities for all elements of the periodic table
PublikacjaModel 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.
-
Automatic music set organizatio based on mood of music / Automatyczna organizacja bazy muzycznej na podstawie nastroju muzyki
PublikacjaThis 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...
-
Experimental determination of general characteristic of internal combustion engine using mobile test bench connected via Power Take-Off unit
PublikacjaThe general characteristics of the engine include information about the regions of the engine's operating area that are most efficient, where specific fuel consumption reaches the smallest values. Economic operation based on those characteristics can contribute to a significant reduction of fuel consumption and consequently less pollutant emissions and lower costs. The paper presents an experimental method of determination of general...
-
Global defensive sets in graphs
PublikacjaIn 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...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA 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,...
-
Financial impact analysis of going public at the Warsaw Stock Exchange: Using Fuzzy Set Theory to understand behaviours of mature companies
Publikacja -
Softly switched robustly feasible mpc for constrained linear systems under set bounded uncertainty- LQ-MPC with IC action
PublikacjaNie 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...
-
GRAPHICAL REPRESENTATION OF MUSIC SET BASED ON MOOD OF MUSIC. GRAFICZNA PREZENTACJA ZBIORU MUZYCZNEGO OPARTA NA ANOTACJI NASTROJU MUZYKI
PublikacjaOne 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 2-outer-independent domination number of a tree
PublikacjaA 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,...
-
Wojciech Litwin dr hab. inż.
Osoby1992÷1996 – Studia na Wydziale Mechanicznym Politechniki Gdańskiej1996 – Zatrudniony na Wydziale Oceanotechniki i Okrętownictwa PG2004 – Obrona pracy doktorskiej2014 – obrona rozprawy habilitacyjnej2012 – obejmuje funkcję prodziekan ds. Nauki na Wydziale Oceanotechniki i OkrętownictwaUczestniczył w wielu projektach badawczych oraz pracach zleconych przez przemysł związanych z łożyskowaniem ślizgowym wałów głównych oraz niekonwencjonalnymi...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA 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...
-
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...
-
2-outer-independent domination in graphs
PublikacjaWe 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,...
-
Bounds on the vertex-edge domination number of a tree
PublikacjaA 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
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. 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...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 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...
-
Front Cover: Chiral Molecular Cages Based on Cyclotriveratrylene and Sucrose Units Connected with p ‐Phenylene Linkers (Eur. J. Org. Chem. 6/2021)
Publikacja -
Paired domination versus domination and packing number in graphs
PublikacjaGiven 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
PublikacjaLet 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...
-
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...
-
Connected & Automated Urban Mobility, Zombie Cars and Kitchen Knives: Will Autonomous Automobiles, Self-Driving Car-Sharing and Ride-Hailing, and Driverless Shuttles Harm Cities?
PublikacjaThere is a deficiency of supportive evidence to verify thesis that cities are prepared for mobility revolution which already begun and will advance exponentially. Furthermore, present revisions mostly emphasize how emerging mobility solutions will alter transport efficiency or affect mass transit usage, rather than on urban morphology, metropolitan society, nor local communities. Author is thoroughly concerned that municipalities...
-
Simultaneous determination of hydrophobicity and dissociation constant for a large set of compounds by gradient reverse phase high performance liquid chromatography–mass spectrometry technique
Publikacja -
Effects of Acute Caffeine Intake on Power Output and Movement Velocity During a Multiple-Set Bench Press Exercise Among Mild Caffeine Users
Publikacja -
Effectiveness of either short-duration ischemic pre-conditioning, single-set high-resistance exercise, or their combination in potentiating bench press exercise performance
Publikacja -
Zagospodarowanie ciepła odpadowego z biogazowych agregatów kogeneracyjnych w oczyszczalni ścieków = Waste heat utilisation from cogeneration set in sewage plant
PublikacjaW 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...
-
Methane (CH4) calibration set of FTIR spectra
Dane BadawczeThe calibration spectra for CH4 concentration calibration were supplied with this dataset
-
Isolation Number versus Domination Number of Trees
PublikacjaIf 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)....
-
Joanna Janczewska prof. dr hab.
OsobyJoanna Janczewska odbyła studia wyższe magisterskie na kierunku Matematyka w latach 1994–1999 z wynikiem bardzo dobrym i uzyskała w 1999 roku tytuł magistra. W 2002 roku na Uniwersytecie Gdańskim uzyskała stopień naukowy doktora nauk matematycznych w zakresie matematyki. Promotorem w przewodzie doktorskim był dr hab. Andrzej Borysowicz, prof. UG. W październiku 2004 roku podjęła pracę na stanowisku adiunkta w Katedrze Algebry...
-
Bipartite theory of graphs: outer-independent domination
PublikacjaLet $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
PublikacjaRecently, 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...
-
Polish bibliological journals - publishing policy data set
Dane BadawczeThe 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...
-
Carbon dioxide (CO2) calibration set of FTIR spectra
Dane BadawczeThe calibration spectra for CO2 concentration calibration were supplied with this dataset
-
On the super domination number of lexicographic product graphs
PublikacjaThe 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...