Wyniki wyszukiwania dla: TRANSITION NETWORK GRAPHS

• Multimodal Network Based Graphs of Primitives Storage Concept for Web Mining CBIR

  Publikacja

  • T. Michno
  • R. Deniziak

  - Rok 2023

  Pełny tekst do pobrania w serwisie zewnętrznym

• Mathematical modeling and prediction of pit to crack transition under cyclic thermal load using artificial neural network

  Publikacja

  • D. Yona

  - Rok 2023

  The formation of pitting is a major problem in most metals, which is caused by extremely localized corrosion that creates small holes in metal and subsequently, it changes into cracks under mechanical load, thermo-mechanical stress, and corrosion process factors. This research aims to study pit to crack transition phenomenon of steel boiler heat tubes under cyclic thermal load, and mathematical modeling...

• Chronographic Imprint of Age-Induced Alterations in Heart Rate Dynamical Organization

  Publikacja

  • D. Makowiec
  • D. Wejer
  • A. Kaczkowska
  • M. Żarczyńska-Buchowiecka
  • Z. R. Struzik

  - Frontiers in Physiology - Rok 2015

  Beat-to-beat changes in the heart period are transformed into a network of increments between subsequent RR-intervals, which enables graphical descriptions of short-term heart period variability. Three types of such descriptions are considered: (1) network graphs arising from a set of vertices and directed edges, (2) contour plots of adjacency matrices A, representing the networks and transition matrices T, resulting from A, and (3)...

  Pełny tekst do pobrania w portalu

• Network on Chip implementation using FPGAs resources

  Publikacja

  • M. Kłosowski

  - Zeszyty Naukowe Wydziału ETI Politechniki Gdańskiej. Technologie Informacyjne - Rok 2006

  W artykule przedstawiono implementację sieci typu ''Network on Chip'' w układach FPGA. Sieci typu ''Network on Chip'' stały się bardzo interesującym i obiecującym rozwiązaniem dla systemów typu ''System on Chip'' które charakteryzują się intensywną komunikacją wewnętrzną. Ze względu na inne paradygmaty projektowania nie ma obecnie dostępnych efektywnych platform do budowy prototypów sieci typu ''Network on Chip'' i ich weryfikacji....

• GRAPHS AND COMBINATORICS

  Czasopisma

  ISSN: 0911-0119 , eISSN: 1435-5914

• Graph Decomposition for Memoryless Periodic Exploration

  Publikacja

  • A. Kosowski
  • A. Navarra

  - ALGORITHMICA - Rok 2012

  We consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Total Domination Versus Domination in Cubic Graphs

  Publikacja

  • J. Cyman
  • M. Dettlaff
  • M. A. Henning
  • M. Lemańska
  • J. Raczek

  - GRAPHS AND COMBINATORICS - Rok 2018

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

  Pełny tekst do pobrania w portalu

• Dynamic F-free Coloring of Graphs

  Publikacja

  • P. Borowiecki
  • E. Sidorowicz

  - GRAPHS AND COMBINATORICS - Rok 2018

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

  Pełny tekst do pobrania w portalu

• Strategic balance in graphs

  Publikacja

  • R. Lewoń
  • A. Małafiejska
  • M. Małafiejski

  - DISCRETE MATHEMATICS - Rok 2016

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

  Pełny tekst do pobrania w portalu

• Transition

  Czasopisma

  ISSN: 0041-1191 , eISSN: 1527-8042