Search results for: MECHANIZMY TYPU SET - Bridge of Knowledge

Search

Search results for: MECHANIZMY TYPU SET

Search results for: MECHANIZMY TYPU SET

  • Framework for extracting rails and setting-out railway line axis based on UAV photogrammetric measurements

    Open Research Data
    open access - series: Algorithms

    Technical diagnostics enables assessing the current technical condition of a railway line and adjacent infrastructure, and to forecast its changes over a specific time horizon. One of its elements is the periodic monitoring of rail position and their geometry. The data set presents a new framework for the setting-out of a railway track axis. The process...

  • Impedance spectra of RC model as a result of testing pulse excitation measurement method

    Open Research Data
    open access

    The impedance spectrum of RC model object obtained using pulse excitation EIS impedance spectrosocpy measurement method. The 1V voltage pulse excitation duration was set to 0.1s and the total acqusition time was set to 1000s. The object under test was built using RC components connected as Baunier model of anticorrosion coating with the following components...

  • Debata nt. zróżnicowania systemowego szkolnictwa wyższego

    Events

    29-11-2018 13:15 - 29-11-2018 14:30

    Debata w ramach projektu badawczego EXCELLENCE (Doskonałość naukowa: konkurencyjność, mierzalność, umiędzynarodowienie (od badań empirycznych do reform szkolnictwa wyższego) w Programie DIALOG (2016-2018).

  • On the ratio between 2-domination and total outer-independent domination numbers of trees

    A 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...

    Full text to download in external service

  • Wpływ nadmiarowych danych wejściowych na jakość map rozbieżności pozyskanych za pomocą układu pięciu kamer w konfiguracji EBMCS

    Artykuł dotyczy zastosowania układu kamer typu EBMCS (Equal Baseline Multiple Camera Set) składającego się z kamery centralnej oraz kamer bocznych. Na podstawie zdjęć wykonanych za pomocą tego układu można otrzymać mapy rozbieżności (ang. disparity map), które pozwalają na określenie odległości od kamer do obiektów znajdujących się w ich polu widzenia. Mapy te są wyższej jakości niż mapy otrzymane za pomocą kamery stereoskopowej....

    Full text available to download

  • Aneta Łuczkiewicz prof. dr hab. inż.

    I conduct research on the adaptive abilities of microorganisms and their potential use in supporting technological processes. I combine environmental engineering with elements of biomedical and materials engineering. I am interested in innovative methods for detecting clinically significant microorganisms in aquatic environments (so-called wastewater-based epidemiology) and advanced and practical solutions in the water management...

  • Krzysztof Lipiński dr hab. inż.

  • Anna Golijanek-Jędrzejczyk dr inż.

  • Marek Kowalewski dr

    People

  • On proper (1,2)‐dominating sets in graphs

    Publication

    In 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...

    Full text to download in external service

  • On trees with double domination number equal to 2-outer-independent domination number plus one

    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 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...

    Full text to download in external service

  • Modelowanie dynamiki odbieraka prądu pojazdu kolejowego do celów diagnostycznych

    Publication

    Niewłaściwa współpraca odbieraka prądu i sieci trakcyjnej, w trudnych warunkach lokalnych, może prowadzić do uszkodzenia sieci trakcyjnej i pantografu. W ramach rozwoju metod monitoringu i diagnostyki dla tych podsystemów, tworzone są nowe i dokładniejsze narzędzia symulacyjne, których zakres obejmuje modelowanie zarówno napowietrznej sieci trakcyjnej i pantografu, a także ich dynamicznego oddziaływania. Głównym celem jest dokładniejsza...

    Full text available to download

  • Unicyclic graphs with equal total and total outer-connected domination numbers

    Publication

    - ARS COMBINATORIA - Year 2015

    Let 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...

    Full text to download in external service

  • Total Domination Versus Domination in Cubic Graphs

    Publication

    A 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...

    Full text available to download

  • Global defensive sets in graphs

    In 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...

    Full text available to download

  • On trees with double domination number equal to total domination number plus one

    Publication

    A 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,...

    Full text available to download

  • Hybrid no-signaling-quantum correlations

    Publication

    - NEW JOURNAL OF PHYSICS - Year 2022

    Fundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term HNSQ in the...

    Full text available to download

  • General Genetics QUIZZ

    e-Learning Courses
    • A. Stanisławska-Sachadyn

    Celem wykładu będzie zapoznanie Studentów z najważniejszymi odkryciami, prawami i terminami genetyki. Wykład będzie obejmował kluczowe zagadnienia genetyki: zasady dziedziczenia cech i chorób, mechanizmy regulacji ekspresji genów i mechanizmy zmienności genetycznej. Wykład będzie kładł duży nacisk  na wyjaśnienie, szczególnie istotnego dla biotechnologów, molekularnego podłoża dziedziczności, zmienności genetycznej i regulacji...

  • Doppler blood flow recordings

    Open Research Data
    open access

    Vital signals registration plays a grate role in biomedical engineering and education process. Well acquired data allow future engineers to observe certain physical phenomenons as well learn how to correctly process and interpret the data. This data set was designed for students to learn about Doppler phenomena and to demonstrate correctly and incorrectly...

  • Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g tori

    Open Research Data
    open access

    Morse–Smale diffeomorphisms, structurally stable and having relatively simple dynamics, constitute an important subclass of diffeomorphisms that have been 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...

  • Systemy fotowoltaiczne

    e-Learning Courses
    • J. Szostak

    Budowa instalacji fotowoltaicznych typu on-grid i stand-alone. Podstawowe problemy związane z pracą tego typu układów. Zdobycie wiedzy umożliwiającej projektowanie instalacji fotowoltaicznych i ich odpowiednie usytuowanie w przestrzeni oraz analizę ekonomiczną projektu. Poznanie programu PVSol Premium. 15h wykład+15h projekt

  • Photovoltaic systems summer 2023/24

    e-Learning Courses
    • J. Szostak

    Budowa instalacji fotowoltaicznych typu on-grid i stand-alone. Podstawowe problemy związane z pracą tego typu układów. Zdobycie wiedzy umożliwiającej projektowanie instalacji fotowoltaicznych i ich odpowiednie usytuowanie w przestrzeni oraz analizę ekonomiczną projektu. Poznanie programu PVSol Premium. 15h wykład+15h projekt

  • SIECI KOMPUTEROWE - (EiT) 2022/23

    e-Learning Courses
    • M. Hoeft
    • J. Grochowski
    • K. Gierłowski
    • K. Nowicki

    Student zapoznaje się z warstwowymi architekturami logicznymi sieci, klasyfikuje podstawowe problemy komunikacji sieciowej oraz identyfikuje i analizuje wybrane protokoły i mechanizmy sieci LAN i WAN

  • SIECI KOMPUTEROWE - (EiT) 2023/24

    e-Learning Courses
    • M. Hoeft
    • J. Grochowski
    • W. Gumiński
    • K. Gierłowski
    • K. Nowicki

    Student zapoznaje się z warstwowymi architekturami logicznymi sieci, klasyfikuje podstawowe problemy komunikacji sieciowej oraz identyfikuje i analizuje wybrane protokoły i mechanizmy sieci LAN i WAN

  • The convex domination subdivision number of a graph

    Publication

    Let 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...

    Full text available to download

  • Projekt systemu sterowania dwukołowym robotem balansującym

    W niniejszym artykule rozważony został problem sterowania dwukołowym robotem balansującym. Celem zaprezentowanych prac było zaprojektowanie systemu sterowania tego typu obiektem z wykorzystaniem metod nowoczesnej teorii sterowania. W ramach syntezy, bazując na wyprowadzonym w oparciu o zasady dynamiki Newtona modelu, dobrana została struktura systemu sterowania w postaci regulatora wykorzystującego sprzężenie zwrotne od stanu oraz...

    Full text available to download

  • Rhetoric at school - a selection of the syllabi from the Academic Gymnasium in Gdańsk - transcription and photographs

    Open Research Data
    open access

    The following data set comprises a transcription (in txt and docx formats) and photographs (in jpg format) of the selected records from the Latin-language teaching syllabi termed 'Typus' or 'Catalogus lectionum' (an abbreviated title). Rhetoric is the main thematic criterion behind this choice. Various topics related to rhetoric have been taught not...

  • Aleksandra Giełdoń - Paszek dr hab.

    People

    Doktor habilitowany w dziedzinie nauk o sztuce, historyk sztuki. Studiowała historię sztuki na Wydziale Filozoficzno-Historycznym Uniwersytetu Jagiellońskiego w Krakowie. W roku 2002 na Wydziale Historycznym tejże uczelni uzyskała tytuł doktora nauk humanistycznych w zakresie nauk o sztuce na podstawie dysertacji: Malarstwo pejzażowe a szkolnictwo artystyczne w Polsce (do 1939 roku). W roku 2015 została doktorem habilitowanym w...

  • On trees with equal domination and total outer-independent domination numbers

    Publication

    For 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...

  • A lower bound on the total outer-independent domination number of a tree

    Publication

    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 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,...

    Full text available to download

  • On trees with equal 2-domination and 2-outer-independent domination numbers

    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 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...

    Full text available to download

  • Graphs with equal domination and certified domination numbers

    Publication

    - Opuscula Mathematica - Year 2019

    A 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...

    Full text available to download

  • Mercury intrusion porosimetry (MIP) results of cement pastes containing Bi2O3/Gd2O3 and silica-coated Bi2O3/Gd2O3 structures

    Open Research Data

    Mercury intrusion porosimetry (MIP) data - curves of cement pastes containing Bi2O3/Gd2O3 and silica-coated Bi2O3/Gd2O3 structures

  • Analysis of spatial changes in the town of Puck with its surroundings in the years 1926, 1940, 1974, 1985, 2000, 2020 on the basis of topographic maps using the BDOT10K database

    Open Research Data
    open access

    Spatial changes over time are extremely valuable due to the possibility of modeling forecasts. This dataset shows how Puck has evolved over a specific period of time. Thanks to this presentation of the data set, it is possible to easily recreate the appearance of the city in particular years. 

  • The voltage across and current through the RC model object tested using pulse excitation in impedance spectroscopy measurement method

    Open Research Data
    open access

    The raw data (voltage across and current through RC model object ) obtained using pulse excitation EIS impedance spectroscopy measurement method. The data was acquired using 12-bit ADC (LTC1420) with sampling frequency changed in time segments. The 1V voltage pulse excitation duration was set to 0.1s and the total acqusition time was set to 1000s. For...

  • An upper bound on the 2-outer-independent domination number of a tree

    Publication

    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 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,...

    Full text to download in external service

  • Komputerowe wspomaganie wytwarzania (CAM), PG_00055396_MiBM_2023/2024 zim.

    e-Learning Courses
    • P. Sender
    • D. Zieliński
    • M. Deja
    • B. Ścibiorski

    Poznanie podstawowych technik komputerowo wspomaganego wytwarzania, zwłaszcza programowania obrabiarek CNC z wykorzystaniem systemów typu CAM.

  • Data on LEGO sets release dates and worldwide retail prices combined with aftermarket transaction prices in Poland between June 2018 and June 2023

    Publication

    - Data in Brief - Year 2024

    The dataset contains LEGO bricks sets item count and pricing history for AI-based set pricing prediction. The data spans the timeframe from June 2018 to June 2023. The data was obtained from three sources: Brickset.com (LEGO sets retail prices, release dates, and IDs), Lego.com official web page (ID number of each set that was released by Lego, its retail prices, the current status of the set) and promoklocki.pl web page (the retail...

    Full text available to download

  • An upper bound on the total outer-independent domination number of a tree

    Publication

    A 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...

    Full text available to download

  • XRD results of melamine sponges impregnated by DES

    Open Research Data

    The set includes raw data from XRD analysis of pure melamine sponge and melamine sponges impregnated by:- Eucalyptol:Menthol (1:1)- Eucalyptol:Menthol (1:2)- Eucalyptol:Menthol (1:3)- Eucalyptol:Menthol (1:4)- Eucalyptol:Menthol (1:5)- Thymol:Menthol (1:1)

  • General Genetics, I stopień Biotechnologia

    e-Learning Courses
    • A. Stanisławska-Sachadyn

    Celem wykładu będzie zapoznanie Studentów z najważniejszymi odkryciami, prawami i terminami genetyki. Wykład będzie obejmował kluczowe zagadnienia genetyki: zasady dziedziczenia cech i chorób, mechanizmy regulacji ekspresji genów i mechanizmy zmienności genetycznej. Wykład będzie kładł duży nacisk  na wyjaśnienie, szczególnie istotnego dla biotechnologów, molekularnego podłoża dziedziczności, zmienności genetycznej i regulacji...

  • General Genetics

    e-Learning Courses
    • A. Stanisławska-Sachadyn

    Celem wykładu będzie zapoznanie Studentów z najważniejszymi odkryciami, prawami i terminami genetyki. Wykład będzie obejmował kluczowe zagadnienia genetyki: zasady dziedziczenia cech i chorób, mechanizmy regulacji ekspresji genów i mechanizmy zmienności genetycznej. Wykład będzie kładł duży nacisk  na wyjaśnienie, szczególnie istotnego dla biotechnologów, molekularnego podłoża dziedziczności, zmienności genetycznej i regulacji...

  • 2-outer-independent domination in graphs

    Publication

    We 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,...

    Full text available to download

  • An upper bound for the double outer-independent domination number of a tree

    Publication

    A 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...

    Full text available to download

  • Strength testing machine results

    Open Research Data
    embargo

    The aim of the research project is to determine the rotational stiffness of the connection between the purlin and the part of the truss top chord. The attached files are referred to the forces and displacements obtained from the strength testing machine (two sensors). The 16 specimens were tested on the experimental set up.

  • Sliding friction of alumina (Al2O3) with friction induced vibrations

    Open Research Data
    open access

    Test files containing data on experiments in self mated sliding contact of alumina Al2O3 lubricated with either water or paraffin oil. Tests run in variable load/velocity conditions and with different dynamic settings of the test rig (PT-3 tribometer). The aim of the research was to attempt in finding correlations between the dynamic characteristics...

  • Time series of Doppler blood flow recordings

    Open Research Data
    open access

    Vital signals registration plays a grate role in biomedical engineering and education process. Well acquired data allow future engineers to observe certain physical phenomenons as well learn how to correctly process and interpret the data. This data set was designed for students to learn about Doppler phenomena and to demonstrate correctly and incorrectly...

  • Weakly convex domination subdivision number of a graph

    Publication

    - FILOMAT - Year 2016

    A 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...

    Full text available to download

  • System for automatic singing voice recognition

    W artykule przedstawiono system automatycznego rozpoznawania jakości i typu głosu śpiewaczego. Przedstawiono bazę danych oraz zaimplementowane parametry. Algorytmem decyzyjnym jest algorytm sztucznych sieci neuronowych. Wytrenowany system decyzyjny osiąga skuteczność ok. 90% w obydwu kategoriach rozpoznawania. Dodatkowo wykazano przy pomocy metod statystycznych, że wyniki działania systemu automatycznej oceny jakości technicznej...

  • Molecular geometry of phenylboronic acid

    Open Research Data
    open access

    Data presents molecular geometry of the ground singlet state of phenylboronic acid. The geometry was obtained via DFT calculations using Becke–Lee–Yang–Parr density functional (B3LYP) with the balanced polarized triple-zeta def2-TZVP basis set. Geometry is provided in the XYZ file format.