A straight skeleton of a polygon or of a polytope is a piecewise linear skeletal structure that partitions the underlying object by means of a self-parallel shrinking process. We propose a method for constructing different straight skeletons for a given nonconvex polytope Q in 3-space. The approach is based on so-called bisector graphs on the sphere, and allows for generating straight skeletons...

The purpose of this study was to develop new and modified tools that allow HDR brachytherapy quality assurance tests to be carried out efficiently without film, video cameras, stopwatches, and mechanical rulers; and to devise methods that use these new tools for daily and quarterly check procedures, which are efficient and provide increased accuracy compared to previous methods. The HDR brachyt...

THE FOOD AND DRUG ADMINISTRATION (FDA) REcently announced another Advisory Panel scheduled to meet in July 2010 to consider whether or not to remove rosiglitazone from the market. Central to the discussion will be the results of a recently published cardiovascular outcomes trial that randomized patients to receive rosiglitazone or alternative diabetes therapies, the RECORD trial. On February 20...

ytoplasmic structures are sites of active mammalian mRNA decay, according to Cougot et al. (page 31). The group had previously identified cytoplasmic foci that included two human mRNA decapping enzymes. They now add subunits of a deadenylase, exonuclease, and possible helicase to the list of proteins found at these sites. After inhibition of a 5 –3 exonuclease, poly(A) RNA accumulates at the sa...

Straight-line programs offer powerful text compression by representing a text T [1, u] in terms of a context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar representation able of extracting text substrings, and of searching the text for patterns, in time o(...

lines, pseudolines, polar coordinates, trilinear coordinates, non-linear programming, geometry We present a graph-drawing algorithm which respects extended co-linearity constraints. These are expressed as a set of ‘straight’ paths in a planar graph. Constraints of this sort are translated into a set of inequalities over polar coordinates of lines. These inequalities provide necessary and suffic...