Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge, MA, 1979] and Yesha [SIAM J. Comput., 12 (1983), pp. 411–425], respectively. The question of which sets have optimal safe and unsafe approximations has been investigated extensively. Duris and Rolim [Lecture Notes in...

Unsafe Abortion constitutes a major cause of maternal morbidity and mortality in developing countries. It is randomly practiced though exact statistics is not available due to lack of cooperation from concerned parties. Complications occur in a large portion of these cases which ultimately require tertiary care. This case report of complications associated with an unsafe abortion highlights the...

Unsafe injection practices are associated with substantial morbidity and mortality, particularly from hepatitis B and C and human immunodeficiency virus (HIV) infections. These inadvertently transmitted bloodborne diseases become manifest some considerable time after infection and hence may not be appropriately accounted for. Annually more than 1.3 million deaths and US$ 535 million are estimat...

Frank is a writer with a strange habit. Every morning, at precisely 7:30 a.m., he wakes up and dumps out whatever is left of the pint of milk he purchased the day before, but places the empty carton back in the fridge until noon. Then, throughout the interval from 7:30 to noon, he always remains in the kitchen, as that is where he writes every morning like clockwork. Finally, at exactly noon, h...

An estimated 19 million unsafe abortions occur worldwide each year, resulting in the deaths of about 70,000 women. Legalization of abortion is a necessary but insufficient step toward improving women's health. Without skilled providers, adequate facilities and easy access, the promise of safe, legal abortion will remain unfulfilled, as in India and Zambia. Both suction curettage and pharmacolog...

We show that the problem of checking if an infinite tree generated by a higher-order grammar of level 2 (hyperalgebraic) satisfies a given μ-calculus formula (or, equivalently, if it is accepted by an alternating parity automaton) is decidable, actually 2-Exptime-complete. Consequently, the monadic second-order theory of any hyperalgebraic tree is decidable, so that the safety restriction can b...