A discourse delivered on Thanksgiving Day, Dec. 7, 1837 : in the Unitarian Church, Keene, N.H.

The print copy of this sermon is held by Pitts Theology Library. The Pitts Theology Library's digital copy was produced as part of the ATLA/ATS Cooperative Digital Resources Initiative (CDRI), funded by the Luce Foundation. Electronic reproduction. Atlanta, Georgia : Pitts Theology Library, Emory University, 2003. (Thanksgiving Day Sermons, ATLA Cooperative Digital Resources Initiative, CDRI). Joint CDRI project by: Andover-Harvard Library (Harvard Divinity School), Pitts Theology Library (Emory University), and Princeton Theological Seminary Libraries.

Coming conflicts for liberty : a Thanksgiving sermon, preached November 30th, 1899, at a Union service in the First Baptist Church of Fall River, Mass.

The print copy of this sermon is held by Pitts Theology Library. The Pitts Theology Library's digital copy was produced as part of the ATLA/ATS Cooperative Digital Resources Initiative (CDRI), funded by the Luce Foundation. Reproduction note: Electronic reproduction. Atlanta, Georgia : Pitts Theology Library, Emory University, 2003. (Thanksgiving Day Sermons, ATLA Cooperative Digital Resources Initiative, CDRI). Joint CDRI project by: Andover-Harvard Library (Harvard Divinity School), Pitts Theology Library (Emory University), and Princeton Theological Seminary Libraries.

Jam To-morrow and Jam Yesterday, but Never Jam To-day: The of Theology Libraries Planning the Twenty-first Century

The future of theology libraries is far from clear. Since the nineteenth century, theology libraries have evolved to support the work of theological education. This article briefly reviews the development of theology libraries in North America and examines the contextual changes impacting theology libraries today. Three significant factors that will shape theology libraries in the coming decade are collaborative models of pedagogy and scholarship, globalization and rapid changes in information technology, and changes in the nature of scholarly publishing including the digitization of information. A large body of research is available to assist those responsible for guiding the direction of theology libraries in the next decade, but there are significant gaps in what we know about the impact of technology on how people use information that must be filled in order to provide a solid foundation for planning.

Memoirs and sermons of Wm. J. Armstrong / edited by Hollis Read.

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

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

China's new day; a study of events that have led to its coming, by Isaac Taylor Headland.

$u http://books.google.com/books?vid=OCLC02623863&id=mQz8gPn0et8C&a_sbrr=1 View book via Google

Sermons and lectures on the missions , a collection of sermons, lectures, and sketches on the Catholic missions, ed. by Anton Huonder ... adapted from the German by Cornelius Pekari ...

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

A day of good tidings / C.B. Keenleyside, with introduction by A. Carman.

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

The day-breaking, if not the sun-rising of the Gospell with the Indians in New-England.

University of California Libraries

Meanings of the Sabbath for Worship in the Seventh-Day Adventist Church

This study investigates the meanings and significance of the seventh-day Sabbath for worship in the Seventh-day Adventist Church. In recent years, both the day and concept of Sabbath have attracted ecumenical attention, but the focus of scholarship has been placed on Sunday as the Lord's Day or Sabbath with little consideration given to the seventh-day Sabbath. In contrast, this project examines the seventh-day Sabbath and worship on that day from theological, liturgical, biblical and historical perspectives. Although not intended as an apology for Seventh-day Adventist practices, the work does strive to promote a critical and creative conversation with other theological and liturgical traditions in order to promote mutual, ecumenical understanding. Historical research into the origins and nature of the principal day for weekly Christian worship provides a starting point for discussion on Sabbath. Reconsideration of the relationship between Judaism and early Christianity in recent studies suggests that the influence of Judaism lasted longer than previously supposed, thereby prolonging the developmental process of Sabbath (seventh day) to Sunday. A possible coexistence of Sabbath and Sunday in early Christianity offers an alternative to perspectives that dichotomize Sabbath and Sunday from Christian antiquity onward, and thus for the Seventh-day Adventist Church, suggests biblical and historical validity for their Sabbath worship practice. Recent theological perspectives on Sabbath and Sunday are examined, particularly those of Karl Barth, Jürgen Moltmann and Pope John Paul II. While all three of these theologians stress the continuity of Sabbath and Sunday and speak mainly to a theology of Sunday, they do highlight the significance of Sabbath—which is relevant to an interpretation of seventh-day Sabbath worship. The study concludes that the seventh-day Sabbath is significant for worship in the Seventh-day Adventist Church because it symbolizes the relationship between God and human beings, reminds humanity of the creating and redeeming God who acts in history, and invites persons to rest and fellowship with God on a day sanctified by God.

Fast Approximate Reconciliation of Set Differences

We present new, simple, efficient data structures for approximate reconciliation of set differences, a useful standalone primitive for peer-to-peer networks and a natural subroutine in methods for exact reconciliation. In the approximate reconciliation problem, peers A and B respectively have subsets of elements SA and SB of a large universe U. Peer A wishes to send a short message M to peer B with the goal that B should use M to determine as many elements in the set SB–SA as possible. To avoid the expense of round trip communication times, we focus on the situation where a single message M is sent. We motivate the performance tradeoffs between message size, accuracy and computation time for this problem with a straightforward approach using Bloom filters. We then introduce approximation reconciliation trees, a more computationally efficient solution that combines techniques from Patricia tries, Merkle trees, and Bloom filters. We present an analysis of approximation reconciliation trees and provide experimental results comparing the various methods proposed for approximate reconciliation.

Fast Shortest Path Distance Estimation in Large Networks

We study the problem of preprocessing a large graph so that point-to-point shortest-path queries can be answered very fast. Computing shortest paths is a well studied problem, but exact algorithms do not scale to huge graphs encountered on the web, social networks, and other applications. In this paper we focus on approximate methods for distance estimation, in particular using landmark-based distance indexing. This approach involves selecting a subset of nodes as landmarks and computing (offline) the distances from each node in the graph to those landmarks. At runtime, when the distance between a pair of nodes is needed, we can estimate it quickly by combining the precomputed distances of the two nodes to the landmarks. We prove that selecting the optimal set of landmarks is an NP-hard problem, and thus heuristic solutions need to be employed. Given a budget of memory for the index, which translates directly into a budget of landmarks, different landmark selection strategies can yield dramatically different results in terms of accuracy. A number of simple methods that scale well to large graphs are therefore developed and experimentally compared. The simplest methods choose central nodes of the graph, while the more elaborate ones select central nodes that are also far away from one another. The efficiency of the suggested techniques is tested experimentally using five different real world graphs with millions of edges; for a given accuracy, they require as much as 250 times less space than the current approach in the literature which considers selecting landmarks at random. Finally, we study applications of our method in two problems arising naturally in large-scale networks, namely, social search and community detection.

Fast, Reliable Head Tracking under Varying Illumination

An improved technique for 3D head tracking under varying illumination conditions is proposed. The head is modeled as a texture mapped cylinder. Tracking is formulated as an image registration problem in the cylinder's texture map image. To solve the registration problem in the presence of lighting variation and head motion, the residual error of registration is modeled as a linear combination of texture warping templates and orthogonal illumination templates. Fast and stable on-line tracking is then achieved via regularized, weighted least squares minimization of the registration error. The regularization term tends to limit potential ambiguities that arise in the warping and illumination templates. It enables stable tracking over extended sequences. Tracking does not require a precise initial fit of the model; the system is initialized automatically using a simple 2-D face detector. The only assumption is that the target is facing the camera in the first frame of the sequence. The warping templates are computed at the first frame of the sequence. Illumination templates are precomputed off-line over a training set of face images collected under varying lighting conditions. Experiments in tracking are reported.

Fast, Reliable Head Tracking under Varying Illumination: An Approach Based on Registration of Texture-Mapped 3D Model

An improved technique for 3D head tracking under varying illumination conditions is proposed. The head is modeled as a texture mapped cylinder. Tracking is formulated as an image registration problem in the cylinder's texture map image. The resulting dynamic texture map provides a stabilized view of the face that can be used as input to many existing 2D techniques for face recognition, facial expressions analysis, lip reading, and eye tracking. To solve the registration problem in the presence of lighting variation and head motion, the residual error of registration is modeled as a linear combination of texture warping templates and orthogonal illumination templates. Fast and stable on-line tracking is achieved via regularized, weighted least squares minimization of the registration error. The regularization term tends to limit potential ambiguities that arise in the warping and illumination templates. It enables stable tracking over extended sequences. Tracking does not require a precise initial fit of the model; the system is initialized automatically using a simple 2D face detector. The only assumption is that the target is facing the camera in the first frame of the sequence. The formulation is tailored to take advantage of texture mapping hardware available in many workstations, PC's, and game consoles. The non-optimized implementation runs at about 15 frames per second on a SGI O2 graphic workstation. Extensive experiments evaluating the effectiveness of the formulation are reported. The sensitivity of the technique to illumination, regularization parameters, errors in the initial positioning and internal camera parameters are analyzed. Examples and applications of tracking are reported.

Fast Head Tilt Detection for Human-Computer Interaction

Accurate head tilt detection has a large potential to aid people with disabilities in the use of human-computer interfaces and provide universal access to communication software. We show how it can be utilized to tab through links on a web page or control a video game with head motions. It may also be useful as a correction method for currently available video-based assistive technology that requires upright facial poses. Few of the existing computer vision methods that detect head rotations in and out of the image plane with reasonable accuracy can operate within the context of a real-time communication interface because the computational expense that they incur is too great. Our method uses a variety of metrics to obtain a robust head tilt estimate without incurring the computational cost of previous methods. Our system runs in real time on a computer with a 2.53 GHz processor, 256 MB of RAM and an inexpensive webcam, using only 55% of the processor cycles.