BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20221106T010000
RDATE:20230312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20231105T010000
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20221018T120000
RDATE:20221106T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20230312T030000
RDATE:20231105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20250309T030000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:c692dff1b35b4f1085c3b5c6eec78de7
CATEGORIES:Mathematical Physics Seminar
CREATED:20231012T143841
SUMMARY:Michael Saks - Synchronization via small sketches 
LOCATION:Hill 705
DESCRIPTION:____________________________________________\n\n IN-PERSON MATHEMATICAL PHY
 SICS SEMINAR\n RUTGERS UNIVERSITY\n HILL 705\n ____________________________
 ________________\nCOFFEE WILL BE AVAILABLE AT 11:50. THERE WILL BE A BROWN 
 BAG LUNCH AFTER THE SEMINAR. \nIF YOU HAVE ANY QUESTIONS PLEASE EMAIL ME AT
   (javascript:/* This email address is being protected from spambots.*/)Reg
 ularLabs.EmailProtector.unCloak("ep_aad1f879", true);RegularLabs.EmailProte
 ctor.unCloak("ep_ecb34174");RegularLabs.EmailProtector.unCloak("ep_001531dc
 ", true);\nMichael Saks – Rutgers University\nDate/Time/Location\n Thursday
 , October 19th, 12:00pm; Hill Center 705\nSynchronization via small sketche
 s  \nConsider the situation of two separated computers A and B where comput
 er A stores a large file F of n bits (where n is, say, one trillion ) and B
  stores a file G. G is supposed to be a copy of F, but over time the files 
 became unsynchronized. We wish to restore synchronization. The obvious thin
 g to do is for A to transmit F to B, so that B can replace G by F. This req
 uires an amount of communication equal to the size n of F. Is there a way t
 o do this with less communication?\nIf we make no assumptions about the rel
 ationship between G and F then, for information theoretic reasons, there’s 
 no way to reduce the amount of communication. However, it is reasonable to 
 assume that G is, in some sense, “close” to F. Can this assumption be used 
 to reduce the communication?\nTo formalize this problem we measure closenes
 s of G to F by the edit distance metric. Here d(G,F) is defined to be the m
 inimum number of elementary changes to transform G to F where an elementary
  change is to delete a character, insert a character, or replace one charac
 ter with another.\n
X-ALT-DESC;FMTTYPE=text/html:<p style="text-align: center;"><strong>____________________________________
 ________</strong></p><p style="text-align: center;"><strong><br> IN-PERSON 
 MATHEMATICAL PHYSICS SEMINAR<br> RUTGERS UNIVERSITY<br> HILL 705<br> ______
 ______________________________________</strong></p><p style="margin-bottom:
  10px; text-align: center;"><strong>COFFEE WILL BE AVAILABLE AT 11:50. THER
 E WILL</strong><strong> BE A BROWN BAG LUNCH AFTER THE SEMINAR. </strong></
 p><p style="text-align: center; background: white;">IF YOU HAVE ANY QUESTIO
 NS PLEASE EMAIL ME AT&nbsp;<!-- This email address is being protected from 
 spambots. --><a href="https://math.rutgers.edu/javascript:/* This email add
 ress is being protected from spambots.*/"><span class="cloaked_email ep_aad
 1f879" style="display:none;"><span data-ep-b="" data-ep-a="&#101;&#104;s4&#
 56;"><span data-ep-b="s.&#101;&#100;&#117;" data-ep-a="&#64;&#99;&#111;&#11
 0;n"><span data-ep-b="&#117;&#116;&#103;e&#114;" data-ep-a="ec&#116;&#46;r"
 ></span></span></span></span></a><script>RegularLabs.EmailProtector.unCloak
 ("ep_aad1f879", true);</script><!-- This email address is being protected f
 rom spambots. --><a href="https://math.rutgers.edu/javascript:/* This email
  address is being protected from spambots.*/"><span class="cloaked_email ep
 _ecb34174"><span data-ep-a="E&#72;S" data-ep-b="&#68;U"><span data-ep-b="S.
 &#69;" data-ep-a="&#52;&#56;&#64;"><span data-ep-b="&#71;E&#82;" data-ep-a=
 "R&#85;&#84;"></span></span></span></span><script>RegularLabs.EmailProtecto
 r.unCloak("ep_ecb34174");</script><span class="cloaked_email ep_001531dc" s
 tyle="display:none;"><span data-ep-b="&#68;U" data-ep-a="&#69;&#72;S"><span
  data-ep-a="&#52;&#56;&#64;" data-ep-b="&#83;&#46;E"><span data-ep-a="&#82;
 U&#84;" data-ep-b="&#71;&#69;R"></span></span></span></span></a><script>Reg
 ularLabs.EmailProtector.unCloak("ep_001531dc", true);</script></p><p style=
 "margin-bottom: 6px; text-align: center; background: #f7f7f7;"><strong>Mich
 ael Saks – Rutgers University</strong></p><p style="margin-bottom: 6px; tex
 t-align: center; background: #f7f7f7;"><strong>Date/Time/Location<br> Thurs
 day, </strong><strong>October 19th, 12:00pm; Hill Center 705</strong></p><p
  style="text-align: center; background: #f7f7f7;"><strong>Synchronization v
 ia small sketches</strong>&nbsp;<strong>&nbsp;</strong></p><p>Consider the 
 situation of two separated computers A and B where computer A stores a larg
 e file F of n bits (where n is, say, one trillion ) and B stores a file G. 
 G is supposed to be a copy of F, but over time the files became unsynchroni
 zed. We wish to restore synchronization. The obvious thing to do is for A t
 o transmit F to B, so that B can replace G by F. This requires an amount of
  communication equal to the size n of F. Is there a way to do this with les
 s communication?</p><p>If we make no assumptions about the relationship bet
 ween G and F then, for information theoretic reasons, there’s no way to red
 uce the amount of communication. However, it is reasonable to assume that G
  is, in some sense, “close” to F. Can this assumption be used to reduce the
  communication?</p><p>To formalize this problem we measure closeness of G t
 o F by the edit distance metric. Here d(G,F) is defined to be the minimum n
 umber of elementary changes to transform G to F where an elementary change 
 is to delete a character, insert a character, or replace one character with
  another.</p>
DTSTAMP:20260829T173954
DTSTART;TZID=America/New_York:20231019T120000
DTEND;TZID=America/New_York:20231019T130000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR