Filtry
wszystkich: 543
-
Katalog
- Publikacje 321 wyników po odfiltrowaniu
- Czasopisma 4 wyników po odfiltrowaniu
- Osoby 5 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Projekty 14 wyników po odfiltrowaniu
- Zespoły Badawcze 5 wyników po odfiltrowaniu
- Kursy Online 144 wyników po odfiltrowaniu
- Dane Badawcze 49 wyników po odfiltrowaniu
Wyniki wyszukiwania dla: graf
-
Edge ranking and searching in partial orders
PublikacjaArtykuł jest poświęcony problemowi konstrukcji optymalnej (wymagającej minimalnej ilości porównań/zapytań) strategii wyszukiwania elementu w częściowym porządku. W pracy wskazano związki pomiędzy tym problemem oraz uporządkowanym kolorowaniem krawędzi grafów, co implikuje liniowy algorytm dla częściowych porządków o strukturze drzewa. Pokazano również, że znalezienie optymalnej strategii jest problemem obliczeniowo trudnym dla...
-
Grafika Inżynierska I, P, ZiIP sem 01, zimowy 2021/2022 (PG_ 00055730)
Kursy OnlineZakres tematyczny projektów z przedmiotu Grafika Inżynierska I dla studentów kierunku Zarządzanie i Inżynieria Produkcji, I stopień, semestr 01
-
Grafika Inżynierska II, W, L, IM, sem 05, zimowy 2023/2024 (PG_00039813)
Kursy OnlineZakres tematyczny wykładów z przedmiotu Grafika Inżynierska II dla studentów kierunku Inżynieria Materiałowa, I stopień, semestr 05
-
Grafika Inżynierska II, W, L, Nanotechnologia, sem 05, zimowy 2023/2024 (NAN1B0021)
Kursy OnlineZakres tematyczny wykładów z przedmiotu Grafika Inżynierska dla studentów kierunku Nanotechnologia, I stopień, semestr 05
-
Persistent homology as a new method of the assessment of heart rate variability
PublikacjaHeart rate variability (hrv) is a physiological phenomenon of the variation in the length of the time interval between consecutive heartbeats. In many cases it could be an indicator of the development of pathological states. The classical approach to the analysis of hrv includes time domain methods and frequency domain methods. However, attempts are still being made to define new and more effective hrv assessment tools. Persistent...
-
Periodicity of a sequence of local fixed point indices of iterations
PublikacjaPraca uogólnia klasyczne twierdzenie Shuba i Sullivana o periodyczności ciągu indeksów punktu stałego iteracji odwzorowań gładkich na szerszą klasę przekształeń.
-
Fixed point indices of iterations of C^1 maps in R^3
PublikacjaW przypadku gładkiego odwzorowania w R^3 dowiedziona została hipoteza Chowa, Malleta-Pareta i Yorka dotycząca postaci ciągów indeksow iteracji oraz podano kompletny opis możliwych ciągów indeksow.
-
Fixed points of planar homeomorphisms of the form Identity + Contraction
PublikacjaW pracy dowodzi się, przy użyciu indeksu, istnienia punktów stałych dla planarnych homeomorfizmów, których orbity spełniają pewien geometryczny warunek.
-
A Strategy to Locate Fixed Points and Global Perturbations of ODE’s: Mixing Topology with Metric Conditions
PublikacjaIn this paper we discuss a topological treatment for the planar system z' = f (t, z) + g(t, z) where f and g are T -periodic in time and g(t, z) is bounded. Namely, we study the effect of g(t, z) in two different frameworks: isochronous centers and time periodic systems having subharmonics. The main tool employed in the proofs consists of a topological strategy to locate fixed points in the class of orientation preserving embedding...
-
General form of fixed point indices of an iterated C^1 map andinfiniteness of minimal periods
PublikacjaDla zwartego podzbioru punktów periodycznych gładkiego odwzorowania podana zostaje formuła na indeksy iteracji. Wynik stanowi uogólnienie rezultatu Chowa, Malleta-Pareta i Yorke'a.
-
Dynamics of Field Line Mappings in Magnetic Flux Tubes
PublikacjaWe study the topological constraints on the dynamics of magnetic field lines in flux tubes. Our approach is based on the application of the topological invariant: fixed point index. We consider periodic flux tubes and find various restrictions on the field lines that come from the sequence of fixed point indices of iterations. We also analyze the case of a tube with a cylindrical obstacle, deducing some special dynamical properties...
-
Sequences of fixed point indices of iterations in dimension 2.
PublikacjaW pracy dowodzi się, że każdy ciąg liczb całkowitych spełniający relacje Dolda może zostać zrealizowany jako ciąg indeksów punktu stałego iteracji ciągłego odwzorowania dwuwymiarowego dysku w siebie.
-
Fixed point indices of iterations of planar homeomorphisms.
PublikacjaW pracy bada się postać indeksów iteracji lokalnych homeomorfizmów płaszczyzny.
-
Kierunek wzrostu strumienia mocy w układzie napędu i sterowania hydrostatycznego. Graficzne przedstawianie mocy strat energetycznych oraz mocy rozwijanych w elementach układu. Część I. Układy ze sterowaniem dławieniowym szeregowym prędkości silnika hydraulicznego obrotowego
PublikacjaZaproponowano i uzasadniono wykres przedstawiający kierunek wzrostu strumienia mocy narastającej od wału lub tłoczyska silnika hydraulicznego do wału pompy, mocy narastającej w wyniku wymuszania przez moce strat energetycznych występujących w elementach układu i sterowania hydrostatycznego. Przedstawiono interpretację graficzną mocy strat energetycznych występujących w elementach układów, a także mocy rozwijanych przez te elementy....
-
Synthetic Principles Determining Local Organization of Copolyesters Prepared from Lactones and Macrolactones
PublikacjaA highly effective and facile technique for catalytic ring-opening copolymerization (cROP) of lactones viz. ε- caprolactone and ε-decalactone with ω-pentadecalactone is being described. The reactions were mediated by Zn- and Cabased tridentate Schiff base complexes and benzyl alcohol as initiator. The catalysts were successfully employed for the preparation of numerous block and random copolymers. To unravel the composition of...
-
Bond graph modeling of the new generation engine cooling systems = Zastosowanie metody grafów wiązań do modelowania nowej generacji układów chłodzenia silników spalinowych
PublikacjaW referacie szczegółowo opisano modele wymiany ciepła i przepływów w układzie chłodzenia. Metoda grafów wiązań okazała się szczególnie użyteczną dla modelowania skomplikowanych systemów energetycznych o różnych postaciach energii. Jako przykładu użyto obiegu chłodzenia silnika badawczego na hamowni silnikowej.
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 4 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 4 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 6 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 6 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 5 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 5 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 8 and homology groups with the sum of ranks less or equal to 10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 8 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g tori
Dane BadawczeMorse–Smale diffeomorphisms, structurally stable and having relatively simple dynamics, constitute an important subclass of diffeomorphisms that have been carefully studied during past decades. For a given Morse–Smale diffeomorphism one can consider “Minimal set of Lefschetz periods”, which provides the information about the set of periodic points of...
-
Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g real projective planes.
Dane BadawczeMorse–Smale diffeomorphisms, structurally stable and having relatively simple dynamics, constitute an important subclass of diffeomorphisms that were carefully studied during past decades. For a given Morse–Smale diffeomorphism one can consider “Minimal set of Lefschetz periods”, which provides the information about the set of periodic points of considered...
-
Minimal number of periodic points with the periods less or equal to r in the smooth homotopy class of simply-connected manifolds of dimension 7 and homology groups with the sum of ranks less or equal to10
Dane BadawczeAn important problem in periodic point theory is minimization of the number of periodic points with periods <= r in a given class of self-maps of a space. A closed smooth and simply-connected manifolds of dimension 7 and its self-maps f with periodic sequence of Lefschetz numbers are considered. The topological invariant Jr[f] is equal to the minimal...
-
The database of odd algebraic periods for quasi-unipotent self-maps of a space having the same homology group as the connected sum of g tori
Dane BadawczeThe dataset consists of 20 files indexed by numbers g=1,...,20. Each file provides sets of odd algebraic periods for all quasi-unipotent self-maps of a space having the same homology groups as the connected sum of g tori. Let us remark that each data set covers all algebraical restrictions that come from zeta functions for the sets of minimal Lefschetz...
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Dane BadawczeFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
The values of Block Entropy for individuals with Normal Sinus Rhythm
Dane BadawczeThe dataset consists of calculated values of entropy of 75 000 intervals between consecutive heartbeats (RR intervals) for 54 patients with normal sinus rhythm (NSR). The original data were taken from PhysioNet Normal Sinus Rhythm RR Interval Database (cf. Goldberger A., Amaral L., Glass L., Hausdorff J., Ivanov P.C., Mark R., Mietus J.E., Moody G.B.,...
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Dane BadawczeFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Dane BadawczeFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Dane BadawczeFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
The values of Permutation Entropy for individuals with Normal Sinus Rhythm
Dane BadawczeThe dataset consists of calculated values of entropy of 75 000 intervals between consecutive heartbeats (RR intervals) for 54 patients with normal sinus rhythm (NSR). The original data were taken from PhysioNet Normal Sinus Rhythm RR Interval Database (cf. Goldberger A., Amaral L., Glass L., Hausdorff J., Ivanov P.C., Mark R., Mietus J.E., Moody G.B.,...
-
The values of Block Entropy for patients with Congestive Heart Failure
Dane BadawczeThe dataset consists of calculated values of entropy of 75 000 intervals between consecutive heartbeats (RR intervals) for 29 patients with congestive heart failure (CHF). The original data were taken from PhysioNet Congestive Heart Failure RR Interval Database (cf. Goldberger A., Amaral L., Glass L., Hausdorff J., Ivanov P.C., Mark R., Mietus J.E.,...
-
The values of Permutation Entropy for patients with Congestive Heart Failure
Dane BadawczeThe dataset consists of calculated values of entropy of 75 000 intervals between consecutive heartbeats (RR intervals) for 29 patients with congestive heart failure (CHF). The original data were taken from PhysioNet Congestive Heart Failure RR Interval Database (cf. Goldberger A., Amaral L., Glass L., Hausdorff J., Ivanov P.C., Mark R., Mietus J.E.,...
-
A collection of directed graphs for the minimum cycle mean weight computation
Dane BadawczeThis dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08 These...
-
Estimates for minimal number of periodic points for smooth self-maps of simply-connected manifolds
Dane BadawczeWe consider a closed smooth connected and simply-connected manifold of dimension at least 4 and its self-map f. The topological invariant Dr[f] is equal to the minimal number of r-periodic points in the smooth homotopy class of f. We assume that r is odd and all coefficients b(k) of so-called periodic expansion of Lefschetz numbers of iterations are...
-
Minimal number of periodic points for smooth self-maps of simply-connected manifolds
Dane BadawczeThe problem of finding the minimal number of periodic points in a given class of self-maps of a space is one of the central questions in periodic point theory. We consider a closed smooth connected and simply-connected manifold of dimension at least 4 and its self-map f. The topological invariant D_r[f] is equal to the minimal number of r-periodic points...
-
Stochastic intervals for the family of quadratic maps
Dane BadawczeNumerical analysis of chaotic dynamics is a challenging task. The one-parameter families of logistic maps and closely related quadratic maps f_a(x)=a-x^2 are well-known examples of such dynamical systems. Determining parameter values that yield stochastic-like dynamics is especially difficult, because although this set has positive Lebesgue measure,...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Dane BadawczeFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Dane BadawczeFor K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Dane BadawczeFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Dane BadawczeFor Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...
-
Dataset of non-isomorphic graphs of the coloring types (K4,K4;n), 1<n<R(4,4)
Dane BadawczeFor K4 graph, a coloring type (K4,K4;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the K4 subgraph in the second color (representing by edges in the graph).The Ramsey number R(4,4) is the smallest natural number n such that for any edge coloring of...
-
Grafika inżynierska II W, L, Inżynieria materiałowa, sem. 05, zimowy, 2022/2023 (PG_00039813)
Kursy OnlineKurs z przedmiotu "Grafika inżynierska II" dla kierunku Inżynieria Materiałowa, studia I stopnia, sem. 05
-
Grafika komputerowa, specj. ZLwT, I st., inż., stacj., 2023/24, sem. 6 (PG_000056217)
Kursy Online -
The database of indices computed from RR-intervals of length 512 of 41 patients at rest hospitalized due to the episode of acute ischemic stroke
Dane BadawczeThis dataset contains the data that was a basis for the results discussed in the paper “Persistent homology as a new method of the assessment of heart rate variability” by Grzegorz Graff, Beata Graff, Paweł Pilarczyk, Grzegorz Jabłoński, Dariusz Gąsecki, Krzysztof Narkiewicz, Plos One (2021), DOI: 10.1371/journal.pone.0253851.
-
The database of indices computed from RR-intervals of length 512 of 46 healthy subjects at rest
Dane BadawczeThis dataset contains the data that was a basis for the results discussed in the paper “Persistent homology as a new method of the assessment of heart rate variability” by Grzegorz Graff, Beata Graff, Paweł Pilarczyk, Grzegorz Jabłoński, Dariusz Gąsecki, Krzysztof Narkiewicz, Plos One (2021), DOI: 10.1371/journal.pone.0253851.
-
Ordinal pattern statistics for the assessment of heart rate variability
PublikacjaThe recognition of all main features of a healthy heart rhythm (the so-called sinus rhythm) is still one of the biggest challenges in contemporary cardiology. Recently the interesting physiological phenomenon of heart rate asymmetry has been observed. This phenomenon is related to unbalanced contributions of heart rate decelerations and accelerations to heart rate variability. In this paper we apply methods based on the concept...
-
Ordinal Pattern Statistics for RR Intervals during Head-Up Tilt Test in Patients with the History of Vasovagal Syncope
PublikacjaWe apply ordinal pattern analysis to quantify differences in distribution of patterns of length 3 and 4 in basal state and during head-up tilt test (HUTT) in patients with the history of syncope and positive (HUTT(+)) or negative (HUTT(-)) responses to the test. We identify the patterns related to prevalence of sympathetic or parasympathetic cardiac modulation as well as describe the relations between the response to the test and...
-
Differentiating patients with obstructive sleep apnea from healthy controls based on heart rate-blood pressure coupling quantified by entropy-based indices
PublikacjaWe introduce an entropy-based classification method for pairs of sequences (ECPS) for quantifying mutual dependencies in heart rate and beat-to-beat blood pressure recordings. The purpose of the method is to build a classifier for data in which each item consists of two intertwined data series taken for each subject. The method is based on ordinal patterns and uses entropy-like indices. Machine learning is used to select a subset...
-
Efficient parallel query processing by graph ranking
PublikacjaW artykule analizujemy przybliżony algorytm dla problemu szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym, co znajduje zastosowanie w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie uporządkowanego indeksu chromatycznego drzewa, które prowadzi do uzyskania lepszej funkcji dobroci wspomnianego algorytmu.
-
Computations of the least number of periodic points of smooth boundary-preserving self-maps of simply-connected manifolds
PublikacjaLet $r$ be an odd natural number, $M$ a compact simply-connected smooth manifold, $\dim M\geq 4$, such that its boundary $\partial M$ is also simply-connected. We consider $f$, a $C^1$ self-maps of $M$, preserving $\partial M$. In [G. Graff and J. Jezierski, Geom. Dedicata 187 (2017), 241-258] the smooth Nielsen type periodic number $D_r(f;M,\partial M)$ was defined and proved to be equal to the minimal number of $r$-periodic points...