Filters
total: 1934
-
Catalog
- Publications 1389 available results
- Journals 96 available results
- Conferences 2 available results
- People 82 available results
- Inventions 12 available results
- Projects 14 available results
- Laboratories 1 available results
- Research Teams 1 available results
- e-Learning Courses 96 available results
- Events 12 available results
- Open Research Data 229 available results
displaying 1000 best results Help
Search results for: D-SORBITOL
-
Stanisław Taryma dr hab. inż.
People -
Destruction of shell structures under the dynamic load on the human skull trauma basis
PublicationThe main aim of this work is to investigate patterns of potential orbital bone fractures due to mechanical injuries. The solution of the main problem is followed by analysis of several testing examples having straight correlation with civil engineering structures, in which materials of wide range of stiffness are applied. To solve the main problem, the three-dimensional finite element method (FEM) model of the orbital region has...
-
Robert Bogdanowicz dr hab. inż.
PeopleRobert Bogdanowicz received his Ph.D. degree with honours in Electronics from the Gdansk University of Technology. He worked as a post-doc researcher in Ernst-Moritz-Arndt-Universität Greifswald Institut für Physik. He has initiated optical emission imaging of muti-magnetron pulsed plasma and contributed to the development of antibacterial implant coatings deposited by high-power impulse magnetron sputtering. He moved back to...
-
Energy policy and the role of bioenergy in Poland
PublicationPrzedstawiono sytuacje energetyczną kraju. Omówiono poszczególne sektory wytwarzania energii oraz zapotrzebowania na energię i paliwa. Omówiono przekształcenia sektorów energetycznych w Polsce na przestrzeni lat 1990-2002. Na tym tle przedstawiono techniczne, ekonomiczne, społeczne i prawne aspekty rozwoju energetyki źródeł odnawialnych a w szczególności opartych o bioenergię. Przedstawiono wnioski dla Polski płynące z dotychczasowych...
-
Smooth orthogonal projections on sphere.
PublicationWe construct a decomposition of the identity operator on the sphere S^d as a sum of smooth orthogonal projections subordinate to an open cover of S^d. We give applications of our main result in the study of function spaces and Parseval frames on the sphere.
-
On the partition dimension of trees
PublicationGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
Clearing directed subgraphs by mobile agents
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
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...
-
Results of EIS measuremnts and DRT analysis of SrTi0.30Fe0.70O3-d oxygen electrode at 800 °C and 1% oxygen partial pressure by using three R-CPE fiting elements
Open Research DataThis dataset contains electrochemical impedance spectroscopy and Distribution of Relaxation Times analysis results for symmetrical cell with porous SrTi0.30Fe0.70O3-d oxygen electrodes sintered at 800 °C. EIS spectra were measured at 800 °C and 1% of oxygen partial pressure. EIS and DRT spectra of simmulated three R-CPE elements from equivalent circuit,...
-
Results of EIS measuremnts and DRT analysis of SrTi0.30Fe0.70O3-d oxygen electrode at 800 °C and 1% oxygen partial pressure by using two R-CPE fiting elements
Open Research DataThis dataset contains electrochemical impedance spectroscopy and Distribution of Relaxation Times analysis results for symmetrical cell with porous SrTi0.30Fe0.70O3-d oxygen electrodes sintered at 800 °C. EIS spectra were measured at 800 °C and 1% of oxygen partial pressure. EIS and DRT spectra of simmulated two R-CPE elements from equivalent circuit,...
-
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,...
-
Validation of Hydraulic Mechanism during Blowout Trauma of Human Orbit Depending on the Method of Load Application
PublicationThe more we know about mechanisms of the human orbital blowout type of trauma, the better we will be able to prevent them in the future. As long as the buckling mechanism’s veracity is not in doubt, the hydraulic mechanism is not based on equally strong premises. To investigate the correctness of the hydraulic mechanism’s theory, two different methods of implementation of the hydraulic load to the finite element method (FEM) model...
-
Justyna Signerska-Rynkowska dr inż.
PeopleI am currently an assistant professor (adjunct) at Gdansk University of Technology (Department of Differential Equations and Mathematics Applications). My scientific interests include dynamical systems theory, chaos theory and their applications to modeling of biological phenomena, especially to neurosciences. In June 2013 I completed PhD in Mathematics at the Institute of Mathematics of Polish Academy of Sciences (IMPAN) (thesis...
-
Zygmunt Kurałowicz dr hab. inż.
People -
Barbara Kościelska prof. dr hab. inż.
People -
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...
-
The Snow Team Problem
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
Experimental database of 3D lattice structure scaffolds testing
Open Research DataDataset contains results of validation (experimental testing) of 3D lattice scaffolds proposed in the paper "Mathematical approach to design 3D scaffolds for the 3D printable bone implant". There are presented three series of experimental testing for each of seven tested scaffolds:
-
Structure and properties of the exopolysaccharides produced by Pseudomonas mutabilis T6 and P. mutabilis ATCC 31014
PublicationThis paper presents a study on the purification, primary structure, and rheological properties of exopolysaccharides isolated from cultures of Pseudomonas mutabilis T6 and P. mutabilis ATCC 31014. Both polymers are exopolysaccharides of D-mannose. The mannan isolated from P. mutabilis T6 contains on average about 5% of residual b-D-glucose, in contrast to the mannan from P. mutabilis ATCC 31014, which contained only trace amounts...
-
On greedy graph coloring in the distributed model
PublicationArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Zaprezentowano nowy probabilistyczny algorytm dający w wyniku pokolorowanie LF. Udowodniono, że jakakolwiek rozproszona implementacja LF wymaga co najmniej D rund, gdzie D jest maksymalnym stopniem wierzchołka w grafie.
-
Strefa podmiejska w warunkach zrównoważonego rozwoju.
PublicationNR DOKUM: D 73137
-
Cold-Active beta-Galactosidases: Sources, Biochemical Properties and Their Biotechnological Potential
Publicationbeta-D-Galactosidases have been studied extensively in terms of their application to a variety of industrial technologies. To date, considerable research efforts have been devoted to characterization of new cold-active beta-D-galactosidases which were isolated directly from selected species of bacteria and yeasts, as well as with the use of metagenomic approaches. This chapter will provide a review of current research towards cold-active...
-
Marcin Wekwejt dr inż.
PeopleMarcin Wekwejt, absolwent studiów inżynierskich w inż. biomedycznej (2016; Politechnika Bydgoska im. J. i J. Śniadeckich & Collegium Medicum im. L. Rydygiera), studiów magisterskich w inż. mechaniczno-medycznej (2018; Politechnika Gdańska & Gdański Uniwersytet Medyczny) oraz studiów doktoranckich w dyscyplinie inż. materiałowej (2021, Politechnika Gdańska). Uzyskał z wyróżnieniem stopień naukowy doktora nauk inżynieryjno-technicznych...
-
Study of the influence of medium composition on motility and aggregation of recombinant Escherichia coli strain AAEC191A/pCC90 Dra D-mut-PBS, PBS+0.2% glucose, PBS+0.5% glucose
Open Research DataMicrobial motility is a fundamental aspect of many microbial life cycles and is a key survival mechanism that enables microorganisms to navigate diverse and dynamic environmental conditions. This phenomenon becomes particularly important in response to changes in stimuli in time and space. The following experiment aimed to investigate how the composition...
-
Study of the influence of medium composition on motility and aggregation of recombinant Escherichia coli strain AAEC191A/pCC90 Dra D-mut-LB, LB+0.2% glucose, LB+0.5% glucose
Open Research DataMicrobial motility is a fundamental aspect of many microbial life cycles and is a key survival mechanism that enables microorganisms to navigate diverse and dynamic environmental conditions. This phenomenon becomes particularly important in response to changes in stimuli in time and space. The following experiment aimed to investigate how the composition...
-
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...
-
Kamila Klimaszewska dr inż.
PeopleBorn 1979, Warsaw, Poland.Studies in chemistry at Faculty of Chemistry of the Gdańsk University of Technology (1998-2003), PhD in 2008. From 2008 she is employed in Department of Analytical Chemistry.
-
Justyna Kucińska-Lipka dr hab. inż.
People -
Spotkanie TEST D
e-Learning Courses -
Systems of Nonlinear Fractional Differential Equations
PublicationUsing the iterative method, this paper investigates the existence of a unique solution to systems of nonlinear fractional differential equations, which involve the right-handed Riemann-Liouville fractional derivatives D(T)(q)x and D(T)(q)y. Systems of linear fractional differential equations are also discussed. Two examples are added to illustrate the results.
-
Vijayakumar B Ph D
People -
Irina Abaloszewa Ph. D.
People -
Hanna Obracht-Prondzyńska dr inż. arch.
PeopleHanna Obracht-Prondzyńska, PhD MArch, Eng. Assistant Professor at the University of Gdańsk, Department of Spatial Management, academic teacher of urban design and spatial data analyses. Architect and urban planner experienced in data driven urban design and planning. She defended her PhD with distinction in engineering and technical sciences in the discipline of architecture and urban planning in 2020 at the Faculty of Architecture...
-
Fast collaborative graph exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
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...
-
Amygdalin: Toxicity, Anticancer Activity and Analytical Procedures for Its Determination in Plant Seeds
PublicationAmygdalin (D-Mandelonitrile 6-O--D-glucosido--D-glucoside) is a natural cyanogenic glycoside occurring in the seeds of some edible plants, such as bitter almonds and peaches. It is a medically interesting but controversial compound as it has anticancer activity on one hand and can be toxic via enzymatic degradation and production of hydrogen cyanide on the other hand. Despite numerous contributions on cancer cell lines, the clinical...
-
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...
-
Praktyka zawodowa architektoniczna - Praktyka Przeddyplomowa sem. 7 - KOMISJA_D
e-Learning CoursesPraktyka zawodowa architektoniczna na sem. 7 na Wydziale Architektury Politechniki Gdańskiej.Zaliczenie kursu przez komisję D. Skrzypek-Łachińska M. Piątkowska K.Podwojewska M.
-
Variability in macroelement content in the aboveground part of Helianthus tuberosus L. at different nitrogen fertilization levels
Publication -
A demand for innovation support in samll and medium-sized enterprises in the baltic sea region
Publicationthe aim of the expertise is to analyze the actual demand of smes from the baltic sea region for innovation support. the results of the conducted study can help formulate recommendations designed to increase innovation and competitiveness of smes in the baltic sea region in the future. research activities of this study include: the evaluation of innovation level of the baltic sea region enterprises (type and intensity of implemented...
-
Study of the influence of medium composition on motility and aggregation of recombinant Escherichia coli strain BL21(DE3)/pCC90 Dra D-mut-PBS, PBS+0.2% glucose, PBS+0.5% glucose
Open Research DataMicrobial motility is a fundamental aspect of many microbial life cycles and is a key survival mechanism that enables microorganisms to navigate diverse and dynamic environmental conditions. This phenomenon becomes particularly important in response to changes in stimuli in time and space. The following experiment aimed to investigate how the composition...
-
Study of the influence of medium composition on motility and aggregation of recombinant Escherichia coli strain BL21(DE3)/pCC90 Dra D-mut-LB, LB+0.2% glucose, LB+0.5% glucose
Open Research DataMicrobial motility is a fundamental aspect of many microbial life cycles and is a key survival mechanism that enables microorganisms to navigate diverse and dynamic environmental conditions. This phenomenon becomes particularly important in response to changes in stimuli in time and space. The following experiment aimed to investigate how the composition...
-
Bogdan Wiszniewski prof. dr hab. inż.
PeopleBogdan Wiszniewski graduated from Gdansk University of Technology in 1977 and was awarded an MSc in computer science and engineering with honours. In 1984 and 1998, respectively, has got his PhD and DSc. In 2006 was awarded a Professor title by the President of Poland. Lectured at the universities in Canada, US and UK. Principal investigator or coordinator in many national and international R&D projects with the significant...
-
Distributed largest-first algorithm for graph coloring.
PublicationW artykule zaprezentowano rozproszony, probabilistyczny algorytm kolorowania grafów. Kolorowanie uzyskane jest optymalne lub prawie optymalne dla takich klas grafów jak koła dwudzielne, gąsienice czy korony. Udowodniono, że algorytm ten działa w czasie O(D^2 log n) rund dla dowolnego grafu n wierzchołkowegoo stopniu maksymalnym D.
-
Combinatorial scheme of finding minimal number of periodic points for smooth self-maps of simply connected manifolds
PublicationLet M be a closed smooth connected and simply connected manifold of dimension m at least 3, and let r be a fixed natural number. The topological invariant D^m_r [f], defined by the authors in [Forum Math. 21 (2009), 491-509], is equal to the minimal number of r-periodic points in the smooth homotopy class of f, a given self-map of M. In this paper, we present a general combinatorial scheme of computing D^m_r [f] for arbitrary dimension...
-
Note on the multidimensional Gebelein inequality
PublicationWe generalize the Gebelein inequality for Gaussian random vectors in R^d.
-
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...
-
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...