The Churchman's prayer manual : for use at prayer meetings, mission services, conventions, Bible classes, study circles and other occasions of united prayer, as well as for private use compiled by G. R. Bullock-Webster.

http://www.archive.org/details/churchmansprayer00bulluoft

Children Affected by AIDS: A Review of the Literature on Orphaned and Vulnerable Children

This paper presents a systematic review of the literature pertaining to orphans and vulnerable children in sub-Saharan Africa, with a particular focus on research in countries heavily impacted by HIV/AIDS. Despite study and data limitations, the literature provides evidence of growing orphan-based disparities, difficulties within households providing care, and insufficient capacity among social services. Still, additional research is urgently needed, including better OVC surveillance methods, qualitative data than answers persisting questions, the inclusion of more useful indicators in national household surveys, and longitudinal studies to determine the mechanisms by which parental HIV status and death impacts children, caregiving impacts households, and the orphan epidemic impacts communities and social systems.

Metlakahtla Alaska church manuel [sic].

http://www.archive.org/details/metlakahtlaalask00duncrich

Statistic Rate Monotonic Scheduling

In this paper we present Statistical Rate Monotonic Scheduling (SRMS), a generalization of the classical RMS results of Liu and Layland that allows scheduling periodic tasks with highly variable execution times and statistical QoS requirements. Similar to RMS, SRMS has two components: a feasibility test and a scheduling algorithm. The feasibility test for SRMS ensures that using SRMS' scheduling algorithms, it is possible for a given periodic task set to share a given resource (e.g. a processor, communication medium, switching device, etc.) in such a way that such sharing does not result in the violation of any of the periodic tasks QoS constraints. The SRMS scheduling algorithm incorporates a number of unique features. First, it allows for fixed priority scheduling that keeps the tasks' value (or importance) independent of their periods. Second, it allows for job admission control, which allows the rejection of jobs that are not guaranteed to finish by their deadlines as soon as they are released, thus enabling the system to take necessary compensating actions. Also, admission control allows the preservation of resources since no time is spent on jobs that will miss their deadlines anyway. Third, SRMS integrates reservation-based and best-effort resource scheduling seamlessly. Reservation-based scheduling ensures the delivery of the minimal requested QoS; best-effort scheduling ensures that unused, reserved bandwidth is not wasted, but rather used to improve QoS further. Fourth, SRMS allows a system to deal gracefully with overload conditions by ensuring a fair deterioration in QoS across all tasks---as opposed to penalizing tasks with longer periods, for example. Finally, SRMS has the added advantage that its schedulability test is simple and its scheduling algorithm has a constant overhead in the sense that the complexity of the scheduler is not dependent on the number of the tasks in the system. We have evaluated SRMS against a number of alternative scheduling algorithms suggested in the literature (e.g. RMS and slack stealing), as well as refinements thereof, which we describe in this paper. Consistently throughout our experiments, SRMS provided the best performance. In addition, to evaluate the optimality of SRMS, we have compared it to an inefficient, yet optimal scheduler for task sets with harmonic periods.