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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 123
Tytuł:
Rainbow Connectivity of Cacti and of Some Infinite Digraphs
Autorzy:
Alva-Samos, Jesús
Montellano-Ballesteros, Juan José
Powiązania:
https://bibliotekanauki.pl/articles/31341981.pdf
Data publikacji:
2017-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
rainbow connectivity
cactus
arc colouring
Opis:
An arc-coloured digraph D = (V,A) is said to be rainbow connected if for every pair {u, v} ⊆ V there is a directed uv-path all whose arcs have different colours and a directed vu-path all whose arcs have different colours. The minimum number of colours required to make the digraph D rainbow connected is called the rainbow connection number of D, denoted rc⃗ (D). A cactus is a digraph where each arc belongs to exactly one directed cycle. In this paper we give sharp upper and lower bounds for the rainbow connection number of a cactus and characterize those cacti whose rainbow connection number is equal to any of those bounds. Also, we calculate the rainbow con- nection numbers of some infinite digraphs and graphs, and present, for each n ≥ 6, a tournament of order n and rainbow connection number equal to 2.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 2; 301-313
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Geomedia and privacy in context. Paradoxical behavior or the unwitting sharing of geodata with digital platforms?
Autorzy:
Atteneder, Helena
Collini-Nocker, Bernhard
Powiązania:
https://bibliotekanauki.pl/articles/691358.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
privacy, geoprivacy, geomedia, privacy paradox, permanent spatial connectivity, ubiquitous geodata capturing, corporate surveillance, awareness
Opis:
The increasing pervasiveness of media in society implies the ubiquitous processes of geodata-capture and real-time feedback. The concept of Geomedia considers these developments and raises the questions of geoprivacy and corporate surveillance. The aim of this study was to investigate what kinds of geolocation data are shared wittingly or unwittingly, and in what contexts. Beyond that, we ask how much individuals know about the data-sharing processes and the underlying commercial logic, and how they act upon this knowledge (whether paradoxically or not). Our study was theoretically framed by contextual privacy (Nissenbaum 2011), because we assumed that a violation of privacy is perceived differently according to the context. The quasi-experimental design (using a WiFi-capture device) combined with a questionnaire revealed the participants’ attitudes to, and awareness of, data sharing, and their understanding of geoprivacy and geomedia use. The main results show that people are aware of the underlying commercial logic, have privacy concerns and, strongly depending on contextual factors, their knowledge and capabilities, act upon this awareness. Finally, we show that smartphones covertly share a huge amount of meta and traffic data.
Źródło:
Mediatization Studies; 2018, 2
2451-1188
Pojawia się w:
Mediatization Studies
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ł
Tytuł:
Efficiency of Technology of Access to Databases
Autorzy:
Barczak, A.
Mościcki, A.
Powiązania:
https://bibliotekanauki.pl/articles/92911.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
databases
open database connectivity
ODBC
borland data engine
BDE
activeX data objects
ADO
Opis:
In this paper the evolution of technologis of access to databases is presented. For definite systems of databases’ management (databases servers) and technologis of access, there was made an experiment, enabling to estimate the average of time of answering (realizing), definite types of questions- what means efficiency of each technologis.
Źródło:
Studia Informatica : systems and information technology; 2006, 1(7); 293-310
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparative analysis of the accessibility and connectivity of public transport in the city districts of Krakow
Analiza porównawcza dostępności i łączności transportu publicznego w dzielnicach Krakowa
Autorzy:
Bárta, Martin
Powiązania:
https://bibliotekanauki.pl/articles/2089642.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Gdański. Komisja Geografii Komunikacji Polskiego Towarzystwa Geograficznego
Tematy:
comparative analysis
Krakow
public transport indicators
public transport connectivity
public transport accessibility
analiza porównawcza
Kraków
transport publiczny
łączność transportu publicznego
dostępność transportu publicznego
Opis:
A properly functioning public transport is one of the most important components of urban mobility for the population. Due to spatial inhomogeneity and overall socio-economic differences within a city, there are often considerable disproportions in the quality of transport services within its districts. Also, the city of Krakow is no exception in this case. For a comparison of public transport accessibility in 18 Krakow districts, 7 major quantitative and 5 minor indicators were created. These indicators include the most important characteristics of transport services such as accessibility, frequency, connectivity of connections, and ratios of tram public transport subsystem. The resulting values give a fairly comprehensive picture of the quality of the transport services. Overall higher values for most indicators occur in the central districts of the city. However, due to the complexity of the observed characteristics, it is possible to discover significant differences in the structure of individual indicators. Peripheral districts reach higher amplitudes, which means that in some aspect they have even better transport services than the city center. Yet, at the same time, we also find opposite extremes here, highly below-average values for most other indicators. A detailed analysis of the results provides a unique perspective on the disparities among districts. It can also serve for specific identification of strengths and weaknesses of transport services and its possible optimization.
Źródło:
Prace Komisji Geografii Komunikacji PTG; 2020, 23(3); 7-14
1426-5915
2543-859X
Pojawia się w:
Prace Komisji Geografii Komunikacji PTG
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Structural Properties of Recursively Partitionable Graphs with Connectivity 2
Autorzy:
Baudon, Olivier
Bensmail, Julien
Foucaud, Florent
Pilśniak, Monika
Powiązania:
https://bibliotekanauki.pl/articles/31342171.pdf
Data publikacji:
2017-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
online arbitrarily partitionable graph
recursively arbitrarily partitionable graph
graph with connectivity 2
balloon graph
Opis:
A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1, . . ., np) of |V (G)| there exists a partition (V1, . . ., Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices. Some stronger versions of this property were introduced, namely the ones of being online arbitrarily partitionable and recursively arbitrarily partitionable (OL-AP and R-AP for short, respectively), in which the subgraphs induced by a partition of G must not only be connected but also fulfil additional conditions. In this paper, we point out some structural properties of OL-AP and R-AP graphs with connectivity 2. In particular, we show that deleting a cut pair of these graphs results in a graph with a bounded number of components, some of whom have a small number of vertices. We obtain these results by studying a simple class of 2-connected graphs called balloons.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 1; 89-115
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimum Edge Cuts in Diameter 2 Graphs
Autorzy:
Bickle, Allan
Schwenk, Allen
Powiązania:
https://bibliotekanauki.pl/articles/31343375.pdf
Data publikacji:
2019-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
edge connectivity
diameter
Opis:
Plesnik proved that the edge connectivity and minimum degree are equal for diameter 2 graphs. We provide a streamlined proof of this fact and characterize the diameter 2 graphs with a nontrivial minimum edge cut.
Źródło:
Discussiones Mathematicae Graph Theory; 2019, 39, 2; 605-608
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Integrated Access and Backhaul based 5G Connectivity for Rural Indian Sectors : Ending the Digital Divide
Autorzy:
Biswas, Ardhendu Shekhar
Sil, Sanjib
Bera, Rabindranath
Mitra, Monojit
Powiązania:
https://bibliotekanauki.pl/articles/2055209.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
carrier aggregation
CA
component carrier
CC
5G
new radio
NR
integrated access and backhaul
IAB
Opis:
The world is heading towards deployment of 5G commercially by the year 2020. But providing broadband 5G connectivity to remote rural regions is a significant challenge. Fiber connectivity has attempted to penetrate rural regions but last mile connectivity is still a problem in many rural sectors due to improper land demarcation and hostile terrain. A scheme which is based on the Integrated Access and Backhaul (IAB) concept is proposed to provide last mile 5G connectivity to satisfy the broadband needs of rural subscribers. A wireless 5G downlink environment following 3GPP NR specifications with a significantly high throughput is simulated. The last mile link is provided through a 28GHz carrier from a proposed IAB node delivering a data throughput of 4.301 Gbps for single-user carrier aggregation and 5.733 Gbps for multi-user carrier aggregation which is quite promising for broadband service, like high-speed Internet and streaming video. The results presented in this work are observed to agree favourably with the results of other researchers in the field.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 4; 655--663
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ordered and linked chordal graphs
Autorzy:
Böhme, Thomas
Gerlach, Tobias
Stiebitz, Michael
Powiązania:
https://bibliotekanauki.pl/articles/743039.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
paths and cycles
connectivity
chordal graphs
Opis:
A graph G is called k-ordered if for every sequence of k distinct vertices there is a cycle traversing these vertices in the given order. In the present paper we consider two novel generalizations of this concept, k-vertex-edge-ordered and strongly k-vertex-edge-ordered. We prove the following results for a chordal graph G:
(a) G is (2k-3)-connected if and only if it is k-vertex-edge-ordered (k ≥ 3).
(b) G is (2k-1)-connected if and only if it is strongly k-vertex-edge-ordered (k ≥ 2).
(c) G is k-linked if and only if it is (2k-1)-connected.
Źródło:
Discussiones Mathematicae Graph Theory; 2008, 28, 2; 367-373
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Detecting and Restoring Gaps Among Forest Patches: AN Achievable and Replicable Proposal to Boost the Landscape Connectivity
Autorzy:
Bortoleto, Ludmila Araujo
Rodgers, John
da Silva, Alexandre Marko
Powiązania:
https://bibliotekanauki.pl/articles/27314778.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
ecological connectivity
wildlife corridors
forest fragmentation
łączność ekologiczna
korytarze dla dzikiej przyrody
fragmentacja lasów
Opis:
It is well known that one of the main impacts caused by land cover change is the process of forest fragmentation. Connecting the remaining fragments is always an exercise for technicians and academics, and even corridors of remaining vegetation usually present places of forest discontinuity, lacking connection strategies for the corridor to gain a real function. In this paper, we applied a model structured to identify priority locals to implement connectors. We used a GIS package and a digital, georeferenced satellite image. We complemented the project by surveying a database through a drone-based field survey. The integration of data revealed that for our studied area (Sorocaba, SP Brazil) 42.5% need assisted restoration. The mapping also revealed the existence of 25 forest fragments larger than 50 ha, arranged chiefly in one single corridor but disconnected from each other. Hence, through the application of the model, we could localize nine strategic locations in distances as short as possible among the fragments, feasible to implement a connector with the economy of resources and expect satisfactory performance in ecological terms. The database generated by the drone-based survey helped us to assert the effectiveness of the model in choosing areas that require assisted restoration to reestablish the connection of the landscape.
Źródło:
Civil and Environmental Engineering Reports; 2022, 32, 3; 62--84
2080-5187
2450-8594
Pojawia się w:
Civil and Environmental Engineering Reports
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Edge-connectivity of strong products of graphs
Autorzy:
Bresar, Bostjan
Spacapan, Simon
Powiązania:
https://bibliotekanauki.pl/articles/743791.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
connectivity
strong product
graph product
separating set
Opis:
The strong product G₁ ⊠ G₂ of graphs G₁ and G₂ is the graph with V(G₁)×V(G₂) as the vertex set, and two distinct vertices (x₁,x₂) and (y₁,y₂) are adjacent whenever for each i ∈ {1,2} either $x_i = y_i$ or $x_i y_i ∈ E(G_i)$. In this note we show that for two connected graphs G₁ and G₂ the edge-connectivity λ (G₁ ⊠ G₂) equals min{δ(G₁ ⊠ G₂), λ(G₁)(|V(G₂)| + 2|E(G₂)|), λ(G₂)(|V(G₁)| + 2|E(G₁)|)}. In addition, we fully describe the structure of possible minimum edge cut sets in strong products of graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2007, 27, 2; 333-343
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ponad barierami : łączenie sieci o różnych klauzulach
Beyond an air gap : cross domain networks connectivity
Autorzy:
Brudka, M.
Furtak, J.
Powiązania:
https://bibliotekanauki.pl/articles/273181.pdf
Data publikacji:
2009
Wydawca:
Wojskowa Akademia Techniczna im. Jarosława Dąbrowskiego
Tematy:
bramy międzysystemowe
bezpieczeństwo wielopoziomowe
dioda danych
cross domain solutions
multilevel security
data diode
Opis:
Opracowanie jest zwięzłym przeglądem możliwych sposobów wymiany danych pomiędzy sieciami o różnych poziomach ochrony poufności. Określono potrzeby i zagrożenia związane z łączeniem sieci chronionych, a także wskazano obszary aktywności badawczych i standaryzacyjnych w tym zakresie. Opisano podstawowe komponenty bezpieczeństwa styków systemów teleinformatycznych i sposób ich wykorzystania przy tworzeniu bram międzysystemowych. W podsumowaniu wymieniono kilka bram międzysystemowych oraz wskazano istotne dla osiągania zdolności sieciocentrycznych przez SZ RP kierunki rozwoju rozwiazań typu CDS.
The paper is a brief survey of selected Cross Domain Solutions for classified network connectivity. Various needs and threats relative to CDS are discussed together with the relevant research and standardization activities. Then, the underlying information assurance components which are commonly employed in securing cross domain interfaces are described. Finally, several advanced cross domain gateways and NEC related development directions of CDS facilities are enumerated.
Źródło:
Biuletyn Instytutu Automatyki i Robotyki; 2009, R. 15, nr 26, 26; 67-80
1427-3578
Pojawia się w:
Biuletyn Instytutu Automatyki i Robotyki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Metoda wyróżniania kompleksów leśnych na podstawie ciągłości obszarów leśnych i zadrzewionych
Method of forest patches generalisation based on connectivity of forest and other wooded land areas
Autorzy:
Budniak, P.
Powiązania:
https://bibliotekanauki.pl/articles/979259.pdf
Data publikacji:
2020
Wydawca:
Polskie Towarzystwo Leśne
Tematy:
forest patch
connectivity
fragmentation
Opis:
The aim of this study was to present a method for assessing the connectivity of forest areas and the rules for generalisation of forest patches as the spatial planning units. The analyses were carried out for the entire area of Poland. Topographic maps (vector data) as well as software for spatial analysis (QGiS) and database analyses were used. Method of generalisation of forest patches involved two stages. The first one included separation of continuous forest areas consisting in the identification of patches located at a maximum distance of 50 m from each other. Patches generalised into continues forest areas were distributed among eight area classes: over 50 000 ha, 25 000,1−50 000 ha, 500,1−25 000 ha, 200,1−500 ha, 25,1−200 ha, 5,1−25 ha, 0,6−5,0 ha and up to 0,5 ha. The other step included separation of isolated continuous forest patches, which means patches that were out of the range of continuous forest areas in higher area classes. Ranges of continuous forest areas were calculated using 500 m buffer. Results of this study shows that forest patches cover 33,9% of Polish land area. Methods used in this study allowed to reduce input number of patches (764,850) by over 50% up to 338,682 ones. Generalisation of data caused changes in the landscape metrics: mean patch size more than doubled, patch density decreased by more than half, and the largest patch index increased very strongly (forty five times). Based on the literature review and results obtained in this research, it was found that in Poland afforestation intended to conservation of specialized forest species should focus on creating ecological corridors between distinguished forest patches (continuous forest areas). With the current forest cover and forest spatial structure in Poland, afforestation intended to conservation of specialized forest species by reducing edge effect in existing forest patches remains also important, but rather is a secondary need.
Źródło:
Sylwan; 2020, 164, 10; 820-830
0039-7660
Pojawia się w:
Sylwan
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 123

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