26 resultados para Blackader, John, 1651-1686.


Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective data files. BitTorrent-like swarming protocols are ideal choices for handling such massive data volume transfers. The original BitTorrent targets one-to-many broadcasts of a single file to a very large number of receivers and thus, by necessity, employs an almost random overlay topology. n-way broadcast applications on the other hand, owing to their inherent n-squared nature, are realizable only in small to medium scale networks. In this paper, we show that we can leverage this scale constraint to construct optimized overlay topologies that take into consideration the end-to-end characteristics of the network and as a consequence deliver far superior performance compared to random and myopic (local) approaches. We present the Max-Min and MaxSum peer-selection policies used by individual nodes to select their neighbors. The first one strives to maximize the available bandwidth to the slowest destination, while the second maximizes the aggregate output rate. We design a swarming protocol suitable for n-way broadcast and operate it on top of overlay graphs formed by nodes that employ Max-Min or Max-Sum policies. Using trace-driven simulation and measurements from a PlanetLab prototype implementation, we demonstrate that the performance of swarming on top of our constructed topologies is far superior to the performance of random and myopic overlays. Moreover, we show how to modify our swarming protocol to allow it to accommodate selfish nodes.