BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
DTSTART:20250309T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251102T010000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250526T123456Z
UID:0FA742E2-5E8B-43FB-A40E-29FECA852E72
DTSTART;TZID=America/New_York:20250522T160000
DTEND;TZID=America/New_York:20250522T180000
DESCRIPTION:In 1964\, a computer program implementing a highly-efficient al
 gorithm for Fourier analysis was demonstrated at IBM Research. Developed t
 hrough ideas contributed by a Princeton professor to IBM collaborators\, t
 he technique calculated Fourier Transforms at least two orders of magnitud
 e\nfaster than had been demonstrated previously. Named the Fast Fourier Tr
 ansform (FFT)\, its speed enabled numerous practical applications includin
 g computerized tomography\, image and video compression\, and real-time In
 ternet streaming video.\n\nAgenda: \n- Welcome and Introduction\n- Brief H
 istory of IEEE PCJ Section (PCJ Section Chair - Shubha B)\n- IEEE R1 Greet
 ings (R1 Director Bala Prasanna)\n- Remarks from IEEE President and Prince
 ton University\n- IEEE Milestone Nomination (Dr Harold Stone)\n- An invent
 or&#39;s perspective (Dr Richard Garwin)\n- What&#39;s next (Dr Arjuna Madanayake)
 \n- Plaque Unveiling\n- Reception\n\nRoom: 101\, Bldg: Friend Center\, Old
 en Street\, Princeton\, New Jersey\, United States\, 08544
LOCATION:Room: 101\, Bldg: Friend Center\, Olden Street\, Princeton\, New J
 ersey\, United States\, 08544
ORGANIZER:bshubha@ieee.org
SEQUENCE:33
SUMMARY:IEEE PCJS Milestone Dedication Ceremony for the First Demonstration
  of FFT 
URL;VALUE=URI:https://events.vtools.ieee.org/m/483375
X-ALT-DESC:Description: &lt;br /&gt;&lt;p&gt;In 1964\, a computer program implementing 
 a highly-efficient algorithm for Fourier analysis was&amp;nbsp\;demonstrated a
 t IBM Research. Developed through ideas contributed by a Princeton profess
 or to&amp;nbsp\;IBM collaborators\, the technique calculated Fourier Transform
 s at least two orders of magnitude&lt;br&gt;faster than had been demonstrated pr
 eviously. Named the Fast Fourier Transform (FFT)\, its&amp;nbsp\;speed enabled
  numerous practical applications including computerized tomography\, image
  and&amp;nbsp\;video compression\, and real-time Internet streaming video.&lt;/p&gt;
 &lt;br /&gt;&lt;br /&gt;Agenda: &lt;br /&gt;&lt;ol&gt;\n&lt;li&gt;Welcome and Introduction&lt;/li&gt;\n&lt;li&gt;Bri
 ef History of IEEE PCJ Section (PCJ Section Chair - Shubha B)&lt;/li&gt;\n&lt;li&gt;IE
 EE R1 Greetings (R1 Director Bala Prasanna)&lt;/li&gt;\n&lt;li&gt;Remarks from IEEE Pr
 esident and Princeton University&lt;/li&gt;\n&lt;li&gt;IEEE Milestone Nomination (Dr H
 arold Stone)&lt;/li&gt;\n&lt;li&gt;An inventor&#39;s perspective (Dr Richard Garwin)&lt;/li&gt;\
 n&lt;li&gt;What&#39;s next (Dr Arjuna Madanayake)&lt;/li&gt;\n&lt;li&gt;Plaque Unveiling&lt;/li&gt;\n&lt;
 li&gt;Reception&lt;/li&gt;\n&lt;/ol&gt;
END:VEVENT
END:VCALENDAR

