Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "rooted tree" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    Propriétés topologiques et combinatoires des échelles de numération
    Autorzy:
    Barat, Guy
    Downarowicz, Tomasz
    Iwanik, Anzelm
    Liardet, Pierre
    Powiązania:
    https://bibliotekanauki.pl/articles/965769.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Tematy:
    dynamical system
    addingi machine
    odometer
    rooted tree
    number system
    Opis:
    Topological and combinatorial properties of dynamical systems called odometers and arising from number systems are investigated. First, a topological classification is obtained. Then a rooted tree describing the carries in the addition of 1 is introduced and extensively studied. It yields a description of points of discontinuity and a notion of low scale, which is helpful in producing examples of what the dynamics of an odometer can look like. Density of the orbits is also discussed.
    Źródło:
    Colloquium Mathematicum; 2000, 84/85, 2; 285-306
    0010-1354
    Pojawia się w:
    Colloquium Mathematicum
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    KP-digraphs and CKI-digraphs satisfying the k-Meyniels condition
    Autorzy:
    Galeana-Sánchez, H.
    Neumann-Lara, V.
    Powiązania:
    https://bibliotekanauki.pl/articles/972038.pdf
    Data publikacji:
    1996
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    digraph
    kernel
    independent set of vertices
    absorbing set of vertices
    kernel-perfect digraph
    critical-kernel-imperfect digraph
    τ-system
    τ₁-system
    indepedent kernel modulo Q
    co-rooted tree
    τ-construction
    τ₁-construction
    Opis:
    A digraph D is said to satisfy the k-Meyniel’s condition if each odd directed cycle of D has at least k diagonals. The study of the k-Meyniel’s condition has been a source of many interesting problems, questions and results in the development of Kernel Theory. In this paper we present a method to construct a large variety of kernel-perfect (resp. critical kernel-imperfect) digraphs which satisfy the k-Meyniel’s condition.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1996, 16, 1; 5-16
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Picea abies breeding in Sweden is based on clone testing
    Autorzy:
    Lindgren, D
    Powiązania:
    https://bibliotekanauki.pl/articles/41300.pdf
    Data publikacji:
    2009
    Wydawca:
    Polska Akademia Nauk. Instytut Dendrologii PAN
    Tematy:
    international conference
    Europe
    forest ecosystem
    plant breeding
    tree
    Norway spruce
    Picea abies
    Sweden
    clone testing
    rooted cutting
    seed orchard
    long-term breeding
    Opis:
    In the last decades, clone testing has become an important component of the long-term breeding and seed orchards for Norway spruce in Sweden. For more than three decades, considerable resources have been spent on testing clones intended for clonal forestry, but the Swedish forestry never saw it worth to pay the added cost involved in the added gain. The efforts, however, resulted in many clone trials and developments in the technique for clone production and propagation. Theoretically, clone testing is faster and cheaper than progeny testing and more reliable than selecting individuals forwards. Nowadays, the main line in long-term breeding is to make crosses between the best trees and test-cloned full-sibs as a recruitment population for long-term breeding and seed orchards. Since controlled crosses are a bottleneck for long-term breeding, a possibility is to rely on wind pollination (Breeding Without Breeding; BWB) in trials for testing clones. The seed parent is known, and that the pollen parent is a desirable genotype can be checked by molecular markers. BWB has the potential to eliminate the waiting time between selection and recombination, which is particularly important in a late and irregularly flowering species such as Norway spruce. Clone testing ensures that the breeding values are known from the same tests as those used for BWB. Another option for BWB is to place in seed orchards a few ramets of clones belonging to the breeding population, but normally not deserving such a use, with the hope that their presence will make it possible to rely on wind pollination to recombine the whole breeding population.
    Źródło:
    Dendrobiology; 2009, 61 Supplement
    1641-1307
    Pojawia się w:
    Dendrobiology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-3 z 3

      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