The Warsaw Uprising is one of the events key to understanding not only the history of Poland but also Central Europe and World War II. The Uprising shows that the war was not a simple fight of good against evil （as i...The Warsaw Uprising is one of the events key to understanding not only the history of Poland but also Central Europe and World War II. The Uprising shows that the war was not a simple fight of good against evil （as it often perceived in Western Europe） but that in fact three sides, each with different goals, were involved--two totalitarian systems and the world of Western democracies. Memory is a phenomenon that is directly related to the present; our perception of the past is always influenced by the present. The aim of the author＇s presentation is to examine how the collective memory of Polish people about the Warsaw Rising was changing. The author would argue that the remembrance of this event is situated between the communicative memory and cultural memory. To prove it, the author will examine two movies： Sewer （1956） by Andrzej Wajda, Eroica （1956） by Andrzej Munk, and the narrative exhibition of the Warsaw Rising Museum.展开更多
The computation of the all-pairs shortest paths is an important graph algorithmic problem.When the graph changes,such as edge deletions/insertions,recalculating the shortest distance of a graph from scratch is costly....The computation of the all-pairs shortest paths is an important graph algorithmic problem.When the graph changes,such as edge deletions/insertions,recalculating the shortest distance of a graph from scratch is costly.In this paper,we investigate how to quickly maintain the shortest distance of the dynamic graph in the distributed memory system.For a distributed system with p processors,the state-of-art algorithm to recompute the shortest distance of a graph with n vertices from scratch requires O(n^(2)/√p)bandwidth cost and O(√plog^(2)p)latency cost.For the insertion of k edges,we give an incremental algorithm with a bandwidth cost of O(nk√p+k^(2))and a latency cost of O(logp).For typical scenarios where k=O(n/√p),the bandwidth and latency costs are reduced by a factor of O(√p)and O(√plogp),respectively.For the deletion of k edges,we give a decremental algorithm with a bandwidth cost of O(nk/√p+k^(2)+n^(2)/log^(3)p+|S|^(2)logp)and a latency cost of O(log^(3)p),where S is the separator size of a constructed graph and is related to the alteration degree of the shortest path of the dynamic graph.When k=O(n/√p)and S=O(n/√p),the bandwidth and latency costs are reduced by a factor of O(√p∕log^(3)p)and O(√p∕logp),respectively.展开更多
文摘The Warsaw Uprising is one of the events key to understanding not only the history of Poland but also Central Europe and World War II. The Uprising shows that the war was not a simple fight of good against evil （as it often perceived in Western Europe） but that in fact three sides, each with different goals, were involved--two totalitarian systems and the world of Western democracies. Memory is a phenomenon that is directly related to the present; our perception of the past is always influenced by the present. The aim of the author＇s presentation is to examine how the collective memory of Polish people about the Warsaw Rising was changing. The author would argue that the remembrance of this event is situated between the communicative memory and cultural memory. To prove it, the author will examine two movies： Sewer （1956） by Andrzej Wajda, Eroica （1956） by Andrzej Munk, and the narrative exhibition of the Warsaw Rising Museum.
基金supported in part by National Natural Science Foundation of China under Grants 61972447 and 61832006.
文摘The computation of the all-pairs shortest paths is an important graph algorithmic problem.When the graph changes,such as edge deletions/insertions,recalculating the shortest distance of a graph from scratch is costly.In this paper,we investigate how to quickly maintain the shortest distance of the dynamic graph in the distributed memory system.For a distributed system with p processors,the state-of-art algorithm to recompute the shortest distance of a graph with n vertices from scratch requires O(n^(2)/√p)bandwidth cost and O(√plog^(2)p)latency cost.For the insertion of k edges,we give an incremental algorithm with a bandwidth cost of O(nk√p+k^(2))and a latency cost of O(logp).For typical scenarios where k=O(n/√p),the bandwidth and latency costs are reduced by a factor of O(√p)and O(√plogp),respectively.For the deletion of k edges,we give a decremental algorithm with a bandwidth cost of O(nk/√p+k^(2)+n^(2)/log^(3)p+|S|^(2)logp)and a latency cost of O(log^(3)p),where S is the separator size of a constructed graph and is related to the alteration degree of the shortest path of the dynamic graph.When k=O(n/√p)and S=O(n/√p),the bandwidth and latency costs are reduced by a factor of O(√p∕log^(3)p)and O(√p∕logp),respectively.
