We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d∗, remove from S the fewest number of points so that the remaining set has doubling dimension at most d∗. We present a bicriteria approximation for this problem, and extend this algorithm to solve a group of proximity problems.

We introduce a novel approach towards Harnack’s inequality in the context of spaces of homogeneous type. This approach, based on the socalled critical density property and doubling properties for weights, avoids the explicit use of covering lemmas and BMO.

The accuracy of time-to-contact (TTC) judgments for single approaching objects is well researched, however, close to nothing is known about our ability to make simultaneous TTC judgments for two or more objects. Such complex judgments are required in many everyday situations, for instance when crossing a multi-lane street or when engaged in multi-player ball games. We used a prediction-motion p...

The authors describe ACT-R/perceptual-motor (ACT-R/PM), an integrated theory of cognition, perception, and action that consists of the ACT-R production system and a set of perceptual-motor modules. Each module (including cognition) is essentially serial, but modules run in parallel with one another. ACT-R/PM can model simple dual tasks such as the psychological refractory period (PRP), includin...

We give new examples of discrete Schrδdinger operators with potentials taking finitely many values that have purely singular continuous spectrum. If the hull X of the potential is strictly ergodic, then the existence of just one potential x in X for which the operator has no eigenvalues implies that there is a generic set in X for which the operator has purely singular continuous spectrum. A su...

Most studies using the psychological refractory period (PRP) design suggest that dual-task performance is limited by a central bottleneck. Because subjects are usually told to emphasize Task 1, however, the bottleneck might reflect a strategic choice rather than a structural limitation. To evaluate the possibility that central operations can proceed in parallel, albeit with capacity limitations...

In most algorithms involving elliptic and hyperelliptic curves, the costliest part consists in computing multiples of ideal classes. This paper investigates how to compute faster doubling over fields of characteristic two. We derive explicit doubling formulae making strong use of the defining equation of the curve. We analyze how many field operations are needed depending on the curve making cl...

This paper presents a new shape for ordinary elliptic curves over fields of characteristic 2. Using the new shape, this paper presents the first complete addition formulas for binary elliptic curves, i.e., addition formulas that work for all pairs of input points, with no exceptional cases. If n ≥ 3 then the complete curves cover all isomorphism classes of ordinary elliptic curves over F2n . Th...