Letter to nephew, 01/13/1868

January 13 1868 letter from Daniel A. Whedon to nephew.

Letter to nephew, 12/11/1868

Letter from Daniel Whedon to nephew, Daneil Avery Whedon. Dated December 11 1868.

Letter to nephew, 02/06/1868

Letter from Daniel Whedon to nephew, Daniel Avery Whedon. Dated February, 6, 1868.

An address delivered on the occasion of the funeral of the Rev. William James

Address

Memorial Services on the death of Franklin J. Jilsby

Memorial Sermon.

Addresses on the death of the Hon. T.H.Hicks

Addresses delivered in the Senate and House of Representatives.

Missionary morale by George A Miller, Bishop

Boston University Theology Library

The child in the midst : a comparative study of child welfare in Christian and non-Christian lands / by Mary Schauffler Labaree.

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

GreedyDual* Web Caching Algorithm: Exploiting the Two Sources of Temporal Locality in Web Request Streams

The relative importance of long-term popularity and short-term temporal correlation of references for Web cache replacement policies has not been studied thoroughly. This is partially due to the lack of accurate characterization of temporal locality that enables the identification of the relative strengths of these two sources of temporal locality in a reference stream. In [21], we have proposed such a metric and have shown that Web reference streams differ significantly in the prevalence of these two sources of temporal locality. These finding underscore the importance of a Web caching strategy that can adapt in a dynamic fashion to the prevalence of these two sources of temporal locality. In this paper, we propose a novel cache replacement algorithm, GreedyDual*, which is a generalization of GreedyDual-Size. GreedyDual* uses the metrics proposed in [21] to adjust the relative worth of long-term popularity versus short-term temporal correlation of references. Our trace-driven simulation experiments show the superior performance of GreedyDual* when compared to other Web cache replacement policies proposed in the literature.

Web Mediators for Accessible Browsing

We present a highly accurate method for classifying web pages based on link percentage, which is the percentage of text characters that are parts of links normalized by the number of all text characters on a web page. K-means clustering is used to create unique thresholds to differentiate index pages and article pages on individual web sites. Index pages contain mostly links to articles and other indices, while article pages contain mostly text. We also present a novel link grouping algorithm using agglomerative hierarchical clustering that groups links in the same spatial neighborhood together while preserving link structure. Grouping allows users with severe disabilities to use a scan-based mechanism to tab through a web page and select items. In experiments, we saw up to a 40-fold reduction in the number of commands needed to click on a link with a scan-based interface, which shows that we can vastly improve the rate of communication for users with disabilities. We used web page classification and link grouping to alter web page display on an accessible web browser that we developed to make a usable browsing interface for users with disabilities. Our classification method consistently outperformed a baseline classifier even when using minimal data to generate article and index clusters, and achieved classification accuracy of 94.0% on web sites with well-formed or slightly malformed HTML, compared with 80.1% accuracy for the baseline classifier.