We study the first passage time (FPT) problem for biased continuous time random walks. Using the recently formulated framework of fractional Fokker-Planck equations, we obtain the Laplace transform of the FPT density function when the bias is constant. When the bias depends linearly on the position, the full FPT density function is derived in terms of Hermite polynomials and generalized Mittag-...

The First-Passage Time (FPT) problems have numerous practical applications in fields that go from engineering and physics to finance and biology among many others. For the case of Markov gamma processes, this paper develops a methodology that combines the first Pontryagin equation approach and the cumulant analysis in order to obtain FPT statistics. For investigation about the structure of the ...

We apply the theory of parameterised complexity to planning, using the concept of fixed-parameter tractability (fpt) which is more relaxed than the usual tractability concept. The parameter we focus on is the maximal number of paths in the domain-transition graphs, and we show that for this parameter, optimal planning is fpt for planning instances with polytree causal graphs and acyclic domain-...

We study the first passage time (FPT) problem in Levy type of anomalous diffusion. Using the recently formulated fractional Fokker-Planck equation, we obtain an analytic expression for the FPT distribution which, in the large passage time limit, is characterized by a universal power law. Contrasting this power law with the asymptotic FPT distribution from another type of anomalous diffusion exe...

Background: auditory temporal processing. Aim: to determine the performance profile of normal hearing children in temporal sequence and order detection and identification tasks in free-field. Method: forty three children with ages raging from 7 to 11 years and 5 months were evaluated in two behavioral tests frequency patterns test (FPT) and duration patterns test (DPT) child's version by Audite...

The central conjecture of parameterized complexity states that FPT 6= W[1], and is generally regarded as the parameterized counterpart to P 6= NP. We revisit the issue of the plausibility of FPT 6= W[1], focusing on two aspects: the difficulty of proving the conjecture (assuming it holds), and how the relation between the two classes might differ from the one between P and NP. Regarding the fir...

A first-passage-time FPT approach to accelerate kinetic Monte Carlo KMC simulations of metal 100 epitaxial growth with fast edge diffusion is described. In our approach, the process of singly-bonded edge diffusion is replaced by a calculation of the first-passage time for an edge diffuser to be absorbed either by corner rounding or kink attachment, while the remaining activated processes are tr...

The fast Padé transform (FPT) is a method of spectral analysis that can be used to reconstruct nuclear magnetic resonance spectra from truncated free induction decay signals with superior robustness and spectral resolution compared with conventional Fourier analysis. The aim of this study is to show the utility of FPT in reducing of the scan time required for hyperpolarized 13C chemical shift i...

The optimization version of the Unique Label Cover problem is at the heart of the Unique Games Conjecture which has played an important role in the proof of several tight inapproximability results. In recent years, this problem has been also studied extensively from the point of view of parameterized complexity. Chitnis et al. [FOCS 2012, SICOMP 2016] proved that this problem is fixed-parameter...