30 resultados para Dalrymple, John, Sir, 4th bart. Cranstoun, 1726-1810.
Resumo:
http://www.archive.org/details/anorientallandof00freeuoft
Resumo:
http://www.archive.org/details/johninnocent00canduoft
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:
This paper proposes the use of in-network caches (which we call Angels) to reduce the Minimum Distribution Time (MDT) of a file from a seeder – a node that possesses the file – to a set of leechers – nodes who are interested in downloading the file. An Angel is not a leecher in the sense that it is not interested in receiving the entire file, but rather it is interested in minimizing the MDT to all leechers, and as such uses its storage and up/down-link capacity to cache and forward parts of the file to other peers. We extend the analytical results by Kumar and Ross [1] to account for the presence of angels by deriving a new lower bound for the MDT. We show that this newly derived lower bound is tight by proposing a distribution strategy under assumptions of a fluid model. We present a GroupTree heuristic that addresses the impracticalities of the fluid model. We evaluate our designs through simulations that show that our Group-Tree heuristic outperforms other heuristics, that it scales well with the increase of the number of leechers, and that it closely approaches the optimal theoretical bounds.
Resumo:
Current Internet transport protocols make end-to-end measurements and maintain per-connection state to regulate the use of shared network resources. When a number of such connections share a common endpoint, that endpoint has the opportunity to correlate these end-to-end measurements to better diagnose and control the use of shared resources. A valuable characterization of such shared resources is the "loss topology". From the perspective of a server with concurrent connections to multiple clients, the loss topology is a logical tree rooted at the server in which edges represent lossy paths between a pair of internal network nodes. We develop an end-to-end unicast packet probing technique and an associated analytical framework to: (1) infer loss topologies, (2) identify loss rates of links in an existing loss topology, and (3) augment a topology to incorporate the arrival of a new connection. Correct, efficient inference of loss topology information enables new techniques for aggregate congestion control, QoS admission control, connection scheduling and mirror site selection. Our extensive simulation results demonstrate that our approach is robust in terms of its accuracy and convergence over a wide range of network conditions.