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

The life of Father de Smet, S.J. (1801-1873) by E. Laveille, S.J., authorized translation by Marian Lindsay, introduction by Charles Coppens ...

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

A retrospect / by J. Hudson Taylor.

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

Father Pollock and his brother : mission priests of St. Alban's, Birmingham / with a letter from Charles Gore.

http://anglicanhistory.org/bios/pollock/ View document online

An American missionary : a record of the work of Rev. William H. Judge, S.J. / by Charles J. Judge ; introduction by His Eminence, Cardinal Gibbons.

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

California life illustrated / by William Taylor, of the California Conference.

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

The missionary interpretation of history by Richard Taylor Stevenson

Boston University Theology Library

History of Christian missions / by Charles Henry Robinson

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

Additions à la bibliographie de Charles Porset sur les sciences du langage de Port-Royal aux Idéologues (1660-1818)

info:eu-repo/semantics/published

An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times

We consider the problem of scheduling families of jobs in a two-machine open shop so as to minimize the makespan. The jobs of each family can be partitioned into batches and a family setup time on each machine is required before the first job is processed, and when a machine switches from processing a job of some family to a job of another family. For this NP-hard problem the literature contains (5/4)-approximation algorithms that cannot be improved on using the class of group technology algorithms in which each family is kept as a single batch. We demonstrate that there is no advantage in splitting a family more than once. We present an algorithm that splits one family at most once on a machine and delivers a worst-case performance ratio of 6/5.

Qu'est-ce que I'Agropyretum mediterraneum Braun-Blanquet (1931) 1933?

Après une analyse de l'Agropyretum mediterraneum l'auteur montre qu'à la lumière dees conceptions actuelles de la Phytosociologique et sur la base des nombreuses données récemment récoltées sur le litoral méditerranéen, cette association historique correspond en fait à un groupe.