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ę "Voss, R." wg kryterium: Autor


Wyświetlanie 1-3 z 3
Tytuł:
Requirements of 4G-Based Mobile Broadband on Future Transport Networks
Autorzy:
Fricke, M.
Heckwolf, A.
Herber, R.
Nitsch, R.
Schwarze, S.
Voß, S.
Powiązania:
https://bibliotekanauki.pl/articles/309203.pdf
Data publikacji:
2012
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
backhauling
LTE advanced
mobile network de-sign
X2 interface
Opis:
Long term evolution technologies provide new standards in mobile communications regarding available bandwidth. It is expected that users of one radio cell will share more than 100 Mbit/s in future. To take advantage of the full feature set of next generation mobile networks, transport network design has to face new requirements, caused by the architectural changes of LTE technologies. Especially the newly defined X2 interface impacts on the transport network requirements. X2 enables direct communication between evolved base stations (eNBs) and thus, enforces local solutions. At the same time a tendency of locating network elements at fewer, central sites to reduce operational expenditure can be observed, in particular concerning the transport layer. This leads to the question of how the direct X2 connection of eNBs on the logical layer can be accommodated with a general centralization of transport networks. Our considerations show that for LTE, a centralized transport network is able to realize the local meshing between eNBs. However, for LTE Advanced, the standards currently discussed by the 3GPP initiative could lead to enhanced requirements on the X2 interface latency. Consequently, the implications for the network architecture have to be analyzed in more detail.
Źródło:
Journal of Telecommunications and Information Technology; 2012, 2; 21-28
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Feeding ecology of sprat (Sprattus sprattus L.) and sardine (Sardina pilchardus W.) larvae in the German Bight, North Sea
Autorzy:
Voss, R.
Dickmann, M.
Schmidt, J.O.
Powiązania:
https://bibliotekanauki.pl/articles/47806.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Oceanologii PAN
Tematy:
German Bight
sprat
coexistence
Sprattus sprattus
North Sea
habitat preference
food competition
Sardina pilchardus
larva
sardine
feeding ecology
Opis:
The abundance of the sardine in the North Sea suddenly increased after 1995. Since 2002, the sardine has been spawning regularly in the German Bight, and all its life stages can be found in the area. The larval feeding ecology of two small pelagic clupeiform species with very similar life histories was investigated, the particular aim being to determine signs of food overlap. The distribution and feeding of sprat and sardine larvae were investigated during late spring 2003 on two transects covering a wide range of environmental conditions in the German Bight. Larvae co-occurred at all the stations investigated. Sprat and sardine larvae shared a wide range of prey types. Gut fullness and feeding success were similar in both species; however, potential food competition is avoided to some extent by different habitat preferences.
Źródło:
Oceanologia; 2009, 51, 1; 117-138
0078-3234
Pojawia się w:
Oceanologia
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Extensions of the minimum labelling spanning tree problem
Autorzy:
Cerulli, R.
Fink, A.
Gentili, M.
Voss, S.
Powiązania:
https://bibliotekanauki.pl/articles/308930.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
network design
metaheuristics
spanning trees
labelling trees
Steiner tree problem
Opis:
In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic vertices), we look for a connected subgraph of G with the minimum number of different colors covering all the basic vertices. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity by means of homogeneous connections. Numerical results for several metaheuristics to solve the problem are presented.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 4; 39-45
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
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