JIANG, LIQIU. The Simulation and Approximation of the First Passage Time of the Ornstein–Uhlenbeck Process of Neuron. (Under the direction of Charles Eugene Smith.) Neurons communicate with each other via sequences of action potentials. The purpose of this study is to approximate the interval between action potentials which is also called the First Passage Time (FPT), the first time the membran...

We used satellite telemetry, remotely sensed data (bathymetry, chlorophyll a (chl a), sea-surface temperature (SST), wind speed) and first-passage time (FPT) analysis to determine the distribution, movement patterns, and habitat associations of short-tailed albatrosses (Phoebastria albatrus) during the non-breeding season, 2002 and 2003. Satellite transmitters were deployed on birds immediately...

Topological fuzzy pharmacophore triplets (2D-FPT), using the number of interposed bonds to measure separation between the atoms representing pharmacophore types, were employed to establish and validate quantitative structure-activity relationships (QSAR). Thirteen data sets for which state-of-the-art QSAR models were reported in literature were revisited in order to benchmark 2D-FPT biological ...

An impressive hardness theory which can prove compression lower bounds for a large number of FPT problems has been established under the assumption that NP ⊈ coNP/poly. However, there are no in existence ...

It is shown that the parity game can be solved in quasipolynomial time. The parameterised parity game – with n nodes andm distinct values (aka colours or priorities) – is proven to be in the class of xed parameter tractable (FPT) problems when parameterised over m. Both results improve known bounds, from runtime nO ( √ n) to O (nlog(m)+6) and from anXP-algorithm with runtimeO (nΘ(m) ) for xed p...

where 6(T) is the unit impulse function. If the coefficients of Eq. 1 and the noise spectral density were arbitrary rather than as specified above, the problem could easily be reduced to that described with suitable scaling of x and t. The problem is illustrated in Fig. XVI-1. Solution for the first zero of y(t) = Et + x(t) is equivalent to determining the first time instant that x(t) = -Et. As...

In this paper, we present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems' formulations are near square. The parameter is the maximum absolute value of rank minors of the corresponding matrices. Additionally, we present FPT-algorithms with respect to the same parameter for...

We study the dynamics of protein folding via statistical energy-landscape theory. In particular, we concentrate on the local-connectivity case with the folding progress described by the fraction of native conformations. We found that the first passage-time (FPT) distribution undergoes a dynamic transition at a temperature below which the FPT distribution develops a power-law tail, a signature o...