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ę "Ant Colony algorithm" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 31
Tytuł:
An improved ant colony optimization algorithm and its application to text-independent speaker verification system
Autorzy:
Aghdam, M. H.
Powiązania:
https://bibliotekanauki.pl/articles/91678.pdf
Data publikacji:
2012
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
ant colony
optimization
ant colony optimization
ACO
security
automatic speaker verification
ASV
feature space
Gaussian mixture model universal background model
GMM-UBM
Opis:
With the growing trend toward remote security verification procedures for telephone banking, biometric security measures and similar applications, automatic speaker verification (ASV) has received a lot of attention in recent years. The complexity of ASV system and its verification time depends on the number of feature vectors, their dimensionality, the complexity of the speaker models and the number of speakers. In this paper, we concentrate on optimizing dimensionality of feature space by selecting relevant features. At present there are several methods for feature selection in ASV systems. To improve performance of ASV system we present another method that is based on ant colony optimization (ACO) algorithm. After feature selection phase, feature vectors are applied to a Gaussian mixture model universal background model (GMM-UBM) which is a text-independent speaker verification model. The performance of proposed algorithm is compared to the performance of genetic algorithm on the task of feature selection in TIMIT corpora. The results of experiments indicate that with the optimized feature set, the performance of the ASV system is improved. Moreover, the speed of verification is significantly increased since by use of ACO, number of features is reduced over 80% which consequently decrease the complexity of our ASV system.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 4; 301-315
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A hybrid algorithm based on non-dominated sorting ant colony and genetic algorithmsfor solving multi-objective multi-mode project scheduling problems under resource constraints
Autorzy:
Bagherinejad, Jafar
Jolai, Fariborz
Abdollahnejad, Raheleh
Shoeib, Mahnaz
Powiązania:
https://bibliotekanauki.pl/articles/407427.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
multi-objectives project scheduling
ant colony algorithm
time-cost trade-off
resource leveling
Opis:
A project scheduling problem investigates a set of activities that have to be scheduled due to precedence priority and resource constraints in order to optimize project-related objective functions. This paper focuses on the multi-mode project scheduling problem concerning resource constraints (MRCPSP). Resource allocation and leveling, renewable and non-renewable resources, and time-cost trade-off are some essential characteristics which are considered in the proposed multi-objective scheduling problem. In this paper, a novel hybrid algorithm is proposed based on non-dominated sorting ant colony optimization and genetic algorithm (NSACO-GA). It uses the genetic algorithm as a local search strategy in order to improve the efficiency of the ant colony algorithm. The test problems are generated based on the project scheduling problem library (PSPLIB) to compare the efficiency of the proposed algorithm with the non-dominated sorting genetic algorithm (NSGA-II). The numerical result verifies the efficiency of the proposed hybrid algorithm in comparison to the NSGA-II algorithm.
Źródło:
Management and Production Engineering Review; 2020, 11, 2; 88-98
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Control imrovement of shunt active power filter using an optimized-PI controller based on ant colony algorithm and swarm optimization
Autorzy:
Berbaoui, B.
Ferdi, B.
Benachaiba, C.
Dehini, R.
Powiązania:
https://bibliotekanauki.pl/articles/385137.pdf
Data publikacji:
2010
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
ant colony optimization
particle swarm optimization (PSO)
shunt active power filter
armonic compensation
PI controller
Opis:
In the last years, there has been a increase currents harmonics on electrical network injected by nonlinear loads, such as rectifier equipment used in telecommunication system, power suppliers, domestic appliances, ect. This paper makes a comparison of the effectiveness of the two methods on particular optimization problem, namely. The tuning of the parameters for PI DC link voltage to a shunt active power filter. The simulation results demonstrates that the optimized PI controller by ant colony (ACO) presents a advantage of little response time and best control performances compared to the optimized PI with Particle swarm (PSO). This comparison is shown on redu cing harmonic current supply (THD).
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2010, 4, 4; 19-25
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant colony metaphor in a new clustering algorithm
Autorzy:
Boryczka, U.
Powiązania:
https://bibliotekanauki.pl/articles/969824.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
data mining
cluster analysis
ant clustering algorithm
Opis:
Among the many bio-inspired techniques, ant clustering algorithms have received special attention, especially because they still require much investigation to improve performance, stability and other key features that would make such algorithms mature tools for data mining. Clustering with swarm-based algorithms is emerging as an alternative to more conventional clustering methods, such as k-means algorithm. This proposed approach mimics the clustering behavior observed in real ant colonies. As a case study, this paper focuses on the behavior of clustering procedures in this new approach. The proposed algorithm is evaluated on a number of well-known benchmark data sets. Empirical results clearly show that the ant clustering algorithm (ACA) performs well when compared to other techniques.
Źródło:
Control and Cybernetics; 2010, 39, 2; 343-358
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison of nature inspired algorithms for the quadratic assignment problem
Autorzy:
Chmiel, W.
Kadłuczka, P.
Kwiecień, J.
Filipowicz, B.
Powiązania:
https://bibliotekanauki.pl/articles/202135.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
permutation problem
quadratic assignment problem
ant algorithm
bees algorithm
problem permutacji
problem przydziału kwadratowego
algorytm Ant Colony
algorytm pszczół
Opis:
This paper presents an application of the ant algorithm and bees algorithm in optimization of QAP problem as an example of NP-hard optimization problem. The experiments with two types of algorithms: the bees algorithm and the ant algorithm were performed for the test instances of the quadratic assignment problem from QAPLIB, designed by Burkard, Karisch and Rendl. On the basis of the experiments results, an influence of particular elements of algorithms, including neighbourhood size and neighbourhood search method, will be determined.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 513-522
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison between Dijkstra algorithm and simplified ant colony optimization in navigation
Analiza porównawcza algorytmu Dijkstry i uproszczonego algorytmu mrówkowego w nawigacji
Autorzy:
Dramski, M.
Powiązania:
https://bibliotekanauki.pl/articles/360173.pdf
Data publikacji:
2012
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
poszukiwanie najkrótszej drogi
akwen ograniczony
nawigacja
shortest path routing
restricted area
navigation
Opis:
In this paper, two different shortest path routing algorithms in respect of basic navigation problems are discussed. First of them is a “state of art” in computer science – well known Dijkstra algorithm. The second one is a method based on artificial intelligence – simplified ant colony optimization proposed originally by Marco Dorigo. Author used both ways to find an optimal / suboptimal route for a ship in a restricted area. Results showed the advantages and disadvantages of both algorithms in simple static navigation situations.
W artykule omówiono dwa różne algorytmy poszukiwania najkrótszej drogi w odniesieniu do zagadnień nawigacji. Pierwszym z nich jest algorytm Dijkstry, stanowiący podstawę rozwiązywania tego typu problemów. Drugi to metoda bazująca na sztucznej inteligencji – uproszczony algorytm mrówkowy, zaproponowany przez Marco Dorigo. Autor używał obu sposobów w celu uzyskania optymalnej, bądź suboptymalnej trasy dla statku na akwenie ograniczonym. Rezultaty badań pokazały korzyści i wady ze stosowania obu rozwiązań w prostych sytuacjach nawigacyjnych.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2012, 29 (101); 25-29
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Ant Colony Optimization Algorithm for Scheduling Parallel Machines with Sequence-Dependent Setup Costs
Zastosowanie algorytmu mrówkowego do szeregowania zadań na maszynach równoległych z uwzględnieniem kosztów przezbrojeń zależnych od kolejności zadań
Autorzy:
Figielska, E.
Powiązania:
https://bibliotekanauki.pl/articles/91349.pdf
Data publikacji:
2013
Wydawca:
Warszawska Wyższa Szkoła Informatyki
Tematy:
ant colony optimization
unrelated machines
sequence-dependent setup costs
resource constraints
algorytm mrówkowy
dowolne maszyny
koszty przezbrojeń
kolejność zadań
ograniczenia zasobowe
Opis:
The paper addresses the problem of scheduling preemptive jobs on parallel unrelated machines in the presence of renewable resource constraints and sequence-dependent setup costs. The objective is to minimize the weighted sum of makespan and setups. The problem is known to be NP-hard. To solve this problem, a heuristic is proposed which uses column generation technique and an ant colony optimization algorithm. The results of a computational experiment indicate that the heuristic is able to produce good results in reasonable computation time.
Artykuł dotyczy zagadnienia szeregowania zadań podzielnych na równoległych dowolnych maszynach z uwzględnieniem ograniczeń na dostępność zasobów odnawialnych oraz kosztów przezbrojeń zależnych od kolejności wykonywania zadań. Celem jest minimalizacja ważonej sumy czasu trwania harmonogramu i przezbrojeń. Zagadnienie należy do klasy problemów NP-trudnych. W celu jego rozwiązania, zaproponowany został algorytm heurystyczny, wykorzystujący technikę generacji kolumn, oraz algorytm mrówkowy. Wyniki eksperymentu obliczeniowego wskazują, że algorytm ten jest zdolny dostarczyć dobrej jakości wyniki w rozsądnym czasie.
Źródło:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki; 2013, 7, 9; 15-26
1896-396X
2082-8349
Pojawia się w:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Adaptive ant-colony algorithm for semantic query routing
Autorzy:
Gómez Santillán, C.
Cruz Reyes, L.
Schaeffer, E.
Meza, E.
Rivera Zarate, G.
Powiązania:
https://bibliotekanauki.pl/articles/384885.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
parameter tuning
search algorithm
peer-to-peer
adaptive algorithm
local environment
ant colony algorithms
Opis:
The most prevalent P2P application today is file sha ring, both among scientific users and the general public. Afundamental process in file sharing systems is the search mechanism. The unstructured nature of real-world largescale complex systems poses a challenge to the search me thods, because global routing and directory services are impractical to implement. This paper presents a new antcolony algorithm, Adaptive Neighboring-Ant Search (AdaNAS), for the semantic query routing problem (SQRP) in a P2P network. The proposed algorithm incor porates an adaptive control parameter tuning technique for runtime estimation of the time-to-live (TTL) of the ants. AdaNAS uses three strategies that take advantage of the local environment: learning, characterization, and explo ration. Two classical learning rules are used to gain ex perience on past performance using three new learning functions based on the distance traveled and the resources found by the ants. The experimental results show that the AdaNAS algorithm outperforms the NAS algorithm where the TTLvalue is not tuned at runtime.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 1; 85-94
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ship route planning using historical trajectories derived from AIS Data
Autorzy:
He, Y. K.
Zhang, D.
Zhang, J. F.
Zhang, M. Y.
Li, T. W.
Powiązania:
https://bibliotekanauki.pl/articles/116536.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
AIS Data
Automatic Identification System (AIS)
route planning
historical trajectories
AIS messages
marine traffic
Dijkstra algorithm
ant colony algorithm
Opis:
Ship route planning is one of the key issues in enhancing traffic safety and efficiency. Many route planning methods have been developed, but most of them are based on the information from charts. This paper proposes a method to generate shipping routes based on historical ship tracks. The ship's historical route information was obtained by processing the AIS data. From which the ship turning point was extracted and clustered as nodes. The ant colony algorithm was used to generate the optimize route. The ship AIS data of the Three Gorges dam area was selected as a case study. The ships’ optimized route was generated, and further compared with the actual ship's navigation trajectory. The results indicate that there is space of improvement for some of the trajectories, especially near the turning areas.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 1; 69-76
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reconstruction of boundary condition of the third kind by applying the Ant Colony Optimization algorithm
Odtworzenie warunku brzegowego trzeciego rodzaju przy zastosowaniu algorytmu mrówkowego
Autorzy:
Hetmaniok, E.
Zielonka, A.
Powiązania:
https://bibliotekanauki.pl/articles/87300.pdf
Data publikacji:
2011
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
warunek brzegowy
algorytm mrówkowy
przewodnictwo cieplne
zagadnienie odwrotne
boundary condition
ant colony optimization
heat conduction
inverse problem
Opis:
In this paper we present an application of the Ant Colony Optimization algorithm for solving the inverse heat conduction problem in which the state function and some of the boundary conditions should be determined. The ACO algorithm is a part of the swarm intelligence and it is inspired by the technique of searching for the shortest way connecting the ant-hill with the source of food. We propose to use this algorithm for minimizing the proper functional, which plays a crucial role in the method of solution and allows to reconstruct the value of heat transfer coefficient.
W niniejszym artykule przedstawione zostało zastosowanie algorytmu mrówkowego do rozwiązania odwrotnego zagadnienia przewodnictwa ciepła, polegającego na wyznaczeniu funkcji stanu oraz rekonstrukcji jednego z warunków brzegowych. Algorytm mrówkowy należy do grupy algorytmów inteligencji roju i zainspirowany został techniką wyszukiwania najkrótszej drogi łączącej mrowisko ze źródłem pożywienia. W proponowanym podejściu algorytm ten zostanie wykorzystany do wyznaczania minimum funkcjonału będącego istotnym elementem metody rozwiązania, umożliwiającym odtworzenie wartości współczynnika wnikania ciepła.
Źródło:
Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska; 2011, 1; 137-147
2084-073X
Pojawia się w:
Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
User habits and multimodal route planning
Autorzy:
Katona, G.
Juhasz, J.
Powiązania:
https://bibliotekanauki.pl/articles/112017.pdf
Data publikacji:
2017
Wydawca:
Stowarzyszenie Menedżerów Jakości i Produkcji
Tematy:
user habits
multimodal route planning
Ant Colony algorithm
planowanie trasy
algorytm mrówkowy
nawyki komunikacyjne
wymagania użytkowników
Opis:
The results of route planning researches are monitored by logistic and automotive industries. The economic aspects of the cost saving are in the focus of the attention. An optimal route could cause time or fuel savings. An effective driving or an optimal route is a good basis to achieve an economical aim. Moreover the spread of new automotive solutions especially in case of electric cars the optimisation has particular significance regarding the limited battery storage. Additionally the autonomous car development could not be neglected. As a result the society could expect safer roads, better space usage and effective resource management. Nevertheless the requirements of users are extremely diverse, which is not negligible. Supporting these aims, in this paper the connection between the multimodal route planning and the user requirements are investigated. The examination is focused to a sensitivity analysis and a survey to evaluate the data and support the settings of a user habit effect to the final route.
Źródło:
Production Engineering Archives; 2017, 16; 22-27
2353-5156
2353-7779
Pojawia się w:
Production Engineering Archives
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Development of a modified ant colony algorithm for order scheduling in food processing plants
Autorzy:
Korobiichuk, Igor
Hrybkov, Serhii
Seidykh, Olga
Ovcharuk, Volodymyr
Ovcharuk, Andrii
Powiązania:
https://bibliotekanauki.pl/articles/2204558.pdf
Data publikacji:
2022
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
order fulfillment planning
modified ant colony algorithm
efficiency of the algorithms
optimization
food industry
Opis:
This developed modified ant colony algorithm includes an additional improvement with local optimization methods, which reduces the time required to find a solution to the problem of optimization of combinatorial order sequence planning in a food enterprise. The planning problem requires consideration of a number of partial criteria, constraints, and an evaluation function to determine the effectiveness of the established version of the order fulfillment plan. The partial criteria used are: terms of storage of raw materials and finished products, possibilities of occurrence and processing of substandard products, terms of manufacturing orders, peculiarities of fulfillment of each individual order, peculiarities of use of technological equipment, expenses for storage and transportation of manufactured products to the end consumer, etc. The solution of such a problem is impossible using traditional methods. The proposed algorithm allows users to build and reconfigure plans, while reducing the time to find the optimum by almost 20% compared to other versions of algorithms.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2022, 16, 1; 53--61
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of ant-colony algorithm to the issue of improving rectified voltage parameters in electric tram traction
Autorzy:
Kulesz, B.
Sikora, A.
Zielonka, A.
Powiązania:
https://bibliotekanauki.pl/articles/374940.pdf
Data publikacji:
2018
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
ant colony optimization
traction voltage
tram traction
voltage transformation
tap changer
distorted voltage
voltage unbalance
multi-winding transformer
trakcja tramwajowa
transformacja napięcia
napięcie odkształcone
nierównowaga napięć
transformator wielouzwojeniowy
optymalizacja kolonią mrówek
napięcie sieci trakcyjnej
przełącznik zaczepów
Opis:
In this paper, the problem related to transformation of ac voltage into DC voltage used in tram supply is considered. A variable component is always present in rectified voltage. Pulsation of rectified voltage is influenced by different factors. In a 12-pulse system, where two secondary transformer windings are used (one delta-connected and the other star-connected), an additional factor increasing the pulsation is the unbalance of the output voltages at these windings. Tap changer may be used and its setting is optimized here by applying the ant-colony algorithm. Different supply voltage variants have been considered. It is demonstrated that pulsation may be reduced by even 25%.
Źródło:
Transport Problems; 2018, 13, 2; 133-144
1896-0596
2300-861X
Pojawia się w:
Transport Problems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A hybrid ant colony for multiresponse mixed-integer problems
Autorzy:
Kushwaha, S.
Mukherjee, I.
Powiązania:
https://bibliotekanauki.pl/articles/409419.pdf
Data publikacji:
2012
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
ant colony optimization(ACO)
desirability functions
genetic algorithm (GA)
multiple response optimization(MRO)
Opis:
In this paper, a hybrid ant colony optimization (ACO) is used to solve a multiple response optimization problem with mixed-integer (MI) search space. The work reported in this paper may be clasified into three part. The first part discusses on relevant litratures and the methodology to solve multiple response optimization problem. The second part provide details on the working principal, parameter tuning of a hybrid ACO proposed for mixed integer state space. In the hybrid ACO, genetic algorithm (GA) is used for intensification of the search strategy. Standard single response (objective) test functions are selected to verify the suitability of hybrid ACO. The third part of this research work illustrates the application of the hybrid ACO in a multiple response optimization (MRO) problem. Statistical experimentation, partial least square regression, 'maximin' desirability function, and hybrid ACO is used to solve the MRO problem. The results confirm the suitability of the hybid ACO for a typical MI MRO problem.
Źródło:
Research in Logistics & Production; 2012, 2, 4; 317-327
2083-4942
2083-4950
Pojawia się w:
Research in Logistics & Production
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A nature inspired collision avoidance algorithm for ships
Autorzy:
Lazarowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/24201448.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
collision avoidance algorithm
safe own Ship's Trajectory
safe navigation
ant colony optimization
firefly agorithm
path planning
swarm intelligence
nature inspired computing
Opis:
Nature inspired algorithms are regarded as a powerful tool for solving real life problems. They do not guarantee to find the globally optimal solution, but can find a suboptimal, robust solution with an acceptable computational cost. The paper introduces an approach to the development of collision avoidance algorithms for ships based on the firefly algorithm, classified to the swarm intelligence methods. Such algorithms are inspired by the swarming behaviour of animals, such as e.g. birds, fish, ants, bees, fireflies. The description of the developed algorithm is followed by the presentation of simulation results, which show, that it might be regarded as an efficient method of solving the collision avoidance problem. Such algorithm is intended for use in the Decision Support System or in the Collision Avoidance Module of the Autonomous Navigation System for Maritime Autonomous Surface Ships.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2023, 17, 2; 341--346
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 31

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