The journal of the Bishop of Montreal : during a visit to the Church Missionary Society's north-west America mission; to which is prefixed, by the secretaries, an introduction, giving an account of the formation of the mission and its progress to August 1848.

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

Christian missions and social progress : a sociological study of foreign missions (vol. 1)

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

The Hawaiian Islands : their progress and condition under missionary labors / by Rufus Anderson.

http://moa.umdl.umich.edu/cgi/sgml/moa-idx?notisid=ALQ8090

The journal of the Bishop of Montreal the Church Missionary Society's North-west America Mission. To which is added, by the secretaries, an appendix, giving an account of the formation of the mission, and its progress to the present time.

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

Human progress through missions / by James L. Barton.

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

Lectures on the Tinnevelly missions, descriptive of the field, the work, and the results : with an introductory lecture on the progress of Christianity in India.

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

Christian missions and social progress : a sociological study of foreign missions (vol. 3)

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

Wonders in the western isles, being a narrative of the commencement and progress of mission work in western Polynesia.

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

Christian missions and social progress : a sociological study of foreign missions (vol. 2)

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

Bible illustrations from the New Hebrides : with notices of the progress of the mission / by John Inglis.

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

A Two-step Statistical Approach for Inferring Network Traffic Demands (Revises Technical Report BUCS-2003-003)

Accurate knowledge of traffic demands in a communication network enables or enhances a variety of traffic engineering and network management tasks of paramount importance for operational networks. Directly measuring a complete set of these demands is prohibitively expensive because of the huge amounts of data that must be collected and the performance impact that such measurements would impose on the regular behavior of the network. As a consequence, we must rely on statistical techniques to produce estimates of actual traffic demands from partial information. The performance of such techniques is however limited due to their reliance on limited information and the high amount of computations they incur, which limits their convergence behavior. In this paper we study a two-step approach for inferring network traffic demands. First we elaborate and evaluate a modeling approach for generating good starting points to be fed to iterative statistical inference techniques. We call these starting points informed priors since they are obtained using actual network information such as packet traces and SNMP link counts. Second we provide a very fast variant of the EM algorithm which extends its computation range, increasing its accuracy and decreasing its dependence on the quality of the starting point. Finally, we evaluate and compare alternative mechanisms for generating starting points and the convergence characteristics of our EM algorithm against a recently proposed Weighted Least Squares approach.

Smooth Multirate Multicast Congestion Control

A significant impediment to deployment of multicast services is the daunting technical complexity of developing, testing and validating congestion control protocols fit for wide-area deployment. Protocols such as pgmcc and TFMCC have recently made considerable progress on the single rate case, i.e. where one dynamic reception rate is maintained for all receivers in the session. However, these protocols have limited applicability, since scaling to session sizes beyond tens of participants necessitates the use of multiple rate protocols. Unfortunately, while existing multiple rate protocols exhibit better scalability, they are both less mature than single rate protocols and suffer from high complexity. We propose a new approach to multiple rate congestion control that leverages proven single rate congestion control methods by orchestrating an ensemble of independently controlled single rate sessions. We describe SMCC, a new multiple rate equation-based congestion control algorithm for layered multicast sessions that employs TFMCC as the primary underlying control mechanism for each layer. SMCC combines the benefits of TFMCC (smooth rate control, equation-based TCP friendliness) with the scalability and flexibility of multiple rates to provide a sound multiple rate multicast congestion control policy.

Camera Canvas: Image Editor for People with Severe Disabilities

Camera Canvas is an image editing software package for users with severe disabilities that limit their mobility. It is specially designed for Camera Mouse, a camera-based mouse-substitute input system. Users can manipulate images through various head movements, tracked by Camera Mouse. The system is also fully usable with traditional mouse or touch-pad input. Designing the system, we studied the requirements and solutions for image editing and content creation using Camera Mouse. Experiments with 20 subjects, each testing Camera Canvas with Camera Mouse as the input mechanism, showed that users found the software easy to understand and operate. User feedback was taken into account to make the software more usable and the interface more intuitive. We suggest that the Camera Canvas software makes important progress in providing a new medium of utility and creativity in computing for users with severe disabilities.

Extending snBench to Support Hierarchical and Configurable Scheduling

It is useful in systems that must support multiple applications with various temporal requirements to allow application-specific policies to manage resources accordingly. However, there is a tension between this goal and the desire to control and police possibly malicious programs. The Java-based Sensor Execution Environment (SXE) in snBench presents a situation where such considerations add value to the system. Multiple applications can be run by multiple users with varied temporal requirements, some Real-Time and others best effort. This paper outlines and documents an implementation of a hierarchical and configurable scheduling system with which different applications can be executed using application-specific scheduling policies. Concurrently the system administrator can define fairness policies between applications that are imposed upon the system. Additionally, to ensure forward progress of system execution in the face of malicious or malformed user programs, an infrastructure for execution using multiple threads is described.