Filtry
wszystkich: 1750
-
Katalog
- Publikacje 1360 wyników po odfiltrowaniu
- Czasopisma 8 wyników po odfiltrowaniu
- Konferencje 1 wyników po odfiltrowaniu
- Osoby 25 wyników po odfiltrowaniu
- Wynalazki 3 wyników po odfiltrowaniu
- Projekty 2 wyników po odfiltrowaniu
- Kursy Online 8 wyników po odfiltrowaniu
- Wydarzenia 11 wyników po odfiltrowaniu
- Dane Badawcze 332 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: g-quadruplex stabilization
-
Carbon nanotubes chemically derivatized with rebox systems as mediators for biofuel cell applications
PublikacjaEnzymatyczne bioogniwa paliwowe to urządzenia wykorzystujące enzymy do przemiany energii chemicznej w elektryczną. Zyskana w ten sposób energia może służyć do zasilania wszczepialnych urządzeń (np. czujników glukozy, rozruszników serca).Przedstawiono sposób otrzymywania i właściwości bioelektrod, w których wykorzystano nanorurki węglowe modyfikowane mediatorami enzymatycznych reakcji redoks. Do nanorurek przyłączano zarówno mediatory...
-
Bondage number of grid graphs
PublikacjaThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
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...
-
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...
-
Plasma cell myeloma - Male, 73 - Tissue image [11290630017282651]
Dane BadawczeThis is the histopathological image of HEMATOPOIETIC AND RETICULOENDOTHELIAL SYSTEMS tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
Plasma cell myeloma - Male, 73 - Tissue image [11290630017283871]
Dane BadawczeThis is the histopathological image of HEMATOPOIETIC AND RETICULOENDOTHELIAL SYSTEMS tissue sample obtained in Medical University Gdańsk and deposited in ZMDL-GUMED. The sample image was taken using: Pannoramic 250 3DHistech slide scanner (20x magnification) and saved to DICOM format.
-
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...
-
Inorganic membrane: a game changer for gas separation and purification
PublikacjaThis review explores the advancements and remaining challenges in inorganic membrane science, particularly focusing on their potential for industrial applications. It delves into the fundamental principles of inorganic membrane design, fabrication, and characterization techniques. The review also critically analyzes key challenges faced by inorganic membranes, such as physical aging, plasticization, defective formation, and fouling....
-
Liczba wiązania grafów krawędziowych
PublikacjaLiczba wiązania b(G) grafu G jest mocą najmniejszego zbioru krawędzi, których usunięcie z grafu G prowadzi do grafu o liczbie dominowania większej niż gamma(G). Pokazujemy ogólne ograniczenia dla liczby wiązania grafu krawędziowego dowolnego grafu spójnego i grafu pełnego. Ponadto rozważamy liczbę wiązania grafów krawędziowych dla szczególnych przypadków drzew.
-
Spectroscopic studies on physicochemical properties of selected unsymmetrical bisacridine derivatives and NMR analysis of their interactions with the model sequence Pu22 aided by molecular dynamics
PublikacjaIn recent years, new promising acridine derivatives have appeared, belonging to the unsymmetrical bisacridines (UAs) family with high anticancer activity. Both their physicochemical properties and their mechanism of action at the molecular level have not been thoroughly analyzed so far. Four derivatives were selected for the study, termed as: C-2028, C-2041, C-2045 and C-2053. The first aim of this work was to determine the protonation...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
FFT spectrum based matching algorithm for activedynamic thermography
PublikacjaIn Active Dynamic thermography (ADT) sequences of consecutive temperature distributions are analyzed. In biomedical applications of ADT, the problems of a patient's movements in front of a thermal camera should be eliminated before data analysis. Complete mechanical stabilization of the patients is impossible due to natural voluntary and involuntary moves caused by pulse breathing, etc. This paper presents a simple and efficient...
-
Wpływ równości nawierzchni i dynamicznego oddziaływania pojazdów ciężkich na trwałość zmęczeniową nawierzchni podatnych
PublikacjaPodczas ruchu pojazdu obserwuje się odchylenia nacisków osi pojazdów od nacisku statycznego, co jest spowodowane nierównościami nawierzchni. Dynamiczne obciążenia pojazdów w większym stopniu wytężają konstrukcję nawierzchni drogowej. Rozkład obciążeń dynamicznych ma kształt rozkładu normalnego i jest opisywany poprzez obciążenie statyczne oraz wskaźniki dynamiczne DI lub DLC. Wraz z pogorszeniem równości i zwiększeniem prędkości...
-
Postępy technik w elektronice
Kursy OnlinePostępy technik w elektronice [moduł dyscyplinarny, do wyboru Grupa A] Prowadzący: Prof. Marcin Gnyba, Prof. Małgorzata Jędrzejeska-Szczerska, Prof. Piotr Jasiński, Prof. Janusz Smulko, Prof. Sebastian Molin, Prof. Łukasz Kulas Terminy: 15.04 (g. 14-16), 16.04 (g. 12-14), 14.05 (g. 13-15), 19.05 (g.17-19), 26.05 (g. 17-19) 27.05 (g.10-12 ) 28.05 (10-13) Tematyka realizowanego przedmiotu obejmuje: Czujniki elektroniczne...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublikacjaAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Czujniki wielkości nieelektrycznych [moduł dyscyplinarny, do wyboru Grupy A i B] 2022/2023
Kursy OnlineProwadzący: dr hab. inż. Grzegorz Lentka, prof. PG Terminy: ( 3 godz. x 5 spotkań online): 19.11 (sob.) g. 9:15 – 11:45 (3x 45 min + 15 min przerwy) 20.11 (ndz.) g. 9:15 – 11:45 (3x 45 min + 15 min przerwy) 17.12 (sob.) g. 9:15 – 11:45 (3x 45 min + 15 min przerwy) 18.12 (ndz.) g. 9:15 – 11:45 (3x 45 min + 15 min przerwy) 14.01 (sob.) g. 12:00 do 14:30 (3x 45 min + 15 min przerwy) Tematyka realizowanego przedmiotu obejmuje: Wprowadzenie...
-
CdWO/sub 4/ crystal in gamma-ray spectrometry
Publikacja -
Enhanced sunlight photo-catalytic performances of ZnO/ZnNb2O6/Nb2O5 composites for organic pollutant degradation
Publikacja -
Influence of geometry and surface morphology of the U-tube on the fluid flow in the range of various velocities
Publikacja -
Badania eksperymentalne transformatora hybrydowego jako kondycjonera napięcia w sieciach typu TN
PublikacjaArtykuł dotyczy układu dystrybucyjnego transformatora hybrydowego (DTH) przeznaczonego do zastosowania w sieciach typu TN. Opisano w nim sposoby podłączenia przewodu neutralnego do układu DTH. W dalszej części artykuł zawiera opis skonstruowanego modelu laboratoryjnego o mocy 16 kVA wraz z zastosowanym algorytmem sterowania. Ponadto przedstawiono wyniki badań eksperymentalnych, ze szczególnym uwzględnieniem oceny dokładności stabilizacji...
-
A Reaction of Thioamides with Zinc Ammoniates Leading to Simple Amidines. Discovery of a New Zwitterionic Monomethylamidine
PublikacjaThe reaction of thioamides with the R1R2N-ZnCl ammoniates leads to N-mono-, N,N'-di-, N,N-disubstituted, and unsubstituted amidines with high concns. of amines in abs. ethanol. The efficient direct formation of the N,N'-dimethylamidine can be explained by a greater reactivity of methylamine compared with dimethylamine. Discovery of a new zwitterion (induced by a carbonyl oxygen) suggests that the stabilization in the thymine...
-
Convenient Syntheses of N-Methylthioamides: A Migration of the H2S Molecule in the Thioamide-nitrile System
PublikacjaThe reaction of thioamides with the R1R2N-ZnCl ammoniates leads to N-mono-, N,N'-di-, N,N-disubstituted, and unsubstituted amidines with high concns. of amines in abs. ethanol. The efficient direct formation of the N,N'-dimethylamidine can be explained by a greater reactivity of methylamine compared with dimethylamine. Discovery of a new zwitterion (induced by a carbonyl oxygen) suggests that the stabilization in the thymine...
-
Modeling of performance and safety of a multi-task unmanned autonomous maritime vehicle = Modelowanie ruchu i bezpieczeństwa wielozadaniowego bezzałogowego autonomicznego pojazdu wodnego
PublikacjaAt the beginning of the paper the aim of research is presented. Then the method is introduced. Next, the unmanned autonomous maritime vehicle is briefly described. The following chapter concerns a model of vehicle performance including the ballasting and motion. Some information on an integrated steering, positioning and stabilization system of the vehicle is briefly presented in the paper. Such the system enables to obtain a fully...
-
Synthesis of Trehalose by the Erythritol-Producing Yeast Yarrowia lipolytica Co-Displaying Maltooligosyltrehalose Synthase and Maltooligosyltrehalose Trehalohydrolase
PublikacjaIndustrial trehalose production faces economic challenges with costly enzyme preparations, prompting the exploration of eco-friendly alternatives. Here, we established a coupled functional sugar production line leveraging erythritolproducing cells as an innovative enzyme preparation for trehalose synthesis. The erythritol-producing Yarrowia lipolytica was modified to express a fusion protein consisting of maltooligosyltrehalose synthase...
-
A Strategy to Locate Fixed Points and Global Perturbations of ODE’s: Mixing Topology with Metric Conditions
PublikacjaIn this paper we discuss a topological treatment for the planar system z' = f (t, z) + g(t, z) where f and g are T -periodic in time and g(t, z) is bounded. Namely, we study the effect of g(t, z) in two different frameworks: isochronous centers and time periodic systems having subharmonics. The main tool employed in the proofs consists of a topological strategy to locate fixed points in the class of orientation preserving embedding...
-
Measuring Tilt with an IMU Using the Taylor Algorithm
PublikacjaThis article addresses the important problem of tilt measurement and stabilization. This is particularly important in the case of drone stabilization and navigation in underwater environments, multibeam sonar mapping, aerial photogrammetry in densely urbanized areas, etc. The tilt measurement process involves the fusion of information from at least two different sensors. Inertial sensors (IMUs) are unique in this context because...
-
Potential fertilizing properties of sewage sludge treated in the Sludge Treatment Reed Beds (STRB)
PublikacjaIn research the fertilizer value of sludge from reed beds is evaluated based on the sampling sludge on different depths from 4 Danish STRB after long periods of stabilization. The dewatering efficiency of sewage sludge in the STRB is comparable to mechanical dewatering. The long-term stabilization of sewage sludge progressively decreases the concentration of organic matter due to the process of humification. The aim of the work...
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Global defensive secure structures
PublikacjaLet S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...
-
Effect of particle size and weight fraction of SiC on the mechanical, tribological, morphological, and structural properties of Al-5.6Zn-2.2Mg-1.3Cu composites using RSM: fabrication, characterization, and modelling
Publikacja -
Corrigendum to “Blood pressure disturbances and endothelial dysfunction markers in children and adolescents with type 1 diabetes” [Atherosclerosis 237 (2014) 129–134]
Publikacja -
Dispersing hydrophilic nanoparticles in hydrophobic polymers: HDPE/ZnO nanocomposites by a novel template-based approach
Publikacja -
Validation of atmospheric aerosols sampling in equivalent fractions
PublikacjaPhysical properties and chemical composition of atmospheric aerosols are of extreme importance, in many fields of interest, namely the Environment even with legal implications. Atmospheric sampling poses inherent problems with consequent demands on sampling optimisation, with sampling strategies requiring validation. In this work a study was conducted aiming at validating the collection of atmospheric aerosols in equivalent fractions....
-
CMS Physics Technical Design Report, Volume II: Physics Performance
Publikacja -
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...
-
Equitable coloring of corona multiproducts of graphs
PublikacjaWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
-
Diffusible hydrogen content in deposited metal of multilayer welded joints
PublikacjaThe article describes manufacturing technology of multilayer joints in terms of control the diffusible hydrogen content. Diffusible hydrogen content in deposited metal for multilayer welded joints made of covered rutile electrodes or covered cellulosic and basic electrodes was determined. It was found that after four beads, the diffusible hydrogen content decreases in the case of the first technology from 36 ml/100 g to 18 ml/100...
-
Finding small-width connected path decompositions in polynomial time
PublikacjaA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
Lattice-commensurate skyrmion texture in a centrosymmetric breathing kagome magnet
PublikacjaSkyrmion lattices (SkL) in centrosymmetric materials typically have a magnetic period on the nanometer-scale, so that the coupling between magnetic superstructures and the underlying crystal lattice cannot be neglected. We reveal the commensurate locking of a SkL to the atomic lattice in Gd3Ru4Al12 via high-resolution resonant elastic x-ray scattering (REXS). Weak easy-plane magnetic anisotropy, demonstrated here by a combination...
-
ZAWARTOŚĆ CUKRÓW W SOKACH DRZEWNYCH Z TERENU PODKARPACIA
PublikacjaOznaczono zawartość cukrów w sokach drzewnych sześciu gatunków drzew rosnących na terenie Podkarpacia. Materiał doświadczalny stanowiły soki z drzew gatunków: brzoza zwisła in. brodawkowata (Betula pendula Roth.), brzoza omszona (Betula pubescens Ehrh.), grab pospolity (Carpinus betulus L.), klon zwyczajny (Acer platanoides L.), klon jesionolistny (Acer negundo L.) oraz wierzba biała (Salix alba L.). Analizę jakościową cukrów przeprowadzono...
-
Third harmonic generation studies of 1.06 μm Nd:YAG laser beam in Li2SO4–MgO–P2O5 glass system-influence of CuO
Publikacja -
Sleep structure in adult sleep bruxers - a polysomnographic study
Publikacja -
Studies of scintillation light nonproportionality of ZnSe(Te), CsI(Tl) and YAP(Ce) crystals using heavy ions
Publikacja -
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Regularity of weak solutions for aclass of elliptic PDEs in Orlicz-Sobolev spaces
PublikacjaWe consider the elliptic partial differential equation in the divergence form $$-\div(\nabla G(\nabla u(x))) t + F_u (x, u(x)) = 0,$$ where $G$ is a convex, anisotropic function satisfying certain growth and ellipticity conditions We prove that weak solutions in $W^{1,G}$ are in fact of class $W^{2,2}_{loc}\cap W^{1,\infty}_{loc}$.
-
?? of the Sky? - automated search for fast optical transients over the whole sky
Publikacja -
Ibrutinib versus temsirolimus: 3-year follow-up of patients with previously treated mantle cell lymphoma from the phase 3, international, randomized, open-label RAY study
Publikacja -
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...
-
An investigation of selected monoaromatic hydrocarbons released from the surface of polystyrene lids used in coffee-to-go cups
PublikacjaA consumer trend towards the fast preparation of beverages has increased the popularity of hot beverages (especially coffee and tea) available in disposable containers called coffee-to-go cups with fitted polystyrene lids. Lids in contact with hot beverages may release low molecular weight organic compounds into the gaseous phase causing direct exposure of consumers to these compounds during drinking. The paper describes in detail...