By-paths to forgotten folks; stories of real life in Baptist home mission fields, by Coe Hayne. Ed. by the Department of missionary education, Board of education of the Northern Baptist convention.

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

Paediatric malaria case-management with artemether-lumefantrine in Zambia: a repeat cross-sectional study

BACKGROUND:Zambia was the first African country to change national antimalarial treatment policy to artemisinin-based combination therapy - artemether-lumefantrine. An evaluation during the early implementation phase revealed low readiness of health facilities and health workers to deliver artemether-lumefantrine, and worryingly suboptimal treatment practices. Improvements in the case-management of uncomplicated malaria two years after the initial evaluation and three years after the change of policy in Zambia are reported.METHODS:Data collected during the health facility surveys undertaken in 2004 and 2006 at all outpatient departments of government and mission facilities in four Zambian districts were analysed. The surveys were cross-sectional, using a range of quality of care assessment methods. The main outcome measures were changes in health facility and health worker readiness to deliver artemether-lumefantrine, and changes in case-management practices for children below five years of age presenting with uncomplicated malaria as defined by national guidelines.RESULTS:In 2004, 94 health facilities, 103 health workers and 944 consultations for children with uncomplicated malaria were evaluated. In 2006, 104 facilities, 135 health workers and 1125 consultations were evaluated using the same criteria of selection. Health facility and health worker readiness improved from 2004 to 2006: availability of artemether-lumefantrine from 51% (48/94) to 60% (62/104), presence of artemether-lumefantrine dosage wall charts from 20% (19/94) to 75% (78/104), possession of guidelines from 58% (60/103) to 92% (124/135), and provision of in-service training from 25% (26/103) to 41% (55/135). The proportions of children with uncomplicated malaria treated with artemether-lumefantrine also increased from 2004 to 2006: from 1% (6/527) to 27% (149/552) in children weighing 5 to 9 kg, and from 11% (42/394) to 42% (231/547) in children weighing 10 kg or more. In both weight groups and both years, 22% (441/2020) of children with uncomplicated malaria were not prescribed any antimalarial drug.CONCLUSION:Although significant improvements in malaria case-management have occurred over two years in Zambia, the quality of treatment provided at the point of care is not yet optimal. Strengthening weak health systems and improving the delivery of effective interventions should remain high priority in all countries implementing new treatment policies for malaria.

Securing Bulk Content Almost for Free

Content providers often consider the costs of security to be greater than the losses they might incur without it; many view "casual piracy" as their main concern. Our goal is to provide a low cost defense against such attacks while maintaining rigorous security guarantees. Our defense is integrated with and leverages fast forward error correcting codes, such as Tornado codes, which are widely used to facilitate reliable delivery of rich content. We tune one such family of codes - while preserving their original desirable properties - to guarantee that none of the original content can b e recovered whenever a key subset of encoded packets is missing. Ultimately we encrypt only these key codewords (only 4% of all transmissions), making the security overhead negligible.

Diversity of Forwarding Paths in Pocket Switched Networks

Forwarding in DTNs is a challenging problem. We focus on the specific issue of forwarding in an environment where mobile devices are carried by people in a restricted physical space (e.g. a conference) and contact patterns are not predictable. We show for the first time a path explosion phenomenon between most pairs of nodes. This means that, once the first path reaches the destination, the number of subsequent paths grows rapidly with time, so there usually exist many near-optimal paths. We study the path explosion phenomenon both analytically and empirically. Our results highlight the importance of unequal contact rates across nodes for understanding the performance of forwarding algorithms. We also find that a variety of well-known forwarding algorithms show surprisingly similar performance in our setting and we interpret this fact in light of the path explosion phenomenon.

On the Stable Paths Problem and a Restricted Variant

Interdomain routing on the Internet is performed using route preference policies specified independently, and arbitrarily by each Autonomous System in the network. These policies are used in the border gateway protocol (BGP) by each AS when selecting next-hop choices for routes to each destination. Conflicts between policies used by different ASs can lead to routing instabilities that, potentially, cannot be resolved no matter how long BGP is run. The Stable Paths Problem (SPP) is an abstract graph theoretic model of the problem of selecting nexthop routes for a destination. A stable solution to the problem is a set of next-hop choices, one for each AS, that is compatible with the policies of each AS. In a stable solution each AS has selected its best next-hop given that the next-hop choices of all neighbors are fixed. BGP can be viewed as a distributed algorithm for solving SPP. In this report we consider the stable paths problem, as well as a family of restricted variants of the stable paths problem, which we call F stable paths problems. We show that two very simple variants of the stable paths problem are also NP-complete. In addition we show that for networks with a DAG topology, there is an efficient centralized algorithm to solve the stable paths problem, and that BGP always efficiently converges to a stable solution on such networks.

Exact Geosedics and Shortest Paths on Polyhedral Surface

We present two algorithms for computing distances along a non-convex polyhedral surface. The first algorithm computes exact minimal-geodesic distances and the second algorithm combines these distances to compute exact shortest-path distances along the surface. Both algorithms have been extended to compute the exact minimalgeodesic paths and shortest paths. These algorithms have been implemented and validated on surfaces for which the correct solutions are known, in order to verify the accuracy and to measure the run-time performance, which is cubic or less for each algorithm. The exact-distance computations carried out by these algorithms are feasible for large-scale surfaces containing tens of thousands of vertices, and are a necessary component of near-isometric surface flattening methods that accurately transform curved manifolds into flat representations.