Filtry
wszystkich: 1603
-
Katalog
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: VERTEX DEGREE
-
Synergistic effects of a swirl generator and MXene/ water nanofluids used in a heat exchanger pipe of a negative CO2 emission gas power plant
Publikacjafocus on optimizing heat exchangers contributes to improved temperature control mechanisms, ensuring the sustainable operation of innovative power plants working towards negative CO2 emissions. In the realm of oxy-combustion within Negative CO2 Emission Power Plants (nCO2PP), the temperature of combustion products surpasses 3000 (K). Addressing this challenge, the imperative arises to reduce these elevated temperatures to a manageable...
-
A new approach to determination of the two-mass model parameters of railway current collector
PublikacjaThe paper presents two mathematical models of railway current collectors both with two degrees of freedom. The first one, hereinafter Pantograph Articulated Model (PAM), has one degree of freedom in rotational motion and the second degree of freedom in translational motion. The second model, called henceforth as Pantograph Reference Model (PRM), has both degrees of freedom in translational motion. Differential equations of the...
-
A new approach to determination of the two-mass model parameters of railway current collector
PublikacjaThe paper presents two mathematical models of railway current collectors both with two degrees of freedom. The first one, hereinafter Pantograph Articulated Model (PAM), has one degree of freedom in rotational motion and the second degree of freedom in translational motion. The second model, called henceforth as Pantograph Reference Model (PRM), has both degrees of freedom in translational motion. Differential equations of the...
-
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,...
-
The SEM images of LSCNT reduced at 900 degrees C under H2
Dane BadawczeThe dataset includes SEM image of La0.27Sr0.54Ce0.09Ni0.1Ti0.9O3-s sintered at 1200oC under air atmosphere for 12 h and reduced at 900oC under H2 for 10 h. Samples were produced using aqueous soft chemistry methods (Pechini).
-
The SEM images of LSCNT reduced at 800 degrees C under H2
Dane BadawczeThe dataset includes SEM images of La0.27Sr0.54Ce0.09Ni0.1Ti0.9O3-s sintered at 1200oC under air atmosphere for 12 h and reduced at 800oC under H2 for 10 h. Samples were produced using aqueous soft chemistry methods (Pechini).
-
The SEM images of LSCNT reduced at 1000 degrees C under H2
Dane BadawczeThe dataset includes SEM images of La0.27Sr0.54Ce0.09Ni0.1Ti0.9O3-s sintered at 1200oC under air atmosphere for 12 h and reduced at 1000oC under H2 for 10 h. Samples were produced using aqueous soft chemistry methods (Pechini).
-
Toward a universal Embedded-Atom Method: II. A set of transferable denisty and dimmer referenced embedding energy functions for all elements of the periodic table as tool for removing two gauge degrees of freedom in EAM potentials
PublikacjaZestaw kluczowych właściwości homodwuatomowych cząsteczek o Z ≤ 103 (równowagowa odległość między atomami re, energia dysocjacji DO, Liczba falowa drgań ωe) zostały zestawione na bazie dostępnych danych eksperymantalnych oraz obliczeń za pomocą teorii funkcjonałów gęstości elektronowej B3LYP/SBKJC.
-
Ireneusz Czarnowski Prof.
OsobyIRENEUSZ CZARNOWSKI is a graduate of the Faculty of Electrical Engineering at Gdynia Maritime University. He gained a doctoral degree in the field of computer science at Poznan University of Technology and a postdoctoral degree in the field of computer science at Wroclaw University of Science and Technology. Since 1998 is associated with Gdynia Maritime University, currently is a professor of computer science in the Department...
-
Galerkin formulations with Greville quadrature rules for isogeometric shell analysis: Higher order elements and locking
PublikacjaWe propose new Greville quadrature schemes that asymptotically require only four in-plane points for Reissner-Mindlin (RM) shell elements and nine in-plane points for Kirchhoff-Love (KL) shell elements in B-spline and NURBS-based isogeometric shell analysis, independent of the polynomial degree of the elements. For polynomial degrees 5 and 6, the approach delivers high accuracy, low computational cost, and alleviates membrane and...
-
Domination-Related Parameters in Rooted Product Graphs
PublikacjaAbstract 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.
-
On extremal sizes of locally k-tree graphs
PublikacjaA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...
-
A five-year retrospective study shows increasing rates of antimicrobial drug resistance in Cabo Verde for both Staphylococcus aureus and Escherichia coli
Publikacja -
A five-year retrospective study shows increasing rates of antimicrobial drug resistance in Cabo Verde for both Staphylococcus aureus and Escherichia coli
PublikacjaObjectives Data on baseline drug resistance is important in informing future antimicrobial stewardship programs. So far, no data on the antimicrobial drug resistance of clinical isolates was available for the African archipelago of Cabo Verde. Methods We have performed a retrospective analysis over five-years (2013-17) of the antimicrombial drug susceptibility profiles of clinical isolates in the two main hospitals of Cabo Verde....
-
Roland Ryndzionek dr inż.
OsobyI received the M.Sc. degree in Electrical Engineering from Gdańsk University of Technology (Gdańsk Tech), Gdańsk, Poland, in 2010, the M.Sc. degree in Electrical Engineering from INP ENSEEIHT, Toulouse, France, in 2012, and the Ph.D. degree in Electrical Engineering from Gdańsk Tech and INP, in 2015. From 2015 to 2017. I was a postdoctoral research engineer at the SuperGrid Institute Lyon, France. Since 2017, I have been working...
-
Some Progress on Total Bondage in Graphs
PublikacjaThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
On the partition dimension of trees
PublikacjaGiven 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...
-
α-Lipoic Acid Strengthens the Antioxidant Barrier and Reduces Oxidative, Nitrosative, and Glycative Damage, as well as Inhibits Inflammation and Apoptosis in the Hypothalamus but Not in the Cerebral Cortex of Insulin-Resistant Rats
Publikacja -
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...
-
Hybrid metal and non-metal activation of Oxone by magnetite nanostructures co-immobilized with nano-carbon black to degrade tetracycline: Fenton and electrochemical enhancement with bio-assay
PublikacjaElectrochemically synthesized magnetite nanostructures (ESMNPs) as a metal activator and nano-carbon black (NCB) as a non-metal activator were co-immobilized by alginate natural polymer to activate Oxone for the degradation of tetracycline (TC) antibiotic. The formation of sulfate radical was indirectly confirmed during the Oxone/ESMNPs/NCB/alginate process via the addition of scavenging compounds. This study revealed the high...
-
On the size of identifying codes in triangle-free graphs
PublikacjaIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Effect of Chitosan Deacetylation on Its Affinity to Type III Collagen: A Molecular Dynamics Study
PublikacjaThe ability to form strong intermolecular interactions by linear glucosamine polysaccharides with collagen is strictly related to their nonlinear dynamic behavior and hence bio-lubricating features. Type III collagen plays a crucial role in tissue regeneration, and its presence in the articular cartilage affects its bio-technical features. In this study, the molecular dynamics methodology was applied to evaluate the effect of...
-
Determination of changes in viscosity of refined oil depending on the temperature (19-96 Celsius degrees).
Dane BadawczeThe rheological characteristics of the refined oil were made on the basis of the viscosity assessment using a Brookfield viscometer with an LV SC4 - 18 spindle and a shear rate of 52.8 s-1 in from temperature 19-96 °C.
-
Cognitive decline in Huntington's disease expansion gene carriers
Publikacja -
On the hat problem on a graph
PublikacjaThe topic of this paper is the hat problem in which each of n players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning....
-
Searching for Critical Conditions During Lifeboat Launching – Simulations
PublikacjaThe article describes numerical simulations of the process of lifeboat launching at the ship’s side. The research is aimed at finding the values of ship motion parameters which appear to be most dangerous for people in the lowered lifeboat due to the generated accelerations. The simplified model of ship hull motion adopted at this research stage bases on a superposition of harmonic motions with given amplitudes and periods in six...
-
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...
-
Three-fast-searchable graphs
PublikacjaIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
A Compact and Lightweight Microwave Tilt Sensor Based on an SRR-Loaded Microstrip Line
PublikacjaIn this paper, the symmetry property of split ring resonators (SRRs) is exploited to develop a tilt sensor. The sensor is composed of an SRR-loaded microstrip line operating at microwave frequencies. It is shown that the depth of notch in the reflection characteristic of the microstrip is a function of the tilt angle of the SRR. Thus, it can be used for sensing inclination. The sensor benefits from very compact size and light weight....
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Acoustic Streaming Induced by Periodic and Aperiodic Sound in a Bubbly Liquid
PublikacjaThe vortex ow which follows intense sound propagating in a bubbly liquid, is considered. The reasons for acoustic streaming are both nonlinearity and dispersion. That makes streaming especial as compared with that in a Newtonian uid. Conclusions concern the vortex ow induced in a half-space by initially harmonic or impulse Gaussian beam. The vortex ow recalls a turbulent ow with increasing in time number of small-scale vortices...
-
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...
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublikacjaWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
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...
-
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...
-
The Possibilities of Improving the Fatigue Durabilityof the Ship Propeller Shaft by Burnishing Process
PublikacjaHeavily loaded structural elements operating in a corrosive environment are usuallyquickly destroyed. An example of such an element is a ship propeller operating in a seawaterenvironment. This research presents a fatigue resistance test performed on elements operating inseawater. Different processing parameters applied on the samples in particular were compared withthe specimens whose surface had been burnished differently and...
-
An Optimized Ka-Band Low Profile Dual-Polarized Transmitarray Antenna With 2D Beam Switching
PublikacjaThis article presents an optimized dual-polarized transmitarray antenna (TA) designed for MIMO applications at the Ka-band, capable of switching beams in two directions. The antenna aperture uses a small unit cell with three layers of Taconic RF-35 dielectric substrates, which can be easily fabricated using PCB technology. The unit cell achieved a 360-degree phase shift and a transmission magnitude exceeding –0.4 dB at 28 GHz....
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Michał Tomasz Kucewicz dr
OsobyMichal 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...
-
Ruch wirowy wywoływany przez ultradźwięk w płynach z relaksacją
PublikacjaRozprawa doktorska poświęcona jest badaniu ruchu wirowego wywoływanego przez ultradźwięk w różnych modelach płynów z relaksacją. Ma ona charakter teoretyczny, jednak wykorzystanie uzyskanych dzięki niej wyników może przynieść lepsze zrozumienie ruchu wirowego wywoływanego przez siłę akustyczną. W I rozdziale rozprawy przedstawione zostały ogólne rozważania dotyczące akustyki nieliniowej. Rozdział II dotyczy ruchu wirowego wywoływanego...
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublikacjaIn the paper, we show that the incidence chromatic number of a complete k-partite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
-
3D Hand Shape Modeling for Automatic Assessing Motor Performance in Parkinson's Disease
PublikacjaIn this paper a method for hand pattern processing to create a 3D hand model is presented. By applying a complete hand armature to the model obtained, an interpolation of three motor tests for an individual Parkinson's disease patient can be performed. To obtain the 3D hand model the top view of the hand from a web cam is analyzed. The hand contour is examined to find characteristic points that allows for dividing hand image into...
-
FIRST DEGREE FINAL PROJECT [2020/21]
Kursy Online -
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...
-
The Potential of Greed for Independence
PublikacjaThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
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...
-
Michał Sobaszek dr hab. inż.
OsobyMichał Sobaszek was born in Gdansk in 1984. In the summer of 2009, he received a Master degree in Materials Engineering at Gdansk University of Technology. Currently, he is an Assistant Professor at the Faculty of Electronics at the Gdańsk University of Technology. In 2018 he was honoured with the scholarship for the outstanding young researches by the Minister of Science and Higher Education of Poland. For more than 7 years, he...
-
Justyna Szostak dr inż.
OsobyI Gdańsk University of Technology: Chair of the Rector’s Internationalization Committee (October 2020 - Present) Erasmus + Coordinator for students and staff members, Faculty of Applied Physics and Mathematics (Mar 2017 - Present) Dean's Proxy for Internationalization, Faculty of Applied Physics and Mathematics (October 2020 - Present) Coordinator of the International Relations Office of the Faculty of Applied Physics and...