26 resultados para Nash, John
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:
In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes. Our work models neighbor selection as a game involving directed links, constraints on the number of allowed neighbors, and costs reflecting both network latency and node preference. We express a node's "best response" wiring strategy as a k-median problem on asymmetric distance, and use this formulation to obtain pure Nash equilibria. We experimentally examine the properties of such stable wirings on synthetic topologies, as well as on real topologies and maps constructed from PlanetLab and AS-level Internet measurements. Our results indicate that selfish nodes can reap substantial performance benefits when connecting to overlay networks composed of non-selfish nodes. On the other hand, in overlays that are dominated by selfish nodes, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naive wiring strategies.