BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Penn Engineering Events - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Penn Engineering Events
X-ORIGINAL-URL:https://seasevents.nmsdev7.com
X-WR-CALDESC:Events for Penn Engineering Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220926T140000
DTEND;TZID=America/New_York:20220926T153000
DTSTAMP:20260405T141117
CREATED:20220919T155445Z
LAST-MODIFIED:20220919T155445Z
UID:7443-1664200800-1664206200@seasevents.nmsdev7.com
SUMMARY:ESE Ph.D. Thesis Defense: "Lattice Theory in Multi-Agent Systems"
DESCRIPTION:Ordered sets model signals such as binary relations\, concepts\, partitions\, rankings\, matchings\, events\, as well as other taxa of information\, temporal\, hierarchical\, relational\, or\, in general\, logical in nature. We argue that (order-) lattice-based (networked) multi-agent systems constitute a broad class of systems in which data fusion\, consensus\, synchronization\, and other collaborative tasks are described with lattices and Galois connections (maps between lattices that preserve structure). Mathematically speaking\, these systems are network sheaves. Motivated by analogous vector diffusion and consensus algorithms\, we initiate a discrete Hodge theory with the Tarski Laplacian\, a diffusion operator—analogous to the graph Laplacian and the graph connection Laplacian—acting on assignments of lattice-valued data to the nodes of a network. The Hodge-Tarski theorem (Main Theorem) relates the fixed point theory of the Tarski Laplacian to the global sections (consistent signals\, equilibria\, if you will) of the sheaf. We present novel applications in signal processing and multi-modal semantics where we design a consensus algorithm on statements such as “I know that she knows that he doesn’t know that I’m defending my thesis.”
URL:https://seasevents.nmsdev7.com/event/ese-ph-d-thesis-defense-lattice-theory-in-multi-agent-systems/
LOCATION:Moore 317\, 200 S 33rd Street\, Philadelphia\, PA\, 19104\, United States
CATEGORIES:Dissertation or Thesis Defense
ORGANIZER;CN="Electrical and Systems Engineering":MAILTO:eseevents@seas.upenn.edu
END:VEVENT
END:VCALENDAR