applying geometric thick paths to compute the number of
play

Applying Geometric Thick Paths to Compute the Number of Additional - PowerPoint PPT Presentation

Feb 04, 2023 •12 likes •1.44k views

Applying Geometric Thick Paths to Compute the Number of Additional Train Paths in a Railway Timetable Anders Peterson Valentin Polishchuk Christiane Schmidt Introduction Routing a Maximum Number of Thick Paths through a

  1. • Marshalling yards: completed trains occupy highly demanded space until departure ➡ Depart ahead of schedule? ➡ Should not contribute to congestion—ensure train path to the destination available ➡ Here: what if we want to add several additional trains? ➡ Leave existing (passenger) traffic unaffected ➡ Q: How many can we add? ➡ Residual capacity for additional train paths in a given time window - UIC compression technique for computing capacity utilization: - Compresses the timetable: existing train paths on the considered line section are shifted as close together as possible ➡ Trains no longer considered at the time at which they actually run - Saturation problem: Given: Existing (possibly empty) timetable, a set of saturation trains Goal: Add as many trains as possible - Various train types considered - Solved with heuristics (CAPRES) or MILP (Pellegrini et al., 2017) - We: � 3 17.06.2019 RailNorrköping 2019

  2. • Marshalling yards: completed trains occupy highly demanded space until departure ➡ Depart ahead of schedule? ➡ Should not contribute to congestion—ensure train path to the destination available ➡ Here: what if we want to add several additional trains? ➡ Leave existing (passenger) traffic unaffected ➡ Q: How many can we add? ➡ Residual capacity for additional train paths in a given time window - UIC compression technique for computing capacity utilization: - Compresses the timetable: existing train paths on the considered line section are shifted as close together as possible ➡ Trains no longer considered at the time at which they actually run - Saturation problem: Given: Existing (possibly empty) timetable, a set of saturation trains Goal: Add as many trains as possible - Various train types considered - Solved with heuristics (CAPRES) or MILP (Pellegrini et al., 2017) - We: - Consider a single type (outlook on several types given) � 3 17.06.2019 RailNorrköping 2019

  3. • Marshalling yards: completed trains occupy highly demanded space until departure ➡ Depart ahead of schedule? ➡ Should not contribute to congestion—ensure train path to the destination available ➡ Here: what if we want to add several additional trains? ➡ Leave existing (passenger) traffic unaffected ➡ Q: How many can we add? ➡ Residual capacity for additional train paths in a given time window - UIC compression technique for computing capacity utilization: - Compresses the timetable: existing train paths on the considered line section are shifted as close together as possible ➡ Trains no longer considered at the time at which they actually run - Saturation problem: Given: Existing (possibly empty) timetable, a set of saturation trains Goal: Add as many trains as possible - Various train types considered - Solved with heuristics (CAPRES) or MILP (Pellegrini et al., 2017) - We: - Consider a single type (outlook on several types given) - Aim to disturb passenger traffic as little as possible—trade-off with temporal distance to other trains � 3 17.06.2019 RailNorrköping 2019

  4. • Marshalling yards: completed trains occupy highly demanded space until departure ➡ Depart ahead of schedule? ➡ Should not contribute to congestion—ensure train path to the destination available ➡ Here: what if we want to add several additional trains? ➡ Leave existing (passenger) traffic unaffected ➡ Q: How many can we add? ➡ Residual capacity for additional train paths in a given time window - UIC compression technique for computing capacity utilization: - Compresses the timetable: existing train paths on the considered line section are shifted as close together as possible ➡ Trains no longer considered at the time at which they actually run - Saturation problem: Given: Existing (possibly empty) timetable, a set of saturation trains Goal: Add as many trains as possible - Various train types considered - Solved with heuristics (CAPRES) or MILP (Pellegrini et al., 2017) - We: - Consider a single type (outlook on several types given) - Aim to disturb passenger traffic as little as possible—trade-off with temporal distance to other trains - We present optimal solution � 3 17.06.2019 RailNorrköping 2019

  5. Existing trains Additional trains: need to keep temporal distance � 4 17.06.2019 RailNorrköping 2019

  6. Existing trains Additional trains: need to keep temporal distance ➡ Thick paths instead of lines � 4 17.06.2019 RailNorrköping 2019

  7. Existing trains Additional trains: need to keep temporal distance ➡ Thick paths instead of lines � 4 17.06.2019 RailNorrköping 2019

  8. � 5 17.06.2019 RailNorrköping 2019

  9. • We consider the time-space diagram—the geometric representation � 5 17.06.2019 RailNorrköping 2019

  10. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station � 5 17.06.2019 RailNorrköping 2019

  11. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) � 5 17.06.2019 RailNorrköping 2019

  12. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths � 5 17.06.2019 RailNorrköping 2019

  13. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths • Blown up by temporal distance (can be minimum, or more) � 5 17.06.2019 RailNorrköping 2019

  14. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths • Blown up by temporal distance (can be minimum, or more) • How to route those thick paths? Concepts from Computational Geometry � 5 17.06.2019 RailNorrköping 2019

  15. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths • Blown up by temporal distance (can be minimum, or more) • How to route those thick paths? Concepts from Computational Geometry • Need to make some adaptations, for example, if stations are lines, no path could cross these � 5 17.06.2019 RailNorrköping 2019

  16. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths • Blown up by temporal distance (can be minimum, or more) • How to route those thick paths? Concepts from Computational Geometry • Need to make some adaptations, for example, if stations are lines, no path could cross these ➡ 1. Show how to construct the appropriate polygonal domain � 5 17.06.2019 RailNorrköping 2019

  17. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths • Blown up by temporal distance (can be minimum, or more) • How to route those thick paths? Concepts from Computational Geometry • Need to make some adaptations, for example, if stations are lines, no path could cross these ➡ 1. Show how to construct the appropriate polygonal domain ➡ 2. Show how to route the maximum number of thick non-crossing paths in that domain: � 5 17.06.2019 RailNorrköping 2019

  18. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths • Blown up by temporal distance (can be minimum, or more) • How to route those thick paths? Concepts from Computational Geometry • Need to make some adaptations, for example, if stations are lines, no path could cross these ➡ 1. Show how to construct the appropriate polygonal domain ➡ 2. Show how to route the maximum number of thick non-crossing paths in that domain: • Paths should be x-monotone (we cannot go back in time) � 5 17.06.2019 RailNorrköping 2019

  19. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths • Blown up by temporal distance (can be minimum, or more) • How to route those thick paths? Concepts from Computational Geometry • Need to make some adaptations, for example, if stations are lines, no path could cross these ➡ 1. Show how to construct the appropriate polygonal domain ➡ 2. Show how to route the maximum number of thick non-crossing paths in that domain: • Paths should be x-monotone (we cannot go back in time) • Trains have a maximum speed ⇨ paths have a limited slope � 5 17.06.2019 RailNorrköping 2019

  20. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths • Blown up by temporal distance (can be minimum, or more) • How to route those thick paths? Concepts from Computational Geometry • Need to make some adaptations, for example, if stations are lines, no path could cross these ➡ 1. Show how to construct the appropriate polygonal domain ➡ 2. Show how to route the maximum number of thick non-crossing paths in that domain: • Paths should be x-monotone (we cannot go back in time) • Trains have a maximum speed ⇨ paths have a limited slope We start with 2 � 5 17.06.2019 RailNorrköping 2019

  21. Routing a Maximum Number of Thick Paths through a Polygonal Domain � 6 17.06.2019 RailNorrköping 2019

  22. � 7 17.06.2019 RailNorrköping 2019

  23. Simple polygon P � 7 17.06.2019 RailNorrköping 2019

  24. Simple polygon P Holes � 7 17.06.2019 RailNorrköping 2019

  25. Simple polygon P Polygonal domain Holes � 7 17.06.2019 RailNorrköping 2019

  26. Simple polygon P Polygonal domain Holes Source 𝚫 s � 7 17.06.2019 RailNorrköping 2019

  27. Simple polygon P Polygonal domain Holes Sink 𝚫 t Source 𝚫 s � 7 17.06.2019 RailNorrköping 2019

  28. Simple polygon P Polygonal domain Holes Sink 𝚫 t Source 𝚫 s Bottom � 7 17.06.2019 RailNorrköping 2019

  29. Top Simple polygon P Polygonal domain Holes Sink 𝚫 t Source 𝚫 s Bottom � 7 17.06.2019 RailNorrköping 2019

  30. Top Simple polygon P Polygonal domain Holes Sink 𝚫 t Source 𝚫 s Bottom Route thick paths from the source to the sink, avoiding all holes (=obstacles) � 7 17.06.2019 RailNorrköping 2019

  31. � 8 17.06.2019 RailNorrköping 2019

  32. Thin path π : simple curve � 8 17.06.2019 RailNorrköping 2019

  33. Thin path π : simple curve Let C r denote the open desk of radius r centered at the origin � 8 17.06.2019 RailNorrköping 2019

  34. Thin path π : simple curve Let C r denote the open desk of radius r centered at the origin For S ⊂ R 2 : (S) r =S ⊕ C r = {x+y| x ∈ S, y ∈ C r } - Minkowski sum � 8 17.06.2019 RailNorrköping 2019

  35. Thin path π : simple curve Let C r denote the open desk of radius r centered at the origin For S ⊂ R 2 : (S) r =S ⊕ C r = {x+y| x ∈ S, y ∈ C r } - Minkowski sum Thick path 𝚸 : Minkowski sum of a thin path and a unit disk 𝚸 =( π ) 1 � 8 17.06.2019 RailNorrköping 2019

  36. We want: � 9 17.06.2019 RailNorrköping 2019

  37. We want: • Maximum number of non crossing thick paths from source to sink � 9 17.06.2019 RailNorrköping 2019

  38. We want: • Maximum number of non crossing thick paths from source to sink • Paths should avoid all obstacles � 9 17.06.2019 RailNorrköping 2019

  39. We want: • Maximum number of non crossing thick paths from source to sink • Paths should avoid all obstacles • No path runs outside of polygonal domain � 9 17.06.2019 RailNorrköping 2019

  40. We want: • Maximum number of non crossing thick paths from source to sink • Paths should avoid all obstacles • No path runs outside of polygonal domain • non-crossing: 𝚸 i ⋂ 𝚸 j = ∅ (interiors disjoint, may share boundary) � 9 17.06.2019 RailNorrköping 2019

  41. We want: • Maximum number of non crossing thick paths from source to sink • Paths should avoid all obstacles • No path runs outside of polygonal domain • non-crossing: 𝚸 i ⋂ 𝚸 j = ∅ (interiors disjoint, may share boundary) • Need some more concepts ( Ω perforated at the source and sinks and Riemann flaps glued to Ω , …) � 9 17.06.2019 RailNorrköping 2019

  42. � 10 17.06.2019 RailNorrköping 2019

  43. Algorithm by Arkin et al. (2010) to compute maximum number of thick paths: � 10 17.06.2019 RailNorrköping 2019

  44. Algorithm by Arkin et al. (2010) to compute maximum number of thick paths: • Grass-fire analogy � 10 17.06.2019 RailNorrköping 2019

  45. Algorithm by Arkin et al. (2010) to compute maximum number of thick paths: • Grass-fire analogy • Free space is grass over which fire travels with speed 1 � 10 17.06.2019 RailNorrköping 2019

  46. Algorithm by Arkin et al. (2010) to compute maximum number of thick paths: • Grass-fire analogy • Free space is grass over which fire travels with speed 1 • Holes are highly flammable: once ignited, fire moves through them with infinite speed � 10 17.06.2019 RailNorrköping 2019

  47. Algorithm by Arkin et al. (2010) to compute maximum number of thick paths: • Grass-fire analogy • Free space is grass over which fire travels with speed 1 • Holes are highly flammable: once ignited, fire moves through them with infinite speed • We start setting the bottom on fire. � 10 17.06.2019 RailNorrköping 2019

  48. Algorithm by Arkin et al. (2010) to compute maximum number of thick paths: • Grass-fire analogy • Free space is grass over which fire travels with speed 1 • Holes are highly flammable: once ignited, fire moves through them with infinite speed • We start setting the bottom on fire. • Wavefront at time 𝛖 : boundary of burnt grass by time 𝛖 � 10 17.06.2019 RailNorrköping 2019

  49. Algorithm by Arkin et al. (2010) to compute maximum number of thick paths: • Grass-fire analogy • Free space is grass over which fire travels with speed 1 • Holes are highly flammable: once ignited, fire moves through them with infinite speed • We start setting the bottom on fire. • Wavefront at time 𝛖 : boundary of burnt grass by time 𝛖 • Whenever fire burns 2 time units w/o hitting hole —> we can route a thick path through the burnt grass � 10 17.06.2019 RailNorrköping 2019

  50. Algorithm by Arkin et al. (2010) to compute maximum number of thick paths: • Grass-fire analogy • Free space is grass over which fire travels with speed 1 • Holes are highly flammable: once ignited, fire moves through them with infinite speed • We start setting the bottom on fire. • Wavefront at time 𝛖 : boundary of burnt grass by time 𝛖 • Whenever fire burns 2 time units w/o hitting hole —> we can route a thick path through the burnt grass • Once path has been routed: wavefront is new bottom, and we start over � 10 17.06.2019 RailNorrköping 2019

  51. Algorithm by Arkin et al. (2010) to compute maximum number of thick paths: • Grass-fire analogy • Free space is grass over which fire travels with speed 1 • Holes are highly flammable: once ignited, fire moves through them with infinite speed • We start setting the bottom on fire. • Wavefront at time 𝛖 : boundary of burnt grass by time 𝛖 • Whenever fire burns 2 time units w/o hitting hole —> we can route a thick path through the burnt grass • Once path has been routed: wavefront is new bottom, and we start over • Some additional tweaks when we hit a hole after 𝛖 <2 � 10 17.06.2019 RailNorrköping 2019

  52. � 11 17.06.2019 RailNorrköping 2019

  53. Polishchuk (2007) extended this to x-monotone paths: � 11 17.06.2019 RailNorrköping 2019

  54. Polishchuk (2007) extended this to x-monotone paths: • Need a monotone boundary, if not, add “waterfalls” � 11 17.06.2019 RailNorrköping 2019

  55. Polishchuk (2007) extended this to x-monotone paths: • Need a monotone boundary, if not, add “waterfalls” • Again, let fire burn � 11 17.06.2019 RailNorrköping 2019

  56. Polishchuk (2007) extended this to x-monotone paths: • Need a monotone boundary, if not, add “waterfalls” • Again, let fire burn • If we hit a hole in the process, outer-monotonize holes using waterfalls � 11 17.06.2019 RailNorrköping 2019

  57. Polishchuk (2007) extended this to x-monotone paths: • Need a monotone boundary, if not, add “waterfalls” • Again, let fire burn • If we hit a hole in the process, outer-monotonize holes using waterfalls � 11 17.06.2019 RailNorrköping 2019

  58. Polishchuk (2007) extended this to x-monotone paths: • Need a monotone boundary, if not, add “waterfalls” • Again, let fire burn • If we hit a hole in the process, outer-monotonize holes using waterfalls � 11 17.06.2019 RailNorrköping 2019

  59. Polishchuk (2007) extended this to x-monotone paths: • Need a monotone boundary, if not, add “waterfalls” • Again, let fire burn • If we hit a hole in the process, outer-monotonize holes using waterfalls � 11 17.06.2019 RailNorrköping 2019

  60. Thick Paths with Limited Slope � 12 17.06.2019 RailNorrköping 2019

  61. We want: � 13 17.06.2019 RailNorrköping 2019

  62. We want: • Maximum number of non crossing thick paths from source to sink � 13 17.06.2019 RailNorrköping 2019

  63. We want: • Maximum number of non crossing thick paths from source to sink • Slope should be within a given cone C � 13 17.06.2019 RailNorrköping 2019

  64. We want: • Maximum number of non crossing thick paths from source to sink • Slope should be within a given cone C - X-monotone � 13 17.06.2019 RailNorrköping 2019

  65. We want: • Maximum number of non crossing thick paths from source to sink • Slope should be within a given cone C - X-monotone - Limited speed ⇨ Limited slope � 13 17.06.2019 RailNorrköping 2019

  66. We want: • Maximum number of non crossing thick paths from source to sink • Slope should be within a given cone C - X-monotone - Limited speed ⇨ Limited slope • We showed how to adapt the waterfall construction to compute the maximum number of thick non-crossing paths with a given slope range ( ≙ C-respecting) � 13 17.06.2019 RailNorrköping 2019

  67. We want: • Maximum number of non crossing thick paths from source to sink • Slope should be within a given cone C - X-monotone - Limited speed ⇨ Limited slope • We showed how to adapt the waterfall construction to compute the maximum number of thick non-crossing paths with a given slope range ( ≙ C-respecting) � 13 17.06.2019 RailNorrköping 2019

  68. We want: • Maximum number of non crossing thick paths from source to sink • Slope should be within a given cone C - X-monotone - Limited speed ⇨ Limited slope • We showed how to adapt the waterfall construction to compute the maximum number of thick non-crossing paths with a given slope range ( ≙ C-respecting) � 13 17.06.2019 RailNorrköping 2019

  69. We want: • Maximum number of non crossing thick paths from source to sink • Slope should be within a given cone C - X-monotone - Limited speed ⇨ Limited slope • We showed how to adapt the waterfall construction to compute the maximum number of thick non-crossing paths with a given slope range ( ≙ C-respecting) � 13 17.06.2019 RailNorrköping 2019

  70. We want: • Maximum number of non crossing thick paths from source to sink • Slope should be within a given cone C - X-monotone - Limited speed ⇨ Limited slope • We showed how to adapt the waterfall construction to compute the maximum number of thick non-crossing paths with a given slope range ( ≙ C-respecting) � 13 17.06.2019 RailNorrköping 2019

  71. We want: • Maximum number of non crossing thick paths from source to sink • Slope should be within a given cone C - X-monotone - Limited speed ⇨ Limited slope • We showed how to adapt the waterfall construction to compute the maximum number of thick non-crossing paths with a given slope range ( ≙ C-respecting) � 13 17.06.2019 RailNorrköping 2019

  72. We want: • Maximum number of non crossing thick paths from source to sink • Slope should be within a given cone C - X-monotone - Limited speed ⇨ Limited slope • We showed how to adapt the waterfall construction to compute the maximum number of thick non-crossing paths with a given slope range ( ≙ C-respecting) � 13 17.06.2019 RailNorrköping 2019

  73. We want: • Maximum number of non crossing thick paths from source to sink • Slope should be within a given cone C - X-monotone - Limited speed ⇨ Limited slope • We showed how to adapt the waterfall construction to compute the maximum number of thick non-crossing paths with a given slope range ( ≙ C-respecting) Theorem: A representation of the maximum number of C-respecting thick-non- crossing paths can be found in O(nh+nlogn) time. � 13 17.06.2019 RailNorrköping 2019

  74. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths • Blown up by temporal distance (can be minimum, or more) • How to route those thick paths? Concepts from Computational Geometry • Need to make some adaptations, for example, if stations are lines, no path could cross these ➡ 1. Show how to construct the appropriate polygonal domain ➡ 2. Show how to route the maximum number of thick non-crossing paths in that domain: • Paths should be x-monotone (we cannot go back in time) • Trains have a maximum speed ⇨ paths have a limited slope � 14 17.06.2019 RailNorrköping 2019

  75. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths • Blown up by temporal distance (can be minimum, or more) • How to route those thick paths? Concepts from Computational Geometry • Need to make some adaptations, for example, if stations are lines, no path could cross these ➡ 1. Show how to construct the appropriate polygonal domain ✔ ➡ 2. Show how to route the maximum number of thick non-crossing paths in that domain: • Paths should be x-monotone (we cannot go back in time) • Trains have a maximum speed ⇨ paths have a limited slope � 14 17.06.2019 RailNorrköping 2019

  76. • We consider the time-space diagram—the geometric representation • Inserting a new train: Route path from start to end station • Paths not arbitrarily close ⇨ temporal distance (different to trains running in same or opposite direction) • We think of train paths as “blown-up” line segments = thick paths • Blown up by temporal distance (can be minimum, or more) • How to route those thick paths? Concepts from Computational Geometry • Need to make some adaptations, for example, if stations are lines, no path could cross these ➡ 1. Show how to construct the appropriate polygonal domain ✔ ➡ 2. Show how to route the maximum number of thick non-crossing paths in that domain: • Paths should be x-monotone (we cannot go back in time) • Trains have a maximum speed ⇨ paths have a limited slope Still left to do � 14 17.06.2019 RailNorrköping 2019

  77. Construction of Polygonal Domain from the Timetable � 15 17.06.2019 RailNorrköping 2019

  78. � 16 17.06.2019 RailNorrköping 2019

  79. If we would define the time windows as source and sink � 16 17.06.2019 RailNorrköping 2019

  80. If we would define the time windows as source and sink � 16 17.06.2019 RailNorrköping 2019

  81. If we would define the time windows as source and sink � 16 17.06.2019 RailNorrköping 2019

  82. If we would define the time windows as source and sink ⇨ Possible thick paths would correspond to train paths in a smaller time interval � 16 17.06.2019 RailNorrköping 2019

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

Asset prices with jumps Geometric Brownian motion has continuous paths. Stock prices, and

Asset prices with jumps Geometric Brownian motion has continuous paths. Stock prices, and

Asset prices with jumps Geometric Brownian motion has continuous paths. Stock prices, and prices of other assets, often show jumps caused by unpredictable events or news items. So geometric Brownian motion can only be an approximation

262 views • 13 slides
Geometric Representations 3D Graphics Motivation Geometric representation What do we want

Geometric Representations 3D Graphics Motivation Geometric representation What do we want

Geometric Representations 3D Graphics Motivation Geometric representation What do we want to do? empty space (typically 3 ) B geometric object B 3 Fundamental problem The Problem: d B infinite number of

954 views • 47 slides
Towards double-logarithmic upper bounds on the chromatic number of triangle-free geometric

Towards double-logarithmic upper bounds on the chromatic number of triangle-free geometric

Towards double-logarithmic upper bounds on the chromatic number of triangle-free geometric intersection graphs Bartosz Walczak Jagiellonian University in Krakw Chromatic number vs clique number chromatic number of a given graph

1.47k views • 61 slides
Encasement: A method to compute geometric arrangements Joseph Masterjohn University of Miami

Encasement: A method to compute geometric arrangements Joseph Masterjohn University of Miami

Encasement: A method to compute geometric arrangements Joseph Masterjohn University of Miami Department of Computer Science Sept 30, 2015 Overview Overview What is an Arrangement? Start with a sheet of material. What is an Arrangement?

1.59k views • 155 slides
Progress in Thick GEM- -like like Progress in Thick GEM (THGEM)- -based Detectors based

Progress in Thick GEM- -like like Progress in Thick GEM (THGEM)- -based Detectors based

Progress in Thick GEM- -like like Progress in Thick GEM (THGEM)- -based Detectors based Detectors (THGEM) R. Chechik, A. Breskin, C. Shalem, M. Cortesi &amp; G. Guedes Weizmann institute of science, Rehovot, Israel V. Dangendorf

1.16k views • 25 slides
&quot;Interesting&quot; Paths = Shortest Paths? &quot;Interesting&quot; Paths Shortest Paths!

&quot;Interesting&quot; Paths = Shortest Paths? &quot;Interesting&quot; Paths Shortest Paths!

WiSP : Weighted Shortest Paths for RDF graphs Gonzalo Tartari, Aidan Hogan DCC, Universidad de Chile &quot;Interesting&quot; Paths = Shortest Paths? &quot;Interesting&quot; Paths Shortest Paths! (Many of the) Existing Approaches Enumerate

783 views • 52 slides
UMBC A B M A L T F O U M B C I M Y O R T 1 (10/29/07) I E S R C E O V

UMBC A B M A L T F O U M B C I M Y O R T 1 (10/29/07) I E S R C E O V

VLSI Design Verification and Test Delay Faults II CMPE 646 Path Counting The number of paths can be an exponential function of the # of gates. Parallel multipliers are notorious for having huge numbers of paths. It is possible to efficiently

290 views • 11 slides
Objectives Euclidean Algorithm to compute gcd (Greatest Common Divisor) to compute

Objectives Euclidean Algorithm to compute gcd (Greatest Common Divisor) to compute

More Number Theoretic Results Debdeep Mukhopadhyay Assistant Professor Department of Computer Science and Engineering Indian Institute of Technology Kharagpur INDIA -721302 Objectives Euclidean Algorithm to compute gcd (Greatest

151 views • 14 slides
A Nonconventional CO 2 -EOR Target in the Illinois Basin: Oil Reservoirs of the Thick Cypress

A Nonconventional CO 2 -EOR Target in the Illinois Basin: Oil Reservoirs of the Thick Cypress

A Nonconventional CO 2 -EOR Target in the Illinois Basin: Oil Reservoirs of the Thick Cypress Sandstone Project Number DE-FE0024431 Final Report Nathan Webb Scott Frailey, Nathan Grigsby, Hannes Leetaru February, 2020 Motivation: ROZs

879 views • 64 slides
The origin of thick discs Sbastien Comern seb.comeron@gmail.com The thick disc discovery:

The origin of thick discs Sbastien Comern seb.comeron@gmail.com The thick disc discovery:

The origin of thick discs Sbastien Comern seb.comeron@gmail.com The thick disc discovery: ApJ 234 issue (1979) The fainter parts of the perpendicular profile require the presence of a third NGC 4744 Burstein (1979)

426 views • 19 slides
Path Diversity ! Number of paths for a packet to transit between two points &quot; Inside an

Path Diversity ! Number of paths for a packet to transit between two points &quot; Inside an

In Search for Path Diversity in ISP Networks Renata Teixeira, Keith Marzullo, Stefan Savage, Geoffrey M. Voelker UC San Diego Internet Measurement Conference 2003 Path Diversity ! Number of paths for a packet to transit between two points

160 views • 5 slides
Plan Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales

Plan Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales

Discrete paths as Heyting algebras Discrete paths as categories Discrete paths as quantales Counting idempotents Conclusions Algebra and logic of discrete paths 1 Luigi Santocanale LIS (team LIRICA), Aix-Marseille Universit e, France S

1.31k views • 108 slides
6. Operatoren You understand the structure of a floating point number system You can compute the

6. Operatoren You understand the structure of a floating point number system You can compute the

Educational Objectives You know where you can find a table with all operators in it 6. Operatoren You understand the structure of a floating point number system You can compute the binary representation of a floating Tabular overview of all

742 views • 19 slides
Current Flight Paths Current Flight Paths Current approach and departure paths are all over

Current Flight Paths Current Flight Paths Current approach and departure paths are all over

Current Flight Paths Current Flight Paths Current approach and departure paths are all over water and avoid noise sensitive areas Flight paths are typically based on guidance from ground based navigational aids which result in linear

455 views • 13 slides
Chapter 8 Binomial and Geometric Distribu7ons 8.2 Geometric

Chapter 8 Binomial and Geometric Distribu7ons 8.2 Geometric

12/9/12 Chapter 8 Binomial and Geometric Distribu7ons 8.2 Geometric Distributions Waiting for Sammy Sosa geometric distribution Children s cereals sometimes contain prizes. Imagine that packages of

376 views • 9 slides
All-Pairs Shortest Paths Given: Digraph G=(V,E), where V={1,2,,n} , possibly negative costs

All-Pairs Shortest Paths Given: Digraph G=(V,E), where V={1,2,,n} , possibly negative costs

Lecture 11 Monday, June 12, 2017 11:10 PM All-Pairs Shortest Paths Given: Digraph G=(V,E), where V={1,2,,n} , possibly negative costs c(i,j), BUT no negative cycles! ( c(i,j) = means no edge (i,j) in G ) Compute: D(i,j) = cost of

588 views • 10 slides
COM Interop &amp; P/Invoke .NET and the Old World Objectives Introduction to interoperation

COM Interop &amp; P/Invoke .NET and the Old World Objectives Introduction to interoperation

COM Interop &amp; P/Invoke .NET and the Old World Objectives Introduction to interoperation between .NET and COM COM and .NET .NET and platform services Contents Section 1: Overview Section 2: Calling COM Services from

634 views • 50 slides
Secure Implementations for Typed Session Abstractions Ricardo Corin, Pierre-Malo Denilou,

Secure Implementations for Typed Session Abstractions Ricardo Corin, Pierre-Malo Denilou,

Secure Implementations for Typed Session Abstractions Ricardo Corin, Pierre-Malo Denilou, Cdric Fournet, Karthik Bhargavan, James Leifer INRIA Microsoft Research Joint Centre http://www.msr-inria.inria.fr/projects/sec/sessions/

584 views • 21 slides
Marawacc: A Framework for Heterogeneous Computing in Java Motivation Marawacc-API Runtime Code

Marawacc: A Framework for Heterogeneous Computing in Java Motivation Marawacc-API Runtime Code

Marawacc Marawacc: A Framework for Heterogeneous Computing in Java Motivation Marawacc-API Runtime Code Generation Juan Fumero, Michel Steuwer, Christophe Dubach Runtime Management Results Conclusion The University of Edinburgh UK

405 views • 23 slides
PtrSplit: Supporting General Pointers in Automatic Program Partitioning Shen Liu Gang Tan

PtrSplit: Supporting General Pointers in Automatic Program Partitioning Shen Liu Gang Tan

PtrSplit: Supporting General Pointers in Automatic Program Partitioning Shen Liu Gang Tan Trent Jaeger Computer Science and Engineering Department The Pennsylvania State University 04/18/2018 Motivation for Partitioning Sensitive data A

740 views • 34 slides
Session 2: Mapping Ongoing Evidence Generation Joseph F. Naimoli, OHS/USAID Nicole Bonoff,

Session 2: Mapping Ongoing Evidence Generation Joseph F. Naimoli, OHS/USAID Nicole Bonoff,

Generating Evidence of Governance Contributions to Health Outcomes HFG Workshop July 23, 2014 Abt Associates Inc. In collaboration with: Broad Branch Associates | Development Alternatives Inc. (DAI) | Futures Institute | Johns Hopkins

155 views • 13 slides
Trying Your Juvenile Court Case for Appeal and Beyond. Louis P. Milot, Esq. Attorney at Law

Trying Your Juvenile Court Case for Appeal and Beyond. Louis P. Milot, Esq. Attorney at Law

Trying Your Juvenile Court Case for Appeal and Beyond. Louis P. Milot, Esq. Attorney at Law Prosecuting Your Case Use Tools Available under Code of Civil Procedure Venue Substitution Bill of Particulars Motions to

326 views • 8 slides
RESTful WebServices Florian Motlik Webservices now RPC Style SOAP is complicated HTTP not

RESTful WebServices Florian Motlik Webservices now RPC Style SOAP is complicated HTTP not

RESTful WebServices Florian Motlik Webservices now RPC Style SOAP is complicated HTTP not fully used (only post) HTTP Tools not usable (proxy, cache, Firewall) Another layer needed for inspection of SOAP Great for Starting Action on Server

210 views • 9 slides
D-Bus in the Kernel FOSDEM 2014, Brussels, Belgium January 2014 D-Bus in the Kernel Who? Greg

D-Bus in the Kernel FOSDEM 2014, Brussels, Belgium January 2014 D-Bus in the Kernel Who? Greg

D-Bus in the Kernel FOSDEM 2014, Brussels, Belgium January 2014 D-Bus in the Kernel Who? Greg Kroah-Hartman, Daniel Mack, Lennart Poettering, Kay Sievers with help from Tejun Heo D-Bus in the Kernel Most newer OS designs started around

1.27k views • 111 slides

More recommend