Events

Chinese Names Pronunciation Workshop
2025-11-20 12:00 - 13:00 (America/Los_Angeles) | CA
Learn the fundamentals of reading Chinese pinyin names and practice with native speaking staff members and students from Global Engagement. Hosted by Chunling Hu (International Student Advisor) and Global Leaders.
Register here for the Chinese Names Pronunciation Workshop
Date: Thursday, November 20
Time: 12:00 – 13:00
Location: Zoom
This event is part of UCSC’s International Education Week. If you have any questions, please contact us at iprogramming@ucsc.edu.

Job search strategies in a competitive market
2025-11-20 18:00 - 19:00 | Silicon Valley Campus, 3175 Bowers Avenue, Santa Clara, CA, 95054, United States
Join Dean PK Agarwal for this free, in-person and online event as he provides actionable tips on navigating today’s dynamic job market — from leveraging LinkedIn and digital portfolios to networking effectively and positioning yourself as a must-hire candidate. Ideal for career changers, recent grads, and mid-career professionals.
In this session you’ll:

Learn proven strategies for standing out to recruiters and hiring managers
Build a compelling digital presence, including LinkedIn and online portfolios
Apply smart networking to open doors and build lasting connections

This session is part of Pathways to Professional Success, a new conversation series hosted by Dean P.K. Agarwal.

Claim your seat!

Ellen Bass: Morton Marcus Poetry Reading
2025-11-20 18:00 - 19:30 | Merrill Cultural Center, 200 McLaughlin Dr, Santa Cruz, CA, 95064
Join us for the 15th annual Morton Marcus Poetry Reading, featuring honored guest Ellen Bass. Poet Gary Young will host the program, and the evening will include an announcement of the winner of the Morton Marcus Poetry Contest (recipient receives a $1,000 prize).
Ellen Bass’s most recent collection, Indigo, was published by Copper Canyon Press in 2020. Among her other books are Like a Beggar, The Human Line, and Mules of Love. Her poems appear frequently in The New Yorker, American Poetry Review, and many other journals. Among her awards are Fellowships from the Guggenheim Foundation, The NEA, and The California Arts Council, The Lambda Literary Award, and four Pushcart Prizes. She co-edited with Florence Howe the first major anthology of women’s poetry, No More Masks!, and her nonfiction books include the groundbreaking The Courage to Heal: A Guide for Women Survivors of Child Sexual Abuse and Free Your Mind: The Book for Gay, Lesbian and Bisexual Youth. A chancellor emerita of the Academy of American Poets, Bass founded poetry workshops at Salinas Valley State Prison and the Santa Cruz, California jails, and teaches in the MFA writing program at Pacific University
Gary Young is the author of several collections of poetry. His most recent books are That’s What I Thought, winner of the Lexi Rudnitsky Editor’s Choice Award from Persea Books, and Precious Mirror, translations from the Japanese. His other books include Even So: New and Selected Poems; Pleasure; No Other Life, winner of the William Carlos Williams Award; Braver Deeds, winner of the Peregrine Smith Poetry Prize; Days; The Dream of a Moral Life, which won the James D. Phelan Award; and Hands. He has received a Pushcart Prize, and grants from the National Endowment for the Humanities, the National Endowment for the Arts, the California Arts Council, and the Vogelstein Foundation, among others. In 2009 he received the Shelley Memorial Award from the Poetry Society of America. Young was the first Poet Laureate of Santa Cruz County, and in 2012 he was named Santa Cruz County Artist of the Year. Since 1975 he has designed, illustrated, and printed limited edition letterpress books and broadsides at his Greenhouse Review Press. His fine print work is represented in numerous collections including the Museum of Modern Art, the Victoria and Albert Museum, The Getty Museum, and special collection libraries throughout the U.S. and Europe. He teaches creative writing and directs the Cowell Press at UC Santa Cruz.
This event is a part of the Fall UCSC Living Writers course, which features poets, novelists, academics, curators, and artists in conversation with one another, in person, across genre and media.
Purchase both poets’ works at: www.bookshopsantacruz.com

Parking Information
The Merrill Cultural Center is located in Merrill College, in the northeast corner of the campus core. Those walking or arriving by Metro bus or campus shuttle can take the steep path heading northeast from the Crown/Merrill bus stop.
For those driving from the Main Entrance, stay on Coolidge Drive. Shortly after Coolidge turns left and becomes McLaughlin Drive, turn right at the sign for Merrill College. At the top of the hill, veer right. There are ParkMobile parking spaces along the left side of the lot, and parking for “A,” “B,” and “C” permits along the right. There are two accessible parking spaces if you turn left at the top of the hill and two more if you turn right. Parking attendants will be on site to sell parking permits to event attendees.

The Morton Marcus Poetry Reading honors poet, teacher, and film critic Morton Marcus (1936–2009). Marcus was the 1999 Santa Cruz County Artist of the Year and a recipient of the 2007 Gail Rich Award. Among his published works are eleven volumes of poetry, including The Santa Cruz Mountain Poems, Pages from a Scrapbook of Immigrants, Moments Without Names, Shouting Down the Silence, Pursuing the Dream Bone and The Dark Figure In The Doorway; a novel, The Brezhnev Memo; and a literary memoir, Striking Through the Masks. He taught English and Film at Cabrillo College for thirty years, was the co-host of the radio program, The Poetry Show, and was the co-host of the television film review show, Cinema Scene. Learn more at: www.mortonmarcus.com
The Morton Marcus Poetry Archive can be found at UCSC Special Collections. Mort’s personal papers, manuscripts, and recordings reflect his legacy as a poet and educator, and his collection of poetry books, broadsides, literary magazines and correspondence with other poets and writers illuminate his deep involvement in, and passion for, the literary art of poetry.
Organizing Committee: Danusha Laméris, Donna Mekis, Mark Ong, Maggie Paul, Farnaz Fatemi, David Sullivan, Irena Polić, Teresa Mora, and Gary Young.
Morton Marcus Memorial Poetry Contest: Every year, the annual reading coincides with the The Morton Marcus Memorial Poetry Prize, a national poetry contest which honors Morton Marcus, “whose life and work inspired the writing of many students, friends, and emerging poets.” The contest is hosted by The Hive Poetry Collective. The Hive is a group of Santa Cruz poets creating a weekly radio show and live poetry events featuring a diverse roster of poets and seeks to bring a diverse community together in appreciation of all kinds of poetry by all kinds of people. This year’s contest will be judged by Nancy Miller Gomez. For more information visit: https://hivepoetry.org/morton-marcus-prize/
Support Poetry in Santa Cruz: The Annual Morton Marcus Poetry Reading is made possible due to campus and community co-sponsorships and generous contributions from members of our community, like you. To ensure we can continue to offer this poetry reading free and open to the public in honor and memory of Morton Marcus, and to have our lives deeply enriched by exceptional poetry, please consider making a gift to The Morton Marcus Poetry Reading Fund: thi.ucsc.edu/projects/morton-marcus-poetry-reading.
This community event is presented by the The Humanities Institute and co-sponsored by:
Bookshop Santa Cruz
Cabrillo College English Department
Cowell College
Donna F. Mekis
The Hive Poetry Collective
Living Writers Series
Ow Family Properties
Merrill College
Poetry Santa Cruz
Porter Hitchcock Modern Poetry Fund
Porter College
Santa Cruz Writes
Side By Side Press
Special Collections & Archives
If you have disability-related needs, please contact us at thi@ucsc.edu or call 831-459-1274 by October 31.
Photo by: Irene Young

Ramollari, H. (ECE) - An Optofluidic Spectrometer and Applications in Biosensing
2025-11-21 12:30 - 14:00 | Engineering 2, Engineering 2 1156 High Street, Santa Cruz, CA, 95064
Miniaturized spectrometers have the potential to replace bulky and expensive benchtop models. We have previously demonstrated a multimode interference (MMI) waveguide-based spectrometer that achieves high performance while minimizing its footprint.
In this talk, the integration of the MMI spectrometer into an optofluidic device is proposed. This integration opens up applications such as the detection of single particle fluorescence spectra and absorption spectra.
Moreover, adding a metasurface to the spectrometer waveguide is expected to enhance the sensitivity of single particle detection and simplify the analysis methods.
Finally, to improve the MMI waveguide spectrometer a new nanophotonic platform is proposed.
Event Host: Helio Ramollari, Ph.D. Student, Electrical Engineering
Advisor: Holger Schmidt
Zoom- https://ucsc.zoom.us/j/99623652977?pwd=[REDACTED]
Passcode- 576057

Torres, S. (ECE) - An Integrated Platform for Real-time Monitoring and Support of 3D Tissue Growth
2025-11-21 14:00 - 16:00
Organoids are three-dimensional tissue cultures that model real organs and serve as valuable tools for studying development, disease, and treatment response. Traditional methods, which rely on manual handling and incubators, limit consistency and real-time monitoring. To address these issues, we developed a modular microfluidic platform that integrates automated feeding, live fluorescence imaging, and environmental control without the need for a standard incubator. The core of the system is a vertically oriented PDMS-glass chip that enables precise media delivery and continuous imaging of small 3D structures such as organoids. Using fluorescent dyes to mimic molecules, such as nutrients or drugs, we tracked their movement through tissue in real time without invasive sensors. This setup maintains metabolic stability and provides detailed insight into molecular transport, which improves applications in disease modeling, drug testing, and personalized medicine.

Event Host- Sebastián Torres, Ph.D. Candidate, Electrical & Computer Engineering
Advisor: Mircea Teodorescu

Zoom- https://ucsc.zoom.us/j/2333595627?pwd=[REDACTED]
Passcode- 579836

Santa Cruz Pickwick Club presents: Bleak House
2025-11-23 13:00 - 15:00 | CA
Spontaneous human combustion! Evil lawyers! Detectives! Family intrigue! These all come together in Charles Dickens’s masterwork, Bleak House. This year, we will spend the year reading the 2026 Dickens Universe novel. Join Dickens enthusiasts and Pickwick Club members on Zoom for a series of discussions about this beloved book.
Register via Zoom
Reading Schedule:

OCT 26: Chapters 8-13
NOV 23: Chapters 14-19
DEC 28: No meeting
JAN 25: Chapters 20-25
FEB 22: Chpaters 26-32
MAR 22: Chapters 33-38
APR 26: Chapters 39-46
MAY 24: Chapters 47-53
JUN 28: Chapters 54-67 (End)

Recommended Edition: We recommend the Penguin Classics edition of the novel for its appendices and notes, but other versions are fine. First-time readers should avoid the Introduction if they don’t want spoilers. Download the novel to read at Gutenburg.org or listen to it at LibriVox.org.
The Santa Cruz Pickwick (Book) Club, a branch of the Dickens Fellowship, is a community of local bookworms, students, and teachers who meet monthly to discuss a nineteenth-century novel. The Santa Cruz Public Libraries provide support for the reading group.

Chen, Q. (CSE) - New Approximation and Online Algorithms using Novel Combinatorial Structures
2025-11-24 09:30 - 11:30
Most optimization problems face the challenge of computing an optimum solution requiring superpolynomial time. In particular, they are classified as NP-hard problems that have no polynomial-time algorithm to date. Instead, computer scientists turn to find an approximate solution and create numerous elegant algorithms. However, in the modern era, computational environments have changed drastically, and we are not able to afford to design new algorithms for each new problem via repeated trial and error. Therefore, systematic ways to understand the possibilities and limitations of these problems are desired. This dissertation studies several central combinatorial optimization problems, focusing on understanding the key structural obstacles and developing unified frameworks. Mainly, we study two types of combinatorial optimization problems:
(1) Scheduling. The problem is associated with limited resources, and our target is to find an allocation method to complete all jobs over time that minimizes the overall budget cost.
(2) Network Design. Different from scheduling problems. In this problem, we aim to find a minimum-cost topological network that supports routing for demanding communications.
Our first work is focused on a group-to-group survivable network design problem that generalizes the classic point-to-point network to support routing between any pair of subsets of nodes. Previous research stops at limited faults, and the difficulty comes from the way to compress the graph into a tree. We propose a new framework via capacitated tree embeddings against arbitrary faults in the network, which gives the first polylogarithmic approximation algorithm. Further, this framework captures nearly all the recent models proposed in the area.
In contrast to the offline optimization problems mentioned above, online algorithms are natural adaptations that have been found in tremendous real applications. In online algorithms, the algorithm wants to compete against arbitrary uncertainty, which means the instance is unknown at first and revealed over time. We study various scheduling problems and focus on some important metrics – average flow time, which measures the average time a job stays in the system from its arrival to completion. Real-world demands give online scheduling problems enormously different settings. Computer scientists need to repeat errors and trials to find a provably good solution. We find the key required combinatorial property is supermodularity for the residual objective, which measures the average completion time for all alive jobs assuming they have the same arrival time. Further, we relate supermodularity with gross-substitute/linear-substitute (GS/LS), which is a well-studied definition in economics. Finally, we propose a meta-algorithm that solves all captured problems in one shot.
Event Host: Qingyun Chen, Ph.D. Student, Computer Science and Engineering
Advisor: Sungjin Im
Zoom- https://ucsc.zoom.us/j/94376536164?pwd=[REDACTED]

ECE 290 Seminar: Fundamental Nanopower Analog Circuits
2025-11-24 10:40 - 11:45 | CA
Presenter: Joey Sankman, Analog/Power Designer, Analog Devices
Description: With the rising interest in edge computing, and the addition of AI/ML functionality, nanopower circuits are in great demand to reduce the quiescent power consumption of remote sensors. In this tutorial, fundamental building blocks for nanopower circuits will be covered, including startup-less low-voltage references, low-frequency clocks, and LDO regulators. Attendees can expect a deep dive into fundamental and practical analog techniques to design nanopower systems.
Bio: Joey Sankman received the B.S. degree from the University of Arizona, Tucson, AZ, and Ph.D. degree from the University of Texas at Dallas, TX in electrical engineering in 2010 and 2014, respectively. At the University of Texas at Dallas, his research included energy harvesting circuits and systems as well as high-performance switch mode power converters. He is currently an analog/power designer at Analog Devices, Principal Member of Technical Staff, working on automotive PMICs. Previously, he was an Analog R&D Engineer working on audio amplifiers, ultra-low power circuits, and radhard gate drivers at Kilby Labs, TI, Dallas, TX. He was the recipient of the U.S. National Science Foundation Graduate Research Fellowship and the 2011 Texas Instruments/Semiconductor Research Corporation Graduate Fellowship. He has authored or co-authored 20 publications in various IEEE journals and conferences. He currently serves on the IEEE ISSCC power subcommittee.
Hosted by: Professor Soumya Bose, ECE Department
Zoom Link: https://ucsc.zoom.us/j/97975378707?pwd=[REDACTED]

AM Seminar: Linear Stochastic Emulators of the Ocean Circulation based on Balanced Truncation: A Caution, perhaps, for Machine Learning?
2025-11-24 16:00 - 17:00 | CA
Presenter: Professor Andy Moore, UCSC Ocean Sciences
Description: Linear inverse models have enjoyed considerable popularity in the geosciences, particularly in the arena of climate research and climate prediction, for several decades as a straightforward approach to dimension reduction and streamlining computational efficiency. The most common approach is to truncate the system by retaining the leading Empirical Orthogonal Functions (EOFs) which represent the left singular vectors of the transition matrix. While singular value decomposition is the best low rank approximation of the transition matrix, ignoring information contained in the right singular vectors, as is commonly done in linear inverse models, has consequences for the dynamics that approximate the system. Dimension reduction based on balanced truncation simultaneously preserves information from the right and left singular vectors. This talk will review some of these ideas and present examples from the ocean. Since EOF decomposition is quite commonly used for dimension reduction in some machine learning approaches, there may be some lessons here for the machine learning community to consider.
Bio: Professor at UCSC since 2016.
Hosted by: Professor Julie Simons

Macroeconomics & International Finance Seminar Series Presents: Helen Popper
2025-11-25 13:40 - 15:00 | Engineering 2, Engineering 2 1156 High Street, Santa Cruz, CA, 95064
Macroeconomics and International Finance Seminar
Date: Tuesday, November 25, 2025
Time: 1:40-3:00 p.m.
Location: E2-499

Speaker: Helen Popper
Title: Professor of Economics
Affiliation: Santa Clara University
Host: Galina Hale

Seminar title: Artificial Intelligence and Macroeconomic Dynamics: Growth, Pricing, and Distribution

ABSTRACT: This paper builds a simple general equilibrium model in which an AI producer is a monopolist who both learns by doing and uses AI recursively as an input. These mechanisms link today’s scale to tomorrow’s costs, so pricing is dynamic: the firm sets a price below the static monopoly benchmark to expand capacity and speed learning. Final goods are produced by monopolistic competitors with constant returns to scale each period. We first use Cobb–Douglas technologies to solve for a generalized balanced growth path that pins down the condition for stable, nonexplosive growth. On this path, AI output grows faster than final output, the relative price of AI falls persistently, real wages rise with overall output, and the specialized–to–nonspecialized wage ratio is flat. We then analyze CES versions of both sectors and derive a closed form effective demand elasticity for AI that combines input substitution in production with final-goods market substitution across varieties. Finally, simulations link adoption and distribution to elasticities, and they allow us to explore the dynamics. When final-goods inputs are complements, adoption is learning-first and capital-light before scaling; when they are substitutes, adoption is scale-first and the two-phase pattern attenuates. On the distribution side, the specialized–to–nonspecialized wage premium is lowest with complements and rises with substitutes. Greater substitutability in AI production amplifies these patterns without changing their sign.

Dried Wreath Workshop
2025-11-30 10:00 | Hay Barn, 94 Ranch View Road, Santa Cruz, CA, 95064, United States
Learn how to create beautiful, long-lasting dried flower holiday wreaths with instructor Beth Benjamin. She will demonstrate the mechanics of putting everything together and will have a couple examples to guide your inspiration. Personal artistic style is highly encouraged! You’ll be able to choose from a wide selection of dried materials from the UCSC Farm and other sources. With care, your wreath will last for years. Light refreshments will be served and the atmosphere promises to be jovial, creative and social.

Register

AM Seminar: Denoising: A Powerful Building Block for Imaging, Inverse Problems and Machine Learning
2025-12-01 16:00 - 17:00 | https://ucsc.zoom.us/j/93681175800?pwd=[REDACTED]
Presenter: Peyman Milanfar, Distinguished Scientist, Google
Description: Denoising, the process of reducing random fluctuations in a signal to emphasize essential patterns, has been a fundamental problem of interest since the dawn of modern scientific inquiry. Recent denoising techniques, particularly in imaging, have achieved remarkable success, nearing theoretical limits by some measures. Yet, despite tens of thousands of research papers, the wide-ranging applications of denoising beyond noise removal have not been fully recognized. This is partly due to the vast and diverse literature, making a clear overview challenging. This article aims to address this gap. We present a clarifying perspective on denoisers, their structure and their desired properties. We emphasize the increasing importance of denoising and showcase its evolution into an essential building block for complex tasks in imaging, inverse problems and machine learning. Despite its long history, the community continues to uncover unexpected and groundbreaking uses for denoising, further solidifying its place as a cornerstone of scientific and engineering practice.
Bio: Peyman is a Distinguished Scientist at Google, where he leads the Computational Imaging team. Prior to this, he was a Professor of Electrical Engineering at UC Santa Cruz for 15 years, two of those as Associate Dean for Research. From 2012-2014 he was on leave at Google-x, where he helped develop the imaging pipeline for Google Glass. Over the last decade, Peyman’s team at Google has developed several core imaging technologies that are used in many products. Among these are the zoom pipeline for the Pixel phones, which includes the multi-frame super-resolution (Super Res Zoom) pipeline, and several generations of state of the art digital upscaling algorithms. Most recently, his team led the development of Pro Res Zoom, and Unblur, features launched in Pixel 10 devices and Google Photos. Peyman received his undergraduate education in electrical engineering and mathematics from the UC Berkeley, and the MS and PhD degrees in electrical engineering from MIT. He holds more than two dozen patents. He founded MotionDSP, which was acquired by Cubic Inc. Along with his students and colleagues, his research work has had deep impact in several areas of computational imaging, and applications of AI thereto – including the introduction of adaptive kernel regression to imaging; pioneering use of learning for fast, content-adaptive image upscaling (RAISR); Neural Image quality Assessment (NIMA), Regularization by Denoising (RED); and most recently (2024) Inversion by Direct Iteration (InDI). All of these works have been recognized with best paper awards. He’s been a Distinguished Lecturer of the IEEE Signal Processing Society, and is a Fellow of the IEEE “for contributions to inverse problems and super-resolution in imaging”
Hosted by: Professor Julie Simons, Applied Mathematics
Zoom link: https://ucsc.zoom.us/j/93681175800?pwd=[REDACTED]
Meeting ID: 936 8117 5800
Passcode: [REDACTED]

UC Santa Cruz Comprehensive Habitat Conservation Plan Informational Webinar
2025-12-02 17:30 - 18:30 | CA
Please join us to learn more about the UC Santa Cruz Comprehensive Habitat Conservation Plan (HCP).
The Campus Planning Department is hosting an upcoming informational webinar about the proposed Comprehensive Habitat Conservation Plan (HCP) for the Main Residential Campus, Westside Research Park and the Coastal Science Campus on Tuesday, December 2, 2025.
The informational webinar will provide information to the campus and community regarding the proposed Comprehensive Habitat Conservation Plan, its goals, and how it will guide future conservation and planning efforts at UC Santa Cruz. The webinar will include a presentation followed by an opportunity for participants to ask questions.

Event: UC Santa Cruz Comprehensive HCP Informational Webinar
Date & Time: Tuesday, December 2, 2025 at 5:30 pm
Location: Online (Zoom link provided once registered)
Registration: HCP Webinar

NLP MS Virtual Information Session
2025-12-02 19:00 - 20:00
Interested in a career in generative AI? Join us Dec. 2 from 7 – 8 PM for our Virtual Information Session. Learn more about our program, based at the UCSC Silicon Valley Campus, where you can earn your NLP MS in as little as 15 months. We offer:

Application fee waivers for UCSC students and alumni
Full and partial scholarships
Dedicated careers services support
Internship and research opportunities

Registration required: bit.ly/4nYyssJ

When Less is More: Applications of Type-Based Underapproximate Reasoning
2025-12-03 11:00 - 12:30 | Engineering 2, Engineering 2 1156 High Street, Santa Cruz, CA, 95064
Presenter: Suresh Jagganathan, Purdue University

Abstract:
Unlike program verifiers, symbolic execution and property-based testing tools underapproximate program behavior: they aim to report only real bugs (no false positives), at the cost of potentially missing some (false negatives). Recent work has sought to place such tools on a more formal footing, primarily through the development of incorrectness logics that capture a program’s ‘must’ rather than ‘may’ behavior. This talk explores how to transplant these ideas of underapproximation into an expressive refinement type system. Our development enables us to:

(a) Typecheck the completeness of property-based testing (PBT) generators, ensuring that a well-typed generator produces all values (i.e., fully covers) its output type;

(b) Synthesize effectful generators by extending the type system to model underapproximations of sequences of effects rather than just values; and

(c) Guide symbolic execution in effectful functional programs, prioritizing execution paths capable of falsifying data structure safety properties.

Our results demonstrate that viewing types through the lens of underapproximation offers a principled foundation for designing, implementing, and reasoning about program analyzers and test generators, significantly improving their reliability and practical utility in the process.

Bio:
Suresh Jagannathan is the Samuel D. Conte Professor of Computer Science at Purdue University. His interests span functional programming, program verification, distributed and concurrent systems, and trustworthy machine learning. In recent years, he has spent time as an Amazon Scholar, a program manager at the Information Innovoation Office (I2O) at DARPA, and a visiting researcher at the University of Cambridge. He serves an Associate Editor of ACM TOPLAS, and has served as both General and PC Chair of POPL (ACM Symposium on Programming Languages).

Hosted by: Professor Mohsen Lesani

Location: E2-180
*Refreshments such as coffee and pastries will be provided

Zoom: https://ucsc.zoom.us/j/93445911992?pwd=[REDACTED]

Applied Microeconomics and Trade Seminar Series presents: Matt Weinberg
2025-12-03 11:50 - 13:10 | Engineering 2, Engineering 2 1156 High Street, Santa Cruz, CA, 95064
Applied Microeconomics and Trade Seminar
Date: Wednesday, December 3, 2025
Time: 11:50am – 1:10 p.m.
Location: E2-499

Speaker: Matt Weinberg
Title: Professor of Economics
Affiliation: Ohio State University
Host: Jon Robinson

Seminar title: Oligopsony and Collective Bargaining: Evidence from K-12 Teachers

ABSTRACT: Employers facing limited labor market competition may suppress wages below socially optimal levels. Unions can counteract this wage suppression through collective bargaining, though the may also push wages above the socially optimal level. To assess these forces, we estimate a structural model of labor supply, labor demand, and Nashin-Nash bargaining over wages between teacher unions and school districts in Pennsylvania’s K-12 public school system from 2013 to 2020. Using the estimated parameters, we compare negotiated equilibrium wages and employment to the pure oligopsony scenario and the social planner scenario. On average, pure oligopsony reduces wages 16 percent below the social optimum, while collective bargaining raises wages by 9 percent above the optimum. This average masks substantial district-level heterogeneity driven by variation in bargaining power. Twenty-seven percent of schools have negotiated salaries below the social optimum due to cross-district externalities, where high salaries at one school lead to hiring reductions, which increase labor supply in competing districts.

Marketing Yourself In The Arts Industry
2025-12-03 12:00 - 13:00
Join the Arts Division and Career Success for a fast-paced, interactive online workshop on how to market yourself in the Arts—the event will cover personal branding, transferable skills, networking, gig work and more, giving you clear action steps to stand out in Arts-related careers and beyond.
—
ADMISSION
– FREE for UCSC students
– Registration required here
—
This program is open to all UC Santa Cruz affiliates consistent with state and federal law.

Learn about the Educational Therapy Certificate Program
2025-12-03 18:00 - 19:00
Transform learning.
Join Educational Therapy certificate program chair Sharmila Roy for a thoughtful program overview and hear how the uniquely designed curriculum empowers educators and professionals to make a lasting impact– in the classroom and beyond. As one of the few AET-approved programs, you’ll learn to assess learning challenges and apply effective, research-based interventions.
Empower students and build your practice
Gain skills to support students with learning differences like dyslexia, ADHD, and autism using therapeutic and educational strategies. Whether you’re working in schools or starting a private practice, this program helps you create individualized plans that foster meaningful progress.
Program organizer
This fall info session is sponsored by the Educational Therapy certificate program, a program approved by the Association of Educational Therapists.
Claim your seat- register today!

BME 280B Seminar: Gali Bai & David Haussler
2025-12-04 11:40 - 13:15 | Physical Sciences Building, Physical Sciences Building, Santa Cruz, CA, 95064
Presenter 1: Gali Bai, BME/PBSE Doctoral Candidate, Brooks Lab, UC Santa Cruz
Title 1: Dissecting the contribution of chromatin accessibility to RNA transcription and processing with long-read sequencing
Description: Although all cells in an organism share the same genomic sequence, transcriptional programs vary dramatically across cell types. This diversity is governed by epigenetic regulation involving the coordinated activities of chromatin remodelers, histone modifiers, and histone chaperones that precisely modulate chromatin accessibility. While previous studies have shown that chromatin accessibility at DNase I–hypersensitive sites such as promoters and enhancers is closely associated with gene expression, much less is known about how chromatin influences transcription and RNA processing. To study how chromatin regulates RNA processing, we perturbed yeast chromatin accessibility by deleting two highly conserved chromatin remodelers ISW1 and CHD1. With Oxford Nanopore long-read sequencing, we profiled nascent RNA, full-length mRNA, and chromatin fibers in wild-type and chd1 isw1 double-mutant yeast cells. Loss of ISW1 and CHD1 led to increased chromatin accessibility within intragenic regions, accompanied by aberrant transcription initiation. Leveraging long-read data, we associated distinct chromatin states with specific RNA processing events and isoform expression outcomes. Despite a similar level of chromatin perturbations across the genome, genes with low baseline expression showed extensive transcriptional reprogramming, whereas highly expressed genes remained largely unaffected. These discrepancies can be partially explained by differences in the enrichment of transcription initiation motifs. In intron-containing genes, loss of ISW1 and CHD1 reduced splicing efficiency and increased intron retention, likely due to disrupted RNAPII elongation in the double mutant. Together, our findings highlight the crucial role of ATP-dependent chromatin remodelers in maintaining nucleosome organization and coordinating co-transcriptional RNA processing.
Presenter 2: David Haussler, Distinguished Professor, UC Santa Cruz
Title 2: Brain Organoids
Bio: Haussler received his PhD in computer science from the University of Colorado at Boulder. He is a member of the National Academy of Sciences, the National Academy of Engineering, the American Academy of Arts and Sciences and a fellow of AAAS and AAAI. He has won a number of awards, including the 2015 Dan David Prize, the 2011 Weldon Memorial Prize from University of Oxford, the 2009 ASHG Curt Stern Award in Human Genetics, the 2008 Senior Scientist Accomplishment Award from the International Society for Computational Biology, the 2005 Dickson Prize for Science from Carnegie Mellon University, and the 2003 ACM/AAAI Allen Newell Award in Artificial Intelligence.
Hosted by: Professor Josh Stuart, BME Department

Pemulai ke Nanga Jela/Return to Nanga Jela
2025-12-04 12:00 - 13:30 | Humanities 1 Building, 257 Cowell-Stevenson Road, Santa Cruz, CA, 95064, United States
About the Talk: The history of hinterland communities is largely written in remote landscapes that today are often targeted for infrastructural development that forcibly relocates existing residents and transforms the land, obliterating those histories, and weakening communities.
In 1984/5 the Iban longhouse at Nanga Jela on Sarawak’s Engkari River in Malaysian Borneo, along with twenty-one other communities and a land area of 8500 ha disappeared because of the building of the Batang Ai Hydroelectric Dam and the creation of a 33 sq mile reservoir. With the drowning of these houses, lands, forests, and of multiple rivers and streams, the history of one of the longest-occupied and most historically rich Iban territories in Sarawak was gone. Many of the 3000 people who were displaced moved to government-created resettlement areas. Some left for other parts of Sarawak, and their descendants scattered around the world. All of those who were forced to leave their Batang Ai and Engkari homelands found their livelihoods completely transformed; none were free to pursue the rice agriculture and forest- and river-centered lives that they had known since their childhoods.
Three decades after this event, the ex-residents and descendants of Nanga Jela engaged in a process of reconstructing that submerged history and reconstituting an Engkari and Nanga Jela identity. Rescuing and sharing what images exist of the longhouse and its surrounding land- and waterscapes, collecting oral histories, geographical memories, genealogies, and a plethora of other local data, and employing multiple social media tools, the increasingly diverse, geographically dispersed community is regaining its history, knowledge of the lost land- and riverscapes, and its identity.
A team comprising Bobby Anak Nyegang and Itin Anak Langit, both born in Nanga Jela, and Christine Padoch, an anthropologist who spent more than two years in the longhouse, led the effort to assemble these and other materials into an image-rich bilingual (English and Iban) book that would be accessible to all in the Nanga Jela community, as well as a community-based archive. In this presentation, Padoch will discuss that complex process of writing the book, recently published as Pemulai ke NangaJela/Return to Nanga Jela and creating an archive together with the longhouse community to provide present and future descendants of the great longhouse on the Engkari River a written history of a landscape and a livelihood that has disappeared.
About the Speakers:
Christine Padoch is a Senior Curator Emerita in the Center for Plants, People and Culture of the New York Botanical Garden. From 2011 to 2017 she was the Director of Research on Forests and Human Well-Being at the Center for International Forestry Research (CIFOR). An anthropologist by training, she has spent about 50 years carrying out research on smallholder patterns of forest management, agriculture, and agroforestry in the humid tropics, principally in Southeast Asia and Amazonia. Previous to her position at CIFOR, Padoch was the Matthew Calbraith Perry Curator of Economic Botany at the NYBG. She is the author or editor of a dozen books and of approximately 100 scientific articles and book chapters. Christine Padoch has served as a scientific advisor to many international projects and has been a member of the boards of several international research institutions, including the Center for International Forestry Research (CIFOR), the Amazon Institute for Environmental Research (IPAM), and the Earth Innovation Institute (EII). She holds a Ph.D. from Columbia University.
Nancy Lee Peluso is Professor of Environmental Social Science and Resource Policy in the College of Natural Resources and the Program Director of the Berkeley Workshop in Environmental Politics, housed in the Institute of International Studies. She serves as a faculty member in the Society and Environment Division of the Department of Environmental Science, Policy and Management, where she teaches courses in Political Ecology. Her research since the 1980s has focused on Forest Politics and Agrarian Change in Southeast Asia, primarily in Indonesia. She has done field research in various parts of Indonesia—West and Central Java, East and West Kalimantan and in Sarawak, Malaysia. Her work addresses questions of property rights and access to resources, forest policy and politics, histories of land use change, and agrarian and environmental violence. She is the author or editor of three books: Rich Forests, Poor People: Resource Control and Resistance in Java (UC Press, 1992 – still available); Borneo in Transition: People, Forests, Conservation and Development (Oxford Press, 1996 and 2003, ed. with Christine Padoch); and Violent Environments (Cornell Press, 2001, ed. with Michael Watts.), and nearly fifty journal articles and book chapters. Professor Peluso speaks or reads four languages besides English. In 2003, she was awarded a Harry Frank Guggenheim Fellowship and is finishing a book manuscript tentatively titled, “Ways of Seeing Borneo: Landscape, Territory, and Violence”. She is currently working on a comparative study on the formation of “political forests” in Malaysia, Indonesia, and Thailand as well as a book examining the entanglements of violence and territoriality in landscape history in West Kalimantan.

Behavioral, Econometrics and Theory Seminar Series Presents: Jacopo Magnani
2025-12-04 13:40 - 15:00 | Engineering 2, Engineering 2 1156 High Street, Santa Cruz, CA, 95064
Economics Behavioral, Econometrics, & Theory Seminar
Date: Thursday, December 4, 2025
Time: 1:40-3:00 p.m.
Location: E2-499

Speaker: Jacopo Magnani
Title: Associate Professor of Economics
Affiliation: Norwegian University of Science and Technology, visiting Caltech
Host: Kristian Lopez Vargas

Seminar title: Behavioral Limits to Complete Markets

ABSTRACT: Standard economic theory predicts that individuals should prefer complete markets to incomplete markets, as the former allow state-contingent claims for every possible outcome. Yet real-world markets remain incomplete, and the demand-side origins of the phenomenon are poorly understood. We develop an experimental framework to examine whether investors may themselves prefer incomplete markets, and highlight two potential mechanisms: preference instability, which exposes agents to greater regret or temptation in complete markets, and complexity costs, which arise because higher dimensionality increases cognitive effort and errors. In our experiment, participants consistently reveal a preference for in complete markets, contradicting the rational benchmark. Comparing homegrown and induced-preference treatments, we find no evidence that this behavior is driven by preference instability. Instead, utility losses, response times, and subjective ratings indicate that complexity costs drive the preference for incompleteness. Structural estimation confirms that complete markets are several times more complex than incomplete ones, providing a behavioral foundation for market incompleteness.

Future careers: What will work look like in 2030?
2025-12-04 18:00 - 19:00 | Silicon Valley Campus, 3175 Bowers Avenue, Santa Clara, CA, 95054, United States
Join Dean PK Agarwal for this free online session. He’ll lead a forward-looking conversation on emerging job roles in tech, sustainability, health, and creative industries. Learn how industry convergence and global trends are shaping new career paths and the skills you’ll need to stay relevant.

Discover which industries are driving job creation and how roles are evolving across tech, sustainability, health, and the creative economy.
Understand the impact of global trends—like AI, climate change, and demographic shifts—on the future of work.
Identify the skills and mindsets that will help you stay competitive and adaptable in a rapidly changing landscape.

This session is part of Pathways to Professional Success, a new conversation series hosted by Dean P.K. Agarwal.

Claim your seat!

Embedded Systems Program Info Session
2025-12-04 18:00 - 19:00 | Silicon Valley Campus, 3175 Bowers Avenue, Santa Clara, CA, 95054, United States
Build Your Career in Embedded Systems
While hiring has slowed in some tech sectors, the demand for skilled Embedded Systems professionals continues to grow across industries.
At this free winter info session, you’ll learn about emerging roles in embedded technology and the essential skills that make your resume stand out. Discover how AI is being integrated into embedded systems—and how you can stay ahead of the curve with UCSC Silicon Valley Extension’s industry-aligned courses and expert instructors.
Featured Speaker:
Michael Wang, Chair of the UCSC Silicon Valley Extension Embedded Systems Certificate Program, will share insights on the evolving job market, key technical competencies, and strategies to advance your career.
This session will also highlight two upcoming Winter courses ideal for building your foundation or deepening your expertise in Embedded Systems.
This winter info session is sponsored by the UCSC Silicon Valley Extension Embedded Systems certificate program.

Register today.

Littschwager, N. (CSE) - A Proposal for Characterizing Replicated Systems and Emulators
2025-12-05 09:00 - 11:00
Simulation is a coinductive proof technique to assert the behavioral equivalence of computing systems that has seen fruitful application in distributed systems, concurrent process calculi, and programming languages, since the 1970’s. We have also utilized simulation in our prior work, where we formalized and proved a folklore claim that the state-based and operation-based approaches to Conflict-free Replicated Data Types (CRDTs) are ‘equivalent’ since they can ‘emulate each other’. More specifically, a CRDT system consists of a collection of nodes called replicas. Clients interact with individual replicas by querying or updating their state, and replicas interact by message passing over a network to eventually reach a convergent state. There are two main approaches to implementing a CRDT: operation-based, and state-based. We showed that the main state-based and operation-based approaches to CRDTs do indeed ‘emulate each other’ since one can exhibit a pair of weak simulations between the original type of CRDT, and its corresponding translation into the other type. We then leveraged the existence of these weak simulations to formally prove a ‘representation independence’ result, in the sense that when access to the CRDTs is mediated by an imperative programming language, the programmer cannot discern the underlying CRDT implementation by producing a program that terminates when run using one type of CRDT implementation, but not when run with the other.
Unfortunately, our results are impractical for the purpose of being reapplied to asserting the equivalence of other replicated systems, since the simulation relations (that one needs to exhibit in order to prove the necessary representation-independence) are non-modular, requiring the user to reason about the potential executions of their entire replicated system. Additionally, we observed that behavioral equivalence of state-based and operation-based CRDTs is a specific instance of the more general paradigm of ‘emulation’, which is the process by which an ‘emulator’ translates the behavior of one system into the behavior of a different system.
We propose to generalize the techniques of our prior work to be applicable for any pair of replicated systems, and correct the ‘non-modularity’ issue by decomposing the overall proof structure into compositional simulation proofs about the local behavior of a replica, and the behavior of the communication medium. Our second proposal comes from the observation that, to our knowledge, ‘emulation’ has not been given a formal and general mathematical semantic model that adequately captures the practical nuances faced by researchers and practitioners working on emulators. With that in mind, we propose a notion of a faithful emulator, inspired by the concept of a faithful functor 𝐹 ∶ C → D which lets us regard objects in C as ‘the same as’ the objects in D, but with additional structure.
Host: Nathan Littschwager, Ph.D. Student, Computer Science and Engineering
Advisor: Lindsey Kuper

DeGrendele, C. (AM) - Learning-Augmented and Structure-Preserving Methods for Conservation Law Solvers
2025-12-05 10:00 - 12:30 | Engineering 2, Engineering 2 1156 High Street, Santa Cruz, CA, 95064
In this work, we develop numerical methods for conservation laws that explore statistical, structure-preserving, and machine-learning-based approaches, each built on top of traditional numerical solvers. First, we develop a general Gaussian-process-based “recipe’’ for constructing high-order linear operators such as interpolation, reconstruction, and derivative approximations. Building on this recipe, we derive a kernel-agnostic convergence theory for GP-based operators that interprets them as generalized finite-difference schemes, defines an effective order-of-accuracy proxy that captures non-ideal truncation-error structure, and uses this metric to select stencil geometries and kernel hyperparameters analytically. We then introduce a new second-order kernel, Discontinuous Arcsin (DAS), that is stationary and prevents oscillations. DAS is integrated into a shock-capturing framework called the Multidimensional Optimal Order Detection (MOOD) method and shows an increase in efficiency by admitting less first order cascades. Next, we address the long-standing problem of spurious pressure oscillations in compressible multi-component and real-fluid simulations by introducing a fully conservative pressure-equilibrium-preserving scheme and a high-order fully conservative approximate variant that apply to arbitrary equations of state. Unlike existing approaches, these methods avoid non-conservative updates or EOS-specific constructions, and on smooth interface advection tests with ideal-gas, stiffened-gas, and van der Waals fluids they reduce spurious pressure oscillations by orders of magnitude relative to current schemes. We then propose a hybrid numerical–machine learning framework for mixed hyperbolic–parabolic systems in which only the diffusive contribution is learned while the hyperbolic fluxes are advanced with standard shock-capturing methods, enabling timesteps at a hyperbolic CFL. Within this framework, we compare several neural architectures and loss designs on viscous Burgers tests and on the one-dimensional Euler equations with heat conduction, showing that U-shaped neural operators combined with multi-step and TVD-style regularization improve long-time stability and spectral behavior, and we analyze the resulting coupled schemes via eigenvalue-based stability diagnostics. Finally, we apply high-order, shock-capturing finite-difference methods within NASA’s Launch Ascent and Vehicle Aerodynamics (LAVA) framework to quantify acoustic and pressure loads on the Artemis Mobile Launcher, including multiphase simulations of water-suppression systems and comparisons to flight data that inform hardware design for future missions. Collectively, this work offers a set of targeted advances in kernel-based numerical operators, conservative schemes and learning-augmented solvers each aimed at improving accuracy, stability, or efficiency in complex multiphysics flow simulation.
Event Host: Chris DeGrendele, Ph.D. Candidate, Applied Mathematics
Advisor: Dongwook Lee
Zoom- https://ucsc.zoom.us/j/96308438100?pwd=[REDACTED]
Passcode- 123456

Garg, S. (CSE) - MAPPING ANNOTATIONS FROM NETLIST TO SOURCE CODE
2025-12-05 13:00 - 14:00 | Engineering 2, Engineering 2 1156 High Street, Santa Cruz, CA, 95064
Hardware design flows have become increasingly complex as modern chips integrate billions
of transistors and rely on aggressive synthesis optimizations to meet performance,
area, and power targets. While these transformations improve circuit efficiency, they
also erase the correspondence between gate-level netlists and their originating HDL
source lines. The loss of traceability makes post-synthesis debugging, timing backannotation,
and root-cause analysis extremely difficult. Existing solutions depend on
tool-specific metadata or preserved signal names, which are often lost after flattening,
retiming, or logic restructuring.
To address this long-standing problem, this thesis presents SynAlign, a structural
alignment framework that restores the mapping between optimized netlists and
source code without relying on synthesis metadata. SynAlign treats both the reference
RTL and synthesized designs as graphs and iteratively aligns them using shared
structural cues—such as sequential boundaries, fan-in/fan-out relationships, and partial
naming patterns. The algorithm employs anchor-based seeding, multi-stage neighborhood
matching, and a lightweight scoring function to propagate correspondences
efficiently across large designs.
Extensive evaluation demonstrates that SynAlign achieves over 90% line-level
alignment accuracy across diverse designs, maintaining robustness even when 60% of
signal names are obfuscated or removed. The framework scales linearly with design size,
completing alignment on multi-million-node circuits within minutes. Controlled tests
confirmed structural stability under synthetic noise, while production-level validation
on real processor and accelerator modules verified industrial applicability.
By recovering structural visibility lost during synthesis, SynAlign bridges a
critical gap between front-end design intent and post-synthesis implementation. Its explainable
alignment enables faster debug cycles, more accurate timing correlation, and
provides a foundation for next-generation EDA tools that integrate traceability, optimization
transparency, and source-level introspection into the hardware development
process.
Host: Sakshi Garg, Ph.D. Candidate, Computer Science and Engineering
Advisor: Jose Renau
Zoom- https://ucsc.zoom.us/j/96207792766?pwd=[REDACTED]
Passcode- 669162

First Saturday Tour at the Arboretum
2025-12-06 11:00 - 12:00 | Arboretum, 122 Arboretum Road, Santa Cruz, CA, 95064
First Saturday Tours are a wonderful way to introduce yourself to the Arboretum or to deepen your knowledge of the Arboretum’s plant collections. Each tour is a little different depending on the time of year, the interests of the tour guide, and the people who join in. For example, you might learn about the birds and mammals that make this land their home or about the amazing physical adaptations that plants have evolved to better deal with our extreme weather and climate conditions. Tours are free with paid admission.

John O. Jordan: "Dickens and Soundscape: The Old Curiosity Shop"
2025-12-07 13:00 - 15:00 | CA
Please join the Dickens Project for the rescheduled Dickens Universe talk by John Jordan, Dickens Project Co-Founder and Co-Director. Delve into the sounds of The Old Curiosity Shop on Sunday, December 7, from 1:00-2:30 PM (Pacific time).
Critics have long recognized and commented on the striking visual quality of Dickens’s writing, including the ways in which his novels seem to have anticipated and even influenced the development of certain film techniques. With the exception of studies that focus on speech and voice, relatively little attention has been paid to Dickens’s representation of sound more generally. In this paper, Professor Jordan takes a sound studies approach to Dickens’s writing, focusing on The Old Curiosity Shop and examining the various uses to which sound is put in this exceptionally “noisy” book.
John O. Jordan is a research professor of literature at the University of California, Santa Cruz and the Co-Director of the Dickens Project. His primary research interests include Victorian literature and culture, Charles Dickens and narrative theory. John is the author of Supposing Bleak House and co-editor, with Robert Patten and Catherine Waters, of the Oxford Handbook of Charles Dickens.
Register for the talk on Zoom.

Jamilan, S. (CSE) - Profile-guided Compiler Optimizations for Data Center Workloads
2025-12-08 09:15 - 10:30 | Engineering 2, Engineering 2 1156 High Street, Santa Cruz, CA, 95064
Modern applications, such as data center workloads, have become increasingly complex. These applications primarily operate on massive datasets, which involve large memory footprints, irregular access patterns, and complex control and data flows. The processor-memory speed gap, combined with these complexities, can lead to unexpected performance inefficiencies in these applications, preventing them from achieving optimal performance. Considering the complexity and size of data center applications, manually identifying and resolving performance issues is often impractical or impossible. Instead, developing new compiler optimization techniques can be a more effective and scalable solution to boost both performance and energy efficiency. In this thesis, we focus on identifying the root causes that limit the performance of data center workloads. We analyze the limitations of current profile-guided compiler optimization techniques for addressing these performance gaps. Finally, we propose two profile-guided optimization techniques, APT-GET and RIFS, which can be integrated into the LLVM optimization pipeline to deliver further improvements. To hide the long latency of memory accesses, we introduce APT-GET, a profile-guided technique that ensures timely prefetches by leveraging dynamic execution-time information to build a novel analytical model that finds the optimal prefetch distance and injection site based on the collected profile. We study APT-GET across 10 real-world applications and demonstrate that it achieves a speedup of up to 1.98× and an average of 1.30×. To enable runtime value-invariant function specialization to reduce redundant operations, we introduce RIFS, a profile-guided compiler technique that specializes functions based on runtime-invariant call-site-specific argument values. RIFS introduces a novel value-profiling LLVM pass to identify runtime invariant arguments and a subsequent LLVM transformation pass to generate specialized function variants tailored to these value profiles. To efficiently select among potentially thousands of specialization candidates, we develop a predictive cost model that estimates each candidate’s performance benefit before code generation. RIFS achieves an average speedup of 5.3% and an instruction reduction of 2.5% over the LLVM -O3+PGO baseline across 12 real-world applications.
Host: Saba Jamilan, Ph.D. Candidate, Computer Science and Engineering
Advisor: Heiner Litz
Zoom- https://ucsc.zoom.us/j/95818759324?pwd=[REDACTED]
Passcode- 652917

CSE Colloquium: Making Systems Secure with Information Flow
2025-12-08 09:30 - 10:45 | Engineering 2, Engineering 2 1156 High Street, Santa Cruz, CA, 95064
Presenter: Andrew Myers, Cornell University

Abstract:
Modern civilization depends on complex, interconnected software systems that must safeguard trustworthy or private data. We have ever-growing mountains of code yet lack principled ways to build large systems that are secure. What is missing is a way to securely build these systems compositionally: module by module and layer by layer. Information flow control, enforced throughout software and hardware, offers a plausible way to achieve compositional security, and is increasingly being used by industry. I describe how my research group has incorporated information-flow security into various languages and systems: hardware architectures resilient to timing and speculation attacks, smart contracts, and automatically synthesized cryptographic and distributed protocols. Information flow is inherently compositional and makes possible strong, provable security guarantees that can be connected to cryptographic security definitions. Importantly, it also guides developers during the design process, exposing security-critical decisions up front.
Bio:
Andrew Myers is the Class of 1912 Professor of Engineering in the Department of Computer Science at Cornell University. He received his Ph.D. in Electrical Engineering and Computer Science from MIT, advised by Barbara Liskov. His research interests include programming languages, computer security, and distributed and persistent programming systems. His work on computer security has focused on practical, sound, expressive languages and systems for enforcing information security. Myers is an ACM Fellow and has authored several award-winning papers. He currently serves as the chair of the ACM SIGPLAN Executive Committee.
Hosted By: Professor Mohsen Lesani
Location: Engineering 2, E2-180
Zoom: https://ucsc.zoom.us/j/97682837116?pwd=[REDACTED]
