4 resultados para Distance narrative

em Boston University Digital Common


Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This dissertation analyzes the theological and ethical convictions that led the people of the Plateau Vivarais-Lignon to shelter thousands of refugees between 1939 and 1945. It does so by examining the themes of narrative identity, hospitality, character formation, nonviolence, and the contextual witness of church tradition. Though a number of studies have been published about the rescue activity in this region of France during World War II, none have thoroughly analyzed the theological nature of this activity. Using the Plateau Vivarais-Lignon as a case study in theological ethics, the dissertation draws on historical sources as well as the work of contemporary theologians and ethicists to understand, interpret, and analyze the witness of this community. After situating its rescue and resistance work within the Huguenot narrative of persecution and exile, I examine the theological convictions of the Reformed pastor of Le Chambon-sur-Lignon, André Trocmé, who played a key role in making the Plateau a place of refuge during the Holocaust. The study highlights the importance of narrative in the actions of this community and discusses the relationship between narrative, character, and ethics. It then examines the nonviolent commitments of key leaders of the rescue effort, using this analysis as a springboard to engage in broader theological reflection about the ethics of nonviolence. After examining the radical hospitality practiced on the Plateau in light of biblical narratives and Reformed history, I investigate the counter-cultural nature of Christian hospitality. The study concludes by analyzing the nature and witness of the church in light of the legacy of the Plateau Vivarais-Lignon. The dissertation suggests that increased academic and ecclesial attention be given to the relationship between narrative and character, the counter-cultural shape of Christian hospitality, and the active nature of nonviolence. It presents an in-depth analysis of the theological and ethical convictions of the people of the Plateau Vivarais-Lignon, arguing that their witness has ongoing significance for communities of faith as they grapple with how to form disciples, relate to the wider society, welcome strangers, and communicate God's shalom in a world of violence.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study the problem of preprocessing a large graph so that point-to-point shortest-path queries can be answered very fast. Computing shortest paths is a well studied problem, but exact algorithms do not scale to huge graphs encountered on the web, social networks, and other applications. In this paper we focus on approximate methods for distance estimation, in particular using landmark-based distance indexing. This approach involves selecting a subset of nodes as landmarks and computing (offline) the distances from each node in the graph to those landmarks. At runtime, when the distance between a pair of nodes is needed, we can estimate it quickly by combining the precomputed distances of the two nodes to the landmarks. We prove that selecting the optimal set of landmarks is an NP-hard problem, and thus heuristic solutions need to be employed. Given a budget of memory for the index, which translates directly into a budget of landmarks, different landmark selection strategies can yield dramatically different results in terms of accuracy. A number of simple methods that scale well to large graphs are therefore developed and experimentally compared. The simplest methods choose central nodes of the graph, while the more elaborate ones select central nodes that are also far away from one another. The efficiency of the suggested techniques is tested experimentally using five different real world graphs with millions of edges; for a given accuracy, they require as much as 250 times less space than the current approach in the literature which considers selecting landmarks at random. Finally, we study applications of our method in two problems arising naturally in large-scale networks, namely, social search and community detection.