Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "connection index" wg kryterium: Temat


Wyświetlanie 1-5 z 5
Tytuł:
Wpływ wybranych elementów środowiska przyrodniczego na zróżnicowanie emisyjności promieniowania termalnego Doliny Gąsienicowej
The influence of natural environment’s components on spatial diversity of thermal emissivity of the Gąsiennicowa Valley
Autorzy:
Metrycka, J.
Zagajewski, B.
Powiązania:
https://bibliotekanauki.pl/articles/132379.pdf
Data publikacji:
2009
Wydawca:
Polskie Towarzystwo Geograficzne
Tematy:
Tatrzański Park Narodowy
Dolina Gąsienicowa
emisyjność
temperatura radiacyjna
wskaźnik
moc
Tatra Mts. National Park
Gąsienicowa Valley
emissivity
surface temperature
power
connection index
Opis:
Hyperspectral remote sensing is still being discovered as a tool about analytical possibilities for the research on areas about diversifi ed character, like mountain areas. This study investigated the relationship between spatial variability of surface temperature of the Gąsienicowa Valley (the Tatra Mountains) and chosen components of the natural environment, such as: near-surface lithology layers, soil surfaces, land cover types, altitudes, slopes and aspects. Image of the surface radiation temperature was processed basing on the Digital Airborne Imaging Spectrometer (DAIS 7915) data. Thematic layers were: acquired from the Tatra National Park GIS Office (geology, lithology and soil layers), generated from DTM (altitude, slopes and aspects) and created from the DAIS RGB compositions data (land cover). The analysis of relationship between components and surface temperatures were measured by the power connection index (Richling, 1983) and connection index (Zagajewski, 2003). It has been stated that the greatest power of connections occurred between the radiation temperature and the soil surface, however on the majority surface of the Gąsienicowa Valley temperature responses most strongly to the land cover type.
Źródło:
Teledetekcja Środowiska; 2009, 41; 105-120
1644-6380
Pojawia się w:
Teledetekcja Środowiska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Index filtrations and Morse decompositions for discrete dynamical systems
Autorzy:
Bartłomiejczyk, P.
Dzedzej, Z.
Powiązania:
https://bibliotekanauki.pl/articles/1294030.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Conley index
index filtration
Morse decomposition
connection matrix
Opis:
On a Morse decomposition of an isolated invariant set of a homeomorphism (discrete dynamical system) there are partial orderings defined by the homeomorphism. These are called admissible orderings of the Morse decomposition. We prove the existence of index filtrations for admissible total orderings of a Morse decomposition and introduce the connection matrix in this case.
Źródło:
Annales Polonici Mathematici; 1999, 72, 1; 51-70
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Connection matrix theory for discrete dynamical systems
Autorzy:
Bartłomiejczyk, Piotr
Dzedzej, Zdzisław
Powiązania:
https://bibliotekanauki.pl/articles/1341654.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Conley index
Morse decomposition
connection matrix
Opis:
In [C] and [F1] the connection matrix theory for Morse decomposition is developed in the case of continuous dynamical systems. Our purpose is to study the case of discrete time dynamical systems. The connection matrices are matrices between the homology indices of the sets in the Morse decomposition. They provide information about the structure of the Morse decomposition; in particular, they give an algebraic condition for the existence of connecting orbit set between different Morse sets.
Źródło:
Banach Center Publications; 1999, 47, 1; 67-78
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Connection matrix pairs
Autorzy:
Richeson, David
Powiązania:
https://bibliotekanauki.pl/articles/1341687.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Conley index
multi-valued maps
connection matrix pairs
Morse decomposition
index filtrations
Opis:
We discuss the ideas of Morse decompositions and index filtrations for isolated invariant sets for both single-valued and multi-valued maps. We introduce the definition of connection matrix pairs and present the theorem of their existence. Connection matrix pair theory for multi-valued maps is used to show that connection matrix pairs obey the continuation property. We conclude by addressing applications to numerical analysis. This paper is primarily an overview of the papers [R1] and [R2].
Źródło:
Banach Center Publications; 1999, 47, 1; 219-232
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Proper (Strong) Rainbow Connection of Graphs
Autorzy:
Jiang, Hui
Li, Wenjing
Li, Xueliang
Magnant, Colton
Powiązania:
https://bibliotekanauki.pl/articles/32083886.pdf
Data publikacji:
2021-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
proper (strong) rainbow connection number
Cartesian product
chromatic index
Opis:
A path in an edge-colored graph $G$ is called a rainbow path if no two edges on the path have the same color. The graph $G$ is called rainbow connected if between every pair of distinct vertices of $G$, there is a rainbow path. Recently, Johnson et al. considered this concept with the additional requirement that the coloring of $G$ is proper. The proper rainbow connection number of $G$, denoted by $prc(G)$, is the minimum number of colors needed to properly color the edges of $G$ so that $G$ is rainbow connected. Similarly, the proper strong rainbow connection number of $G$, denoted by $psrc(G)$, is the minimum number of colors needed to properly color the edges of $G$ such that for any two distinct vertices of $G$, there is a rainbow geodesic (shortest path) connecting them. In this paper, we characterize those graphs with proper rainbow connection numbers equal to the size or within 1 of the size. Moreover, we completely solve a question proposed by Johnson et al. by proving that if \(G = K_{p1} \Box \dots \Box K_{pn}\), where $n≥ 1$, and $p_1, . . ., p_n>1$ are integers, then $prc(G) = psrc(G) = χ^′(G)$, where $χ^′(G)$ denotes the chromatic index of $G$. Finally, we investigate some suffcient conditions for a graph $G$ to satisfy $prc(G) = rc(G)$, and make some slightly positive progress by using a relation between $rc(G)$ and the girth of the graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 2; 469-479
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies