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

Diary of David Zeisberger a Moravian missionary among the Indians of Ohio

http://www.archive.org/details/diaryofdavid01zeisrich http://www.archive.org/details/diaryofdavid02zeisrich

Addresses of Rev. Drs. Park, Post, & Bacon : at the anniversary of the American Congregational Union, May, 1854.

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

Samson Occom and the Christian Indians of New England [electronic resource] / by W. DeLoss Love.

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

Lightweight Modeling of Java Virtual Machine Security Constraints using Alloy

The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly in the component known as the Bytecode Verifier. This paper describes a method for representing Java security constraints using the Alloy modeling language. It further describes a system for performing a security analysis on any block of Java bytecodes by converting the bytes into relation initializers in Alloy. Any counterexamples found by the Alloy analyzer correspond directly to insecure code. Analysis of a real-world malicious applet is given to demonstrate the efficacy of the approach.

Utility-Based Decision-Making in Wireless Sensor Networks

We consider challenges associated with application domains in which a large number of distributed, networked sensors must perform a sensing task repeatedly over time. For the tasks we consider, there are three significant challenges to address. First, nodes have resource constraints imposed by their finite power supply, which motivates computations that are energy-conserving. Second, for the applications we describe, the utility derived from a sensing task may vary depending on the placement and size of the set of nodes who participate, which often involves complex objective functions for nodes to target. Finally, nodes must attempt to realize these global objectives with only local information. We present a model for such applications, in which we define appropriate global objectives based on utility functions and specify a cost model for energy consumption. Then, for an important class of utility functions, we present distributed algorithms which attempt to maximize the utility derived from the sensor network over its lifetime. The algorithms and experimental results we present enable nodes to adaptively change their roles over time and use dynamic reconfiguration of routes to load balance energy consumption in the network.