BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Rachel Kinard
DTSTART:20231005T190000Z
DTEND:20231005T195000Z
DTSTAMP:20260422T174056Z
UID:tandg/9
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/tandg/9/">Sh
 eaves as a Data Structure (Part 2)</a>\nby Rachel Kinard as part of Topolo
 gy and Geometry Seminar (Texas\, Kansas)\n\n\nAbstract\nWe continue our di
 scussion with an example of “Path-Optimization Sheaves” (https://arxiv
 .org/abs/2012.05974)\;\nan alternative approach to classical Dijkstra’s 
 Algorithm\, paths from a source vertex to sink vertex in a graph are revea
 led as Sections of the Path-finding Sheaf.\n\nTables\, Arrays\, and Matric
 es are useful in data storage and manipulation\, employing operations and 
 methods from Numerical Linear Algebra for computer algorithm development.\
 nRecent advances in computer hardware and high performance computing invit
 e us to explore more advanced data structures\,\nsuch as sheaves and the u
 se of sheaf operations for more sophisticated computations.\nAbstractly\, 
 Mathematical Sheaves can be used to track data associated to the open sets
  of a topological space\;\npractically\, sheaves as an advanced data struc
 ture provide a framework for the manipulation and optimization of complex 
 systems of interrelated information.\nDo we ever really get to see a concr
 ete example?\nI will point to several recent examples of (1) the use of sh
 eaves as a tool for data organization\, and (2) the use of sheaves to gain
  additional information about a system.\n\nNotice the nonstandard day (Thu
 rsday) and the nonstandard time slot (2 pm Central Time).\n\nContinuation 
 of the talk given on October 3 (https://researchseminars.org/talk/tandg/8/
 ).\n\nRecording of Part I is available here: https://dmitripavlov.org/2023
 -10-03.mp4\n
LOCATION:https://researchseminars.org/talk/tandg/9/
END:VEVENT
END:VCALENDAR