Indian and white in the Northwest : a history of Catholicity in Montana, 1831-1891 / by L.B. Palladino ; with an introduction by John B. Brondel.

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

Memorial Services in honor of the late John B. Finch

Various memorial addresses.

How far to the nearest doctor? Stories of medical missions around the world, by Edward M. Dodd.

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

Metlakahtla Alaska church manuel [sic].

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

Peasant pioneers; an interpretation of the Slavic peoples in the United States, bx Kenneth D. Miller. Slavic design on cover by B. Mrazek.

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

Ancient peoples at new tasks

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

An Efficient User-Level Shared Memory Mechanism for Application-Specific Extensions

This paper focuses on an efficient user-level method for the deployment of application-specific extensions, using commodity operating systems and hardware. A sandboxing technique is described that supports multiple extensions within a shared virtual address space. Applications can register sandboxed code with the system, so that it may be executed in the context of any process. Such code may be used to implement generic routines and handlers for a class of applications, or system service extensions that complement the functionality of the core kernel. Using our approach, application-specific extensions can be written like conventional user-level code, utilizing libraries and system calls, with the advantage that they may be executed without the traditional costs of scheduling and context-switching between process-level protection domains. No special hardware support such as segmentation or tagged translation look-aside buffers (TLBs) is required. Instead, our ``user-level sandboxing'' mechanism requires only paged-based virtual memory support, given that sandboxed extensions are either written by a trusted source or are guaranteed to be memory-safe (e.g., using type-safe languages). Using a fast method of upcalls, we show how our mechanism provides significant performance improvements over traditional methods of invoking user-level services. As an application of our approach, we have implemented a user-level network subsystem that avoids data copying via the kernel and, in many cases, yields far greater network throughput than kernel-level approaches.

Discovering Frequent Poly-Regions in DNA Sequences

The problem of discovering frequent arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence is studied, and two efficient approaches are proposed to solve it. The first approach is entropy-based and uses an existing recursive segmentation technique to split the input sequence into a set of homogeneous segments. The key idea of the second approach is to use a set of sliding windows over the sequence. Each sliding window keeps a set of statistics of a sequence segment that mainly includes the number of occurrences of each item in that segment. Combining these statistics efficiently yields the complete set of regions of high occurrence of the items of the given alphabet. After identifying these regions, the sequence is converted to a sequence of labeled intervals (each one corresponding to a region). An efficient algorithm for mining frequent arrangements of temporal intervals on a single sequence is applied on the converted sequence to discover frequently occurring arrangements of these regions. The proposed algorithms are tested on various DNA sequences producing results with significant biological meaning.