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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 41
Tytuł:
Anycasting in connection-oriented computer networks: Models, algorithms and results
Autorzy:
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/907768.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć połączeniowa
optymalizacja
MPLS
odporność
anycasting
connection-oriented networks
optimization
survivability
Opis:
Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of anycasting is growing concurrently with the popularity of electronic music, movies, and other content required by Internet users. In this work we focus on the optimization of anycast flows in connection-oriented networks. We formulate a model of anycast connections and next propose a heuristic algorithm based on the Lagrangean relaxation aimed to optimize jointly routes for anycast and unicast connections. Results of numerical experiments are presented and evaluated. Finally, we analyze briefly problems related to anycasting in dynamic routing and multi-layer networks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 1; 207-220
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An exact algorithm for design of content delivery networks in MPLS environment
Autorzy:
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/308183.pdf
Data publikacji:
2004
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
content delivery network
optimization
branch-and-cut algorithm
Opis:
Content delivery network (CDN) is an efficient and inexpensive method to improve Internet service quality. In this paper we formulate an optimisation problem of replica location in a CDN using MPLS techniques. A novelty, comparing to previous work on this subject, is modelling the network flow as connection-oriented and introduction of capacity constraint on network links to the problem. Since the considered optimisation problem is NP-complete, we propose and discuss exact algorithm based on the branch-and-cut and branch-and-bound methods. We present results of numerical experiments showing comparison of branch-and-cut and branch-and-bound methods.
Źródło:
Journal of Telecommunications and Information Technology; 2004, 2; 13-22
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The branch and bound algorithm for a backup virtual path assignment in survivable atm networks
Autorzy:
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/907991.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automatyka
survivable networks
ATM
branch and bound algorithm
Opis:
Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination rerouting strategy. The function of the flow lost due to a failure of a single link is chosen as the performance index. The problem of finding the optimal virtual path assignment is NP-complete. Therefore we develop an exact algorithm based on the branch and bound approach. Moreover, two heuristic algorithms are proposed. Numerical results are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 2; 257-267
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant Algorithm for Flow Assignment in Connection-oriented Networks
Autorzy:
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/911137.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytm mrówkowy
przypisanie przepływu
sieć komputerowa
ant algorithms
flow assignment
computer networks
Opis:
This work introduces ANB (Ant Algorithm for Non-Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern the use of ant algorithms in the assignment of static flows in connection-oriented networks. We analyze the major characteristics of the ANB and try to explain its performance. We report results of many experiments over various networks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 2; 205-220
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modelling of Minimum Cost Overlay Multicast Tree in Two Layer Networks
Autorzy:
Kucharzak, M.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/226288.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
modelling
overlay multicast
multilayer networks
Opis:
Multicast realises the data delivering to a group of destinations simultaneously while using the minimum network resources. The first implementation of multicasting has been built using specialized multicast routers and is well known as IP Multicast. Such a network comprises some drawback including complex addressing and routing scheme, it requires the deployment of special routers that are rather expensive and finally, there has not been proposed a reasonable business model regarding cross-providers multicast realization. Thereby, for the past few years, a new interest in delivering multicast traffic has arisen and some multicast systems defined for end-hosts overlay network have been successfully proposed. Overlay multicast implements a multicast technique at the top of computer networks and creates a virtual topology of clients which duplicate packets and maintain a multicast structure. This overlay structure forms an independent layer with logical links between the nodes without the knowledge about the underlaying topology. In the work we take a look at flow cost minimization of multicast stream in a system which combines the advantages of overlays and underlaying network awareness. This papers presents three independent linear-based models aimed at optimization of multicast tree topology and its network level unicast realization. The proposed formulations can be applied for deriving either lower bound of flows costs in existing systems or for designing new cooperative multilayer protocols for effective multicast transmission.
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 3; 317-322
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimizing cost of network upgrade for overlay multicast – heuristic approach
Autorzy:
Szostak, M.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/309120.pdf
Data publikacji:
2013
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
multicasting
network design
optimization
overlay network
streaming
Opis:
A rapid increase of the Internet users and traffic at the rate of 31% in years 2011–2016 contributes to emerging of new approaches to the content distribution. Among other approaches, the overlay multicasting seems to be one of the most interesting concepts according to relatively low deployment costs and large scalability. In this paper, the authors formulate a new incremental multicast overlay design problem. In particular, authors assumed that the overlay network is to be upgraded due to an increase of the number of participating users and the need to improve the streaming quality. However, the existing multicast tree structure is assumed to remain fixed. The goal was to minimize the cost of the upgrade, represented in euro/month. To achieve it, for each peer participating in the transmission, a link type offered by one of the ISPs was selected and overlay trees were constructed, rooted at the source of the content. The authors also present a new heuristic algorithm to efficiently solve this problem. According to experiments, the biggest factor influencing the upgrade cost and determining possible streaming quality values that the system can be upgraded to is the initial tree structure.
Źródło:
Journal of Telecommunications and Information Technology; 2013, 3; 66-73
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A column generation technique for routing and spectrum allocation in cloud-ready survivable elastic optical networks
Autorzy:
Goścień, R.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/330528.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
elastic optical network
anycast traffic
multicast traffic
network survivability
column generation technique
elastyczna sieć optyczna
sieć przełącznikowa
przeżywalność sieci
Opis:
Driven by increasing user requirements and expectations, the fast development of telecommunications networks brings new challenging optimization problems. One of them is routing and spectrum allocation (RSA) of three types of network flows (unicast, anycast, multicast) in elastic optical networks (EONs) implementing dedicated path protection (DPP). In the paper, we model this problem as integer linear programming (ILP) and we introduce two new optimization approaches—a dedicated heuristic algorithm and a column generation (CG)-based method. Then, relying on extensive simulations, we compare algorithm performance with reference methods and evaluate CG efficiency in detail. The results show that the proposed CG method significantly outperforms reference algorithms and achieves results very close to optimal ones (the average distance to optimal results was at most 2.1%).
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 3; 591-603
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Random Approach to Optimization of Overlay Public-Resource Computing Systems
Autorzy:
Chmaj, G.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/226168.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
computing systems
overlay
P2P
unicast
optimization
Opis:
The growing need for computationally demanding systems triggers the development of various network-oriented computing systems organized in a distributed manner. In this work we concentrate on one kind of such systems, i.e. public-resource computing systems. The considered system works on the top of an overlay network and uses personal computers and other relatively simple electronic equipment instead of supercomputers. We assume that two kinds of network flows are used to distribute the data in the public-resource computing systems: unicast and peer-to-peer. We formulate an optimization model of the system. After that we propose random algorithms that optimize jointly the allocation of computational tasks and the distribution of the output data. To evaluate the algorithms we run numerical experiments and present results showing the comparison of the random approach against optimal solutions provided by the CPLEX solver.
Źródło:
International Journal of Electronics and Telecommunications; 2010, 56, 1; 55-61
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows
Autorzy:
Gładysz, J.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/226174.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
anycast
network design
tabu search
survivability
Opis:
In this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.
Źródło:
International Journal of Electronics and Telecommunications; 2010, 56, 1; 41-47
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Two Approaches to Network Design Problem for Overlay Multicast with Limited Tree Delay : Model and Optimal Results
Autorzy:
Szostak, M.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/226284.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
overlay network
multicasting
optimization
network design
Opis:
Live multimedia streaming and on-demand streaming applications (such as Internet radio or Internet TV) have been gaining more popularity in recent years. They require significant amount of bandwidth from media streaming servers and can easily saturate network infrastructure when the number of participant or bit rate of streaming content increases. Overlay multicast is an effective approach to the problem of streaming distribution. It combines flexibility of application layer multicast with efficiency of network layer multicast. Since overlay networks are built on the top of existing infrastructure, the cost of maintenance and deployment of this solution is relatively low compared to traditional Content Distribution Networks (CDN). Based on our previous works, we focus on solving the overlay network design problem to economically distribute content among the participants using overlay multicast. The optimization goal is to minimize the overlay network cost expressed by the cost of access links. Additionally, we assume that the maximum total delay of a streaming tree is upper bounded to provide QoS (Quality of Service) guarantees. We present two approaches to this problem and construct model using Levels and Flow Conservation Constraints. We show how various constraints following from real overlay systems influence the behavior of the distributing system. In numerical experiments we use real ISPs' price lists. To illustrate our approach we present optimal results obtained from the CPLEX solver.
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 3; 335-340
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks
Autorzy:
Przewoźniczek, M.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/908380.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytm ewolucyjny
optymalizacja
sieć komputerowa
evolution algorithm
optimization
connection-oriented networks
Opis:
The main objective of this paper is to develop an effective evolutionary algorithm (EA) for the path-assignment problem in survivable connection-oriented networks. We assume a single-link failure scenario, which is the most common and frequently reported failure event. Since the network flow is modeled as a non-bifurcated multicommodity flow, the discussed optimization problem is NP-complete. Thus, we develop an effective heuristic algorithm based on an evolutionary algorithm. The main novelty of this work is that the proposed evolutionary algorithm consists of two levels. The “high” level applies typical EA operators. The “low” level is based on the idea of a hierarchical algorithm. However, the presented approach is not a classical hierarchical algorithm. Therefore, we call the algorithm quasi-hierarchical. We present its description and the results of simulation runs over various networks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 4; 487-502
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of overlay computing systems with many – to - many transmissions
Optymalizacja nakładkowych systemów obliczeniowych z transmisjami wielu do wielu
Autorzy:
Walkowiak, K.
Kasprzak, A.
Andrusieczko, K.
Powiązania:
https://bibliotekanauki.pl/articles/375736.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
optimization
computing systems
overlay
heuristics
Opis:
The problem that this paper investigates, namely, optimization of overlay computing systems, follows naturally from growing need for effective processing and consequently, fast development of various distributed systems. We consider an overlay-based computing system, i.e., a virtual computing system is deployed on the top of an existing physical network (e.g., Internet) providing connectivity between computing nodes. The main motivation behind the overlay concept is simple provision of network functionalities (e.g., diversity, flexibility, manageability) in a relatively cost-effective way as well as regardless of physical and logical structure of underlying networks. The workflow of tasks processed in the computing system assumes that there are many sources of input data and many destinations of output data, i.e., many-to-many transmissions are used in the system. The addressed optimization problem is formulated in the form of an ILP (Integer Linear Programing) model. Since the model is computationally demanding and NPcomplete, besides the branch-and-bound algorithm included in the CPLEX solver, we propose additional cut inequalities. Moreover, we present and test two effective heuristic algorithms: tabu search and greedy. Both methods yield satisfactory results close to optimal.
Zagadnienia dotyczące optymalizacji systemów obliczeń rozproszonych zyskują w ostatnich latach na znaczeniu. Systemy obliczeń rozproszonych rozwijane są w dwóch podstawowych architekturach sieciowych. Po pierwsze, budowane są dedykowane sieci optyczne łączące ośrodki obliczeniowe. Po drugie, wykorzystuje się istniejącą infrastrukturę sieciową (np. Internet) dla budowania systemów pracujących w architekturze nakładkowej (ang. overlay). Ta druga koncepcja zyskuje ostatnio dużą popularność, gdyż umożliwia szybką i tanią realizację systemów obliczeniowych bez potrzeby mocnej współpracy z operatorami sieciowymi. W pracy rozważamy nakładkowy system obliczeniowy umożliwiający transmisje wielu do wielu – dane wejściowe do obliczeń są generowane w wielu źródłach (węzłach sieciowych), następnie po przetworzeniu są przesyłane do wielu odbiorców zainteresowanych wynikami obliczeń. W oparciu o zaproponowaną architekturę systemu, w pracy sformułowano problem optymalizacyjny mający na celu minimalizację kosztów operacyjnych systemu obejmujących koszty obliczeń i koszty przesyłania danych. Model został zapisany jako program całkowitoliczbowy. Z uwagi na fakt, że ten problem należy do klasy problemów NP-zupełnych, zaproponowano dodatkowe odcięcia dla algorytmu podziału i oszacowań oraz dwa efektywne algorytmy heurystyczne. Przeprowadzone eksperymenty obliczeniowe wykazały, że opracowane algorytmy dają wyniki bliskie optymalnym w mniejszym czasie niż algorytm optymalny zawarty w pakiecie CPLEX
Źródło:
Theoretical and Applied Informatics; 2012, 24, 4; 271-291
1896-5334
Pojawia się w:
Theoretical and Applied Informatics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparison of Evolutionary Algorithm and Heuristics for Flow Optimization in P2P Systems
Autorzy:
Kucharzak, M.
Siwek, A.
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/226952.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
P2P
flows
network optimization
Opis:
Nowadays, many Internet users make use of Peer-to-Peer (P2P) systems to download electronic content including music, movies, software, etc. Growing popularity in P2P based protocol implementations for file sharing purposes caused that the P2P traffic exceeds Web traffic and in accordance with to many statistics, P2P systems produce a more than 50% of the whole Internet traffic. Therefore, P2P systems provide remarkable income for Internet Service Providers (ISP). However, at the same time P2P systems generates many problems related to traffic engineering, optimization, network congestion. In this paper we focus on the problem of flow optimization in P2P file sharing systems. Corresponding to BitTorrent-based systems behaviour, the optimization of P2P flows is very complex and in this work we consider different heuristic strategies for content distribution and moreover we propose a new evolutionary algorithm (EA) for this problem. We compare results of the algorithms against optimal results yielded by CPLEX solver for networks including 10 peers and relation to random algorithm for 100-node systems. According to numerical experiments, the EA provides solutions close to optimal for small instances and all of the heuristics exhibit a superior performance over random search.
Źródło:
International Journal of Electronics and Telecommunications; 2010, 56, 2; 145-152
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
ILP modeling of many-to-many replicated multimedia communication
Autorzy:
Walkowiak, K.
Bulira, D.
Careglio, D.
Powiązania:
https://bibliotekanauki.pl/articles/308697.pdf
Data publikacji:
2013
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
ILP modeling
many-to-many communication
network optimization
replica location
Opis:
On-line communication services were evolving from a simple text-based chats towards sophisticated videopresence appliances. The bandwidth consumption of those services is constantly growing due to the technology development and high user and business needs. That fact leads us to implement optimization mechanisms into the multimedia communication scenarios. In this paper, the authors concentrate on many-to-many (m2m) communication, that is mainly driven by the growing popularity of on-line conferences and telepresence applications. An overlay model where m2m flows are optimally established on top of a given set of network routes is formulated and a joint model where the network routes and the m2m flows are jointly optimized. In the models, the traffic traverses through replica servers, that are responsible for stream aggregation and compression. Models for both predefined replica locations and optimized server settlement are presented. Each model is being followed by a comprehensive description and is based on real teleconference systems.
Źródło:
Journal of Telecommunications and Information Technology; 2013, 3; 56-65
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Kościół trwał niezłomnie… trwa i trwać będzie…
L’Église subsistait inflexible… subsiste et subsistera…
Autorzy:
Walkowiak, Katarzyna K.
Powiązania:
https://bibliotekanauki.pl/articles/553845.pdf
Data publikacji:
2011-06-30
Wydawca:
Wyższe Seminarium Misyjne Księży Sercanów
Tematy:
Kościół
Opis:
Les paroles du Livre des Actes des Apôtres évoquent les temps de l’Église primitive de Jérusalem lorsque cette Église n’était pas encore divisée: « Ils étaient assidus à l’enseignement des apôtres, et à la communion fraternelle, à la fraction du pain, et aux prières » (Ac 2:42). C’est pourquoi les premiers chrétiens persévéraient dans l’unité, d’une façon unanime et avec vigueur. La persévérance dans la foi suppose la stabilité, suppose que l’on (conserve) jusqu’à la fin l’idée première, malgré des tentations de désespoir ou de résignation. Être assidu dans l’enseignement des Apôtres signifiait pour les premiers chrétiens la construction de la foi en s’appuyant sur la Parole. Dans le cadre des efforts vers l’unité visible de l’Église, le Concile Vatican II a défini l’état de l’Église existante depuis le début aussi bien que le statut et la nature des communautés chrétiennes. Cela a été fait en utilisant le terme – subsistit in (demeure en) : «une seule Église du Christ (…) établie et organisée en ce monde, en tant que communauté demeure et persévère dans l’Église catholique (…) ». L’unité visible de l’Église est la réalisation de l’Église à venir. La constance de la foi est une attitude fondamentale pour persévérer dans le Christ et dans l’Église. Elle implique une sorte de kénose, qui se manifeste dans l’abandon de l’incrédulité et de la mentalité païenne. Cette constance de la foi est assurée lorsqu’un disciple de Jésus nourrit régulièrement son esprit et son cœur de la Parole de Dieu: du kérygme et de la catéchèse. La constance de la foi des disciples du Seigneur détermine leur persistance dans la Communauté de l’Église, qui, en elle-même, durera de toute manière.
Źródło:
Sympozjum; 2011, 1(20); 123-135
2543-5442
Pojawia się w:
Sympozjum
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 41

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