BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Events - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Events
X-ORIGINAL-URL:https://events.ucsc.edu
X-WR-CALDESC:Events for Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260602T130000
DTEND;TZID=America/Los_Angeles:20260602T150000
DTSTAMP:20260601T101117
CREATED:20260526T162137Z
LAST-MODIFIED:20260526T162137Z
UID:10014866-1780405200-1780412400@events.ucsc.edu
SUMMARY:Sheaves\, T. (CSE) - Timing Side-Channels in Commercial ReRAM: Toward ReRAM Pentimenti
DESCRIPTION:Recently\, a class of non-invasive hardware side-channel attacks has been discovered in field-programmable gate arrays (FPGAs). These attacks extract remnants of prior users’ activity that persist as transistor defect states within reconfigurable routing resources. These remnants are known as FPGA Pentimenti. Resistive random-access memory (ReRAM) is a compelling candidate for pentimenti-like attacks beyond FPGAs. However\, unlike FPGAs\, where sophisticated on-chip sensors capable of detecting pentimenti have been well-studied\, non-invasive pentimenti recovery in commercial ReRAM must rely on measurements of observable write latency. These measurements are dominated by data-dependent structural biases that obscure any underlying defect-dynamics signal. In this dissertation\, we demonstrate that the structural and stochastic components of commercial ReRAM write latency can be decoupled and recovered through non-invasive timing analysis alone. Our results provide the reverse engineering and measurement infrastructure for future study of ReRAM pentimenti by isolating the component of programming latency sensitive to defect dynamics. \nEvent Host: Tyler Sheaves\, Ph.D. Candidate\, Computer Science & Engineering  \nAdvisor: Dustin Richmond  \nZoom: https://ucsc.zoom.us/j/92729427179?pwd=BpYLqft18YdOU0mDdQWs8erID2VcHi.1 \nPasscode: 939530
URL:https://events.ucsc.edu/event/sheaves-t-cse-timing-side-channels-in-commercial-reram-toward-reram-pentimenti/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option-1.jpg
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260602T134500
DTEND;TZID=America/Los_Angeles:20260602T153000
DTSTAMP:20260601T101117
CREATED:20260529T163203Z
LAST-MODIFIED:20260529T163203Z
UID:10014888-1780407900-1780414200@events.ucsc.edu
SUMMARY:Figuerres\, S. (ECE) - Ion Transport Mechanisms for Bioelectronics
DESCRIPTION:Ion transfer as the movement of charged species across spaces and interfaces is the basis of signaling in nearly all biological systems. My research is grounded in the idea that precise control over ion transfer enables direct manipulation of biological function. Specifically\, I focus on how ion transport can be engineered to regulate both collective behavior in microbial communities\, as well as cellular sensing through ion channels. In comparison to traditional means such as passive diffusion\, mediated ion transfer via ion pumps and ion channels creates opportunity for high precision control of biological signaling. My work centers on ion transfer as a fundamental mechanism for biological signaling and control across systems. Using bioelectronic ion pumps and mechanosensitive ion channels to precisely manipulate the movement of charged species\, I aim to investigate ion transfer at the interface of biology and electronics. \nEvent Host: Sydnie Figuerres\, Ph.D. Student\, Electrical & Computer Engineering  \nAdvisor: Marco Rolandi
URL:https://events.ucsc.edu/event/figuerres-s-ece-ion-transport-mechanisms-for-bioelectronics/
LOCATION:Jack Baskin Engineering\, Baskin Engineering 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option2.jpg
GEO:37.000369;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Jack Baskin Engineering Baskin Engineering 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Baskin Engineering 1156 High Street:geo:-122.0632371,37.000369
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260602T140000
DTEND;TZID=America/Los_Angeles:20260602T160000
DTSTAMP:20260601T101117
CREATED:20260527T204156Z
LAST-MODIFIED:20260527T204156Z
UID:10014880-1780408800-1780416000@events.ucsc.edu
SUMMARY:Bose\, S. (ECE) - Learning-Augmented Optimization\, Control\, and Inference in Modern Power Systems
DESCRIPTION:The electric grid is essential to modern society\, and recent developments such as renewable energy sources (RESs)\, battery energy storage systems (ESSs)\, and microgrids (MGs) have necessitated novel computational methods for planning and operations. Machine learning offers a promising lever here\, both as an accelerator for and proxy to traditional optimization-based problems. In this thesis\, we consider learning-based algorithms for three such problems: load restoration in islanded microgrids\, accelerated optimal power flow\, and short-term load forecasting. \nWe first address load restoration of islanded MGs containing RESs\, battery ESSs\, microturbines\, and inverter-based devices. We formulate the problem as a multi-timestep nonconvex optimization and decompose it via model predictive control (MPC). We develop novel convex relaxations of the nonconvex constraints\, including power flow\, ESS charge/discharge complementarity\, and inverter voltage-reactive power relations\, to generate approximately feasible solutions\, and then improve on them via a reinforcement learning method based on constrained policy optimization (CPO) that respects the original nonconvexity. \nWe then turn to accelerating convexified optimal power flow (C-OPF) via constraint screening\, presenting an analysis that reduces screening for certain C-OPF families to a rank-based test. Building on this\, we introduce Mixture of Gradient Experts (MoGE)\, an architecture that learns optimal dual variables from historical C-OPF solutions and combines them with the KKT conditions to eliminate likely non-binding constraints\, with a recovery step that guarantees the reduced problem’s solution matches the original’s. We demonstrate speedups on grids with up to 10\,000 buses. \nFinally\, we consider short-term load forecasting (STLF) from smart-meter data\, motivated by the role of forecasts as inputs to the optimization problems above. To address consumer-data privacy and the heterogeneity of consumption patterns\, we introduce personalization layers for federated learning (PL-FL)\, in which each client trains a model with a local personalized component and a shared aggregated component\, and extend it to a privacy-preserving variant (PPFL) that applies differential privacy to the shared component. Separately\, we present an empirical study of forecasting architectures spanning classical recurrent networks to fine-tuned time-series foundation models\, holding dataset size and parameter count constant to isolate architectural contribution. All methods are evaluated on subsets of the NREL ComStock dataset. \nEvent Host: Shourya Bose\, Ph.D. Candidate\, Electrical & Computer Engineering  \nAdvisor: Yu Zhang \nZoom: https://ucsc.zoom.us/j/93511298189?pwd=eAyDKdMirlVqYGUsbhQCccoBM9gDV6.1 \nPasscode: 462014
URL:https://events.ucsc.edu/event/bose-s-ece-learning-augmented-optimization-control-and-inference-in-modern-power-systems/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option-3.png
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260603T090000
DTEND;TZID=America/Los_Angeles:20260603T110000
DTSTAMP:20260601T101117
CREATED:20260529T161208Z
LAST-MODIFIED:20260529T161208Z
UID:10014887-1780477200-1780484400@events.ucsc.edu
SUMMARY:Morey\, C. (BMEB) - Innovations in Interdependence: Genomic and Functional Evolution in Invertebrates and Their Intracellular Symbionts
DESCRIPTION:Intracellular symbionts are microorganisms\, such as bacteria\, that live within host cells. These associations are widespread throughout the invertebrate tree of life\, and can perform a diversity of key metabolic\, immune-response\, or other functions that the host is dependent on for survival or reproduction. Intracellular symbioses allow both the host and the symbiont to occupy new ecological niches\, and thus can have profound impacts on their evolution. Recent and rapid growth of available sequencing data provides new opportunities to investigate the genomic alterations underpinning functional and morphological changes during the evolution of these relationships\, and how they reshape both host and symbiont biology. \nHere\, I propose investigating unique mechanisms of genomic innovation across three levels of host-symbiont evolution: symbiont genome evolution\, host-symbiont regulatory co-evolution\, and host genome evolution. In aim 1\, I will investigate how mobile genetic elements drive episodic genome expansion and functional innovation in obligate chemosynthetic symbionts of deep-sea clams\, further challenging the notion that reductive genome evolution is an inevitable or linear fate for host-restricted lineages. In aim 2\, I will explore the potential for symbiont-derived small-RNA molecules to participate in cross-kingdom gene regulation of their hosts across a diversity of host-symbiont systems using publicly available genome and RNA-sequencing data. In aim 3\, I will explore the convergent evolution of gut loss across independently derived marine bivalve lineages that depend nutritionally on chemosynthetic symbionts\, identifying host genomic changes associated with the transition to a symbiotic lifestyle. Together\, these aims leverage the expanding wealth of genomic data to illuminate how host-symbiont relationships reshape the genomes of both partners and generate novel adaptations across evolutionary time. \nEvent Host: Camryn Morey\, Ph.D. Student\, Biomolecular Engineering & Bioinformatics \nAdvisor: Shelbi Russell and Russ Corbett-Detig \nZoom: https://ucsc.zoom.us/j/92296748824?pwd=kabPBvby5xZbAHBbxBX6IIHNka8sLX.1 \nPasscode: 153631
URL:https://events.ucsc.edu/event/morey-c-bmeb-innovations-in-interdependence-genomic-and-functional-evolution-in-invertebrates-and-their-intracellular-symbionts/
LOCATION:Biomedical Sciences Building\, 575 McLaughlin Drive
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option-3.png
GEO:46.1226939;-64.7891251
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Biomedical Sciences Building 575 McLaughlin Drive;X-APPLE-RADIUS=500;X-TITLE=575 McLaughlin Drive:geo:-64.7891251,46.1226939
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260603T130000
DTEND;TZID=America/Los_Angeles:20260603T170000
DTSTAMP:20260601T101117
CREATED:20260529T164521Z
LAST-MODIFIED:20260529T164521Z
UID:10014860-1780491600-1780506000@events.ucsc.edu
SUMMARY:22nd Annual Graduate Research Symposium
DESCRIPTION:This event celebrates and highlights the work of UCSC graduate students in all academic divisions. Enrolled graduate students will present either a poster\, talk\, or mixed media presentation. Judges will select and award a top prize for each academic division. This event is free and open to the public. \nLocation : Science Hill\nResearch talks will be scheduled in BioMed 200\, BioMed 300 and PSB 240 from 1:00 – 2:30 PM\nThe poster session will be outside on the Plaza between PSB and the Science & Engineering Library\, 2:30 – 4:00 PM
URL:https://events.ucsc.edu/event/22nd-annual-graduate-research-symposium/
LOCATION:Physical Sciences Building\, Physical Sciences Building\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations,Seminars
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2026/05/Reserach-Symposium-Logo.png
GEO:36.9996638;-122.0618552
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Physical Sciences Building Physical Sciences Building Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Physical Sciences Building:geo:-122.0618552,36.9996638
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260604T093000
DTEND;TZID=America/Los_Angeles:20260604T113000
DTSTAMP:20260601T101117
CREATED:20260526T174336Z
LAST-MODIFIED:20260526T174336Z
UID:10014869-1780565400-1780572600@events.ucsc.edu
SUMMARY:Xie\, Y. (CM) - Crop Circles of Play: Forces and Formation in the Dyadic Magic Circle
DESCRIPTION:Cooperative two-player play produces distinctive social experiences between players: intimacy\, trust\, cooperation\, communitas. Since Huizinga\, the frame within which these experiences arise has been called the Magic Circle: a temporarily-set-apart space through which play does its social work. It has been a central organizing concept across game studies\, performance theory\, and HCI because it points to a basic human capacity: the way play transforms activity that\, on its own\, would mean nothing into shared experiences of intimacy\, trust\, and communitas. Yet a century on\, after generations of theoretical elaboration and equally vigorous contestation\, the Magic Circle remains theoretically rich but empirically elusive\, invoked by Huizinga\, Goffman\, Stenros\, and others but never located in observable interaction. Locating it empirically would let us observe what shapes any given Magic Circle and how that shape develops over the course of play: the game itself\, each player’s prior experience with games and streams\, the histories they bring to each other\, and whatever else is pressing on the shared frame. It would help explain why two dyads playing the same game produce different experiences\, a particular concern for educational games\, serious games\, and art games that aim to deliver a specific message or outcome to players. This proposal argues that the dyadic Magic Circle becomes observable when two players meet over a shared game and must negotiate their individual senses of “what this play is” into a shared frame. It treats this negotiated frame as a Crop Circle: a pattern pressed into recorded interaction by forces (player pulls\, designer prescriptions\, external audiences)\, reconstructable through close multimodal reading. The proposal therefore asks: where\, in the recorded interaction of dyadic play\, can the negotiated Magic Circle be caught taking shape\, and what does its observable form reveal about how a designed game becomes a lived experience between two people? \nThis proposal examines the dyadic Magic Circle through five connected studies. Study 1 conducts a PRISMA systematic review of two-player game scholarship in the ACM Digital Library\, showing that the field has already documented Magic Circle phenomena and closely related interactional dynamics without naming them as such. Study 2 applies Interaction Analysis (Jordan and Henderson\, 1995) to publicly available stream footage of two-player cooperative gameplay performed for an external audience. Study 3 conducts a controlled lab study of dyadic cooperative gameplay\, using multimodal recording and post-session stimulated recall to capture the negotiated Magic Circle under private play conditions. Study 4 conducts a comparative reading of the Study 2 and Study 3 corpora to examine how the audience-versus-private frame\, as an external force\, imprints on the dyadic Magic Circle. Finally\, Study 5 reads across Studies 1-4 to identify what gives the Magic Circle its “magic”: the configurations of force and trace that produce the distinctive social experiences a century of play scholarship has been chasing\, and to articulate “design for the Magic Circle\, not for the experience” as a generative principle for cooperative game design. \nEvent Host: Yi Xie\, Ph.D. Student\, Computational Media \nAdvisor: Elin Carstensdottir \nZoom: https://ucsc.zoom.us/j/94258671135?pwd=qEkTZAQKI5avLf060hOycY1hgER2tX.1 \nPasscode: 650205
URL:https://events.ucsc.edu/event/xie-y-cm-crop-circles-of-play-forces-and-formation-in-the-dyadic-magic-circle/
LOCATION:
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option-1.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260604T100000
DTEND;TZID=America/Los_Angeles:20260604T120000
DTSTAMP:20260601T101117
CREATED:20260512T161057Z
LAST-MODIFIED:20260512T171434Z
UID:10014625-1780567200-1780574400@events.ucsc.edu
SUMMARY:Kordonowy\, S. (CS) - The Role of Circuits in Near-Term Quantum Computation
DESCRIPTION:As quantum computing transitions from theory to practice\, understanding which algorithms suit near-term devices becomes critical. Current quantum computers are severely constrained by limited qubit counts\, short coherence times\, and high error rates that quickly degrade computation into noise. This thesis addresses two interconnected questions: what non-trivial computational tasks can near-term devices execute and how should algorithms be implemented to exploit available hardware? We examine circuit design as the bridge between these concerns\, analyzing how gate choices determine algorithmic efficiency and computational hardness. By deriving explicit circuit constructions\, we obtain tangible cost estimates for practical quantum computation\, enabling precise comparisons to classical approaches and identification of break-even points in system size and error rates. Understanding these trade-offs is essential for near-term quantum computing\, where experiments are expensive and error-prone. \nWe apply these ideas to three domains:\n1. Streaming: we provide circuit implementations for the Boolean Hidden Matching problem\, a combinatorial problem which exhibits exponential space separation compared to classical algorithms. We give explicit resource estimates and experimentally validate on Quantinuum’s trapped-ion hardware. We demonstrate that quantum advantage persists even when accounting for error correction overhead. \n2. Variational eigensolving: We examine how gate set choices influence trainability of variational quantum eigensolvers and provide Lie algebraic decompositions for differing gate sets. These decompositions are in turn used as a warm-starting heuristic to overcome barren plateaus\, a common problem in quantum machine learning tasks\, and improve convergence. We apply this technique to three combinatorial problems with primary focus on portfolio optimization. \n3. Cryptography: We develop a digital signature scheme based on circuit learning hardness and classical shadows. Error detection plays a direct role in the circuits considered\, with a focus on practical implementation for near-term devices. \nThese case studies demonstrate how careful circuit design can either mitigate near-term\nconstraints or expose where error correction becomes necessary to achieve quantum\nadvantage. \n  \nEvent Host: Steven Kordonowy\, Ph.D. Candidate\, Computer Science  \nAdvisor: Alexandra Kolla  \nZoom: https://ucsc.zoom.us/j/9524731001?pwd=MzdrNmhidVBsTXNFbktBcjEvNmZIQT09&omn=96338496668  \nPasscode: J29XGi \n  \n 
URL:https://events.ucsc.edu/event/kordonowy-s-cs-the-role-of-circuits-in-near-term-quantum-computation/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option-3.png
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260604T100000
DTEND;TZID=America/Los_Angeles:20260604T120000
DTSTAMP:20260601T101117
CREATED:20260528T203838Z
LAST-MODIFIED:20260528T203838Z
UID:10014885-1780567200-1780574400@events.ucsc.edu
SUMMARY:Okamoto\, F. (BMEB) - Improving read-to-pangenome alignment in complicated genomic regions
DESCRIPTION:Many genetics pipelines start by aligning sequencing reads to a reference genome. Aligners attempt to find the position in the reference sequence which best matches the read sequence\, but this breaks down when the reads come from a sample with variation relative to the reference. A proposed alternative\, pangenome graphs\, is supposed to fix such “reference bias” by including known variation within the reference itself. Yet read alignment is still difficult in graph regions featuring certain complex variation. I will address specific known limitations of pangenome read alignment by developing better methods to align reads to pangenomes (1) in centromeres\, (2) in regions with cycles\, (3) when a “split”/supplementary alignment is required\, and (4) for RNA-seq reads. \nEvent Host: Faith Okamoto\, Ph.D. Student\, Biomolecular Engineering & Bioinformatics \nAdvisor: Benedict Paten \nZoom: https://ucsc.zoom.us/j/3543092299?pwd=5xbPfPhxvoJlx24tusiOwPuLSjzwzb.1 \nPasscode: 767376
URL:https://events.ucsc.edu/event/okamoto-f-bmeb-improving-read-to-pangenome-alignment-in-complicated-genomic-regions/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option-1.jpg
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260604T130000
DTEND;TZID=America/Los_Angeles:20260604T150000
DTSTAMP:20260601T101117
CREATED:20260526T193652Z
LAST-MODIFIED:20260526T193652Z
UID:10014872-1780578000-1780585200@events.ucsc.edu
SUMMARY:Lietz\, R. (CM) - Reflecting on Failure: Designing and Evaluating Archetype Profiles as a Tool for Self-Reflection
DESCRIPTION:Self-reflection holds significant potential for learning\, behavior change\, and emotional processing\, yet designing technologies that effectively support it remains challenging\, particularly when reflection involves difficult experiences such as failure. Most current technologies avoid negative experiences altogether\, leaving users without support at precisely the moments when reflection could be most valuable.\nThis dissertation investigates how technology can better support self-reflection through three mixed-methods studies. The first examines how people experience and reflect on failure\, revealing how identity\, self-blame\, and emotional avoidance create barriers to productive reflection. These findings informed an iterative design process through which archetype profiles emerged as a promising reflective format. The second study evaluated archetype profiles against standard graph-based visualizations\, finding that the quiz-profile sequence effectively scaffolded reflection by supporting emotional re-engagement followed by cognitive reframing. The third study extended this work into a collaborative context\, examining archetype profiles derived from sleep tracking data as shareable artifacts for social reflection. Across these studies\, this dissertation contributes empirical insights into reflection on failure and design knowledge about archetype profiles as a reflective format. \nEvent Host: Rebecca Lietz\, Ph.D. Candidate\, Computational Media \nAdvisor: Steve Whittaker \nZoom: https://ucsc.zoom.us/j/7855885795?pwd=RS9mWXhQOXNyNmRVSzQrd1MzamJVQT09 \nPasscode: 172404
URL:https://events.ucsc.edu/event/lietz-r-cm-reflecting-on-failure-designing-and-evaluating-archetype-profiles-as-a-tool-for-self-reflection/
LOCATION:Silicon Valley Campus\, 3175 Bowers Avenue\, Santa Clara\, CA\, 95054\, United States
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option2.jpg
GEO:37.3796975;-121.9765484
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Silicon Valley Campus 3175 Bowers Avenue Santa Clara CA 95054 United States;X-APPLE-RADIUS=500;X-TITLE=3175 Bowers Avenue:geo:-121.9765484,37.3796975
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260604T140000
DTEND;TZID=America/Los_Angeles:20260604T153000
DTSTAMP:20260601T101117
CREATED:20260527T164116Z
LAST-MODIFIED:20260527T164116Z
UID:10014879-1780581600-1780587000@events.ucsc.edu
SUMMARY:Imlau Dagostini\, J. (CSE) - Intent-Driven Orchestration for Scientific Computing
DESCRIPTION:The growing complexity of high-performance computing (HPC) systems poses a fundamental challenge for domain scientists\, whose primary objective is to obtain scientifically valid results rather than to optimize resource utilization. Modern leadership-class facilities combine heterogeneous CPUs\, GPUs\, and specialized accelerators across systems that simultaneously support traditional scientific simulations and AI-driven workloads. This creates a vast\, machine-dependent configuration space that even experienced systems researchers find difficult to navigate. In practice\, users must explicitly specify resources\, node counts\, and walltime estimates before submitting jobs to an orchestrator\, resulting in iterative trial-and-error that wastes both human effort and compute resources. \nThis thesis proposes an intent-driven orchestration middleware for scientific computing\, in which domain scientists express high-level computational goals rather than low-level resource parameters\, and the system assumes responsibility for identifying configurations that satisfy those goals efficiently. This thesis proposal builds on a completed study of the computational performance of pangenome mapping\, a representative workload of data-intensive pipelines increasingly common in modern science. We demonstrate that tailoring tuning parameters to specific inputs and architectures yields significant performance improvements while exposing the depth of the configuration search problem that motivates this thesis. We then present an in-progress user-aware\, intent-driven middleware that uses surrogate models to aid this exploration and map high-level goals to suitable configurations. We end this presentation by proposing a cluster-aware orchestrator that enables existing HPC resource managers to support intent-aware decision-making. \nEvent Host: Jessica Imlau Dagostini\, Ph.D. Student\, Computer Science & Engineering \nAdvisor: Abel Souza \nZoom: https://ucsc.zoom.us/j/93851280425?pwd=v4ONi9N5UlfZmsMqiI4gSkxFXe0oaX.1 \nPasscode: 835985 \n 
URL:https://events.ucsc.edu/event/imlau-dagostini-j-cse-intent-driven-orchestration-for-scientific-computing/
LOCATION:Jack Baskin Engineering\, Baskin Engineering 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option-3.png
GEO:37.000369;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Jack Baskin Engineering Baskin Engineering 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Baskin Engineering 1156 High Street:geo:-122.0632371,37.000369
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260605T080000
DTEND;TZID=America/Los_Angeles:20260605T100000
DTSTAMP:20260601T101117
CREATED:20260527T160819Z
LAST-MODIFIED:20260527T160819Z
UID:10014878-1780646400-1780653600@events.ucsc.edu
SUMMARY:Chen\, Z. (CSE) - GPU Subgroup Semantics for Portable High-Performance Kernels
DESCRIPTION:Modern high-performance GPU kernels increasingly rely on subgroup-level execution\, including subgroup-level communication\, subgroup operations\, and matrix operations. These features are essential for workloads such as matrix multiplication and FlashAttention\, but their language-level guarantees remain difficult to reason about. Existing programming models often leave unclear which threads participate in subgroup operations\, when subgroup threads are required to execute together\, and what synchronization is implied by subgroup-level operations. This ambiguity becomes especially important in portable GPU programming\, where the same kernel may run across devices with different subgroup sizes\, compiler stacks\, browser backends\, and hardware execution behavior. \nMy research studies how precise subgroup semantics can support portable and correct high-performance GPU kernels. SIMT-Step\, my main completed work\, develops a formal and flexible operational semantics for GPU subgroup execution. It introduces dynamic blocks to specify converged subgroup execution and subgroup-operation participation\, classifies instructions as independent\, synchronous\, or collective to express a spectrum of candidate subgroup semantics\, and validates these models through a TLA+ implementation and an empirical fuzzing study across real GPUs. My systems work studies how subgroup-dependent kernels behave in practice\, including WebGPU FlashAttention kernels for LLM inference\, tunable WebGPU kernels for performance portability\, and Vulkan-based execution for heterogeneous SoCs. Building on these foundations\, my proposed verification work develops data-race-free checking techniques for ML kernels that rely on subgroup operations and matrix operations. Together\, these projects aim to clarify the execution guarantees that optimized GPU kernels can rely on and to support portable GPU programming systems whose performance and correctness can be reasoned about across diverse hardware. \nEvent Host: Zheyuan Chen\, Ph.D. Student\, Computer Science & Engineering \nAdvisor: Tyler Sorensen \nZoom: https://ucsc.zoom.us/j/92175288480?pwd=jGajtqerVbKuW1FPNr3awqOYoxATsp.1&jst=3 \nPasscode: 693354
URL:https://events.ucsc.edu/event/chen-z-cse-gpu-subgroup-semantics-for-portable-high-performance-kernels/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option-1.jpg
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
END:VCALENDAR