Above two dimensions, diffusion of a particle in a medium with quenched random traps is believed to be well described by the annealed continuous-time random walk. We propose an approximate expression for the first-passage-time (FPT) distribution in a given sample that enables detailed comparison of the two problems. For a system of finite size, the number and spatial arrangement of deep traps y...

We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a significantly improved FPT algorithm for the Maximum Leaf Spanning Tree problem. Furthermore, we sketch how the methods can be applied to a number of other well-known problems, including the parametric dual of Dominating Set (also known as Nonblocker), Matri...

BACKGROUND Previous studies have shown a high prevalence of failure of passive transfer of immunity (FPT) in Swiss dairy calves. OBJECTIVES To investigate risk factors associated with poor colostrum quality and FPT on Swiss dairy farms. ANIMALS Colostrum and serum samples from 373 dam-calf pairs at 141 farms. METHODS The gamma globulin (Gg) concentrations of the dams' colostrum and the ca...

The aim of this study was to examine the effect of chewing efforts on sensory and pain thresholds of the orofacial skin of symptom-free subjects. Fourteen healthy volunteers were recruited. Using a stair-case method, the tactile detection threshold (TDT) and the filament-prick pain detection threshold (FPT) on the cheek skin (CS) and the skin overlying the palm side of the thenar skin (TS) were...

We give a non-FPT lower bound on the size of structured decision DNNF and OBDD with decomposable AND-nodes representing CNFformulas of bounded incidence treewidth. Both models are known to be of FPT size for CNFs of bounded primal treewidth. To the best of our knowledge this is the first parameterized separation of primal treewidth and incidence treewidth for knowledge compilation models.

Fixed-parameter tractability (FPT ) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with previous methods. In this paper we show how to enhance this approach through the addition of parallelism, thereby allowing even larger problem instances to be solved in practice. More precisely, we demonstrate the po...

The talk will survey the rich toolkit of FPT algorithm design methodologies that has developed over the last 20 years, including “older” techniques such as well-quasi-ordering, bounded treewidth, color-coding, reduction to a problem kernel, and bounded search trees — which have continued to deepen and advance — as well as some recently developed approaches such as win/win’s, greedy localization...

This study deals with the most challenging numerical aspect for solving the quantification problem in magnetic resonance spectroscopy (MRS). The primary goal is to investigate whether it could be feasible to carry out a rigorous computation within finite arithmetics to reconstruct exactly all the machine accurate input spectral parameters of every resonance from a synthesized noiseless time sig...