Filters
total: 5032
-
Catalog
- Publications 3749 available results
- Journals 4 available results
- People 93 available results
- Inventions 19 available results
- Projects 16 available results
- Laboratories 1 available results
- Research Teams 7 available results
- e-Learning Courses 120 available results
- Events 7 available results
- Open Research Data 1016 available results
displaying 1000 best results Help
Search results for: MECHANIZMY TYPU SET
-
Molecular geometry of hexachlorobenzene
Open Research DataPresented data shows molecular geometry of the ground singlet state of hexachlorobenzene and hexachlorobenzene with potassium atom in 10 angstrom distance. The geometry was obtained via MP2 and CCSD calculations using balanced polarized triple-zeta def2-TZVP basis set. Geometry is provided in the XYZ file format.
-
Pojazdy bezzałogowe - TKiS
e-Learning CoursesCelem przedmiotu jest zapoznanie studentów z podstawowymi technologiami związanymi z rozwojem pojazdów bezzałogowych i autonomicznych, poprzez technologie związane z pojazdami bezzałogowymi sterowanymi zdalnie ROV, pojazdami bezzałogowymi powietrznymi typu UAV, bezzałogowymi pojazdami lądowymi typu UGV, bezzałogowymi pojazdami nawodnymi USV, bezzałogowymi pojazdami podwodnymi UUV aż po bezzałogowe pojazdy autonomiczne odpowiadające...
-
Oddziaływanie materiału opakowaniowego Mater-Bi na populację okrzemki w środowisku morskim
PublicationDo produkcji różnego rodzaju opakowań stosowane są m.in. takie materiały jak: polimery, kopolimery i ich mieszaniny; trwałe oraz stabilne środowisko (ich rozkład trwa kilka set lat). Dlatego też obecnie systematycznie zwiększa się zainteresowanie i zapotrzebowanie na polimerowe materiały biodegradowalne, które rozkładają się w środowisku naturalnym do prostych i bezpiecznych surowców. Należą do nich m.in. substancje naturalne jak...
-
Komputerowe wspomaganie wytwarzania (CAM), PG_00055064, ZiIP, 2023/2024, s. zimowy
e-Learning CoursesPoznanie podstawowych technik komputerowo wspomaganego wytwarzania, zwłaszcza automatycznego programowania obrabiarek CNC z wykorzystaniem systemów typu CAM.
-
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...
-
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...
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Calibration images under different lighting conditions vol. 1
Open Research DataDataset description: Calibration images under different lighting conditions vol. 1
-
Graphs with isolation number equal to one third of the order
PublicationA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Badanie i analiza właściwości kanałów radiowych w sieciach WBAN (część 2)
PublicationW tej części artykułu przeprowadzono analizę zaników wolnozmiennych i szybkozmiennych w sieciach WBAN typu off-body z przestrzennym odbiorem zbiorczym oraz analizę stopnia skorelowania odbieranych sygnałów. Zaprezentowano model kanału radiowego dla wąskopasmowych i szerokopasmowych sieci WBAN typu off-body, pracujących w środowisku promu pasażerskiego. Przeprowadzono analizę porównawczą zaników wolnozmiennych i szybkozmiennych...
-
Total domination in versus paired-domination in regular graphs
PublicationA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Ocena nośności betonowych dźwigarów taśmowych systemu Mullera.
PublicationPraca przedstawia analizę numeryczną dźwigarów typu Mullera przeprowadzoną za pomocą metody elementów skończonych. Analiza pozwoliła ocenić fazy pracy dźwigara typu Mullera oraz ocenić skuteczność wzmocnienia mostów z zastosowaniem dźwigarów omawianego typu. Ponadto przedstawiono wyniki dokonanego porównania modelu numerycznego z rzeczywistymi modelami wykonanymi w laboratorium.
-
Marta Kuc-Czarnecka dr
PeopleMarta Kuc-Czarnecka is the deputy head of the Department of Statistics and Economics at the Faculty of Management and Economics of the Gdańsk University of Technology. She also serves as the Dean's proxy for AMBA accreditation. She is a co-founder of Rethinking Economics Gdańsk and a member of the Foundation Edward Lipiński for the promotion of pluralism in economic sciences. In 2018-2022, she was Eurofound’s quality of life and...
-
Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets
PublicationThis work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry...
-
FOSDIA Mechanizmy redukcji i utlenienia międzyfazowych nanostruktur fosforenowo-nanodiamentowych w środowisku wodnym
ProjectsProject realized in Faculty of Electronics, Telecommunications and Informatics according to DEC- 2019/03/X/ST5/01484 agreement from 2019-12-19
-
Układy hydrauliczne stosowane w samochodach osobowych. Część I
PublicationOpisano konstrukcję i budowę układów hydraulicznych w samochodzie typu ACE. Przedstawiono charakterystykę pracy oraz zasadę działania elektronicznego układu sterującego typu ECU.
-
Joanna Raczek dr inż.
PeopleEmployment 2003 -- 2019: Faculty of Applied Physics and Mathematics, Gdańsk University of Technology. 2019 - present: Faculty of Electronic, Informatics and Telecominications, Gdańsk University of Technology. Education May 2007: Doctor of Philosophy in Mathematics, University of Gdańsk. Doctoral dissertation: "Paired domination and doubly domination in graphs". Supervisor: dr hab. Jerzy Topp. 2000 -- 2004 Bachelor of Science...
-
Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g real projective planes.
Open Research DataMorse–Smale diffeomorphisms, structurally stable and having relatively simple dynamics, constitute an important subclass of diffeomorphisms that were carefully studied during past decades. For a given Morse–Smale diffeomorphism one can consider “Minimal set of Lefschetz periods”, which provides the information about the set of periodic points of considered...
-
High step-up continuous input current LCCT-Z-source inverters for fuel cells
PublicationFalowniki typu Z (ZSI) przeznaczone są do układów wymagających szerokiej zmiany wzmocnienia napięciowego, np. w energetyce odnawialnej. Ostatnio zaproponowano w literaturze zmienione struktury - falowniki typu Trans-Z (TZSI) oraz typu T (TSI) - w których dzięki zastosowaniu dławików sprzężonych uzyskano lepsze wzmocnienie niż w ZSI. W tym artykule przedstawiono ideę rozszerzonej struktury TZSI. Zaproponowano dwie nowe struktury...
-
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...
-
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,...
-
Thermodynamic Cycles of Air Microturbine Power Plants Working on Biomass Fuels
PublicationThe gas turbine engine is modified to work as an air turbine set which consists, in the simplest arrangement, of a compressor, a heat exchanger and a turbine. Air is a working medium for both: the compressor and the turbine. This kind of air turbine set can be applied in power plants working on biomass fuels. In this solution we can burn fuels of varying parameters in the external combustion chamber without any harmful effects...
-
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...
-
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...
-
Interpolation properties of domination parameters of a graph
PublicationAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
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...
-
Weakly connected Roman domination in graphs
PublicationA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
Graph security testing
PublicationSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
The Righi-Leduc effect: on evidence of two-band electronic structure in Nd1.86Ce0.14CuO4-y.
PublicationPrzedstawiono badania temperaturowe zależności oporu elektrycznego, efektu Halla (RH), przewodnictwa cieplnego (k) i współczynnika Righi-Leduc(SRL). Badania wykazały, że współczynnik RL> 0 w szerokim zakresie temperatur RH zmienia znak dwukrotnie w T=50 i 250K. Niezgodność znaków SRL i RH jednoznacznie wskazuje obecność w materiale nośników obu znaków tzn. n- i p- typu. W pracy pokazano, że transport ciepła zdominowany jest przez...
-
Conley-Morse graphs for a two-dimensional discrete neuron model (low resolution)
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Conley-Morse graphs for a two-dimensional discrete neuron model (limited range)
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
Conley-Morse graphs for a two-dimensional discrete neuron model (full range)
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.
-
A remark on singular sets of vector bundle morphisms
PublicationIf characteristic classes for two vector bundles over the same base space do not coincide, then the bundles are not isomorphic. We give under rather common assumptions a lower bound on the topological dimension of the set of all points in the base over which a morphism between such bundles is not bijective. Moreover, we show that this set is topologically non-trivial.
-
Phase transitions and microstructure of emulsion systems prepared with acylglycerols/zinc stearate emulsifier
PublicationZbadano przemiany fazowe jakim ulegają układy emulsyjne w czasie procesu emulgowania, prowadzonego w obecności emulgatora acyloglicerolowego modyfikowanego stearynianem cynku. Rodzaj przemian mikrostrukturalnych jakim ulegały emulsje zależny był w głównej mierze od temperatury oraz zawartości fazy wodnej. Obserwowano powstawanie emulsji typu W/O, która wraz z obniżaniem temperatury ulegała inwersji prowadzącej do powstania dyspersji...
-
Przetwarzanie strumieni multimedialnych na klastrze komputerowym Galera
PublicationSformułowano problemy przetwarzania strumieni multimedialnych w czasie rzeczywistym. Rozpatrzono różne możliwości realizacji tego typu przetwarzania i na tej podstawie opracowano wymagania na platformę KASKADA ułatwiające wykonanie tego typu zadań na klastrze komputerowym o wysokiej wydajności przetwarzania. Podano architekturę takiej platformy oraz sposób jej implementacji. Dokonano oceny przydatności tej platformy przetwarzania...
-
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...
-
Bazy danych w Zastosowaniach
e-Learning CoursesBazy danych - podstawowe pojęcia, modele danych - prosty , hierarchiczny, sieciowy, model relacyjny - podstawy - projektowanie Baz danych, algebra relacyjna, język SQL. Współczesne mechanizmy w bazach danych - transakcje, wyzwalacze, łączenie baz danych z programami. Model obiektowy i obiektowo-relacyjny. Bazy non-SQL
-
Color-based Detection of Bleeding in Endoscopic Images
PublicationIn this paper a color descriptor designed for bleeding detection in endoscopic images is proposed. The development of the algorithm was carried out on a representative training set of 36 images of bleeding and 25 clear images. Another 38 bleeding and 26 normal images were used in the final stage as a test set. All of the considered images were extracted from separate endoscopic examinations. The experiments include color distribution...
-
Common Independence in Graphs
PublicationAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Krzysztof Formela dr inż.
People -
Ocena niepewności pomiaru współczynnika zawartości harmonicznych.
PublicationPrzedstawiono metodę szacowania niepewności pomiaru współczynnika zawartości harmonicznych wyznaczanego w komputerowym systemie pomiarowym. Tą wielkość scharakteryzowano rozszerzoną niepewnością pomiarową uwzględniając występowania dwóch podstawowych składników determinujących niedokładności pomiarów.Przeprowadzono rozważania o niepewnościach standardowych z uwzględnieniem składowej systematycznej i losowej błędów pomiarowych...
-
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...
-
Comparing Arbitrary Unrooted Phylogenetic Trees Using Generalized Matching Split Distance
PublicationIn the paper, we describe a method for comparing arbitrary, not necessary fully resolved, unrooted phylogenetic trees. Proposed method is based on finding a minimum weight matching in bipartite graphs and can be regarded as a generalization of well-known Robinson-Foulds distance. We present some properties and advantages of the new distance. We also investigate some properties of presented distance in a common biological problem...
-
Extending touch-less interaction with smart glasses by implementing EMG module
PublicationIn this paper we propose to use temporal muscle contraction to perform certain actions. Method: The set of muscle contractions corresponding to one of three actions including “single-click”, “double-click” “click-n-hold” and “non-action” were recorded. After recording certain amount of signals, the set of five parameters was calculated. These parameters served as an input matrix for the neural network. Two-layer feedforward neural...
-
Horizon Europe proposals - Administrative Part
Open Research DataThe dataset contains data collected during the HE National Contact Point training on Oct. 12, 2022, reg. the administrative part of Horizon Europe grant proposals. The data set includes presentations concerning administrative forms of 2022 proposals and their content, including participant data; information about abstract writing, keyword choice and...
-
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...
-
Jerzy Łabanowski prof. dr hab. inż.
People -
Monotone method to Volterra and Fredholm integral equations with deviating arguments
PublicationPraca dotyczy problemów istnienia rozwiązań równań całkowych typu Volterry i Fredholma z odchylonymi argumentami. Podano warunki dostateczne na istnienie rozwiązań w odpowiedniej klasie. Pewne nierówności całkowe typu opóźnionego są również przedmiotem badań.
-
Sandwich panels in shipbuilding
PublicationW publikacji przedstawiono charakterystykę i podstawowe własności nowego tworzywa dla konstrukcji statku jakim są stalowe, spawane laserowo panele typu sandwich. Omówiono podstawowe zalety nowego typu konstrukcji, przedstawiono problemy wynikające z jej stosowania.
-
Induction of the common-sense hierarchies in lexical data
PublicationUnsupervised organization of a set of lexical concepts that captures common-sense knowledge inducting meaningful partitioning of data is described. Projection of data on principal components allow for dentification of clusters with wide margins, and the procedure is recursively repeated within each cluster. Application of this idea to a simple dataset describing animals created hierarchical partitioning with each clusters related...