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


Tytuł:
A Logic for Dually Hemimorphic Semi-Heyting Algebras and its Axiomatic Extensions
Autorzy:
Cornejo, Juan Manuel
Sankappanavar, Hanamantagouda P.
Powiązania:
https://bibliotekanauki.pl/articles/43189647.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
semi-intuitionistic logic
dually hemimorphic semi-Heyting logic
dually quasi-De Morgan semi-Heyting logic
De Morgan semi-Heyting logic
dually pseudocomplemented semi-Heyting logic
regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1
implicative logic
equivalent algebraic semantics
algebraizable logic
De Morgan Gödel logic
dually pseudocomplemented Gödel logic
Moisil's logic
3-valued Łukasiewicz logic
Opis:
The variety \(\mathbb{DHMSH}\) of dually hemimorphic semi-Heyting algebras was introduced in 2011 by the second author as an expansion of semi-Heyting algebras by a dual hemimorphism. In this paper, we focus on the variety \(\mathbb{DHMSH}\) from a logical point of view. The paper presents an extensive investigation of the logic corresponding to the variety of dually hemimorphic semi-Heyting algebras and of its axiomatic extensions, along with an equally extensive universal algebraic study of their corresponding algebraic semantics. Firstly, we present a Hilbert-style axiomatization of a new logic called "Dually hemimorphic semi-Heyting logic" (\(\mathcal{DHMSH}\), for short), as an expansion of semi-intuitionistic logic \(\mathcal{SI}\) (also called \(\mathcal{SH}\)) introduced by the first author by adding a weak negation (to be interpreted as a dual hemimorphism). We then prove that it is implicative in the sense of Rasiowa and that it is complete with respect to the variety \(\mathbb{DHMSH}\). It is deduced that the logic \(\mathcal{DHMSH}\) is algebraizable in the sense of Blok and Pigozzi, with the variety \(\mathbb{DHMSH}\) as its equivalent algebraic semantics and that the lattice of axiomatic extensions of \(\mathcal{DHMSH}\) is dually isomorphic to the lattice of subvarieties of \(\mathbb{DHMSH}\). A new axiomatization for Moisil's logic is also obtained. Secondly, we characterize the axiomatic extensions of \(\mathcal{DHMSH}\) in which the "Deduction Theorem" holds. Thirdly, we present several new logics, extending the logic \(\mathcal{DHMSH}\), corresponding to several important subvarieties of the variety \(\mathbb{DHMSH}\). These include logics corresponding to the varieties generated by two-element, three-element and some four-element dually quasi-De Morgan semi-Heyting algebras, as well as a new axiomatization for the 3-valued Łukasiewicz logic. Surprisingly, many of these logics turn out to be connexive logics, only a few of which are presented in this paper. Fourthly, we present axiomatizations for two infinite sequences of logics namely, De Morgan Gödel logics and dually pseudocomplemented Gödel logics. Fifthly, axiomatizations are also provided for logics corresponding to many subvarieties of regular dually quasi-De Morgan Stone semi-Heyting algebras, of regular De Morgan semi-Heyting algebras of level 1, and of JI-distributive semi-Heyting algebras of level 1. We conclude the paper with some open problems. Most of the logics considered in this paper are discriminator logics in the sense that they correspond to discriminator varieties. Some of them, just like the classical logic, are even primal in the sense that their corresponding varieties are generated by primal algebras.
Źródło:
Bulletin of the Section of Logic; 2022, 51, 4; 555-645
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Note on the Crossing Numbers of 5-Regular Graphs
Autorzy:
Ouyang, Zhangdong
Powiązania:
https://bibliotekanauki.pl/articles/31348107.pdf
Data publikacji:
2020-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
crossing number
5-regular graph
drawing
Opis:
The crossing number cr(G) of a graph G is the smallest number of edge crossings in any drawing of G. In this paper, we prove that there exists a unique 5-regular graph G on 10 vertices with cr(G) = 2. This answers a question by Chia and Gan in the negative. In addition, we also give a new proof of Chia and Gan’s result which states that if G is a non-planar 5-regular graph on 12 vertices, then cr(G) ≥ 2.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 4; 1127-1140
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Contextual one-sector non-regular fuzzy model based on 4 knowledge points
Kontekstowy, jednosektorowy, nieregularny model rozmyty oparty na 4 punktach wiedzy
Autorzy:
Piegat, A.
Olchowy, M.
Powiązania:
https://bibliotekanauki.pl/articles/158189.pdf
Data publikacji:
2010
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
modelowanie rozmyte
logika rozmyta
modele nieregularne
układy współrzędnych
wnioskowanie rozmyte
fuzzy modeling
fuzzy logic
non-regular models
coordinate systems
fuzzy reasoning
Opis:
W artykule przedstawiona została metoda konstruowania nieregularnego modelu rozmytego opartego na czterech punktach wiedzy eksperckiej. Nieregularne modele rozmyte różnią się znacznie od modeli regularnych, które oparte są na regularnym, prostokątnym podziale przestrzeni wejść. Posiadają one wiele zalet, m.in. pozwalają na znaczne zmniejszenie liczby reguł przy zachowaniu dokładności modelu rozmytego, czyli umożliwiają konstruowanie oszczędnych modeli rozmytych. Dzięki temu istnieje możliwość skutecznego pokonywania zjawiska "przekleństwa wymiarowości". Nieregularne modelowanie rozmyte nie jest chyba możliwe bez nowego układu współrzędnych. Układ taki nazwany został kontekstowym, nierównoległym układem współrzędnych, który jest uogólnieniem powszechnie stosowanego układu kartezjańskiego. Dla lepszego zrozumienia zagadnienia w artykule, w kilku krokach, przedstawiono sposób zastosowania kontekstowego układu współrzędnych w nieregularnym modelowaniu rozmytym. Metodę zilustrowano przykładem.
The paper presents a method how to construct a non-regular fuzzy model based on 4 points of expert knowledge. Non-regular fuzzy models considerably differ from regular ones, which are based on the regular, rectangular partition of the input space. They allow for considerable decreasing the rule number and thus for constructing sparse models and for overcoming the phenomenon called "curse of dimensionality". Non-regular fuzzy modeling is rather not possible without a new coordinate system, which was called contextual, non-parallel coordinate system that also is described in the paper. The non-regular modeling method was illustrated by an example.
Źródło:
Pomiary Automatyka Kontrola; 2010, R. 56, nr 10, 10; 1193-1196
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decomposing 10-Regular Graphs into Paths of Length 5
Autorzy:
Xie, Mengmeng
Zhou, Chuixiang
Powiązania:
https://bibliotekanauki.pl/articles/32222554.pdf
Data publikacji:
2022-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
10-regular graph
decomposition
path
Opis:
Let G be a 10-regular graph which does not contain any 4-cycles. In this paper, we prove that G can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1089-1097
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Erdős regular graphs of even degree
Autorzy:
Dobrynin, Andrey
Mel'nikov, Leonid
Pyatkin, Artem
Powiązania:
https://bibliotekanauki.pl/articles/743782.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
vertex coloring
4-critical graph
circulant
regular graph
vertex connectivity
Opis:
In 1960, Dirac put forward the conjecture that r-connected 4-critical graphs exist for every r ≥ 3. In 1989, Erdös conjectured that for every r ≥ 3 there exist r-regular 4-critical graphs. A method for finding r-regular 4-critical graphs and the numbers of such graphs for r ≤ 10 have been reported in [6,7]. Results of a computer search for graphs of degree r = 12,14,16 are presented. All the graphs found are both r-regular and r-connected.
Źródło:
Discussiones Mathematicae Graph Theory; 2007, 27, 2; 269-279
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Impact of propeller emergence on hull, propeller, engine, and fuel consumption performance in regular head waves
Autorzy:
Ghaemi, Mohammad Hossein
Zeraatgar, Hamid
Powiązania:
https://bibliotekanauki.pl/articles/32898210.pdf
Data publikacji:
2022
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
ship dynamics
ship propulsion system
propeller ventilation
propeller emergence
sea waves
Opis:
In this study, the impact of propeller emergence on the performance of a ship (speed), propeller (thrust, torque, and RPM), a diesel engine (torque and RPM) and fuel consumption are analysed under severe sea conditions. The goal is to describe the variation in the system variables and fuel consumption rather than analysing the motion of the ship or the phenomenon of propeller ventilation in itself. A mathematical model of the hull, propeller, and engine interactions is developed in which the propeller emergence is included. The system parameters are set using model experiments, empirical formulae, and available data for the engine. The dynamic response of the system is examined in regular head waves under submerged and emerged conditions of the propeller. The pulsatility and the extent of variation of 20 selected variables for the coupled system of hull, propeller, and engine are elaborated using quantitative and qualitative terms and absolute and relative scales. The simulation begins with a ship moving on a straight path, in calm water, with a constant speed for the ship, propeller and engine under steady conditions. The ship then encounters regular head waves with a known time series of the total resistance of the ship in waves. Large motions of the ship create propeller emergence, which in turn reduces the propeller thrust and torque. This study shows that for a specific ship, the mean ship speed, shaft angular velocity, and engine power were slightly reduced in submerged conditions with respect to calm water. We compared the mean values of the variables to those in the emerged condition, and found that the shaft angular velocity was almost the same, the ship speed was considerably reduced, and the engine power significantly dropped with respect to calm water. The ratios of the amplitude of fluctuation to the mean (Amp/Mean) for the ship speed and angular velocity of the shaft under both conditions were considerable, while the Amp/Mean for the power delivered by the engine was extremely high. The outcomes of the study show the degree of influence of propeller emergence on these variables. We identify the extent of each change and categorise the variables into three main groups based on the results.
Źródło:
Polish Maritime Research; 2022, 4; 56-76
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs
Autorzy:
Li, Xueliang
Zhu, Xiaoyu
Powiązania:
https://bibliotekanauki.pl/articles/31343197.pdf
Data publikacji:
2019-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
k -kaleidoscope
regular graph
edge-coloring
Opis:
For an $r$-regular graph $G$, we define an edge-coloring $c$ with colors from ${1, 2, . . ., k}$, in such a way that any vertex of $G$ is incident with at least one edge of each color. The multiset-color $c_m(v)$ of a vertex $v$ is defined as the ordered tuple $ (a_1, a_2, . . ., a_k) $, where $ a_i (1 \le i \le k) $ denotes the number of edges of color $i$ which are incident with $v$ in $G$. Then this edge-coloring $c$ is called a $k$-kaleidoscopic coloring of $G$ if every two distinct vertices in $G$ have different multiset-colors and in this way the graph $G$ is defined as a $k$-kaleidoscope. In this paper, we determine the integer $k$ for a complete graph $ K_n $ to be a $k$-kaleidoscope, and hence solve a conjecture in [P. Zhang, A Kaleidoscopic View of Graph Colorings, (Springer Briefs in Math., New York, 2016)] that for any integers $n$ and $k$ with $ n \ge k + 3 \ge 6 $, the complete graph $ K_n$ is a $k$-kaleidoscope. Then, we construct an $r$-regular 3-kaleidoscope of order \( \binom{r-1}{2} - 1 \) for each integer $ r \ge 7 $, where $ r \equiv 3 (mod 4) $, which solves another conjecture in [P. Zhang, A Kaleidoscopic View of Graph Colorings, (Springer Briefs in Math., New York, 2016)] on the maximum order of $r$-regular 3-kaleidoscopes.
Źródło:
Discussiones Mathematicae Graph Theory; 2019, 39, 4; 881-888
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
More on Signed Graphs with at Most Three Eigenvalues
Autorzy:
Ramezani, Farzaneh
Rowlinson, Peter
Stanić, Zoran
Powiązania:
https://bibliotekanauki.pl/articles/32222534.pdf
Data publikacji:
2022-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
adjacency matrix
simple eigenvalue
strongly regular signed graph
vertex-deleted subgraph
weighing matrix
association scheme
Opis:
We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertex-deleted subgraphs which themselves have at most 3 distinct eigenvalues. We also construct new examples using weighing matrices and symmetric 3-class association schemes.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1313-1331
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Number of Disjoint 4-Cycles in Regular Tournaments
Autorzy:
Ma, Fuhong
Yan, Jin
Powiązania:
https://bibliotekanauki.pl/articles/31342321.pdf
Data publikacji:
2018-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
regular tournament
C 4 -free
disjoint cycles
Opis:
In this paper, we prove that for an integer $ r \ge 1 $, every regular tournament $T$ of degree $ 3r − 1 $ contains at least \( \tfrac{21}{16} r- \tfrac{10}{3} \) disjoint directed 4-cycles. Our result is an improvement of Lichiardopol’s theorem when taking $ q = 4 $ [Discrete Math. 310 (2010) 2567–2570]: for given integers $ q \ge 3 $ and $ r \ge 1 $, a tournament $T$ with minimum out-degree and in-degree both at least $ (q − 1)r − 1 $ contains at least $r$ disjoint directed cycles of length $q$.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 2; 491-498
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs
Autorzy:
Wang, Dingguo
Shan, Erfang
Powiązania:
https://bibliotekanauki.pl/articles/30148001.pdf
Data publikacji:
2014-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
4-regular graph
claw-free
cut-vertices
end-blocks
Opis:
A cut-vertex in a graph G is a vertex whose removal increases the number of connected components of G. An end-block of G is a block with a single cut-vertex. In this paper we establish upper bounds on the numbers of end-blocks and cut-vertices in a 4-regular graph G and claw-free 4-regular graphs. We characterize the extremal graphs achieving these bounds.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 1; 127-136
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Outpaths of Arcs in Regular 3-Partite Tournaments
Autorzy:
Guo, Qiaoping
Meng, Wei
Powiązania:
https://bibliotekanauki.pl/articles/32222728.pdf
Data publikacji:
2021-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
multipartite tournament
regular 3-partite tournament
out-paths
Opis:
Guo [Outpaths in semicomplete multipartite digraphs, Discrete Appl. Math. 95 (1999) 273–277] proposed the concept of the outpath in digraphs. An outpath of a vertex x (an arc xy, respectively) in a digraph is a directed path starting at x (an arc xy, respectively) such that x does not dominate the end vertex of this directed path. A k-outpath is an outpath of length k. The outpath is a generalization of the directed cycle. A c-partite tournament is an orientation of a complete c-partite graph. In this paper, we investigate outpaths of arcs in regular 3-partite tournaments. We prove that every arc of an r-regular 3-partite tournament has 2- (when r ≥ 1), 3- (when r ≥ 2), and 5-, 6-outpaths (when r ≥ 3). We also give the structure of an r-regular 3-partite tournament D with r ≥ 2 that contains arcs which have no 4-outpaths. Based on these results, we conjecture that for all k ∈ {1, 2, . . ., r − 1}, every arc of r-regular 3-partite tournaments with r ≥ 2 has (3k − 1)- and 3k-outpaths, and it has a (3k + 1)-outpath except an r-regular 3-partite tournament.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 4; 893-904
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Polynomial approximation of regular functions of a quaternionic variable
Autorzy:
Szczepański, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/29521112.pdf
Data publikacji:
2022
Wydawca:
Akademia Tarnowska
Tematy:
quaternionic regular functions
polynomial approximation
Bernstein-Walsh-Siciak theorem
Bernstein-Markov condition
polynomial extremal function
Bernstein-Walsh inequality
czwartorzędowe funkcje regularne
aproksymacja wielomianowa
twierdzenie Bernsteina-Walsha-Siciaka
warunek Bernsteina-Markowa
funkcja ekstremalna wielomianu
nierówność Bernsteina-Walsha
Opis:
We consider Bernstein-Walsh-Siciak-type theorems on the polynomial approximation in the case of regular functions of one quaternionic variable and their applications to the uniform approximation and approximation in $ L^p $ norms with respect to measures satisfying the Bernstein-Markov condition.
Źródło:
Science, Technology and Innovation; 2022, 16, 3-4; 28-41
2544-9125
Pojawia się w:
Science, Technology and Innovation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quaternionic regular functions in the sense of Fueter and fundamental 2-forms on a 4-dimensional almost Kähler manifold
Autorzy:
Królikowski, W.
Powiązania:
https://bibliotekanauki.pl/articles/122554.pdf
Data publikacji:
2013
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
fundamental 2-form
almost Kahler manifold
complex analysis
Fueter regular function
quaternionic analysis
Opis:
A correspondence between quaternionic regular functions in the sense of Fueter and fundamental 2-forms on a 4-dimensional almost Kahler manifold is shown.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 1; 77-83
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Regular and chaotic dynamics of a 4-DOF mechanical system with dry friction
Autorzy:
Kosińska, A.
Awrejcewicz, J.
Grzelczyk, D.
Powiązania:
https://bibliotekanauki.pl/articles/950423.pdf
Data publikacji:
2016
Wydawca:
Politechnika Poznańska. Instytut Mechaniki Stosowanej
Tematy:
periodicity
quasiperiodicity
chaos
hyperchaos
non-regular vibrations
okresowość
quasi-okresowość
hiperchaos
drgania nieliniowe
Opis:
In this paper the model of four degree-of-freedom mechanical sliding system with dry friction is considered. One of the components of the mentioned system rides on driving belt, which is driven at constant velocity. This model corresponds to a row of carriage laying on a guideway, which moves at constant velocity with respect to the guideway as a foundation. From a mathematical point of view the analyzed problem is governed by four second order differential equations of motion, and numerical analysis is performed in Mathematica software. Some interesting behaviors are detected and reported using Phase Portraits, Poincaré Maps and Lyapunov Exponents. Moreover, Power Spectral Densities obtained by the Fast Fourier Transform technique are reported. The presented results show different behaviors of the system, including periodic, quasi-periodic and chaotic orbits.
Źródło:
Vibrations in Physical Systems; 2016, 27; 195-202
0860-6897
Pojawia się w:
Vibrations in Physical Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Spectra of Orders for k-Regular Graphs of Girth g
Autorzy:
Jajcay, Robert
Raiman, Tom
Powiązania:
https://bibliotekanauki.pl/articles/32222719.pdf
Data publikacji:
2021-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
cage
k -regular graph
girth
Sauer bound
Opis:
A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs of infinitely many orders are known to exist. Our goal, for given k and g, is the classification of all orders n for which a (k, g)-graph of order n exists; we choose to call the set of all such orders the spectrum of orders of (k, g)-graphs. The smallest of these orders (the first element in the spectrum) is the order of a (k, g)-cage; the (k, g)-graph of the smallest possible order. The exact value of this order is unknown for the majority of parameters (k, g). We determine the spectra of orders for (2, g), g ≥ 3, (k, 3), k ≥ 2, and (3, 5)-graphs, as well as the spectra of orders of some families of (k, 4)-graphs. In addition, we present methods for obtaining (k, g)-graphs that are larger then the smallest known (k, g)-graphs, but are smaller than (k, g)-graphs obtained by Sauer. Our constructions start from (k, g)-graphs that satisfy specific conditions derived in this paper and result in graphs of orders larger than the original graphs by one or two vertices. We present theorems describing ways to obtain ‘starter graphs’ whose orders fall in the gap between the well-known Moore bound and the constructive bound derived by Sauer and are the first members of an infinite sequence of graphs whose orders cover all admissible orders larger than those of the ‘starter graphs’.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 4; 1115-1125
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł

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