BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250205T123208
DTSTART;TZID=America/Detroit:20250121T150000
DTEND;TZID=America/Detroit:20250121T160000
SUMMARY:Careers / Jobs:Get to Know the Disney College Program
DESCRIPTION:Come join Recruiters with Disney Programs Recruitment Team\, for a virtual engagement session where they will help you learn more about the Disney College Program and discuss the living\, learning and earning components offered. This 60-minute session aims to inform you about the Disney College Program and get you excited to learn more about this opportunity of a lifetime!
UID:130673-21866504@events.umich.edu
URL:https://events.umich.edu/event/130673
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:
LOCATION:
CONTACT:
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20250110T111442
DTSTART;TZID=America/Detroit:20250121T150000
DTEND;TZID=America/Detroit:20250121T160000
SUMMARY:Workshop / Seminar:MICDE / CSE Seminar – Andrew Appel\, Princeton
DESCRIPTION:Abstract: Formal machine-checked program verification uses mechanized logical tools to connect low-level programs to specifications of the algorithms they are supposed to implement.  The same program verification tools can work in many application domains.  But it's not enough just to implement an algorithm\; the program is fully \"correct\" only if the algorithm (provably) computes an answer to the problem or question of interest.  Proofs of algorithm correctness rely on the mathematics of the application domains\, and each domain has its own mathematics.\nIn recent years we have applied this method to numerical methods (algorithms for scientific computing) and numerical analysis (reasoning about the accuracy of those methods)\, with machine-checked proofs formally connected to low-level program-correctness proofs.  I will discuss results in the numerical integration of differential equations and in solving linear systems.  Some of these results are joint work with Ariel Kellison and David Bindel (Cornell)\, Mohit Tekriwal and Jean-Baptiste Jeannin (Michigan). \n\nBio: Andrew Appel is Eugene Higgins Professor Computer Science\, and served from 2009-2015 as Chair of Princeton's CS department.  His research is in software verification\, computer security\, programming languages and compilers\, and technology policy. He received his A.B. summa cum laude in physics from Princeton in 1981\, and his Ph.D. in computer science from Carnegie Mellon University in 1985. Professor Appel has been editor in chief of ACM Transactions on Programming Languages and Systems and is a fellow of the ACM (Association for Computing Machinery). He has worked on fast N-body algorithms (1980s)\, Standard ML of New Jersey (1990s)\, Foundational Proof-Carrying Code (2000s)\, and the Verified Software Toolchain (2010-present).
UID:130459-21866048@events.umich.edu
URL:https://events.umich.edu/event/130459
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Computer Science,Electrical Engineering and Computer Science,Micde,Micde Seminar,Michigan Engineering
LOCATION:
CONTACT:
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20250120T101110
DTSTART;TZID=America/Detroit:20250121T150000
DTEND;TZID=America/Detroit:20250121T160000
SUMMARY:Workshop / Seminar:Student Commutative Algebra Seminar: The Generic Initial Ideal
DESCRIPTION:Given an ideal J in a polynomial ring R = K[x_1\, ...\, x_n]\, the initial ideal of J -- the ideal generated by the leading monomial terms in a Gröbner basis for J -- is a useful combinatorial invariant. If you perform a generic change of coordinates on R before computing the initial ideal of J\, the resulting initial ideal turns out to be especially well-behaved. We call this ideal the generic initial ideal of J. The generic change of variables eliminates the dependence on the original coordinates and yields an initial ideal of minimal complexity.\n\nWe'll start by reviewing the basics of monomial orders and Gröbner bases. Next\, we'll develop the theory of the generic initial ideal\, proving its existence and summarizing basic properties. Lastly\, we'll showcase applications of the generic initial ideal in commutative algebra and algebraic geometry.
UID:131431-21868464@events.umich.edu
URL:https://events.umich.edu/event/131431
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics,seminar
LOCATION:East Hall - 3088
CONTACT:
END:VEVENT
END:VCALENDAR