Establishing an Evacuation Network: A Path Ranking Approach
نویسندگان
چکیده
منابع مشابه
Evacuation Planning: A Spatial Network Database Approach
Efficient tools are needed to identify routes and schedules to evacuate affected populations to safety in face of natural disasters or terrorist attacks. Challenges arise due to violation of key assumptions (e.g. stationary ranking of alternative routes, Wardrop equilibrium) behind popular shortest path algorithms (e.g. Dijkstra’s, A*) and microscopic traffic simulators (e.g. DYNASMART). Time-e...
متن کاملHRank: A Path Based Ranking Method in Heterogeneous Information Network
Recently, there is a surge of interests on heterogeneous information network analysis. Although evaluating the importance of objects has been well studied in homogeneous networks, it is not yet exploited in heterogeneous networks. In this paper, we study the ranking problem in heterogeneous networks and propose the HRank method to evaluate the importance of multiple types of objects and meta pa...
متن کاملHRank: A Path based Ranking Framework in Heterogeneous Information Network
Recently, there is a surge of interests on heterogeneous information network analysis. As a newly emerging network model, heterogeneous information networks have many unique features (e.g., complex structure and rich semantics) and a number of interesting data mining tasks have been exploited in this kind of networks, such as similarity measure, clustering, and classification. Although evaluati...
متن کاملEstablishing an Argument-Based Validity Approach for a Low-Stake Test of Collocational Behavior
Most of the validation studies conducted across varying test application contexts are usually framed within the traditional conceptualization of validity and therefore lack a comprehensive framework to focus on test score interpretations and test score use. This study aimed at developing and validating a collocational behavior test (CBT), drawing on Kane's argument-based approach to validity. F...
متن کاملShortest-Path Indices: Establishing a Methodology for Shortest-Path Problems
During the last years, impressive progress has been achieved in the field of algorithm engineering. A problem becoming more and more important is that of data dependency: the performance of an algorithm often highly depends on the input. Yet, for a given input, it is highly non-trivial to select the best solving strategy. In this work, we introduce a new methodology for evaluating speed-up tech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2019
ISSN: 1549-3636
DOI: 10.3844/jcssp.2019.1710.1720