<?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>Sun, 8 Nov 2026 18:22:43 +0000</pubDate>
    <item>
      <title>Antenna Near-Field Reconstruction from Far-Field Data Using Convolutional Neural Networks</title>
      <link>https://escholarship.org/uc/item/2wb4t06m</link>
      <description>Electromagnetic field reconstruction is crucial in many applications, including antenna diagnostics, electromagnetic interference analysis, and system modeling. This paper presents a deep learning-based approach for Far-Field to NearField (FF-NF) transformation using Convolutional Neural Networks (CNNs). The goal is to reconstruct near-field distributions from the far-field data of an antenna without relying on explicit analytical transformations. The CNNs are trained on paired farfield and near-field data and evaluated using mean squared error (MSE). The best model achieves a training error of 0.0199 and a test error of 0.3898. Moreover, visual comparisons between the predicted and true near-field distributions demonstrate the model's effectiveness in capturing complex electromagnetic field behavior, highlighting the potential of deep learning in electromagnetic field reconstruction.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2wb4t06m</guid>
      <pubDate>Wed, 4 Nov 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Bagherkhani, Sahar</name>
      </author>
      <author>
        <name>Earls, Jackson Christopher</name>
        <uri>https://orcid.org/0009-0004-3333-4899</uri>
      </author>
      <author>
        <name>De Flaviis, Franco</name>
      </author>
      <author>
        <name>Baldi, Pierre</name>
        <uri>https://orcid.org/0000-0003-0636-7930</uri>
      </author>
    </item>
    <item>
      <title>Twelve quick tips for AI-assisted coding in science</title>
      <link>https://escholarship.org/uc/item/9gh920rw</link>
      <description>While AI coding tools have demonstrated potential to accelerate software development, their use in scientific computing raises critical questions about code quality and scientific validity. In this paper, we provide twelve practical tips for AI-assisted coding that balance the capabilities of AI with the demands of scientific and methodological rigor. We address how AI can be leveraged strategically throughout the development cycle with four key themes: problem preparation and understanding, managing context and interaction, testing and validation, and code quality assurance and iterative improvement. These principles serve to emphasize maintaining human agency in coding decisions, establishing robust validation procedures, and preserving the domain expertise essential for methodologically sound research. These tips are intended to help researchers harness AI's transformative potential for faster software development while ensuring that their code meets the standards of reliability,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/9gh920rw</guid>
      <pubDate>Mon, 2 Nov 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Bridgeford, Eric W</name>
      </author>
      <author>
        <name>Campbell, Iain Declan</name>
      </author>
      <author>
        <name>Chen, Zijiao</name>
      </author>
      <author>
        <name>Lin, Zhicheng</name>
      </author>
      <author>
        <name>Ritz, Harrison</name>
      </author>
      <author>
        <name>Vandekerckhove, Joachim</name>
        <uri>https://orcid.org/0000-0003-2600-5937</uri>
      </author>
      <author>
        <name>Poldrack, Russell A</name>
      </author>
    </item>
    <item>
      <title>A Reconstruct-then-Bootstrap Test for the Sufficiency of Diffusion Processes</title>
      <link>https://escholarship.org/uc/item/5gc2g822</link>
      <description>Diffusion processes are commonly used in the modeling of time series that exhibit stationarity and Markovianity. However, those two properties do not guarantee that a diffusive process is sufficient for the time series. In this paper, we develop a test for the sufficiency of a diffusion process for an observed time series. To develop the test we capitalize on the Kramers–Moyal (KM) expansion: a Taylor expansion of the integral form of the master equation that describes Markov continuous-time processes. In the idealized case, if the observed data indeed arise from a true diffusion process, then the KM expansion should truncate naturally after the second term. In theory, this means that any higher-order ($$\varvec{\ge } \varvec{3}$$) KM coefficients should be zero. However, in practice, the discrete nature of measurement introduces artificial higher-order KM coefficients, even when the underlying process is truly diffusive. Nonetheless, for genuinely diffusive systems, it is expected...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5gc2g822</guid>
      <pubDate>Mon, 2 Nov 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Medriano, Kathleen</name>
      </author>
      <author>
        <name>Vandekerckhove, Joachim</name>
        <uri>https://orcid.org/0000-0003-2600-5937</uri>
      </author>
    </item>
    <item>
      <title>Robust Bayesian hypothesis testing with the hierarchical EZ-DDM</title>
      <link>https://escholarship.org/uc/item/4rn2g7td</link>
      <description>The EZ-diffusion model (EZ-DDM) uses a method of moments to provide closed-form estimators for the three-parameter drift-diffusion model from summary statistics. In previous work, we showed that using the sampling distributions of these statistics enables the implementation of hierarchical EZ-DDM extensions, supporting scalable Bayesian inference in cognitive psychometrics applications. However, the summary statistics used in EZ-DDM implementations (the mean and variance of the response time distribution) are sensitive to contaminant data points, limiting its utility in real-world applications. To address this, we propose a variation on the EZ-DDM implementation in which the summary statistics are replaced with robust alternatives, substituting mean RT with median RT and RT variance with an estimate derived from the interquartile range. We explore and evaluate the effectiveness of this substitution through simulation studies using a within-subject t test design across varying...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4rn2g7td</guid>
      <pubDate>Mon, 2 Nov 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Chávez De la Peña, Adriana F</name>
      </author>
      <author>
        <name>Shin, Eunice</name>
      </author>
      <author>
        <name>Vandekerckhove, Joachim</name>
        <uri>https://orcid.org/0000-0003-2600-5937</uri>
      </author>
    </item>
    <item>
      <title>Comment on Shiffrin et al. (2026): Illusions of Replication, Illusions of Truth</title>
      <link>https://escholarship.org/uc/item/39502717</link>
      <description>Shiffrin et al. argue that scientific practice often produces illusions of understanding; situations in which familiar inferential tools generate misplaced confidence. We describe a related illusion that arises not from statistical misapplications, but from ordinary theory testing itself. Here we highlight a different source of epistemic uncertainty or overconfidence; one that emerges even when statistical tools are used correctly, effect sizes are precisely estimated, findings replicate without controversy, and heterogeneity is explicitly acknowledged within hierarchical models.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/39502717</guid>
      <pubDate>Mon, 2 Nov 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Davis-Stober, Clintin P</name>
      </author>
      <author>
        <name>Sokratous, Konstantina</name>
      </author>
      <author>
        <name>Vandekerckhove, Joachim</name>
        <uri>https://orcid.org/0000-0003-2600-5937</uri>
      </author>
    </item>
    <item>
      <title>Epistemic Disadvantage in Open Science Practices</title>
      <link>https://escholarship.org/uc/item/2c38h5r8</link>
      <description>Open science advocates aim to address epistemic injustice and global power asymmetries in research infrastructures yet underestimate structural vulnerabilities and risks embedded in data sharing practices. Drawing on an ethnographic study of the GCRF South–South Migration Inequality and Development Hub’s (MIDEQ), we argue that even well-intentioned systems, such as the MIDEQ hub, do not reach these vulnerabilities. To capture these overlooked harms, we employ the concept of epistemic disadvantage, a category coextensive with, but separate from epistemic injustice. Epistemic disadvantage includes ethically justified data withholding and misappropriation within consensual systems, which is not captured by existing notions of extractivism as those focus on the monetisation of epistemic resources without regard for the loss incurred by the originating community. To better account for these harms, we draw on two recent epistemic attitudes: the Book of Truths (BoT), which sees scientific...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2c38h5r8</guid>
      <pubDate>Mon, 2 Nov 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Alcalay, Rena</name>
      </author>
      <author>
        <name>Vandekerckhove, Joachim</name>
        <uri>https://orcid.org/0000-0003-2600-5937</uri>
      </author>
    </item>
    <item>
      <title>AAV9-Mimetic Peptides and Electroporation Synergistically Enhance Nanoparticle Transport through the Blood–Brain Barrier</title>
      <link>https://escholarship.org/uc/item/4nx6c132</link>
      <description>Crossing the blood-brain barrier (BBB) remains a major hurdle in neurotherapeutics delivery. However, adeno-associated virus serotype 9 (AAV9) variants can cross from the bloodstream to accumulate in brain tissue, with their tropism facilitated by surface peptide loops. In this work, we examined the feasibility of grafting AAV9-based peptides (AAV.PHP.eB, AAV.X1, and AAV.CPP.16) onto nanoparticles (NPs) to increase transport through brain endothelial cells. We also evaluated the effects of combining the cell-mediated transcytosis strategy with nanosecond pulsed electric fields (nsPEFs). To test the importance of the AAV9-mimetic peptide structural presentation, we chemically conjugated linear peptides or recombinantly inserted peptides into external loops of a protein NP delivery scaffold (E2). E2 shares similar size, symmetry, and nanostructure features to AAV9 but is based on a non-viral source. Computational modeling, particle sizes, and circular dichroism data showed that...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4nx6c132</guid>
      <pubDate>Fri, 30 Oct 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Butkovich, Nina</name>
      </author>
      <author>
        <name>Xu, Yifei</name>
      </author>
      <author>
        <name>Song, Yuchen</name>
      </author>
      <author>
        <name>Wang, Lu</name>
      </author>
      <author>
        <name>Ramirez, Aaron</name>
      </author>
      <author>
        <name>Li, Enya</name>
      </author>
      <author>
        <name>Siao, Nikhil Tien Chi</name>
      </author>
      <author>
        <name>Velazquez-Rivera, Eric</name>
      </author>
      <author>
        <name>Xiang, Liangzhong</name>
        <uri>https://orcid.org/0000-0002-7228-0510</uri>
      </author>
      <author>
        <name>Xu, Xiangmin</name>
        <uri>https://orcid.org/0000-0002-5828-1533</uri>
      </author>
      <author>
        <name>Wang, Szu-Wen</name>
        <uri>https://orcid.org/0000-0001-7398-0220</uri>
      </author>
    </item>
    <item>
      <title>Charge readout electronics for the DUNE horizontal drift far detector: design and performance in ProtoDUNE-HD</title>
      <link>https://escholarship.org/uc/item/1g6012ds</link>
      <description>DUNE (Deep Underground Neutrino Experiment) is a long-baseline neutrino oscillation experiment currently under construction, whose far detectors will be the largest liquid argon time projection chambers ever built. This detector design calls for custom-built cryogenic front-end electronics to meet its performance requirements. This paper describes the charge readout electronics that will be used in the DUNE horizontal drift (HD) far detector and presents performance results using data from the ProtoDUNE-HD detector, a 770 ton liquid argon time projection chamber operated at the CERN Neutrino Platform in 2024 that served as the final prototype of the DUNE HD design.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1g6012ds</guid>
      <pubDate>Mon, 26 Oct 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Abbaslu, S</name>
      </author>
      <author>
        <name>Alrahman, F Abd</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>Adhikari, K</name>
      </author>
      <author>
        <name>Adriano, C</name>
      </author>
      <author>
        <name>Agudelo-Jaramillo, K</name>
      </author>
      <author>
        <name>Akbar, F</name>
      </author>
      <author>
        <name>Alemanno, F</name>
      </author>
      <author>
        <name>Alex, NS</name>
      </author>
      <author>
        <name>Soplin, L Aliaga</name>
      </author>
      <author>
        <name>Alqaisi, A</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>Amarinei, R</name>
      </author>
      <author>
        <name>Amedo, P</name>
      </author>
      <author>
        <name>Amorim, EPM</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>Antonakis, A</name>
      </author>
      <author>
        <name>Aranda-Fernandez, A</name>
      </author>
      <author>
        <name>Araya-Santander, T</name>
      </author>
      <author>
        <name>Arellano, L</name>
      </author>
      <author>
        <name>Diaz, E Arrieta</name>
      </author>
      <author>
        <name>Arroyave, MA</name>
      </author>
      <author>
        <name>Pons, M Artero</name>
      </author>
      <author>
        <name>Asaadi, J</name>
      </author>
      <author>
        <name>Ascencio, M</name>
      </author>
      <author>
        <name>Ashkenazi, A</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, JJ</name>
      </author>
      <author>
        <name>Bae, Y</name>
      </author>
      <author>
        <name>Bagaturia, I</name>
      </author>
      <author>
        <name>Bagby, L</name>
      </author>
      <author>
        <name>Bagdu, H</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>Baldo, E</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>Yucel, E Barlas</name>
      </author>
      <author>
        <name>Barr, G</name>
      </author>
      <author>
        <name>Barrett, W</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>Bathe-Peters, L</name>
      </author>
      <author>
        <name>Sigolo, JG Batista</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>Beever, A</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>
    </item>
    <item>
      <title>Optimization of Antenna Array Configurations Using Deep Learning</title>
      <link>https://escholarship.org/uc/item/8zh6z1fh</link>
      <description>We introduce a deep learning-based optimization method that enhances the design of sparse phased array by reducing grating lobes. Our approach begins with a generation of sparse antenna array configurations, efficiently addressing the non-convex challenges and high degrees of freedom in array design. We then employ neural networks, trained on 70,000 and tested on 30,000 configurations, to approximate a non-convex cost function that measures the ratio between the energy of the main lobe and the side lobe level. The approximation is differentiable and allows for the minimization of the cost function by gradient descent with respect to the antenna’s elements coordinates, yielding a new optimized configuration. A custom penalty mechanism is also implemented, integrating various physical and design constraints into our optimization method. The effectiveness of our method is tested on the ten configurations with the lowest initial cost values, showing a further reduction in cost by...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8zh6z1fh</guid>
      <pubDate>Wed, 21 Oct 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Lu, David Lin Yi</name>
      </author>
      <author>
        <name>Maman, Lior</name>
      </author>
      <author>
        <name>Earls, Jackson</name>
        <uri>https://orcid.org/0009-0004-3333-4899</uri>
      </author>
      <author>
        <name>Boag, Amir</name>
      </author>
      <author>
        <name>Baldi, Pierre</name>
        <uri>https://orcid.org/0000-0003-0636-7930</uri>
      </author>
    </item>
    <item>
      <title>Optimization of Sparse Phased Arrays Using Deep Learning</title>
      <link>https://escholarship.org/uc/item/8986691x</link>
      <description>Antenna arrays enhance communication, sensing, and imaging in fields like wireless communications, radar, and radio astronomy by improving signal quality and range through beamforming and spatial multiplexing. However, they face challenges such as mutual coupling, calibration issues, and increased complexity compared to single antennas. These issues require careful engineering to optimize array performance across applications. We present an optimization technique based on deep learning that improves the design of sparse phased arrays by minimizing grating lobes. This method starts with generating configurations for sparse antenna arrays, effectively tackling the non-convex challenges and the high degrees of freedom involved in array design. We utilize neural networks, trained on 70,000 and tested on 30,000 configurations, to estimate a non-convex cost function that evaluates the energy ratio between the main lobe and side lobe levels. This estimation is differentiable, facilitating...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8986691x</guid>
      <pubDate>Wed, 21 Oct 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Earls, Jackson</name>
        <uri>https://orcid.org/0009-0004-3333-4899</uri>
      </author>
      <author>
        <name>Maman, Lior</name>
      </author>
      <author>
        <name>Lu, David Lin Yi</name>
      </author>
      <author>
        <name>Boag, Amir</name>
      </author>
      <author>
        <name>Baldi, Pierre</name>
        <uri>https://orcid.org/0000-0003-0636-7930</uri>
      </author>
    </item>
    <item>
      <title>Sparse Phased Array Optimization Using Deep Learning</title>
      <link>https://escholarship.org/uc/item/68722864</link>
      <description>Antenna arrays are widely used in wireless communication, radar systems, radio astronomy, and military defense to enhance signal strength, directivity, and interference suppression. We introduce a deep learning-based optimization approach that enhances the design of sparse phased arrays by reducing grating lobes. This approach begins by generating sparse array configurations to address the non-convex challenges and extensive degrees of freedom inherent in array design. We use neural networks to approximate the non-convex cost function that estimates the energy ratio between the main and side lobes. This differentiable approximation facilitates cost function minimization through gradient descent, optimizing the antenna elements' coordinates and leading to an improved layout. Additionally, we incorporate a tailored penalty mechanism that includes various physical and design constraints into the optimization process, enhancing its robustness and practical applicability. We demonstrate...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/68722864</guid>
      <pubDate>Wed, 21 Oct 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Lu, David Lin Yi</name>
      </author>
      <author>
        <name>Maman, Lior</name>
      </author>
      <author>
        <name>Earls, Jackson</name>
        <uri>https://orcid.org/0009-0004-3333-4899</uri>
      </author>
      <author>
        <name>Boag, Amir</name>
      </author>
      <author>
        <name>Baldi, Pierre</name>
        <uri>https://orcid.org/0000-0003-0636-7930</uri>
      </author>
    </item>
    <item>
      <title>Online expressions of heat risk: social media posting and social vulnerability in California</title>
      <link>https://escholarship.org/uc/item/3vc894p5</link>
      <description>Heat waves in California are occurring with increasing frequency, duration, and intensity, largely due to climate change. Furthermore, the burden of extreme heat disproportionately affects various communities both geographically and socioeconomically. As a result, understanding how heat is discussed on social media is critical for informing the design of public health interventions. This study involved a spatiotemporal analysis of heat-related tweets (N = 24,598) posted across California between April and October from 2016 to 2022. Poisson regression models were used to examine county-level counts of heat tweets, with population size included as an offset term in the model while logistic regression models estimated the probability that a heat tweet reflected coping or life impact (LI) themes. A different set of logistic regression models were fit to examine the effect of socio-demographic and housing variables on the likelihood of heat tweets expressing positive and negative sentiment,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3vc894p5</guid>
      <pubDate>Wed, 21 Oct 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Garcia, Nicolas Rodriguez</name>
      </author>
      <author>
        <name>Berrocal, Veronica J</name>
        <uri>https://orcid.org/0000-0003-0304-7202</uri>
      </author>
      <author>
        <name>Li, Chen</name>
      </author>
      <author>
        <name>Hopfer, Suellen</name>
        <uri>https://orcid.org/0000-0003-3232-9743</uri>
      </author>
    </item>
    <item>
      <title>Serum per- and polyfluoroalkyl substances and prevalent heart disease: cross-sectional analysis of the multi-site study</title>
      <link>https://escholarship.org/uc/item/3fq6t12k</link>
      <description>Previous research investigating exposure to per- and polyfluoroalkyl substances (PFAS) and their association with heart disease has found conflicting results, with recent studies reporting null or inverse associations. We estimated associations between serum PFAS and prevalent heart disease in a large, cross-sectional, multi-site study of adults residing in communities in the United States with historic PFAS drinking water contamination. Participants were recruited from communities in eight states (2019–2023), where they completed questionnaires and provided blood samples. PFAS concentrations were measured in serum. Four PFAS detected in &amp;gt; 70% of participants were modeled as continuous variables, and three less-frequently detected PFAS were modeled as binary variables (above/below the limit of detection). Logistic regression models estimated associations between each PFAS and prevalent heart disease based on self-report, adjusting for demographics, smoking and alcohol consumption,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3fq6t12k</guid>
      <pubDate>Wed, 7 Oct 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Phillipson, Celina N</name>
      </author>
      <author>
        <name>Pavuk, Marian</name>
      </author>
      <author>
        <name>Jung, Yerin</name>
      </author>
      <author>
        <name>Villanueva, Carolina</name>
      </author>
      <author>
        <name>Laumbach, Robert J</name>
      </author>
      <author>
        <name>Brown, Linda M</name>
      </author>
      <author>
        <name>Starling, Anne P</name>
      </author>
      <author>
        <name>Vieira, Veronica M</name>
        <uri>https://orcid.org/0000-0001-7153-4606</uri>
      </author>
      <author>
        <name>Lewin, Michael</name>
      </author>
      <author>
        <name>Wang, Teresa</name>
      </author>
      <author>
        <name>James-Todd, Tamarra</name>
      </author>
      <author>
        <name>Wang, Yuting</name>
      </author>
      <author>
        <name>Weems, Meghan M</name>
      </author>
      <author>
        <name>Valladares, Karen S</name>
      </author>
      <author>
        <name>Schaefer, Adam M</name>
      </author>
      <author>
        <name>Bartell, Scott M</name>
        <uri>https://orcid.org/0000-0001-7797-2906</uri>
      </author>
    </item>
    <item>
      <title>Phylodynamic analysis reveals disparate transmission dynamics of Mycobacterium tuberculosis-complex lineages in Botswana</title>
      <link>https://escholarship.org/uc/item/1jw1h3f4</link>
      <description>Tuberculosis epidemics have traditionally been conceptualized as arising from a single uniform pathogen. However, &lt;i&gt;Mycobacterium tuberculosis&lt;/i&gt;-complex (Mtbc), the pathogen causing tuberculosis in humans, encompasses multiple lineages exhibiting genetic and phenotypic diversity that may be responsible for heterogeneity in TB transmission. We analysed a population-based dataset of 1,354 Mtbc whole-genome sequences collected over four years in Botswana, a country with high HIV and tuberculosis burden. We identified Lineage 4 (L4) as the most prevalent (87.4%), followed by L1 (6.4%), L2 (5.3%), and L3 (0.9%). Within L4, multiple sublineages were identified, with L4.3.4 being the predominant sublineage. Phylodynamic analysis revealed L4.3.4 expanded steadily from late 1800s to early 2000s. Conversely, L1, L4.4, and L4.3.2 showed population trajectories closely aligned with the HIV epidemic. Meanwhile, L2 saw rapid expansion throughout most of the 20&lt;sup&gt;th&lt;/sup&gt; century but declined...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1jw1h3f4</guid>
      <pubDate>Wed, 7 Oct 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Wang, Qiao</name>
      </author>
      <author>
        <name>Barilar, Ivan</name>
      </author>
      <author>
        <name>Minin, Volodymyr M</name>
        <uri>https://orcid.org/0000-0002-1917-9288</uri>
      </author>
      <author>
        <name>Modongo, Chawangwa</name>
      </author>
      <author>
        <name>Moonan, Patrick K</name>
      </author>
      <author>
        <name>Finlay, Alyssa</name>
      </author>
      <author>
        <name>Boyd, Rosanna</name>
      </author>
      <author>
        <name>Oeltmann, John E</name>
      </author>
      <author>
        <name>Molefi, Tuduetso L</name>
      </author>
      <author>
        <name>Zetola, Nicola M</name>
      </author>
      <author>
        <name>Brewer, Timothy F</name>
      </author>
      <author>
        <name>Niemann, Stefan</name>
      </author>
      <author>
        <name>Shin, Sanghyuk S</name>
      </author>
    </item>
    <item>
      <title>Investigating the Kidney–Gut–Brain Axis in CKD: Uremic Toxins and Brain Microhemorrhages</title>
      <link>https://escholarship.org/uc/item/9t60t59k</link>
      <description>Alterations of gut microbiota are common in chronic kidney disease (CKD) and contribute to increased uremic toxins including indoxyl sulfate (IS), p-cresyl sulfate (pCS) and trimethylamine N-oxide (TMAO), which are linked to cerebrovascular disease risk. This study examined the kidney-gut-brain axis in CKD mice and in dialysis patients. Male and female mice with adenine-induced CKD were fed a high-amino-acid (HAA) diet to increase precursors of gut-derived uremic toxins. A subgroup of mice received antibiotics in drinking water to suppress gut microbiota and evaluate its role in toxin generation. Behavior tests, gut microbiome composition and brain histology for cerebral microhemorrhages were analyzed. CKD mice had higher serum levels of creatinine, cystatin C and gut-derived toxins, a 2.5-fold increase in brain microhemorrhages, and decreased locomotor activity. The HAA diet significantly increased serum TMAO but not IS and pCS, and all three toxins were reduced by antibiotic...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/9t60t59k</guid>
      <pubDate>Fri, 2 Oct 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Zhao, Yitong</name>
      </author>
      <author>
        <name>Lee, Su Mi</name>
      </author>
      <author>
        <name>Li, Whitney</name>
      </author>
      <author>
        <name>Floriolli, David</name>
      </author>
      <author>
        <name>Chang, Peter</name>
        <uri>https://orcid.org/0000-0001-7645-7865</uri>
      </author>
      <author>
        <name>Narasaki, Yoko</name>
      </author>
      <author>
        <name>You, Amy S</name>
      </author>
      <author>
        <name>Kalantar-Zadeh, Kamyar</name>
        <uri>https://orcid.org/0000-0002-8666-0725</uri>
      </author>
      <author>
        <name>Rhee, Connie M</name>
        <uri>https://orcid.org/0000-0002-9703-6469</uri>
      </author>
      <author>
        <name>Liu, Han</name>
      </author>
      <author>
        <name>Tran, Tiffany</name>
      </author>
      <author>
        <name>Paganini-Hill, Annlia</name>
      </author>
      <author>
        <name>Fisher, Mark</name>
        <uri>https://orcid.org/0000-0001-9802-8826</uri>
      </author>
      <author>
        <name>Lau, Wei Ling</name>
        <uri>https://orcid.org/0000-0002-3118-1073</uri>
      </author>
    </item>
    <item>
      <title>Technopoly: The Surrender of Culture to Technology</title>
      <link>https://escholarship.org/uc/item/6vq5d685</link>
      <description>Technopoly: The Surrender of Culture to Technology</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6vq5d685</guid>
      <pubDate>Wed, 30 Sep 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Penny, Simon</name>
        <uri>https://orcid.org/0000-0002-5084-5541</uri>
      </author>
      <author>
        <name>Postman, Neil</name>
      </author>
    </item>
    <item>
      <title>What Computers Still Can't Do: A Critique of Artificial Reason</title>
      <link>https://escholarship.org/uc/item/5ft7c1dh</link>
      <description>What Computers Still Can't Do: A Critique of Artificial Reason</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5ft7c1dh</guid>
      <pubDate>Wed, 30 Sep 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Penny, Simon</name>
        <uri>https://orcid.org/0000-0002-5084-5541</uri>
      </author>
      <author>
        <name>Dreyfus, Herbert</name>
      </author>
    </item>
    <item>
      <title>Virtual Reality as the End of the Enlightenment Project</title>
      <link>https://escholarship.org/uc/item/58s8p9wj</link>
      <description>Virtual Reality as the End of the Enlightenment Project</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/58s8p9wj</guid>
      <pubDate>Wed, 30 Sep 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Penny, Simon</name>
        <uri>https://orcid.org/0000-0002-5084-5541</uri>
      </author>
    </item>
    <item>
      <title>Virtual Reality as the End of the Enlightenment Project</title>
      <link>https://escholarship.org/uc/item/14r2p87x</link>
      <description>Virtual Reality as the End of the Enlightenment Project</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/14r2p87x</guid>
      <pubDate>Wed, 30 Sep 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Penny, Simon</name>
        <uri>https://orcid.org/0000-0002-5084-5541</uri>
      </author>
    </item>
    <item>
      <title>Zip-Tries: Simple Dynamic Data Structures for Strings</title>
      <link>https://escholarship.org/uc/item/8dm6g4km</link>
      <description>Zip-Tries: Simple Dynamic Data Structures for Strings</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8dm6g4km</guid>
      <pubDate>Wed, 23 Sep 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Gila, Ofek</name>
      </author>
      <author>
        <name>Goodrich, Michael T</name>
      </author>
      <author>
        <name>Kitagawa, Ryuto</name>
      </author>
    </item>
    <item>
      <title>On the expansion of Hanoi graphs</title>
      <link>https://escholarship.org/uc/item/8dj30475</link>
      <description>The famous Tower of Hanoi puzzle involves moving $n$ discs of distinct sizes from one of $p\geq 3$ pegs (traditionally $p=3$) to another of the pegs, subject to the constraints that only one disc may be moved at a time, and no disc can ever be placed on a disc smaller than itself. Much is known about the Hanoi graph $H_p^n$, whose $p^n$ vertices represent the configurations of the puzzle, and whose edges represent the pairs of configurations separated by a single legal move. In a previous paper, the present authors presented nearly tight asymptotic bounds of $O((p-2)^n)$ and $Ω(n^{(1-p)/2}(p-2)^n)$ on the treewidth of this graph for fixed $p \geq 3$. In this paper we show that the upper bound is tight, by giving a matching lower bound of $Ω((p-2)^n)$ for the expansion of $H_p^n$. 18 pages, 5 figures</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8dj30475</guid>
      <pubDate>Wed, 23 Sep 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>Zip-Tries: Simple Dynamic Data Structures for Strings</title>
      <link>https://escholarship.org/uc/item/84s310x4</link>
      <description>In this paper, we introduce zip-tries, which are simple, dynamic,
memory-efficient data structures for strings. Zip-tries support search and
update operations for $k$-length strings in $\mathcal{O}(k+\log n)$ time in the
standard RAM model or in $\mathcal{O}(k/\alpha+\log n)$ time in the word RAM
model, where $\alpha$ is the length of the longest string that can fit in a
memory word, and $n$ is the number of strings in the trie. Importantly, we show
how zip-tries can achieve this while only requiring $\mathcal{O}(\log{\log{n}}
+ \log{\log{\frac{k}{\alpha}}})$ bits of metadata per node w.h.p., which is an
exponential improvement over previous results for long strings. Despite being
considerably simpler and more memory efficient, we show how zip-tries perform
competitively with state-of-the-art data structures on large datasets of long
strings.
  Furthermore, we provide a simple, general framework for parallelizing string
comparison operations in linked data structures, which we...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/84s310x4</guid>
      <pubDate>Wed, 23 Sep 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Gila, Ofek</name>
      </author>
      <author>
        <name>Goodrich, Michael T</name>
      </author>
      <author>
        <name>Kitagawa, Ryuto</name>
      </author>
    </item>
    <item>
      <title>Bicriteria Polygon Aggregation with Arbitrary Shapes</title>
      <link>https://escholarship.org/uc/item/4g28t7tx</link>
      <description>We study the problem of aggregating a set of polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Equivalently, this can be seen as a fence enclosure problem, where the goal is to surround the polygons with a set of closed curves. Our objective is to minimize a weighted sum of the total area and the total perimeter of the regions, which naturally extends other fencing problems and has applications in geographical information systems. Previously, this objective was only studied in a restricted variant, in which the boundary curves of the regions must be selected from a fixed subdivision of the plane. It is natural to ask whether the problem is still tractable if this restriction is removed, allowing output regions to be bounded by arbitrary curves. We provide a positive answer in the form of an algorithm with runtime Õ(n&lt;sup&gt;4&lt;/sup&gt;), where n is the number of input vertices. To achieve this, we fully characterize the optimal...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4g28t7tx</guid>
      <pubDate>Wed, 23 Sep 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Blank, L</name>
        <uri>https://orcid.org/0000-0002-6410-8323</uri>
      </author>
      <author>
        <name>Eppstein, D</name>
      </author>
      <author>
        <name>Haunert, JH</name>
        <uri>https://orcid.org/0000-0001-8005-943X</uri>
      </author>
      <author>
        <name>Haverkort, H</name>
      </author>
      <author>
        <name>Kolbe, B</name>
        <uri>https://orcid.org/0009-0005-0440-4912</uri>
      </author>
      <author>
        <name>Mayer, P</name>
        <uri>https://orcid.org/0009-0007-4800-7753</uri>
      </author>
      <author>
        <name>Mutzel, P</name>
        <uri>https://orcid.org/0000-0001-7621-971X</uri>
      </author>
      <author>
        <name>Naumann, A</name>
        <uri>https://orcid.org/0009-0009-5442-3336</uri>
      </author>
      <author>
        <name>Sauer, J</name>
        <uri>https://orcid.org/0000-0002-7196-7468</uri>
      </author>
    </item>
    <item>
      <title>Hamiltonian cycles in subdivided doubles</title>
      <link>https://escholarship.org/uc/item/40g3t4fj</link>
      <description>The subdivided double construction on 4-regular graphs was used by Potočnik and Wilson to explore semi-symmetric (edge-transitive but not vertex-transitive) graphs, and can be used to construct every semi-symmetric 4-regular graph that contains a pair of twin vertices. We show that (regardless of symmetry) subdivided doubles have another curious property: they have exponentially many Hamiltonian cycles each of which is complementary to another Hamiltonian cycle.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/40g3t4fj</guid>
      <pubDate>Wed, 23 Sep 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Eppstein, David</name>
      </author>
    </item>
    <item>
      <title>Fast Schulze Voting Using Quickselect</title>
      <link>https://escholarship.org/uc/item/3b41z37f</link>
      <description>The Schulze voting method aggregates voter preference data using maxmin-weight graph paths, achieving the Condorcet property that a candidate who would win every head-to-head contest will also win the overall election. Once the voter preferences among $m$ candidates have been arranged into an $m\times m$ matrix of pairwise election outcomes, a previous algorithm of Sornat, Vassilevska Williams and Xu (EC '21) determines the Schulze winner in randomized expected time $O(m^2\log^4 m)$. We improve this to randomized expected time $O(m^2\log m)$ using a modified version of quickselect.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3b41z37f</guid>
      <pubDate>Wed, 23 Sep 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Arora, Arushi</name>
      </author>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Huynh, Randy Le</name>
      </author>
    </item>
    <item>
      <title>Visualizing Treewidth</title>
      <link>https://escholarship.org/uc/item/2k66v10k</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 vertex of the graph 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 explore the design space for width-witness drawings and investigate drawing styles that 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.Finally,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2k66v10k</guid>
      <pubDate>Wed, 23 Sep 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Chiu, Alvin</name>
      </author>
      <author>
        <name>Depian, Thomas</name>
      </author>
      <author>
        <name>Eppstein, David</name>
      </author>
      <author>
        <name>Goodrich, Michel T</name>
      </author>
      <author>
        <name>Nöllenburg, Martin</name>
      </author>
    </item>
    <item>
      <title>Likelihood specification in simultaneous equation models for discrete data</title>
      <link>https://escholarship.org/uc/item/0bc9v92t</link>
      <description>In this article, we examine the foundations of a rich and diverse literature in economics and derive the likelihood function of simultaneous equation models for discrete data as the invariant distribution of a suitably specified Markov process. This formulation offers a well-defined reduced form of the model and dispenses with the need for controversial recursivity requirements and ad hoc indeterminacy rules. The derivation resolves puzzling paradoxes highlighted in earlier work and shows that the likelihood is unique, proper, coherent, complete, and theoretically grounded in conditional distribution modeling – a framework that has yet to be popularized in economics. We note possible extensions and relevant links with other models, comment on computational issues, and implement the methodology in three empirical applications involving female labor force participation, the interactions between health and wealth, and the interplay between banks’ lending practices and their reliance...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0bc9v92t</guid>
      <pubDate>Wed, 12 Aug 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Jeliazkov, Ivan</name>
      </author>
      <author>
        <name>Vossmeyer, Angela</name>
      </author>
    </item>
    <item>
      <title>Accessibility through Awareness of Noise Sensitivity Management and Regulation Practices</title>
      <link>https://escholarship.org/uc/item/82f55554</link>
      <description>Noise sensitivity results in a range of experiences, from small annoyances to extreme pain in response to sound. While anyone can experience it, many neurodivergent people report this sensory processing challenge. Novel technologies can help people with noise sensitivity (PWNS) manage their sensitivities. We conducted an interview study with 21 PWNS and 9 caregivers over three months to understand their management and regulation practices and opportunities for technology-mediated support. We found that awareness is a salient factor that influences both management and regulation practices. Based on their awareness, people primarily use avoidance and sound masking approaches or engage in personal coping strategies such as journaling, setting boundaries, and alerting others to regulate. We build on prior research on interdependence, mutual care, and collaborative work to situate the concept of joint awareness to foster collaborative management and regulation for noise sensitivity....</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/82f55554</guid>
      <pubDate>Thu, 30 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Hicks, Emani</name>
      </author>
      <author>
        <name>Mavrovounioti, Avery</name>
      </author>
      <author>
        <name>Du, Weijie</name>
      </author>
      <author>
        <name>Ankrah, Elizabeth</name>
      </author>
      <author>
        <name>Johnson, Jazette</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>GAI FOR THE CLASSROOM: UNDERSTANDING TEACHER AND TEEN PERSPECTIVES ON GENERATIVE AI INTEGRATION THROUGH FOCUS GROUP INSIGHTS</title>
      <link>https://escholarship.org/uc/item/7k25h56r</link>
      <description>GAI FOR THE CLASSROOM: UNDERSTANDING TEACHER AND TEEN PERSPECTIVES ON GENERATIVE AI INTEGRATION THROUGH FOCUS GROUP INSIGHTS</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7k25h56r</guid>
      <pubDate>Thu, 30 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Hicks, Emani</name>
        <uri>https://orcid.org/0000-0003-1429-7581</uri>
      </author>
      <author>
        <name>Min, Aehong</name>
        <uri>https://orcid.org/0000-0002-3790-2126</uri>
      </author>
      <author>
        <name>Dickerson, Kelli</name>
      </author>
      <author>
        <name>Han, Ariel</name>
        <uri>https://orcid.org/0000-0002-0047-0817</uri>
      </author>
      <author>
        <name>Rubin, Jennifer</name>
        <uri>https://orcid.org/0000-0002-6649-6606</uri>
      </author>
      <author>
        <name>Lombard, Ella</name>
        <uri>https://orcid.org/0000-0002-9367-4172</uri>
      </author>
      <author>
        <name>Chen, Katharine</name>
        <uri>https://orcid.org/0000-0002-4405-6052</uri>
      </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</name>
        <uri>https://orcid.org/0000-0003-0966-8739</uri>
      </author>
    </item>
    <item>
      <title>Supporting Noise Sensitivity and Emotion Regulation with Children</title>
      <link>https://escholarship.org/uc/item/4248d919</link>
      <description>Children who are noise sensitive may be easily distracted, experience discomfort, and react with negative emotions in the presence of loud or sudden sounds and in environments where they cannot control the noise; this can impact their ability to regulate their emotions. Therefore, implementing effective regulation strategies is necessary to support noise-sensitive children. Assistive technology has been shown to be an effective tool for supporting children and self-regulation. By conducting co-design sessions with noise-sensitive children, we will better understand how we might design an assistive application to support emotion regulation in noise-sensitive children. In this work in progress, we present the initial findings of two pilot co-design sessions and considerations for conducting co-design sessions with children who are noise sensitive.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4248d919</guid>
      <pubDate>Thu, 30 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Hicks, Emani</name>
      </author>
      <author>
        <name>Hu, Jialuo</name>
      </author>
      <author>
        <name>Mavrovounioti, Avery</name>
      </author>
      <author>
        <name>Du, Weijie</name>
      </author>
      <author>
        <name>Johnson, Jazette</name>
      </author>
      <author>
        <name>Ankrah, Elizabeth</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>“Am I trying hard or harder than others?”: Gender differences in reciprocal relations between perceived effort, science self-concept, and achievement in chemistry</title>
      <link>https://escholarship.org/uc/item/7nr7x94c</link>
      <description>High effort is critical to complete difficult introductory courses in Science, Technology, Engineering, and Mathematics (STEM) fields. However, high effort can be negatively related to science self-concept (SC) as it can indicate a lack of brilliance in STEM. Further, this relation can be more pronounced for women due to gender stereotypes. To address gender differences in the relations between perceived effort and science SC, in this study, we measured two types of perceived effort: (1) criterion effort (the perception of trying hard) and (2) comparative effort (the perception of trying harder than others), and we examined possible gender differences in their correlates. Overall, we examined whether and to what extent reciprocal relations among two types of perceived effort, science SC, and achievement differ as a function of gender over the course of a semester in introductory chemistry. We utilized multiple-group latent cross-lagged panel analysis with undergraduate students...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7nr7x94c</guid>
      <pubDate>Wed, 29 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Lee, Hyewon</name>
        <uri>https://orcid.org/0000-0003-0710-9108</uri>
      </author>
      <author>
        <name>Yu, Shirley L</name>
      </author>
      <author>
        <name>Lin, Tzu-Jung</name>
      </author>
      <author>
        <name>Kim, Minjung</name>
      </author>
    </item>
    <item>
      <title>Adolescents of color have greater mathematics values than White adolescents across gender: Replication evidence across high school and datasets in the U.S.</title>
      <link>https://escholarship.org/uc/item/6bw9m9v7</link>
      <description>The unequal mathematics education system in the U.S. highlights the need to examine racial and ethnic differences in mathematics subjective task values as precursors to participation in mathematics-related careers. We investigated whether and to what extent mathematics subjective task values (i.e., interest, utility, and attainment) vary across the four largest U.S. racial/ethnic groups (i.e., Asian, Black, Latine, and White) among boys and girls, separately. We also tested whether these patterns replicated across high school years and across datasets. Using two U.S. large-scale longitudinal datasets (i.e., CAMP and HSLS), results showed that adolescents of color reported higher mathematics subjective task values than White adolescents, with differences favoring Asian over White adolescents and Black over Latine adolescents. These patterns were consistent across gender, though slightly more pronounced among boys, and replicated across both datasets. The findings demonstrate racial...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6bw9m9v7</guid>
      <pubDate>Wed, 29 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Lee, Hyewon</name>
        <uri>https://orcid.org/0000-0003-0710-9108</uri>
      </author>
      <author>
        <name>Tulagan, Nestor B</name>
      </author>
      <author>
        <name>Lee-Poon, Glona</name>
      </author>
      <author>
        <name>Starr, Christine R</name>
      </author>
      <author>
        <name>Rubach, Charlott</name>
      </author>
      <author>
        <name>Safavian, Nayssan</name>
      </author>
      <author>
        <name>Goldstein, Miranda G</name>
        <uri>https://orcid.org/0009-0002-9598-0875</uri>
      </author>
      <author>
        <name>Eccles, Jacquelynne S</name>
        <uri>https://orcid.org/0000-0002-6405-9330</uri>
      </author>
      <author>
        <name>Simpkins, Sandra D</name>
      </author>
    </item>
    <item>
      <title>The Energy Exascale Earth System Model Version 3: 2. Overview of the Coupled System</title>
      <link>https://escholarship.org/uc/item/5r4617k3</link>
      <description>Abstract The Energy Exascale Earth System Model version 3 (E3SMv3) represents the latest advancement in Earth system modeling developed by the U.S. Department of Energy (DOE). Building upon previous versions, E3SMv3 introduces significant updates across its coupled components to enhance capability and improve fidelity. The atmosphere component incorporates advancements in chemistry, aerosol‐cloud interactions, convection, and microphysics. The ocean features a new time‐stepping scheme and a higher‐resolution unstructured mesh with sub‐ice‐shelf cavities, while the sea ice model integrates advanced snow and ice physics for more realistic cryospheric simulations. The land model introduces prognostic vegetation dynamics and a new sub‐grid topographic treatment of solar radiation. A new tri‐grid configuration harmonizes the horizontal grids of the land and river components for improved process coupling. It is enabled by a new non‐linear remapping between the atmosphere and land. E3SMv3...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5r4617k3</guid>
      <pubDate>Wed, 29 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Golaz, Jean‐Christophe</name>
      </author>
      <author>
        <name>Lin, Wuyin</name>
      </author>
      <author>
        <name>Zheng, Xue</name>
      </author>
      <author>
        <name>Xie, Shaocheng</name>
      </author>
      <author>
        <name>Roberts, Andrew F</name>
      </author>
      <author>
        <name>Van Roekel, Luke P</name>
      </author>
      <author>
        <name>Thornton, Peter E</name>
      </author>
      <author>
        <name>Barthel, Alice M</name>
      </author>
      <author>
        <name>Bradley, Andrew M</name>
      </author>
      <author>
        <name>Wolfe, Jonathan D</name>
      </author>
      <author>
        <name>Zhang, Chengzhu</name>
      </author>
      <author>
        <name>Zhang, Kai</name>
      </author>
      <author>
        <name>Zhang, Shixuan</name>
      </author>
      <author>
        <name>Asay‐Davis, Xylar S</name>
      </author>
      <author>
        <name>Begeman, Carolyn B</name>
      </author>
      <author>
        <name>Bisht, Gautam</name>
      </author>
      <author>
        <name>Burrows, Susannah M</name>
      </author>
      <author>
        <name>Chen, Chih‐Chieh‐Jack</name>
      </author>
      <author>
        <name>Feng, Yan</name>
      </author>
      <author>
        <name>Hunke, Elizabeth C</name>
      </author>
      <author>
        <name>Jacob, Robert L</name>
      </author>
      <author>
        <name>Ke, Ziming</name>
      </author>
      <author>
        <name>Mahajan, Salil</name>
      </author>
      <author>
        <name>Mahfouz, Naser G</name>
      </author>
      <author>
        <name>Maltrud, Mathew E</name>
      </author>
      <author>
        <name>Shi, Xiaoying</name>
      </author>
      <author>
        <name>Tang, Qi</name>
      </author>
      <author>
        <name>Terai, Christopher R</name>
      </author>
      <author>
        <name>Thomas, Erin E</name>
      </author>
      <author>
        <name>Wang, Hailong</name>
      </author>
      <author>
        <name>Xie, Jinbo</name>
      </author>
      <author>
        <name>Zhou, Tian</name>
      </author>
      <author>
        <name>Bartoletti, Tony</name>
      </author>
      <author>
        <name>Benedict, James J</name>
      </author>
      <author>
        <name>Brunke, Michael A</name>
      </author>
      <author>
        <name>Comeau, Darin S</name>
      </author>
      <author>
        <name>Fan, Jiwen</name>
      </author>
      <author>
        <name>Forsyth, Ryan M</name>
      </author>
      <author>
        <name>Foucar, James G</name>
      </author>
      <author>
        <name>Guba, Oksana</name>
      </author>
      <author>
        <name>Hannah, Walter M</name>
      </author>
      <author>
        <name>Hao, Dalei</name>
      </author>
      <author>
        <name>Huang, Xianglei</name>
      </author>
      <author>
        <name>Jeffery, Nicole</name>
      </author>
      <author>
        <name>Kang, Hyun‐Gyu</name>
      </author>
      <author>
        <name>Keen, Noel D</name>
        <uri>https://orcid.org/0000-0003-3607-3554</uri>
      </author>
      <author>
        <name>Lee, Hsiang‐He</name>
      </author>
      <author>
        <name>Lee, Jiwoo</name>
      </author>
      <author>
        <name>Liu, Xiaohong</name>
      </author>
      <author>
        <name>Mametjanov, Azamat</name>
      </author>
      <author>
        <name>Muelmenstaedt, Johannes</name>
      </author>
      <author>
        <name>Petersen, Mark R</name>
      </author>
      <author>
        <name>Prather, Michael J</name>
        <uri>https://orcid.org/0000-0002-9442-8109</uri>
      </author>
      <author>
        <name>Price, Stephen F</name>
      </author>
      <author>
        <name>Qian, Yun</name>
      </author>
      <author>
        <name>Salinger, Andrew G</name>
      </author>
      <author>
        <name>Santos, Sean P</name>
      </author>
      <author>
        <name>Shan, Yunpeng</name>
      </author>
      <author>
        <name>Singh, Balwinder</name>
      </author>
      <author>
        <name>Smith, Katherine M</name>
      </author>
      <author>
        <name>Song, Xiaoliang</name>
      </author>
      <author>
        <name>Sreepathi, Sarat</name>
      </author>
      <author>
        <name>Turner, Adrian K</name>
      </author>
      <author>
        <name>Vo, Tom</name>
      </author>
      <author>
        <name>Wan, Hui</name>
      </author>
      <author>
        <name>Wu, Mingxuan</name>
      </author>
      <author>
        <name>Yu, Wandi</name>
      </author>
      <author>
        <name>Zender, Charles S</name>
        <uri>https://orcid.org/0000-0003-0129-8024</uri>
      </author>
      <author>
        <name>Zeng, Xubin</name>
      </author>
      <author>
        <name>Zhang, Guang J</name>
      </author>
      <author>
        <name>Zhang, Meng</name>
      </author>
      <author>
        <name>Zhang, Tao</name>
      </author>
      <author>
        <name>Zhang, Yuying</name>
      </author>
      <author>
        <name>McCoy, Renata B</name>
      </author>
      <author>
        <name>Taylor, Mark A</name>
      </author>
      <author>
        <name>Leung, L Ruby</name>
      </author>
      <author>
        <name>Caldwell, Peter M</name>
      </author>
      <author>
        <name>Bader, David C</name>
      </author>
    </item>
    <item>
      <title>The Development of In-Group-Favoring Math Stereotypes Among Adolescents Across Gender and Race/Ethnicity: Teacher Influence and Motivational Consequences</title>
      <link>https://escholarship.org/uc/item/4kd7v251</link>
      <description>The developmental processes underlying in-group-favoring math stereotypes (i.e., beliefs that favor one's own gender over another gender in math ability) and their associated motivational benefits in adolescence remain understudied. Guided by developmental intergroup theory and situated expectancy-value theory, the present study examined (a) the reciprocal relations between in-group-favoring math stereotypes and perceived math teacher support; (b) their associations with math motivational outcomes (i.e., math expectancies, math identity, and math grade point average); and (c) gender differences in these associations among adolescents within each of four largest racial/ethnic groups in the United States (i.e., Asian, Black, Latine, and White). Using the High School Longitudinal Study of 2009 (&lt;i&gt;N&lt;/i&gt; = 18,419; &lt;i&gt;M&lt;/i&gt;&lt;sub&gt;age&lt;/sub&gt; = 14.53, &lt;i&gt;SD&lt;/i&gt; = 0.63 in nineth grade), we found that Asian and White girls' female-favoring math stereotypes and their perceived math teacher...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4kd7v251</guid>
      <pubDate>Wed, 29 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Lee, Hyewon</name>
        <uri>https://orcid.org/0000-0003-0710-9108</uri>
      </author>
      <author>
        <name>Lee-Poon, Glona</name>
      </author>
      <author>
        <name>Eccles, Jacquelynne S</name>
        <uri>https://orcid.org/0000-0002-6405-9330</uri>
      </author>
      <author>
        <name>Simpkins, Sandra D</name>
      </author>
    </item>
    <item>
      <title>Development of the authentication and authorization processes for the iAgree portal, a platform for patient-controlled data sharing across health systems.</title>
      <link>https://escholarship.org/uc/item/5cz2t5g8</link>
      <description>&lt;h4&gt;Objective&lt;/h4&gt;To develop the authentication and authorization module for iAgree, a privacy-preserving platform that enables patients to manage consent preferences and share electronic health record (EHR) data across multiple health systems with researchers. The consent and blockchain modules are described elsewhere.&lt;h4&gt;Materials and methods&lt;/h4&gt;We developed the authentication and authorization module of iAgree. This module supports account creation and cross-institution identity binding as part of the iAgree workflow to enable patients to authenticate using federated credentials (eg, Google, Facebook). Patients link their identities across institutions by signing into each participating health systems patient portal. Identity attributes retrieved via a Fast Healthcare Interoperability Resources (FHIR&lt;sup&gt;®&lt;/sup&gt;) application programming interface (API) are cryptographically transformed into de-identified tokens so no raw identifiers are stored. Consent preferences are recorded...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5cz2t5g8</guid>
      <pubDate>Thu, 2 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Soohoo, Spencer</name>
      </author>
      <author>
        <name>Keller, Michelle</name>
      </author>
      <author>
        <name>Chen, Yunan</name>
      </author>
      <author>
        <name>Hu, Di</name>
      </author>
      <author>
        <name>Huang, Shao-Chi</name>
      </author>
      <author>
        <name>Kuo, Tsung-Ting</name>
      </author>
      <author>
        <name>Leder, Chloe</name>
      </author>
      <author>
        <name>Lu, Xi</name>
      </author>
      <author>
        <name>Meeker, Daniela</name>
      </author>
      <author>
        <name>Morse, Brad</name>
      </author>
      <author>
        <name>Moyse, Harold</name>
      </author>
      <author>
        <name>Nagaraj, Gayathri</name>
      </author>
      <author>
        <name>Nguyen, An</name>
      </author>
      <author>
        <name>Schilling, Lisa</name>
      </author>
      <author>
        <name>Soares, Andrey</name>
      </author>
      <author>
        <name>Whooley, Mary</name>
      </author>
      <author>
        <name>Zheng, Kai</name>
      </author>
      <author>
        <name>Ohno-Machado, Lucila</name>
      </author>
    </item>
    <item>
      <title>Computed tomography staging of colon cancer: improved patient selection for neoadjuvant therapy with combined radiologic tumor and nodal staging.</title>
      <link>https://escholarship.org/uc/item/4ht0g00f</link>
      <description>BACKGROUND: Patient selection for neoadjuvant therapy in colon cancer (CC) needs to be improved as utilizing computed tomography (CT) tumor (T) staging alone is associated with overstaging and overtreatment. Therefore, we sought to identify specific nodal imaging features that can be combined with radiologic T staging to improve patient selection. METHODS: Pre-operative CTs of stage I-III CC patients treated with upfront resection (2018–2023) were assessed by an expert abdominal radiologist blinded to the histopathologic staging. Radiologic T and node (N) staging based on five imaging features (single lymph node (LN) &amp;gt; 1&amp;nbsp;cm, ≥ 3 prominent LNs, irregular borders, heterogenous enhancement, and extramural venous invasion) were compared to the pathologic staging, grouped by proficient or deficient mismatch repair status (pMMR vs. dMMR). RESULTS: Of the 177 patients, 147 and 30 had pMMR and dMMR CC, respectively. The overstaging rate for pathologic T staging was 6.1% pMMR vs....</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4ht0g00f</guid>
      <pubDate>Thu, 18 Jun 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Lee, Sonia</name>
      </author>
      <author>
        <name>Yu, Jingjing</name>
      </author>
      <author>
        <name>Kampalath, Rony</name>
      </author>
      <author>
        <name>Castillo, Otilio</name>
      </author>
      <author>
        <name>Sandhu, Janteshpreet</name>
      </author>
      <author>
        <name>Tajik, Fatemeh</name>
      </author>
      <author>
        <name>Ostowari, Arsha</name>
      </author>
      <author>
        <name>Kirby, Katharine</name>
      </author>
      <author>
        <name>Dehkordi-Vakil, Farideh</name>
      </author>
      <author>
        <name>Chantaduly, Chanon</name>
      </author>
      <author>
        <name>Chang, Peter</name>
      </author>
      <author>
        <name>Vilchez, Valery</name>
      </author>
      <author>
        <name>Straker, Richard</name>
      </author>
      <author>
        <name>Whealon, Matthew</name>
      </author>
      <author>
        <name>Krishnamurthi, Smitha</name>
      </author>
      <author>
        <name>Maithel, Shishir</name>
      </author>
      <author>
        <name>Stamos, Michael</name>
      </author>
      <author>
        <name>Senthil, Maheswari</name>
      </author>
    </item>
    <item>
      <title>We Need Granular Sharing of De-Identified Data—But Will Patients Engage? Investigating Health System Leaders' and Patients' Perspectives on A Patient-Controlled Data-Sharing Platform</title>
      <link>https://escholarship.org/uc/item/6hw6p6rb</link>
      <description>Patient-controlled data-sharing systems are increasingly promoted as a way to empower patients with greater autonomy over their health data. Yet it remains unclear how different stakeholders, especially patients and health system leaders, perceive the benefits and challenges of enabling granular control over the sharing of de-identified medical data for research. To address this gap, we developed a high-fidelity prototype of a patient-controlled, web-based consent platform and conducted a two-phase mixed-methods study: semi-structured interviews with 16 health system leaders and a survey with 523 patient participants. While both groups appreciated the potential of such a platform to enhance transparency and autonomy, their views diverged in meaningful ways. Leaders viewed transparency and granular control through the lens of informed consent and institutional ethics, whereas patients interpreted these factors as safeguards against potential risks and uncertainties. Our findings...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6hw6p6rb</guid>
      <pubDate>Wed, 17 Jun 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Lu, Xi</name>
      </author>
      <author>
        <name>Hu, Di</name>
      </author>
      <author>
        <name>Nguyen, An T</name>
      </author>
      <author>
        <name>Morse, Brad</name>
      </author>
      <author>
        <name>Schilling, Lisa M</name>
      </author>
      <author>
        <name>Zheng, Kai</name>
        <uri>https://orcid.org/0000-0003-4121-4948</uri>
      </author>
      <author>
        <name>Keller, Michelle S</name>
        <uri>https://orcid.org/0000-0002-8157-7586</uri>
      </author>
      <author>
        <name>Ohno-Machado, Lucila</name>
      </author>
      <author>
        <name>Chen, Yunan</name>
      </author>
    </item>
    <item>
      <title>Correction: The social amplification and attenuation of COVID-19 risk perception shaping mask wearing behavior: A longitudinal twitter analysis</title>
      <link>https://escholarship.org/uc/item/03z98750</link>
      <description>[This corrects the article DOI: 10.1371/journal.pone.0257428.].</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/03z98750</guid>
      <pubDate>Wed, 17 Jun 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Hopfer, Suellen</name>
        <uri>https://orcid.org/0000-0003-3232-9743</uri>
      </author>
      <author>
        <name>Fields, Emilia J</name>
      </author>
      <author>
        <name>Lu, Yuwen</name>
      </author>
      <author>
        <name>Ramakrishnan, Ganesh</name>
      </author>
      <author>
        <name>Grover, Ted</name>
      </author>
      <author>
        <name>Bai, Qiushi</name>
      </author>
      <author>
        <name>Huang, Yicong</name>
      </author>
      <author>
        <name>Li, Chen</name>
      </author>
      <author>
        <name>Mark, Gloria</name>
      </author>
    </item>
    <item>
      <title>Retinal nerve fibre layer optical texture analysis: retinal nerve fibre bundle defect patterns and the extent of macular involvement across different stages of glaucoma</title>
      <link>https://escholarship.org/uc/item/0f18b2tt</link>
      <description>BACKGROUND/AIMS: To apply retinal nerve fibre layer (RNFL) optical texture analysis (ROTA) to investigate (1) the patterns of RNFL bundle defects, and (2) the frequency of papillomacular and papillofoveal bundle involvement across early, moderate and advanced glaucoma.
METHODS: All eyes underwent 24-2 visual field (VF) testing and optical coherence tomography (OCT) for ROTA. The borders of RNFL defects were delineated from ROTA, and the involvement of the arcuate, papillomacular and papillofoveal bundles was determined for each eye. 24-2 VF stimulus projections were mapped onto the corresponding topographic areas of ROTA images. Multilevel logistic regression analysis was applied to evaluate the structure-function association.
RESULTS: Papillomacular bundle defects were highly prevalent in glaucoma, increasing from 87.7% in early to 95.35% in moderate and 100% in advanced glaucoma. Papillofoveal bundle defects were also common, increasing from 29.7% in early to 36.05% in moderate...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0f18b2tt</guid>
      <pubDate>Wed, 3 Jun 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Kamalipour, Alireza</name>
      </author>
      <author>
        <name>Moghimi, Sasan</name>
      </author>
      <author>
        <name>Khosravi, Pooya</name>
        <uri>https://orcid.org/0000-0002-3631-4760</uri>
      </author>
      <author>
        <name>Tansuebchueasai, Natchada</name>
      </author>
      <author>
        <name>Camp, Andrew Steven</name>
      </author>
      <author>
        <name>Vasile, Cristiana</name>
      </author>
      <author>
        <name>Adelpour, Mohsen</name>
      </author>
      <author>
        <name>Gunasegaran, Gopikasree</name>
      </author>
      <author>
        <name>Kashaf, Michael Saheb</name>
      </author>
      <author>
        <name>Nishida, Takashi</name>
        <uri>https://orcid.org/0000-0002-8312-6623</uri>
      </author>
      <author>
        <name>Zangwill, Linda M</name>
        <uri>https://orcid.org/0000-0002-1143-5224</uri>
      </author>
      <author>
        <name>Lam, Alexander KN</name>
      </author>
      <author>
        <name>Leung, Christopher Kai-Shun</name>
      </author>
      <author>
        <name>Weinreb, Robert N</name>
        <uri>https://orcid.org/0000-0001-9553-3202</uri>
      </author>
    </item>
    <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>Enhancing Detection of Message Intents in a Mobile Health Smoking-Cessation Intervention Using Large Language Model Fine-Tuning, Data Downsampling, and Error Correction: Algorithm Development and Validation</title>
      <link>https://escholarship.org/uc/item/39r6q94p</link>
      <description>Background: Although smoking-cessation aids such as support groups and nicotine replacement therapy (NRT) can help people quit, quit rates remain low. Mobile health interventions can boost accessibility and engagement, especially with NRT, but require ongoing effort to deliver timely responses. Accurate intent detection is crucial for identifying user needs and delivering timely, appropriate chatbot responses. Recent large language model advancements in natural language processing and artificial intelligence (AI) have shown promise. However, these systems often struggle with many intent categories, complex language, and imbalanced data, reducing recognition accuracy.
Objective: The main goal of this study was to develop an AI tool, a large language model that could accurately detect people's message intents, despite dataset imbalances and complexities. In our application, the messages came from a smoking-cessation support-group intervention and often involved the use of NRT provided...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/39r6q94p</guid>
      <pubDate>Wed, 11 Feb 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Rahman, Shagoto</name>
      </author>
      <author>
        <name>Pechmann, Cornelia</name>
        <uri>https://orcid.org/0000-0002-9432-1475</uri>
      </author>
      <author>
        <name>Harris, Ian G</name>
      </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>
  </channel>
</rss>
