Alexander Mackay : missionary hero of Uganda.

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

Hindrances to the work of the church in the world : a series of sermons / by the Lord Bishop of Bath and Wells ... [et al.]

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

Missionary life among the cannibals : being the life of the Rev. John Geddie, D.D., first missionary to the New Hebrides : with a history of the Nova Scotia Presbyterian mission on that group / by George Patterson.

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

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

Twenty-five years' mission life on Tanna, New Hebrides / Agnes C. P. Watt ; biographical sketch and introduction by T. Watt Leggatt.

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

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

Constraint-based Mining of Frequent Arrangements of Temporal Intervals

The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed that the database consists of sequences of events, where an event occurs during a time-interval. The goal is to mine temporal arrangements of event intervals that appear frequently in the database. The motivation of this work is the observation that in practice most events are not instantaneous but occur over a period of time and different events may occur concurrently. Thus, there are many practical applications that require mining such temporal correlations between intervals including the linguistic analysis of annotated data from American Sign Language as well as network and biological data. Two efficient methods to find frequent arrangements of temporal intervals are described; the first one is tree-based and uses depth first search to mine the set of frequent arrangements, whereas the second one is prefix-based. The above methods apply efficient pruning techniques that include a set of constraints consisting of regular expressions and gap constraints that add user-controlled focus into the mining process. Moreover, based on the extracted patterns a standard method for mining association rules is employed that applies different interestingness measures to evaluate the significance of the discovered patterns and rules. The performance of the proposed algorithms is evaluated and compared with other approaches on real (American Sign Language annotations and network data) and large synthetic datasets.