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_a8dbd6a2", true);RegularLabs.EmailProte ctor.unCloak("ep_d5ad13d4");RegularLabs.EmailProtector.unCloak("ep_115ea3f7 ", 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:

____________________________________ ________


IN-PERSON MATHEMATICAL PHYSICS SEMINAR
RUTGERS UNIVERSITY
HILL 705
______ ______________________________________

COFFEE WILL BE AVAILABLE AT 11:50. THER E WILL BE A BROWN BAG LUNCH AFTER THE SEMINAR.

IF YOU HAVE ANY QUESTIO NS PLEASE EMAIL ME AT 

< strong>Michael Saks – Rutgers University

Date/Time/Locatio n
Thursday, October 19th, 12:00pm; Hill Center 705

Synchr onization via small sketches  

Co nsider the situation of two separated computers A and B where computer A st ores 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 thing to do is for A to transmit F to B, so that B can replace G by F. This requires a n amount of communication equal to the size n of F. Is there a way to do th is with less communication?

If we make no assumptions about the relat ionship between G and F then, for information theoretic reasons, there’s no way to reduce the amount of communication. However, it is reasonable to as sume that G is, in some sense, “close” to F. Can this assumption be used to reduce the communication?

To formalize this problem we measure close ness of G to F by the edit distance metric. Here d(G,F) is defined to be th e minimum number of elementary changes to transform G to F where an element ary change is to delete a character, insert a character, or replace one cha racter with another.

DTSTAMP:20260828T094307 DTSTART;TZID=America/New_York:20231019T120000 DTEND;TZID=America/New_York:20231019T130000 SEQUENCE:0 TRANSP:OPAQUE END:VEVENT END:VCALENDAR