<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
  <channel>
    <docs>http://www.rssboard.org/rss-specification</docs>
    <atom:link rel="self" type="application/rss+xml" href="https://escholarship.org/uc/ics/rss"/>
    <ttl>720</ttl>
    <title>Recent ics items</title>
    <link>https://escholarship.org/uc/ics/rss</link>
    <description>Recent eScholarship items from Donald Bren School of Information and Computer Sciences</description>
    <pubDate>Fri, 15 May 2026 22:24:40 +0000</pubDate>
    <item>
      <title>Genetic Variation and Stroke Recovery: The STRONG Study</title>
      <link>https://escholarship.org/uc/item/8184b81p</link>
      <description>BACKGROUND: Genetic association studies can reveal biology and treatment targets but have received limited attention for stroke recovery. STRONG (Stroke, Stress, Rehabilitation, and Genetics) was a prospective, longitudinal (1-year), genetic study in adults with stroke at 28 US stroke centers. The primary aim was to examine the association that candidate genetic variants have with (1) motor/functional outcomes and (2) stress-related outcomes.
METHODS: For motor/functional end points, 3 candidate gene variants (ApoE ε4, BDNF [brain-derived neurotrophic factor], and a dopamine polygenic score) were analyzed for associations with change in grip strength (3 months-baseline), function (3-month Stroke Impact Scale-Activities of Daily Living), mood (3-month Patient Health Questionnaire-8), and cognition (12-month telephone-Montreal Cognitive Assessment). For stress-related outcomes, 7 variants (serotonin transporter gene-linked promoter region, ACE [angiotensin-converting enzyme], oxytocin...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8184b81p</guid>
      <pubDate>Tue, 12 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Cramer, Steven C</name>
      </author>
      <author>
        <name>Parodi, Livia</name>
      </author>
      <author>
        <name>Moslemi, Zahra</name>
      </author>
      <author>
        <name>Braun, Robynne G</name>
      </author>
      <author>
        <name>Aldridge, Chad M</name>
      </author>
      <author>
        <name>Shahbaba, Babak</name>
        <uri>https://orcid.org/0000-0002-8102-1609</uri>
      </author>
      <author>
        <name>Rosand, Jonathan</name>
      </author>
      <author>
        <name>Holman, E Alison</name>
        <uri>https://orcid.org/0000-0001-5076-8403</uri>
      </author>
      <author>
        <name>Shah, Shreyansh</name>
      </author>
      <author>
        <name>Griessenauer, Christoph J</name>
      </author>
      <author>
        <name>Patel, Nirav</name>
      </author>
      <author>
        <name>Anderson, Christopher</name>
      </author>
      <author>
        <name>Henry, Jonathan</name>
      </author>
      <author>
        <name>Kourkoulis, Christina</name>
      </author>
      <author>
        <name>Lin, David J</name>
      </author>
      <author>
        <name>Zaba, Natalie</name>
      </author>
      <author>
        <name>Gee, Joey</name>
      </author>
      <author>
        <name>Moon, Johnson</name>
      </author>
      <author>
        <name>Schwertfeger, Julie</name>
      </author>
      <author>
        <name>Jayaraman, Arun</name>
      </author>
      <author>
        <name>Lee, Robert</name>
      </author>
      <author>
        <name>Lansberg, Maarten G</name>
      </author>
      <author>
        <name>Kemp, Stephanie</name>
      </author>
      <author>
        <name>Huang, Emily</name>
      </author>
      <author>
        <name>Bingham, Elijah</name>
      </author>
      <author>
        <name>Lugo, Leonel</name>
      </author>
      <author>
        <name>Eun, Da Eun Katie</name>
      </author>
      <author>
        <name>Payne, Jeremy</name>
      </author>
      <author>
        <name>Patten, Carolynn</name>
        <uri>https://orcid.org/0000-0002-9948-0045</uri>
      </author>
      <author>
        <name>Ng, Kwan</name>
      </author>
      <author>
        <name>Cao, Madelyn</name>
      </author>
      <author>
        <name>Jubb, Ashley</name>
      </author>
      <author>
        <name>McGee, Breann</name>
      </author>
      <author>
        <name>Shahbaba, Ryan</name>
      </author>
      <author>
        <name>Agrawal, Kunal</name>
      </author>
      <author>
        <name>Kissela, Brett</name>
      </author>
      <author>
        <name>DeJong, Stacey</name>
      </author>
      <author>
        <name>Cole, John</name>
      </author>
      <author>
        <name>Silver, Brian</name>
      </author>
      <author>
        <name>Manxhari, Christina</name>
      </author>
      <author>
        <name>Cucchiara, Brett</name>
      </author>
      <author>
        <name>Busza, Ania</name>
      </author>
      <author>
        <name>Hepple, Jennifer Paige</name>
      </author>
      <author>
        <name>Liew, Sook-Lei</name>
      </author>
      <author>
        <name>Alderman, Susan</name>
      </author>
      <author>
        <name>Beauchamp, Jennifer</name>
      </author>
      <author>
        <name>Mathew, Nitha Joseph</name>
      </author>
      <author>
        <name>Hayes, Heather</name>
      </author>
      <author>
        <name>Majersik, Jennifer J</name>
      </author>
      <author>
        <name>Worrall, Bradford B</name>
      </author>
      <author>
        <name>Tirschwell, David</name>
      </author>
      <author>
        <name>Bushnell, Cheryl</name>
      </author>
      <author>
        <name>Husseini, Nada El</name>
      </author>
      <author>
        <name>Lee, Jin-Moo</name>
      </author>
      <author>
        <name>Falcone, Guido J</name>
      </author>
    </item>
    <item>
      <title>Neurodatascience: Past, Present, and Future</title>
      <link>https://escholarship.org/uc/item/9d3867jx</link>
      <description>The study of the brain is a compelling example of the power of convergent science. Over the last few decades, advances in neuroscience techniques and experimentation, as well as in data science tools to analyze the resulting data, have dramatically furthered our understanding of fundamental brain functions. Historically, it has been common for analytical approaches to have a considerable lag in development following the availability of new neuroscience techniques. However, this relationship has not simply been unidirectional, as there have been examples in which analytical developments have directly led to new scientific questions and experiments. Here we review how this interplay between neuroscience and data science advances has unfolded in the past and into the present, with a focus on electrophysiology and calcium imaging. Applying lessons learned from the past and present, we then discuss expected developments, challenges, and opportunities in the future. We end by providing...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/9d3867jx</guid>
      <pubDate>Thu, 7 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Cooper, Keiland W</name>
      </author>
      <author>
        <name>Shahbaba, Babak</name>
        <uri>https://orcid.org/0000-0002-8102-1609</uri>
      </author>
      <author>
        <name>Fortin, Norbert J</name>
        <uri>https://orcid.org/0000-0002-6793-6984</uri>
      </author>
    </item>
    <item>
      <title>Hippocampal ensembles represent sequential relationships among discrete nonspatial events</title>
      <link>https://escholarship.org/uc/item/93c9q82h</link>
      <description>ABSTRACT The hippocampus is critical to the temporal organization of our experiences, including the ability to remember past event sequences and predict future ones. Although this fundamental capacity is conserved across modalities and species, its underlying neuronal mechanisms remain poorly understood. Here we recorded hippocampal ensemble activity as rats remembered a sequence of nonspatial events (5 odor presentations unfolding over several seconds), using a task with established parallels in humans. Using novel statistical methods and deep learning techniques, we then identified new forms of sequential organization in hippocampal activity linked with task performance. We discovered that sequential firing fields (“time cells”) provided temporal information within and across events in the sequence, and that distinct types of task-critical information (stimulus identity, temporal order, and trial outcome) were also sequentially differentiated within event presentations. Finally,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/93c9q82h</guid>
      <pubDate>Thu, 7 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Shahbaba, Babak</name>
        <uri>https://orcid.org/0000-0002-8102-1609</uri>
      </author>
      <author>
        <name>Li, Lingge</name>
      </author>
      <author>
        <name>Agostinelli, Forest</name>
      </author>
      <author>
        <name>Saraf, Mansi</name>
      </author>
      <author>
        <name>Elias, Gabriel A</name>
      </author>
      <author>
        <name>Baldi, Pierre</name>
        <uri>https://orcid.org/0000-0003-0636-7930</uri>
      </author>
      <author>
        <name>Fortin, Norbert J</name>
        <uri>https://orcid.org/0000-0002-6793-6984</uri>
      </author>
    </item>
    <item>
      <title>Modeling Local Field Potentials with Regularized Matrix Data Clustering</title>
      <link>https://escholarship.org/uc/item/5vx0v6rv</link>
      <description>In this paper, we propose a novel regularized mixture model for clustering matrix-valued image data. The new framework introduces a sparsity structure (e.g., low rank, spatial sparsity) and separable covariance structure motivated by scientific interpretability. We formulate the problem as a fi-nite mixture model of matrix-normal distributions with regularization terms, and then develop an Expectation-Maximization-type of algorithm for efficient computation. Simulation results and analysis on brain signals show the excellent performance of the proposed method in terms of a better prediction accuracy than the competitors and the scientific interpretability of the solution.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5vx0v6rv</guid>
      <pubDate>Thu, 7 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Gao, Xu</name>
      </author>
      <author>
        <name>Shen, Weining</name>
        <uri>https://orcid.org/0000-0003-3137-1085</uri>
      </author>
      <author>
        <name>Hu, Jianhua</name>
      </author>
      <author>
        <name>Fortin, Norbert</name>
        <uri>https://orcid.org/0000-0002-6793-6984</uri>
      </author>
      <author>
        <name>Ombao, Hernando</name>
      </author>
    </item>
    <item>
      <title>Unity by Diversity: Improved Representation Learning for Multimodal VAEs</title>
      <link>https://escholarship.org/uc/item/5vb1n9mb</link>
      <description>Variational Autoencoders for multimodal data hold promise for many tasks in data analysis, such as representation learning, conditional generation, and imputation. Current architectures either share the encoder output, decoder input, or both across modalities to learn a shared representation. Such architectures impose hard constraints on the model. In this work, we show that a better latent representation can be obtained by replacing these hard constraints with a soft constraint. We propose a new mixture-of-experts prior, softly guiding each modality's latent representation towards a shared aggregate posterior. This approach results in a superior latent representation and allows each encoding to preserve information better from its uncompressed original features. In extensive experiments on multiple benchmark datasets and two challenging real-world datasets, we show improved learned latent representations and imputation of missing data modalities compared to existing methods.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5vb1n9mb</guid>
      <pubDate>Thu, 7 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Sutter, TM</name>
      </author>
      <author>
        <name>Meng, Y</name>
      </author>
      <author>
        <name>Agostini, A</name>
      </author>
      <author>
        <name>Chopard, D</name>
      </author>
      <author>
        <name>Fortin, N</name>
      </author>
      <author>
        <name>Vogt, JE</name>
      </author>
      <author>
        <name>Shahbaba, B</name>
        <uri>https://orcid.org/0000-0002-8102-1609</uri>
      </author>
      <author>
        <name>Mandt, S</name>
      </author>
    </item>
    <item>
      <title>A Model-Agnostic Graph Neural Network for Integrating Local and Global Information</title>
      <link>https://escholarship.org/uc/item/54c5s9m8</link>
      <description>Graph Neural Networks (GNNs) have achieved promising performance in a variety of graph-focused tasks. Despite their success, however, existing GNNs suffer from two significant limitations: a lack of interpretability in their results due to their black-box nature, and an inability to learn representations of varying orders. To tackle these issues, we propose a novel &lt;b&gt;M&lt;/b&gt;odel-&lt;b&gt;a&lt;/b&gt;gnostic &lt;b&gt;G&lt;/b&gt;raph Neural &lt;b&gt;Net&lt;/b&gt;work (MaGNet) framework, which is able to effectively integrate information of various orders, extract knowledge from high-order neighbors, and provide meaningful and interpretable results by identifying influential compact graph structures. In particular, MaGNet consists of two components: an estimation model for the latent representation of complex relationships under graph topology, and an interpretation model that identifies influential nodes, edges, and node features. Theoretically, we establish the generalization error bound for MaGNet via empirical Rademacher...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/54c5s9m8</guid>
      <pubDate>Thu, 7 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Zhou, Wenzhuo</name>
      </author>
      <author>
        <name>Qu, Annie</name>
      </author>
      <author>
        <name>Cooper, Keiland W</name>
      </author>
      <author>
        <name>Fortin, Norbert</name>
        <uri>https://orcid.org/0000-0002-6793-6984</uri>
      </author>
      <author>
        <name>Shahbaba, Babak</name>
        <uri>https://orcid.org/0000-0002-8102-1609</uri>
      </author>
    </item>
    <item>
      <title>A scalable reinforcement learning framework inspired by hippocampal memory mechanisms for efficient contextual and sequential decision making</title>
      <link>https://escholarship.org/uc/item/4zm8452k</link>
      <description>Efficient decision-making in context-dependent, sequential tasks remains a fundamental challenge in reinforcement learning (RL). Inspired by the function of the brain’s hippocampal system, we introduce Hippocampal-Augmented Memory Integration (HAMI), a biologically inspired memory-based RL framework that leverages symbolic indexing, hierarchical memory refinement, and structured episodic retrieval to enhance both learning efficiency and adaptability. We also propose Hierarchical Contextual Sequences (HiCoS), a structured RL environment grounded in neuroscience studies on episodic and sequence memory and context-driven decision-making, which serves as a controlled testbed for evaluating biologically inspired memory-based decision-making systems. Our experimental results demonstrate that HAMI achieves high decision accuracy and improved sample efficiency while maintaining low memory utilization. HAMI’s architecture exhibits significantly lower inference latency than baseline memory-based...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4zm8452k</guid>
      <pubDate>Thu, 7 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Poursiami, Hamed</name>
      </author>
      <author>
        <name>Moshruba, Ayana</name>
      </author>
      <author>
        <name>Cooper, Keiland W</name>
      </author>
      <author>
        <name>Gobin, Derek</name>
      </author>
      <author>
        <name>Kaiser, Md Abdullah-Al</name>
      </author>
      <author>
        <name>Singh, Ankur</name>
      </author>
      <author>
        <name>Noor, Rouhan</name>
      </author>
      <author>
        <name>Shahbaba, Babak</name>
        <uri>https://orcid.org/0000-0002-8102-1609</uri>
      </author>
      <author>
        <name>Jaiswal, Akhilesh</name>
      </author>
      <author>
        <name>Fortin, Norbert J</name>
        <uri>https://orcid.org/0000-0002-6793-6984</uri>
      </author>
      <author>
        <name>Parsa, Maryam</name>
      </author>
    </item>
    <item>
      <title>Optimal Transport based Cross-Domain Integration for Heterogeneous Data</title>
      <link>https://escholarship.org/uc/item/47t8571q</link>
      <description>Detecting dynamic patterns shared across heterogeneous datasets is a critical yet challenging task in many scientific domains, particularly within the biomedical sciences. Systematic heterogeneity inherent in diverse data sources can significantly hinder the effectiveness of existing machine learning methods in uncovering shared underlying dynamics. Additionally, practical and technical constraints in real-world experimental designs often limit data collection to only a small number of subjects, even when rich, time-dependent measurements are available for each individual. These limited sample sizes further diminish the power to detect common dynamic patterns across subjects. In this article, we propose a novel heterogeneous data integration framework based on optimal transport to extract shared patterns in the conditional mean dynamics of target responses. The key advantage of the proposed method is its ability to enhance discriminative power by reducing heterogeneity unrelated...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/47t8571q</guid>
      <pubDate>Thu, 7 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Yuan, Yubai</name>
      </author>
      <author>
        <name>Zhang, Yijiao</name>
      </author>
      <author>
        <name>Shahbaba, Babak</name>
        <uri>https://orcid.org/0000-0002-8102-1609</uri>
      </author>
      <author>
        <name>Fortin, Norbert</name>
        <uri>https://orcid.org/0000-0002-6793-6984</uri>
      </author>
      <author>
        <name>Cooper, Keiland</name>
      </author>
      <author>
        <name>Nie, Qing</name>
        <uri>https://orcid.org/0000-0002-8804-3368</uri>
      </author>
      <author>
        <name>Qu, Annie</name>
      </author>
    </item>
    <item>
      <title>STABLE-MATCHING VORONOI DIAGRAMS: COMBINATORIAL COMPLEXITY AND ALGORITHMS</title>
      <link>https://escholarship.org/uc/item/7mp39529</link>
      <description>We study algorithms and combinatorial complexity bounds for stable-matching Voronoi diagrams, where a set, S, of n point sites in the plane determines a stable matching between the points in R&lt;sup&gt;2&lt;/sup&gt; and the sites in S such that (i) the points prefer sites closer to them and sites prefer points closer to them, and (ii) each site has a quota or "appetite" indicating the area of the set of points that can be matched to it. Thus, a stable-matching Voronoi diagram is a solution to the well-known post office problem with the added (realistic) constraint that each post office has a limit on the size of its jurisdiction. Previous work on the stable-matching Voronoi diagram provided existence and uniqueness proofs, but did not analyze its combinatorial or algorithmic complexity. In this paper, we show that a stable-matching Voronoi diagram of n point sites has O(n&lt;sup&gt;2+ε&lt;/sup&gt;) faces and edges, for any ε &amp;gt; 0, and show that this bound is almost tight by giving a family of diagrams...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7mp39529</guid>
      <pubDate>Wed, 6 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Barequet, Gill</name>
      </author>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Goodrich, Michael</name>
      </author>
      <author>
        <name>Mamano, Nil</name>
      </author>
    </item>
    <item>
      <title>Folding a paper strip to minimize thickness</title>
      <link>https://escholarship.org/uc/item/6xb4c6c8</link>
      <description>In this paper, we study how to fold a specified origami crease pattern in order to minimize the impact of paper thickness. Specifically, origami designs are often expressed by a mountain–valley pattern (plane graph of creases with relative fold orientations), but in general this specification is consistent with exponentially many possible folded states. We analyze the complexity of finding the best consistent folded state according to two metrics: minimizing the total number of layers in the folded state (so that a “flat folding” is indeed close to flat), and minimizing the total amount of paper required to execute the folding (where “thicker” creases consume more paper). We prove both problems strongly NP-complete even for 1D folding. On the other hand, we prove both problems fixed-parameter tractable in 1D with respect to the number of layers.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6xb4c6c8</guid>
      <pubDate>Wed, 6 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Demaine, Erik D</name>
      </author>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Hesterberg, Adam</name>
      </author>
      <author>
        <name>Ito, Hiro</name>
      </author>
      <author>
        <name>Lubiw, Anna</name>
      </author>
      <author>
        <name>Uehara, Ryuhei</name>
      </author>
      <author>
        <name>Uno, Yushi</name>
      </author>
    </item>
    <item>
      <title>NON-EUCLIDEAN ERDŐS-ANNING THEOREMS</title>
      <link>https://escholarship.org/uc/item/47n916hw</link>
      <description>NON-EUCLIDEAN ERDŐS-ANNING THEOREMS</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/47n916hw</guid>
      <pubDate>Wed, 6 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
    </item>
    <item>
      <title>Shaping HCI Research for Children's Care Ecosystem Involvement</title>
      <link>https://escholarship.org/uc/item/45x6w8q7</link>
      <description>Recent HCI research emphasizes the importance of considering children’s care ecosystems in the design of technologies, extending the focus beyond families to include teachers, peers, therapists, and institutions. While this ecosystem perspective opens opportunities for more inclusive and collaborative technologies, it also introduces challenges such as recruitment, power dynamics, reconciling diverse perspectives, and complex ethical considerations. This CHI 2026 workshop builds on prior community efforts at IDC 2023, CHI 2024, and IDC 2025. Its primary focus is on children’s care ecosystems, but we also welcome researchers working with other populations who wish to apply an ecosystem lens. The workshop will bring together researchers and practitioners to discuss opportunities, challenges, and methods, and to collaboratively articulate a research agenda for care ecosystem-centered HCI. Participants will engage in mapping and synthesis activities that produce care ecosystem maps...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/45x6w8q7</guid>
      <pubDate>Wed, 6 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Stefanidi, Evropi</name>
      </author>
      <author>
        <name>Silva, Lucas M</name>
      </author>
      <author>
        <name>Cagiltay, Bengisu</name>
      </author>
      <author>
        <name>Min, Aehong</name>
        <uri>https://orcid.org/0000-0002-3790-2126</uri>
      </author>
      <author>
        <name>Eriksson, Eva</name>
      </author>
      <author>
        <name>Hayes, Gillian R</name>
      </author>
    </item>
    <item>
      <title>FamilyBloom: Examining Ecologies of Collaboration in Family-Centered Health Tracking</title>
      <link>https://escholarship.org/uc/item/2hs1f70b</link>
      <description>Family health informatics tools can help support well-being with shared data tracking. Prior work typically focused on shared data review, but often in specific moments, like bedtime, or centered on caregiving of children or elderly members. To investigate how tracking can support mutual health collaboration between family members pervasively across daily contexts, we designed and deployed FamilyBloom, a glanceable smartwatch and home display system for mood and goal tracking. Twelve families with both neurotypical and ADHD members used FamilyBloom for three months on average. Our findings reveal how family-centered tracking created collaboration opportunities and tensions across multiple ecological systems: individual self-regulation, collaborations within family dynamics, involvement of care networks with varying trust levels, institutional school constraints and cultural stigma, and temporality of regular routines and crisis periods. We discuss an ecosystem-aware approach to...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2hs1f70b</guid>
      <pubDate>Wed, 6 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Silva, Lucas M</name>
      </author>
      <author>
        <name>Min, Aehong</name>
        <uri>https://orcid.org/0000-0002-3790-2126</uri>
      </author>
      <author>
        <name>Stefanidi, Evropi</name>
      </author>
      <author>
        <name>Cibrian, Franceli L</name>
      </author>
      <author>
        <name>Beltran, Jesus A</name>
      </author>
      <author>
        <name>Zeiler, Cassie</name>
      </author>
      <author>
        <name>Schuck, Sabrina</name>
      </author>
      <author>
        <name>Lakes, Kimberley D</name>
      </author>
      <author>
        <name>Hayes, Gillian R</name>
      </author>
      <author>
        <name>Epstein, Daniel A</name>
        <uri>https://orcid.org/0000-0002-2657-6345</uri>
      </author>
    </item>
    <item>
      <title>Collaboration and Assistive Technology: Facilitating Joint Awareness for Noise Sensitivity</title>
      <link>https://escholarship.org/uc/item/2cr472z8</link>
      <description>Existing research has explored various methods to support people with noise sensitivity (PWNS), from desensitization therapies to technological solutions. However, there is a gap in systems that identify and monitor characteristics of noise sensitivity experiences to help PWNS and their companions better understand their condition and make informed management decisions. To fill this gap, we developed AudioBuddy, an app with sensing and tracking features designed to promote awareness between PWNS and their companions. We tested AudioBuddy as a technological probe over a two-week field deployment. Our results show that AudioBuddy can support awareness of how sounds and environments influence the psychophysiological states of PWNS, aiding in understanding noise sensitivity experiences. Nonetheless, technical limitations impacted the depth of awareness participants could attain. We discuss challenges and opportunities for future systems to facilitate awareness among PWNS and their...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2cr472z8</guid>
      <pubDate>Wed, 6 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Hicks, Emani</name>
      </author>
      <author>
        <name>Rieffel, Luc</name>
      </author>
      <author>
        <name>Gowda, Ariya</name>
      </author>
      <author>
        <name>Min, Aehong</name>
        <uri>https://orcid.org/0000-0002-3790-2126</uri>
      </author>
      <author>
        <name>Hayes, Gillian R</name>
      </author>
    </item>
    <item>
      <title>Efficacy of Full-Packet Encryption in Mitigating Protocol Detection for Evasive VPNs</title>
      <link>https://escholarship.org/uc/item/2781r51d</link>
      <description>Full-packet encryption is a technique used by modern evasive Virtual Private Networks (VPNs) to avoid protocol-based flagging from censorship models by disguising their traffic as random noise on the network. Traditional methods for censoring full-packet-encryption based VPN protocols requires assuming a substantial amount of collateral damage, as other non-VPN network traffic that appears random will be blocked. We tested several machine learning-based classification models against the Aggressive Circumvention of Censorship (ACC) protocol, a fully-encrypted evasive VPN protocol which merges strategies from a wide variety of currently in-use evasive VPN protocols. Our testing found that while ACC was able to survive our models when compared to random noise, it was easily detectable with minimal collateral damage using several different machine learning models when within a stream of regular network traffic. While resistant to the current techniques deployed by nation-state censors,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2781r51d</guid>
      <pubDate>Wed, 6 May 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Parker, Amy I</name>
      </author>
    </item>
    <item>
      <title>Towards Verifying Crash Consistency</title>
      <link>https://escholarship.org/uc/item/94b298fs</link>
      <description>Compute Express Link (CXL) memory sharing, persistent memory, and other related technologies allow data to survive crash events. A key challenge is ensuring that data is consistent after crashes such that it can be safely accessed. While there has been much work on bug-finding tools for persistent memory programs, these tools cannot guarantee that a program is crash-consistent. In this paper, we present a language, CrashLang, and its type system, that together guarantee that well-typed data structure implementations written in CrashLang are crash-consistent. CrashLang leverages the well-known commit-store pattern in which a single store logically commits an entire data structure operation. In this paper, we prove that well-typed CrashLang programs are crash-consistent, and provide a prototype implementation of the CrashLang compiler. We have evaluated CrashLang on five benchmarks: the Harris linked list, the Treiber stack, the Michael–Scott queue, a Read-Copy-Update binary search...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/94b298fs</guid>
      <pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Lee, Keonho</name>
      </author>
      <author>
        <name>Truong, Conan</name>
      </author>
      <author>
        <name>Demsky, Brian</name>
      </author>
    </item>
    <item>
      <title>Automated Insertion of Flushes and Fences for Persistency</title>
      <link>https://escholarship.org/uc/item/5pw0t40p</link>
      <description>CXL shared memory and persistent memory allow the contents of memory to persist beyond crashes. Stores to persistent or CXL memory are typically not immediately made persistent; developers must manually flush the corresponding cache lines to force the data to be written to the underlying storage. Correctly using flush and fence operations is known to be challenging. While state-of-the-art tools can find missing flush instructions, they often require bug-revealing test cases. No existing tools can ensure the absence of missing flush bugs. In this paper, we present PMRobust, a compiler that automatically inserts flush and fence operations to ensure that code using persistent memory is free from missing flush and fence bugs. PMRobust employs a novel static analysis with optimizations that target newly allocated objects. We have evaluated PMRobust on persistent memory libraries and several persistent memory data structures and measured a geometric mean overhead of 0.26% relative to...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5pw0t40p</guid>
      <pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Guo, Yutong</name>
      </author>
      <author>
        <name>Luo, Weiyu</name>
      </author>
      <author>
        <name>Demsky, Brian</name>
      </author>
    </item>
    <item>
      <title>Understanding the Perspectives of Autistic Gamers through an Online Autistic Community and a Survey</title>
      <link>https://escholarship.org/uc/item/2qr8z5d0</link>
      <description>Autistic people often have an interest in and spend a substantial amount of time engaged with video games. Games can be supportive of their mental health and social needs and have been widely used for behavioral interventions among autistic people. However, the gaming experiences and preferences of autistic people themselves have not been thoroughly studied. To explore these experiences, we used a multi-method approach, analyzing game-related posts from a large autism-related subreddit and conducting a survey with 145 autistic people. The survey allowed us to further understand preferences around accessibility and sensory experiences, representation, and social experiences in communities that emerged in the Reddit posts. We found that games offering a sense of freedom, control, and creativity might be particularly appealing to autistic gamers. Discussions also emerged around what types of audio and visual sensory input were considered soothing and appropriate. Moreover, both the...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2qr8z5d0</guid>
      <pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Park, Sohyeon</name>
      </author>
      <author>
        <name>Min, Aehong</name>
        <uri>https://orcid.org/0000-0002-3790-2126</uri>
      </author>
      <author>
        <name>Piper, Anne Marie</name>
      </author>
      <author>
        <name>Hayes, Gillian R</name>
      </author>
    </item>
    <item>
      <title>DermaVision</title>
      <link>https://escholarship.org/uc/item/8mz35921</link>
      <description>Approximately 10 million people in the United States suffer from domestic violence annually, with 4 out of 10 cases affecting people of color. Traditional coloration guides remain the primary forensic strategy to evaluate bruise injuries, which are highly subjective and inaccurate for monitoring bruises. Additionally, this approach fails to consider bruise pigmentation in darker skin tones, and the results of this qualitative method vary by the medical professional conducting the inspection. There is a need for reliable, quantitative bruise information across all skin tones that can be utilized in both medicine and justice. DermaVision aims to address this need by designing a portable multi-spectral camera to quantitatively analyze bruises in diverse skin tones. By correlating the reflective spectra of a bruise with its age and healing progression, our camera will provide an accurate timeline for when bruises occur irrespective of patients’ skin color. This technology will assist...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8mz35921</guid>
      <pubDate>Wed, 15 Apr 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Frazeur, Mitchell</name>
      </author>
      <author>
        <name>Reyes, Alejandra</name>
      </author>
      <author>
        <name>Im, Ashley</name>
      </author>
      <author>
        <name>Ngo, Hao</name>
      </author>
      <author>
        <name>Ly, Christine</name>
      </author>
      <author>
        <name>Lo, Matthew</name>
      </author>
      <author>
        <name>Lee, Gerald</name>
      </author>
      <author>
        <name>Jimenez, Siana</name>
      </author>
      <author>
        <name>Nutz, Derek</name>
      </author>
      <author>
        <name>Chei, Joseph</name>
      </author>
      <author>
        <name>Arias, Jazmin</name>
      </author>
      <author>
        <name>Lam, Jessica</name>
      </author>
    </item>
    <item>
      <title>HyperXite 9</title>
      <link>https://escholarship.org/uc/item/532817sx</link>
      <description>The overall objective for HyperXite 9 was to design and build a more robust, and reliable pod, capable of proving the feasibility of a high-speed transportation system. We are working to improve a linear induction motor as the pod's propulsion system. We are also designing and implementing a thermal cooling system to actively dissipate the heat generated by this propulsion system. Our team is comprised of the following 7 subteams: Static Structures, Braking &amp;amp; Pneumatics, Dynamic Structures, Propulsion, Power Systems, Control Systems, and Outreach.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/532817sx</guid>
      <pubDate>Wed, 15 Apr 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Antony, Jacob</name>
      </author>
      <author>
        <name>Chin, Anthony</name>
      </author>
      <author>
        <name>Whaley, Christopher</name>
      </author>
      <author>
        <name>Hsing, Allen</name>
      </author>
      <author>
        <name>Eslava, Aaron</name>
      </author>
      <author>
        <name>Trauger, Andrew</name>
      </author>
      <author>
        <name>Diaz, Angel</name>
      </author>
      <author>
        <name>Licos, Angelina</name>
      </author>
      <author>
        <name>Chau, Brian</name>
      </author>
      <author>
        <name>Chung, Brigitte</name>
      </author>
      <author>
        <name>Kang, Calvin</name>
      </author>
      <author>
        <name>Parker, Crew</name>
      </author>
      <author>
        <name>Pena, Daniel</name>
      </author>
      <author>
        <name>Kim, Dillon</name>
      </author>
      <author>
        <name>Li, Harbour</name>
      </author>
      <author>
        <name>Ng, Jefferson</name>
      </author>
      <author>
        <name>Nguyen, Joshua</name>
      </author>
      <author>
        <name>Nguyen, Kaitlyn</name>
      </author>
      <author>
        <name>Haddad, Marc</name>
      </author>
      <author>
        <name>Stark, Max</name>
      </author>
      <author>
        <name>Veloya, Nicol</name>
      </author>
      <author>
        <name>Koo, Rachael</name>
      </author>
      <author>
        <name>Goja, Riya</name>
      </author>
      <author>
        <name>Mawlawi, Ryan</name>
      </author>
      <author>
        <name>Quach, Ryan</name>
      </author>
      <author>
        <name>Scholin, Rye</name>
      </author>
      <author>
        <name>Der, Sam</name>
      </author>
      <author>
        <name>Mehra, Syona</name>
      </author>
      <author>
        <name>Hwang, Taesung</name>
      </author>
      <author>
        <name>Ngo, Timothy</name>
      </author>
      <author>
        <name>Anand, Vrushang</name>
      </author>
      <author>
        <name>Ning, Oscar</name>
      </author>
      <author>
        <name>Solorzano, Diego</name>
      </author>
      <author>
        <name>Nomura, Kaydi</name>
      </author>
      <author>
        <name>Ko, Michelle</name>
      </author>
    </item>
    <item>
      <title>Biometric Advanced Driver Assistance System (ADAS)</title>
      <link>https://escholarship.org/uc/item/3vk1x6p6</link>
      <description>This project focuses on the development of a human-aware advanced driver assistance system (ADAS) that helps promote safe driving based on a driver's biometrics and driving behavior. The system uses biometric signals from the driver using BioHarness Belt and Galvanic Skin Response (GSR) sensors to monitor the driver's heart rate, breathing rate, ECG and GSR signals. These sensory information are then analyzed by machine learning models to determine whether the driver is stressed or drowsy. The project extended the current state-of-the-art driving simulator CARLA to not only include the driver's brake intensity,  speed, throttle and steering but also the driver's biometric state. The vehicle controls and biometrics are then plotted and analyzed for correlations that could imply a driver is driving aggressively, assertively, or defensively. Based on these correlations, the driver will be displayed a warning on the simulation which advises them to drive carefully. The output from...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3vk1x6p6</guid>
      <pubDate>Wed, 15 Apr 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Bayoumi, Ismail</name>
      </author>
      <author>
        <name>Tirumala, Rithvik</name>
      </author>
      <author>
        <name>Rodriguez, Citlali</name>
      </author>
    </item>
    <item>
      <title>2025 UCI CanSat Annual Design Review Poster</title>
      <link>https://escholarship.org/uc/item/1mn1h6px</link>
      <description>The UCI CanSat team is a senior design team that competes in the international CanSat competition, an annual design-build-launch competition held by the American Astronautical Society focused on space-type systems. Each year, a ten-person team designs a “CanSat,” following competition requirements. This year, the CanSat is required to operate in 4 main phases: ascent, apogee, descent, and landing. During ascent, the CanSat must act as the nose cone of the rocket. At apogee, an ejection charge releases the CanSat from the rocket, and the CanSat must activate a parachute to begin a safe descent. At three-quarters of the peak altitude, the CanSat must deploy its payload. The payload consists of two cameras, one to film payload deployment, while the other is spin-stabilized to film the north side of the CanSat. In addition, while the container descends with a parachute, the payload must descend with an auto-gyro system. The auto-gyro system must significantly decrease the descent...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1mn1h6px</guid>
      <pubDate>Wed, 15 Apr 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Nguyen, Carolynn</name>
      </author>
      <author>
        <name>Otsuka, Kaitlin</name>
      </author>
      <author>
        <name>Kim, Kaylee</name>
      </author>
      <author>
        <name>Gupta, Khushi</name>
      </author>
      <author>
        <name>Ho, Sarah</name>
      </author>
      <author>
        <name>Cason, Brady</name>
      </author>
      <author>
        <name>Ruan, Zhanhao</name>
      </author>
      <author>
        <name>Yoon, Diane</name>
      </author>
      <author>
        <name>Darjuan, Andrei</name>
      </author>
      <author>
        <name>Fajarito, Naethan</name>
      </author>
      <author>
        <name>Yee, Timothy</name>
      </author>
      <author>
        <name>Jing, Felix</name>
      </author>
    </item>
    <item>
      <title>The effectiveness of participatory near-peer digital media literacy interventions</title>
      <link>https://escholarship.org/uc/item/0xm1f4mk</link>
      <description>The impacts of digital media literacy (DML) interventions are mixed, perhaps due to adult-driven curricula and misalignment with youth’s needs. We tested how student-led, developmentally-informed DML education could leverage youth’s expertise. Using Youth Participatory Action Research and near-peer mentoring, high school students (n = 31) designed and taught digital literacy interventions in two areas (1) digital communication (i.e. group-chats) and (2) persuasive design (e.g. features such as infinite scroll), resulting in significant increases in knowledge of digital communication conflict prevention and remediation strategies, along with identification and knowledge of persuasive design for 79 middle and 31 high school students. High schoolers also reported more feelings of agency and research knowledge. These findings indicate that making DML interventions developmentally aligned might be key for supporting youth in the digital age.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0xm1f4mk</guid>
      <pubDate>Wed, 15 Apr 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Dingle, Kyra</name>
      </author>
      <author>
        <name>Reich, Stephanie M</name>
        <uri>https://orcid.org/0000-0002-8799-5236</uri>
      </author>
      <author>
        <name>Starks, Allison</name>
      </author>
      <author>
        <name>Harel-Marian, Taly</name>
      </author>
    </item>
    <item>
      <title>Summary the Savior: Harmful Keyword and Query-based Summarization for LLM Jailbreak Defense</title>
      <link>https://escholarship.org/uc/item/4qk7v7jv</link>
      <description>Summary the Savior: Harmful Keyword and Query-based Summarization for LLM Jailbreak Defense</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4qk7v7jv</guid>
      <pubDate>Wed, 8 Apr 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Rahman, Shagoto</name>
      </author>
      <author>
        <name>Harris, Ian</name>
      </author>
    </item>
    <item>
      <title>Evaluating the potential of acupuncture for Alzheimer’s disease treatment: A meta-analysis and systematic review of mouse model studies</title>
      <link>https://escholarship.org/uc/item/0sd9c8sj</link>
      <description>Acupuncture is an ancient practice that was developed within the framework of traditional Chinese medicine. While acupuncture has been recently proposed as a therapy for Alzheimer’s disease (AD), acupuncture effects are not well understood in terms of neural mechanisms. Here, we review and examine the studies that used AD mouse models and analyze the experiments where researchers administered electroacupuncture (EA) to AD mice to assess the potential therapeutic impact of acupuncture on disease pathology and cognitive function in controlled laboratory settings. We analyzed 29 relevant PubMed articles published between January 2014 and July 2025. Our results reveal that EA significantly reduces both amyloid-beta (Aβ) and phosphorylated tau (p-tau) levels and neuroinflammatory biomarkers, including molecular signatures for activated microglia and astrocytes in the brain. EA also enhances cognitive functions. While no study directly compared acupoint strategies, the indirect comparisons...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0sd9c8sj</guid>
      <pubDate>Wed, 8 Apr 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Yang, Mohan</name>
      </author>
      <author>
        <name>Tong, Liqi</name>
      </author>
      <author>
        <name>Guo, Zhiling</name>
      </author>
      <author>
        <name>Tan, Zhiqun</name>
      </author>
      <author>
        <name>Holmes, Todd C</name>
      </author>
      <author>
        <name>Yu, Zhaoxia</name>
        <uri>https://orcid.org/0000-0001-9700-1795</uri>
      </author>
      <author>
        <name>Xu, Xiangmin</name>
        <uri>https://orcid.org/0000-0002-5828-1533</uri>
      </author>
    </item>
    <item>
      <title>Video Games and Learning</title>
      <link>https://escholarship.org/uc/item/9nt4d05x</link>
      <description>The interdisciplinary field of the learning sciences encompasses educational psychology, cognitive science, computer science, and anthropology, among other disciplines. The Cambridge Handbook of the Learning Sciences, first published in 2006, is the definitive introduction to this innovative approach to teaching, learning, and educational technology. In this significantly revised third edition, leading scholars incorporate the latest research to provide seminal overviews of the field. This research is essential in developing effective innovations that enhance student learning - including how to write textbooks, design educational software, prepare effective teachers, and organize classrooms. The chapters illustrate the importance of creating productive learning environments both inside and outside school, including after school clubs, libraries, and museums. The Handbook has proven to be an essential resource for graduate students, researchers, consultants, software designers,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/9nt4d05x</guid>
      <pubDate>Mon, 30 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Steinkuehler, Constance</name>
      </author>
      <author>
        <name>Squire, Kurt</name>
      </author>
    </item>
    <item>
      <title>Situating Big Data</title>
      <link>https://escholarship.org/uc/item/5vq5065q</link>
      <description>Lacking a digital crystal ball, we cannot predict the future of education or the precise instructional role games will have going forward. Yet we can safely say that games will play some role in the future of K-12 and higher education, and members of the games community will have to choose between being passive observers or active, progressive contributors to the complex and often political process of weaving together pedagogy, technology, and culture. This will involve agreeing that games—or, more specifically, game mechanics and the engagement in joyful learning that they engender—are not only critical for shaping online and classroom instruction but also the evolution of schooling as a whole. Likewise, it will involve a hard push beyond questions like “Are video games ‘good’ or ‘bad’ for education?” and “Are games ‘better’ for all students than traditional face-to-face teaching” to unpack how game experiences vary with individual learner goals as an interaction with the parameters...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5vq5065q</guid>
      <pubDate>Mon, 30 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Dalsen, Jennifer</name>
      </author>
      <author>
        <name>Anderson, Craig G</name>
      </author>
      <author>
        <name>Squire, Kurt</name>
      </author>
      <author>
        <name>Steinkuehler, Constance</name>
      </author>
    </item>
    <item>
      <title>Editorial: Extremism in games</title>
      <link>https://escholarship.org/uc/item/4g39t0p1</link>
      <description>Editorial: Extremism in games</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4g39t0p1</guid>
      <pubDate>Mon, 30 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Kowert, Rachel</name>
      </author>
      <author>
        <name>Lakhani, Suraj</name>
      </author>
      <author>
        <name>Steinkuehler, Constance</name>
      </author>
    </item>
    <item>
      <title>PIKACHU: (est. 1996) Franchise: Pokémon Developer: Game Freak</title>
      <link>https://escholarship.org/uc/item/44h8b3nv</link>
      <description>PIKACHU: (est. 1996) Franchise: Pokémon Developer: Game Freak</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/44h8b3nv</guid>
      <pubDate>Mon, 30 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Saucerman, J</name>
      </author>
      <author>
        <name>Steinkuehler, C</name>
      </author>
    </item>
    <item>
      <title>How much we express love predicts how much we feel loved in daily life</title>
      <link>https://escholarship.org/uc/item/9hb4139s</link>
      <description>Feeling and expressing love in daily life are interconnected and perhaps mutually influential experiences. In this study we examined the reciprocal dynamics of feeling and expressing love and its relation to well-being using an ecological momentary assessment design. Over a four-week period, we asked participants (N = 52; 67% Female; 80% White) to report their levels of feeling loved and expressing love six times a day. Using a continuous-time process model, we explored individual differences in inertia (i.e., persistence of a process over time) and cross-influences of felt and expressed love over time. We found that increases in expressing love led to increased feelings of being loved over time; however, increases in felt love did not lead to increases in expressing love. Notably, participants who experienced more persistent feelings of love (that is, greater inertia over time) indicated higher levels of flourishing. These results suggest new avenues for psychological well-being...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/9hb4139s</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Williams, Lindy</name>
      </author>
      <author>
        <name>Kim, Sharon H</name>
      </author>
      <author>
        <name>Li, Yanling</name>
      </author>
      <author>
        <name>Heshmati, Saida</name>
      </author>
      <author>
        <name>Vandekerckhove, Joachim</name>
        <uri>https://orcid.org/0000-0003-2600-5937</uri>
      </author>
      <author>
        <name>Roeser, Robert W</name>
      </author>
      <author>
        <name>Oravecz, Zita</name>
      </author>
    </item>
    <item>
      <title>An Expert Guide to Planning Experimental Tasks For Evidence-Accumulation Modeling</title>
      <link>https://escholarship.org/uc/item/8mn5z2kf</link>
      <description>Evidence-accumulation models (EAMs) are powerful tools for making sense of human and animal decision-making behavior. EAMs have generated significant theoretical advances in psychology, behavioral economics, and cognitive neuroscience and are increasingly used as a measurement tool in clinical research and other applied settings. Obtaining valid and reliable inferences from EAMs depends on knowing how to establish a close match between model assumptions and features of the task/data to which the model is applied. However, this knowledge is rarely articulated in the EAM literature, leaving beginners to rely on the private advice of mentors and colleagues and inefficient trial-and-error learning. In this article, we provide practical guidance for designing tasks appropriate for EAMs, relating experimental manipulations to EAM parameters, planning appropriate sample sizes, and preparing data and conducting an EAM analysis. Our advice is based on prior methodological studies and the...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8mn5z2kf</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Boag, Russell J</name>
      </author>
      <author>
        <name>Innes, Reilly J</name>
      </author>
      <author>
        <name>Stevenson, Niek</name>
      </author>
      <author>
        <name>Bahg, Giwon</name>
      </author>
      <author>
        <name>Busemeyer, Jerome R</name>
      </author>
      <author>
        <name>Cox, Gregory E</name>
      </author>
      <author>
        <name>Donkin, Chris</name>
      </author>
      <author>
        <name>Frank, Michael J</name>
      </author>
      <author>
        <name>Hawkins, Guy E</name>
      </author>
      <author>
        <name>Heathcote, Andrew</name>
      </author>
      <author>
        <name>Hedge, Craig</name>
      </author>
      <author>
        <name>Lerche, Veronika</name>
      </author>
      <author>
        <name>Lilburn, Simon D</name>
      </author>
      <author>
        <name>Logan, Gordon D</name>
      </author>
      <author>
        <name>Matzke, Dora</name>
      </author>
      <author>
        <name>Miletić, Steven</name>
      </author>
      <author>
        <name>Osth, Adam F</name>
      </author>
      <author>
        <name>Palmeri, Thomas J</name>
      </author>
      <author>
        <name>Sederberg, Per B</name>
      </author>
      <author>
        <name>Singmann, Henrik</name>
      </author>
      <author>
        <name>Smith, Philip L</name>
      </author>
      <author>
        <name>Stafford, Tom</name>
      </author>
      <author>
        <name>Steyvers, Mark</name>
      </author>
      <author>
        <name>Strickland, Luke</name>
      </author>
      <author>
        <name>Trueblood, Jennifer S</name>
      </author>
      <author>
        <name>Tsetsos, Konstantinos</name>
      </author>
      <author>
        <name>Turner, Brandon M</name>
      </author>
      <author>
        <name>Usher, Marius</name>
      </author>
      <author>
        <name>van Maanen, Leendert</name>
      </author>
      <author>
        <name>van Ravenzwaaij, Don</name>
      </author>
      <author>
        <name>Vandekerckhove, Joachim</name>
        <uri>https://orcid.org/0000-0003-2600-5937</uri>
      </author>
      <author>
        <name>Voss, Andreas</name>
      </author>
      <author>
        <name>Weichart, Emily R</name>
      </author>
      <author>
        <name>Weindel, Gabriel</name>
      </author>
      <author>
        <name>White, Corey N</name>
      </author>
      <author>
        <name>Evans, Nathan J</name>
      </author>
      <author>
        <name>Brown, Scott D</name>
      </author>
      <author>
        <name>Forstmann, Birte U</name>
      </author>
    </item>
    <item>
      <title>Computational Complexities of Folding</title>
      <link>https://escholarship.org/uc/item/7z5601k3</link>
      <description>We prove several hardness results on folding origami crease patterns. Flat-folding finite crease patterns is fixed-parameter tractable in the ply of the folded pattern (how many layers overlap at any point) and the treewidth of an associated cell adjacency graph. Under the exponential time hypothesis, the singly-exponential dependence of our algorithm on treewidth is necessary, even for bounded ply. Improving the dependence on ply would require progress on the unsolved map folding problem. Finding the shape of a polyhedron folded from a net with triangular faces and integer edge lengths is not possible in algebraic computation tree models of computation that at each tree node allow either the computation of arbitrary integer roots of real numbers, or the extraction of roots of polynomials with bounded degree and integer coefficients. For a model of reconfigurable origami with origami squares are attached at one edge by a hinge to a rigid surface, moving from one flat-folded state...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7z5601k3</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
    </item>
    <item>
      <title>String Graph Obstacles of High Girth and of Bounded Degree</title>
      <link>https://escholarship.org/uc/item/7j69r6m4</link>
      <description>A string graph is the intersection graph of curves in the plane. Kratochvíl previously showed the existence of infinitely many obstacles: graphs that are not string graphs but for which any edge contraction or vertex deletion produces a string graph. Kratochvíl's obstacles contain arbitrarily large cliques, so they have girth three and unbounded degree. We extend this line of working by studying obstacles among graphs of restricted girth and/or degree. We construct an infinite family of obstacles of girth four; in addition, our construction is K2,3-subgraph-free and near-planar (planar plus one edge). Furthermore, we prove that there is a subcubic obstacle of girth three, and that there are no subcubic obstacles of high girth. We characterize the subcubic string graphs as having a matching whose contraction yields a planar graph, and based on this characterization we find a linear-time algorithm for recognizing subcubic string graphs of bounded treewidth.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7j69r6m4</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Chudnovsky, M</name>
        <uri>https://orcid.org/0000-0002-8920-4944</uri>
      </author>
      <author>
        <name>Eppstein, D</name>
      </author>
      <author>
        <name>Fischer, D</name>
        <uri>https://orcid.org/0009-0009-3488-838X</uri>
      </author>
    </item>
    <item>
      <title>The Complexity of Iterated Reversible Computation</title>
      <link>https://escholarship.org/uc/item/70d126n1</link>
      <description>We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its definition, and in whether we require $f$ to have a polynomial-time inverse or to be computible by a reversible logic circuit. These problems are characterized by the complexity class $\mathsf{FP}^{\mathsf{PSPACE}}$, and include natural $\mathsf{FP}^{\mathsf{PSPACE}}$-complete problems in circuit complexity, cellular automata, graph algorithms, and the dynamical systems described by piecewise-linear transformations.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/70d126n1</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
    </item>
    <item>
      <title>Distributed Construction of Lightweight Spanners for Unit Ball Graphs</title>
      <link>https://escholarship.org/uc/item/69m9x7t0</link>
      <description>Resolving an open question from 2006 [14], we prove the existence of light-weight bounded-degree spanners for unit ball graphs in the metrics of bounded doubling dimension, and we design a simple O(log&lt;sup&gt;∗&lt;/sup&gt; n)-round distributed algorithm in the LOCAL model of computation, that given a unit ball graph G with n vertices and a positive constant ϵ &amp;lt; 1 finds a (1+ϵ)-spanner with constant bounds on its maximum degree and its lightness using only 2-hop neighborhood information. This immediately improves the best prior lightness bound, the algorithm of Damian, Pandit, and Pemmaraju [13], which runs in O(log&lt;sup&gt;∗&lt;/sup&gt; n) rounds in the LOCAL model, but has a O(log ∆) bound on its lightness, where ∆ is the ratio of the length of the longest edge to the length of the shortest edge in the unit ball graph. Next, we adjust our algorithm to work in the CONGEST model, without changing its round complexity, hence proposing the first spanner construction for unit ball graphs in the CONGEST...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/69m9x7t0</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Khodabandeh, Hadi</name>
      </author>
    </item>
    <item>
      <title>Optimizing the Color Shapes Task for Ambulatory Assessment and Drift Diffusion Modeling: A Factorial Experiment</title>
      <link>https://escholarship.org/uc/item/5772z52z</link>
      <description>BACKGROUND: Recent advances in cognitive digital assessment methodology, including high-frequency, ambulatory assessments, promise to improve the detection of subtle cognitive changes. Computational modeling approaches may further improve the sensitivity of digital cognitive assessments to detect subtle cognitive changes by capturing features that map onto core cognitive processes.
OBJECTIVE: We explored the validity of a brief smartphone-based adaptation of a visual working memory task that has shown sensitivity for detecting preclinical Alzheimer disease risk. We aimed to optimize properties of the task for computational cognitive feature extraction with drift diffusion modeling.
METHODS: We analyzed data from 68 participants (n=47, 69% women; n=55, 81% White; mean age 49, SD 14; range 24-80 years) who completed 60 trials for each of 16 variations of a visual working memory binding task (the Color Shapes task) on smartphones, over an 8-day period. A drift diffusion model was...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5772z52z</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Kim, Sharon Haeun</name>
      </author>
      <author>
        <name>Hakun, Jonathan G</name>
      </author>
      <author>
        <name>Li, Yanling</name>
      </author>
      <author>
        <name>Harrington, Karra D</name>
      </author>
      <author>
        <name>Elbich, Daniel B</name>
      </author>
      <author>
        <name>Sliwinski, Martin J</name>
      </author>
      <author>
        <name>Vandekerckhove, Joachim</name>
        <uri>https://orcid.org/0000-0003-2600-5937</uri>
      </author>
      <author>
        <name>Oravecz, Zita</name>
      </author>
    </item>
    <item>
      <title>Brief Announcement: Distributed Lightweight Spanner Construction for Unit Ball Graphs in Doubling Metrics</title>
      <link>https://escholarship.org/uc/item/4z38v63d</link>
      <description>Resolving an open question from 2006, we prove the existence of light-weight bounded-degree (1+ε)-spanners for unit ball graphs in the metrics of bounded doubling dimension, and we design a simple O(log*n)-round distributed algorithm in the LOCAL model for finding such spanners using only 2-hop neighborhood information. We further study the problem in the two dimensional Euclidean plane and we propose a construction with similar properties that has a low-intersection property as well. Lastly, we provide experimental results that confirm the performance of our algorithms.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4z38v63d</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Khodabandeh, Hadi</name>
      </author>
    </item>
    <item>
      <title>Visualizing Treewidth</title>
      <link>https://escholarship.org/uc/item/4v97s3sk</link>
      <description>A witness drawing of a graph is a visualization that clearly shows a given property of a graph. We study and implement various drawing paradigms for witness drawings to clearly show that graphs have bounded pathwidth or treewidth. Our approach draws the tree decomposition or path decomposition as a tree of bags, with induced subgraphs shown in each bag, and with “tracks” for each graph vertex connecting its copies in multiple bags. Within bags, we optimize the vertex layout to avoid crossings of edges and tracks. We implement a visualization prototype for crossing minimization using dynamic programming for graphs of small width and heuristic approaches for graphs of larger width. We introduce a taxonomy of drawing styles, which render the subgraph for each bag as an arc diagram with one or two pages or as a circular layout with straight-line edges, and we render tracks either with straight lines or with orbital-radial paths.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4v97s3sk</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Chiu, A</name>
        <uri>https://orcid.org/0009-0009-6863-859X</uri>
      </author>
      <author>
        <name>Depian, T</name>
        <uri>https://orcid.org/0009-0003-7498-6271</uri>
      </author>
      <author>
        <name>Eppstein, D</name>
      </author>
      <author>
        <name>Goodrich, MT</name>
        <uri>https://orcid.org/0000-0002-8943-191X</uri>
      </author>
      <author>
        <name>Nöllenburg, M</name>
      </author>
    </item>
    <item>
      <title>A Stronger Lower Bound on Parametric Minimum Spanning Trees</title>
      <link>https://escholarship.org/uc/item/3c79s8db</link>
      <description>We prove that, for an undirected graph with n vertices and m edges, each labeled with a linear function of a parameter λ$$\lambda $$, the number of different minimum spanning trees obtained as the parameter varies can be Ω(mlogn)$$\Omega (m\log n)$$.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3c79s8db</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
    </item>
    <item>
      <title>Partially Observable Predictor Models for Identifying Cognitive Markers</title>
      <link>https://escholarship.org/uc/item/1wn7g523</link>
      <description>Repeated assessments of cognitive performance yield rich data from which we can extract markers of cognitive performance. Computational cognitive process models are often fit to repeated cognitive assessments to quantify individual differences in terms of substantively meaningful cognitive markers and link them to other person-level variables. Most studies stop at this point and do not test whether these cognitive markers have utility for predicting some meaningful outcomes. Here, we demonstrate a partially observable predictor modeling approach that can fill this gap. Using this approach, we can simultaneously extract cognitive markers from repeated assessment data and use these together with demographic covariates for predictive modeling of a clinically interesting outcome in a Bayesian multilevel modeling framework. We describe this approach by constructing a predictive process model in which features of learning are combined with demographic variables to predict mild cognitive...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1wn7g523</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Oravecz, Zita</name>
      </author>
      <author>
        <name>Sliwinski, Martin</name>
      </author>
      <author>
        <name>Kim, Sharon H</name>
      </author>
      <author>
        <name>Williams, Lindy</name>
      </author>
      <author>
        <name>Katz, Mindy J</name>
      </author>
      <author>
        <name>Vandekerckhove, Joachim</name>
        <uri>https://orcid.org/0000-0003-2600-5937</uri>
      </author>
    </item>
    <item>
      <title>On the treewidth of Hanoi graphs</title>
      <link>https://escholarship.org/uc/item/1jd9s728</link>
      <description>The objective of the well-known Tower of Hanoi puzzle is to move a set of discs one at a time from one of a set of pegs to another, while keeping the discs sorted on each peg. We propose an adversarial variation in which the first player forbids a set of states in the puzzle, and the second player must then convert one randomly-selected state to another without passing through forbidden states. Analyzing this version raises the question of the treewidth of Hanoi graphs. We find this number exactly for three-peg puzzles and provide nearly-tight asymptotic bounds for larger numbers of pegs.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1jd9s728</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Frishberg, Daniel</name>
      </author>
      <author>
        <name>Maxwell, William</name>
      </author>
    </item>
    <item>
      <title>Stabbing Faces by a Convex Curve</title>
      <link>https://escholarship.org/uc/item/11k047cd</link>
      <description>We prove that, for every plane graph G and every smooth convex curve C not on a single line, there exists a straight-line drawing of G for which every face is crossed by C.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/11k047cd</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, D</name>
      </author>
    </item>
    <item>
      <title>What is... Treewidth?</title>
      <link>https://escholarship.org/uc/item/0mc7w5m5</link>
      <description>What is... Treewidth?</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0mc7w5m5</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
    </item>
    <item>
      <title>On the complexity of embedding in graph products</title>
      <link>https://escholarship.org/uc/item/0gb5v73f</link>
      <description>Graph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of embedding a graph G in a host graph that is the strong product of a path P with a graph H that satisfies some properties, such as having small treewidth, pathwidth or treedepth. We show that this is NP-hard, even under numerous restrictions on both G and H. In particular, computing the row pathwidth and the row treedepth is NP-hard even for a tree of small pathwidth, while computing the row treewidth is NP-hard even for series-parallel graphs.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0gb5v73f</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Biedl, T</name>
      </author>
      <author>
        <name>Eppstein, D</name>
      </author>
      <author>
        <name>Ueckerdt, T</name>
      </author>
    </item>
    <item>
      <title>An EZ Bayesian hierarchical drift diffusion model for response time and accuracy</title>
      <link>https://escholarship.org/uc/item/03k3219c</link>
      <description>The EZ-diffusion model is a simplification of the popular drift diffusion model of choice response times that allows researchers to calculate diffusion model parameters directly from data with no need for expensive computations. The EZ-diffusion model is based on a system of equations in which the diffusion model’s drift rate, boundary separation, and nondecision time parameters are jointly used to predict three summary statistics (the accuracy rate and the mean and variance of the correct response times). These equations can then be inverted to obtain estimators for the three parameters from these summary statistics. Here, we describe a probabilistic formulation of the EZ-diffusion model that can serve as a hyper-efficient proxy model to the drift diffusion model. The new formulation is based on sampling distributions of summary statistics and consists only of normal and binomial distributions. It can easily be implemented in any probabilistic programming language. We demonstrate...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/03k3219c</guid>
      <pubDate>Wed, 25 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Chávez De la Peña, Adriana F</name>
      </author>
      <author>
        <name>Vandekerckhove, Joachim</name>
        <uri>https://orcid.org/0000-0003-2600-5937</uri>
      </author>
    </item>
    <item>
      <title>Spatial and temporal evaluations of the liquid argon purity in ProtoDUNE-SP</title>
      <link>https://escholarship.org/uc/item/2ks5b3d4</link>
      <description>Liquid argon time projection chambers (LArTPCs) rely on highly pure argon to ensure that ionization electrons produced by charged particles reach readout arrays. ProtoDUNE Single-Phase (ProtoDUNE-SP) was an approximately 700-ton liquid argon detector intended to prototype the Deep Underground Neutrino Experiment (DUNE) Far Detector Horizontal Drift module. It contains two drift volumes bisected by the cathode plane assembly, which is biased to create an almost uniform electric field in both volumes. The DUNE Far Detector modules must have robust cryogenic systems capable of filtering argon and supplying the TPC with clean liquid. This paper will explore comparisons of the argon purity measured by the purity monitors with those measured using muons in the TPC from October 2018 to November 2018. A new method is introduced to measure the liquid argon purity in the TPC using muons crossing both drift volumes of ProtoDUNE-SP. For extended periods on the timescale of weeks, the drift...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2ks5b3d4</guid>
      <pubDate>Mon, 16 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Abbaslu, S</name>
      </author>
      <author>
        <name>Abud, A Abed</name>
      </author>
      <author>
        <name>Acciarri, R</name>
      </author>
      <author>
        <name>Accorsi, LP</name>
      </author>
      <author>
        <name>Acero, MA</name>
      </author>
      <author>
        <name>Adames, MR</name>
      </author>
      <author>
        <name>Adamov, G</name>
      </author>
      <author>
        <name>Adamowski, M</name>
      </author>
      <author>
        <name>Adriano, C</name>
      </author>
      <author>
        <name>Akbar, F</name>
      </author>
      <author>
        <name>Alemanno, F</name>
      </author>
      <author>
        <name>Alex, NS</name>
      </author>
      <author>
        <name>Allison, K</name>
      </author>
      <author>
        <name>Alrashed, M</name>
      </author>
      <author>
        <name>Alton, A</name>
      </author>
      <author>
        <name>Alvarez, R</name>
      </author>
      <author>
        <name>Alves, T</name>
      </author>
      <author>
        <name>Aman, A</name>
      </author>
      <author>
        <name>Amar, H</name>
      </author>
      <author>
        <name>Amedo, P</name>
      </author>
      <author>
        <name>Anderson, J</name>
      </author>
      <author>
        <name>Andrade, DA</name>
      </author>
      <author>
        <name>Andreopoulos, C</name>
      </author>
      <author>
        <name>Andreotti, M</name>
      </author>
      <author>
        <name>Andrews, MP</name>
      </author>
      <author>
        <name>Andrianala, F</name>
      </author>
      <author>
        <name>Andringa, S</name>
      </author>
      <author>
        <name>Anjarazafy, F</name>
      </author>
      <author>
        <name>Ansarifard, S</name>
      </author>
      <author>
        <name>Antic, D</name>
      </author>
      <author>
        <name>Antoniassi, M</name>
      </author>
      <author>
        <name>Aranda-Fernandez, A</name>
      </author>
      <author>
        <name>Arellano, L</name>
      </author>
      <author>
        <name>Diaz, E Arrieta</name>
      </author>
      <author>
        <name>Arroyave, MA</name>
      </author>
      <author>
        <name>Arteropons, M</name>
      </author>
      <author>
        <name>Asaadi, J</name>
      </author>
      <author>
        <name>Ascencio, M</name>
      </author>
      <author>
        <name>Ashkenazi, A</name>
      </author>
      <author>
        <name>Asner, D</name>
      </author>
      <author>
        <name>Asquith, L</name>
      </author>
      <author>
        <name>Atkin, E</name>
      </author>
      <author>
        <name>Auguste, D</name>
      </author>
      <author>
        <name>Aurisano, A</name>
      </author>
      <author>
        <name>Aushev, V</name>
      </author>
      <author>
        <name>Autiero, D</name>
      </author>
      <author>
        <name>Gómez, D Ávila</name>
      </author>
      <author>
        <name>Azam, MB</name>
      </author>
      <author>
        <name>Azfar, F</name>
      </author>
      <author>
        <name>Back, A</name>
      </author>
      <author>
        <name>Back, JJ</name>
      </author>
      <author>
        <name>Bae, Y</name>
      </author>
      <author>
        <name>Bagaturia, I</name>
      </author>
      <author>
        <name>Bagby, L</name>
      </author>
      <author>
        <name>Baigarashev, D</name>
      </author>
      <author>
        <name>Balasubramanian, S</name>
      </author>
      <author>
        <name>Balboni, A</name>
      </author>
      <author>
        <name>Baldi, P</name>
        <uri>https://orcid.org/0000-0003-0636-7930</uri>
      </author>
      <author>
        <name>Baldini, W</name>
      </author>
      <author>
        <name>Baldonedo, J</name>
      </author>
      <author>
        <name>Baller, B</name>
      </author>
      <author>
        <name>Bambah, B</name>
      </author>
      <author>
        <name>Barao, F</name>
      </author>
      <author>
        <name>Barbu, D</name>
      </author>
      <author>
        <name>Barenboim, G</name>
      </author>
      <author>
        <name>Alzás, P Barham</name>
      </author>
      <author>
        <name>Barker, GJ</name>
      </author>
      <author>
        <name>Barkhouse, W</name>
      </author>
      <author>
        <name>Barr, G</name>
      </author>
      <author>
        <name>Barros, A</name>
      </author>
      <author>
        <name>Barros, N</name>
      </author>
      <author>
        <name>Barrow, D</name>
      </author>
      <author>
        <name>Barrow, JL</name>
      </author>
      <author>
        <name>Basharina-Freshville, A</name>
      </author>
      <author>
        <name>Bashyal, A</name>
      </author>
      <author>
        <name>Basque, V</name>
      </author>
      <author>
        <name>Bassani, M</name>
      </author>
      <author>
        <name>Basu, D</name>
      </author>
      <author>
        <name>Batchelor, C</name>
      </author>
      <author>
        <name>Bathe-Peters, L</name>
      </author>
      <author>
        <name>Battat, JBR</name>
      </author>
      <author>
        <name>Battisti, F</name>
      </author>
      <author>
        <name>Bautista, J</name>
      </author>
      <author>
        <name>Bay, F</name>
      </author>
      <author>
        <name>Alba, JLL Bazo</name>
      </author>
      <author>
        <name>Beacom, JF</name>
      </author>
      <author>
        <name>Bechetoille, E</name>
      </author>
      <author>
        <name>Behera, B</name>
      </author>
      <author>
        <name>Belchior, E</name>
      </author>
      <author>
        <name>Bell, B</name>
      </author>
      <author>
        <name>Bell, G</name>
      </author>
      <author>
        <name>Bellantoni, L</name>
      </author>
      <author>
        <name>Bellettini, G</name>
      </author>
      <author>
        <name>Bellini, V</name>
      </author>
      <author>
        <name>Beltramello, O</name>
      </author>
      <author>
        <name>Belyaev, A</name>
      </author>
      <author>
        <name>Montiel, C Benitez</name>
      </author>
      <author>
        <name>Benjamin, D</name>
      </author>
      <author>
        <name>Neves, F Bento</name>
      </author>
      <author>
        <name>Berger, J</name>
      </author>
    </item>
    <item>
      <title>When AI Writes Back: Ethical Considerations by Physicians on AI-Drafted Patient Message Replies.</title>
      <link>https://escholarship.org/uc/item/9fb33523</link>
      <description>The increasing burden of responding to large volumes of patient messages has become a key factor contributing to physician burnout. Generative AI (GenAI) shows great promise to alleviate this burden by automatically drafting patient message replies. The ethical implications of this use have however not been fully explored. To address this knowledge gap, we conducted a qualitative interview study with 21 physicians who participated in a GenAI pilot program. We found that notable ethical considerations expressed by the physician participants included oversight as ethical safeguard, transparency and patient consent of AI use, patient misunderstanding of AI's role, and patient privacy and data security as prerequisites. Additionally, our findings suggest that the physicians believe the ethical responsibility of using GenAI in this context primarily lies with users, not with the technology. These findings may provide useful insights into guiding the future implementation of GenAI in...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/9fb33523</guid>
      <pubDate>Wed, 11 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Hu, Di</name>
      </author>
      <author>
        <name>Guo, Yawen</name>
      </author>
      <author>
        <name>Cho, Ha Na</name>
      </author>
      <author>
        <name>Chow, Emilie</name>
      </author>
      <author>
        <name>Mukamel, Dana B</name>
        <uri>https://orcid.org/0000-0003-4147-5785</uri>
      </author>
      <author>
        <name>Sorkin, Dara</name>
        <uri>https://orcid.org/0000-0003-0742-9240</uri>
      </author>
      <author>
        <name>Reikes, Andrew</name>
      </author>
      <author>
        <name>Perret, Danielle</name>
      </author>
      <author>
        <name>Pandita, Deepti</name>
        <uri>https://orcid.org/0009-0007-2791-2738</uri>
      </author>
      <author>
        <name>Zheng, Kai</name>
        <uri>https://orcid.org/0000-0003-4121-4948</uri>
      </author>
    </item>
    <item>
      <title>Prediction Interval Transfer Learning for Linear Regression Using an Empirical Bayes Approach</title>
      <link>https://escholarship.org/uc/item/7wg6k8xn</link>
      <description>ABSTRACT  Current literature on transfer learning has been focused on improving the predictive performance corresponding to a small dataset by transferring information to it from a larger but possibly biassed dataset. However, the transfer learning methods currently available do not allow the computation of prediction intervals, and hence, one has to rely on using either the small dataset alone or combining it with the possibly biassed dataset to obtain prediction intervals using traditional linear regression methods. In this article, we propose an E mpirical B ayes approach for P rediction I nterval T ransfer L earning (EB‐PITL), to compute prediction intervals for transfer learning in linear regression tasks. We have proved that the Gibbs sampler associated with EB‐PITL is geometrically ergodic, so EB‐PITL can also quantify the Monte Carlo uncertainty associated with its predicted value. The efficiency of EB‐PITL against currently available methods is demonstrated using simulation...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7wg6k8xn</guid>
      <pubDate>Wed, 11 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Dixit, Anand</name>
      </author>
      <author>
        <name>Shen, Weining</name>
        <uri>https://orcid.org/0000-0003-3137-1085</uri>
      </author>
      <author>
        <name>Zhang, Min</name>
      </author>
      <author>
        <name>Zhang, Dabao</name>
        <uri>https://orcid.org/0000-0003-0629-8672</uri>
      </author>
    </item>
    <item>
      <title>Perceptions of AI-Driven EdTech: Nationwide Survey and Focus Group Insights from Key End Users</title>
      <link>https://escholarship.org/uc/item/676617cd</link>
      <description>Schoolchildren in the United States are increasingly exposed to educational technologies (EdTech), many of which are or will be infused with Artificial Intelligence (AI). Despite this growing integration, there is limited understanding of the current perceptions and attitudes toward EdTech with AI among parents, teachers, and teens. To address this gap, we conducted a mixed-method study involving an A/B experiment through an online survey with 3,051 participants and complemented by focus group discussions with 80 participants. Providing a comprehensive snapshot of AI perception in education in 2024, our findings indicate that participants, particularly teachers, may hold more negative perceptions of our AI-powered EdTech mock-up compared to the one powered by human tutors. Based on these insights, we discuss the future of EdTech regarding the current perceptions. This research contributes to an empirical understanding of the perceptions and attitudes toward AI in K-12 education,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/676617cd</guid>
      <pubDate>Wed, 11 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Min, Aehong</name>
        <uri>https://orcid.org/0000-0002-3790-2126</uri>
      </author>
      <author>
        <name>Dickerson, Kelli</name>
      </author>
      <author>
        <name>Park, Sohyeon</name>
      </author>
      <author>
        <name>Hicks, Emani</name>
      </author>
      <author>
        <name>Han, Ariel</name>
      </author>
      <author>
        <name>Rubin, Jennifer D</name>
      </author>
      <author>
        <name>Lombard, Ella</name>
      </author>
      <author>
        <name>Chen, Katharine</name>
      </author>
      <author>
        <name>Divanji, Riddhi</name>
      </author>
      <author>
        <name>Odgers, Candice</name>
        <uri>https://orcid.org/0000-0003-4937-6618</uri>
      </author>
      <author>
        <name>Hayes, Gillian R</name>
      </author>
    </item>
    <item>
      <title>Radiative, Hydrologic, and Circulation Responses to Warming in Cess‐Potter Simulations Using the Global 3.25‐km SCREAM</title>
      <link>https://escholarship.org/uc/item/5t65r0x2</link>
      <description>Abstract Using the global 3.25‐km Simple Cloud Resolving E3SM Atmosphere Model (SCREAM 3&amp;nbsp;km), a pair of 13‐month Cess‐Potter simulations are performed to quantify the radiative feedbacks and the hydrologic and circulation responses to warming. Large‐scale aspects of SCREAM 3&amp;nbsp;km's top‐of‐atmosphere radiative fluxes, precipitation rates, and circulations are in good agreement with observations and reanalysis, with notable differences, including a drier lower free‐troposphere in the Tropics, reduced precipitation and humidity over the Tropical West Pacific, and poleward shifted Southern Hemisphere midlatitude jet. In response to warming, SCREAM 3&amp;nbsp;km predicts a total radiative feedback within the top 15% of the CMIP5 and CMIP6 models, which puts it substantially higher than the feedback reported by other kilometer‐scale models. SCREAM 3&amp;nbsp;km's high radiative feedback stems from a strongly positive shortwave cloud feedback, most prominent over the mid‐ and high‐latitudes....</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5t65r0x2</guid>
      <pubDate>Tue, 10 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Terai, CR</name>
      </author>
      <author>
        <name>Keen, ND</name>
        <uri>https://orcid.org/0000-0003-3607-3554</uri>
      </author>
      <author>
        <name>Caldwell, PM</name>
      </author>
      <author>
        <name>Beydoun, H</name>
      </author>
      <author>
        <name>Bogenschutz, PA</name>
      </author>
      <author>
        <name>Chao, L‐W</name>
      </author>
      <author>
        <name>Hillman, BR</name>
      </author>
      <author>
        <name>Ma, H‐Y</name>
      </author>
      <author>
        <name>Zelinka, MD</name>
      </author>
      <author>
        <name>Bertagna, L</name>
      </author>
      <author>
        <name>Bradley, AM</name>
      </author>
      <author>
        <name>Clevenger, TC</name>
      </author>
      <author>
        <name>Donahue, AS</name>
      </author>
      <author>
        <name>Foucar, J</name>
      </author>
      <author>
        <name>Golaz, J‐C</name>
      </author>
      <author>
        <name>Guba, O</name>
      </author>
      <author>
        <name>Hannah, W</name>
      </author>
      <author>
        <name>Lee, J</name>
      </author>
      <author>
        <name>Lin, W</name>
      </author>
      <author>
        <name>Mahfouz, N</name>
      </author>
      <author>
        <name>Mülmenstädt, J</name>
      </author>
      <author>
        <name>Salinger, AG</name>
      </author>
      <author>
        <name>Singh, B</name>
      </author>
      <author>
        <name>Sreepathi, S</name>
      </author>
      <author>
        <name>Qin, Y</name>
      </author>
      <author>
        <name>Taylor, MA</name>
      </author>
      <author>
        <name>Ullrich, PA</name>
        <uri>https://orcid.org/0000-0003-4118-4590</uri>
      </author>
      <author>
        <name>Wu, W‐Y</name>
      </author>
      <author>
        <name>Yuan, X</name>
      </author>
      <author>
        <name>Zender, CS</name>
        <uri>https://orcid.org/0000-0003-0129-8024</uri>
      </author>
      <author>
        <name>Zhang, Y</name>
      </author>
    </item>
    <item>
      <title>Accuracy of Continuous Noninvasive Hemoglobin Monitoring</title>
      <link>https://escholarship.org/uc/item/44z478nq</link>
      <description>BACKGROUND: Noninvasive hemoglobin (Hb) monitoring devices are available in the clinical setting, but their accuracy and precision against central laboratory Hb measurements have not been evaluated in a systematic review and meta-analysis.
METHODS: We conducted a comprehensive search of the literature (2005 to August 2013) with PubMed, Web of Science and the Cochrane Library, reviewed references of retrieved articles, and contacted manufactures to identify studies assessing the accuracy of noninvasive Hb monitoring against central laboratory Hb measurements. Two independent reviewers assessed the quality of studies using recommendations for reporting guidelines and quality criteria for method comparison studies. Pooled mean difference and standard deviation (SD) (95% limits of agreement) across studies were calculated using the random-effects model. Heterogeneity was assessed using the I statistic.
RESULTS: A total of 32 studies (4425 subjects, median sample size of 44, ranged...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/44z478nq</guid>
      <pubDate>Thu, 26 Feb 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Kim, Sang-Hyun</name>
      </author>
      <author>
        <name>Lilot, Marc</name>
      </author>
      <author>
        <name>Murphy, Linda Suk-Ling</name>
        <uri>https://orcid.org/0000-0003-2948-0792</uri>
      </author>
      <author>
        <name>Sidhu, Kulraj S</name>
      </author>
      <author>
        <name>Yu, Zhaoxia</name>
        <uri>https://orcid.org/0000-0001-9700-1795</uri>
      </author>
      <author>
        <name>Rinehart, Joseph</name>
      </author>
      <author>
        <name>Cannesson, Maxime</name>
      </author>
    </item>
    <item>
      <title>Revisiting Reconfigurable Acceleration of Vision Transformer with Patch Pruning</title>
      <link>https://escholarship.org/uc/item/4tt9n3gq</link>
      <description>Vision Transformers (ViTs) have become the backbone of numerous cutting-edge vision applications. The attention modules within ViTs play a crucial role in modeling spatial relationships between pixels. Although these attention modules enhance the accuracy of ViT models, they also increase computational demands, limiting the deployment of ViTs in edge computing environments. To address this issue, prior research has focused on optimizing ViTs from both software and hardware perspectives. A notable software optimization technique is reducing the image patches involved in attention computations. Two common methods to achieve this are window attention and patch pruning. However, they introduce new challenges for existing hardware platforms regarding attention computation. Therefore, it is essential to develop new hardware modules to simultaneously support pruned attention computations and efficient window shifts. In this study, we introduce an FPGA-based token reduction vision transformer...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4tt9n3gq</guid>
      <pubDate>Wed, 25 Feb 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Chen, Hanning</name>
      </author>
      <author>
        <name>Ni, Yang</name>
      </author>
      <author>
        <name>Huang, Wenjun</name>
      </author>
      <author>
        <name>Oh, Hyunwoo</name>
      </author>
      <author>
        <name>Das, Tamoghno</name>
      </author>
      <author>
        <name>Wen, Fei</name>
      </author>
      <author>
        <name>Imani, Mohsen</name>
      </author>
    </item>
    <item>
      <title>NUDGING: Inference-time Alignment of LLMs via Guided Decoding</title>
      <link>https://escholarship.org/uc/item/4ht09133</link>
      <description>Large language models (LLMs) require alignment to effectively and safely follow user instructions. This process necessitates training an aligned version for every base model, resulting in significant computational overhead. In this work, we propose NUDGING, a simple, training-free algorithm that aligns any base model at inference time using a small aligned model. NUDGING is motivated by recent findings that alignment primarily alters the model's behavior on a small subset of stylistic tokens (e.g., discourse markers). We find that base models are significantly more uncertain when generating these tokens. Building on this insight, NUDGING employs a small aligned model to generate nudging tokens to guide the base model's output during decoding when the base model's uncertainty is high, with only a minor additional inference overhead. We evaluate NUDGING across 3 model families on a diverse range of open-instruction tasks. Without any training, nudging a large base model with a 7×-14×...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4ht09133</guid>
      <pubDate>Wed, 11 Feb 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Fei, Yu</name>
      </author>
      <author>
        <name>Razeghi, Yasaman</name>
      </author>
      <author>
        <name>Singh, Sameer</name>
        <uri>https://orcid.org/0000-0003-0621-6323</uri>
      </author>
    </item>
    <item>
      <title>Episodic-like memory in a simulation of cuttlefish behavior.</title>
      <link>https://escholarship.org/uc/item/0zx7016p</link>
      <description>Episodic memory involves remembering the what, when, and where components of an event. It has been observed in humans, other vertebrates, and the invertebrate cuttlefish. In clever behavioral experiments, cuttlefish have been shown to have episodic-like memory, where they demonstrate the ability to remember when and where a preferred food source will appear. The present work replicates this behavior with a parsimonious model of episodic memory. To further test this model and explore episodic-like memory, we introduce a predator-prey scenario in which the agent must remember what creatures (e.g. predator, desirable prey, or less desirable prey) appear at a given time and region of the model environment. This simulates similar situations that cuttlefish face in the wild. They will typically hide when predators are in the area, and hunt for prey when available. When the memory model is queried for an action (e.g., hunt or hide), the cuttlefish agent hunts for preferred food, like...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0zx7016p</guid>
      <pubDate>Sat, 31 Jan 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Kandimalla, Sriskandha</name>
      </author>
      <author>
        <name>Wong, Qian</name>
      </author>
      <author>
        <name>Zheng, Kary</name>
      </author>
      <author>
        <name>Krichmar, Jeffrey</name>
      </author>
    </item>
    <item>
      <title>A New Online Fault Detection Mechanism for Neural Network Applications</title>
      <link>https://escholarship.org/uc/item/6qg5w3z2</link>
      <description>A New Online Fault Detection Mechanism for Neural Network Applications</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6qg5w3z2</guid>
      <pubDate>Thu, 29 Jan 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Paola, Luca De</name>
      </author>
      <author>
        <name>Esposito, Giuseppe</name>
      </author>
      <author>
        <name>Guerrero-Balaguera, Juan-David</name>
      </author>
      <author>
        <name>Reorda, Matteo Sonza</name>
      </author>
    </item>
    <item>
      <title>Enhancing the Reliability of Split Computing Deep Neural Networks</title>
      <link>https://escholarship.org/uc/item/3xq5m8rq</link>
      <description>Artificial intelligence is becoming increasingly popular for IoT applications in safety-critical fields (e.g., autonomous systems and biomedical, robots). Unfortunately, the inference’s workload process alone increases as the model size grows. To meet the computational power limitations of mobile devices running IoT applications, modern services sometimes resort to the Split Computing paradigm. Split Computing divides the inference process of a Neural Network into Head and Tail for their execution in a mobile device and a server, respectively, which also allows the reduction of the overall IoT device’s computational cost. Nonetheless, Split Computing can be used in safety-critical fields where reliability is crucial, especially when mobile devices have computational and cost restrictions. This paper introduces hardening techniques acting on the software to mitigate the effects of hardware faults on Split Computing models. The proposed hardening techniques consist of i) a bounded...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3xq5m8rq</guid>
      <pubDate>Thu, 29 Jan 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Esposito, Giuseppe</name>
      </author>
      <author>
        <name>Guerrero-Balaguera, Juan-David</name>
      </author>
      <author>
        <name>Condia, Josie E Rodriguez</name>
      </author>
      <author>
        <name>Levorato, Marco</name>
        <uri>https://orcid.org/0000-0002-6920-4189</uri>
      </author>
      <author>
        <name>Reorda, Matteo Sonza</name>
      </author>
    </item>
    <item>
      <title>AI-Based Classification of Adversarial Attacks vs. Hardware Fault Corruptions in the Split Computing Context</title>
      <link>https://escholarship.org/uc/item/0kb5q35c</link>
      <description>Split Computing has emerged as a promising paradigm for deploying Deep Neural Networks in Edge and Inter-net of Things systems, enabling inference tasks to be distributed between resource-constrained edge devices and cloud servers. This approach is particularly attractive for autonomous systems, where security and reliability may be critical. However, interme-diate feature maps transmitted between devices are vulnerable to corruption, which may result from intentional adversarial attacks or unintentional hardware faults. Distinguishing whether corruption originates from an external adversary or an inherent system fault is crucial for implementing appropriate counter-measures-reinforcing security mechanisms against attacks or improving system reliability to mitigate the effects of hardware-related faults. To the best of our knowledge, this work is the first to propose a machine learning-based classification mechanism capable of differentiating adversarial attacks from hardware...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0kb5q35c</guid>
      <pubDate>Thu, 29 Jan 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Esposito, G</name>
      </author>
      <author>
        <name>Magliano, E</name>
      </author>
      <author>
        <name>Scarano, N</name>
      </author>
      <author>
        <name>Eltaras, T Ahmed</name>
      </author>
      <author>
        <name>Balaguera, JD Guerrero</name>
      </author>
      <author>
        <name>Mannella, L</name>
      </author>
      <author>
        <name>Condia, JE Rodriguez</name>
      </author>
      <author>
        <name>Ruospo, A</name>
      </author>
      <author>
        <name>Di Carlo, S</name>
      </author>
      <author>
        <name>Levorato, M</name>
        <uri>https://orcid.org/0000-0002-6920-4189</uri>
      </author>
      <author>
        <name>Savino, A</name>
      </author>
      <author>
        <name>Reorda, M Sonza</name>
      </author>
    </item>
    <item>
      <title>Analysis of yeast's ORF upstream regions by parallel processing, microarrays, and computational methods.</title>
      <link>https://escholarship.org/uc/item/52h1r6jd</link>
      <description>We use a network of workstations to compute all pairwise alignments of the 500 bp upstream regions of 6,225 yeast ORFs (Open Reading Frames). We correlate the alignments with DNA microarray expression data from budding yeast cells over an oxidative stress time course. We confirm on a genomic scale that, in general, genes with extremely similar upstream regions have similar activity levels, even when located on different chromosomes. As the difference in upstream regions increases, the correlation rapidly drops towards zero. Divergent ORFs with overlapping upstream regions do not seem to be correlated in any way. The pairwise alignments coupled with the expression data, together with other computational techniques, suggest a few new putative regulatory binding sites that can be tested experimentally. Finally, we investigate the inherent symmetry present in the two strands of the yeast genome. We show that it extends at least all the way up to 9-mers and is likely to result from...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/52h1r6jd</guid>
      <pubDate>Wed, 28 Jan 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Hampson, S</name>
      </author>
      <author>
        <name>Baldi, P</name>
        <uri>https://orcid.org/0000-0003-0636-7930</uri>
      </author>
      <author>
        <name>Kibler, D</name>
      </author>
      <author>
        <name>Sandmeyer, SB</name>
        <uri>https://orcid.org/0000-0002-5059-9619</uri>
      </author>
    </item>
    <item>
      <title>What Remotely Matters? Understanding Individual, Team, and Organizational Factors in Remote Work at Scale</title>
      <link>https://escholarship.org/uc/item/8sd2q0tt</link>
      <description>Although knowledge workers are increasingly able to adopt remote and hybrid working arrangements and work productively, many organizations continue to question the effectiveness of remote work and focus on its concerns and challenges. Previous CSCW research shows that remote workers have limited awareness of other workers, require more explicit coordination, and feel excluded from in-person colleagues. Research also shows that adopting work practices and technologies that are remote work-friendly can offset many of these challenges. Identifying which effective practices and challenges are most helpful or hurtful to remote workers-and how workplace attributes (e.g., team structure; communication frequency; tool use) affect them-could strengthen organizations' strategies and policies for remote work. Through a theoretically-informed survey of 1,526 U.S. knowledge workers, we find many factors prior research has argued as essential to remote work, such as knowing your teammates personally,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8sd2q0tt</guid>
      <pubDate>Thu, 15 Jan 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Garg, Kapil</name>
      </author>
      <author>
        <name>Gómez-Zará, Diego</name>
      </author>
      <author>
        <name>Gerber, Elizabeth</name>
      </author>
      <author>
        <name>Gergle, Darren</name>
      </author>
      <author>
        <name>Contractor, Noshir</name>
      </author>
      <author>
        <name>Massimi, Michael</name>
      </author>
    </item>
    <item>
      <title>Lower Bounds for Non-adaptive Shortest Path Relaxation</title>
      <link>https://escholarship.org/uc/item/8xf4c1sg</link>
      <description>We consider single-source shortest path algorithms that perform a sequence of relaxation steps whose ordering depends only on the input graph structure and not on its weights or the results of prior steps. Each step examines one edge of the graph, and replaces the tentative distance to the endpoint of the edge by its minimum with the tentative distance to the start of the edge, plus the edge length. As we prove, among such algorithms, the Bellman-Ford algorithm has optimal complexity for dense graphs and near-optimal complexity for sparse graphs, as a function of the number of edges and vertices in the given graph. Our analysis holds both for deterministic algorithms and for randomized algorithms that find shortest path distances with high probability.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8xf4c1sg</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
    </item>
    <item>
      <title>Stack-Number is Not Bounded by Queue-Number</title>
      <link>https://escholarship.org/uc/item/8vr2g2bx</link>
      <description>We describe a family of graphs with queue-number at most 4 but unbounded stack-number. This resolves open problems of Heath, Leighton and Rosenberg (1992) and Blankenship and Oporowski (1999).</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8vr2g2bx</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Dujmović, Vida</name>
      </author>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Hickingbotham, Robert</name>
      </author>
      <author>
        <name>Morin, Pat</name>
      </author>
      <author>
        <name>Wood, David R</name>
      </author>
    </item>
    <item>
      <title>Orthogonal Dissection into Few Rectangles</title>
      <link>https://escholarship.org/uc/item/7vk4h9x2</link>
      <description>We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and translations. The number of rectangles is the rank of the Dehn invariant of the polygon.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7vk4h9x2</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, D</name>
      </author>
    </item>
    <item>
      <title>Non-Euclidean Erdos-Anning Theorems</title>
      <link>https://escholarship.org/uc/item/6p42s47v</link>
      <description>The Erdos-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter δ, at most O(δ2) points can have integer distances from all three triangle vertices. We prove the same results for any strictly convex distance function on the plane, and analogous results for every two-dimensional complete Riemannian manifold of bounded genus and for geodesic distance on the boundary of every three-dimensional Euclidean convex set. As a consequence, we resolve a 1983 question of Richard Guy on the equilateral dimension of Riemannian manifolds. Our proofs are based on the properties of additively weighted Voronoi diagrams of these distances.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6p42s47v</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, D</name>
      </author>
    </item>
    <item>
      <title>Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs</title>
      <link>https://escholarship.org/uc/item/5cz9305t</link>
      <description>We study methods to manipulate weights in stress-graph embeddings to improve convex straight-line planar drawings of 3-connected planar graphs. Stress-graph embeddings are weighted versions of Tutte embeddings, where solving a linear system places vertices at a minimum-energy configuration for a system of springs. A major drawback of the unweighted Tutte embedding is that it often results in drawings with exponential area. We present a number of approaches for choosing better weights. One approach constructs weights (in linear time) that uniformly spread all vertices in a chosen direction, such as parallel to the x- or y-axis. A second approach morphs x- and y-spread drawings to produce a more aesthetically pleasing and uncluttered drawing. We further explore a “kaleidoscope” paradigm for this xy-morph approach, where we rotate the coordinate axes so as to find the best spreads and morphs. A third approach chooses the weight of each edge according to its depth in a spanning tree...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5cz9305t</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Chiu, Alvin</name>
      </author>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Goodrich, Michael T</name>
      </author>
    </item>
    <item>
      <title>Locked and Unlocked Smooth Embeddings of Surfaces</title>
      <link>https://escholarship.org/uc/item/4r11t4px</link>
      <description>We study the continuous motion of smooth isometric embeddings of a planar surface in three-dimensional Euclidean space, and two related discrete analogues of these embeddings, polygonal embeddings and flat foldings without interior vertices, under continuous changes of the embedding or folding. We show that every starshaped or spiral-shaped domain is unlocked: a continuous motion unfolds it to a flat embedding. However, disks with two holes can have locked embeddings that are topologically equivalent to a flat embedding but cannot reach a flat embedding by continuous motion.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4r11t4px</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, D</name>
      </author>
    </item>
    <item>
      <title>Noncrossing Longest Paths and Cycles</title>
      <link>https://escholarship.org/uc/item/4hk5n3pg</link>
      <description>Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short geometric structures such as shortest perfect matchings, shortest spanning trees, shortest spanning paths, and shortest spanning cycles on a given point set are inherently noncrossing. However, the longest such structures need not be noncrossing. In fact, it is intuitive to expect many edge crossings in various geometric graphs that are longest.Recently, Álvarez-Rebollar, Cravioto-Lagos, Marín, Solé-Pi, and Urrutia (Graphs and Combinatorics, 2024) constructed a set of points for which the longest perfect matching is noncrossing. They raised several challenging questions in this direction. In particular, they asked whether the longest spanning path, on every finite set of points in the plane, must have a pair of crossing edges. They also conjectured that the longest spanning cycle must have a pair of...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4hk5n3pg</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Aloupis, Greg</name>
      </author>
      <author>
        <name>Biniaz, Ahmad</name>
      </author>
      <author>
        <name>Bose, Prosenjit</name>
      </author>
      <author>
        <name>De Carufel, Jean-Lou</name>
      </author>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Maheshwari, Anil</name>
      </author>
      <author>
        <name>Odak, Saeed</name>
      </author>
      <author>
        <name>Smid, Michiel</name>
      </author>
      <author>
        <name>Tóth, Csaba D</name>
      </author>
      <author>
        <name>Valtr, Pavel</name>
      </author>
    </item>
    <item>
      <title>On the Biplanarity of Blowups</title>
      <link>https://escholarship.org/uc/item/4ch9d6nt</link>
      <description>The 2-blowup of a graph is obtained by replacing each vertex with two non-adjacent copies; a graph is biplanar if it is the union of two planar graphs. We disprove a conjecture of Gethner that 2-blowups of planar graphs are biplanar: iterated Kleetopes are counterexamples. Additionally, we construct biplanar drawings of 2-blowups of planar graphs whose duals have two-path induced path partitions, and drawings with split thickness two of 2-blowups of 3-chromatic planar graphs, and of graphs that can be decomposed into a Hamiltonian path and a dual Hamiltonian path.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4ch9d6nt</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
    </item>
    <item>
      <title>Quasipolynomiality of the Smallest Missing Induced Subgraph</title>
      <link>https://escholarship.org/uc/item/3m42661w</link>
      <description>We study the problem of finding the smallest graph that does not occur as an induced subgraph of a given graph. This missing induced subgraph has at most logarithmic size and can be found by a brute-force search, in an $n$-vertex graph, in time $n^{O(\log n)}$. We show that under the Exponential Time Hypothesis this quasipolynomial time bound is optimal. We also consider variations of the problem in which either the missing subgraph or the given graph comes from a restricted graph family; for instance, we prove that the smallest missing planar induced subgraph of a given planar graph can be found in polynomial time.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3m42661w</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Lincoln, Andrea</name>
      </author>
      <author>
        <name>Vassilevska Williams, Virginia</name>
      </author>
    </item>
    <item>
      <title>Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing</title>
      <link>https://escholarship.org/uc/item/35q5x6tf</link>
      <description>We provide the first approximation quality guarantees for the Cuthull-McKee heuristic for reordering symmetric matrices to have low bandwidth, and we provide an algorithm for reconstructing bounded-bandwidth graphs from distance oracles with near-linear query complexity. To prove these results we introduce a new width parameter, BFS width, and we prove polylogarithmic upper and lower bounds on the BFS width of graphs of bounded bandwidth. Unlike other width parameters, such as bandwidth, pathwidth, and treewidth, BFS width can easily be computed in polynomial time. Bounded BFS width implies bounded bandwidth, pathwidth, and treewidth, which in turn imply fixed-parameter tractable algorithms for many problems that are NP-hard for general graphs. In addition to their applications to matrix ordering, we also provide applications of BFS width to graph reconstruction, to reconstruct graphs from distance queries, and graph drawing, to construct arc diagrams of small height.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/35q5x6tf</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, D</name>
      </author>
      <author>
        <name>Goodrich, MT</name>
        <uri>https://orcid.org/0000-0002-8943-191X</uri>
      </author>
      <author>
        <name>Liu, S</name>
        <uri>https://orcid.org/0009-0003-1255-7156</uri>
      </author>
    </item>
    <item>
      <title>Computational Geometry with Probabilistically Noisy Primitive Operations</title>
      <link>https://escholarship.org/uc/item/2z8632j4</link>
      <description>Much prior work has been done on designing computational geometry algorithms that handle input degeneracies, data imprecision, and arithmetic round-off errors. We take a new approach, inspired by the noisy sorting literature, and study computational geometry algorithms subject to noisy Boolean primitive operations in which, e.g., the comparison “is point q above line ℓ?” returns the wrong answer with some fixed probability. We propose a novel technique called path-guided pushdown random walks that generalizes the results of noisy sorting. We apply this technique to solve point-location, plane-sweep, convex hulls in 2D and 3D, and Delaunay triangulations for noisy primitives in optimal time with high probability.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2z8632j4</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, D</name>
      </author>
      <author>
        <name>Goodrich, MT</name>
        <uri>https://orcid.org/0000-0002-8943-191X</uri>
      </author>
      <author>
        <name>Sridhar, V</name>
        <uri>https://orcid.org/0009-0009-3549-9589</uri>
      </author>
    </item>
    <item>
      <title>On Polyhedral Realization with Isosceles Triangles</title>
      <link>https://escholarship.org/uc/item/0bv8n96m</link>
      <description>Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene triangle. Our construction is based on Kleetopes, and shows that there exists an integer i such that all convex i-iterated Kleetopes have a scalene face. However, we also show that all Kleetopes of triangulated polyhedral graphs have non-convex non-self-crossing realizations in which all faces are isosceles. We answer another question of Malkevitch by observing that a spherical tiling of Dawson (Renaissance Banff, Bridges Conference, pp. 489–496, 2005) leads to a fourth infinite family of convex polyhedra in which all faces are congruent isosceles triangles, adding one to the three families previously known to Malkevitch. We prove that the graphs of convex polyhedra with congruent isosceles faces have bounded diameter and have dominating sets of bounded...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0bv8n96m</guid>
      <pubDate>Wed, 19 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
    </item>
    <item>
      <title>Estimating causal effects for binary outcomes using per-decision inverse probability weighting</title>
      <link>https://escholarship.org/uc/item/8wp4v5h2</link>
      <description>Micro-randomized trials are commonly conducted for optimizing mobile health interventions such as push notifications for behavior change. In analyzing such trials, causal excursion effects are often of primary interest, and their estimation typically involves inverse probability weighting (IPW). However, in a micro-randomized trial, additional treatments can often occur during the time window over which an outcome is defined, and this can greatly inflate the variance of the causal effect estimator because IPW would involve a product of numerous weights. To reduce variance and improve estimation efficiency, we propose two new estimators using a modified version of IPW, which we call "per-decision IPW." The second estimator further improves efficiency using the projection idea from the semiparametric efficiency theory. These estimators are applicable when the outcome is binary and can be expressed as the maximum of a series of sub-outcomes defined over sub-intervals of time. We...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8wp4v5h2</guid>
      <pubDate>Tue, 11 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Bao, Yihan</name>
      </author>
      <author>
        <name>Bell, Lauren</name>
      </author>
      <author>
        <name>Williamson, Elizabeth</name>
      </author>
      <author>
        <name>Garnett, Claire</name>
      </author>
      <author>
        <name>Qian, Tianchen</name>
        <uri>https://orcid.org/0000-0003-4282-7826</uri>
      </author>
    </item>
    <item>
      <title>Distal causal excursion effects: modeling long-term effects of time-varying treatments in micro-randomized trials</title>
      <link>https://escholarship.org/uc/item/8vd1c18h</link>
      <description>Micro-randomized trials (MRTs) play a crucial role in optimizing digital interventions. In an MRT, each participant is sequentially randomized among treatment options hundreds of times. While the interventions tested in MRTs target short-term behavioral responses (proximal outcomes), their ultimate goal is to drive long-term behavior change (distal outcomes). However, existing causal inference methods, such as the causal excursion effect, are limited to proximal outcomes, making it challenging to quantify the long-term impact of interventions. To address this gap, we introduce the distal causal excursion effect (DCEE), a novel estimand that quantifies the long-term effect of time-varying treatments. The DCEE contrasts distal outcomes under two excursion policies while marginalizing over most treatment assignments, enabling a parsimonious and interpretable causal model even with a large number of decision points. We propose two estimators for the DCEE-one with cross-fitting and...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8vd1c18h</guid>
      <pubDate>Tue, 11 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Qian, Tianchen</name>
        <uri>https://orcid.org/0000-0003-4282-7826</uri>
      </author>
    </item>
    <item>
      <title>Ambulatory assessment to predict problem anger in trauma-affected adults: Study protocol</title>
      <link>https://escholarship.org/uc/item/8717t3xr</link>
      <description>BACKGROUND: Problem anger is common after experiencing a traumatic event. Current evidence-driven treatment options are limited, and problem anger negatively affects an individual's capacity to engage with traditional psychological treatments. Smartphone interventions hold significant potential in mental health because of their ability to deliver low-intensity, precision support for individuals at the time and place they need it most. While wearable technology has the capacity to augment smartphone-delivered interventions, there is a dearth of evidence relating to several key areas, including feasibility of compliance in mental health populations; validity of in vivo anger assessment; ability to predict future mood states; and delivery of timely and appropriate interventions.
METHODS: This protocol describes a cohort study that leverages 10 days of ambulatory assessment in the form of ecological momentary assessment and a wearable. Approximately 100 adults with problem anger will...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8717t3xr</guid>
      <pubDate>Tue, 11 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Metcalf, Olivia</name>
      </author>
      <author>
        <name>Finlayson-Short, Laura</name>
      </author>
      <author>
        <name>Lamb, Karen E</name>
      </author>
      <author>
        <name>Zaloumis, Sophie</name>
      </author>
      <author>
        <name>O’Donnell, Meaghan L</name>
      </author>
      <author>
        <name>Qian, Tianchen</name>
        <uri>https://orcid.org/0000-0003-4282-7826</uri>
      </author>
      <author>
        <name>Varker, Tracey</name>
      </author>
      <author>
        <name>Cowlishaw, Sean</name>
      </author>
      <author>
        <name>Brotman, Melissa</name>
      </author>
      <author>
        <name>Forbes, David</name>
      </author>
    </item>
    <item>
      <title>Autoimmune antibodies and systemic inflammatory markers are prevalent and associated with cognition in individuals aged 90+</title>
      <link>https://escholarship.org/uc/item/5n0973jm</link>
      <description>BackgroundWhile recent studies have found associations between markers of autoimmunity/inflammation and cognitive performance in individuals aged 60-90, these findings remain unexplored in individuals aged 90 and above.ObjectiveTo examine the prevalence of autoimmune antibodies and raised inflammatory markers and their associations with cognition in participants aged 90 + .MethodsWe included participants with serological testing from The 90+ Study, a community-based longitudinal study in southern California. For measures of autoimmunity, we evaluated antinuclear, antineutrophil cytoplasmic (ANCA), rheumatoid factor, double stranded DNA, antithyroglobulin, and thyroid peroxidase antibodies. For inflammatory markers, we examined interleukin-6 (IL-6) and erythrocyte sedimentation rate (ESR). To examine the relationship between autoimmune antibodies and inflammatory markers with cognitive performance, we ran linear mixed effects models.ResultsAmong 201 participants (mean age 94.8...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5n0973jm</guid>
      <pubDate>Tue, 11 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Farahmand, Ghasem</name>
      </author>
      <author>
        <name>Leiby, Anne-Marie C</name>
      </author>
      <author>
        <name>Yu, Jiaxin</name>
      </author>
      <author>
        <name>Ramanathan, Aanan</name>
      </author>
      <author>
        <name>Javaheri, Rojan</name>
      </author>
      <author>
        <name>Kawas, Claudia H</name>
      </author>
      <author>
        <name>Woodworth, Davis C</name>
      </author>
      <author>
        <name>Corrada, Maria M</name>
      </author>
      <author>
        <name>Qian, Tianchen</name>
        <uri>https://orcid.org/0000-0003-4282-7826</uri>
      </author>
      <author>
        <name>Sajjadi, S Ahmad</name>
        <uri>https://orcid.org/0000-0002-8960-2213</uri>
      </author>
    </item>
    <item>
      <title>Predicting high anger intensity using ecological momentary assessment and wearable-derived physiological data in a trauma-affected sample</title>
      <link>https://escholarship.org/uc/item/11t2k02h</link>
      <description>&lt;b&gt;Background:&lt;/b&gt; Digital technologies offer tremendous potential to predict dysregulated mood and behavior within an individual's environment, and in doing so can support the development of new digital health interventions. However, no prediction models have been built in trauma-exposed populations that leverage real-world data.&lt;b&gt;Objective:&lt;/b&gt; This project aimed to determine if wearable-derived physiological data can predict anger intensity in trauma-exposed adults.&lt;b&gt;Method:&lt;/b&gt; Heart rate variability (i.e. a commercial wearable stress score) was combined with ecological momentary assessment (EMA) data collected over 10 days (&lt;i&gt;n&lt;/i&gt; = 84). Five summary measures from stress scores collected 10 min prior to each EMA were selected using factor analysis of 24 candidates.&lt;b&gt;Results:&lt;/b&gt; A high area under the receiver operating curve (AUC) was found for a logistic mixed effects model including these measures as predictors, ranging 0.761 (95% CI:0.569-0.921) to 0.899 (95% CI:0.784-0.980)...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/11t2k02h</guid>
      <pubDate>Tue, 11 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Metcalf, Olivia</name>
      </author>
      <author>
        <name>Lamb, Karen E</name>
      </author>
      <author>
        <name>Forbes, David</name>
      </author>
      <author>
        <name>O’Donnell, Meaghan L</name>
      </author>
      <author>
        <name>Qian, Tianchen</name>
        <uri>https://orcid.org/0000-0003-4282-7826</uri>
      </author>
      <author>
        <name>Varker, Tracey</name>
      </author>
      <author>
        <name>Cowlishaw, Sean</name>
      </author>
      <author>
        <name>Zaloumis, Sophie</name>
      </author>
    </item>
    <item>
      <title>Data-rate-aware FPGA-based Acceleration Framework for Streaming Applications</title>
      <link>https://escholarship.org/uc/item/5qc6s3rx</link>
      <description>In heterogeneous architectures, FPGAs are not only expected to provide higher performance, but also to provide a more energy efficient solution for computationally intensive tasks. While parallelism and pipelining enhance performance on FPGA platforms, the data transfer rate from/to off-chip memory can cause performance degradation. We propose an automated high-level synthesis framework for FPGA-based acceleration of nested loops on large multidimensional input data sets. Given the high-level of parallelism in such applications, our proposed data prefetching algorithm determines the data rate for each parallel datapath. The empirical results on a case study in scientific computing show that FPGA mapping of such nested loops accelerates the application compared to traditional mapping on multicores. The FPGA-accelerated computation results in 3x speedup in runtime and 27x energy-delay-product savings compared to multicore computation.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5qc6s3rx</guid>
      <pubDate>Sat, 8 Nov 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Rezaei, Siavash</name>
      </author>
      <author>
        <name>Hernandez-Calderon, Cesar-Alejandro</name>
      </author>
      <author>
        <name>Mirzamohammadi, Saeed</name>
      </author>
      <author>
        <name>Bozorgzadeh, Eli</name>
      </author>
      <author>
        <name>Veeidenbaum, Alexander</name>
      </author>
      <author>
        <name>Nicolau, Alex</name>
        <uri>https://orcid.org/0009-0003-9833-8455</uri>
      </author>
      <author>
        <name>Prather, Michael J</name>
        <uri>https://orcid.org/0000-0002-9442-8109</uri>
      </author>
    </item>
    <item>
      <title>Understanding How Personal Activities Are Shared In Short-form Videos</title>
      <link>https://escholarship.org/uc/item/5bp9q190</link>
      <description>Sharing activities that people do in everyday life, such as physical activity, health management, or hobbies, help people receive benefits like social support and positive self-presentation. Short-form videos present new opportunities for activity-sharing, which has traditionally been studied in static contexts like text- and image-sharing. We therefore aim to understand what information people incorporate into short-form activity videos, and how. We qualitatively analyzed 420 short-form activity videos on TikTok across three domains: running, studying, and sketching. We found people often present information before, during, and after activities, developing strategies for qualitatively and quantitatively incorporating activity-relevant information in each. We also uncover practices for aligning the sharing of activity-relevant information with the nature of short-form videos, such as modifying broader-scale goals into video-scale goals. We further discuss design opportunities...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5bp9q190</guid>
      <pubDate>Wed, 22 Oct 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Wang, Dennis</name>
      </author>
      <author>
        <name>Zhu, Jun</name>
      </author>
      <author>
        <name>Epstein, Daniel A</name>
        <uri>https://orcid.org/0000-0002-2657-6345</uri>
      </author>
    </item>
    <item>
      <title>SNICAR-ADv3: a community tool for modeling spectral snow albedo</title>
      <link>https://escholarship.org/uc/item/98p088qf</link>
      <description>The Snow, Ice, and Aerosol Radiative (SNICAR) model has been used in various capacities over the last 15 years to model the spectral albedo of snow with light-absorbing constituents (LACs). Recent studies have extended the model to include an adding-doubling two-stream solver and representations of non-spherical ice particles; carbon dioxide snow; snow algae; and new types of mineral dust, volcanic ash, and brown carbon. New options also exist for ice refractive indices and solar-zenith-angle-dependent surface spectral irradiances used to derive broadband albedo. The model spectral range was also extended deeper into the ultraviolet for studies of extraterrestrial and high-altitude cryospheric surfaces. Until now, however, these improvements and capabilities have not been merged into a unified code base. Here, we document the formulation and evaluation of the publicly available SNICAR-ADv3 source code, web-based model, and accompanying library of constituent optical properties....</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/98p088qf</guid>
      <pubDate>Wed, 8 Oct 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Flanner, Mark G</name>
      </author>
      <author>
        <name>Arnheim, Julian B</name>
      </author>
      <author>
        <name>Cook, Joseph M</name>
      </author>
      <author>
        <name>Dang, Cheng</name>
      </author>
      <author>
        <name>He, Cenlin</name>
      </author>
      <author>
        <name>Huang, Xianglei</name>
      </author>
      <author>
        <name>Singh, Deepak</name>
      </author>
      <author>
        <name>Skiles, S McKenzie</name>
      </author>
      <author>
        <name>Whicker, Chloe A</name>
      </author>
      <author>
        <name>Zender, Charles S</name>
        <uri>https://orcid.org/0000-0003-0129-8024</uri>
      </author>
    </item>
    <item>
      <title>A Framework for Variational Inference and Data Assimilation of Soil Biogeochemical Models Using Normalizing Flows</title>
      <link>https://escholarship.org/uc/item/8fb053sp</link>
      <description>Soil biogeochemical models (SBMs) represent soil variables and their responses to global change. Data assimilation approaches help determine whether SBMs accurately represent soil processes consistent with soil pool and flux measurements. Bayesian inference is commonly used in data assimilation procedures that estimate posterior parameter distributions with Markov chain Monte Carlo (MCMC) methods. The ability to account for data and parameter uncertainty is a strength of MCMC inference, but the computational inefficiency of MCMC methods remains a barrier to their wider application, especially with large data sets. Given the limitations of MCMC approaches, we developed an alternative variational inference framework that uses a method called normalizing flows from the field of machine learning. Normalizing flows rely on deep learning to map probability distributions and approximate SBMs that have been discretized into state space models. As a test of our method, we fit approximated...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8fb053sp</guid>
      <pubDate>Thu, 2 Oct 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Xie, HW</name>
      </author>
      <author>
        <name>Sujono, D</name>
      </author>
      <author>
        <name>Ryder, T</name>
      </author>
      <author>
        <name>Sudderth, EB</name>
      </author>
      <author>
        <name>Allison, SD</name>
        <uri>https://orcid.org/0000-0003-4629-7842</uri>
      </author>
    </item>
    <item>
      <title>Understanding Mental Wellbeing and Tools for Support with Taiwanese Emerging Adults: An Eastern Cultural Perspective</title>
      <link>https://escholarship.org/uc/item/65s7b1bp</link>
      <description>Understanding Mental Wellbeing and Tools for Support with Taiwanese Emerging Adults: An Eastern Cultural Perspective</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/65s7b1bp</guid>
      <pubDate>Thu, 25 Sep 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Cheng, Nai-Yu</name>
      </author>
      <author>
        <name>Wong, Novia</name>
      </author>
      <author>
        <name>Reddy, Madhu</name>
      </author>
    </item>
    <item>
      <title>'It's a spectrum': Exploring Autonomy, Competence, and Relatedness in Software Development Processes and Tools</title>
      <link>https://escholarship.org/uc/item/33n3t4dg</link>
      <description>The recent surge of research on software developer mental health challenges highlights the importance and urgency of studying solutions to support developer wellbeing. Self-Determination Theory (SDT) offers a valuable framework for exploring wellbeing at work, emphasizing the need to satisfy three psychological needs: autonomy, competence, and relatedness. This paper presents an interview study with 31 software developers in the United States that uses SDT as a guide, exploring how these three needs are perceived and influenced in the work of software developers. We identify specific factors and processes at work and work tools and designs that impact developers' psychological needs and satisfaction. Results from our study can help design targeted solutions to satisfy developers psychological needs, which indirectly support developer wellbeing. This paper highlights the necessity of healthy work cultures in software development and presents design considerations for creating tools...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/33n3t4dg</guid>
      <pubDate>Thu, 25 Sep 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Wong, Novia</name>
      </author>
      <author>
        <name>Cheng, Nai-Yu</name>
      </author>
      <author>
        <name>Oewel, Bruna</name>
      </author>
      <author>
        <name>Genuario, Katherine E</name>
      </author>
      <author>
        <name>Stoeckl, SarahElizabeth</name>
      </author>
      <author>
        <name>Schueller, Stephen M</name>
        <uri>https://orcid.org/0000-0002-1003-0399</uri>
      </author>
      <author>
        <name>Ahmed, Iftekhar</name>
      </author>
      <author>
        <name>van der Hoek, André</name>
      </author>
      <author>
        <name>Reddy, Madhu</name>
      </author>
    </item>
    <item>
      <title>Single-cell spatial transcriptomics reveals distinct patterns of dysregulation in non-neuronal and neuronal cells induced by the Trem2R47H Alzheimer’s risk gene mutation</title>
      <link>https://escholarship.org/uc/item/71v7f231</link>
      <description>The R47H missense mutation of the TREM2 gene is a known risk factor for development of Alzheimer’s Disease. In this study, we analyze the impact of the Trem2R47H mutation on specific cell types in multiple cortical and subcortical brain regions in the context of wild-type and 5xFAD mouse background. We profile 19 mouse brain sections consisting of wild-type, Trem2R47H, 5xFAD and Trem2R47H; 5xFAD genotypes using MERFISH spatial transcriptomics, a technique that enables subcellular profiling of spatial gene expression. Spatial transcriptomics and neuropathology data are analyzed using our custom pipeline to identify plaque and Trem2R47H-induced transcriptomic dysregulation. We initially analyze&amp;nbsp;cell type-specific transcriptomic alterations induced by plaque proximity. Next, we analyze spatial distributions of disease associated microglia and astrocytes, and how they vary between 5xFAD and Trem2R47H; 5xFAD mouse models. Finally, we analyze the impact of the Trem2R47H mutation&amp;nbsp;on...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/71v7f231</guid>
      <pubDate>Thu, 11 Sep 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Johnston, Kevin G</name>
      </author>
      <author>
        <name>Berackey, Bereket T</name>
      </author>
      <author>
        <name>Tran, Kristine M</name>
      </author>
      <author>
        <name>Gelber, Alon</name>
      </author>
      <author>
        <name>Yu, Zhaoxia</name>
        <uri>https://orcid.org/0000-0001-9700-1795</uri>
      </author>
      <author>
        <name>MacGregor, Grant R</name>
      </author>
      <author>
        <name>Mukamel, Eran A</name>
        <uri>https://orcid.org/0000-0003-3203-9535</uri>
      </author>
      <author>
        <name>Tan, Zhiqun</name>
      </author>
      <author>
        <name>Green, Kim N</name>
        <uri>https://orcid.org/0000-0002-6049-6744</uri>
      </author>
      <author>
        <name>Xu, Xiangmin</name>
        <uri>https://orcid.org/0000-0002-5828-1533</uri>
      </author>
    </item>
    <item>
      <title>An AAV capsid proposed as microglia-targeting directs genetic expression in forebrain excitatory neurons</title>
      <link>https://escholarship.org/uc/item/7rg946z5</link>
      <description>A newly developed capsid AAV-MG1.2 was reported to mediate specific microglial transduction. However, we find that AAV-MG1.2 actually enables specific genetic access to excitatory neurons in forebrain regions including hippocampal formation and visual cortex but does not confer expression in microglia or astrocytes in vivo. Furthermore, we find that AAV-MG1.2 specifically labels the deep layer of the CA1 pyramidal layer in a titer-dependent manner. We show that AAV-MG1.2-Cre can be used to genetically target excitatory neurons for cell-type-specific neural circuit mapping studies. We also find that AAV-MG1.2 conserves specificity for excitatory neurons in rat hippocampus. Thus, the AAV-MG1.2 presents a useful viral-genetic tool for targeting excitatory neurons in the forebrain across different species.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7rg946z5</guid>
      <pubDate>Wed, 10 Sep 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Cao, Wenhao</name>
      </author>
      <author>
        <name>Tan, Zhiqun</name>
      </author>
      <author>
        <name>Berackey, Bereket T</name>
      </author>
      <author>
        <name>Nguyen, Jason K</name>
      </author>
      <author>
        <name>Brown, Sara R</name>
      </author>
      <author>
        <name>Du, Shiyang</name>
      </author>
      <author>
        <name>Lin, Bin</name>
      </author>
      <author>
        <name>Ye, Qiao</name>
      </author>
      <author>
        <name>Seiler, Magdalene</name>
        <uri>https://orcid.org/0000-0002-0869-9923</uri>
      </author>
      <author>
        <name>Holmes, Todd C</name>
      </author>
      <author>
        <name>Xu, Xiangmin</name>
        <uri>https://orcid.org/0000-0002-5828-1533</uri>
      </author>
    </item>
    <item>
      <title>Supernova pointing capabilities of DUNE</title>
      <link>https://escholarship.org/uc/item/60h5f1d3</link>
      <description>The determination of the direction of a stellar core collapse via its neutrino emission is crucial for the identification of the progenitor for a multimessenger follow-up. A highly effective method of reconstructing supernova directions within the Deep Underground Neutrino Experiment (DUNE) is introduced. The supernova neutrino pointing resolution is studied by simulating and reconstructing electron-neutrino charged-current absorption on  and elastic scattering of neutrinos on electrons. Procedures to reconstruct individual interactions, including a newly developed technique called “brems flipping,” as well as the burst direction from an ensemble of interactions are described. Performance of the burst direction reconstruction is evaluated for supernovae happening at a distance of 10&amp;nbsp;kpc for a specific supernova burst flux model. The pointing resolution is found to be 3.4&amp;nbsp;degrees at 68% coverage for a perfect interaction-channel classification and a fiducial mass of 40&amp;nbsp;kton,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/60h5f1d3</guid>
      <pubDate>Fri, 15 Aug 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Abud, A Abed</name>
      </author>
      <author>
        <name>Abi, B</name>
      </author>
      <author>
        <name>Acciarri, R</name>
      </author>
      <author>
        <name>Acero, MA</name>
      </author>
      <author>
        <name>Adames, MR</name>
      </author>
      <author>
        <name>Adamov, G</name>
      </author>
      <author>
        <name>Adamowski, M</name>
      </author>
      <author>
        <name>Adams, D</name>
      </author>
      <author>
        <name>Adinolfi, M</name>
      </author>
      <author>
        <name>Adriano, C</name>
      </author>
      <author>
        <name>Aduszkiewicz, A</name>
      </author>
      <author>
        <name>Aguilar, J</name>
      </author>
      <author>
        <name>Aimard, B</name>
      </author>
      <author>
        <name>Akbar, F</name>
      </author>
      <author>
        <name>Allison, K</name>
      </author>
      <author>
        <name>Monsalve, S Alonso</name>
      </author>
      <author>
        <name>Alrashed, M</name>
      </author>
      <author>
        <name>Alton, A</name>
      </author>
      <author>
        <name>Alvarez, R</name>
      </author>
      <author>
        <name>Alves, T</name>
      </author>
      <author>
        <name>Amar, H</name>
      </author>
      <author>
        <name>Amedo, P</name>
      </author>
      <author>
        <name>Anderson, J</name>
      </author>
      <author>
        <name>Andrade, DA</name>
      </author>
      <author>
        <name>Andreopoulos, C</name>
      </author>
      <author>
        <name>Andreotti, M</name>
      </author>
      <author>
        <name>Andrews, MP</name>
      </author>
      <author>
        <name>Andrianala, F</name>
      </author>
      <author>
        <name>Andringa, S</name>
      </author>
      <author>
        <name>Anfimov, N</name>
      </author>
      <author>
        <name>Ankowski, A</name>
      </author>
      <author>
        <name>Antoniassi, M</name>
      </author>
      <author>
        <name>Antonova, M</name>
      </author>
      <author>
        <name>Antoshkin, A</name>
      </author>
      <author>
        <name>Aranda-Fernandez, A</name>
      </author>
      <author>
        <name>Arellano, L</name>
      </author>
      <author>
        <name>Diaz, E Arrieta</name>
      </author>
      <author>
        <name>Arroyave, MA</name>
      </author>
      <author>
        <name>Asaadi, J</name>
      </author>
      <author>
        <name>Ashkenazi, A</name>
      </author>
      <author>
        <name>Asner, D</name>
      </author>
      <author>
        <name>Asquith, L</name>
      </author>
      <author>
        <name>Atkin, E</name>
      </author>
      <author>
        <name>Auguste, D</name>
      </author>
      <author>
        <name>Aurisano, A</name>
      </author>
      <author>
        <name>Aushev, V</name>
      </author>
      <author>
        <name>Autiero, D</name>
      </author>
      <author>
        <name>Azfar, F</name>
      </author>
      <author>
        <name>Back, A</name>
      </author>
      <author>
        <name>Back, H</name>
      </author>
      <author>
        <name>Back, JJ</name>
      </author>
      <author>
        <name>Bagaturia, I</name>
      </author>
      <author>
        <name>Bagby, L</name>
      </author>
      <author>
        <name>Balashov, N</name>
      </author>
      <author>
        <name>Balasubramanian, S</name>
      </author>
      <author>
        <name>Baldi, P</name>
        <uri>https://orcid.org/0000-0003-0636-7930</uri>
      </author>
      <author>
        <name>Baldini, W</name>
      </author>
      <author>
        <name>Baldonedo, J</name>
      </author>
      <author>
        <name>Baller, B</name>
      </author>
      <author>
        <name>Bambah, B</name>
      </author>
      <author>
        <name>Banerjee, R</name>
      </author>
      <author>
        <name>Barao, F</name>
      </author>
      <author>
        <name>Barenboim, G</name>
      </author>
      <author>
        <name>Alzás, P Barham</name>
      </author>
      <author>
        <name>Barker, GJ</name>
      </author>
      <author>
        <name>Barkhouse, W</name>
      </author>
      <author>
        <name>Barr, G</name>
      </author>
      <author>
        <name>Monarca, J Barranco</name>
      </author>
      <author>
        <name>Barros, A</name>
      </author>
      <author>
        <name>Barros, N</name>
      </author>
      <author>
        <name>Barrow, D</name>
      </author>
      <author>
        <name>Barrow, JL</name>
      </author>
      <author>
        <name>Basharina-Freshville, A</name>
      </author>
      <author>
        <name>Bashyal, A</name>
      </author>
      <author>
        <name>Basque, V</name>
      </author>
      <author>
        <name>Batchelor, C</name>
      </author>
      <author>
        <name>Bathe-Peters, L</name>
      </author>
      <author>
        <name>Battat, JBR</name>
      </author>
      <author>
        <name>Battisti, F</name>
      </author>
      <author>
        <name>Bay, F</name>
      </author>
      <author>
        <name>Bazetto, MCQ</name>
      </author>
      <author>
        <name>Alba, JLL Bazo</name>
      </author>
      <author>
        <name>Beacom, JF</name>
      </author>
      <author>
        <name>Bechetoille, E</name>
      </author>
      <author>
        <name>Behera, B</name>
      </author>
      <author>
        <name>Belchior, E</name>
      </author>
      <author>
        <name>Bell, G</name>
      </author>
      <author>
        <name>Bellantoni, L</name>
      </author>
      <author>
        <name>Bellettini, G</name>
      </author>
      <author>
        <name>Bellini, V</name>
      </author>
      <author>
        <name>Beltramello, O</name>
      </author>
      <author>
        <name>Benekos, N</name>
      </author>
      <author>
        <name>Montiel, C Benitez</name>
      </author>
      <author>
        <name>Benjamin, D</name>
      </author>
      <author>
        <name>Neves, F Bento</name>
      </author>
      <author>
        <name>Berger, J</name>
      </author>
      <author>
        <name>Berkman, S</name>
      </author>
      <author>
        <name>Bernal, J</name>
      </author>
      <author>
        <name>Bernardini, P</name>
      </author>
      <author>
        <name>Bersani, A</name>
      </author>
    </item>
    <item>
      <title>From images to detection: Machine learning for blood pattern classification</title>
      <link>https://escholarship.org/uc/item/56x1x1v8</link>
      <description>Bloodstain Pattern Analysis (BPA) helps us understand how bloodstains form, with a focus on their size, shape, and distributions. This aids in crime scene reconstruction and provides insight into victim positions and crime investigation. One challenge in BPA is distinguishing between different types of bloodstains, such as those from firearms, impacts, or other mechanisms. Our study focuses on differentiating impact spatter bloodstain patterns from gunshot backward spatter bloodstain patterns. We distinguish patterns by extracting well-designed individual stain features, applying effective data consolidation methods, and selecting boosting classifiers. As a result, our model exhibits competitive accuracy and efficiency on the tested dataset, suggesting its potential in similar scenarios.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/56x1x1v8</guid>
      <pubDate>Thu, 14 Aug 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Li, Yilin</name>
      </author>
      <author>
        <name>Shen, Weining</name>
        <uri>https://orcid.org/0000-0003-3137-1085</uri>
      </author>
    </item>
    <item>
      <title>Approaches for tailoring between-session mental health therapy activities</title>
      <link>https://escholarship.org/uc/item/90s340r4</link>
      <description>Mental health activities conducted by patients between therapy sessions (or "therapy homework") are a component of addressing anxiety and depression. However, to be effective, therapy homework must be tailored to the client's needs to address the numerous barriers they encounter in everyday life. In this study, we analyze how therapists and clients tailor therapy homework to their client's needs. We interviewed 13 therapists and 14 clients about their experiences tailoring and engaging in therapy homework. We identify criteria for tailoring homework, such as client skills, discomfort, and external barriers. We present how homework gets adapted, such as through changes in difficulty or by identifying alternatives. We discuss how technologies can better use client information for personalizing mental health interventions, such as adapting to client barriers, adjusting homework to these barriers, and creating a safer environment to support discomfort.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/90s340r4</guid>
      <pubDate>Wed, 30 Jul 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Oewel, Bruna</name>
      </author>
      <author>
        <name>Arean, Patricia Anne</name>
      </author>
      <author>
        <name>Agapie, Elena</name>
      </author>
    </item>
    <item>
      <title>Preparing and Experiencing Food During Life Events: Implications for Technology Supporting Social and Value Changes</title>
      <link>https://escholarship.org/uc/item/3z32c080</link>
      <description>Preparing and Experiencing Food During Life Events: Implications for Technology Supporting Social and Value Changes</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3z32c080</guid>
      <pubDate>Wed, 30 Jul 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Ha, Seung Wan</name>
      </author>
      <author>
        <name>Nurain, Novia</name>
      </author>
      <author>
        <name>Agapie, Elena</name>
      </author>
      <author>
        <name>Chung, Chia-Fang</name>
        <uri>https://orcid.org/0000-0002-3374-2073</uri>
      </author>
    </item>
    <item>
      <title>FOVDA: A Federated Architecture for Overcoming Data Silos in Water Domain [Vision]</title>
      <link>https://escholarship.org/uc/item/27f6g9z7</link>
      <description>Effective water management relies on integrating data from diverse sources, including both static and dynamic datasets. However, the challenge of data silos, especially in cities and agencies with disparate systems, has hindered progress in this domain. To address this issue, we introduce FOVDA (Federated Ontology View Data Access), an ontology-driven federated system designed to overcome data silos in the water domain. FOVDA enables seamless data integration and querying across heterogeneous data stores by leveraging a federated architecture and a domain-specific ontology. This system supports both local and global data interoperability, allowing agencies to exchange critical water-related data while maintaining data sovereignty. FOVDA’s federated query engine facilitates complex queries across distributed datasets, enabling decision-makers to access comprehensive insights for tasks such as water resource management, infrastructure resilience analysis, and disaster response....</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/27f6g9z7</guid>
      <pubDate>Wed, 30 Jul 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Luti, Malik</name>
      </author>
      <author>
        <name>Feldman, David</name>
        <uri>https://orcid.org/0000-0003-2288-5017</uri>
      </author>
      <author>
        <name>Hu, ZhengHui</name>
      </author>
      <author>
        <name>Mehrotra, Sharad</name>
      </author>
      <author>
        <name>Mendoza, Marina</name>
      </author>
      <author>
        <name>Venkatasubramanian, Nalini</name>
        <uri>https://orcid.org/0000-0001-7011-2268</uri>
      </author>
      <author>
        <name>Yus, Roberto</name>
      </author>
      <author>
        <name>Eguchi, Ronald</name>
      </author>
    </item>
    <item>
      <title>Conducting Research at the Intersection of HCI and Health: Building and Supporting Teams with Diverse Expertise to Increase Public Health Impact</title>
      <link>https://escholarship.org/uc/item/0322m8bf</link>
      <description>Research at the intersection of human-computer interaction (HCI) and health is increasingly done by collaborative cross-disciplinary teams. The need for cross-disciplinary teams arises from the interdisciplinary nature of the work itself-with the need for expertise in a health discipline, experimental design, statistics, and computer science, in addition to HCI. This work can also increase innovation, transfer of knowledge across fields, and have a higher impact on communities. To succeed at a collaborative project, researchers must effectively form and maintain a team that has the right expertise, integrate research perspectives and work practices, align individual and team goals, and secure funding to support the research. However, successfully operating as a team has been challenging for HCI researchers, and can be limited due to a lack of training, shared vocabularies, lack of institutional incentives, support from funding agencies, and more; which significantly inhibits their...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0322m8bf</guid>
      <pubDate>Wed, 30 Jul 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Agapie, Elena</name>
      </author>
      <author>
        <name>Karkar, Ravi</name>
      </author>
      <author>
        <name>Aung, Tricia</name>
      </author>
      <author>
        <name>Burgess, Eleanor R</name>
      </author>
      <author>
        <name>Chinguwa, Munyaradzi Joel</name>
      </author>
      <author>
        <name>Graham, Andrea K</name>
      </author>
      <author>
        <name>Klasnja, Predrag</name>
      </author>
      <author>
        <name>Lyon, Aaron</name>
      </author>
      <author>
        <name>McCall, Terika</name>
      </author>
      <author>
        <name>Munson, Sean A</name>
      </author>
      <author>
        <name>Nunes, Francisco</name>
      </author>
      <author>
        <name>Osterhage, Katie</name>
      </author>
    </item>
    <item>
      <title>The track-length extension fitting algorithm for energy measurement of interacting particles in liquid argon TPCs and its performance with ProtoDUNE-SP data</title>
      <link>https://escholarship.org/uc/item/1rc2h91p</link>
      <description>This paper introduces a novel track-length extension fitting algorithm for measuring the kinetic energies of inelastically interacting particles in liquid argon time projection chambers (LArTPCs). The algorithm finds the most probable offset in track length for a track-like object by comparing the measured ionization density as a function of position with a theoretical prediction of the energy loss as a function of the energy, including models of electron recombination and detector response. The algorithm can be used to measure the energies of particles that interact before they stop, such as charged pions that are absorbed by argon nuclei. The algorithm's energy measurement resolutions and fractional biases are presented as functions of particle kinetic energy and number of track hits using samples of stopping secondary charged pions in data collected by the ProtoDUNE-SP detector, and also in a detailed simulation. Additional studies describe the impact of the dE/dx model on...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1rc2h91p</guid>
      <pubDate>Fri, 25 Jul 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Abud, A Abed</name>
      </author>
      <author>
        <name>Abi, B</name>
      </author>
      <author>
        <name>Acciarri, R</name>
      </author>
      <author>
        <name>Acero, MA</name>
      </author>
      <author>
        <name>Adames, MR</name>
      </author>
      <author>
        <name>Adamov, G</name>
      </author>
      <author>
        <name>Adamowski, M</name>
      </author>
      <author>
        <name>Adams, D</name>
      </author>
      <author>
        <name>Adinolfi, M</name>
      </author>
      <author>
        <name>Adriano, C</name>
      </author>
      <author>
        <name>Aduszkiewicz, A</name>
      </author>
      <author>
        <name>Aguilar, J</name>
      </author>
      <author>
        <name>Akbar, F</name>
      </author>
      <author>
        <name>Alex, NS</name>
      </author>
      <author>
        <name>Allison, K</name>
      </author>
      <author>
        <name>Monsalve, S Alonso</name>
      </author>
      <author>
        <name>Alrashed, M</name>
      </author>
      <author>
        <name>Alton, A</name>
      </author>
      <author>
        <name>Alvarez, R</name>
      </author>
      <author>
        <name>Alves, T</name>
      </author>
      <author>
        <name>Amar, H</name>
      </author>
      <author>
        <name>Amedo, P</name>
      </author>
      <author>
        <name>Anderson, J</name>
      </author>
      <author>
        <name>Andreopoulos, C</name>
      </author>
      <author>
        <name>Andreotti, M</name>
      </author>
      <author>
        <name>Andrews, MP</name>
      </author>
      <author>
        <name>Andrianala, F</name>
      </author>
      <author>
        <name>Andringa, S</name>
      </author>
      <author>
        <name>Anfimov, N</name>
      </author>
      <author>
        <name>Ankowski, A</name>
      </author>
      <author>
        <name>Antic, D</name>
      </author>
      <author>
        <name>Antoniassi, M</name>
      </author>
      <author>
        <name>Antonova, M</name>
      </author>
      <author>
        <name>Antoshkin, A</name>
      </author>
      <author>
        <name>Aranda-Fernandez, A</name>
      </author>
      <author>
        <name>Arellano, L</name>
      </author>
      <author>
        <name>Diaz, E Arrieta</name>
      </author>
      <author>
        <name>Arroyave, MA</name>
      </author>
      <author>
        <name>Asaadi, J</name>
      </author>
      <author>
        <name>Ashkenazi, A</name>
      </author>
      <author>
        <name>Asner, D</name>
      </author>
      <author>
        <name>Asquith, L</name>
      </author>
      <author>
        <name>Atkin, E</name>
      </author>
      <author>
        <name>Auguste, D</name>
      </author>
      <author>
        <name>Aurisano, A</name>
      </author>
      <author>
        <name>Aushev, V</name>
      </author>
      <author>
        <name>Autiero, D</name>
      </author>
      <author>
        <name>Azam, MB</name>
      </author>
      <author>
        <name>Azfar, F</name>
      </author>
      <author>
        <name>Back, A</name>
      </author>
      <author>
        <name>Back, H</name>
      </author>
      <author>
        <name>Back, JJ</name>
      </author>
      <author>
        <name>Bagaturia, I</name>
      </author>
      <author>
        <name>Bagby, L</name>
      </author>
      <author>
        <name>Balashov, N</name>
      </author>
      <author>
        <name>Balasubramanian, S</name>
      </author>
      <author>
        <name>Baldi, P</name>
        <uri>https://orcid.org/0000-0003-0636-7930</uri>
      </author>
      <author>
        <name>Baldini, W</name>
      </author>
      <author>
        <name>Baldonedo, J</name>
      </author>
      <author>
        <name>Baller, B</name>
      </author>
      <author>
        <name>Bambah, B</name>
      </author>
      <author>
        <name>Banerjee, R</name>
      </author>
      <author>
        <name>Barao, F</name>
      </author>
      <author>
        <name>Barbu, D</name>
      </author>
      <author>
        <name>Barenboim, G</name>
      </author>
      <author>
        <name>Alzás, P Barham</name>
      </author>
      <author>
        <name>Barker, GJ</name>
      </author>
      <author>
        <name>Barkhouse, W</name>
      </author>
      <author>
        <name>Barr, G</name>
      </author>
      <author>
        <name>Monarca, J Barranco</name>
      </author>
      <author>
        <name>Barros, A</name>
      </author>
      <author>
        <name>Barros, N</name>
      </author>
      <author>
        <name>Barrow, D</name>
      </author>
      <author>
        <name>Barrow, JL</name>
      </author>
      <author>
        <name>Basharina-Freshville, A</name>
      </author>
      <author>
        <name>Bashyal, A</name>
      </author>
      <author>
        <name>Basque, V</name>
      </author>
      <author>
        <name>Batchelor, C</name>
      </author>
      <author>
        <name>Bathe-Peters, L</name>
      </author>
      <author>
        <name>Battat, JBR</name>
      </author>
      <author>
        <name>Battisti, F</name>
      </author>
      <author>
        <name>Bay, F</name>
      </author>
      <author>
        <name>Bazetto, MCQ</name>
      </author>
      <author>
        <name>Alba, JLL Bazo</name>
      </author>
      <author>
        <name>Beacom, JF</name>
      </author>
      <author>
        <name>Bechetoille, E</name>
      </author>
      <author>
        <name>Behera, B</name>
      </author>
      <author>
        <name>Belchior, E</name>
      </author>
      <author>
        <name>Bell, G</name>
      </author>
      <author>
        <name>Bellantoni, L</name>
      </author>
      <author>
        <name>Bellettini, G</name>
      </author>
      <author>
        <name>Bellini, V</name>
      </author>
      <author>
        <name>Beltramello, O</name>
      </author>
      <author>
        <name>Benekos, N</name>
      </author>
      <author>
        <name>Montiel, C Benitez</name>
      </author>
      <author>
        <name>Benjamin, D</name>
      </author>
      <author>
        <name>Neves, F Bento</name>
      </author>
      <author>
        <name>Berger, J</name>
      </author>
      <author>
        <name>Berkman, S</name>
      </author>
      <author>
        <name>Bernal, J</name>
      </author>
    </item>
    <item>
      <title>Transfer Learning in Animal Facial Expression Recognition: A Comparative Study Using Human Pre-Trained Models</title>
      <link>https://escholarship.org/uc/item/86x8v0m3</link>
      <description>Transfer Learning in Animal Facial Expression Recognition: A Comparative Study Using Human Pre-Trained Models</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/86x8v0m3</guid>
      <pubDate>Mon, 21 Jul 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Wang, Emily G</name>
        <uri>https://orcid.org/0009-0003-8941-3177</uri>
      </author>
    </item>
    <item>
      <title>Creative Problem-Solving: A Study With Blind and Low Vision Software Professionals</title>
      <link>https://escholarship.org/uc/item/4ps2r51w</link>
      <description>Background: Software engineering requires both technical skills and creative problem-solving. Blind and low-vision software professionals (BLVSPs) encounter numerous workplace challenges, including inaccessible tools and collaboration hurdles with sighted colleagues. Objective: This study explores the innovative strategies employed by BLVSPs to overcome these accessibility barriers, focusing on their custom solutions and the importance of supportive communities. Methodology: We conducted semi-structured interviews with 30 BLVSPs and used refexive thematic analysis to identify key themes. Results: Findings reveal that BLVSPs are motivated to develop creative and adaptive solutions, highlighting the vital role of collaborative communities in fostering shared problem-solving. Conclusion: For BLVSPs, creative problem-solving is essential for navigating inaccessible work environments, in contrast to sighted peers, who pursue optimization. This study enhances understanding of how BLVSPs...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4ps2r51w</guid>
      <pubDate>Wed, 16 Jul 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Kohl, Karina</name>
      </author>
      <author>
        <name>Cha, Yoonha</name>
      </author>
      <author>
        <name>Jackson, Victoria</name>
      </author>
      <author>
        <name>Branham, Stacy</name>
      </author>
      <author>
        <name>van der Hoek, André</name>
      </author>
      <author>
        <name>Prikladnicki, Rafael</name>
      </author>
    </item>
    <item>
      <title>A Bayesian Time-Varying Psychophysiological Interaction Model</title>
      <link>https://escholarship.org/uc/item/0bq7z39h</link>
      <description>A Bayesian Time-Varying Psychophysiological Interaction Model</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0bq7z39h</guid>
      <pubDate>Thu, 3 Jul 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Schetzsle, Brian</name>
      </author>
      <author>
        <name>Lee, Jaylen</name>
      </author>
      <author>
        <name>Bornstein, Aaron</name>
        <uri>https://orcid.org/0000-0001-6251-6000</uri>
      </author>
      <author>
        <name>Shahbaba, Babak</name>
        <uri>https://orcid.org/0000-0002-8102-1609</uri>
      </author>
      <author>
        <name>Guindani, Michele</name>
        <uri>https://orcid.org/0000-0002-6363-9907</uri>
      </author>
    </item>
    <item>
      <title>Beyond the Surface: Mapping DDE's Metabolic Footprint on Adolescent Obesity.</title>
      <link>https://escholarship.org/uc/item/8b81r54h</link>
      <description>BACKGROUND: Bariatric surgery is an intervention for severe obesity, leading to significant weight loss and metabolic improvements. However, the release of lipophilic chemicals accumulated in adipose tissue during weight loss presents a unique clinical challenge and research opportunity. Dichlorodiphenyldichloroethylene (DDE) is a persistent organic pollutant increasingly recognized as obesogen, while the biological mechanisms through which DDE influences body mass index (BMI) and waist circumference remain underexplored.
OBJECTIVES: We aimed to identify metabolic signatures mediating the association between DDE exposure and weight loss by plasma and adipose tissue metabolomics.
METHODS: We conducted a longitudinal study involving 60 adolescents with severe obesity undergoing bariatric surgery. We quantified &lt;i&gt;p,p'&lt;/i&gt;-DDE concentrations in visceral adipose tissue collected during surgery and analyzed metabolic profiles from both adipose tissues collected at surgery and plasma...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8b81r54h</guid>
      <pubDate>Wed, 2 Jul 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Li, Zhenjiang</name>
      </author>
      <author>
        <name>Pan, Shudi</name>
      </author>
      <author>
        <name>Baumert, Brittney O</name>
      </author>
      <author>
        <name>Chen, Jiawen Carmen</name>
      </author>
      <author>
        <name>Goodrich, Jesse A</name>
      </author>
      <author>
        <name>Wang, Hongxu</name>
      </author>
      <author>
        <name>Rock, Sarah</name>
      </author>
      <author>
        <name>Ryder, Justin</name>
      </author>
      <author>
        <name>Valvi, Damaskini</name>
      </author>
      <author>
        <name>Jenkins, Todd</name>
      </author>
      <author>
        <name>Sisley, Stephanie</name>
      </author>
      <author>
        <name>Lin, Xiangping</name>
      </author>
      <author>
        <name>Bartell, Scott M</name>
        <uri>https://orcid.org/0000-0001-7797-2906</uri>
      </author>
      <author>
        <name>Inge, Thomas H</name>
      </author>
      <author>
        <name>Xanthakos, Stavra</name>
      </author>
      <author>
        <name>McNeil, Brooklynn</name>
      </author>
      <author>
        <name>Robuck, Anna R</name>
      </author>
      <author>
        <name>Mullins, Catherine E</name>
      </author>
      <author>
        <name>Eckel, Sandrah P</name>
      </author>
      <author>
        <name>McConnell, Rob S</name>
      </author>
      <author>
        <name>La Merrill, Michele A</name>
      </author>
      <author>
        <name>Walker, Douglas I</name>
      </author>
      <author>
        <name>Conti, David V</name>
      </author>
      <author>
        <name>Chatzi, Lida</name>
      </author>
    </item>
    <item>
      <title>Applying machine learning to assist in the morphometric assessment of brain arteriolosclerosis through automation</title>
      <link>https://escholarship.org/uc/item/2x61488x</link>
      <description>Objective quantification of brain arteriolosclerosis remains an area of ongoing refinement in neuropathology, with current methods primarily utilizing semi-quantitative scales completed through manual histological examination. These approaches offer modest inter-rater reliability and do not provide precise quantitative metrics. To address this gap, we present a prototype end-to-end machine learning (ML)-based algorithm, Arteriolosclerosis Segmentation (ArtSeg), followed by Vascular Morphometry (VasMorph) - to assist persons in the morphometric analysis of arteriolosclerotic vessels on whole slide images (WSIs). We digitized hematoxylin and eosin-stained glass slides (13 participants, total 42 WSIs) of human brain frontal or occipital lobe cortical and/or periventricular white matter collected from three brain banks (University of California, Davis, Irvine, and Los Angeles Alzheimer's Disease Research Centers). ArtSeg comprises three ML models for blood vessel detection, arteriolosclerosis...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2x61488x</guid>
      <pubDate>Wed, 2 Jul 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Lou, Jerry J</name>
      </author>
      <author>
        <name>Chang, Peter</name>
        <uri>https://orcid.org/0000-0001-7645-7865</uri>
      </author>
      <author>
        <name>Nava, Kiana D</name>
      </author>
      <author>
        <name>Chantaduly, Chanon</name>
      </author>
      <author>
        <name>Wang, Hsin-Pei</name>
      </author>
      <author>
        <name>Yong, William H</name>
        <uri>https://orcid.org/0000-0002-0879-0209</uri>
      </author>
      <author>
        <name>Patel, Viharkumar</name>
      </author>
      <author>
        <name>Chaudhari, Ajinkya J</name>
      </author>
      <author>
        <name>Vasquez, La Rissa</name>
      </author>
      <author>
        <name>Monuki, Edwin</name>
      </author>
      <author>
        <name>Head, Elizabeth</name>
        <uri>https://orcid.org/0000-0003-1115-6396</uri>
      </author>
      <author>
        <name>Vinters, Harry V</name>
      </author>
      <author>
        <name>Magaki, Shino</name>
        <uri>https://orcid.org/0000-0003-0433-5759</uri>
      </author>
      <author>
        <name>Harvey, Danielle J</name>
        <uri>https://orcid.org/0000-0002-5367-0951</uri>
      </author>
      <author>
        <name>Chuah, Chen-Nee</name>
      </author>
      <author>
        <name>DeCarli, Charles S</name>
        <uri>https://orcid.org/0000-0003-1914-2693</uri>
      </author>
      <author>
        <name>Williams, Christopher K</name>
      </author>
      <author>
        <name>Keiser, Michael</name>
      </author>
      <author>
        <name>Dugger, Brittany N</name>
        <uri>https://orcid.org/0000-0003-2141-8855</uri>
      </author>
    </item>
    <item>
      <title>Who benefits from mobile health interventions? A dynamical systems analysis of psychological well‐being in early adults</title>
      <link>https://escholarship.org/uc/item/0xz5d3z9</link>
      <description>Research shows that skills for improving Psychological Well-Being (PWB) may be learned through PWB interventions; however, the dynamic mechanisms underlying this learning process are not well understood. Using an Ecological Momentary Intervention (EMI) design, we conducted an 8-week Randomized Controlled Trial (N = 160; aged 18-22 years), implemented in a mobile Health (mHealth) platform to characterize these dynamical mechanisms. College-attending early adults were randomized to three groups: an active control group (N = 55); an intervention group (N = 51) with positive practices intervention; and a second intervention group (N = 54) with positive practices and meditation intervention. The mHealth implementation allowed us to introduce the interventions in participants' daily lives while also assessing their PWB (in terms of positive emotions and relationship quality) several times a day. We used a Bayesian process model to analyze changes in PWB in terms of the underlying dynamical...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0xz5d3z9</guid>
      <pubDate>Fri, 20 Jun 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Heshmati, Saida</name>
      </author>
      <author>
        <name>Muth, Chelsea</name>
      </author>
      <author>
        <name>Li, Yanling</name>
      </author>
      <author>
        <name>Roeser, Robert W</name>
      </author>
      <author>
        <name>Smyth, Joshua M</name>
      </author>
      <author>
        <name>Vandekerckhove, Joachim</name>
        <uri>https://orcid.org/0000-0003-2600-5937</uri>
      </author>
      <author>
        <name>Chow, Sy‐Miin</name>
      </author>
      <author>
        <name>Oravecz, Zita</name>
      </author>
    </item>
    <item>
      <title>Identification of the velum interpositum as a meningeal-CNS route for myeloid cell trafficking into the brain</title>
      <link>https://escholarship.org/uc/item/1896d5br</link>
      <description>The borders of the central nervous system (CNS) host a repertoire of immune cells and mediate critical neuroimmune interactions, including the infiltration of peripheral myeloid cells into the CNS. Despite the fundamental role of leukocyte infiltration under physiological and pathological conditions, the neuroanatomical route of cell entry into the brain remains unclear. Here, we describe a specialized structure underneath the hippocampus, the velum interpositum (VI), that serves as a site for myeloid cell entry into the CNS. The VI functions as an extra-parenchymal leptomeningeal extension containing distinct myeloid cells subsets. Fate-mapping studies confirm meningeal and peripheral myeloid cell occupancy within the VI. Additionally, we highlight the distinct use of this route in the developing, irradiated, and demyelinating disease brain, indicating that myeloid cell trafficking through the VI could have important clinical implications for neurological disease.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1896d5br</guid>
      <pubDate>Thu, 19 Jun 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Hohsfield, Lindsay A</name>
      </author>
      <author>
        <name>Kim, Sung Jin</name>
      </author>
      <author>
        <name>Barahona, Rocio A</name>
      </author>
      <author>
        <name>Henningfield, Caden M</name>
      </author>
      <author>
        <name>Mansour, Kimiya</name>
      </author>
      <author>
        <name>Vallejo, Kristen D</name>
      </author>
      <author>
        <name>Tsourmas, Kate I</name>
      </author>
      <author>
        <name>Kwang, Nellie E</name>
      </author>
      <author>
        <name>Ghorbanian, Yasamine</name>
      </author>
      <author>
        <name>Angulo, Julio Alejandro Ayala</name>
      </author>
      <author>
        <name>Gao, Pan</name>
      </author>
      <author>
        <name>Pachow, Collin</name>
      </author>
      <author>
        <name>Inlay, Matthew A</name>
      </author>
      <author>
        <name>Walsh, Craig M</name>
        <uri>https://orcid.org/0000-0001-7808-2817</uri>
      </author>
      <author>
        <name>Xu, Xiangmin</name>
        <uri>https://orcid.org/0000-0002-5828-1533</uri>
      </author>
      <author>
        <name>Lane, Thomas E</name>
        <uri>https://orcid.org/0000-0003-0392-0825</uri>
      </author>
      <author>
        <name>Green, Kim N</name>
        <uri>https://orcid.org/0000-0002-6049-6744</uri>
      </author>
    </item>
    <item>
      <title>Miniaturized head-mount Doppler optical coherence tomography scope for freely moving mouse</title>
      <link>https://escholarship.org/uc/item/32h028c6</link>
      <description>Optical brain imaging has several advantages over other imaging techniques and was used to visualize both the structural and functional aspects of the brain, providing a more complete picture of brain activity. One of the promising techniques is optical coherence tomography (OCT), which uses low-coherence interferometry to obtain three-dimensional depth-resolved imaging of structures. In this research, we present a miniaturized head-mount Doppler OCT system tailored for high-resolution brain imaging in freely moving mice, providing an advanced non-invasive imaging tool in neuroscience research. With a maximum 4×4 mm field of view, 7.4 µm axial resolution, the system offers reliable imaging capabilities. Its compact design and comprehensive imaging capabilities make it well-suited for studying various brain regions and dynamic processes, contributing significantly to our understanding of brain function and pathology.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/32h028c6</guid>
      <pubDate>Wed, 18 Jun 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Wang, Jingyi</name>
      </author>
      <author>
        <name>Ye, Qiao</name>
      </author>
      <author>
        <name>Chou, Lidek</name>
      </author>
      <author>
        <name>Qiu, Saijun</name>
      </author>
      <author>
        <name>Xu, Xiangmin</name>
        <uri>https://orcid.org/0000-0002-5828-1533</uri>
      </author>
      <author>
        <name>Chen, Zhongping</name>
        <uri>https://orcid.org/0000-0002-4584-4560</uri>
      </author>
    </item>
    <item>
      <title>Label-Free Prediction of Fluorescently Labeled Fibrin Networks</title>
      <link>https://escholarship.org/uc/item/1h12679v</link>
      <description>While fluorescent labeling has been the standard for visualizing fibers within fibrillar scaffold models of the extracellular matrix (ECM), the use of fluorescent dyes can compromise cell viability and photobleach prematurely. The intricate fibrillar composition of ECM is crucial for its viscoelastic properties, which regulate intracellular signaling and provide structural support for cells. Naturally derived biomaterials such as fibrin and collagen replicate these fibrillar structures, but longitudinal confocal imaging of fibers using fluorescent dyes may impact cell function and photobleach the sample long before termination of the experiment. An alternative technique is reflection confocal microscopy (RCM) that provides high-resolution images of fibers. However, RCM is sensitive to fiber orientation relative to the optical axis, and consequently, many fibers are not detected. We aim to recover these fibers. Here, we propose a deep learning tool for predicting fluorescently...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1h12679v</guid>
      <pubDate>Wed, 18 Jun 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Eldeen, Sarah</name>
      </author>
      <author>
        <name>Ramirez, Andres Felipe Guerrero</name>
      </author>
      <author>
        <name>Keresteci, Bora</name>
        <uri>https://orcid.org/0009-0006-7143-6698</uri>
      </author>
      <author>
        <name>Chang, Peter D</name>
        <uri>https://orcid.org/0000-0001-7645-7865</uri>
      </author>
      <author>
        <name>Botvinick, Elliot L</name>
      </author>
    </item>
  </channel>
</rss>
