The crown of Hinduism, by J. N. Farquhar ..

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

A mission in China / by W.E. Soothill.

http://books.google.com/books?vid=OCLC05060511&id=B1cMAAAAIAAJ&a_sbrr=1 via Google Book Index

The parochial mission : a handbook for the use of incumbents and missioners/ by W.J.L. Sheppard ... with a preface by the Lord Bishop of Sodor and Man.

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

Modern religious movements in India.

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

The African slave trade / by Thomas Fowell Buxton.

Digitized by Google

The law and custom of slavery in British India : in a series of letters to Thomas Fowell Buxton, Esq. by William Adam; Thomas Fowell Buxton, Sir

http://books.google.com/books?id=plhkPFrJ1QUC&dq=law+and+custom+of+slavery+in+British+India

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.

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

Memorial volume of the first fifty years of the American Board of Commissioners for Foreign Missions

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

History of Christian missions / by Charles Henry Robinson

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

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.

Inferring Intersection Typings that are Equivalent to Call-by-Name and Call-by-Value Evaluations

We present a procedure to infer a typing for an arbitrary λ-term M in an intersection-type system that translates into exactly the call-by-name (resp., call-by-value) evaluation of M. Our framework is the recently developed System E which augments intersection types with expansion variables. The inferred typing for M is obtained by setting up a unification problem involving both type variables and expansion variables, which we solve with a confluent rewrite system. The inference procedure is compositional in the sense that typings for different program components can be inferred in any order, and without knowledge of the definition of other program components. Using expansion variables lets us achieve a compositional inference procedure easily. Termination of the procedure is generally undecidable. The procedure terminates and returns a typing if the input M is normalizing according to call-by-name (resp., call-by-value). The inferred typing is exact in the sense that the exact call-by-name (resp., call-by-value) behaviour of M can be obtained by a (polynomial) transformation of the typing. The inferred typing is also principal in the sense that any other typing that translates the call-by-name (resp., call-by-value) evaluation of M can be obtained from the inferred typing for M using a substitution-based transformation.