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ę "A* algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 50
Tytuł:
Real-time interpolation of streaming data
Autorzy:
Dębski, Roman
Powiązania:
https://bibliotekanauki.pl/articles/1839246.pdf
Data publikacji:
2020
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
streaming algorithm
online algorithm
spline interpolation
cubic Hermite spline
Opis:
One of the key elements of the real-time C 1 -continuous cubic spline interpolation of streaming data is an estimator of the first derivative of the interpolated function that is more accurate than those based on finite difference schemas. Two such greedy look-ahead heuristic estimators, based on the calculus of variations (denoted as MinBE and MinAJ2), are formally defined (in closed form), along with the corresponding cubic splines that they generate. They are then comparatively evaluated in a series of numerical experiments involving different types of performance measures. The presented results show that the cubic Hermite splines generated by heuristic MinAJ2 significantly outperformed those that were based on finite difference schemas in terms of all of the tested performance measures (including convergence). The proposed approach is quite general. It can be directly applied to streams of univariate functional data like time-series. Multi-dimensional curves that are defined parametrically (after splitting) can be handled as well. The streaming character of the algorithm means that it can also be useful in processing data sets that are too large to fit in the memory (e.g., edge computing devices, embedded time-series databases).
Źródło:
Computer Science; 2020, 21 (4); 513-532
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
FPGA-based secure and noiseless image transmission using lea and optimized bilateral filter
Autorzy:
Hebbale, Sunil B.
Akula, V.S. Giridhar
Baraki, Parashuram
Powiązania:
https://bibliotekanauki.pl/articles/27312891.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
lightweight encryption algorithm
bilateral filter
whale optimization algorithm
discrete wavelet transform
Opis:
In today’s world, the transmission of secured and noiseless images is a difficult task. Therefore, effective strategies are important for securing data or secret images from attackers. Besides, denoising approaches are important for obtaining noise-free images. For this, an effective crypto-steganography method that is based on a lightweight encryption algorithm (LEA) and the modified least significant bit (MLSB) method for secured transmission is proposed. Moreover, a bilateral filter-based whale optimization algorithm (WOA) is used for image denoising. Before the image transmission, a secret image is encrypted by the LEA algorithm and embedded into the cover image using discrete wavelet transform (DWT) and MLSB techniques. After the image transmission, an extraction process is performed in order to recover the secret image. Finally, a bilateral WOA filter is used to remove the noise from the secret image. The Verilog code for the proposed model is designed and simulated in Xilinx software. Finally, the simulation results show that the proposed filtering technique results in performance that is superior to conventional bilateral and Gaussian filters in terms of the peak signal-to-noise ratio (PSNR) and structural similarity index measure (SSIM).
Źródło:
Computer Science; 2022, 23 (4); 451--466
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Meta-heuristic approach based on genetic and greedy algorithms to solve flexible job-shop scheduling problem
Autorzy:
Rezaeipanah, Amin
Sarhangnia, Fariba
Abdollahi, Mohammad Javad
Powiązania:
https://bibliotekanauki.pl/articles/2097966.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
job-shop scheduling
meta-heuristic method
genetic algorithm
greedy algorithm
jobs priority
Opis:
Job-shop scheduling systems are one of the applications of group technology in industry, the purpose of which is to take advantage of the physical or operational similarities of products in their various aspects of construction and design. Additionally, these systems are identified as cellular manufacturing systems (CMS). In this paper, a meta-heuristic method that is based on combining genetic and greedy algorithms has been used in order to optimize and evaluate the performance criteria of the flexible job-shop scheduling problem. In order to improve the efficiency of the genetic algorithm, the initial population is generated by the greedy algorithm, and several elitist operators are used to improve the solutions. The greedy algorithm that is used to improve the generation of the initial population prioritizes the cells and the job in each cell and, thus, offers quality solutions. The proposed algorithm is tested over the P-FJSP dataset and compared with the state-of-the-art techniques of this literature. To evaluate the performance of the diversity, spacing, quality, and run-time criteria were used in a multi-objective function. The results of the simulation indicate the better performance of the proposed method as compared to the NRGA and NSGA-II methods.
Źródło:
Computer Science; 2021, 22 (4); 463--488
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant algorithm for AP-N aimed at optimization of complex systems
Autorzy:
Mikulik, J.
Zajdel, M.
Powiązania:
https://bibliotekanauki.pl/articles/375987.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
assignment problem
ant algorithm
optimization
Opis:
Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions and a few non-deterministic methods have been proposed to solve it. This paper pays attention on new heuristic search method for the n-dimensional assignment problem, based on swarm intelligence and comparing results with those obtained by other scientists. It indicates possible direction of solutions of problems and presents a way of behaviour using ant algorithm for multidimensional optimization complex systems. Results of researches in the form of computational simulations outcomes are presented.
Źródło:
Decision Making in Manufacturing and Services; 2010, 4, 1-2; 29-36
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algebraic construction of a coboundary of a given cycle
Autorzy:
Mazur, M.
Szybowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/255494.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
algorithm
homology theory
cycle
coboundary
Opis:
We present an algebraic construction of the coboundary of a given cycle as a simpler alternative to the geometric one introduced in [4, 5].
Źródło:
Opuscula Mathematica; 2007, 27, 2; 291-300
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Application of genetic algorithms for the selection of WSE companies in Warsaw for the investment portfolio
Autorzy:
Basiura, Beata
Motyczyńska, Joanna
Powiązania:
https://bibliotekanauki.pl/articles/1818470.pdf
Data publikacji:
2020
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Markowitz model
investment portfolio
genetic algorithm
Opis:
Portfolio analysis is a tool particularly intended for investors. Risk assessment and risk specification make the investor able to properly diversify and offset the portfolio. Broadly speaking, there are multiple tools destined for building up an efficient set of portfolios. One of them is Markowitz’s model theory postulating building up a portfolio determined on the basis of equilibrium between expected profit level as well as accepted level of risk assessment. In the context of this paper, the objective is to shed some light on creating investment portfolios based on either Markowitz's portfolio theory or evolutionary algorithm. The simulation based methods for building up a portfolio of approximately 40-50 companies listed out in the primary marketof the Warsaw Stock Exchange using the selection function proposed in the BA thesis were presented. Portfolio profit values have been evaluated in a dynamically shifted time window. The conducted analysis showed shifts in the economy at certain periods of time. The implemented genetic algorithms smoothly handled the optimization with a relatively short processing time of the task result.
Źródło:
Decision Making in Manufacturing and Services; 2020, 14, 1; 91--126
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Finding frequent items: novel method for improving Apriori algorithm
Autorzy:
Karimtabar, Noorollah
Fard, Mohammad Javad Shayegan
Powiązania:
https://bibliotekanauki.pl/articles/27312914.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
apriori algorithm
frequent itemset
intelligent method
Opis:
In this paper, we use an intelligent method for improving the Apriori algorithm in order to extract frequent itemsets. PAA (the proposed Apriori algorithm) pursues two goals: first, it is not necessary to take only one data item at each step – in fact, all possible combinations of items can be generated at each step; and second, we can scan only some transactions instead of scanning all of the transactions to obtain a frequent itemset. For performance evaluation, we conducted three experiments with the traditional Apriori, BitTableFI, TDM-MFI, and MDC-Apriori algorithms. The results exhibited that the algorithm execution time was significantly reduced due to the significant reduction in the number of transaction scans to obtain the itemset. As in the first experiment, the time that was spent to generate frequent items underwent a reduction of 52% as compared to the algorithm in the first experiment. In the second experiment, the amount of time that was spent was equal to 65%, while in the third experiment, it was equal to 46%.
Źródło:
Computer Science; 2022, 23 (2); 161--177
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modelling Microcystis Cell Density in a Mediterranean Shallow Lake of Northeast Algeria (Oubeira Lake), Using Evolutionary and Classic Programming
Autorzy:
Arif, Salah
Djellal, Adel
Djebbari, Nawel
Belhaoues, Saber
Touati, Hassen
Guellati, Fatma Zohra
Bensouilah, Mourad
Powiązania:
https://bibliotekanauki.pl/articles/2174666.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
microcystis cell density
Multiple Linear Regression
Support Vector Machine
Particle Swarm Optimization
Genetic Algorithm
Bird Swarm Algorithm
Opis:
Caused by excess levels of nutrients and increased temperatures, freshwater cyanobacterial blooms have become a serious global issue. However, with the development of artificial intelligence and extreme learning machine methods, the forecasting of cyanobacteria blooms has become more feasible. We explored the use of multiple techniques, including both statistical [Multiple Regression Model (MLR) and Support Vector Machine (SVM)] and evolutionary [Particle Swarm Optimization (PSO), Genetic Algorithm (GA), and Bird Swarm Algorithm (BSA)], to approximate models for the prediction of Microcystis density. The data set was collected from Oubeira Lake, a natural shallow Mediterranean lake in the northeast of Algeria. From the correlation analysis of ten water variables monitored, six potential factors including temperature, ammonium, nitrate, and ortho-phosphate were selected. The performance indices showed; MLR and PSO provided the best results. PSO gave the best fitness but all techniques performed well. BSA had better fitness but was very slow across generations. PSO was faster than the other techniques and at generation 20 it passed BSA. GA passed BSA a little further, at generation 50. The major contributions of our work not only focus on the modelling process itself, but also take into consideration the main factors affecting Microcystis blooms, by incorporating them in all applied models.
Źródło:
Geomatics and Environmental Engineering; 2023, 17, 2; 31--68
1898-1135
Pojawia się w:
Geomatics and Environmental Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Set representation for rule-generation algorithms
Autorzy:
Kharkongor, Carynthia
Nath, Bhabesh
Powiązania:
https://bibliotekanauki.pl/articles/27312912.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
item set
item set representation
apriori algorithm
rule-generation algorithm
data set
set representation
bitmap
memory
time
Opis:
The task of mining association rules has become one of the most widely used discovery pattern methods in knowledge discovery in databases (KDD). One such task is to represent an item set in the memory. The representation of the item set largely depends on the type of data structure that is used for storing them. Computing the process of mining an association rule impacts the memory and time requirements of the item set. With the constant increase of the dimensionality of data and data sets, mining such a large volume of data sets will be difficult since all of these item sets cannot be placed in the main memory. As the representation of an item set greatly affects the efficiency of the rule-mining association, a compact and compressed representation of the item set is needed. In this paper, a set representation is introduced that is more memory- and cost-efficient. Bitmap representation takes 1 byte for an element, but a set representation uses 1 bit. The set representation is being incorporated in the Apriori algorithm. Set representation is also being tested for different rule-generation algorithms. The complexities of these different rule-generation algorithms that use set representation are being compared in terms of memory and time of execution.
Źródło:
Computer Science; 2022, 23 (2); 205--225
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Handling insensitivity in multi-physics inverse problems using a complex evolutionary strategy
Rozpoznawanie niewrażliwości w wielokryterialnych problemach odwrotnych przy użyciu złożonej strategii ewolucyjnej
Autorzy:
Sawicki, Jakub
Smołka, Maciej
Łoś, Marcin
Schaefer, Robert
Powiązania:
https://bibliotekanauki.pl/articles/29520322.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
multi-objective optimization
evolutionary algorithm
inverse problem
Opis:
In this paper we present a complex strategy for the solution of ill posed, in-verse problems formulated as multiobjective global optimization ones. The strategy is capable of identifying the shape of objective insensitivity regions around connected components of Pareto set. The goal is reached in two phases. In the first, global one, the connected components of the Pareto set are localized and separated in course of the multi-deme, hierarchic memetic strategy HMS. In the second, local phase, the random sample uniformly spread over each Pareto component and its close neighborhood is obtained in the specially profiled evolutionary process using multiwinner selection. Finally, each local sample forms a base for the local approximation of a dominance function. Insensitivity region surrounding each connected component of the Pareto set is estimated by a sufficiently low level set of this approximation. Capabilities of the whole procedure was verified using specially-designed two-criterion benchmarks.
Artykuł prezentuje złożoną strategię rozwiązywania źle postawionych problemów odwrotnych sformułowanych jako wielokryterialne zadania optymalizacji globalnej. Opisana strategia umożliwia identyfikację obszarów niewrażliwości funkcji celu wokół spójnych składowych zbioru Pareto. Cel jest osiągany w dwu etapach. W pierwszym z nich — globalnym — składowe spójne zbioru Pareto są lokalizowane i separowane przy pomocy wielopopulacyjnej hierarchicznej strategii memetycznej HMS. W etapie drugim — lokalnym — przy użyciu specjalnie sprofilowanego procesu ewolucyjnego wykorzystującego operator selekcji wyborczej z wieloma zwycięzcami produkowana jest losowa próbka rozłożona jednostajnie na każdej składowej i jej bliskim otoczeniu. Finalnie każda lokalna próbka jest użyta jako baza do zbudowania lokalnej aproksymacji funkcji dominacji. Zbiory poziomicowe tej aproksymacji dla odpowiednio niskich poziomów stanowią przybliżenie zbiorów niewrażliwości wokół składowych spójnych. Możliwości strategii zostały zweryfikowane przy użyciu specjalnie zaprojektowanych dwukryterialnych funkcji testowych.
Źródło:
Computer Methods in Materials Science; 2019, 19, 1; 2-11
2720-4081
2720-3948
Pojawia się w:
Computer Methods in Materials Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Digital Cartographic Generalization – Study of Its Thresholds and Stages in Example of Cartographic Line
Autorzy:
Budkowski, Szczepan
Powiązania:
https://bibliotekanauki.pl/articles/27314278.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
digital cartographic generalization
generalization thresholds
cartography
simplification algorithm
Opis:
Digital generalization of spatial data has been the goal of the research in many research centers around the world. This article presents the evolution of cartographic generalization, drawing the reader’s attention to the change of its nature from analog to digital. Despite the passage of time and developing technologies, scientists have unfortunately yet to develop a uniform automatic generalization algorithm. One of the factors that hinder this process is the high complexity and complication of the whole process. The article is an attempt to answer this problem and addresses the issue of digital cartographic generalization by creating a proposal of thresholds and stages of cartographic generalization depending on the ratios of the numbers of points of generalized objects. The publication attempts to examine the possibility of applying an objective criterion of drawing recognition by examining digital generalization algorithms and setting its thresholds. The practical aim of the publication is to present generalization thresholds on the example of Chrobak’s algorithm. The proposal to make the selection of generalization thresholds dependent on the percentage share of points is a solution that is as simple to use as it is to implement. The method of defining intervals based on the three-sigma rule is a solution that guarantees that the obtained results will be characteristic of the probability density function of the normal distribution, which will define individual intervals most objectively.
Źródło:
Geomatics and Environmental Engineering; 2023, 17, 6; 77--93
1898-1135
Pojawia się w:
Geomatics and Environmental Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments
Autorzy:
Duraj, S.
Kopeć, P.
Kubale, M.
Pikies, T.
Powiązania:
https://bibliotekanauki.pl/articles/376001.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
batch scheduling
bipartite graph
polynomial algorithm
uniform machines
Opis:
In this paper, we consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard, we show that our problem can be solved to optimality in polynomial time under some restrictions imposed on the number of machines, their speeds, and the structure of the incompatibility graph. The theoretical considerations are accompanied by computer experiments with a certain model of scheduling.
Źródło:
Decision Making in Manufacturing and Services; 2017, 11, 1-2; 53-61
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A routing algorithm and a router architecture for 3D NoC
Autorzy:
Kanagasabapathi, Somasundaram
Calicut, Chythanya
Powiązania:
https://bibliotekanauki.pl/articles/305713.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
3D topology
router
network on chip
routing algorithm
Opis:
In recent years, the enhancement of microchip technologies has enabled large scale Systems-on-Chip (SoC). Due to sharp increase in number of processing elements, SoC faces various challenges in design and testing. Network on Chip (NoC) is an alternative technology to overcome the challenges in SoC design and testing. NoC emerged as a key architecture that allows one to optimize the parameters like power and area. In spite of its applications, NoC faces some real time challenges like designing an optimum topology, routing scheme and application mappings. In this paper, we address the main three issues on NoC, namely, designing of an optimal topology, routing algorithm and a router design for the topology. First, we propose a topology and a routing algorithm. We prove that our recursive network topology is Hamiltonian connected and we propose an algorithm for data packet transmissions, which is free from cyclic deadlocks and the algorithm maximizes the congestion factor. Our experimental results show that the proposed topology gives better performance in terms of average latency and power than the other topologies. Finally, we propose a router architecture for our 3D-NoC. The router architecture is based on shared buffers. Also, our experimental results indicate that the proposed router architecture consumes less area and power than the Virtual Channel architecture.
Źródło:
Computer Science; 2019, 20 (3); 369-383
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multivariate kernel density estimation with a parametric support
Autorzy:
Jarnicka, J.
Powiązania:
https://bibliotekanauki.pl/articles/255530.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
density estimation
kernel
bandwidth
kernel density estimator
EM algorithm
Opis:
We consider kernel density estimation in the multivariate case, focusing on the use of some elements of parametric estimation. We present a two-step method, based on a modification of the EM algorithm and the generalized kernel density estimator, and compare this method with a couple of well known multivariate kernel density estimation methods.
Źródło:
Opuscula Mathematica; 2009, 29, 1; 41-55
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Finding Playing Styles of Badminton Players Using Firefly Algorithm Based Clustering Algorithms
Autorzy:
Ilankoon, I.M.T.P.K.
Samarasinghe, U.S.
Ariyaratne, M.K.A.
Silva, R. M.
Powiązania:
https://bibliotekanauki.pl/articles/27312858.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
firefly algorithm
clustering
intra- and inter-cluster distance
badminton
Opis:
Cluster analysis can be defined as applying clustering algorithms with the goalof finding any hidden patterns or groupings in a data set. Different clusteringmethods may provide different solutions for the same data set. Traditionalclustering algorithms are popular, but handling big data sets is beyond theabilities of such methods. We propose three big data clustering methods basedon the firefly algorithm (FA). Three different fitness functions were definedon FA using inter-cluster distance, intra-cluster distance, silhouette value, andthe Calinski-Harabasz index. The algorithms find the most appropriate clustercenters for a given data set. The algorithms were tested with nine popularsynthetic data sets and one medical data set and are later applied on two bad-minton data sets with the intention of identifying the different playing stylesof players based on their physical characteristics. The results specify that thefirefly algorithm could generate better clustering results with high accuracy.The algorithms cluster the players to find the most suitable playing strategyfor a given player where expert knowledge is needed in labeling the clusters.Comparisons with a PSO-based clustering algorithm (APSO) and traditional al-gorithms point out that the proposed firefly variants work in a similar fashion asthe APSO method, and they surpass the performance of traditional algorithms.
Źródło:
Computer Science; 2023, 24 (3); 427--450
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 50

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