Wyszukiwarka
Filtry
wszystkich: 852
-
Katalog
- Publikacje 705 wyników po odfiltrowaniu
- Czasopisma 15 wyników po odfiltrowaniu
- Konferencje 18 wyników po odfiltrowaniu
- Osoby 15 wyników po odfiltrowaniu
- Projekty 6 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Kursy Online 3 wyników po odfiltrowaniu
- Wydarzenia 1 wyników po odfiltrowaniu
- Dane Badawcze 88 wyników po odfiltrowaniu
Wyniki wyszukiwania dla: RECTANGULAR GRID GRAPHS
-
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.
-
Computing internodal conductivities in numerical modeling of two dimensional unsaturated flow on rectangular grid
PublikacjaW artykule porównano rozwiązania numeryczne dwuwymiarowego równania przepływu nienasyconego z użyciem różnych metod uśredniania współczynnika przewodności hydraulicznej między sąsiednimiwęzłami. Uwzględniono średnia arytmetyczną, geometryczną, "pod prad" oraz całkową, a także niedawno zaproponowany sposób uśredniania oparty na analizie przepływu ustalonego. Ten ostatni sposób okazałsię najbardziej uniwersalny, gdyż umożliwiał otrzymanie...
-
Application of Doubly Connected Dominating Sets to Safe Rectangular Smart Grids
PublikacjaSmart grids, together with the Internet of Things, are considered to be the future of the electric energy world. This is possible through a two-way communication between nodes of the grids and computer processing. It is necessary that the communication is easy and safe, and the distance between a point of demand and supply is short, to reduce the electricity loss. All these requirements should be met at the lowest possible cost....
-
Hydrodynamic reanalysis of ice conditions in the Baltic Sea using the PM3D model
Dane BadawczeThe dataset contains the results of numerical modeling of sea ice in the Baltic Sea since 1998. A long-term reanalysis was performed using the three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). A numerical dynamic-thermodynamic model of sea ice (Herman et al. 2011)...
-
Long-term hindcast simulation of sea ice in the Baltic Sea
Dane BadawczeThe data set contains the results of numerical modeling of sea ice over a period of 50 years (1958-2007) in the Baltic Sea. A long-term hindcast simulation was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). A numerical dynamic-thermodynamic model...
-
Hydrodynamic reanalysis of currents in the Baltic Sea using the PM3D model
Dane BadawczeThe dataset contains the results of numerical modeling of currents in the Baltic Sea since 1998. A long-term reanalysis was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997).
-
Hydrodynamic reanalysis of sea level in the Baltic Sea using the PM3D model
Dane BadawczeThe data set contains the results of numerical modelling of sea level fluctuations in the Baltic Sea in the Baltic Sea since 1998. A long-term reanalysis was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997).
-
Hydrodynamic reanalysis of water temperature and salinity in the Baltic Sea using the PM3D model
Dane BadawczeThe dataset contains the results of numerical modeling of water temperature and salinity in the Baltic Sea since 1998. A long-term reanalysis was performed using the three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). A numerical dynamic-thermodynamic model of sea...
-
Long-term hindcast simulation of sea level in the Baltic Sea
Dane BadawczeThe dataset contains the results of numerical modelling of sea level fluctuations over a period of 50 years (1958-2007) in the Baltic Sea. A long-term hindcast simulation was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). The hydrodynamic model...
-
Long-term hindcast simulation of water temperature and salinity in the Baltic Sea
Dane BadawczeThe dataset contains the results of numerical modelling of water temperature and salinity over a period of 50 years (1958-2007) in the Baltic Sea. A long-term hindcast simulation was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). The hydrodynamic...
-
Long-term hindcast simulation of currents in the Baltic Sea
Dane BadawczeThe dataset contains the results of numerical modelling of currents over a period of 50 years (1958-2007) in the Baltic Sea . A long-term hindcast simulation was performed using a three-dimensional hydrodynamic model PM3D (Kowalewski and Kowalewska-Kalkowska, 2017), a new version of the M3D model (Kowalewski, 1997). The hydrodynamic model was coupled...
-
GRAPHS AND COMBINATORICS
Czasopisma -
Total Domination Versus Domination in Cubic Graphs
PublikacjaA 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...
-
Dynamic F-free Coloring of Graphs
PublikacjaA 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...
-
Resonance in Rectangular Microstrip Structure Loaded with a Pseudochiral Medium Layer
PublikacjaA rectangular microstrip structure with multilayer substrate containing dielectric and pseudochiral medium layers is studied in this paper. The effect of Omega medium layer location in the substrate and its thickness on the complex resonant frequency of the rectangular microstrip structure is investigated.
-
Propagation in rectangular waveguides with a pseudochiral Ω slab
PublikacjaThe transfer matrix approach is applied for analysis of waveguides loaded with a uniaxial pseudochiral Ω slab. In particular a pseudochiral parallel plate and rectangular guides are investigated. Based on the numerical analysis the influence of the pseudochirality on propagation characteristics and field distribution are examined. Other feature such as a field displacement phenomenon appearing in the both considered structures...
-
Charakterystyka środowiska Knowledge Grid
PublikacjaZorganizowanie wiedzy zgromadzonej w Internecie to współcześnie ważne zagadnienie badawcze. Artykuł opisuje środowisko Knowledge Grid i mechanizmy jego działania. Wiedza przechowywana w Knowledge Grid może zostać zorganizowana w trójwymiarową strukturę. Opracowany został również Knowledge Grid Operating Language, który jest językiem służącym do operowania na danych udostępnianych w tym środowisku. Za jego pomocą możliwe jest umieszczenia...
-
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,...
-
Dynamic coloring of graphs
PublikacjaDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Some variations of perfect graphs
PublikacjaWe 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...