{ "130673-21866504": { "datetime_modified":"20250205T123208", "datetime_start":"20250121T150000", "datetime_end":"20250121T160000", "has_end_time":1, "date_start":"2025-01-21", "date_end":"2025-01-21", "time_start":"15:00:00", "time_end":"16:00:00", "time_zone":"America\/Detroit", "event_title":"Get to Know the Disney College Program", "occurrence_title":"", "combined_title":"Get to Know the Disney College Program", "event_subtitle":"", "event_type":"Careers \/ Jobs", "event_type_id":"2", "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!", "occurrence_notes":null, "guid":"130673-21866504@events.umich.edu", "permalink":"http:\/\/events.umich.edu\/event\/130673", "building_id":"", "building_name":"", "campus_maps_id":"", "room":"", "location_name":"", "has_livestream":0, "cost":"", "tags":[], "website":"", "sponsors":[ { "group_name":"University Career Center UCC", "group_id":"1140", "website":"http:\/\/careercenter.umich.edu" } ], "image_url":"", "styled_images":{ "event_thumb":"", "event_large":"", "event_large_2x":"", "event_large_lightbox":"", "group_thumb":"", "group_thumb_square":"", "group_large":"", "group_large_lightbox":"", "event_large_crop":"", "event_list":"", "event_list_2x":"", "event_grid":"", "event_grid_2x":"", "event_feature_large":"", "event_feature_thumb":"" }, "occurrence_count":1, "first_occurrence":21866504 } , "130459-21866048": { "datetime_modified":"20250110T111442", "datetime_start":"20250121T150000", "datetime_end":"20250121T160000", "has_end_time":1, "date_start":"2025-01-21", "date_end":"2025-01-21", "time_start":"15:00:00", "time_end":"16:00:00", "time_zone":"America\/Detroit", "event_title":"MICDE \/ CSE Seminar \u2013 Andrew Appel, Princeton", "occurrence_title":"", "combined_title":"MICDE \/ CSE Seminar \u2013 Andrew Appel, Princeton: Formally Verified Numerical Methods", "event_subtitle":"Formally Verified Numerical Methods", "event_type":"Workshop \/ Seminar", "event_type_id":"21", "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.\r\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). \r\n\r\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).", "occurrence_notes":"Time and location will be announced soon", "guid":"130459-21866048@events.umich.edu", "permalink":"http:\/\/events.umich.edu\/event\/130459", "building_id":"", "building_name":"", "campus_maps_id":"", "room":"TBA", "location_name":null, "has_livestream":0, "cost":"", "tags":["Computer Science","Electrical Engineering and Computer Science","Micde","Micde Seminar","Michigan Engineering"], "website":"https:\/\/micde.umich.edu\/event\/micde-cse-seminar-andrew-appel-professor-princeton-university\/", "sponsors":[ { "group_name":"Michigan Institute for Computational Discovery and Engineering", "group_id":"3286", "website":"http:\/\/micde.umich.edu" }, { "group_name":"Computer Science and Engineering Division", "group_id":"3197", "website":"http:\/\/cse.umich.edu" } ], "image_url":"https:\/\/events.umich.edu\/media\/attachments\/2025\/01\/event_130459_original-1.png", "styled_images":{ "event_thumb":"https:\/\/events.umich.edu\/media\/cache\/resolve\/event_thumb\/media\/attachments\/2025\/01\/event_130459_original-1.png", "event_large":"https:\/\/events.umich.edu\/media\/cache\/event_large\/media\/attachments\/2025\/01\/event_130459_original-1.png", "event_large_2x":"https:\/\/events.umich.edu\/media\/cache\/resolve\/event_large_2x\/media\/attachments\/2025\/01\/event_130459_original-1.png", "event_large_lightbox":"https:\/\/events.umich.edu\/media\/cache\/event_large_lightbox\/media\/attachments\/2025\/01\/event_130459_original-1.png", "group_thumb":"https:\/\/events.umich.edu\/media\/cache\/resolve\/group_thumb\/media\/attachments\/2025\/01\/event_130459_original-1.png", "group_thumb_square":"https:\/\/events.umich.edu\/media\/cache\/resolve\/group_thumb_square\/media\/attachments\/2025\/01\/event_130459_original-1.png", "group_large":"https:\/\/events.umich.edu\/media\/cache\/resolve\/group_large\/media\/attachments\/2025\/01\/event_130459_original-1.png", "group_large_lightbox":"https:\/\/events.umich.edu\/media\/cache\/resolve\/group_large_lightbox\/media\/attachments\/2025\/01\/event_130459_original-1.png", "event_large_crop":"https:\/\/events.umich.edu\/media\/cache\/resolve\/event_large_crop\/media\/attachments\/2025\/01\/event_130459_original-1.png", "event_list":"https:\/\/events.umich.edu\/media\/cache\/resolve\/event_list\/media\/attachments\/2025\/01\/event_130459_original-1.png", "event_list_2x":"https:\/\/events.umich.edu\/media\/cache\/event_list_2x\/media\/attachments\/2025\/01\/event_130459_original-1.png", "event_grid":"https:\/\/events.umich.edu\/media\/cache\/event_grid\/media\/attachments\/2025\/01\/event_130459_original-1.png", "event_grid_2x":"https:\/\/events.umich.edu\/media\/cache\/resolve\/event_grid_2x\/media\/attachments\/2025\/01\/event_130459_original-1.png", "event_feature_large":"https:\/\/events.umich.edu\/media\/cache\/resolve\/event_feature_large\/media\/attachments\/2025\/01\/event_130459_original-1.png", "event_feature_thumb":"https:\/\/events.umich.edu\/media\/cache\/event_feature_thumb\/media\/attachments\/2025\/01\/event_130459_original-1.png" }, "occurrence_count":1, "first_occurrence":21866048 } , "131431-21868464": { "datetime_modified":"20250120T101110", "datetime_start":"20250121T150000", "datetime_end":"20250121T160000", "has_end_time":1, "date_start":"2025-01-21", "date_end":"2025-01-21", "time_start":"15:00:00", "time_end":"16:00:00", "time_zone":"America\/Detroit", "event_title":"Student Commutative Algebra Seminar: The Generic Initial Ideal", "occurrence_title":"", "combined_title":"Student Commutative Algebra Seminar: The Generic Initial Ideal: Ben Baily", "event_subtitle":"Ben Baily", "event_type":"Workshop \/ Seminar", "event_type_id":"21", "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\u00f6bner 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.\r\n\r\nWe'll start by reviewing the basics of monomial orders and Gr\u00f6bner 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.", "occurrence_notes":null, "guid":"131431-21868464@events.umich.edu", "permalink":"http:\/\/events.umich.edu\/event\/131431", "building_id":"1000166", "building_name":"East Hall", "campus_maps_id":"53", "room":"3088", "location_name":"East Hall", "has_livestream":0, "cost":"", "tags":["Mathematics","seminar"], "website":"", "sponsors":[ { "group_name":"Student Commutative Algebra Seminar - Department of Mathematics", "group_id":"4908", "website":"" }, { "group_name":"Department of Mathematics", "group_id":"3791", "website":"" } ], "image_url":"", "styled_images":{ "event_thumb":"", "event_large":"", "event_large_2x":"", "event_large_lightbox":"", "group_thumb":"", "group_thumb_square":"", "group_large":"", "group_large_lightbox":"", "event_large_crop":"", "event_list":"", "event_list_2x":"", "event_grid":"", "event_grid_2x":"", "event_feature_large":"", "event_feature_thumb":"" }, "occurrence_count":1, "first_occurrence":21868464 } }