Filtry
wszystkich: 5850
wybranych: 3785
-
Katalog
- Publikacje 3785 wyników po odfiltrowaniu
- Czasopisma 4 wyników po odfiltrowaniu
- Osoby 92 wyników po odfiltrowaniu
- Wynalazki 23 wyników po odfiltrowaniu
- Projekty 21 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Zespoły Badawcze 6 wyników po odfiltrowaniu
- Kursy Online 92 wyników po odfiltrowaniu
- Wydarzenia 7 wyników po odfiltrowaniu
- Dane Badawcze 1819 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: MECHANIZM TYPU SET
-
Empirically adjusted and consistent set of EHT valence orbital parametersfor all elements of the periodic table. Modelling Simul. Mater. Sci. Eng. [online]. 2004 vol. 12 [dostęp..] s. 21-32, 3 rys. 3 tab. bibliogr. 35 poz. Dostępny w Internecie stacks.iop.org/MSMSE/12/21.ISSN 0965-0393 Jednorodny skorygowany empirycznie zbiór parametrów EHT dla orbitali walen- cyjnych pierwiastków.
PublikacjaModel atomu HFS został zmodyfikowany poprzez przypisanie każdemu z atomówindywidualnego parametru ŕ. Wartości ŕ dobrano w oparciu o pierwszy poten-cjał jonizacji atomu. Parametry EHT wyznaczono w oparciu o tak zmodyfikowa-ny model HFS.
-
Multiple access in ad-hoc wireless LANs with noncooperative stations
PublikacjaA class of contention-type MAC protocols (e.g., CSMA/CA) relies on random deferment of packet transmission, and subsumes a deferment selection strategy and a scheduling policy that determines the winner of each contention cycle. This paper examines contention-type protocols in a noncooperative an ad-hoc wireless LAN setting, where a number of stations self-optimise their strategies to obtain a more-than-fair bandwidth share. Two...
-
Technical and Economic Analysis of an Intermediate Size Photovoltaic Power Plant. Case Study
PublikacjaThe article presents an analysis of the construction of a photovoltaic power plant with an installed capacity of about 30 kW. The principles of selecting the basic elements of the plant are shown. The impact of a high constant price on the profitability of the project is highlighted. The article also describes the existing mechanisms for subsidizing the investment.
-
Wpływ nadmiarowych danych wejściowych na jakość map rozbieżności pozyskanych za pomocą układu pięciu kamer w konfiguracji EBMCS
PublikacjaArtykuł dotyczy zastosowania układu kamer typu EBMCS (Equal Baseline Multiple Camera Set) składającego się z kamery centralnej oraz kamer bocznych. Na podstawie zdjęć wykonanych za pomocą tego układu można otrzymać mapy rozbieżności (ang. disparity map), które pozwalają na określenie odległości od kamer do obiektów znajdujących się w ich polu widzenia. Mapy te są wyższej jakości niż mapy otrzymane za pomocą kamery stereoskopowej....
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
Modelowanie dynamiki odbieraka prądu pojazdu kolejowego do celów diagnostycznych
PublikacjaNiewłaściwa współpraca odbieraka prądu i sieci trakcyjnej, w trudnych warunkach lokalnych, może prowadzić do uszkodzenia sieci trakcyjnej i pantografu. W ramach rozwoju metod monitoringu i diagnostyki dla tych podsystemów, tworzone są nowe i dokładniejsze narzędzia symulacyjne, których zakres obejmuje modelowanie zarówno napowietrznej sieci trakcyjnej i pantografu, a także ich dynamicznego oddziaływania. Głównym celem jest dokładniejsza...
-
On proper (1,2)‐dominating sets in graphs
PublikacjaIn 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
On trees with double domination number equal to total domination number plus one
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Hybrid no-signaling-quantum correlations
PublikacjaFundamental investigations in non-locality have shown that while the no-signaling principle alone is not sufficient to single out the set of quantum non-local correlations, local quantum mechanics and no-signaling together exactly reproduce the set of quantum correlations in the two-party Bell scenario. Here, we introduce and study an intermediate hybrid no-signaling quantum set of non-local correlations that we term HNSQ in the...
-
Projekt systemu sterowania dwukołowym robotem balansującym
PublikacjaW niniejszym artykule rozważony został problem sterowania dwukołowym robotem balansującym. Celem zaprezentowanych prac było zaprojektowanie systemu sterowania tego typu obiektem z wykorzystaniem metod nowoczesnej teorii sterowania. W ramach syntezy, bazując na wyprowadzonym w oparciu o zasady dynamiki Newtona modelu, dobrana została struktura systemu sterowania w postaci regulatora wykorzystującego sprzężenie zwrotne od stanu oraz...
-
The convex domination subdivision number of a graph
PublikacjaLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
Graphs with equal domination and certified domination numbers
PublikacjaA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
An upper bound on the 2-outer-independent domination number of a tree
PublikacjaA 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
Data on LEGO sets release dates and worldwide retail prices combined with aftermarket transaction prices in Poland between June 2018 and June 2023
PublikacjaThe dataset contains LEGO bricks sets item count and pricing history for AI-based set pricing prediction. The data spans the timeframe from June 2018 to June 2023. The data was obtained from three sources: Brickset.com (LEGO sets retail prices, release dates, and IDs), Lego.com official web page (ID number of each set that was released by Lego, its retail prices, the current status of the set) and promoklocki.pl web page (the retail...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
2-outer-independent domination in graphs
PublikacjaWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
An upper bound for the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
Weakly convex domination subdivision number of a graph
PublikacjaA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
System for automatic singing voice recognition
PublikacjaW artykule przedstawiono system automatycznego rozpoznawania jakości i typu głosu śpiewaczego. Przedstawiono bazę danych oraz zaimplementowane parametry. Algorytmem decyzyjnym jest algorytm sztucznych sieci neuronowych. Wytrenowany system decyzyjny osiąga skuteczność ok. 90% w obydwu kategoriach rozpoznawania. Dodatkowo wykazano przy pomocy metod statystycznych, że wyniki działania systemu automatycznej oceny jakości technicznej...
-
Oddziaływanie materiału opakowaniowego Mater-Bi na populację okrzemki w środowisku morskim
PublikacjaDo produkcji różnego rodzaju opakowań stosowane są m.in. takie materiały jak: polimery, kopolimery i ich mieszaniny; trwałe oraz stabilne środowisko (ich rozkład trwa kilka set lat). Dlatego też obecnie systematycznie zwiększa się zainteresowanie i zapotrzebowanie na polimerowe materiały biodegradowalne, które rozkładają się w środowisku naturalnym do prostych i bezpiecznych surowców. Należą do nich m.in. substancje naturalne jak...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Weakly convex and convex domination numbers of some products of graphs
PublikacjaIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
Badanie i analiza właściwości kanałów radiowych w sieciach WBAN (część 2)
PublikacjaW tej części artykułu przeprowadzono analizę zaników wolnozmiennych i szybkozmiennych w sieciach WBAN typu off-body z przestrzennym odbiorem zbiorczym oraz analizę stopnia skorelowania odbieranych sygnałów. Zaprezentowano model kanału radiowego dla wąskopasmowych i szerokopasmowych sieci WBAN typu off-body, pracujących w środowisku promu pasażerskiego. Przeprowadzono analizę porównawczą zaników wolnozmiennych i szybkozmiennych...
-
Graphs with isolation number equal to one third of the order
PublikacjaA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Total domination in versus paired-domination in regular graphs
PublikacjaA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Ocena nośności betonowych dźwigarów taśmowych systemu Mullera.
PublikacjaPraca przedstawia analizę numeryczną dźwigarów typu Mullera przeprowadzoną za pomocą metody elementów skończonych. Analiza pozwoliła ocenić fazy pracy dźwigara typu Mullera oraz ocenić skuteczność wzmocnienia mostów z zastosowaniem dźwigarów omawianego typu. Ponadto przedstawiono wyniki dokonanego porównania modelu numerycznego z rzeczywistymi modelami wykonanymi w laboratorium.
-
Układy hydrauliczne stosowane w samochodach osobowych. Część I
PublikacjaOpisano konstrukcję i budowę układów hydraulicznych w samochodzie typu ACE. Przedstawiono charakterystykę pracy oraz zasadę działania elektronicznego układu sterującego typu ECU.
-
Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets
PublikacjaThis work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry...
-
High step-up continuous input current LCCT-Z-source inverters for fuel cells
PublikacjaFalowniki typu Z (ZSI) przeznaczone są do układów wymagających szerokiej zmiany wzmocnienia napięciowego, np. w energetyce odnawialnej. Ostatnio zaproponowano w literaturze zmienione struktury - falowniki typu Trans-Z (TZSI) oraz typu T (TSI) - w których dzięki zastosowaniu dławików sprzężonych uzyskano lepsze wzmocnienie niż w ZSI. W tym artykule przedstawiono ideę rozszerzonej struktury TZSI. Zaproponowano dwie nowe struktury...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
Bounds on the vertex-edge domination number of a tree
PublikacjaA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
Thermodynamic Cycles of Air Microturbine Power Plants Working on Biomass Fuels
PublikacjaThe gas turbine engine is modified to work as an air turbine set which consists, in the simplest arrangement, of a compressor, a heat exchanger and a turbine. Air is a working medium for both: the compressor and the turbine. This kind of air turbine set can be applied in power plants working on biomass fuels. In this solution we can burn fuels of varying parameters in the external combustion chamber without any harmful effects...
-
On trees attaining an upper bound on the total domination number
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
Interpolation properties of domination parameters of a graph
PublikacjaAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
Independent Domination Subdivision in Graphs
PublikacjaA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
Weakly connected Roman domination in graphs
PublikacjaA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
Graph security testing
PublikacjaSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
The Righi-Leduc effect: on evidence of two-band electronic structure in Nd1.86Ce0.14CuO4-y.
PublikacjaPrzedstawiono badania temperaturowe zależności oporu elektrycznego, efektu Halla (RH), przewodnictwa cieplnego (k) i współczynnika Righi-Leduc(SRL). Badania wykazały, że współczynnik RL> 0 w szerokim zakresie temperatur RH zmienia znak dwukrotnie w T=50 i 250K. Niezgodność znaków SRL i RH jednoznacznie wskazuje obecność w materiale nośników obu znaków tzn. n- i p- typu. W pracy pokazano, że transport ciepła zdominowany jest przez...
-
Phase transitions and microstructure of emulsion systems prepared with acylglycerols/zinc stearate emulsifier
PublikacjaZbadano przemiany fazowe jakim ulegają układy emulsyjne w czasie procesu emulgowania, prowadzonego w obecności emulgatora acyloglicerolowego modyfikowanego stearynianem cynku. Rodzaj przemian mikrostrukturalnych jakim ulegały emulsje zależny był w głównej mierze od temperatury oraz zawartości fazy wodnej. Obserwowano powstawanie emulsji typu W/O, która wraz z obniżaniem temperatury ulegała inwersji prowadzącej do powstania dyspersji...
-
A remark on singular sets of vector bundle morphisms
PublikacjaIf characteristic classes for two vector bundles over the same base space do not coincide, then the bundles are not isomorphic. We give under rather common assumptions a lower bound on the topological dimension of the set of all points in the base over which a morphism between such bundles is not bijective. Moreover, we show that this set is topologically non-trivial.
-
Przetwarzanie strumieni multimedialnych na klastrze komputerowym Galera
PublikacjaSformułowano problemy przetwarzania strumieni multimedialnych w czasie rzeczywistym. Rozpatrzono różne możliwości realizacji tego typu przetwarzania i na tej podstawie opracowano wymagania na platformę KASKADA ułatwiające wykonanie tego typu zadań na klastrze komputerowym o wysokiej wydajności przetwarzania. Podano architekturę takiej platformy oraz sposób jej implementacji. Dokonano oceny przydatności tej platformy przetwarzania...