For augmented fluoroscopy in the context of minimally invasive EP procedures, a patient-specific model of the atrium segmented from a 3-D volume can be overlaid on fluoroscopic images. This requires a registration between the 3-D model coordinate system and the coordinate system of the C-arm X-ray device. We propose an indirect registration that makes use of surrounding anatomical structures th...

For a prime power q, we study the distribution of determinent of matrices with restricted entries over a finite field Fq of q elements. More precisely, let Nd(A; t) be the number of d×d matrices with entries in A having determinant t. We show that Nd(A; t) = (1 + o(1)) |A|d2 q , if |A| = ω(q d 2d−1 ), d > 4. When q is a prime and A is a symmetric interval [−H,H], we get the same result for d > ...

Abstract. We introduce deformation theoretic methods for determining when a curve X in a nonhyperelliptic Jacobian JC will deform with JC to a non-Jacobian. We apply these methods to a particular class of curves in the second symmetric power C of C. More precisely, given a pencil g1 d of degree d on C, let X be the curve parametrizing pairs of points in divisors of g1 d (see the paper for the p...

In this paper we describe a system that uses patterns of eye blinks as a biometric. Each user chooses a personal blink pattern based on a song (for example “Jingle Bells”). To establish their identity, the user looks at the system’s camera and blinks to the cadence of their chosen song. Computer vision is used to detect the blinks and to compare the blinked cadence to a database of stored blink...

in this review, we discuss the use of a variety of 3-d models (particularly 3-d skin, lung, breast and endothelial) in radiobiological research and highlight the differences in responses compared to 2-d culturing conditions (monolayers). we review the characteristics of existing 3-d models and aim to point out the substantial advantages 3-d cultures provide for modern radiobiology. in particula...

The square G of a graph G = (V,E) is the graph whose vertex set is V and in which two distinct vertices are adjacent if and only if their distance in G is at most 2. What is the maximum possible chromatic number of G, as G ranges over all graphs with maximum degree d and girth g? Our (somewhat surprising) answer is that for g = 3, 4, 5 or 6 this maximum is (1 + o(1))d (where the o(1) term tends...