Research has shown that different maladaptive behavior categories may be maintained by different contingencies. We examined whether behavior categories or behavior topographies determine functional properties. The Questions about Behavioral Function with its five subscales (Attention, Escape, Nonsocial, Physical, and Tangible) was completed by direct care staff for one target behavior for each ...

We consider two first passage problems for stable processes, not necessarily symmetric, in one dimension. We make use of a novel method of path censoring in order to deduce explicit formulas for hitting probabilities, hitting distributions and a killed potential measure. To do this, we describe in full detail the Wiener–Hopf factorization of a new Lamperti-stable-type Lévy process obtained via ...

We present an approximation algorithm for the hitting set problem when the VC-dimension of the set system is small. Our algorithm builds on Pach & Agarwal [7], and we show how it can be parallelized and extended to the minimum cost hitting set problem. The running time of the proposed algorithm is comparable with that of Brönnimann & Goodrich [2], and the approximation ratio is smaller by a con...

Equivalence of the spectral gap, exponential integrability of hitting times and Lyapunov conditions are well known. We give here the correspondance (with quantitative results) for reversible diffusion processes. As a consequence, we generalize results of Bobkov in the one dimensional case on the value of the Poincaré constant for logconcave measures to superlinear potentials. Finally, we study ...

For random walks on finite graphs, we record some equalities, inequalities and limit theorems (as the size of graph tends to infinity) which hold for vertex-transitive graphs but not for general regular graphs. The main result is a sharp condition for asymptotic exponentiality of the hitting time to a single vertex. Another result is a lower bound for the coefficient of variation of hitting tim...

A collection of landmarks is complete if the cost of a minimum-cost hitting set equals h and there is a minimumcost hitting set that is an optimal relaxed plan. We present an algorithm for generating a complete collection of landmarks and we show that this algorithm can be extended into effective polytime heuristics for optimal and satisficing planning. The new admissible heuristics are compare...

The effect of prior attention was systematically manipulated to study its influence on rates of yelling and head hitting, both maintained by positive reinforcement in the form of attention. Higher levels of head hitting occurred in analogue attention conditions when the person was deprived of attention (no social interactions for 1 hr) prior to the analysis in comparison to when the person rece...

Geometric Hitting Sets and Their Variants

We introduce the successive Hitting Set model, where the set system is not given in advance but a set generator produces the sets that contain a specific element from the universe on demand. Despite incomplete knowledge about the set system, we show that several approximation algorithms for the conventional Hitting Set problem can be adopted to perform well in this model. We describe, and exper...

Spectral theory for transition operators of one-dimensional symmetric Lévy process killed upon hitting the origin is studied. Under very mild assumptions, an integraltype formula for eigenfunctions is obtained, and eigenfunction expansion of transition operators and the generator is proved. As an application, and the primary motivation, integral fomulae for the transition density and the distri...