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ę "disconnection" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-12 z 12
    Tytuł:
    An ideology of disconnection: For a critical political marketing
    Autorzy:
    Savigny, Heather
    Wring, Dominic
    Powiązania:
    https://bibliotekanauki.pl/articles/471135.pdf
    Data publikacji:
    2009
    Wydawca:
    Polskie Towarzystwo Komunikacji Społecznej
    Tematy:
    political marketing
    ideology
    neoliberalism
    disconnection
    Opis:
    The processes of contemporary politics are increasingly informed by ideas and principles that derive from conventional marketing. This, we suggest, is intimately connected to the neoliberal ascendancy which characterises the global political environment. In this article we seek to historicise the structural and ideological embedding of economic ideas within the political realm. We argue that marketing both informs and is a product of these changes and that there are important consequences, notably the further detaching of an already disaffected public from the electoral process. Conse- quently we conclude that the “marketisation” of politics has come to represent an “ideology of discon- nection.”
    Źródło:
    Central European Journal of Communication; 2009, 2, 2(3); 251-265
    1899-5101
    Pojawia się w:
    Central European Journal of Communication
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the disconnection of Banach spaces
    Autorzy:
    Granas, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/1382777.pdf
    Data publikacji:
    1960
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Źródło:
    Fundamenta Mathematicae; 1959-1960, 48, 2; 189-200
    0016-2736
    Pojawia się w:
    Fundamenta Mathematicae
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Particle filter in power system state estimation – bad measurement data and branch disconnection
    Autorzy:
    Kozierski, P.
    Lis, M.
    Owczarkowski, A.
    Horla, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/141558.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    bad data
    branch disconnection measurement errors
    particle filter
    power system
    state estimation
    Opis:
    An approach to power system state estimation using a particle filter has been proposed in the paper. Two problems have been taken into account during research, namely bad measurements data and a network structure modification with rapid changes of the state variables. For each case the modification of the algorithm has been proposed. It has also been observed that anti-zero bias modification has a very positive influence on the obtained results (few orders of magnitude, in comparison to the standard particle filter), and additional calculations are quite symbolic. In the second problem, used modification also improved estimation quality of the state variables. The obtained results have been compared to the extended Kalman filter method.
    Źródło:
    Archives of Electrical Engineering; 2015, 64, 2; 237-248
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Rainbow Disconnection in Graphs
    Autorzy:
    Chartrand, Gary
    Devereaux, Stephen
    Haynes, Teresa W.
    Hedetniemi, Stephen T.
    Zhang, Ping
    Powiązania:
    https://bibliotekanauki.pl/articles/31342243.pdf
    Data publikacji:
    2018-11-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    edge coloring
    rainbow connection
    rainbow disconnection
    Opis:
    Let G be a nontrivial connected, edge-colored graph. An edge-cut R of G is called a rainbow cut if no two edges in R are colored the same. An edge-coloring of G is a rainbow disconnection coloring if for every two distinct vertices u and v of G, there exists a rainbow cut in G, where u and v belong to different components of G − R. We introduce and study the rainbow disconnection number rd(G) of G, which is defined as the minimum number of colors required of a rainbow disconnection coloring of G. It is shown that the rainbow disconnection number of a nontrivial connected graph G equals the maximum rainbow disconnection number among the blocks of G. It is also shown that for a nontrivial connected graph G of order n, rd(G) = n−1 if and only if G contains at least two vertices of degree n − 1. The rainbow disconnection numbers of all grids Pm □ Pn are determined. Furthermore, it is shown for integers k and n with 1 ≤ k ≤ n − 1 that the minimum size of a connected graph of order n having rainbow disconnection number k is n + k − 2. Other results and a conjecture are also presented.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2018, 38, 4; 1007-1021
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Infinite families of tight regular tournaments
    Autorzy:
    Llano, Bernardo
    Olsen, Mika
    Powiązania:
    https://bibliotekanauki.pl/articles/743788.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    regular tournament
    acyclic disconnection
    tight tournament
    mold
    tame mold
    ample tournament
    domination digraph
    Opis:
    In this paper, we construct infinite families of tight regular tournaments. In particular, we prove that two classes of regular tournaments, tame molds and ample tournaments are tight. We exhibit an infinite family of 3-dichromatic tight tournaments. With this family we positively answer to one case of a conjecture posed by V. Neumann-Lara. Finally, we show that any tournament with a tight mold is also tight.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2007, 27, 2; 299-311
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Technology and Making-Meaning in College Relationships: Understanding Hyper-Connection
    Autorzy:
    Standlee, Alecea
    Powiązania:
    https://bibliotekanauki.pl/articles/2119627.pdf
    Data publikacji:
    2016-04-30
    Wydawca:
    Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
    Tematy:
    Social Interaction
    Presence
    Absence
    Relationships
    College Students
    Connection
    Disconnection
    Intimacy
    Communication Technology
    Opis:
    This article explores how the use of communication technology has transformed social interactions and the sense of self that is derived from such interactions by considering the role of presence and absence in relationships among college students. Analyzing interviews with 38 participants, I explore how they construct understandings of presence, absence, connection, and disconnection within peer social groups and intimate relationships, indicating the emergence of a culture of hyper-connection. I suggest that technological developments have enabled forms of interaction that encourage frequent connection and the idealization of constant communication among participants. These findings further indicate that the normalization of hyper-connection may have impacts on relationship practices and constructions of identity among participants.
    Źródło:
    Qualitative Sociology Review; 2016, 12, 2; 6-21
    1733-8077
    Pojawia się w:
    Qualitative Sociology Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A class of tight circulant tournaments
    Autorzy:
    Galeana-Sánchez, Hortensia
    Neumann-Lara, Víctor
    Powiązania:
    https://bibliotekanauki.pl/articles/743727.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Circulant tournament
    acyclic disconnection
    vertex 3-colouring
    3-chromatic triangle
    tight tournament
    Opis:
    A tournament is said to be tight whenever every 3-colouring of its vertices using the 3 colours, leaves at least one cyclic triangle all whose vertices have different colours. In this paper, we extend the class of known tight circulant tournaments.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2000, 20, 1; 109-128
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    More on the Rainbow Disconnection in Graphs
    Autorzy:
    Bai, Xuqing
    Chang, Renying
    Huang, Zhong
    Li, Xueliang
    Powiązania:
    https://bibliotekanauki.pl/articles/32222544.pdf
    Data publikacji:
    2022-11-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    edge-coloring
    edge-connectivity
    rainbow disconnection coloring (number)
    Erdős-Gallai type problem
    Nordhaus-Gaddum type bounds
    complexity
    NP-hard (complete)
    Opis:
    Let G be a nontrivial edge-colored connected graph. An edge-cut R of G is called a rainbow-cut if no two of its edges are colored the same. An edge-colored graph G is rainbow disconnected if for every two vertices u and v of G, there exists a u-v-rainbow-cut separating them. For a connected graph G, the rainbow disconnection number of G, denoted by rd(G), is defined as the smallest number of colors that are needed in order to make G rainbow disconnected. In this paper, we first determine the maximum size of a connected graph G of order n with rd(G) = k for any given integers k and n with 1 ≤ k ≤ n − 1, which solves a conjecture posed only for n odd in [G. Chartrand, S. Devereaux, T.W. Haynes, S.T. Hedetniemi and P. Zhang, Rainbow disconnection in graphs, Discuss. Math. Graph Theory 38 (2018) 1007–1021]. From this result and a result in their paper, we obtain Erdős-Gallai type results for rd(G). Secondly, we discuss bounds on rd(G) for complete multipartite graphs, critical graphs with respect to the chromatic number, minimal graphs with respect to the chromatic index, and regular graphs, and we also give the values of rd(G) for several special graphs. Thirdly, we get Nordhaus-Gaddum type bounds for rd(G), and examples are given to show that the upper and lower bounds are sharp. Finally, we show that for a connected graph G, to compute rd(G) is NP-hard. In particular, we show that it is already NP-complete to decide if rd(G) = 3 for a connected cubic graph. Moreover, we show that for a given edge-colored (with an unbounded number of colors) connected graph G it is NP-complete to decide whether G is rainbow disconnected.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1185-1204
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-12 z 12

      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