OBJECTIVE To predict the likelihood of violence perpetration given various combinations of the most statistically salient risk and protective factors related to violence perpetration. DESIGN Urban Indian Youth Health Survey, conducted from October 9, 1995, to March 30, 1998, consisting of 200 forced-choice items exploring values, cultural identity, relationships, decision-making skills, and h...

A d-interval is the union of d disjoint intervals on the real line. In the d-interval stabbing problem (d-is) we are given a set of d-intervals and a set of points, each d-interval I has a stabbing requirement r(I) and each point has a weight, and the goal is to find a minimum weight multiset of points that stabs each d-interval I at least r(I) times. In practice there is a trade-off between fu...

The NP-complete geometric covering problem Rectangle Stabbing is defined as follows: Given a set of horizontal and vertical lines in the plane, a set of rectangles in the plane, and a positive integer k, select at most k of the lines such that every rectangle is intersected by at least one of the selected lines. While it is known that the problem can be approximated in polynomial time with a fa...

We present an (n log n) xed order algebraic decision tree lower bound for determining the existence of a line stabber for a family of n line segments in the plane. We give the same lower bound for determining the existence of a line stabber for n translates of a circle in the plane. In proving this lower bound, we show that this problem is equivalent to determining if the width of a set of poin...

A 5-year-old female with SCD presented thunderclap headaches, followed by stabbing headaches after receiving an exchange transfusion and prednisolone. She developed ischemic infarcts in the left parietal right paramedian frontal lobes.

The stabbing number of a partition of a rectilinear polygon P into rectangles is the maximum number of rectangles stabbed by any axis-parallel line segment contained in P . We consider the problem of finding a rectangular partition with minimum stabbing number for a given rectilinear polygon P . First, we impose a conforming constraint on partitions: every vertex of every rectangle in the parti...