DCDS
On the limit quasi-shadowing property
Fang Zhang Yunhua Zhou

In this paper, we study the limit quasi-shadowing property for diffeomorphisms. We prove that any quasi-partially hyperbolic pseudoorbit $\{x_{i},n_{i}\}_{i∈ \mathbb{Z}}$ can be $\mathcal{L}^p$-, limit and asymptotic quasi-shadowed by a points sequence $\{y_{k}\}_{k∈ \mathbb{Z}}$. We also investigate the $\mathcal{L}^p$-, limit and asymptotic quasi-shadowing properties for partially hyperbolic diffeomorphisms which are dynamically coherent.

keywords: limit quasi-shadowing quasi-partially hyperbolic pseudoorbit partial hyperbolicity dynamical coherence
DCDS-B
Analysis of a free boundary problem for tumor growth with Gibbs-Thomson relation and time delays
Shihe Xu Meng Bai Fangwei Zhang

In this paper we study a free boundary problem for tumor growth with Gibbs-Thomson relation and time delays. It is assumed that the process of proliferation is delayed compared with apoptosis. The delay represents the time taken for cells to undergo mitosis. By employing stability theory for functional differential equations, comparison principle and some meticulous mathematical analysis, we mainly study the asymptotic behavior of the solution, and prove that in the case $c$ (the ratio of the diffusion time scale to the tumor doubling time scale) is sufficiently small, the volume of the tumor cannot expand unlimitedly. It will either disappear or evolve to one of two dormant states as $t\to ∞$. The results show that dynamical behavior of solutions of the model are similar to that of solutions for corresponding nonretarded problems under some conditions.

keywords: Tumor growth free boundary problem global existence and uniqueness asymptotic behavior stability
AMC
Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
Steven D. Galbraith Ping Wang Fangguo Zhang

The negation map can be used to speed up the computation of elliptic curve discrete logarithms using either the baby-step giant-step algorithm (BSGS) or Pollard rho. Montgomery's simultaneous modular inversion can also be used to speed up Pollard rho when running many walks in parallel. We generalize these ideas and exploit the fact that for any two elliptic curve points X and Y, we can efficiently get X-Y when we compute X+Y. We apply these ideas to speed up the baby-step giant-step algorithm. Compared to the previous methods, the new methods can achieve a significant speedup for computing elliptic curve discrete logarithms in small groups or small intervals.

Another contribution of our paper is to give an analysis of the average-case running time of Bernstein and Lange's "grumpy giants and a baby" algorithm, and also to consider this algorithm in the case of groups with efficient inversion.

Our conclusion is that, in the fully-optimised context, both the interleaved BSGS and grumpy-giants algorithms have superior average-case running time compared with Pollard rho. Furthermore, for the discrete logarithm problem in an interval, the interleaved BSGS algorithm is considerably faster than the Pollard kangaroo or Gaudry-Schost methods.

keywords: Baby-step giant-step algorithm elliptic curve discrete logarithm negation map

Year of publication

Related Authors

Related Keywords

[Back to Top]