Filtry
wszystkich: 1643
-
Katalog
- Publikacje 1155 wyników po odfiltrowaniu
- Czasopisma 25 wyników po odfiltrowaniu
- Konferencje 19 wyników po odfiltrowaniu
- Osoby 23 wyników po odfiltrowaniu
- Wynalazki 4 wyników po odfiltrowaniu
- Projekty 2 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Kursy Online 48 wyników po odfiltrowaniu
- Wydarzenia 4 wyników po odfiltrowaniu
- Dane Badawcze 362 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: block graph
-
No-Wait & No-Idle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublikacjaIn the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. No-wait requirement enforces that the delay between operations is equal to 0. No-idle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)-coloring (IIR(1, 1)-coloring) of a graph with the minimum...
-
The Ellenbogen's "Matter as Software" Concept for Quantum Computer Implementation: II Bonding Between the C60 and X@C60 Molecules as Available Molecular Building Blocks (MBBs) for Tip-Based Nanofabrication (TBN) of Quantum Computing Devices
PublikacjaThe binding energy, BE of the X@C60-X@C60 homodimer and the X@C60-Y@C60 heterodimer resulting from the bond formation between the occupied X@C60 MBB and the C60 molecule was studied by means of semiempirical PM7 calculations, where X and Y denote atoms from H to Bi, excluding Tc and lanthanides. All possible combinations of N = 68 guest atoms were considered, which resulted in K = 2346 of different calculated dimers of (X@C60-Y@C60)...
-
Conference on Graph Theory and Discrete Geometry
Konferencje -
EuroConference on Combinatorics, Graph Theory and Applications
Konferencje -
Workshop on Computational Graph Theory and Combinatorics
Konferencje -
Workshop on Algorithms And Models For The Web Graph
Konferencje -
The Use of Ultra-Fast Gas Chromatography for Fingerprinting-Based Classification of Zweigelt and Rondo Wines with Regard to Grape Variety and Type of Malolactic Fermentation Combined with Greenness and Practicality Assessment
PublikacjaIn food authentication, it is important to compare different analytical procedures and select the best method. The aim of this study was to determine the fingerprints of Zweigelt and Rondo wines through headspace analysis using ultra-fast gas chromatography (ultra-fast GC) and to compare the effectiveness of this approach at classifying wines based on grape variety and type of malolactic fermentation (MLF) as well as its greenness...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublikacjaA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
Kacper Wereszko mgr inż.
OsobyKacper Wereszko uzyskał tytuł zawodowy magistra inżyniera w 2016 roku (kierunek: informatyka, specjalność: algorytmy i technologie internetowe), a od 2017 roku jest uczestnikiem studiów doktoranckich z dyscypliny Informatyka. Obecnie pracuje jako asystent w Katedrze Algorytmów i Modelowania Systemów. Jego zainteresowania badawcze obejmują badanie własności bezpieczeństwa w grafach, problemy dominowania w grafach oraz ich praktyczne...
-
Development and validation of an LC–MS/MS method for the determination of biogenic amines in wines and beers
PublikacjaBiogenic amines are group of organic, basic, nitrogenous compounds that naturally occur in plant, microorganism, and animal organisms. Biogenic amines are mainly produced through decarboxylation of amino acids. They are formed during manufacturing of some kind of food and beverages such as cheese, wine, or beer. Histamine, cadaverine, agmatine, tyramine, putrescine, and b-phenylethylamine are the most common biogenic amines found...
-
The accretion of the new ice layer on the surface of hexagonal ice crystal and the influence of the local electric field on this process
PublikacjaThe process of creation of a new layer of ice on the basal plane and on the prism plane of a hexagonal ice crystal is analyzed. It is demonstrated that the ordering of water molecules in the already existing crystal affects the freezing. On the basal plane, when the orientations of water molecules in the ice block are random, the arrangement of the new layer in a cubic manner is observed more frequently — approximately 1.7 times...
-
Jesień w Bibliotece PG
PublikacjaArtykuł jest podsumowaniem licznych aktywności podjętych przez Bibliotekę PG w okresie jesiennym 2023 r., ukierunkowanych na czytelnictwo, jak i wynikających z naukowo-edukacyjno-kulturalnego charakteru tej jednostki. Z zestawienia zaprezentowanych wydarzeń wyłania się obraz Biblioteki PG jako miejsca...
-
A city is not a tree: a multi-city study on street network and urban life
PublikacjaChristopher Alexander, a British-American scholar, differentiated an old (natural) city from a new (planned) one by structure. The former resembles a “semilattice”, or a complex system encompassing many interconnected sub-systems. The latter is shaped in a graph-theoretical “tree”, which lacks the structural complexity as its sub-systems are compartmentalized into a single hierarchy. This structural distinction explains why, or...
-
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,...
-
Działanie preparatu antyseptycznego Betadine (EGIS Pharmaceutical L.t.d.) na wielooporne szpitalne szczepy bakterii
PublikacjaStwierdzono silne działanie bakteriobójcze preparatu Betadine na wszystkie badane izolaty. Uzyskano redukcję liczby żywych bakterii w zawiesinie o 99,99% co jest zgodne z wymaganiami dla preparatów przeznaczonych do dezynfekcji higienicznej i chirurgicznej.
-
South African International Graph Theory Conference
Konferencje -
The relationship between phytochemical composition and biological activities of differently pigmented varieties of berry fruits; Comparison between embedded in food matrix and isolated anthocyanins.
PublikacjaThe aim of this research was to correlate the composition of phenolic compounds and bioactivities (antioxidant, cytotoxic, antigenotoxic, and influence on selected enzymatic activities) exhibited by extracts from differently pigmented raspberry (yellow and red), grape (white and red), mulberry (white and black), and currant (white, red, and black) varieties. It was presumed that phytocomplexes of the same species will be similar...
-
On a matching distance between rooted phylogenetic trees
PublikacjaThe Robinson–Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach...
-
Residual MobileNets
PublikacjaAs modern convolutional neural networks become increasingly deeper, they also become slower and require high computational resources beyond the capabilities of many mobile and embedded platforms. To address this challenge, much of the recent research has focused on reducing the model size and computational complexity. In this paper, we propose a novel residual depth-separable convolution block, which is an improvement of the basic...
-
Thickness accuracy of sash gang sawing
PublikacjaThin lamellae, corresponding to the layer components of structural glued members, i.e. 2-ply or 3-ply glued parquet, can be manufactured in re-sawing operations of kiln-dried wood blocks. These must be prepared with high dimensional accuracy and adequate surface quality following specific technical requirements for lamellae thickness variations, especially in the upper layers of the glued composite parquet. The accuracy of oak...
-
Innovative system for energy collection and management integrated within a photovoltaic module
PublikacjaThe dynamic development of battery technology and design based on the flow of lithium ions, mainly driven by the needs of the automotive industry, leads to the conclusion that these batteries are becoming a more viable alternative to traditional lead-acid batteries. Their use is driven by the ability to quickly charge and discharge, a higher durability, maintenance-free operation, much smaller dimensions and lighter weight. The...
-
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
PublikacjaWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublikacjaWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Brushing with additional cleaning restrictions
PublikacjaIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
Interfacial adhesion evaluation in (low-density polyethylene)/elastomer blends
PublikacjaLow-density polyethylene (LDPE) with different elastomers at a ratio of 50/50 wt% blends was prepared by using a co-rotating twin-screw extruder. Three kinds of elastomers were used: ground tire rubber (GTR), partially crosslinked butyl rubber (KalarVR ), and styrenebutadiene- rubber block copolymer (SBS; KratonVR ). For better characterization of interaction between polyethylene and elastomer, influence of the type of elastomer on...
-
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...
-
Leader election for anonymous asynchronous agents in arbitrary networks
PublikacjaWe consider the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents is by exploiting asymmetries in their initial positions in the graph. Agents do not know the graph or their positions in it, hence they must gain this knowledge by navigating in the graph...
-
Nonrelational Databases DE 2024_2025
Kursy OnlineThis course discusses three types of non-relational databases (i.e., document, graph, and key-value). The course is aimed at students in the 5th semester of data engineering.
-
Nonrelational Databases DE 2023_2024
Kursy OnlineThis course discusses three types of non-relational databases (i.e., document, graph, and key-value). The course is aimed at students in the 5th semester of data engineering.
-
Lean Six Sigma Black Belt
Kursy Online -
Andrzej Okuniewski dr inż.
OsobyWykształcenie 2010-2014: Katedra Chemii Nieorganicznej, Wydział Chemiczny, Politechnika Gdańskadoktor nauk chemicznych (nauki chemiczne – chemia, chemia nieorganiczna) 2009-2010: Wydział Chemiczny, Politechnika Gdańskamagister chemii (chemia stosowana) 2005-2009: Wydział Chemiczny, Politechnika Gdańskainżynier chemik (chemia stosowana) 2002-2005: II Liceum Ogólnokształcące im. Władysława Pniewskiego w Gdańskuprofil biologiczno-chemiczno-fizyczny...
-
Burnout as a State: Random-Intercept Cross-Lagged Relationship Between Exhaustion and Disengagement in a 10-Day Study [Response to Letter]
PublikacjaWe are writing in response to the Letter to the Editor by Block, Bair, and Carillo regarding our study, which took a multilevel approach to examine cross-lagged and co-existing relationships between exhaustion and disengagement, measured daily for ten consecutive working days using the Oldenburg Burnout Inventory (OLBI). We assessed the job burnout symptoms using only eight items, all of them worded negatively. Following Block,...
-
Effect of excitation intensity on slope stability assessed by a simplified approach
PublikacjaThe paper concerns the selection of a design accelerograms used for the slope stability assessment under earthquake excitation. The aim is to experimentally verify the Arias Intensity as an indicator of the excitation threat to the slope stability. A simple dynamic system consisting of a rigid block on a rigid inclined plane subjected to horizontal excitation is adopted as a slope model. Strong ground motions recorded during earthquakes...
-
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...
-
Southeastern International Conference on Combinatorics, Graph Theory, and Computing
Konferencje -
Kyoto International Conference on Computational Geometry and Graph Theory
Konferencje -
International Workshop on Graph-Theoretic Concepts in Computer Science
Konferencje -
The International Workshop on Algorithms and Graphs
Konferencje -
Using Container Structures in Architecture and Urban Design
PublikacjaAbstract. The paper presents the use of shipping containers in architecture and urban design. Even today, houses and apartments are still too expensive. Since 1923 architects have been improving the living conditions of citizens by building very simple, repeatable forms. With prefabrication technology it became possible to build quicker, causing house prices to decrease. Apartments in block of flats became affordable to more and...
-
Computational algorithm for the analysis of mechatronic systems with distributed parameter elements
PublikacjaThe paper presents a systematic computational package for analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The algorithm is based on the transfer function method (DTFM). With this algorithm, a bond graph technique for the modelling is developed to simplify computations. Analysis of different systems requires only changing the inputs data in the form of the bond graph diagram
-
Innovative Gathering and Energy Management System Integrated within PV Module
PublikacjaThe dynamic development of battery technology and design based on the flow of lithium ions, mainly driven by the needs of the automotive industry leads to the Conclusion That they are becoming a more viable alternative to traditional lead-acid batteries. Their use is driven by the ability it quickly charge and discharge times higher durability, maintenance-free operation and much smaller dimensions as well as weight. The emergence...
-
Non-relational Databases 2022/2023
Kursy OnlineThis course discusses the three types of non-relational databases (i.e. document, graph, key-value). The course is aimed at students in the 7th semester of computer science.
-
Non-relational Databases 2023/2024
Kursy OnlineThis course discusses the three types of non-relational databases (i.e. document, graph, key-value). The course is aimed at students in the 7th semester of computer science.
-
Non-relational Databases 2024/2025
Kursy OnlineThis course discusses the three types of non-relational databases (i.e. document, graph, key-value). The course is aimed at students in the 7th semester of computer science.
-
Scanning networks with cactus topology
PublikacjaThe family of Pursuit and Evasion problems is widelystudied because of its numerous practical applications,ranging from communication protocols to cybernetic andphysical security. Calculating the search number of a graphis one of most commonly analyzed members of this problemfamily. The search number is the smallest number of mobileagents required to capture an invisible and arbitrarily fastfugitive, for instance piece of malicious...
-
Modelling of Mechatronic Systems with Distributed Parameter Components
PublikacjaThe paper presents an uniform, port-based approach to modelling of both lumped and distributed parameter systems. Port-based model of distributed system has been defined by application of the bond graph methodology and the distributed transfer function method (DTFM). The proposed method of modelling enables to formulate input data for computer analysis by application of the DTFM. The computational package for the analysis of complex...
-
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...
-
Dynamics of S-unimodal maps used in population modeling.
Dane BadawczeS-unimodal maps are maps of the interval with negative Schwarzian derivative and having only one turning point (such that the map is increasing to the left of the turning point and decreasing to the right of it). Theory of S-unimodal maps is now a well-developed branch of discrete dynamical systems, including famous Singer theorem which implies existence...
-
Scheduling of compatible jobs on parallel machines
PublikacjaThe dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...
-
Nonrelational Databases DE 2022_2023
Kursy OnlineWithin this course the four types of non-relational databases (i.e. document, graph, key-value and column-oriented) are discussed. The course is aimed at students of the 5th semester of data engineering.