Wyniki wyszukiwania dla: WEIGHT INTERVALS - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: WEIGHT INTERVALS
Przykład wyników znalezionych w innych katalogach

Wyniki wyszukiwania dla: WEIGHT INTERVALS

  • Protect our right to light

    Publikacja

    - NATURE - Rok 2019

    “The struggle for light” is how the Swiss architect Le Corbusier described the history of architecture in 1935. Today, with the skies crowded out by buildings in modern cities, those words should ring in the ears of policymakers and planners. Skyscraper construction is booming. China is the leader, last year completing 88 of the 143 buildings around the world that are taller than 200 metres (see ‘Vertical growth’). As the nation’s...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Internal Security

    Czasopisma

    ISSN: 2080-5268

  • Implementation of Weigh-in-Motion System in Freight Traffic Management in Urban Areas

    The article presents how the Weigh-in-Motion system can be used for managing Gdynia’s freight traffic. Potential sites for weight pre-selection were identified in an analysis of the technical and location conditions. Situated directly in the east part of the Port of Gdynia a site was selected for a pilot implementation. Theoretical scenarios were simulated using an extended WIM system as a tool for controlling access to selected...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Interval edge-coloring of graphs.

    Publikacja

    - Rok 2004

    Rozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.

  • Interval Edge-Coloring of Graphs

    Publikacja

    - Rok 2004

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Interval incidence graph coloring

    In this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...

    Pełny tekst do pobrania w portalu

  • Heart rate asymmetry by Poincaré plots of RR intervals

    Publikacja
    • P. Guzik
    • J. Piskorski
    • T. Krauze
    • A. Wykretowicz
    • H. Wysocki

    - BIOMEDIZINISCHE TECHNIK - Rok 2006

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On the interspike-intervals of periodically-driven integrate-and-fire models

    We analyze properties of the firing map, which iterations give information about consecutive spikes, for periodically driven linear integrate-and-fire models. By considering locally integrable (thus in general not continuous) input functions, we generalize some results of other authors. In particular, we prove theorems concerning continuous dependence of the firing map on the input in suitable function spaces. Using mathematical...

    Pełny tekst do pobrania w portalu

  • Interval incidence coloring of bipartite graphs

    In this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...

    Pełny tekst do pobrania w portalu

  • Interval incidence coloring of subcubic graphs

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

    Pełny tekst do pobrania w portalu