Weekly Seminars
Launched in Spring 2025, the AMSC program’s weekly seminar series is an exciting initiative designed to foster collaboration between faculty and students, showcase research, and encourage student recruitment. Held every Monday at 4:00 PM in MATH 3206 (or virtually via Zoom), the series offers both synchronous and asynchronous presentation options.
Seminar This Week
The first seminar of the Fall 2025 semester will take place in October, with weekly sessions continuing throughout the term. Recordings of the seminars can be accessed by the UMD community here. Stay tuned for updates!
Fall Seminar Schedule
- October 13th No Seminar UMD Fall Break
- October 20th Ricardo Nochetto (Math, IPST)
- October 27th Paul Patrone (NIST)
- November 3rd John Baras (ECE, ISR, CS, ME)
- November 10th Jacob Wenegrat (AOSC)
- November 17th Raghu Raghavan (Business School)
- November 24th No Seminar
- December 1st Ramani Duraiswami (Computer Science)
- December 8th Mike Kreisel (Garoux)
Spring 2025 Seminar Details
Maria Cameron (Math)
Date: Monday, February 24, 2025
Time: 4:15 PM
Place: MATH 3206 (Colloquium Room)
Speaker: Maria Cameron (MATH)
Title: Complex Dynamics of Nonlinear Oscillators and Their Applications
Abstract: Nonlinear oscillators have a broad range of applications in engineering, including rotors, energy harvesters, sensors, and precision timing devices. The dynamics of a single oscillator with cubic nonlinearity and external periodic forcing is surprisingly rich. Depending on parameters, it may admit multiple attractors that may be periodic or chaotic. Their basin boundaries may be fractal. Linking oscillators into arrays and adding noise further complicates their dynamics. I will discuss a method for finding the most probable escape paths from the basins of attractors of noisy oscillators, sensor design, and a few open mathematical problems related to nonlinear oscillators.
Steven Gabriel (Mechanical Engineering)
Date: Monday, March 3, 2025
Time: 4:15 PM
Place: MATH 3206 (Colloquium Room)
Speaker: Steven Gabriel (Mechanical Engineering)
Title: Optimization/Equilibrium Modeling & Algorithm Development for Infrastructure Planning: Focus on Energy, Water and Transport Summary of Research and Teaching
Abstract: Professor Gabriel’s research group develops models, theory, and algorithms for solving problems that arise in infrastructure planning such as: energy, water, transport. These models are typified by a set of autonomous agents (i.e., energy market participants, vehicles) that share a common network. The equilibrium aspects arise since each of the players or subsets of the players compete non-cooperatively with each other for the infrastructure network’s resources. The concatenation of all these optimization problems as well as any system-level constraints results in what is known as an equilibrium problem; typically called a mixed complementarity problem (MCP) or a variation inequality (VI). Such problems generalize the Karush-Kuhn-Tucker (KKT) conditions of nonlinear programs, Nash-Cournot games, as well as many other problems in operations research, engineering and economic systems. These equilibrium problems can also be single-level, wherein all the agents are at the same level or such problems can be multi-level. In the latter case, some famous paradigms include: bilevel optimization (e.g., Stackelberg leader-follower games), attacker-defender interdiction problems and trilevel optimization. Please see Professor Gabriel’s website for further details: http://www.stevenagabriel.umd.edu/ or email him directly at with any questions you might have.
Elana Fertig (School of Medicine)
Date: Monday, March 10, 2025
Time: 4:15 PM
Place: MATH 3206 (Colloquium Room)
Speaker: Elana Fertig (School of Medicine)
Title: Forecasting carcinogenesis
Abstract: This talk presents a hybrid mathematical modeling and bioinformatics strategy to uncover interactions between neoplastic cells and the microenvironment during carcinogenesis and therapeutic response. As pancreatic cancer develops, it forms a complex microenvironment of multiple interacting cells. The microenvironment of advanced cancer includes a dense composition of cells, such as macrophages and fibroblasts, that are associated with immunosuppression. New single-cell and spatial molecular profiling technologies enable unprecedented characterization of the cellular and molecular composition of the microenvironment. These technologies provide the potential to identify candidate therapeutics to intercept immunosuppression. Inventing new mathematical approaches in computational biology are essential to uncover mechanistic insights from high-throughput data for these precision interception strategies. Here, we demonstrate how converging technology development, machine learning, and mathematical modeling can relate the tumor microenvironment to carcinogenesis and therapeutic response. Combining genomics with mathematical modeling provides a forecast system that can yield computational predictions to anticipate when and how the cancer is progressing for therapeutic selection. This mathematical forecast system will empower a new predictive oncology paradigm, which selects therapeutics to intercept the pathways that would otherwise cause future cancer progression.
Haizhao Yang (Mathematics)
Date: Monday, March 31, 2025
Time: 4:15 PM
Place: MATH 3206 (Colloquium Room)
Speaker: Haizhao Yang (Mathematics)
Title: Finite Expression Method: A Symbolic Approach for Scientific Machine Learning
Abstract: Machine learning has revolutionized computational science and engineering with impressive breakthroughs, e.g., making the efficient solution of high-dimensional computational tasks feasible and advancing domain knowledge via scientific data mining. This leads to an emerging field called scientific machine learning. In this talk, we introduce a new method for a symbolic approach to solving scientific machine learning problems. This method seeks interpretable learning outcomes via combinatorial optimization in the space of functions with finitely many analytic expressions and, hence, this methodology is named the finite expression method (FEX). It is proved in approximation theory that FEX can efficiently learn high-dimensional complex functions. As a proof of concept, a deep reinforcement learning method is proposed to implement FEX for learning the solution of high-dimensional PDEs and learning the governing equations of raw data.
Bill Fagan (Biology)
Date: Monday, April 7, 2025
Time: 4:15 PM
Place: MATH 3206 (Colloquium Room)
Speaker: Bill Fagan (Biology)
Title: Finite Expression Method: A Symbolic Approach for Scientific Machine Learning
Abstract: This seminar will provide an overview of how continuous stochastic processes have been applied to the study of animal movement ecology using data from GPS tracking devices. I will present the mathematical foundations of these applications and discuss how we statistically fit the stochastic process models to diverse biological datasets. I will then give an overview of the wide range of applications that my colleagues and I have found for these approaches, including such biological topics as:
1) animal home ranges, migration, and space use
2) behavioral evidence for learning and disease states
3) route-based movement by carnivores
4) consumer-resource interactions
Movement data from GPS tracking devices typically feature a high degree of temporal autocorrelation, often at multiple scales. Over the years, our work has dealt with such data in a variety of statistical contexts, including:
1) timeseries analysis
2) kernel density estimation
3) path estimation via kriging
4) estimation of probability ridges
5) comparative (i.e., phylogenetically controlled) analyses
The talk will present results from joint work with mathematicians Leonid Koralov and Mark Lewis; past-postdocs Christen Fleming, Eliezer Gurarie, and Michael Noonan; past-PhD students Justin Calabrese and Nicole Barbour; current PhD students Frank McBride, Marron McConnell, Gayatri Anand, Stephanie Chia, Qianru Liao, and Phillip Koshute; current undergraduate Zachary Tomares; and hundreds of biologists. Open questions abound and span a wide range of difficulty. I have access to mountains of animal movement data and am eager for collaborators.
Antony Jose (Cell Biology & Molecular Genetics)
Date: Monday, April 14, 2025
Time: 4:15 PM
Place: MATH 3206 (Colloquium Room)
Speaker: Antony Jose (Cell Biology & Molecular Genetics)
Title: Structure of regulatory information in living systems
Abstract: Regulatory architectures can persist despite turnover of the constituent molecules. The recreation of such architectures at the start of each generation drives heredity. We enumerated and analyzed the 26 simplest architectures that form a basic alphabet (A to Z) of motifs capable of indefinitely transmitting heritable information [1]. The topology of these architectures represents information that can ‘mutate’ through epigenetic changes. Here I highlight two recent applications of these insights in the nematode C. elegans. One, the transgenerational dynamics of experimentally observed RNA-mediated epigenetic changes can range from silencing that lasts for >250 generations to recovery from silencing within a few generations and subsequent resistance to silencing [2]. Tuning of positive feedback loops can explain these observations and provide quantitative predictions for generating heritable epigenetic changes of defined durations [1]. Two, the prevalence of homeostasis in living systems suggests that the topologies of regulatory architectures frequently enable compensatory feedback. Consistently, we identified new regulators of RNA silencing by using AlphaFold to predict protein-protein interactions between known regulators of RNA silencing and proteins encoded by frequently perturbed mRNAs [3]. These discoveries underscore the necessity and utility of considering the topological constraints of regulatory architectures that arise from two universal properties of living systems - heredity and homeostasis.
[1] Jose AM (2024) eLife, 12:RP92093.
[2] Devanapally et al. (2021) Nature Communications, 12: 4239.
[3] Lalit F and Jose AM, (2025) Nucleic Acids Research, 53: gkae1246.
Harry Dankowicz (Mechanical Engineering)
Date: Monday, April 21, 2025
Time: 4:15 PM
Place: MATH 3206 (Colloquium Room)
Speaker: Harry Dankowicz (Mechanical Engineering)
Title: Parameter Continuation and Uncertainty Quantification Near Stochastically Perturbed Limit Cycles and Tori
Abstract: This talk shows the use of parameter continuation techniques to characterize intermediate-term dynamics due to the presence of small Brownian noise near normally-hyperbolic, transversally stable periodic orbits and quasiperiodic invariant tori found in the deterministic limit. The proposed formulation relies on adjoint boundary-value problems for constructing continuous families of transversal hyperplanes that are invariant under the linearized deterministic flow, and covariance boundary-value problems for describing Gaussian distributions of intersections of stochastic trajectories with these hyperplanes. Analytical and numerical results, including validation with the help of the continuation package COCO, show excellent agreement with stochastic time integration for problems with either autonomous or time-periodic drift terms.
Alexander Estes (School of Business)
Date: Monday, May 5, 2025
Time: 4:15 PM
Place: MATH 3206 (Colloquium Room)
Speaker: Alexander Estes (School of Business)
Title: Stochastic Integer Programming with Limited Revisions
Abstract: We provide a framework that provides higher predictability in multi-stage integer programming. In this framework, a plan is produced at the start of the problem for the actions that will be taken in all stages of the problem. This plan can be revised in response to revealed uncertainty, but a limit is placed on the number of times that such revisions can be made. We develop integer programming formulations for this restriction. The improvements in predictability provided by this framework may come at the cost of a less optimal primary objective value, but theoretical and computational results indicate that the restriction on the number of revisions often only moderately affects the costs incurred in the optimization problem.