Paweł Pilarczyk - Publikacje - MOST Wiedzy

Wyszukiwarka

Filtry

wszystkich: 32

  • Kategoria
  • Rok
  • Opcje

wyczyść Filtry wybranego katalogu niedostępne

Katalog Publikacji

Rok 2024
  • An absorbing set for the Chialvo map

    The classical Chialvo model, introduced in 1995, is one of the most important models that describe single neuron dynamics. In order to conduct effective numerical analysis of this model, it is necessary to obtain a rigorous estimate for the maximal bounded invariant set. We discuss this problem, and we correct and improve the results obtained by Courbage and Nekorkin (2010). In particular, we provide an explicit formula for an...

    Pełny tekst do pobrania w serwisie zewnętrznym

Rok 2023
Rok 2021
  • Nilpotent singularities and chaos: Tritrophic food chains
    Publikacja

    - CHAOS SOLITONS & FRACTALS - Rok 2021

    Local bifurcation theory is used to prove the existence of chaotic dynamics in two well-known models of tritrophic food chains. To the best of our knowledge, the simplest technique to guarantee the emergence of strange attractors in a given family of vector fields consists of finding a 3-dimensional nilpotent singularity of codimension 3 and verifying some generic algebraic conditions. We provide the essential background regarding...

    Pełny tekst do pobrania w portalu

  • Persistent homology as a new method of the assessment of heart rate variability
    Publikacja

    - PLOS ONE - Rok 2021

    Heart 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...

    Pełny tekst do pobrania w portalu

Rok 2020
  • A space-efficient algorithm for computing the minimum cycle mean in a directed graph

    An algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Rigorous numerics for critical orbits in the quadratic family
    Publikacja

    - CHAOS - Rok 2020

    We develop algorithms and techniques to compute rigorous bounds for finite pieces of orbits of the critical points, for intervals of parameter values, in the quadratic family of one-dimensional maps fa(x)=a−x2. We illustrate the effectiveness of our approach by constructing a dynamically defined partition P of the parameter interval Ω=[1.4,2] into almost 4 million subintervals, for each of which we compute to high precision the...

    Pełny tekst do pobrania w portalu

Rok 2016
Rok 2015
Rok 2014
Rok 2012
Rok 2011
Rok 2010
Rok 2009
Rok 2008
Rok 2007
Rok 2005
Rok 2002
Rok 2000
Rok 1999

wyświetlono 3549 razy