27 resultados para Quelch, John--approximately 1665-1704
Resumo:
http://www.archive.org/details/johnludwigkrapfe00kretiala
Resumo:
http://www.archive.org/details/fortyyearsamongt00craiuoft
Resumo:
http://www.archive.org/details/historyofcatholi00sheaiala
Resumo:
http://www.archive.org/details/jamesevans00maclrich
Resumo:
http://name.umdl.umich.edu/ABB4262
Resumo:
http://www.archive.org/details/womeninthemissio00telfuoft
Resumo:
http://www.archive.org/details/johnwesleytheman00pikeuoft
Resumo:
http://www.archive.org/details/missionarypionee00stewrich
Resumo:
http://www.archive.org/details/75yearsmadurami00chanuoft
Resumo:
http://www.archive.org/details/bibleillustratio00ingluoft
Resumo:
Throughout the history of the Church, the Epistle to the Hebrews has been one of the most puzzling letters in the Canon, particularly regarding the implications of understanding the person of Jesus Christ. John Chrysostom, an important patristic writer, is acknowledged to have made significant contributions to the exegesis of this letter. Chrysostom's thought became the norm for traditional thinking and interpretation of this letter in the Middle Ages. Martin Luther's reception of Chrysostom's Homilies on Hebrews presents a unique interpretation that some scholars may describe as the "Reformation Discovery" on Hebrews. In tracing Luther's reception and appropriation of Chrysostom's exegesis of the letter to the Hebrews, there is a noticeable and significant shift in Christological interpretation. Whether or not these modifications were necessary is a matter of debate; however, they do reflect Luther's contextual and existential questions regarding faith, Christ and knowledge of God, which is evident in his Lectures on Hebrews.
Resumo:
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.