An heroic bishop : the life-story of French of Lahore

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

Theory and practice of foreign missions.

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

The African slave trade / by Thomas Fowell Buxton.

Digitized by Google

Diary of David Zeisberger a Moravian missionary among the Indians of Ohio

http://www.archive.org/details/diaryofdavid01zeisrich http://www.archive.org/details/diaryofdavid02zeisrich

Address to the pious and benevolent, proposing an annual subscription for the support of missionaries in the Highlands and adjacent islands of Scotland, the isles of Jersey, Guernsey, and Newfoundland, the West Indies, and the provinces of Nova Scotia and Quebec.

Reproduction of copy held by Special Collections, Bridewell Library, Perkins School of Theology, Southern Methodist University. Includes both DjVu and PDF files for download. Mode of access: World Wide Web.

Father Pollock and his brother : mission priests of St. Alban's, Birmingham / with a letter from Charles Gore.

http://anglicanhistory.org/bios/pollock/ View document online

John Wesley, the man and his mission

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

The story of the Fuh-Kien mission of the Church missionary society, by Eugene Stock ...

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

The Missionary pioneer, or, A brief memoir of the life, labours, and death of John Stewart, (man of colour) founder, under God of the mission among the Wyandotts at Upper Sandusky, Ohio / Published by Joseph Mitchell.

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

Popularity-Aware GreedyDual-Size Web Proxy Caching Algorithms

Web caching aims to reduce network traffic, server load, and user-perceived retrieval delays by replicating "popular" content on proxy caches that are strategically placed within the network. While key to effective cache utilization, popularity information (e.g. relative access frequencies of objects requested through a proxy) is seldom incorporated directly in cache replacement algorithms. Rather, other properties of the request stream (e.g. temporal locality and content size), which are easier to capture in an on-line fashion, are used to indirectly infer popularity information, and hence drive cache replacement policies. Recent studies suggest that the correlation between these secondary properties and popularity is weakening due in part to the prevalence of efficient client and proxy caches (which tend to mask these correlations). This trend points to the need for proxy cache replacement algorithms that directly capture and use popularity information. In this paper, we (1) present an on-line algorithm that effectively captures and maintains an accurate popularity profile of Web objects requested through a caching proxy, (2) propose a novel cache replacement policy that uses such information to generalize the well-known GreedyDual-Size algorithm, and (3) show the superiority of our proposed algorithm by comparing it to a host of recently-proposed and widely-used algorithms using extensive trace-driven simulations and a variety of performance metrics.

Efficient Nearest Neighbor Classification Using a Cascade of Approximate Similarity Measures

Nearest neighbor classification using shape context can yield highly accurate results in a number of recognition problems. Unfortunately, the approach can be too slow for practical applications, and thus approximation strategies are needed to make shape context practical. This paper proposes a method for efficient and accurate nearest neighbor classification in non-Euclidean spaces, such as the space induced by the shape context measure. First, a method is introduced for constructing a Euclidean embedding that is optimized for nearest neighbor classification accuracy. Using that embedding, multiple approximations of the underlying non-Euclidean similarity measure are obtained, at different levels of accuracy and efficiency. The approximations are automatically combined to form a cascade classifier, which applies the slower approximations only to the hardest cases. Unlike typical cascade-of-classifiers approaches, that are applied to binary classification problems, our method constructs a cascade for a multiclass problem. Experiments with a standard shape data set indicate that a two-to-three order of magnitude speed up is gained over the standard shape context classifier, with minimal losses in classification accuracy.