Addresses of Rev. Drs. Park, Post, & Bacon : at the anniversary of the American Congregational Union, May, 1854.

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

History of the Catholic missions among the Indian tribes of the United States, 1529-1854 / by John Gilmary Shea.

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

Missions to the heathen / by L.C. Barnes.

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

Two thousand years of missions before Carey, based upon and embodying many of the earliest extant accounts.

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

Dawn on the hills of T'ang, or, Missions in China / by Harlan P. Beach.

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

The conversion of the Maoris, by Donald MacDougall

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

The life and work of the Rev. E.J. Peck among the Eskimos / by Arthur Lewis.

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

The call of the waters; a study of the frontier, by Katharine R. Crowell ...

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

The Kathayan slave : and other papers connected with missionary life / by Emily Judson.

http://moa.umdl.umich.edu/cgi/sgml/moa-idx?notisid=AAU8319 View book via University of Michigan

Greenland, and other poems / by James Montgomery.

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

Supporting Predicate Routing in DTN over MANET

We consider a Delay Tolerant Network (DTN) whose users (nodes) are connected by an underlying Mobile Ad hoc Network (MANET) substrate. Users can declaratively express high-level policy constraints on how "content" should be routed. For example, content may be diverted through an intermediary DTN node for the purposes of preprocessing, authentication, etc. To support such capability, we implement Predicate Routing [7] where high-level constraints of DTN nodes are mapped into low-level routing predicates at the MANET level. Our testbed uses a Linux system architecture and leverages User Mode Linux [2] to emulate every node running a DTN Reference Implementation code [5]. In our initial prototype, we use the On Demand Distance Vector (AODV) MANET routing protocol. We use the network simulator ns-2 (ns-emulation version) to simulate the mobility and wireless connectivity of both DTN and MANET nodes. We show preliminary throughput results showing the efficient and correct operation of propagating routing predicates, and as a side effect, the performance benefit of content re-routing that dynamically (on-demand) breaks the underlying end-to-end TCP connection into shorter-length TCP connections.

Non-Rigid Shape from Image Streams

We present a framework for estimating 3D relative structure (shape) and motion given objects undergoing nonrigid deformation as observed from a fixed camera, under perspective projection. Deforming surfaces are approximated as piece-wise planar, and piece-wise rigid. Robust registration methods allow tracking of corresponding image patches from view to view and recovery of 3D shape despite occlusions, discontinuities, and varying illumination conditions. Many relatively small planar/rigid image patch trackers are scattered throughout the image; resulting estimates of structure and motion at each patch are combined over local neighborhoods via an oriented particle systems formulation. Preliminary experiments have been conducted on real image sequences of deforming objects and on synthetic sequences where ground truth is known.

An Adaptive Policy Management Approach to BGP Convergence

The Border Gateway Protocol (BGP) is the current inter-domain routing protocol used to exchange reachability information between Autonomous Systems (ASes) in the Internet. BGP supports policy-based routing which allows each AS to independently adopt a set of local policies that specify which routes it accepts and advertises from/to other networks, as well as which route it prefers when more than one route becomes available. However, independently chosen local policies may cause global conflicts, which result in protocol divergence. In this paper, we propose a new algorithm, called Adaptive Policy Management Scheme (APMS), to resolve policy conflicts in a distributed manner. Akin to distributed feedback control systems, each AS independently classifies the state of the network as either conflict-free or potentially-conflicting by observing its local history only (namely, route flaps). Based on the degree of measured conflicts (policy conflict-avoidance vs. -control mode), each AS dynamically adjusts its own path preferences—increasing its preference for observably stable paths over flapping paths. APMS also includes a mechanism to distinguish route flaps due to topology changes, so as not to confuse them with those due to policy conflicts. A correctness and convergence analysis of APMS based on the substability property of chosen paths is presented. Implementation in the SSF network simulator is performed, and simulation results for different performance metrics are presented. The metrics capture the dynamic performance (in terms of instantaneous throughput, delay, routing load, etc.) of APMS and other competing solutions, thus exposing the often neglected aspects of performance.