evolution and evaluation of the penalty method for
play

Evolution and Evaluation of the Penalty Method for Alternative - PowerPoint PPT Presentation

Jun 04, 2023 •351 likes •1.52k views

Evolution and Evaluation of the Penalty Method for Alternative Graphs Moritz Kobitzsch, Marcel Radermacher, and Dennis Schieferdecker {kobitzsch,schieferdecker}@kit.edu, marcel.radermacher@student.kit.edu Institute of Theoretical Informatics -

  1. Related Work what has been done before? (2) "Alternative Route Graphs in Road Networks" [B ADER ET AL . 11] penalty method (classical method) → putting penalties on arc costs → based on Dijkstra (sec.) no alternative route extraction quality measures numeric values hard to gauge do not directly translate to quality of alternative routes 4 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  2. Related Work what has been done before? (2) "Alternative Route Graphs in Road Networks" [B ADER ET AL . 11] penalty method (classical method) → putting penalties on arc costs → based on Dijkstra (sec.) no alternative route extraction quality measures numeric values hard to gauge do not directly translate to quality of alternative routes 4 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  3. Related Work what has been done before? (2) "Alternative Route Graphs in Road Networks" [B ADER ET AL . 11] penalty method (classical method) → putting penalties on arc costs → based on Dijkstra (sec.) no alternative route extraction quality measures numeric values hard to gauge do not directly translate to quality of alternative routes 4 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  4. Related Work what has been done before? (2) "Alternative Route Graphs in Road Networks" [B ADER ET AL . 11] penalty method (classical method) → putting penalties on arc costs → based on Dijkstra (sec.) no alternative route extraction c ( a ) � quality measures := totalDist D H ( s, u ) + c ( a ) + D H ( v, t ) a =( u,v ) ∈ A H numeric values hard to gauge � a ∈ A H c ( a ) averageDist := D ( s, t ) · totalDist do not directly translate to quality of alternative routes maximize totalDist − ( averageDist − 1) s.t.: averageDist ≤ 1 . 1 decisionArcs ≤ 10 4 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  5. Optimization Potential what can we do better? current state-of-the-art fast "one-hop" alternative routes slow alternative graphs goal fast alternatives with diverse structure approach focus on penalty method ⇒ improve for interactive use (speed-up techniques) ⇒ extract alternative routes (quality criteria similar to via-node approach) ⇒ analyze quality & structure of results 5 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  6. Penalty Method generic workflow 1 while { termination condition false} do 2 {compute shortest path} 3 4 {add penalties to graph} 5 6 7 end 8 9 {select shortest paths + combine to alternative graph} 10 11 {extract alternative routes} path selection fast computation penalization (not covered today) alternative route extraction (modified from previous work) (not in previous work) 6 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  7. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  8. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  9. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  10. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  11. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  12. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  13. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  14. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  15. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  16. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  17. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  18. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  19. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  20. Penalty Method path selection basic approach (classical method) perform "enough" iterations ⇒ generate set of shortest paths select good subset for AG (implementation details left open) when query times matter... (our approach) exploit quality measures ⇒ terminate as paths become too long (allow maximum stretch w.r.t. original metric) ⇒ select path for AG after each iteration (w.r.t. stretch, sharing measures) 7 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  21. Penalty Method computing shortest paths (1) challenges compute many shortest paths ⇒ Dijkstra’s algorithm [D IJKSTRA 59] → used by previous work (takes seconds on random queries) ⇒ static speed-up techniques (AF , CH, HL, . . . → costly preprocessing) arc costs change ⇒ Customizable Route Planning (CRP) [D ELLING ET AL . 13] → used by our approach (takes milliseconds on random queries) 8 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  22. Penalty Method computing shortest paths (1) challenges compute many shortest paths ⇒ Dijkstra’s algorithm [D IJKSTRA 59] → used by previous work (takes seconds on random queries) ⇒ static speed-up techniques (AF , CH, HL, . . . → costly preprocessing) arc costs change ⇒ Customizable Route Planning (CRP) [D ELLING ET AL . 13] → used by our approach (takes milliseconds on random queries) ⇒ but still requires some kind of preprocessing 8 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  23. [D ELLING ET AL . 13] 1 Penalty Method [D ELLING &W ERNECK 13] 2 computing shortest paths (2) CRP preprocessing structural preprocessing takes minutes to hours (required once, can be done offline) multi-level partitioning adding shortcut arcs (boundary nodes of each cell become cliques) metric customization compute shortcut costs (required when arc costs change) takes seconds 1 / tenths of a second 2 (using multiple cores and vector units) 9 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  24. [D ELLING ET AL . 13] 1 Penalty Method [D ELLING &W ERNECK 13] 2 computing shortest paths (2) CRP preprocessing structural preprocessing takes minutes to hours (required once, can be done offline) multi-level partitioning adding shortcut arcs (boundary nodes of each cell become cliques) metric customization compute shortcut costs (required when arc costs change) takes seconds 1 / tenths of a second 2 (using multiple cores and vector units) 9 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  25. [D ELLING ET AL . 13] 1 Penalty Method [D ELLING &W ERNECK 13] 2 computing shortest paths (2) CRP preprocessing structural preprocessing takes minutes to hours (required once, can be done offline) multi-level partitioning adding shortcut arcs (boundary nodes of each cell become cliques) metric customization compute shortcut costs (required when arc costs change) takes seconds 1 / tenths of a second 2 (using multiple cores and vector units) 9 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  26. [D ELLING ET AL . 13] 1 Penalty Method [D ELLING &W ERNECK 13] 2 computing shortest paths (2) CRP preprocessing structural preprocessing takes minutes to hours (required once, can be done offline) multi-level partitioning adding shortcut arcs (boundary nodes of each cell become cliques) metric customization compute shortcut costs (required when arc costs change) takes seconds 1 / tenths of a second 2 (using multiple cores and vector units) 9 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  27. [D ELLING ET AL . 13] 1 Penalty Method [D ELLING &W ERNECK 13] 2 computing shortest paths (2) CRP preprocessing structural preprocessing takes minutes to hours (required once, can be done offline) multi-level partitioning adding shortcut arcs (boundary nodes of each cell become cliques) metric customization compute shortcut costs (required when arc costs change) takes seconds 1 / tenths of a second 2 (using multiple cores and vector units) 9 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  28. [D ELLING ET AL . 13] 1 Penalty Method [D ELLING &W ERNECK 13] 2 computing shortest paths (2) CRP preprocessing structural preprocessing takes minutes to hours (required once, can be done offline) multi-level partitioning adding shortcut arcs (boundary nodes of each cell become cliques) metric customization compute shortcut costs (required when arc costs change) takes seconds 1 / tenths of a second 2 (using multiple cores and vector units) 9 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  29. [D ELLING ET AL . 13] 1 Penalty Method [D ELLING &W ERNECK 13] 2 computing shortest paths (2) CRP preprocessing structural preprocessing takes minutes to hours (required once, can be done offline) multi-level partitioning adding shortcut arcs (boundary nodes of each cell become cliques) metric customization compute shortcut costs (required when arc costs change) takes seconds 1 / tenths of a second 2 (using multiple cores and vector units) 9 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  30. Penalty Method computing shortest paths (3) adaptive customization only update cells with changes only update k levels ⇒ restrict query algorithm to k levels ⇒ preprocessing times ⇐ ⇒ query times ⇒ beneficial for short queries (less overhead) dynamic level selection (depending on hop count, optimized on different query set) 10 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  31. Penalty Method computing shortest paths (3) adaptive customization only update cells with changes only update k levels ⇒ restrict query algorithm to k levels ⇒ preprocessing times ⇐ ⇒ query times ⇒ beneficial for short queries (less overhead) dynamic level selection (depending on hop count, optimized on different query set) 10 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  32. Penalty Method computing shortest paths (3) adaptive customization only update cells with changes only update k levels ⇒ restrict query algorithm to k levels ⇒ preprocessing times ⇐ ⇒ query times ⇒ beneficial for short queries (less overhead) dynamic level selection (depending on hop count, optimized on different query set) 10 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  33. Penalty Method computing shortest paths (3) adaptive customization only update cells with changes only update k levels ⇒ restrict query algorithm to k levels ⇒ preprocessing times ⇐ ⇒ query times ⇒ beneficial for short queries (less overhead) dynamic level selection (depending on hop count, optimized on different query set) 10 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  34. Penalty Method computing shortest paths (3) adaptive customization only update cells with changes only update k levels ⇒ restrict query algorithm to k levels ⇒ preprocessing times ⇐ ⇒ query times ⇒ beneficial for short queries (less overhead) dynamic level selection (depending on hop count, optimized on different query set) ⇒ tens of milliseconds for query and customization 10 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  35. Penalty Method alternative route extraction (1) how to extract alternative routes? take constituting routes? ⇒ misses synergy effects take any route? ⇒ arbitrarily bad our approach: CRP- π two-step procedure (via-node & penalty methods) extraction on small graph (expensive methods become feasible) 11 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  36. Penalty Method alternative route extraction (1) how to extract alternative routes? take constituting routes? ⇒ misses synergy effects take any route? ⇒ arbitrarily bad our approach: CRP- π two-step procedure (via-node & penalty methods) extraction on small graph (expensive methods become feasible) 11 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  37. Penalty Method alternative route extraction (1) how to extract alternative routes? take constituting routes? ⇒ misses synergy effects take any route? ⇒ arbitrarily bad our approach: CRP- π two-step procedure (via-node & penalty methods) extraction on small graph (expensive methods become feasible) 11 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  38. Penalty Method alternative route extraction (1) how to extract alternative routes? take constituting routes? ⇒ misses synergy effects take any route? ⇒ arbitrarily bad our approach: CRP- π two-step procedure (via-node & penalty methods) extraction on small graph (expensive methods become feasible) 11 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  39. Penalty Method alternative route extraction (1) how to extract alternative routes? take constituting routes? ⇒ misses synergy effects take any route? ⇒ arbitrarily bad our approach: CRP- π two-step procedure (via-node & penalty methods) extraction on small graph (expensive methods become feasible) 11 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  40. Penalty Method alternative route extraction (1) how to extract alternative routes? take constituting routes? ⇒ misses synergy effects take any route? ⇒ arbitrarily bad our approach: CRP- π two-step procedure (via-node & penalty methods) extraction on small graph (expensive methods become feasible) 11 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  41. Penalty Method alternative route extraction (2) procedure 1. via-node approach based on X-BDV → local optimality disabled (not applicable in AG) exhaustively compute routes keep all routes 2. penalty method based on classical penalty method → initialize with X-BDV routes fixed number of iterations (stretch no good termination criterion) keep good routes (w.r.t. quality measures) 12 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  42. Penalty Method alternative route extraction (2) procedure 1. via-node approach based on X-BDV → local optimality disabled (not applicable in AG) exhaustively compute routes keep all routes 2. penalty method based on classical penalty method → initialize with X-BDV routes fixed number of iterations (stretch no good termination criterion) keep good routes (w.r.t. quality measures) 12 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  43. Penalty Method alternative route extraction (2) procedure 1. via-node approach based on X-BDV → local optimality disabled (not applicable in AG) exhaustively compute routes keep all routes 2. penalty method based on classical penalty method → initialize with X-BDV routes fixed number of iterations (stretch no good termination criterion) keep good routes (w.r.t. quality measures) 12 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  44. Penalty Method alternative route extraction (2) procedure 1. via-node approach based on X-BDV → local optimality disabled (not applicable in AG) exhaustively compute routes keep all routes 2. penalty method based on classical penalty method → initialize with X-BDV routes fixed number of iterations (stretch no good termination criterion) keep good routes (w.r.t. quality measures) 12 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  45. Penalty Method alternative route extraction (2) procedure 1. via-node approach based on X-BDV → local optimality disabled (not applicable in AG) exhaustively compute routes keep all routes 2. penalty method based on classical penalty method → initialize with X-BDV routes fixed number of iterations (stretch no good termination criterion) keep good routes (w.r.t. quality measures) 12 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  46. Penalty Method alternative route extraction (2) procedure 1. via-node approach based on X-BDV → local optimality disabled (not applicable in AG) exhaustively compute routes keep all routes 2. penalty method based on classical penalty method → initialize with X-BDV routes fixed number of iterations (stretch no good termination criterion) keep good routes (w.r.t. quality measures) 12 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  47. Penalty Method alternative route extraction (2) procedure 1. via-node approach based on X-BDV → local optimality disabled (not applicable in AG) exhaustively compute routes keep all routes 2. penalty method based on classical penalty method → initialize with X-BDV routes fixed number of iterations (stretch no good termination criterion) keep good routes (w.r.t. quality measures) 12 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  48. Penalty Method alternative route extraction (2) procedure 1. via-node approach based on X-BDV → local optimality disabled (not applicable in AG) exhaustively compute routes keep all routes 2. penalty method based on classical penalty method → initialize with X-BDV routes fixed number of iterations (stretch no good termination criterion) keep good routes (w.r.t. quality measures) 12 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  49. Experimental Setup hardware/software 4 Intel Xeon E5-4640 @ 2.4 GHz, 512 GiB RAM (32 cores, total) Ubuntu 12.04, gcc 4.6.1 (full optimizations) data road network of Western Europe (provided by PTV AG) directed, weighted graph, single SCC 18 million vertices, 24 million arcs (degree two vertices removed) travel-time metric 1 000 queries at random / data point (of random Dijkstra rank / of fixed Dijkstra rank) 13 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  50. Runtime Analysis iterations of penalty method 20 classical our approach 15 Iterations [#] 10 5 1 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 Dijkstra Rank 14 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  51. Runtime Analysis engineering impact classical 10000 Query Time [ms] 1000 100 10 1 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 Dijkstra Rank 15 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  52. Runtime Analysis engineering impact ● classical ● +new selection & penalties ● 10000 ● ● ● Query Time [ms] 1000 ● ● ● 100 ● ● ● ● 10 ● ● 1 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 Dijkstra Rank 15 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  53. Runtime Analysis engineering impact ● classical ● +new selection & penalties ● 10000 ● +crp ● ● ● ● ● ● Query Time [ms] 1000 ● ● ● ● ● ● ● 100 ● ● ● ● ● ● ● 10 ● ● ● ● ● ● 1 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 Dijkstra Rank 15 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  54. Runtime Analysis engineering impact ● classical ● +new selection & penalties ● 10000 ● +crp ● ● +both ● ● ● ● ● Query Time [ms] ● 1000 ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● 100 ● ● ● ● ● ● ● 10 ● ● ● ● ● ● 1 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 Dijkstra Rank 15 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  55. Runtime Analysis engineering impact ● classical +new selection & penalties ● ● 10000 ● +crp ● ● +both ● +both +adaptive customization = CRP− π ● ● ● ● Query Time [ms] ● 1000 ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● 100 ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● 10 ● ● ● ● ● ● 1 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 Dijkstra Rank 15 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  56. Runtime Analysis engineering impact – multi-cores ● cores 1 2 4 8 12 16 ● ● 10000 ● ● ● ● ● ● ● ● Query Time [ms] ● 1000 ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● 100 ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● ● 10 ● ● ● ● ● ● 1 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 Dijkstra Rank 15 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  57. Quality Analysis alternative graph quality algorithm rating queries decision arcs 3.21 100 ≤ 10.0 [B ADER ET AL . 11] 2.89 1 000 7.0 [R ADERMACHER 12] CRP- π 3.32 1 000 (unfiltered) 17.4 CRP- π 2.89 1 000 (filtered) 9.5 comparable results to previous penalty methods best previous work only considered tiny test set filtering to reduce decision arcs ( ≈ 100 µ s) only for comparison to previous penalty methods reduces potential for extracting multiple alternative routes (not applied in subsequent alternative route analysis) 16 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  58. Quality Analysis alternative route quality # algorithm success [%] stretch [%] sharing [%] optimality [%] 1st X-BDV 96.0 10.0 41.8 75.4 X-CHV 89.6 80.4 40.6 68.1 CRP- π 96.3 42.9 31.9 26.9 2nd X-BDV 87.6 13.8 59.5 65.1 X-CHV 72.5 269.0 57.6 57.2 CRP- π 84.0 47.6 45.9 22.1 3rd X-BDV 75.5 17.2 65.6 54.6 X-CHV 51.4 214.0 63.6 46.8 CRP- π 62.9 67.4 51.8 15.9 comparable success rates (corresponds to runtimes) reasonable path quality measures (lower stretch ⇐ ⇒ higher sharing) limited similarity to via-node alternativs (77.9% | 72.7% | 65.5%) 17 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  59. Quality Analysis alternative route quality # algorithm success [%] stretch [%] sharing [%] optimality [%] 1st X-BDV 96.0 10.0 41.8 75.4 X-CHV 89.6 80.4 40.6 68.1 CRP- π 96.3 42.9 31.9 26.9 2nd X-BDV 87.6 13.8 59.5 65.1 X-CHV 72.5 269.0 57.6 57.2 CRP- π 84.0 47.6 45.9 22.1 3rd X-BDV 75.5 17.2 65.6 54.6 X-CHV 51.4 214.0 63.6 46.8 CRP- π 62.9 67.4 51.8 15.9 comparable success rates (corresponds to runtimes) reasonable path quality measures (lower stretch ⇐ ⇒ higher sharing) limited similarity to via-node alternativs (77.9% | 72.7% | 65.5%) 17 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  60. Quality Analysis alternative route quality # algorithm success [%] stretch [%] sharing [%] optimality [%] 1st X-BDV 96.0 10.0 41.8 75.4 X-CHV 89.6 80.4 40.6 68.1 CRP- π 96.3 42.9 31.9 26.9 2nd X-BDV 87.6 13.8 59.5 65.1 X-CHV 72.5 269.0 57.6 57.2 CRP- π 84.0 47.6 45.9 22.1 3rd X-BDV 75.5 17.2 65.6 54.6 X-CHV 51.4 214.0 63.6 46.8 CRP- π 62.9 67.4 51.8 15.9 comparable success rates (corresponds to runtimes) reasonable path quality measures (lower stretch ⇐ ⇒ higher sharing) limited similarity to via-node alternativs (77.9% | 72.7% | 65.5%) 17 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  61. Quality Analysis alternative route quality # algorithm success [%] stretch [%] sharing [%] optimality [%] 1st X-BDV 96.0 10.0 41.8 75.4 X-CHV 89.6 80.4 40.6 68.1 CRP- π 96.3 42.9 31.9 26.9 2nd X-BDV 87.6 13.8 59.5 65.1 X-CHV 72.5 269.0 57.6 57.2 CRP- π 84.0 47.6 45.9 22.1 3rd X-BDV 75.5 17.2 65.6 54.6 X-CHV 51.4 214.0 63.6 46.8 CRP- π 62.9 67.4 51.8 15.9 comparable success rates (corresponds to runtimes) reasonable path quality measures (lower stretch ⇐ ⇒ higher sharing) limited similarity to via-node alternativs (77.9% | 72.7% | 65.5%) 17 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  62. Conclusion Summary first fast implemenation of penalty method, suited for interactive use (utilizing vector units and multi-core capabilities of modern CPUs) extracted routes of high quality, and distinct from via-node approach (first quantitative analysis of extracted routes from alternative graphs) Open Problems general classification scheme for good alternatives (set of criteria, not tailored to a specific approach) improve runtime to compete with via-node approach (combination with [P ARASKEVOPOULOS &Z AROLIAGIS 13] seems promising) 18 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  63. Thank you for your attention! Time for questions! 19 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  64. References [D IJKSTRA 59] A Note on Two Problems in Connexion with Graphs [A BRAHAM ET AL . 10] Alternative Routes in Road Networks [B ADER ET AL . 11] Alternative Route Graphs in Road Networks [D ELLING ET AL . 13] Customizable Route Planning [D ELLING &W ERNECK 13] Faster Customization of Road Networks [P ARASKEVOPOULOS &Z AROLIAGIS 13] Improved Alternative Route Planning [R ADERMACHER 12] Schnelle Berechnung von Alternativgraphen 20 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  65. Appendix backup slides 21 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  66. Motivation why consider alternative routes? business perspective provide options (users have varied preferences) overcome flaws in model and data (shortest paths need not be best in reality) research perspective building blocks (traffic simulation, stochastic routing) hard optimization problems (quality guarantees) 22 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  67. Motivation why consider alternative routes? business perspective provide options (users have varied preferences) overcome flaws in model and data (shortest paths need not be best in reality) research perspective building blocks (traffic simulation, stochastic routing) hard optimization problems (quality guarantees) 22 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  68. Motivation why consider alternative routes? business perspective provide options (users have varied preferences) overcome flaws in model and data (shortest paths need not be best in reality) research perspective building blocks (traffic simulation, stochastic routing) hard optimization problems (quality guarantees) 22 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  69. Motivation why consider alternative routes? business perspective provide options (users have varied preferences) overcome flaws in model and data (shortest paths need not be best in reality) research perspective building blocks (traffic simulation, stochastic routing) hard optimization problems (quality guarantees) 22 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  70. Related Work peering into the distant past... simple approaches to find distinct routes k -shortest path (meaningful alternatives only for large k ) multi-criteria optimization (distance ⇐ ⇒ difference) time-dependent routes (alternatives not guaranteed, limited data) 23 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  71. Related Work peering into the distant past... simple approaches to find distinct routes k -shortest path (meaningful alternatives only for large k ) multi-criteria optimization (distance ⇐ ⇒ difference) time-dependent routes (alternatives not guaranteed, limited data) 23 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  72. Related Work peering into the distant past... simple approaches to find distinct routes k -shortest path (meaningful alternatives only for large k ) multi-criteria optimization (distance ⇐ ⇒ difference) time-dependent routes (alternatives not guaranteed, limited data) 23 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  73. Related Work peering into the distant past... simple approaches to find distinct routes k -shortest path (meaningful alternatives only for large k ) multi-criteria optimization (distance ⇐ ⇒ difference) time-dependent routes (alternatives not guaranteed, limited data) 23 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  74. Related Work peering into the distant past... simple approaches to find distinct routes k -shortest path (meaningful alternatives only for large k ) multi-criteria optimization (distance ⇐ ⇒ difference) time-dependent routes (alternatives not guaranteed, limited data) 23 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  75. Related Work peering into the distant past... simple approaches to find distinct routes k -shortest path (meaningful alternatives only for large k ) multi-criteria optimization (distance ⇐ ⇒ difference) time-dependent routes (alternatives not guaranteed, limited data) insufficient solutions to the problem 23 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  76. Penalty Method penalization (1) requirements enable discovery of diverse routes ⇒ penalties on arcs of current route (discourage previous routes) ⇒ penalties on adjoined arcs (discourage meandering) quick discovery of diverse routes ⇒ generate lots of new information in each iteration ⇒ speed ⇐ ⇒ quality 24 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  77. Penalty Method penalization (1) requirements enable discovery of diverse routes ⇒ penalties on arcs of current route (discourage previous routes) ⇒ penalties on adjoined arcs (discourage meandering) quick discovery of diverse routes ⇒ generate lots of new information in each iteration ⇒ speed ⇐ ⇒ quality 24 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  78. Penalty Method penalization (1) requirements enable discovery of diverse routes ⇒ penalties on arcs of current route (discourage previous routes) ⇒ penalties on adjoined arcs (discourage meandering) quick discovery of diverse routes ⇒ generate lots of new information in each iteration ⇒ speed ⇐ ⇒ quality 24 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  79. Penalty Method penalization (1) requirements enable discovery of diverse routes ⇒ penalties on arcs of current route (discourage previous routes) ⇒ penalties on adjoined arcs (discourage meandering) quick discovery of diverse routes ⇒ generate lots of new information in each iteration ⇒ speed ⇐ ⇒ quality 24 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  80. Penalty Method penalization (1) requirements enable discovery of diverse routes ⇒ penalties on arcs of current route (discourage previous routes) ⇒ penalties on adjoined arcs (discourage meandering) quick discovery of diverse routes ⇒ generate lots of new information in each iteration ⇒ speed ⇐ ⇒ quality ⇒ how to choose penalty values? 24 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  81. Penalty Method penalization (2) additive penalties (classical method) add fraction of arc/path costs (w.r.t. original metric) ⇒ shortest paths only change slowly geometrically growing penalties (our approach) multiply arc costs on current route by small factor ⇒ often used paths quickly become undesirable add 1 � ( current route cost ) to adjoined arc costs 2 ⇒ discourages short detours on long routes 25 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

  82. Penalty Method penalization (2) additive penalties (classical method) add fraction of arc/path costs (w.r.t. original metric) ⇒ shortest paths only change slowly geometrically growing penalties (our approach) multiply arc costs on current route by small factor ⇒ often used paths quickly become undesirable add 1 � ( current route cost ) to adjoined arc costs 2 ⇒ discourages short detours on long routes 25 Kobitzsch, Radermacher, Schieferdecker: Institute of Theoretical Informatics Evolution and Evaluation of the Penalty Method for Alternative Graphs Algorithmics

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Complexity of a quadratic penalty accelerated inexact proximal point method W. Kong 1 J.G. Melo 2

Complexity of a quadratic penalty accelerated inexact proximal point method W. Kong 1 J.G. Melo 2

The Main Problem Penalty Problem and Approach AIPP Method For Solving the Penalty Subproblem(s) Complexity of the Penalty Complexity of a quadratic penalty accelerated inexact proximal point method W. Kong 1 J.G. Melo 2 R.D.C. Monteiro 1 1

741 views • 46 slides
Penalty Functions for Evaluation Measures of Unsegmented Speech Retrieval Petra Galukov,

Penalty Functions for Evaluation Measures of Unsegmented Speech Retrieval Petra Galukov,

Penalty Functions for Evaluation Measures of Unsegmented Speech Retrieval Petra Galukov, Pavel Pecina, Jan Haji Institute of Formal and Applied Linguistics Charles University in Prague {galuscakova,pecina,hajic}@ufal.mff.cuni.cz

520 views • 20 slides
Heuristic Evaluation (Pinelle) Heuristic evaluation is a method of qualitative evaluation of

Heuristic Evaluation (Pinelle) Heuristic evaluation is a method of qualitative evaluation of

Heuristic Evaluation (Pinelle) Heuristic evaluation is a method of qualitative evaluation of software. 449: A Design Space for Evaluation Open-ended Open-ended Formative Qualitative Methods Usability Breadth of Engineering question

634 views • 25 slides
Penalty under s. 270A and Immunity from penalty under s. 270AA Jagdish T Punjabi May 04, 2019

Penalty under s. 270A and Immunity from penalty under s. 270AA Jagdish T Punjabi May 04, 2019

Penalty under s. 270A and Immunity from penalty under s. 270AA Jagdish T Punjabi May 04, 2019 Ba c kg r ound of intr oduc tion of S. 270A Levy of penalty for concealment of income or furnishing inaccurate particulars of income has always

882 views • 49 slides
THE PENALTY BOX T HE L AW , R EQUIREMENTS A ND D EALING WITH T AXPAYERS THE PENALTY BOX T HE L AW

THE PENALTY BOX T HE L AW , R EQUIREMENTS A ND D EALING WITH T AXPAYERS THE PENALTY BOX T HE L AW

THE PENALTY BOX T HE L AW , R EQUIREMENTS A ND D EALING WITH T AXPAYERS THE PENALTY BOX T HE L AW , R EQUIREMENTS A ND D EALING WITH T AXPAYERS JEFFREY MAD DOG SCHARF & GARY DR. HOOK SABEAN TAXING AUTHORITY CONSULTING SERVICES,

773 views • 62 slides
1 Branch History Table of 1-bit Predictor 1-bit BHT Weakness BHT also Called Branch Example: in

1 Branch History Table of 1-bit Predictor 1-bit BHT Weakness BHT also Called Branch Example: in

Reducing Branch Penalty Branch penalty in dynamically scheduled processors: wasted cycles due to pipeline flushing on mis- predicted branches Lecture 9: Branch Prediction Reduce branch penalty: 1. Basic idea, saturating counter, BHT, Predict

248 views • 3 slides
Hardware evaluation and procurement Hardware: competition, evolution, Evaluation of CPU nodes

Hardware evaluation and procurement Hardware: competition, evolution, Evaluation of CPU nodes

Hardware evaluation and procurement Yannick Perret Hardware evaluation and procurement Hardware: competition, evolution, Evaluation of CPU nodes manufactur- ers. . . for procurement purposes at CC-IN2P3 Hardware: CPU Manufacturers

394 views • 21 slides
* 1 Sequence data Sequence data * 2 Align Sequences Align Sequences 2. The dataset

* 1 Sequence data Sequence data * 2 Align Sequences Align Sequences 2. The dataset

Inferring trees is difficult!!! MODELS OF PROTEIN EVOLUTION: 1. The method problem AN INTRODUCTION TO AMINO ACID EXCHANGE MATRICES A Method 1 Method 1 Dataset 1 Dataset 1 B ? C A Robert Hirt Method 2 Method 2 Department of Zoology,

373 views • 13 slides
ETC/ACM air quality mapping method and its evaluation Jan Horlek (ETC/ACM, CHMI) Nina

ETC/ACM air quality mapping method and its evaluation Jan Horlek (ETC/ACM, CHMI) Nina

ETC/ACM air quality mapping method and its evaluation Jan Horlek (ETC/ACM, CHMI) Nina Beneov (ETC/ACM, CHMI) Peter de Smet (ETC/ACM, RIVM) 1. Mapping methodology 2. Routine evaluation (especially cross-validation) 3. Evaluation using

851 views • 46 slides
7 th World Congress Against the Death Penalty 28 February 2019, Brussels How to Prevent a

7 th World Congress Against the Death Penalty 28 February 2019, Brussels How to Prevent a

7 th World Congress Against the Death Penalty 28 February 2019, Brussels How to Prevent a Resurgence of the Death Penalty What drives countries to reintroduce the death penalty or resume sentences and executions? Panelists will identify

361 views • 4 slides
9 MultiFreedom Constraints II IFEM Ch 9 Slide 1 Introduction to FEM Penalty Function

9 MultiFreedom Constraints II IFEM Ch 9 Slide 1 Introduction to FEM Penalty Function

Introduction to FEM 9 MultiFreedom Constraints II IFEM Ch 9 Slide 1 Introduction to FEM Penalty Function Method Physical Interpretation Recall the example structure u 1 , f 1 u 2 , f 2 u 3 , f 3 u 4 , f 4 u 5 , f 5 u 6 , f 6 u 7 , f 7

476 views • 14 slides
Use Case Evaluation (UCE): A Method for Early Usability Evaluation in Software Development Kasper

Use Case Evaluation (UCE): A Method for Early Usability Evaluation in Software Development Kasper

The USE Project: Usability Evaluation and Software Design: Bridging the Gap University of Copenhagen Aalborg University Use Case Evaluation (UCE): A Method for Early Usability Evaluation in Software Development Kasper Hornbk Department of

359 views • 14 slides
R.I.T S. Ludi/R. Kuehl p. 1 R I T Software Engineering Heuristic Evaluation Another method

R.I.T S. Ludi/R. Kuehl p. 1 R I T Software Engineering Heuristic Evaluation Another method

Design Heuristics and Evaluation Rapid Evaluation R.I.T S. Ludi/R. Kuehl p. 1 R I T Software Engineering Heuristic Evaluation Another method for finding usability problems in a UI design Validation during design - does the proposed

456 views • 20 slides
Evaluation of quality circles Documentary method Evaluation, observation, communication

Evaluation of quality circles Documentary method Evaluation, observation, communication

27/04/2015 Evaluation of quality circles Documentary method Evaluation, observation, communication Evaluation: observation and reflection Here: Observation of communicative epistemic practices in QC by communication

378 views • 8 slides
An Introduction to Realist Evaluation: An Evaluative Method for the WP Context? Greg Brown The

An Introduction to Realist Evaluation: An Evaluative Method for the WP Context? Greg Brown The

An Introduction to Realist Evaluation: An Evaluative Method for the WP Context? Greg Brown The University of Sheffield - WPREU Major Works and Development Basis in Evaluation Theory-Driven Approach (Chen & Rossi 1983; 1990)

804 views • 15 slides
1 Predictor for a Single Branch Branch History Table of 1-bit Predictor BHT also Called Branch

1 Predictor for a Single Branch Branch History Table of 1-bit Predictor BHT also Called Branch

Reducing Branch Penalty Branch penalty in dynamically scheduled processors: wasted cycles due to pipeline flushing on mis- predicted branches Lecture 9: Branch Prediction I Reduce branch penalty: 1. Prediction analysis, 1-bit predictor,

378 views • 3 slides
Adaptation at Scale in Semi- Arid Regions: Presented on behalf of the ASSAR Team by Prof.

Adaptation at Scale in Semi- Arid Regions: Presented on behalf of the ASSAR Team by Prof.

Adaptation at Scale in Semi- Arid Regions: Presented on behalf of the ASSAR Team by Prof. Chris Gordon, Ghana Country Lead Adapt to climate change India and climate Mali variability Ghana Ethiopia Kenya Botswana Namibia Semi-arid

407 views • 13 slides
BNP Paribas Swiftly delivering on adaptation Well positioned for growth Jean-Laurent Bonnaf

BNP Paribas Swiftly delivering on adaptation Well positioned for growth Jean-Laurent Bonnaf

BNP Paribas Swiftly delivering on adaptation Well positioned for growth Jean-Laurent Bonnaf Chief Executive Officer Bank of America / Merrill Lynch Conference, London 26 September 2012 1 Disclaimer Figures included in this presentation

519 views • 41 slides
Unit 3 Unit 3 Market Segmentation, Targeting, and g g g Positioning for Competitive Advantage

Unit 3 Unit 3 Market Segmentation, Targeting, and g g g Positioning for Competitive Advantage

Unit 3 Unit 3 Market Segmentation, Targeting, and g g g Positioning for Competitive Advantage 1 CuuDuongThanCong.com https://fb.com/tailieudientucntt Road Map: Previewing the Road Map: Previewing the Concepts Define the three steps

310 views • 27 slides
2019 valuation update Royal Borough of Kingston-Upon-Thames Pension Fund Peter MacRae FFA 19

2019 valuation update Royal Borough of Kingston-Upon-Thames Pension Fund Peter MacRae FFA 19

2019 valuation update Royal Borough of Kingston-Upon-Thames Pension Fund Peter MacRae FFA 19 December 2019 Hymans Robertson LLP is authorised and regulated by the Financial Conduct Authority What are we going to cover? 1. Introduction to the

776 views • 29 slides
ESCAPE: An Adaptive Framework for Managing and Providing Context Information in Emergency

ESCAPE: An Adaptive Framework for Managing and Providing Context Information in Emergency

ESCAPE: An Adaptive Framework for Managing and Providing Context Information in Emergency Situations Hong-Linh Truong, Lukasz Juszczyk, Atif Manzoor, Schahram Dustdar Distributed Systems Group, Vienna University of Technology

585 views • 21 slides
Recent Progress on Adaptive MPI Sam White & Evan Ramos Charm++ Workshop 2020 Overview

Recent Progress on Adaptive MPI Sam White & Evan Ramos Charm++ Workshop 2020 Overview

Recent Progress on Adaptive MPI Sam White & Evan Ramos Charm++ Workshop 2020 Overview Introduction to AMPI Recent Work Collective Communication Optimizations (Sam) Automatic Global Variable Privatization (Evan) 2

509 views • 33 slides
The Human Side of Rapid School Improvement Presenters: Carlas McCauley, Director Center on School

The Human Side of Rapid School Improvement Presenters: Carlas McCauley, Director Center on School

The Human Side of Rapid School Improvement Presenters: Carlas McCauley, Director Center on School Turnaround at WestEd Joanne Cashman, National Center for Systemic Improvement Kathryn Nichol NH Dept. of Education Cynthia Proulx Director of

437 views • 26 slides
System-in-Package with Nanophotonic Interconnect *Mark Cianchetti, Nicols Sherwood-Droz,

System-in-Package with Nanophotonic Interconnect *Mark Cianchetti, Nicols Sherwood-Droz,

System-in-Package with Nanophotonic Interconnect *Mark Cianchetti, Nicols Sherwood-Droz, *Christopher Batten *Computer Systems Laboratory, Cornell University Cornell Nanophotonics Group Electrical System-in-Package MultiChip Module (MCM)

356 views • 21 slides

More recommend