Filters
total: 1150
filtered: 882
-
Catalog
Chosen catalog filters
Search results for: graph distance metric
-
Neural Graph Collaborative Filtering: Analysis of Possibilities on Diverse Datasets
Publication -
Towards explainable motion prediction using heterogeneous graph representations
Publication -
Metric entropy and digital image correlation in deformation dynamics analysis of fibre glass reinforced composite under uniaxial tension
Publication -
Dependence of the heterosis effect on genetic distance, determined using various molecular markers
Publication -
Control Theory Education in the Distance Education B.Eng. Studies at Warsaw University of Technology
Publication -
Experimental Research Concerning Hydrodynamic Clutches Controlled by Increasing Distance Between Rotors
Publication -
Two-stage procedure of building a spatial weight matrix with the consideration of economic distance
Publication -
Examining the Impact of Distance Between VSL Road Signs on Vehicle Speed Variance
PublicationVariable speed limit (VSL) is an intelligent transportation system (ITS) solution for traffic management. The speed limits can be changed dynamically to adapt to traffic conditions such as visibility and traffic volume, curvature, and grip coefficient of the road surface. The VSL traffic sign location problem and attempts to solve it using computer simulation are presented in this paper. Experiments on a selected road segment,...
-
Distance Education Centre at Gdansk University of Technology - international project and courses online.
PublicationPrzedstawiono programy Unii Europejskiej (Phare, Leonardo da Vinci,Socrates) wspomagające m.in. utworzenie Centrum Edukacji Niestacjonarnej PG oraz realizację szkoleń na odległość. Opisano przykładowe szkolenia z wykorzystaniem Internetu, które znajdują się w ofercie CEN PG.
-
Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs.
PublicationW pracy rozważono problem kolorowania grafów mieszanych, opisujący zagadnienie szeregowania zadań, w którym zależności czasowe zadań mają charakter częściowego porządku lub wzajemnego wykluczania. Dla przypadku, w którym graf zależności jest szeregowo-równoległy, podano algorytm rozwiązujący problem optymalnie w czasie $O(n^3.376 * log n)$.
-
Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing
PublicationProtection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandaris scheme) are characterized by a remarkable delay while determining the transmission paths. This in turn may have a serious impact on serving dynamic demands (characterized by relatively short duration time). As a remedy to this problem, we introduce an approach to pre-compute the sets of disjoint...
-
Affronter la distance et la séparation : l'utilisation des médias sociaux par les migrants dans leurs relations interpersonnelles
PublicationL'augmentation progressive de la mobilité, de l'interconnectivité et de l'instabilité, la transformation du travail et de l'emploi et celle de la communication (Castells, 2010) ont contribué à l’émergence d’une déracinés et séparés de leur foyer évoluent vers de nouvelles perspectives les migrants comme des sujets mobiles et interconnectés qui, grâce aux TIC, peuvent entretenir des relations et des connexions à distance les...
-
Wavelet Transform Analysis of Heart Rate to Assess Recovery Time for Long Distance Runners
PublicationThe diagnostics of the condition of athletes has become a field of special scientific interest and activity. The aim of this study was to verify the effect of a long (100 km) run on a group of runners, as well as to assess the recovery time that is required for them to return to the pre-run state. The heart rate (HR) data presented were collected the day before the extreme physical effort, on the same day as, but after, the physical...
-
Close-Distance Optical Flow Fusion Using EKF for Multirotor UAV Position Estimation
Publication -
Comparison of hydrogen bonds and diverse weak interactions of the nitro group in 2-methyl-4-nitroanilinium nitrate, bisulfate and two hexafluoridosilicates: elementary graph-set approach
PublicationCrystal structures of (H2m4na)NO3 (1), (H2m4na)HSO4 (2), (H2m4na)2SiF6 (3) and (H2m4na)2SiF6*2H2O (4), where 2m4na = 2-methyl-4-nitroaniline, are presented. Two layers of interactions occur in the structures, N—H...O/F hydrogen bonds and interactions with the nitro group. Although diverse, hydrogen-bonding patterns are compared with each other by means of interrelations among elementary graph-set descriptors and descriptors of hydrogen-bonding...
-
The issue of uncertainty of visual measurement techniques for long distance measurements based on the example of applying electric traction elements in diagnostics and monitoring
PublicationRail transport is the most economical and energy-effective in the field of land transport, in particular electrified. In order to ensure efficient and reliable operation of electrified rail transport, the issues of monitoring and diagnostics of the traction infrastructure and vehicles are extremely important. The most critical point in the transmission of electric energy to the vehicle is the sliding contact of the current collector...
-
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublicationWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
Application of Graph Theory Algorithms in Non-disjoint Functional Decomposition of Specific Boolean Functions
Publication -
Application of hydroacoustic system of distance measurement for estimating the cod codends shape at the model research station in Insko
PublicationPraca przedstawia wyniki pomiarów kształtu worków dorszowych w stacji badań modelowych Politechniki Szczecińskiej w Ińsku. Badane worki dorszowe są workamispecjalnie zaprojektowanymi do połowów selektywnych. W celu precyzyjnego pomiaru parametrów geometrycznych worków został opracowany nowy hydroakustyczny system do precyzyjnych pomiarów odległości. Zapewnia on równoczesny pomiar maksymalnie 100 różnych wymiarów w zakresie od 0.1m...
-
Site-to-site distance distribution in flexible molecules: theoretical evaluation of the donor and/or acceptor fluorescence decay function
PublicationPrzedstawiono wyrażenie teoretyczne opisujące zależność funkcji zaniku fluorescencji od rozkładu odległości P(r) pomiędzy donorami i akceptorami w giętkich molekułach dwuchromoforowych. Wyrażenie uwzględnia wiekoeksponencjalny zanik izolowanych donorów i akceptorów, a także możliwość niekompletnego oznakowania molekuł akceptorami. Przyjęto, że względne zmiany odległości donorów i akceptorów w czasie życia fluorescencji donora mogą...
-
MEASUREMENT OF EFFICIENCY OF DIDACTIC ACTIVITIES OF PUBLIC UNIVERSITIES OF TECHNOLOGY IN POLAND: DIRECTIONAL DISTANCE FUNCTION WITH UNDESIRABLE OUTPUT APPROACH
Publication -
Neural Network Subgraphs Correlation with Trained Model Accuracy
PublicationNeural Architecture Search (NAS) is a computationally demanding process of finding optimal neural network architecture for a given task. Conceptually, NAS comprises applying a search strategy on a predefined search space accompanied by a performance evaluation method. The design of search space alone is expected to substantially impact NAS efficiency. We consider neural networks as graphs and find a correlation between the presence...
-
Long-working-distance Raman system for monitoring of uPA ECR CVD process of thin diamond/DLC layers growth
PublicationW artykule przedstawiono konstrucję systemu optoelektronicznego do monitoringu ramanowskiego in-situ procesu μPA ECR CVD (ang.: Microwave Plasma Assisted Electron Cyclotron Resonance Chemical Vapour Deposition), stosowanego do osadzania cienkich warstw diamentowych i diamentopodobnych DLC. System ma budowę modułową i wyposażony jest w dedykowane sondy optyczne. Przedstawiono wyniki pomiarów testowych, potwierdzjące, że system posiada...
-
Dry bearing sliding layer transverse flexibility effects on real sliding distance for reciprocating microoscillatory movement of flatcontact surface.
PublicationW referacie omówiono wpływ właściwości mechanicznych i kształtu warstwy ślizgowej z bezsmarowego materiału łożyskowego. Wcześniej omówione i publikowane wyniki badań doświadczalnych i analizy numerycznej wyjaśniły i potwierdziły, dlaczego rzeczywista droga tarcia jest znacznie mniejsza od nominalnej w warunkach mikrooscylacji. Wyniki przeprowadzonej analizy numerycznej pozwoliły możliwie najlepiej ukształtować powierzchnię ślizgania...
-
Non-disjoint Decomposition Using r-admissibility and Graph Coloring and Its Application in Index Generation Functions Minimization
Publication -
Model silnika spalinowego w formie grafów wiązań (GW).A model of the IC engine in the form of the bond graph (BG).
PublicationPrzedstawiono uzasadnienie użycia metody grafów wiązań do do modelowania silnika spalinowego jako źródła energii w systemach energetycznych składających się z elementów o różnej naturze fizycznej, na przykład w pojazdach hybrydowych. Przedstawiono propozycję formalizacji charakterystyki silników spalinowych wynikającą z przyjętej metody modelowania. Analityczną formę charakterystyki przedstawiono jako wielowymiarową funkcję wektorową....
-
Equitable coloring of corona multiproducts of graphs
PublicationWe 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.
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(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 domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Total domination in versus paired-domination in regular graphs
PublicationA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Kolorowanie grafów z ograniczeniami na liczbę wierzchołków w określonym kolorze = Graph coloring model with restrictions on cardinalities of vertexes in particular color
PublicationW artykule rozważamy problem takiego kolorowania grafów, w którym klasy kolorów mają ograniczoną z góry moc. Zagadnie to znajduje ciekawe zastosowania praktyczne i jest naturalnym uogólnieniem problemu kolorowania grafów. W artykule ustalamy złożoność obliczeniową dla grafów pełnych $r$-dzielnych i dla kilku innych prostych klas grafów oraz dla problemu dwukolorowania.
-
Interval incidence coloring of subcubic graphs
PublicationIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
The Potential of Greed for Independence
PublicationThe 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...
-
Preface of guest editors
PublicationA special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 12th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 16-21 September 2007 in Karpacz, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, 2003 and 2005 in Karpacz. About 70 participants formed the audience of six invited lectures and 68...
-
Reconfiguring Minimum Dominating Sets in Trees
PublicationWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
Origin of the ornamented bâton percé from the Gołębiewo site 47 as a trigger of discussion on long-distance exchange among Early Mesolithic communities of Central Poland and Northern Europe
Publication -
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
Bond graph modeling of the new generation engine cooling systems = Zastosowanie metody grafów wiązań do modelowania nowej generacji układów chłodzenia silników spalinowych
PublicationW referacie szczegółowo opisano modele wymiany ciepła i przepływów w układzie chłodzenia. Metoda grafów wiązań okazała się szczególnie użyteczną dla modelowania skomplikowanych systemów energetycznych o różnych postaciach energii. Jako przykładu użyto obiegu chłodzenia silnika badawczego na hamowni silnikowej.
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublicationIn 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.
-
Preface
PublicationThis special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 13th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 18-23 September 2009 in Szklarska Poręba, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, and 2003-2007 in Karpacz. The meeting was organized by the Faculty of Mathematics, Computer...
-
Block graphs with large paired domination multisubdivision number
PublicationThe paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.
-
Parity vertex colouring of graphs
PublicationA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
Distance between the Basic Group of the Amino Acid Residue's Side Chain in Position P1of Trypsin Inhibitor CMTI-III and Asp189in the Substrate Pocket of Trypsin Has an Essential Influence on the Inhibitory Activity
Publication -
T-colorings, divisibility and circular chromatic number
PublicationLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
Optimal backbone coloring of split graphs with matching backbones
PublicationFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.
-
On-line P-coloring of graphs
PublicationFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
Some variations of perfect graphs
PublicationWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
Progress on Roman and Weakly Connected Roman Graphs
PublicationA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
Dynamic F-free Coloring of Graphs
PublicationA 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...
-
Normalized Partial Scattering Cross Section for Performance Evaluation of Low-Observability Scattering Structures
PublicationThe development of diffusion metasurfaces created new opportunities to elevate the stealthiness of combat aircraft. Despite the potential significance of metasurfaces, their rigorous design methodologies are still lacking, especially in the context of meticulous control over the scattering of electromagnetic (EM) waves through geometry parameter tuning. Another practical issue is insufficiency of the existing performance metrics,...
-
On proper (1,2)‐dominating sets in graphs
PublicationIn 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...