<?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/ucdavismath_oapdeposits/rss"/>
    <ttl>720</ttl>
    <title>Recent ucdavismath_oapdeposits items</title>
    <link>https://escholarship.org/uc/ucdavismath_oapdeposits/rss</link>
    <description>Recent eScholarship items from Open Access Policy Deposits</description>
    <pubDate>Wed, 29 Jul 2026 23:34:12 +0000</pubDate>
    <item>
      <title>Quantification of flagellar gait changes with combined shape mode analysis and swimming simulations</title>
      <link>https://escholarship.org/uc/item/9r52d862</link>
      <description>Many different microswimmers propel themselves using flagella that beat periodically. The shape of the flagellar beat and swimming speed have been observed to change with fluid rheology. We quantify changes in the flagellar waveforms of &lt;i&gt;Chlamydomonas reinhardtii&lt;/i&gt; in response to changes in fluid viscosity using (i) shape mode analysis and (ii) a full swimmer simulation to analyse how shape changes affect the swimming speed and to explore the dimensionality of the shape space. By decomposing the gait into the time-independent mean shape and the time-varying stroke, we find that the flagellar mean shape substantially changes in response to viscosity, while the changes in the time-varying stroke are more subtle. Using the swimmer simulation, we quantify how the swimming speed is affected by the dimensionality of the flagellar shape reconstruction, and we show that the observed change in swimming speed with viscosity is explained by the variations in mean flagellar shape and...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/9r52d862</guid>
      <pubDate>Wed, 29 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Gutierrez, Kelli E</name>
      </author>
      <author>
        <name>Thomases, Becca</name>
      </author>
      <author>
        <name>Arratia, Paulo E</name>
      </author>
      <author>
        <name>Guy, Robert D</name>
        <uri>https://orcid.org/0000-0002-0602-7015</uri>
      </author>
    </item>
    <item>
      <title>Optimizing metachronal paddling with reinforcement learning at low Reynolds number</title>
      <link>https://escholarship.org/uc/item/96k243c1</link>
      <description>Metachronal paddling is a swimming strategy in which an organism oscillates sets of adjacent limbs with a constant phase lag, propagating a metachronal wave through its limbs and propelling it forward. This limb coordination strategy is utilized by swimmers across a wide range of Reynolds numbers, which suggests that this metachronal rhythm was selected for its optimality of swimming performance. In this study, we apply reinforcement learning to a swimmer at zero Reynolds number and investigate whether the learning algorithm selects this metachronal rhythm, or if other coordination patterns emerge. We design the swimmer agent with an elongated body and pairs of straight, inflexible paddles placed along the body for various fixed paddle spacings. Based on paddle spacing, the swimmer agent learns qualitatively different coordination patterns. At tight spacings, a back-to-front metachronal wave-like stroke emerges which resembles the commonly observed biological rhythm, but at wide...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/96k243c1</guid>
      <pubDate>Wed, 29 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Bailey, Alana A</name>
      </author>
      <author>
        <name>Guy, Robert D</name>
        <uri>https://orcid.org/0000-0002-0602-7015</uri>
      </author>
    </item>
    <item>
      <title>Pumping and steady streaming driven by two-frequency oscillations of a cylinder</title>
      <link>https://escholarship.org/uc/item/4jr9b754</link>
      <description>The classical problem of steady streaming induced by an oscillating object has been studied extensively, but prior work has focused almost exclusively on single-frequency oscillations, which result in symmetric, quadrupole-like flows. Here we demonstrate that dual-frequency oscillations induce asymmetric steady streaming with a non-zero net flux in a direction determined by the polarity of the oscillation-the oscillator serves as a pump. We use numerical simulations and asymptotic analysis at small amplitude to examine two-dimensional steady streaming around a cylinder, first focusing on frequency ratio 2. The computational experiments show asymmetrical streaming and pumping, i.e. net flux downstream. It is well known from asymptotic analysis that steady streaming is second order in amplitude, and we show that pumping occurs at third order. We then extend the analysis to general frequency ratios, where we give necessary conditions for pumping, and predict the order in amplitude...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4jr9b754</guid>
      <pubDate>Wed, 29 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Lee, HS</name>
      </author>
      <author>
        <name>Ristenpart, WD</name>
        <uri>https://orcid.org/0000-0002-4935-6310</uri>
      </author>
      <author>
        <name>Guy, RD</name>
        <uri>https://orcid.org/0000-0002-0602-7015</uri>
      </author>
    </item>
    <item>
      <title>Flag Gromov-Witten invariants via crystals</title>
      <link>https://escholarship.org/uc/item/93w4r2xr</link>
      <description>We apply ideas from crystal theory to affine Schubert calculus and flag Gromov-Witten invariants. By defining operators on certain decompositions of elements in the type-A affine Weyl group, we produce a crystal reflecting the internal structure of Specht modules associated to permutation diagrams. We show how this crystal framework can be applied to study the product of a Schur function with a k-Schur function. Consequently, we prove that a subclass of 3-point Gromov-Witten invariants of complete flag varieties for C&lt;sup&gt;n&lt;/sup&gt; enumerate the highest weight elements under these operators.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/93w4r2xr</guid>
      <pubDate>Wed, 15 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Morse, J</name>
      </author>
      <author>
        <name>Schilling, A</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
    </item>
    <item>
      <title>Affine charge and the k-bounded Pieri rule</title>
      <link>https://escholarship.org/uc/item/89b1d3m4</link>
      <description>We provide a new description of the Pieri rule of the homology of the affine Grassmannian and an affine analogue of the charge statistics in terms of bounded partitions. This makes it possible to extend the formulation of the Kostka–Foulkes polynomials in terms of solvable lattice models by Nakayashiki and Yamada to the affine setting.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/89b1d3m4</guid>
      <pubDate>Wed, 15 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Morse, J</name>
      </author>
      <author>
        <name>Schilling, A</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
    </item>
    <item>
      <title>The mystery of plethysm coefficients</title>
      <link>https://escholarship.org/uc/item/83x4r5zb</link>
      <description>&lt;p&gt; Composing two representations of the general linear groups gives rise to Littlewood’s (outer) plethysm. On the level of characters, this poses the question of finding the Schur expansion of the plethysm of two Schur functions. A combinatorial interpretation for the Schur expansion coefficients of the plethysm of two Schur functions is, in general, still an open problem. We identify a proof technique of combinatorial representation theory, which we call the “    -perp trick”, and point out several examples in the literature where this idea is used. We use the    -perp trick to give algorithms for computing monomial and Schur expansions of symmetric functions. In several special cases, these algorithms are more efficient than those currently implemented in SageMath . &lt;/p&gt;</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/83x4r5zb</guid>
      <pubDate>Wed, 15 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Colmenarejo, Laura</name>
      </author>
      <author>
        <name>Orellana, Rosa</name>
      </author>
      <author>
        <name>Saliola, Franco</name>
      </author>
      <author>
        <name>Schilling, Anne</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
      <author>
        <name>Zabrocki, Mike</name>
      </author>
    </item>
    <item>
      <title>Combinatorial Characterization of Queer Supercrystals (Survey)</title>
      <link>https://escholarship.org/uc/item/7kr251d1</link>
      <description>We provide a characterization of the crystal bases for the quantum queer superalgebra recently introduced by Grantcharov et al. This characterization is a combination of local queer axioms generalizing Stembridge’s local axioms for crystal bases for simply-laced root systems, which were recently introduced by Assaf and Oguz, with further axioms and a new graph G characterizing the relations of the type A components of the queer crystal. We provide a counterexample to Assaf’s and Oguz’ conjecture that the local queer axioms uniquely characterize the queer supercrystal. We obtain a combinatorial description of the graph G on the type A components by providing explicit combinatorial rules for the odd queer operators on certain highest weight elements.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7kr251d1</guid>
      <pubDate>Wed, 15 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Gillespie, Maria</name>
      </author>
      <author>
        <name>Hawkes, Graham</name>
      </author>
      <author>
        <name>Poh, Wencin</name>
      </author>
      <author>
        <name>Schilling, Anne</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
    </item>
    <item>
      <title>Dimension of Splines on Graphs in the Case of Degree Two and Smoothness One in Two Variables</title>
      <link>https://escholarship.org/uc/item/73q3q952</link>
      <description>Dimension of Splines on Graphs in the Case of Degree Two and Smoothness One in Two Variables</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/73q3q952</guid>
      <pubDate>Wed, 15 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Nazir, Shaheen</name>
      </author>
      <author>
        <name>Schilling, Anne</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
      <author>
        <name>Tymoczko, Julianna</name>
      </author>
    </item>
    <item>
      <title>A minimaj-preserving crystal structure on ordered multiset partitions</title>
      <link>https://escholarship.org/uc/item/6xp4p8dm</link>
      <description>We provide a crystal structure on the set of ordered multiset partitions, which recently arose in the pursuit of the Delta Conjecture. This conjecture was stated by Haglund, Remmel and Wilson as a generalization of the Shuffle Conjecture. Various statistics on ordered multiset partitions arise in the combinatorial analysis of the Delta Conjecture, one of them being the minimaj statistic, which is a variant of the major index statistic on words. Our crystal has the property that the minimaj statistic is constant on connected components of the crystal. In particular, this yields another proof of the Schur positivity of the graded Frobenius series of the generalization Rn,k due to Haglund, Rhoades and Shimozono of the coinvariant algebra Rn. The crystal structure also yields a bijective proof of the equidistributivity of the minimaj statistic with the major index statistic on ordered multiset partitions.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6xp4p8dm</guid>
      <pubDate>Wed, 15 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Benkart, G</name>
      </author>
      <author>
        <name>Colmenarejo, L</name>
      </author>
      <author>
        <name>Harris, PE</name>
      </author>
      <author>
        <name>Orellana, R</name>
      </author>
      <author>
        <name>Panova, G</name>
      </author>
      <author>
        <name>Schilling, A</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
      <author>
        <name>Yip, M</name>
      </author>
    </item>
    <item>
      <title>Queer supercrystals in SageMath</title>
      <link>https://escholarship.org/uc/item/6570c945</link>
      <description>We describe the implementation of queer supercrystals. Our code is documented with test suites and has been integrated into SageMath. Through computer explorations using this implementation, we provide a counterexample to Assaf's and Oguz' conjecture that their local queer axioms uniquely characterize the queer supercrystal.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6570c945</guid>
      <pubDate>Wed, 15 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Poh, W</name>
      </author>
      <author>
        <name>Schilling, A</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
    </item>
    <item>
      <title>Structural classification of locally stationary time series based on second-order characteristics</title>
      <link>https://escholarship.org/uc/item/4cb1n525</link>
      <description>Abstract Time series classification is crucial for numerous scientific and engineering applications. In this article, we present a numerically efficient, practically competitive, and theoretically rigorous classification method for distinguishing between two classes of locally stationary time series based on their time-domain, second-order characteristics. Our approach builds on the autoregressive approximation for locally stationary time series, imposes no requirement on the training sample size, and is shown to achieve zero misclassification error rate asymptotically when the underlying time series differ only mildly in their second-order characteristics. The new method is demonstrated to outperform a variety of state-of-the-art solutions, including wavelet-based, tree-based, convolution-based methods, as well as modern deep learning methods, through intensive numerical simulations and a real electroencephalography data analysis for epilepsy classification.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4cb1n525</guid>
      <pubDate>Fri, 10 Jul 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Qian, Chen</name>
      </author>
      <author>
        <name>Ding, Xiucai</name>
      </author>
      <author>
        <name>Li, Lexin</name>
      </author>
    </item>
    <item>
      <title>Multiscale Hodge scattering networks for data analysis</title>
      <link>https://escholarship.org/uc/item/80j0t30k</link>
      <description>We propose new scattering networks for signals measured on simplicial complexes, which we call Multiscale Hodge Scattering Networks (MHSNs). Our construction builds on multiscale basis dictionaries on simplicial complexes—namely, the κ-GHWT and κ-HGLET—which we recently developed for simplices of dimension κ ∈ N in a given simplicial complex by generalizing the node-based Generalized Haar–Walsh Transform (GHWT) and Hierarchical Graph Laplacian Eigen Transform (HGLET). Both the κ-GHWT and the κ-HGLET form redundant sets (i.e., dictionaries) of multiscale basis vectors and the corresponding expansion coefficients of a given signal. Our MHSNs adopt a layered structure analogous to a convolutional neural network (CNN), cascading the moments of the modulus of the dictionary coefficients. The resulting features are invariant to reordering of the simplices (i.e., node permutation of the underlying graphs). Importantly, the use of multiscale basis dictionaries in our MHSNs admits a natural...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/80j0t30k</guid>
      <pubDate>Thu, 26 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Saito, Naoki</name>
        <uri>https://orcid.org/0000-0001-5234-4719</uri>
      </author>
      <author>
        <name>Schonsheck, Stefan C</name>
      </author>
      <author>
        <name>Shvarts, Eugene</name>
      </author>
    </item>
    <item>
      <title>Explainable and Class-Revealing Signal Feature Extraction via Scattering Transform and Constrained Zeroth-Order Optimization</title>
      <link>https://escholarship.org/uc/item/4kh0431d</link>
      <description>We propose a new method to extract discriminant and explainable features from a particular machine learning model, i.e., a combination of the scattering transform and the multiclass logistic regression. Although this model is well-known for its ability to learn various signal classes with high classification rate, it remains elusive to understand why it can generate such successful classification, mainly due to the nonlinearity of the scattering transform. In order to uncover the meaning of the scattering transform coefficients selected by the multiclass logistic regression (with the Lasso penalty), we adopt zeroth-order optimization algorithms to search an input pattern that maximizes the class probability of a class of interest given the learned model. In order to do so, it turns out that imposing sparsity and smoothness of input patterns is important. We demonstrate the effectiveness of our proposed method using a couple of synthetic time-series classification problems.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4kh0431d</guid>
      <pubDate>Thu, 26 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Saito, Naoki</name>
        <uri>https://orcid.org/0000-0001-5234-4719</uri>
      </author>
      <author>
        <name>Weber, David</name>
      </author>
    </item>
    <item>
      <title>Explainable and Class-Revealing Signal Feature Extraction via Scattering Transform and Constrained Zeroth-Order Optimization</title>
      <link>https://escholarship.org/uc/item/28t9z2kq</link>
      <description>We propose a new method to extract discriminant and explainable features from
a particular machine learning model, i.e., a combination of the scattering
transform and the multiclass logistic regression. Although this model is
well-known for its ability to learn various signal classes with high
classification rate, it remains elusive to understand why it can generate such
successful classification, mainly due to the nonlinearity of the scattering
transform. In order to uncover the meaning of the scattering transform
coefficients selected by the multiclass logistic regression (with the Lasso
penalty), we adopt zeroth-order optimization algorithms to search an input
pattern that maximizes the class probability of a class of interest given the
learned model. In order to do so, it turns out that imposing sparsity and
smoothness of input patterns is important. We demonstrate the effectiveness of
our proposed method using a couple of synthetic time-series classification
problems.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/28t9z2kq</guid>
      <pubDate>Thu, 26 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Saito, Naoki</name>
        <uri>https://orcid.org/0000-0001-5234-4719</uri>
      </author>
      <author>
        <name>Weber, David</name>
      </author>
    </item>
    <item>
      <title>Plabic tangles and cluster promotion maps</title>
      <link>https://escholarship.org/uc/item/6rp7629z</link>
      <description>Inspired by the BCFW recurrence for tilings of the amplituhedron, we introduce the general framework of plabic tangles that utilizes plabic graphs to define rational maps between products of Grassmannians called promotions. The central conjecture of the paper is that promotion maps are quasi-cluster homomorphisms, which we prove for several classes of promotions. In order to define promotion maps, we utilize m-vector-relation configurations (m-VRCs) on plabic graphs. We relate m-VRCs to the degree (a.k.a ‘intersection number’) of the amplituhedron map on positroid varieties and characterize all plabic trees with intersection number one and their VRCs. Finally, we show that promotion maps admit an operad structure and, supported by the class of 4-mass box promotions, we point at new positivity properties for non-rational maps beyond cluster algebras. Promotion maps have important connections to the geometry and cluster structure of the amplituhedron and singularities of scattering...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6rp7629z</guid>
      <pubDate>Wed, 11 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Even-Zohar, Chaim</name>
      </author>
      <author>
        <name>Parisi, Matteo</name>
      </author>
      <author>
        <name>Sherman-Bennett, Melissa</name>
      </author>
      <author>
        <name>Tessler, Ran</name>
      </author>
      <author>
        <name>Williams, Lauren</name>
      </author>
    </item>
    <item>
      <title>Hook-Valued Tableau Uncrowding and Tableau Switching</title>
      <link>https://escholarship.org/uc/item/4bd954vc</link>
      <description>Hook-Valued Tableau Uncrowding and Tableau Switching</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4bd954vc</guid>
      <pubDate>Wed, 11 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Jang, Jihyeug</name>
      </author>
      <author>
        <name>Kim, Jang Soo</name>
      </author>
      <author>
        <name>Pan, Jianping</name>
      </author>
      <author>
        <name>Pappe, Joseph</name>
      </author>
      <author>
        <name>Schilling, Anne</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
    </item>
    <item>
      <title>Braid variety cluster structures, II: general type</title>
      <link>https://escholarship.org/uc/item/0vb996s2</link>
      <description>We show that braid varieties for any complex simple algebraic group G$$G$$ are cluster varieties. This includes open Richardson varieties inside the flag variety G/B$$G/B$$.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0vb996s2</guid>
      <pubDate>Wed, 11 Mar 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Galashin, Pavel</name>
      </author>
      <author>
        <name>Lam, Thomas</name>
      </author>
      <author>
        <name>Sherman-Bennett, Melissa</name>
      </author>
    </item>
    <item>
      <title>The symplectic isotopy problem for rational cuspidal curves</title>
      <link>https://escholarship.org/uc/item/82c4q4tr</link>
      <description>We define a suitably tame class of singular symplectic curves in 4-manifolds, namely those whose singularities are modeled on complex curve singularities. We study the corresponding symplectic isotopy problem, with a focus on rational curves with irreducible singularities (rational cuspidal curves) in the complex projective plane. We prove that every such curve is isotopic to a complex curve in degrees up to five, and for curves with one singularity whose link is a torus knot. Classification results of symplectic isotopy classes rely on pseudo-holomorphic curves together with a symplectic version of birational geometry of log pairs and techniques from four-dimensional topology.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/82c4q4tr</guid>
      <pubDate>Wed, 25 Feb 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Golla, Marco</name>
      </author>
      <author>
        <name>Starkston, Laura</name>
      </author>
    </item>
    <item>
      <title>Rational cuspidal curves and symplectic fillings</title>
      <link>https://escholarship.org/uc/item/3dd6v4x8</link>
      <description>Rational cuspidal curves and symplectic fillings</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3dd6v4x8</guid>
      <pubDate>Wed, 25 Feb 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Golla, Marco</name>
      </author>
      <author>
        <name>Starkston, Laura</name>
      </author>
    </item>
    <item>
      <title>Equivariant Perturbation in Gomory and Johnson’s Infinite Group Problem. VII. Inverse Semigroup Theory, Closures, Decomposition of Perturbations</title>
      <link>https://escholarship.org/uc/item/5cx7z609</link>
      <description>In this self-contained paper, we present a theory of the piecewise linear minimal valid functions for the 1-row Gomory–Johnson infinite group problem. The non-extreme minimal valid functions are those that admit effective perturbations. We give a precise description of the space of these perturbations as a direct sum of certain finite- and infinite-dimensional subspaces. The infinite-dimensional subspaces have partial symmetries; to describe them, we develop a theory of inverse semigroups of partial bijections, interacting with the functional equations satisfied by the perturbations. Our paper provides the foundation for grid-free algorithms for the Gomory–Johnson model, in particular for testing extremality of piecewise linear functions whose breakpoints are rational numbers with huge denominators.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5cx7z609</guid>
      <pubDate>Sat, 14 Feb 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Hildebrand, Robert</name>
      </author>
      <author>
        <name>Köppe, Matthias</name>
      </author>
      <author>
        <name>Zhou, Yuan</name>
      </author>
    </item>
    <item>
      <title>Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations</title>
      <link>https://escholarship.org/uc/item/5c33591q</link>
      <description>Within the framework of the superadditive duality theory of integer programming, we study two types of dual-feasible functions of a single real variable (Alves et al., 2016). We introduce software that automates testing piecewise linear functions for maximality and extremality, enabling a computer-based search. We build a connection to cut-generating functions in the Gomory–Johnson and related models, complete the characterization of maximal functions, and prove analogues of the Gomory–Johnson 2-slope theorem and the Basu–Hildebrand–Molinaro approximation theorem.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5c33591q</guid>
      <pubDate>Sat, 14 Feb 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Köppe, Matthias</name>
      </author>
      <author>
        <name>Wang, Jiawei</name>
      </author>
    </item>
    <item>
      <title>Integer points in arbitrary convex cones: the case of the PSD and SOC cones</title>
      <link>https://escholarship.org/uc/item/5jq3z5r6</link>
      <description>We investigate the semigroup of integer points inside a convex cone. We extend classical results in integer linear programming to integer conic programming. We show that the semigroup associated with nonpolyhedral cones can sometimes have a notion of finite generating set with the help of a group action. We show this is true for the cone of positive semidefinite matrices (PSD) and the second-order cone (SOC). Both cones have a finite generating set of integer points, similar in spirit to Hilbert bases, under the action of a finitely generated group. We also extend notions of total dual integrality, Gomory-Chvátal closure, and Carathéodory rank to integer points in arbitrary cones.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5jq3z5r6</guid>
      <pubDate>Wed, 11 Feb 2026 00:00:00 +0000</pubDate>
      <author>
        <name>De Loera, Jesús A</name>
        <uri>https://orcid.org/0000-0002-9556-1112</uri>
      </author>
      <author>
        <name>Marsters, Brittney</name>
      </author>
      <author>
        <name>Xu, Luze</name>
      </author>
      <author>
        <name>Zhang, Shixuan</name>
      </author>
    </item>
    <item>
      <title>On contact 3‐manifolds that admit a nonfree toric action</title>
      <link>https://escholarship.org/uc/item/01b6946f</link>
      <description>Abstract  We classify all contact structures on 3‐manifolds that admit a nonfree toric action, up to contactomorphism, and present them through explicit topological descriptions. Our classification is based on Lerman's classification of toric contact 3‐manifolds up to equivariant contactomorphism [Lerman, J. Symplectic Geom. 1 (2003), 785–828]. We also prove that every contact 3‐manifold with a nonfree toric action arises as the concave boundary of a toric linear plumbing over spheres inspired by Marinković et&amp;nbsp;al. As a corollary of both results, we classify which contact 3‐manifolds arise as the concave boundary of a linear plumbing of&amp;nbsp;spheres.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/01b6946f</guid>
      <pubDate>Wed, 28 Jan 2026 00:00:00 +0000</pubDate>
      <author>
        <name>Marinković, Aleksandra</name>
      </author>
      <author>
        <name>Starkston, Laura</name>
      </author>
    </item>
    <item>
      <title>An extended Vinogradov’s mean value theorem</title>
      <link>https://escholarship.org/uc/item/795990w4</link>
      <description>&lt;p&gt;In this paper, we provide novel mean value estimates for exponential sums related to the extended main conjecture of Vinogradov’s mean value theorem, by developing the Hardy-Littlewood circle method together with a refined shifting variables argument.&lt;/p&gt; &lt;p&gt; Let    be a natural number and    . Define the exponential sum    For    , consider mean values of the exponential sums    where we wrote    . By making use of the aforementioned tools, we obtain the sharp upper bound for    , for    and    . Furthermore, for    , we obtain analogous results depending on a small cap decoupling inequality for the moment curves in    . &lt;/p&gt;</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/795990w4</guid>
      <pubDate>Sun, 7 Dec 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Oh, Changkeun</name>
      </author>
      <author>
        <name>Yeon, Kiseok</name>
      </author>
    </item>
    <item>
      <title>The contact cut graph and a Weinstein L$\mathcal {L}$‐invariant</title>
      <link>https://escholarship.org/uc/item/47c6420j</link>
      <description>Abstract  We define and study the contact cut graph which is an analogue of Hatcher and Thurston's cut graph for contact geometry, inspired by contact Heegaard splittings (Giroux, Proceedings of the International Congress of Mathematicians , Beijing, 2002; Torisu, Internat. Math. Res. Notices (2000), 441–454). We show how oriented paths in the contact cut graph correspond to Lefschetz fibrations and multisection with divides diagrams. We also give a correspondence for achiral Lefschetz fibrations. We use these correspondences to define a new invariant of Weinstein domains, the Weinstein ‐invariant , that is a symplectic analogue of the Kirby–Thompson's ‐invariant of smooth 4‐manifolds. We discuss the relation of Lefschetz stabilization with the Weinstein ‐invariant. We present topological and geometric constraints of Weinstein domains with . We also give two families of examples of multisections with divides that have arbitrarily large ‐invariant.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/47c6420j</guid>
      <pubDate>Mon, 1 Dec 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Castro, Nickolas A</name>
      </author>
      <author>
        <name>Islambouli, Gabriel</name>
      </author>
      <author>
        <name>Min, Jie</name>
      </author>
      <author>
        <name>Sakallı, Sümeyra</name>
      </author>
      <author>
        <name>Starkston, Laura</name>
      </author>
      <author>
        <name>Wu, Angela</name>
      </author>
    </item>
    <item>
      <title>Morse actions of discrete groups on symmetric spaces: local-to-global principle</title>
      <link>https://escholarship.org/uc/item/3dv5k0qb</link>
      <description>Our main result is a local-to-global principle for Morse quasigeodesics, maps and actions. As an application of our techniques we show algorithmic recognizability of Morse actions and construct Morse “Schottky subgroups” of higher-rank semisimple Lie groups via arguments not based on Tits pingpong. Our argument is purely geometric and proceeds by constructing equivariant Morse quasiisometric embeddings of trees into higher-rank symmetric spaces.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3dv5k0qb</guid>
      <pubDate>Wed, 24 Sep 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Kapovich, Michael</name>
        <uri>https://orcid.org/0000-0001-5475-8755</uri>
      </author>
      <author>
        <name>Leeb, Bernhard</name>
      </author>
      <author>
        <name>Porti, Joan</name>
      </author>
    </item>
    <item>
      <title>The Combinatorial Theory Flip</title>
      <link>https://escholarship.org/uc/item/92p0s02x</link>
      <description>The Combinatorial Theory Flip</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/92p0s02x</guid>
      <pubDate>Wed, 27 Aug 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Schilling, Anne</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
    </item>
    <item>
      <title>Interview with Anne Schilling</title>
      <link>https://escholarship.org/uc/item/2rs1x74j</link>
      <description>Interview with Anne Schilling</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2rs1x74j</guid>
      <pubDate>Wed, 27 Aug 2025 00:00:00 +0000</pubDate>
    </item>
    <item>
      <title>Complexity of Finite Semigroups: History and Decidability</title>
      <link>https://escholarship.org/uc/item/7bg31125</link>
      <description>Margolis, Rhodes and Schilling recently submitted two papers that proved that the complexity of a finite semigroup is computable. The purpose of this paper is to survey the basic results of Krohn–Rhodes complexity of finite semigroups and to outline the proof of its computability.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7bg31125</guid>
      <pubDate>Wed, 13 Aug 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Margolis, Stuart</name>
      </author>
      <author>
        <name>Rhodes, John</name>
      </author>
      <author>
        <name>Schilling, Anne</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
    </item>
    <item>
      <title>Weinstein Handlebodies for Complements of Smoothed Toric Divisors</title>
      <link>https://escholarship.org/uc/item/5hx005cj</link>
      <description>&lt;p&gt; We study the interactions between toric manifolds and Weinstein handlebodies. We define a partially-centeredness condition on a Delzant polytope, which we prove ensures that the complement of a corresponding partial smoothing of the total toric divisor supports an explicit Weinstein structure. Many examples which fail this condition also fail to have Weinstein (or even exact) complement to the partially smoothed divisor. We investigate the combinatorial possibilities of Delzant polytopes that realize such Weinstein domain complements. We also develop an algorithm to construct a Weinstein handlebody diagram in Gompf standard form for the complement of such a partially smoothed total toric divisor. The algorithm we develop more generally outputs a Weinstein handlebody diagram for any Weinstein 4-manifold constructed by attaching 2-handles to the disk cotangent bundle of any surface&amp;nbsp;    , where the 2-handles are attached along the co-oriented conormal lifts of curves on&amp;nbsp;...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5hx005cj</guid>
      <pubDate>Thu, 17 Jul 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Acu, Bahar</name>
      </author>
      <author>
        <name>Capovilla-Searle, Orsola</name>
      </author>
      <author>
        <name>Gadbled, Agnès</name>
      </author>
      <author>
        <name>Marinković, Aleksandra</name>
      </author>
      <author>
        <name>Murphy, Emmy</name>
      </author>
      <author>
        <name>Starkston, Laura</name>
      </author>
      <author>
        <name>Wu, Angela</name>
      </author>
    </item>
    <item>
      <title>Optimization tools for computing colorings of [ 1 , … , n ] with few monochromatic solutions on 3-variable linear equations</title>
      <link>https://escholarship.org/uc/item/5c22v7db</link>
      <description>A famous result in arithmetic Ramsey theory says that for many linear homogeneous equations E there is a threshold value Rk(E) (the Rado number of E) such that for any k-coloring of the integers in the interval [1,n], with n≥Rk(E), there exists at least one monochromatic solution. But one can further ask, how many monochromatic solutions is the minimum possible in terms of n? Several authors have estimated this function before, here we offer new tools from integer and semidefinite optimization that help find either optimal or near optimal 2-colorings minimizing the number of monochromatic solutions of several families of 3-variable non-regular homogeneous linear equations. In the last part of the paper we further extend to three and more colors for the Schur equation, improving earlier work.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5c22v7db</guid>
      <pubDate>Sun, 25 May 2025 00:00:00 +0000</pubDate>
      <author>
        <name>De Loera, Jesús A</name>
        <uri>https://orcid.org/0000-0002-9556-1112</uri>
      </author>
      <author>
        <name>Ventura, Denae</name>
      </author>
      <author>
        <name>Wang, Liuyue</name>
      </author>
      <author>
        <name>Wesley, William J</name>
      </author>
    </item>
    <item>
      <title>Lipschitz decompositions of domains with bilaterally flat boundaries</title>
      <link>https://escholarship.org/uc/item/5pg5p7j7</link>
      <description>Abstract: 
We study classes of domains in  with sufficiently flat boundaries that admit a decomposition or covering of bounded overlap by Lipschitz graph domains with controlled total surface area. This study is motivated by the following result proved by Peter Jones as a piece of his proof of the Analyst's Traveling Salesman Theorem in the complex plane: Any simply connected domain  with finite boundary length  can be decomposed into Lipschitz graph domains with total boundary length at most  for some  independent of . In this paper, we prove an analogous Lipschitz decomposition result in higher dimensions for domains with Reifenberg flat boundaries satisfying a uniform beta‐squared sum bound. We use similar techniques to show that domains with general Reifenberg flat or uniformly rectifiable boundaries admit similar Lipschitz decompositions while allowing the constituent domains to have bounded overlaps rather than be&amp;nbsp;disjoint.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5pg5p7j7</guid>
      <pubDate>Mon, 28 Apr 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Krandel, Jared</name>
      </author>
    </item>
    <item>
      <title>The geometry of colors in van Gogh’s Sunflowers</title>
      <link>https://escholarship.org/uc/item/11g508gv</link>
      <description>“Paintings fade like flowers”: van Gogh’s prediction on the impact of age on paintings came true for most of his paintings. We have studied the consequences of this aging on the Sunflowers in a vase with a yellow background series, namely its original, F454, currently in London, and two replicates, F457, in Tokyo, and F458, in Amsterdam, which van Gogh painted using the original as a model. The background and flower renditions in those paintings have faded and turned brown, making them less vibrant that van Gogh had most likely intended. We have attempted to restore van Gogh’s intent using a computational approach based on data science. After identifications of regions of interest (ROI) within the three paintings F454, F457, and F458 that capture the flowers, stems of the flowers, and background, respectively, we studied the geometry of the color space (in RGB representation) occupied by those ROIs. By comparing those color spaces with those occupied by similar ROIs in photographs...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/11g508gv</guid>
      <pubDate>Thu, 10 Apr 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Liao, Shuting</name>
      </author>
      <author>
        <name>Koehl, Patrice</name>
      </author>
      <author>
        <name>Schultens, Jennifer</name>
        <uri>https://orcid.org/0000-0003-3898-0051</uri>
      </author>
      <author>
        <name>Hsieh, Fushing</name>
        <uri>https://orcid.org/0000-0002-9292-6980</uri>
      </author>
    </item>
    <item>
      <title>Continued fractions and lines across the Stern–Brocot diagram</title>
      <link>https://escholarship.org/uc/item/50h793r6</link>
      <description>Continued fractions and lines across the Stern–Brocot diagram</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/50h793r6</guid>
      <pubDate>Wed, 9 Apr 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Abramson, Heather</name>
      </author>
      <author>
        <name>Chesebro, Eric</name>
      </author>
      <author>
        <name>Cummins, Vivian</name>
      </author>
      <author>
        <name>Emlen, Cory</name>
      </author>
      <author>
        <name>Grady, Ryan</name>
      </author>
      <author>
        <name>Ke, Kenton</name>
      </author>
    </item>
    <item>
      <title>Farey recursive functions</title>
      <link>https://escholarship.org/uc/item/4js6x7qf</link>
      <description>Farey recursive functions</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4js6x7qf</guid>
      <pubDate>Wed, 9 Apr 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Chesebro, Eric</name>
      </author>
      <author>
        <name>Emlen, Cory</name>
      </author>
      <author>
        <name>Ke, Kenton</name>
      </author>
      <author>
        <name>LaFontaine, Denise</name>
      </author>
      <author>
        <name>McKinnie, Kelly</name>
      </author>
      <author>
        <name>Rigby, Catherine</name>
      </author>
    </item>
    <item>
      <title>The lattice of submonoids of the uniform block permutations containing the symmetric group</title>
      <link>https://escholarship.org/uc/item/8hn3k54s</link>
      <description>We study the lattice of submonoids of the uniform block permutation monoid containing the symmetric group (which is its group of units). We prove that this lattice is distributive under union and intersection by relating the submonoids containing the symmetric group to downsets in a new partial order on integer partitions. Furthermore, we show that the sizes of the J$$\mathscr {J}$$-classes of the uniform block permutation monoid are sums of squares of dimensions of irreducible modules of the monoid algebra.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8hn3k54s</guid>
      <pubDate>Wed, 26 Mar 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Orellana, Rosa</name>
      </author>
      <author>
        <name>Saliola, Franco</name>
      </author>
      <author>
        <name>Schilling, Anne</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
      <author>
        <name>Zabrocki, Mike</name>
      </author>
    </item>
    <item>
      <title>The immersion poset on partitions</title>
      <link>https://escholarship.org/uc/item/55v4v3jk</link>
      <description>Abstract: 

          We introduce the immersion poset 
              
                $$({\mathcal {P}}(n), \leqslant _I)$$
                
                  
                    (
                    P
                    
                      (
                      n
                      )
                    
                    ,
                    
                      ⩽
                      I
                    
                    )
                  
                
              
             on partitions, defined by 
              
                $$\lambda \leqslant _I \mu $$
                
                  
                    λ
                    
                      ⩽
                      I
                    
                    μ
                  
                
              
             if and only if 
              
                $$s_\mu (x_1, \ldots , x_N) - s_\lambda (x_1, \ldots , x_N)$$
                
                  
      ...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/55v4v3jk</guid>
      <pubDate>Wed, 12 Mar 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Johnston, Lisa</name>
      </author>
      <author>
        <name>Kenepp, David</name>
      </author>
      <author>
        <name>Nguyen, Evuilynn</name>
      </author>
      <author>
        <name>Paul, Digjoy</name>
      </author>
      <author>
        <name>Schilling, Anne</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
      <author>
        <name>Simone, Mary Claire</name>
      </author>
      <author>
        <name>Zhou, Regina</name>
      </author>
    </item>
    <item>
      <title>Corrigendum: A Demazure crystal construction for Schubert polynomials</title>
      <link>https://escholarship.org/uc/item/3z3793p9</link>
      <description>We give a corrigendum to our paper&amp;nbsp;[4] entitled “A Demazure crystal construction for Schubert polynomials”.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3z3793p9</guid>
      <pubDate>Wed, 26 Feb 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Assaf, Sami</name>
      </author>
      <author>
        <name>Schilling, Anne</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
    </item>
    <item>
      <title>The strong Haken theorem via sphere complexes</title>
      <link>https://escholarship.org/uc/item/7rd3q8kt</link>
      <description>The strong Haken theorem via sphere complexes</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7rd3q8kt</guid>
      <pubDate>Wed, 29 Jan 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Hensel, Sebastian</name>
      </author>
      <author>
        <name>Schultens, Jennifer</name>
      </author>
    </item>
    <item>
      <title>Tree polynomials identify a link between co-transcriptional R-loops and nascent RNA folding</title>
      <link>https://escholarship.org/uc/item/7hf1p79d</link>
      <description>R-loops are a class of non-canonical nucleic acid structures that typically form during transcription when the nascent RNA hybridizes the DNA template strand, leaving the non-template DNA strand unpaired. These structures are abundant in nature and play important physiological and pathological roles. Recent research shows that DNA sequence and topology affect R-loops, yet it remains unclear how these and other factors contribute to R-loop formation. In this work, we investigate the link between nascent RNA folding and the formation of R-loops. We introduce tree-polynomials, a new class of representations of RNA secondary structures. A tree-polynomial representation consists of a rooted tree associated with an RNA secondary structure together with a polynomial that is uniquely identified with the rooted tree. Tree-polynomials enable accurate, interpretable and efficient data analysis of RNA secondary structures without pseudoknots. We develop a computational pipeline for investigating...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7hf1p79d</guid>
      <pubDate>Mon, 20 Jan 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Liu, Pengyu</name>
      </author>
      <author>
        <name>Lusk, Jacob</name>
      </author>
      <author>
        <name>Jonoska, Nataša</name>
      </author>
      <author>
        <name>Vázquez, Mariel</name>
      </author>
    </item>
    <item>
      <title>THE BEST WAYS TO SLICE A POLYTOPE</title>
      <link>https://escholarship.org/uc/item/83s1w0m9</link>
      <description>We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of possible combinatorial types of sections and craft algorithms that compute optimal sections of the polytope according to various combinatorial and metric criteria, including sections that maximize the number of k-dimensional faces, maximize the volume, and maximize the integral of a polynomial. Our optimization algorithms run in polynomial time in fixed dimension, but the same problems show computational complexity hardness otherwise. Our tools can be extended to intersection with halfspaces and projections onto hyperplanes. Finally, we present several experiments illustrating our theorems and algorithms on famous polytopes.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/83s1w0m9</guid>
      <pubDate>Fri, 17 Jan 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Brandenburg, Marie-charlotte</name>
      </author>
      <author>
        <name>De Loera, Jesus A</name>
        <uri>https://orcid.org/0000-0002-9556-1112</uri>
      </author>
      <author>
        <name>Meroni, Chiara</name>
      </author>
    </item>
    <item>
      <title>Weighted Ehrhart theory: Extending Stanley's nonnegativity theorem</title>
      <link>https://escholarship.org/uc/item/7hv0d6r8</link>
      <description>We generalize R. P. Stanley's celebrated theorem that the h⁎-polynomial of the Ehrhart series of a rational polytope has nonnegative coefficients and is monotone under containment of polytopes. We show that these results continue to hold for weighted Ehrhart series where lattice points are counted with polynomial weights, as long as the weights are homogeneous polynomials decomposable as sums of products of linear forms that are nonnegative on the polytope. We also show nonnegativity of the h⁎-polynomial as a real-valued function for a larger family of weights. We explore the case when the weight function is the square of a single (arbitrary) linear form. We show stronger results for two-dimensional convex lattice polygons and give concrete examples showing tightness of the hypotheses. As an application, we construct a counterexample to a conjecture by Berg, Jochemko, and Silverstein on Ehrhart tensor polynomials.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7hv0d6r8</guid>
      <pubDate>Fri, 17 Jan 2025 00:00:00 +0000</pubDate>
      <author>
        <name>Bajo, Esme</name>
      </author>
      <author>
        <name>Davis, Robert</name>
      </author>
      <author>
        <name>De Loera, Jesús A</name>
        <uri>https://orcid.org/0000-0002-9556-1112</uri>
      </author>
      <author>
        <name>Garber, Alexey</name>
      </author>
      <author>
        <name>Mora, Sofía Garzón</name>
      </author>
      <author>
        <name>Jochemko, Katharina</name>
      </author>
      <author>
        <name>Yu, Josephine</name>
      </author>
    </item>
    <item>
      <title>The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg</title>
      <link>https://escholarship.org/uc/item/58b3n6qb</link>
      <description>We discuss five fundamental results of discrete mathematics: the lemmas of Sperner and Tucker from combinatorial topology and the theorems of Carathéodory, Helly, and Tverberg from combinatorial geometry. We explore their connections and emphasize their broad impact in application areas such as data science, game theory, graph theory, mathematical optimization, computational geometry, etc.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/58b3n6qb</guid>
      <pubDate>Fri, 17 Jan 2025 00:00:00 +0000</pubDate>
      <author>
        <name>De Loera, Jesús A</name>
        <uri>https://orcid.org/0000-0002-9556-1112</uri>
      </author>
      <author>
        <name>Goaoc, Xavier</name>
      </author>
      <author>
        <name>Meunier, Frédéric</name>
      </author>
      <author>
        <name>Mustafa, Nabil H</name>
      </author>
    </item>
    <item>
      <title>Klein–Maskit combination theorem for Anosov subgroups: Amalgams</title>
      <link>https://escholarship.org/uc/item/5m15t3g3</link>
      <description>Abstract: 

               The classical Klein–Maskit combination theorems provide sufficient conditions to construct new Kleinian groups using old ones.
There are two distinct but closely related combination theorems: the first deals with amalgamated free products, whereas the second deals with HNN extensions.
This article gives analogs of both combination theorems for Anosov subgroups.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5m15t3g3</guid>
      <pubDate>Wed, 20 Nov 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Dey, Subhadip</name>
      </author>
      <author>
        <name>Kapovich, Michael</name>
        <uri>https://orcid.org/0000-0001-5475-8755</uri>
      </author>
    </item>
    <item>
      <title>From Quasi-Symmetric to Schur Expansions with Applications to Symmetric Chain Decompositions and Plethysm</title>
      <link>https://escholarship.org/uc/item/1b48z46c</link>
      <description>It is an important problem in algebraic combinatorics to deduce the Schur function expansion of a symmetric function whose expansion in terms of the fundamental quasisymmetric function is known. For example, formulas are known for the fundamental expansion of a Macdonald symmetric function and for the plethysm of two Schur functions, while the Schur expansions of these expressions are still elusive. Based on work of Egge, Loehr and Warrington, Garsia and Remmel provided a method to obtain the Schur expansion from the fundamental expansion by replacing each quasisymmetric function by a Schur function (not necessarily indexed by a partition) and using straightening rules to obtain the Schur expansion. Here we provide a new method that only involves the coefficients of the quasisymmetric functions indexed by partitions and the quasi-Kostka matrix. As an application, we identify the lexicographically largest term in the Schur expansion of the plethysm of two Schur functions. We provide...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1b48z46c</guid>
      <pubDate>Wed, 20 Nov 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Orellana, Rosa</name>
      </author>
      <author>
        <name>Saliola, Franco</name>
      </author>
      <author>
        <name>Schilling, Anne</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
      <author>
        <name>Zabrocki, Mike</name>
      </author>
    </item>
    <item>
      <title>Fair Data Representation for Machine Learning at the Pareto Frontier.</title>
      <link>https://escholarship.org/uc/item/67z9r23d</link>
      <description>As machine learning powered decision-making becomes increasingly important in our daily lives, it is imperative to strive for fairness in the underlying data processing. We propose a pre-processing algorithm for fair data representation via which  -objective supervised learning results in estimations of the Pareto frontier between prediction error and statistical disparity. Particularly, the present work applies the optimal affine transport to approach the post-processing Wasserstein barycenter characterization of the optimal fair  -objective supervised learning via a pre-processing data deformation. Furthermore, we show that the Wasserstein geodesics from learning outcome marginals to their barycenter characterizes the Pareto frontier between  -loss and total Wasserstein distance among the marginals. Numerical simulations underscore the advantages: (1) the pre-processing step is compositive with arbitrary conditional expectation estimation supervised learning methods and unseen...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/67z9r23d</guid>
      <pubDate>Wed, 13 Nov 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Xu, Shizhou</name>
      </author>
      <author>
        <name>Strohmer, Thomas</name>
      </author>
    </item>
    <item>
      <title>Complete characterizations of hyperbolic Coxeter groups with Sierpiński curve boundary and with Menger curve boundary</title>
      <link>https://escholarship.org/uc/item/2br289rp</link>
      <description>Complete characterizations of hyperbolic Coxeter groups with Sierpiński curve boundary and with Menger curve boundary</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2br289rp</guid>
      <pubDate>Wed, 23 Oct 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Danielski, Daniel</name>
      </author>
      <author>
        <name>Kapovich, Michael</name>
        <uri>https://orcid.org/0000-0001-5475-8755</uri>
      </author>
      <author>
        <name>Świątkowski, Jacek</name>
      </author>
    </item>
    <item>
      <title>A multiscale predictive digital twin for neurocardiac modulation</title>
      <link>https://escholarship.org/uc/item/4sn2p0kg</link>
      <description>Cardiac function is tightly regulated by the autonomic nervous system (ANS). Activation of the sympathetic nervous system increases cardiac output by increasing heart rate and stroke volume, while parasympathetic nerve stimulation instantly slows heart rate. Importantly, imbalance in autonomic control of the heart has been implicated in the development of arrhythmias and heart failure. Understanding of the mechanisms and effects of autonomic stimulation is a major challenge because synapses in different regions of the heart result in multiple changes to heart function. For example, nerve synapses on the sinoatrial node (SAN) impact pacemaking, while synapses on contractile cells alter contraction and arrhythmia vulnerability. Here, we present a multiscale neurocardiac modelling and simulator tool that predicts the effect of efferent stimulation of the sympathetic and parasympathetic branches of the ANS on the cardiac SAN and ventricular myocardium. The model includes a layered...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4sn2p0kg</guid>
      <pubDate>Mon, 16 Sep 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Yang, Pei‐Chi</name>
        <uri>https://orcid.org/0000-0002-5753-1131</uri>
      </author>
      <author>
        <name>Rose, Adam</name>
      </author>
      <author>
        <name>DeMarco, Kevin R</name>
      </author>
      <author>
        <name>Dawson, John RD</name>
      </author>
      <author>
        <name>Han, Yanxiao</name>
      </author>
      <author>
        <name>Jeng, Mao‐Tsuen</name>
      </author>
      <author>
        <name>Harvey, Robert D</name>
      </author>
      <author>
        <name>Santana, L Fernando</name>
      </author>
      <author>
        <name>Ripplinger, Crystal M</name>
      </author>
      <author>
        <name>Vorobyov, Igor</name>
        <uri>https://orcid.org/0000-0002-4767-5297</uri>
      </author>
      <author>
        <name>Lewis, Timothy J</name>
      </author>
      <author>
        <name>Clancy, Colleen E</name>
      </author>
    </item>
    <item>
      <title>Effect of fluid elasticity on the emergence of oscillations in an active elastic filament</title>
      <link>https://escholarship.org/uc/item/3415f5nh</link>
      <description>Many microorganisms propel themselves through complex media by deforming their flagella. The beat is thought to emerge from interactions between forces of the surrounding fluid, the passive elastic response from deformations of the flagellum and active forces from internal molecular motors. The beat varies in response to changes in the fluid rheology, including elasticity, but there are limited data on how systematic changes in elasticity alter the beat. This work analyses a related problem with fixed-strength driving force: the emergence of beating of an elastic planar filament driven by a follower force at the tip of a viscoelastic fluid. This analysis examines how the onset of oscillations depends on the strength of the force and viscoelastic parameters. Compared to a Newtonian fluid, it takes more force to induce the instability in viscoelastic fluids, and the frequency of the oscillation is higher. The linear analysis predicts that the frequency increases with the fluid relaxation...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3415f5nh</guid>
      <pubDate>Tue, 25 Jun 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Link, Kathryn G</name>
      </author>
      <author>
        <name>Guy, Robert D</name>
        <uri>https://orcid.org/0000-0002-0602-7015</uri>
      </author>
      <author>
        <name>Thomases, Becca</name>
      </author>
      <author>
        <name>Arratia, Paulo E</name>
      </author>
    </item>
    <item>
      <title>Reproducibility of 3D chromatin configuration reconstructions</title>
      <link>https://escholarship.org/uc/item/2f707966</link>
      <description>It is widely recognized that the three-dimensional (3D) architecture of eukaryotic chromatin plays an important role in processes such as gene regulation and cancer-driving gene fusions. Observing or inferring this 3D structure at even modest resolutions had been problematic, since genomes are highly condensed and traditional assays are coarse. However, recently devised high-throughput molecular techniques have changed this situation. Notably, the development of a suite of chromatin conformation capture (CCC) assays has enabled elicitation of contacts-spatially close chromosomal loci-which have provided insights into chromatin architecture. Most analysis of CCC data has focused on the contact level, with less effort directed toward obtaining 3D reconstructions and evaluating the accuracy and reproducibility thereof. While questions of accuracy must be addressed experimentally, questions of reproducibility can be addressed statistically-the purpose of this paper. We use a constrained...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2f707966</guid>
      <pubDate>Mon, 17 Jun 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Segal, Mark R</name>
      </author>
      <author>
        <name>Xiong, Hao</name>
      </author>
      <author>
        <name>Capurso, Daniel</name>
      </author>
      <author>
        <name>Vazquez, Mariel</name>
        <uri>https://orcid.org/0000-0001-8328-6806</uri>
      </author>
      <author>
        <name>Arsuaga, Javier</name>
      </author>
    </item>
    <item>
      <title>The ENIGMA Consortium: large-scale collaborative analyses of neuroimaging and genetic data</title>
      <link>https://escholarship.org/uc/item/2db2p1k7</link>
      <description>The Enhancing NeuroImaging Genetics through Meta-Analysis (ENIGMA) Consortium is a collaborative network of researchers working together on a range of large-scale studies that integrate data from 70 institutions worldwide. Organized into Working Groups that tackle questions in neuroscience, genetics, and medicine, ENIGMA studies have analyzed neuroimaging data from over 12,826 subjects. In addition, data from 12,171 individuals were provided by the CHARGE consortium for replication of findings, in a total of 24,997 subjects. By meta-analyzing results from many sites, ENIGMA has detected factors that affect the brain that no individual site could detect on its own, and that require larger numbers of subjects than any individual neuroimaging study has currently collected. ENIGMA’s first project was a genome-wide association study identifying common variants in the genome associated with hippocampal volume or intracranial volume. Continuing work is exploring genetic associations...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2db2p1k7</guid>
      <pubDate>Sun, 16 Jun 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Thompson, Paul M</name>
      </author>
      <author>
        <name>Stein, Jason L</name>
      </author>
      <author>
        <name>Medland, Sarah E</name>
      </author>
      <author>
        <name>Hibar, Derrek P</name>
      </author>
      <author>
        <name>Vasquez, Alejandro Arias</name>
      </author>
      <author>
        <name>Renteria, Miguel E</name>
      </author>
      <author>
        <name>Toro, Roberto</name>
      </author>
      <author>
        <name>Jahanshad, Neda</name>
      </author>
      <author>
        <name>Schumann, Gunter</name>
      </author>
      <author>
        <name>Franke, Barbara</name>
      </author>
      <author>
        <name>Wright, Margaret J</name>
      </author>
      <author>
        <name>Martin, Nicholas G</name>
      </author>
      <author>
        <name>Agartz, Ingrid</name>
      </author>
      <author>
        <name>Alda, Martin</name>
      </author>
      <author>
        <name>Alhusaini, Saud</name>
      </author>
      <author>
        <name>Almasy, Laura</name>
      </author>
      <author>
        <name>Almeida, Jorge</name>
      </author>
      <author>
        <name>Alpert, Kathryn</name>
      </author>
      <author>
        <name>Andreasen, Nancy C</name>
      </author>
      <author>
        <name>Andreassen, Ole A</name>
      </author>
      <author>
        <name>Apostolova, Liana G</name>
      </author>
      <author>
        <name>Appel, Katja</name>
      </author>
      <author>
        <name>Armstrong, Nicola J</name>
      </author>
      <author>
        <name>Aribisala, Benjamin</name>
      </author>
      <author>
        <name>Bastin, Mark E</name>
      </author>
      <author>
        <name>Bauer, Michael</name>
      </author>
      <author>
        <name>Bearden, Carrie E</name>
      </author>
      <author>
        <name>Bergmann, Ørjan</name>
      </author>
      <author>
        <name>Binder, Elisabeth B</name>
      </author>
      <author>
        <name>Blangero, John</name>
      </author>
      <author>
        <name>Bockholt, Henry J</name>
      </author>
      <author>
        <name>Bøen, Erlend</name>
      </author>
      <author>
        <name>Bois, Catherine</name>
      </author>
      <author>
        <name>Boomsma, Dorret I</name>
      </author>
      <author>
        <name>Booth, Tom</name>
      </author>
      <author>
        <name>Bowman, Ian J</name>
      </author>
      <author>
        <name>Bralten, Janita</name>
      </author>
      <author>
        <name>Brouwer, Rachel M</name>
      </author>
      <author>
        <name>Brunner, Han G</name>
      </author>
      <author>
        <name>Brohawn, David G</name>
      </author>
      <author>
        <name>Buckner, Randy L</name>
      </author>
      <author>
        <name>Buitelaar, Jan</name>
      </author>
      <author>
        <name>Bulayeva, Kazima</name>
      </author>
      <author>
        <name>Bustillo, Juan R</name>
      </author>
      <author>
        <name>Calhoun, Vince D</name>
      </author>
      <author>
        <name>Cannon, Dara M</name>
      </author>
      <author>
        <name>Cantor, Rita M</name>
      </author>
      <author>
        <name>Carless, Melanie A</name>
      </author>
      <author>
        <name>Caseras, Xavier</name>
      </author>
      <author>
        <name>Cavalleri, Gianpiero L</name>
      </author>
      <author>
        <name>Chakravarty, M Mallar</name>
      </author>
      <author>
        <name>Chang, Kiki D</name>
      </author>
      <author>
        <name>Ching, Christopher RK</name>
      </author>
      <author>
        <name>Christoforou, Andrea</name>
      </author>
      <author>
        <name>Cichon, Sven</name>
      </author>
      <author>
        <name>Clark, Vincent P</name>
      </author>
      <author>
        <name>Conrod, Patricia</name>
      </author>
      <author>
        <name>Coppola, Giovanni</name>
        <uri>https://orcid.org/0000-0003-2105-1061</uri>
      </author>
      <author>
        <name>Crespo-Facorro, Benedicto</name>
      </author>
      <author>
        <name>Curran, Joanne E</name>
      </author>
      <author>
        <name>Czisch, Michael</name>
      </author>
      <author>
        <name>Deary, Ian J</name>
      </author>
      <author>
        <name>de Geus, Eco JC</name>
      </author>
      <author>
        <name>den Braber, Anouk</name>
      </author>
      <author>
        <name>Delvecchio, Giuseppe</name>
      </author>
      <author>
        <name>Depondt, Chantal</name>
      </author>
      <author>
        <name>de Haan, Lieuwe</name>
      </author>
      <author>
        <name>de Zubicaray, Greig I</name>
      </author>
      <author>
        <name>Dima, Danai</name>
      </author>
      <author>
        <name>Dimitrova, Rali</name>
      </author>
      <author>
        <name>Djurovic, Srdjan</name>
      </author>
      <author>
        <name>Dong, Hongwei</name>
      </author>
      <author>
        <name>Donohoe, Gary</name>
      </author>
      <author>
        <name>Duggirala, Ravindranath</name>
      </author>
      <author>
        <name>Dyer, Thomas D</name>
      </author>
      <author>
        <name>Ehrlich, Stefan</name>
      </author>
      <author>
        <name>Ekman, Carl Johan</name>
      </author>
      <author>
        <name>Elvsåshagen, Torbjørn</name>
      </author>
      <author>
        <name>Emsell, Louise</name>
      </author>
      <author>
        <name>Erk, Susanne</name>
      </author>
      <author>
        <name>Espeseth, Thomas</name>
      </author>
      <author>
        <name>Fagerness, Jesen</name>
      </author>
      <author>
        <name>Fears, Scott</name>
      </author>
      <author>
        <name>Fedko, Iryna</name>
      </author>
      <author>
        <name>Fernández, Guillén</name>
      </author>
      <author>
        <name>Fisher, Simon E</name>
      </author>
      <author>
        <name>Foroud, Tatiana</name>
      </author>
      <author>
        <name>Fox, Peter T</name>
      </author>
      <author>
        <name>Francks, Clyde</name>
      </author>
      <author>
        <name>Frangou, Sophia</name>
      </author>
      <author>
        <name>Frey, Eva Maria</name>
      </author>
      <author>
        <name>Frodl, Thomas</name>
      </author>
      <author>
        <name>Frouin, Vincent</name>
      </author>
      <author>
        <name>Garavan, Hugh</name>
      </author>
      <author>
        <name>Giddaluru, Sudheer</name>
      </author>
      <author>
        <name>Glahn, David C</name>
      </author>
      <author>
        <name>Godlewska, Beata</name>
      </author>
      <author>
        <name>Goldstein, Rita Z</name>
      </author>
      <author>
        <name>Gollub, Randy L</name>
      </author>
      <author>
        <name>Grabe, Hans J</name>
      </author>
    </item>
    <item>
      <title>Private measures, random walks, and synthetic data</title>
      <link>https://escholarship.org/uc/item/6k09x9vf</link>
      <description>Differential privacy is a mathematical concept that provides an information-theoretic security guarantee. While differential privacy has emerged as a de facto standard for guaranteeing privacy in data sharing, the known mechanisms to achieve it come with some serious limitations. Utility guarantees are usually provided only for a fixed, a priori specified set of queries. Moreover, there are no utility guarantees for more complex—but very common—machine learning tasks such as clustering or classification. In this paper we overcome some of these limitations. Working with metric privacy, a powerful generalization of differential privacy, we develop a polynomial-time algorithm that creates a private measure from a data set. This private measure allows us to efficiently construct private synthetic data that are accurate for a wide range of statistical analysis tools. Moreover, we prove an asymptotically sharp min-max result for private measures and synthetic data in general compact...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6k09x9vf</guid>
      <pubDate>Wed, 12 Jun 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Boedihardjo, March</name>
      </author>
      <author>
        <name>Strohmer, Thomas</name>
      </author>
      <author>
        <name>Vershynin, Roman</name>
      </author>
    </item>
    <item>
      <title>Early career Latinas in STEM: Challenges and solutions</title>
      <link>https://escholarship.org/uc/item/3rm3m38c</link>
      <description>Mexican, Puerto Rican, and Central American Ancestry (MPRCA) individuals represent 82% of US Latinos. An intergenerational group of MPRCA women and allies met to discuss persistent underrepresentation of MPRCA women in STEM, identifying multi-level challenges and solutions. Implementation of these solutions is important and will benefit MPRCA women and the entire academic community.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3rm3m38c</guid>
      <pubDate>Thu, 9 May 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Werner Washburne, Maggie</name>
      </author>
      <author>
        <name>Trejo, JoAnn</name>
        <uri>https://orcid.org/0000-0003-4405-6228</uri>
      </author>
      <author>
        <name>Zambrana, Ruth Enid</name>
      </author>
      <author>
        <name>Zavala, Maria Elena</name>
      </author>
      <author>
        <name>Martinic, Alice</name>
      </author>
      <author>
        <name>Riestra, Angelica</name>
      </author>
      <author>
        <name>Delgado, Tracie</name>
      </author>
      <author>
        <name>Edwards, Staci</name>
      </author>
      <author>
        <name>Escobar, Thelma</name>
      </author>
      <author>
        <name>Jamison-McClung, Denneal</name>
      </author>
      <author>
        <name>Vazquez, Mariel</name>
        <uri>https://orcid.org/0000-0001-8328-6806</uri>
      </author>
      <author>
        <name>Vera, Iset</name>
      </author>
      <author>
        <name>Guerra, Michelle</name>
      </author>
      <author>
        <name>Marinez, Diana I</name>
      </author>
      <author>
        <name>Gonzalez, Elma</name>
      </author>
      <author>
        <name>Rodriguez, Raymond L</name>
        <uri>https://orcid.org/0000-0002-6105-2571</uri>
      </author>
    </item>
    <item>
      <title>Multiscale transforms for signals on simplicial complexes</title>
      <link>https://escholarship.org/uc/item/1vw4k87g</link>
      <description>Our previous multiscale graph basis dictionaries/graph signal transforms—Generalized Haar-Walsh Transform (GHWT); Hierarchical Graph Laplacian Eigen Transform (HGLET); Natural Graph Wavelet Packets (NGWPs); and their relatives—were developed for analyzing data recorded on vertices of a given graph. In this article, we propose their generalization for analyzing data recorded on edges, faces (i.e., triangles), or more generally κ$$\kappa $$-dimensional simplices of a simplicial complex (e.g., a triangle mesh of a manifold). The key idea is to use the Hodge Laplacians and their variants for hierarchical partitioning of a set of κ$$\kappa $$-dimensional simplices in a given simplicial complex, and then build localized basis functions on these partitioned subsets. We demonstrate their usefulness for data representation on both illustrative synthetic examples and real-world simplicial complexes generated from a co-authorship/citation dataset and an ocean current/flow dataset.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1vw4k87g</guid>
      <pubDate>Wed, 8 May 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Saito, Naoki</name>
        <uri>https://orcid.org/0000-0001-5234-4719</uri>
      </author>
      <author>
        <name>Schonsheck, Stefan C</name>
      </author>
      <author>
        <name>Shvarts, Eugene</name>
      </author>
    </item>
    <item>
      <title>Modeling time-varying phytoplankton subsidy reveals at-risk species in a Chilean intertidal ecosystem</title>
      <link>https://escholarship.org/uc/item/7hg208q7</link>
      <description>The allometric trophic network (ATN) framework for modeling population dynamics has provided numerous insights into ecosystem functioning in recent years. Herein we extend ATN modeling of the intertidal ecosystem off central Chile to include empirical data on pelagic chlorophyll-a concentration. This intertidal community requires subsidy of primary productivity to support its rich ecosystem. Previous work models this subsidy using a constant rate of phytoplankton input to the system. However, data shows pelagic subsidies exhibit highly variable, pulse-like behavior. The primary contribution of our work is incorporating this variable input into ATN modeling to simulate how this ecosystem may respond to pulses of pelagic phytoplankton. Our model results show that: (1) closely related sea snails respond differently to phytoplankton variability, which is explained by the underlying network structure of the food web; (2) increasing the rate of pelagic-intertidal mixing increases fluctuations...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7hg208q7</guid>
      <pubDate>Mon, 1 Apr 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Duckwall, Casey</name>
      </author>
      <author>
        <name>Largier, John L</name>
        <uri>https://orcid.org/0000-0003-4273-4443</uri>
      </author>
      <author>
        <name>Wieters, Evie A</name>
      </author>
      <author>
        <name>Valdovinos, Fernanda S</name>
      </author>
    </item>
    <item>
      <title>A computational model predicts sex-specific responses to calcium channel blockers in mammalian mesenteric vascular smooth muscle</title>
      <link>https://escholarship.org/uc/item/8x36h534</link>
      <description>The function of the smooth muscle cells lining the walls of mammalian systemic arteries and arterioles is to regulate the diameter of the vessels to control blood flow and blood pressure. Here, we describe an in silico model, which we call the 'Hernandez-Hernandez model', of electrical and Ca&lt;sup&gt;2+&lt;/sup&gt; signaling in arterial myocytes based on new experimental data indicating sex-specific differences in male and female arterial myocytes from murine resistance arteries. The model suggests the fundamental ionic mechanisms underlying membrane potential and intracellular Ca&lt;sup&gt;2+&lt;/sup&gt; signaling during the development of myogenic tone in arterial blood vessels. Although experimental data suggest that K&lt;sub&gt;V&lt;/sub&gt;1.5 channel currents have similar amplitudes, kinetics, and voltage dependencies in male and female myocytes, simulations suggest that the K&lt;sub&gt;V&lt;/sub&gt;1.5 current is the dominant current regulating membrane potential in male myocytes. In female cells, which have larger...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8x36h534</guid>
      <pubDate>Tue, 26 Mar 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Hernandez-Hernandez, Gonzalo</name>
      </author>
      <author>
        <name>O'Dwyer, Samantha C</name>
      </author>
      <author>
        <name>Yang, Pei-Chi</name>
        <uri>https://orcid.org/0000-0002-5753-1131</uri>
      </author>
      <author>
        <name>Matsumoto, Collin</name>
      </author>
      <author>
        <name>Tieu, Mindy</name>
      </author>
      <author>
        <name>Fong, Zhihui</name>
      </author>
      <author>
        <name>Lewis, Timothy J</name>
      </author>
      <author>
        <name>Santana, L Fernando</name>
      </author>
      <author>
        <name>Clancy, Colleen E</name>
      </author>
    </item>
    <item>
      <title>PrestoCell: A persistence-based clustering approach for rapid and robust segmentation of cellular morphology in three-dimensional data</title>
      <link>https://escholarship.org/uc/item/1qs1c3nk</link>
      <description>Light microscopy methods have continued to advance allowing for unprecedented analysis of various cell types in tissues including the brain. Although the functional state of some cell types such as microglia can be determined by morphometric analysis, techniques to perform robust, quick, and accurate measurements have not kept pace with the amount of imaging data that can now be generated. Most of these image segmentation tools are further burdened by an inability to assess structures in three-dimensions. Despite the rise of machine learning techniques, the nature of some biological structures prevents the training of several current day implementations. Here we present PrestoCell, a novel use of persistence-based clustering to segment cells in light microscopy images, as a customized Python-based tool that leverages the free multidimensional image viewer Napari. In evaluating and comparing PrestoCell to several existing tools, including 3DMorph, Omipose, and Imaris, we demonstrate...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1qs1c3nk</guid>
      <pubDate>Tue, 12 Mar 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Wu, Yue</name>
      </author>
      <author>
        <name>Brust-Mascher, Ingrid</name>
        <uri>https://orcid.org/0000-0001-7733-4410</uri>
      </author>
      <author>
        <name>Gareau, Melanie G</name>
        <uri>https://orcid.org/0000-0001-6008-6975</uri>
      </author>
      <author>
        <name>De Loera, Jesus A</name>
        <uri>https://orcid.org/0000-0002-9556-1112</uri>
      </author>
      <author>
        <name>Reardon, Colin</name>
        <uri>https://orcid.org/0000-0003-2204-8091</uri>
      </author>
    </item>
    <item>
      <title>Transitions between Distinct Compaction Regimes in Complexes of Multivalent Cationic Lipids and DNA</title>
      <link>https://escholarship.org/uc/item/88p5f00z</link>
      <description>Cationic lipids (CLs) have found widespread use as nonviral gene carriers (vectors), including applications in clinical trials of gene therapy. However, their observed transfection efficiencies (TEs) are inferior to those of viral vectors, providing a strong incentive for a detailed understanding of CL-DNA complex behavior. In recent systematic studies employing monovalent as well as newly synthesized multivalent lipids (MVLs), the membrane cationic charge density has been identified as a key parameter governing the TE of lamellar CL-DNA complexes. In this work, we use x-ray scattering and molecular simulations to investigate the structural properties of complexes containing MVLs. At low mole fraction of neutral lipids (NLs), Phi(NL), the complexes show dramatic DNA compaction, down to essentially close-packed DNA arrays with a DNA interaxial spacing d(DNA) = 25 A. A gradual increase in Phi(NL) does not lead to a continuous increase in d(DNA) as observed for DNA complexes of monovalent...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/88p5f00z</guid>
      <pubDate>Mon, 4 Mar 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Farago, Oded</name>
      </author>
      <author>
        <name>Ewert, Kai</name>
        <uri>https://orcid.org/0000-0002-4861-8278</uri>
      </author>
      <author>
        <name>Ahmad, Ayesha</name>
      </author>
      <author>
        <name>Evans, Heather M</name>
      </author>
      <author>
        <name>Grønbech-Jensen, Niels</name>
      </author>
      <author>
        <name>Safinya, Cyrus R</name>
      </author>
    </item>
    <item>
      <title>Tracking Mechanical Stress and Cell Migration with Inexpensive Polymer Thin‐Film Sensors</title>
      <link>https://escholarship.org/uc/item/1n09z7cb</link>
      <description>Polydiacetylene (PDA) Langmuir films are well known for their blue to red chromatic transitions in response to a variety of stimuli, including UV light, heat, bio-molecule bindings and mechanical stress. In this work, we detail the ability to tune PDA Langmuir films to exhibit discrete chromatic transitions in response to applied mechanical stress. Normal and shear-induced transitions were quantified using the Surface Forces Apparatus and established to be binary and tunable as a function of film formation conditions. Both monomer alkyl tail length and metal cations were used to manipulate the chromatic transition force threshold to enable discrete force sensing from ~50 to ~500 nN μm&lt;sup&gt;-2&lt;/sup&gt; for normal loading and ~2 to ~40 nN μm&lt;sup&gt;-2&lt;/sup&gt; for shear-induced transitions, which are appropriate for biological cells. The utility of PDA thin-film sensors was demonstrated with the slime mold &lt;i&gt;Physarum polycephalum&lt;/i&gt;. The fluorescence readout of the films enabled: the area...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1n09z7cb</guid>
      <pubDate>Wed, 24 Jan 2024 00:00:00 +0000</pubDate>
      <author>
        <name>Finney, Tanner J</name>
      </author>
      <author>
        <name>Frank, Skye L</name>
      </author>
      <author>
        <name>Bull, Michael R</name>
      </author>
      <author>
        <name>Guy, Robert D</name>
        <uri>https://orcid.org/0000-0002-0602-7015</uri>
      </author>
      <author>
        <name>Kuhl, Tonya L</name>
        <uri>https://orcid.org/0000-0002-6069-0205</uri>
      </author>
    </item>
    <item>
      <title>On Viazovska’s modular form inequalities</title>
      <link>https://escholarship.org/uc/item/34g5h9zs</link>
      <description>Viazovska proved that the [Formula: see text] lattice sphere packing is the densest sphere packing in [Formula: see text] dimensions. Her proof relies on two inequalities between functions defined in terms of modular and quasimodular forms. We give a direct proof of these inequalities that does not rely on computer calculations.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/34g5h9zs</guid>
      <pubDate>Wed, 15 Nov 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Romik, Dan</name>
      </author>
    </item>
    <item>
      <title>Common population codes produce extremely nonlinear neural manifolds</title>
      <link>https://escholarship.org/uc/item/7vt037gp</link>
      <description>Populations of neurons represent sensory, motor, and cognitive variables via patterns of activity distributed across the population. The size of the population used to encode a variable is typically much greater than the dimension of the variable itself, and thus, the corresponding neural population activity occupies lower-dimensional subsets of the full set of possible activity states. Given population activity data with such lower-dimensional structure, a fundamental question asks how close the low-dimensional data lie to a linear subspace. The linearity or nonlinearity of the low-dimensional structure reflects important computational features of the encoding, such as robustness and generalizability. Moreover, identifying such linear structure underlies common data analysis methods such as Principal Component Analysis (PCA). Here, we show that for data drawn from many common population codes the resulting point clouds and manifolds are exceedingly nonlinear, with the dimension...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7vt037gp</guid>
      <pubDate>Wed, 4 Oct 2023 00:00:00 +0000</pubDate>
      <author>
        <name>De, Anandita</name>
      </author>
      <author>
        <name>Chaudhuri, Rishidev</name>
        <uri>https://orcid.org/0000-0003-2301-3261</uri>
      </author>
    </item>
    <item>
      <title>Using machine learning to detect coronaviruses potentially infectious to humans</title>
      <link>https://escholarship.org/uc/item/5x3516hh</link>
      <description>Establishing the host range for novel viruses remains a challenge. Here, we address the challenge of identifying non-human animal coronaviruses that may infect humans by creating an artificial neural network model that learns from spike protein sequences of alpha and beta coronaviruses and their binding annotation to their host receptor. The proposed method produces a human-Binding Potential (h-BiP) score that distinguishes, with high accuracy, the binding potential among coronaviruses. Three viruses, previously unknown to bind human receptors, were identified: Bat coronavirus BtCoV/133/2005 and Pipistrellus abramus bat coronavirus HKU5-related (both MERS related viruses), and Rhinolophus affinis coronavirus isolate LYRa3 (a SARS related virus). We further analyze the binding properties of BtCoV/133/2005 and LYRa3 using molecular dynamics. To test whether this model can be used for surveillance of novel coronaviruses, we re-trained the model on a set that excludes SARS-CoV-2 and...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5x3516hh</guid>
      <pubDate>Tue, 18 Jul 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Gonzalez-Isunza, Georgina</name>
      </author>
      <author>
        <name>Jawaid, M Zaki</name>
      </author>
      <author>
        <name>Liu, Pengyu</name>
      </author>
      <author>
        <name>Cox, Daniel L</name>
      </author>
      <author>
        <name>Vazquez, Mariel</name>
        <uri>https://orcid.org/0000-0001-8328-6806</uri>
      </author>
      <author>
        <name>Arsuaga, Javier</name>
      </author>
    </item>
    <item>
      <title>A Note on Cumulant Technique in Random Matrix Theory</title>
      <link>https://escholarship.org/uc/item/1888k21h</link>
      <description>We discuss the cumulant approach to spectral properties of large random matrices. In particular, we study in detail the joint cumulants of high traces of large unitary random matrices and prove Gaussian fluctuation for pair-counting statistics with non-smooth test functions.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1888k21h</guid>
      <pubDate>Tue, 18 Jul 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Soshnikov, Alexander</name>
      </author>
      <author>
        <name>Wu, Chutong</name>
      </author>
    </item>
    <item>
      <title>SPARCoC: A New Framework for Molecular Pattern Discovery and Cancer Gene Identification</title>
      <link>https://escholarship.org/uc/item/8fd81054</link>
      <description>It is challenging to cluster cancer patients of a certain histopathological type into molecular subtypes of clinical importance and identify gene signatures directly relevant to the subtypes. Current clustering approaches have inherent limitations, which prevent them from gauging the subtle heterogeneity of the molecular subtypes. In this paper we present a new framework: SPARCoC (Sparse-CoClust), which is based on a novel Common-background and Sparse-foreground Decomposition (CSD) model and the Maximum Block Improvement (MBI) co-clustering technique. SPARCoC has clear advantages compared with widely-used alternative approaches: hierarchical clustering (Hclust) and nonnegative matrix factorization (NMF). We apply SPARCoC to the study of lung adenocarcinoma (ADCA), an extremely heterogeneous histological type, and a significant challenge for molecular subtyping. For testing and verification, we use high quality gene expression profiling data of lung ADCA patients, and identify...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8fd81054</guid>
      <pubDate>Thu, 13 Jul 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Ma, Shiqian</name>
        <uri>https://orcid.org/0000-0003-1967-1069</uri>
      </author>
      <author>
        <name>Johnson, Daniel</name>
      </author>
      <author>
        <name>Ashby, Cody</name>
      </author>
      <author>
        <name>Xiong, Donghai</name>
      </author>
      <author>
        <name>Cramer, Carole L</name>
      </author>
      <author>
        <name>Moore, Jason H</name>
      </author>
      <author>
        <name>Zhang, Shuzhong</name>
      </author>
      <author>
        <name>Huang, Xiuzhen</name>
      </author>
    </item>
    <item>
      <title>SparRec: An effective matrix completion framework of missing data imputation for GWAS</title>
      <link>https://escholarship.org/uc/item/84p05992</link>
      <description>Genome-wide association studies present computational challenges for missing data imputation, while the advances of genotype technologies are generating datasets of large sample sizes with sample sets genotyped on multiple SNP chips. We present a new framework SparRec (Sparse Recovery) for imputation, with the following properties: (1) The optimization models of SparRec, based on low-rank and low number of co-clusters of matrices, are different from current statistics methods. While our low-rank matrix completion (LRMC) model is similar to Mendel-Impute, our matrix co-clustering factorization (MCCF) model is completely new. (2) SparRec, as other matrix completion methods, is flexible to be applied to missing data imputation for large meta-analysis with different cohorts genotyped on different sets of SNPs, even when there is no reference panel. This kind of meta-analysis is very challenging for current statistics based methods. (3) SparRec has consistent performance and achieves...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/84p05992</guid>
      <pubDate>Thu, 13 Jul 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Jiang, Bo</name>
      </author>
      <author>
        <name>Ma, Shiqian</name>
        <uri>https://orcid.org/0000-0003-1967-1069</uri>
      </author>
      <author>
        <name>Causey, Jason</name>
      </author>
      <author>
        <name>Qiao, Linbo</name>
      </author>
      <author>
        <name>Hardin, Matthew Price</name>
      </author>
      <author>
        <name>Bitts, Ian</name>
      </author>
      <author>
        <name>Johnson, Daniel</name>
      </author>
      <author>
        <name>Zhang, Shuzhong</name>
      </author>
      <author>
        <name>Huang, Xiuzhen</name>
      </author>
    </item>
    <item>
      <title>Scratch-AID, a deep learning-based system for automatic detection of mouse scratching behavior with high accuracy</title>
      <link>https://escholarship.org/uc/item/6511p95j</link>
      <description>Mice are the most commonly used model animals for itch research and for development of anti-itch drugs. Most laboratories manually quantify mouse scratching behavior to assess itch intensity. This process is labor-intensive and limits large-scale genetic or drug screenings. In this study, we developed a new system, Scratch-AID (&lt;b&gt;A&lt;/b&gt;utomatic &lt;b&gt;I&lt;/b&gt;tch &lt;b&gt;D&lt;/b&gt;etection), which could automatically identify and quantify mouse scratching behavior with high accuracy. Our system included a custom-designed videotaping box to ensure high-quality and replicable mouse behavior recording and a convolutional recurrent neural network trained with frame-labeled mouse scratching behavior videos, induced by nape injection of chloroquine. The best trained network achieved 97.6% recall and 96.9% precision on previously unseen test videos. Remarkably, Scratch-AID could reliably identify scratching behavior in other major mouse itch models, including the acute cheek model, the histaminergic...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6511p95j</guid>
      <pubDate>Sat, 8 Jul 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Yu, Huasheng</name>
      </author>
      <author>
        <name>Xiong, Jingwei</name>
      </author>
      <author>
        <name>Ye, Adam Yongxin</name>
      </author>
      <author>
        <name>Cranfill, Suna Li</name>
      </author>
      <author>
        <name>Cannonier, Tariq</name>
      </author>
      <author>
        <name>Gautam, Mayank</name>
      </author>
      <author>
        <name>Zhang, Marina</name>
      </author>
      <author>
        <name>Bilal, Rayan</name>
      </author>
      <author>
        <name>Park, Jong-Eun</name>
      </author>
      <author>
        <name>Xue, Yuji</name>
      </author>
      <author>
        <name>Polam, Vidhur</name>
      </author>
      <author>
        <name>Vujovic, Zora</name>
      </author>
      <author>
        <name>Dai, Daniel</name>
      </author>
      <author>
        <name>Ong, William</name>
      </author>
      <author>
        <name>Ip, Jasper</name>
      </author>
      <author>
        <name>Hsieh, Amanda</name>
      </author>
      <author>
        <name>Mimouni, Nour</name>
      </author>
      <author>
        <name>Lozada, Alejandra</name>
      </author>
      <author>
        <name>Sosale, Medhini</name>
      </author>
      <author>
        <name>Ahn, Alex</name>
      </author>
      <author>
        <name>Ma, Minghong</name>
      </author>
      <author>
        <name>Ding, Long</name>
      </author>
      <author>
        <name>Arsuaga, Javier</name>
      </author>
      <author>
        <name>Luo, Wenqin</name>
      </author>
    </item>
    <item>
      <title>TAaCGH Suite for Detecting Cancer—Specific Copy Number Changes Using Topological Signatures</title>
      <link>https://escholarship.org/uc/item/5hx0g9vd</link>
      <description>Copy number changes play an important role in the development of cancer and are commonly associated with changes in gene expression. Persistence curves, such as Betti curves, have been used to detect copy number changes; however, it is known these curves are unstable with respect to small perturbations in the data. We address the stability of lifespan and Betti curves by providing bounds on the distance between persistence curves of Vietoris-Rips filtrations built on data and slightly perturbed data in terms of the bottleneck distance. Next, we perform simulations to compare the predictive ability of Betti curves, lifespan curves (conditionally stable) and stable persistent landscapes to detect copy number aberrations. We use these methods to identify significant chromosome regions associated with the four major molecular subtypes of breast cancer: Luminal A, Luminal B, Basal and HER2 positive. Identified segments are then used as predictor variables to build machine learning...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5hx0g9vd</guid>
      <pubDate>Mon, 3 Jul 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Aslam, Jai</name>
      </author>
      <author>
        <name>Ardanza-Trevijano, Sergio</name>
      </author>
      <author>
        <name>Xiong, Jingwei</name>
      </author>
      <author>
        <name>Arsuaga, Javier</name>
      </author>
      <author>
        <name>Sazdanovic, Radmila</name>
      </author>
    </item>
    <item>
      <title>Use of machine-learning algorithms to aid in the early detection of leptospirosis in dogs</title>
      <link>https://escholarship.org/uc/item/0481k543</link>
      <description>Leptospirosis is a life-threatening, zoonotic disease with various clinical presentations, including renal injury, hepatic injury, pancreatitis, and pulmonary hemorrhage. With prompt recognition of the disease and treatment, 90% of infected dogs have a positive outcome. Therefore, rapid, early diagnosis of leptospirosis is crucial. Testing for &lt;i&gt;Leptospira&lt;/i&gt;-specific serum antibodies using the microscopic agglutination test (MAT) lacks sensitivity early in the disease process, and diagnosis can take &amp;gt;2 wk because of the need to demonstrate a rise in titer. We applied machine-learning algorithms to clinical variables from the first day of hospitalization to create machine-learning prediction models (MLMs). The models incorporated patient signalment, clinicopathologic data (CBC, serum chemistry profile, and urinalysis = blood work [BW] model), with or without a MAT titer obtained at patient intake (=BW + MAT model). The models were trained with data from 91 dogs with confirmed...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0481k543</guid>
      <pubDate>Fri, 30 Jun 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Reagan, Krystle L</name>
        <uri>https://orcid.org/0000-0003-3426-6352</uri>
      </author>
      <author>
        <name>Deng, Shaofeng</name>
      </author>
      <author>
        <name>Sheng, Junda</name>
      </author>
      <author>
        <name>Sebastian, Jamie</name>
      </author>
      <author>
        <name>Wang, Zhe</name>
      </author>
      <author>
        <name>Huebner, Sara N</name>
      </author>
      <author>
        <name>Wenke, Louise A</name>
      </author>
      <author>
        <name>Michalak, Sarah R</name>
      </author>
      <author>
        <name>Strohmer, Thomas</name>
      </author>
      <author>
        <name>Sykes, Jane E</name>
        <uri>https://orcid.org/0000-0002-6814-9835</uri>
      </author>
    </item>
    <item>
      <title>Vaping discussion in the COVID-19 pandemic: An observational study using Twitter data</title>
      <link>https://escholarship.org/uc/item/54m060th</link>
      <description>BACKGROUND: With the spread of COVID-19, significant concerns have been raised about the potential increased risk for electronic cigarette (e-cigarette) users for COVID-19 infection and related syndromes. Social media is an increasingly popular source for health information dissemination and discussion, and can affect health outcomes.
OBJECTIVE: This study aims to identify the topics in the public vaping discussion in COVID-19-related Twitter posts in order to get insight into public vaping-related perceptions, attitudes and concerns, and to discern possible misinformation and misconceptions around vaping in the COVID-19 pandemic.
METHODS: Using the tweets ID database maintained by Georgia State University's Panacea Lab, we downloaded the tweets related to COVID-19 from March 11, 2020, when the World Health Organization declared COVID-19 a pandemic, to February 12, 2021. We used R to analyze the tweets that contained a list of 79 keywords related to vaping. After removing duplicates...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/54m060th</guid>
      <pubDate>Tue, 27 Jun 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Lyu, Joanne Chen</name>
      </author>
      <author>
        <name>Luli, Garving K</name>
        <uri>https://orcid.org/0000-0002-9630-1750</uri>
      </author>
      <author>
        <name>Ling, Pamela M</name>
        <uri>https://orcid.org/0000-0001-6166-9347</uri>
      </author>
    </item>
    <item>
      <title>Ion-dependent DNA configuration in bacteriophage capsids</title>
      <link>https://escholarship.org/uc/item/5kz0w6hh</link>
      <description>Bacteriophages densely pack their long double-stranded DNA genome inside a protein capsid. The conformation of the viral genome inside the capsid is consistent with a hexagonal liquid crystalline structure. Experiments have confirmed that the details of the hexagonal packing depend on the electrochemistry of the capsid and its environment. In this work, we propose a biophysical model that quantifies the relationship between DNA configurations inside bacteriophage capsids and the types and concentrations of ions present in a biological system. We introduce an expression for the free energy that combines the electrostatic energy with contributions from bending of individual segments of DNA and Lennard-Jones-type interactions between these segments. The equilibrium points of this energy solve a partial differential equation that defines the distributions of DNA and the ions inside the capsid. We develop a computational approach that allows us to simulate much larger systems&amp;nbsp;than...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5kz0w6hh</guid>
      <pubDate>Fri, 23 Jun 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Liu, Pei</name>
      </author>
      <author>
        <name>Arsuaga, Javier</name>
      </author>
      <author>
        <name>Calderer, M Carme</name>
      </author>
      <author>
        <name>Golovaty, Dmitry</name>
      </author>
      <author>
        <name>Vazquez, Mariel</name>
        <uri>https://orcid.org/0000-0001-8328-6806</uri>
      </author>
      <author>
        <name>Walker, Shawn</name>
      </author>
    </item>
    <item>
      <title>Rate-dependent effects of lidocaine on cardiac dynamics: Development and analysis of a low-dimensional drug-channel interaction model</title>
      <link>https://escholarship.org/uc/item/62r8g6w6</link>
      <description>State-dependent sodium channel blockers are often prescribed to treat cardiac arrhythmias, but many sodium channel blockers are known to have pro-arrhythmic side effects. While the anti and proarrhythmic potential of a sodium channel blocker is thought to depend on the characteristics of its rate-dependent block, the mechanisms linking these two attributes are unclear. Furthermore, how specific properties of rate-dependent block arise from the binding kinetics of a particular drug is poorly understood. Here, we examine the rate-dependent effects of the sodium channel blocker lidocaine by constructing and analyzing a novel drug-channel interaction model. First, we identify the predominant mode of lidocaine binding in a 24 variable Markov model for lidocaine-sodium channel interaction by Moreno et al. Specifically, we find that (1) the vast majority of lidocaine bound to sodium channels is in the neutral form, i.e., the binding of charged lidocaine to sodium channels is negligible,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/62r8g6w6</guid>
      <pubDate>Thu, 22 Jun 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Docken, Steffen S</name>
      </author>
      <author>
        <name>Clancy, Colleen E</name>
      </author>
      <author>
        <name>Lewis, Timothy J</name>
      </author>
    </item>
    <item>
      <title>Dynamics of adrenergic signaling in cardiac myocytes and implications for pharmacological treatment</title>
      <link>https://escholarship.org/uc/item/6zw6x3vt</link>
      <description>Dense innervation of the heart by the sympathetic nervous system (SNS) allows cardiac output to respond appropriately to the needs of the body under varying conditions, but occasionally the abrupt onset of SNS activity can trigger cardiac arrhythmias. Sympathetic activity leads to the release of norepinephrine (NE) onto cardiomyocytes, activating β&lt;sub&gt;1&lt;/sub&gt;-adrenergic receptors (β&lt;sub&gt;1&lt;/sub&gt;-ARs) and leading to the production of the second messenger cyclic AMP (cAMP). Upon sudden activation of β&lt;sub&gt;1&lt;/sub&gt;-ARs in experiments, intracellular cAMP can transiently rise to a high concentration before converging to a steady state level. Although changes to cellular cAMP concentration are important in modulating the overall cardiovascular response to sympathetic tone, the underlying mechanisms of the cAMP transients and the parameters that control their magnitude are unclear. We reduce a detailed computational model of the β&lt;sub&gt;1&lt;/sub&gt;-adrenergic signaling cascade to a system of...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6zw6x3vt</guid>
      <pubDate>Mon, 19 Jun 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Meyer, Emily E</name>
      </author>
      <author>
        <name>Clancy, Colleen E</name>
      </author>
      <author>
        <name>Lewis, Timothy J</name>
      </author>
    </item>
    <item>
      <title>Emerging roles for R-loop structures in the management of topological stress</title>
      <link>https://escholarship.org/uc/item/4c89d66p</link>
      <description>R-loop structures are a prevalent class of alternative non-B DNA structures that form during transcription upon invasion of the DNA template by the nascent RNA. R-loops form universally in the genomes of organisms ranging from bacteriophages, bacteria, and yeasts to plants and animals, including mammals. A growing body of work has linked these structures to both physiological and pathological processes, in particular to genome instability. The rising interest in R-loops is placing new emphasis on understanding the fundamental physicochemical forces driving their formation and stability. Pioneering work in &lt;i&gt;Escherichia coli&lt;/i&gt; revealed that DNA topology, in particular negative DNA superhelicity, plays a key role in driving R-loops. A clear role for DNA sequence was later uncovered. Here, we review and synthesize available evidence on the roles of DNA sequence and DNA topology in controlling R-loop formation and stability. Factoring in recent developments in R-loop modeling and...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/4c89d66p</guid>
      <pubDate>Wed, 7 Jun 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Chedin, Frederic</name>
        <uri>https://orcid.org/0000-0002-1306-5335</uri>
      </author>
      <author>
        <name>Benham, Craig J</name>
      </author>
    </item>
    <item>
      <title>Synchronization of Electrically Coupled Resonate-and-Fire Neurons.</title>
      <link>https://escholarship.org/uc/item/8336q2bs</link>
      <description>Electrical coupling between neurons is broadly present across brain areas and is typically assumed to synchronize network activity. However, intrinsic properties of the coupled cells can complicate this simple picture. Many cell types with electrical coupling show a diversity of post-spike subthreshold fluctuations, often linked to subthreshold resonance, which are transmitted through electrical synapses in addition to action potentials. Using the theory of weakly coupled oscillators, we explore the effect of both subthreshold and spike-mediated coupling on synchrony in small networks of electrically coupled resonate-and-fire neurons, a hybrid neuron model with damped subthreshold oscillations and a range of post-spike voltage dynamics. We calculate the phase response curve using an extension of the adjoint method that accounts for the discontinuous post-spike reset rule. We find that both spikes and subthreshold fluctuations can jointly promote synchronization. The subthreshold...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/8336q2bs</guid>
      <pubDate>Fri, 2 Jun 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Chartrand, Thomas</name>
      </author>
      <author>
        <name>Goldman, Mark S</name>
        <uri>https://orcid.org/0000-0002-8257-2314</uri>
      </author>
      <author>
        <name>Lewis, Timothy J</name>
      </author>
    </item>
    <item>
      <title>Computing trisections of 4-manifolds</title>
      <link>https://escholarship.org/uc/item/24060234</link>
      <description>We describe an algorithm to compute trisections of orientable four-manifolds using arbitrary triangulations as input. This results in explicit complexity bounds for the trisection genus of a 4-manifold in terms of the number of pentachora (4-simplices) in a triangulation.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/24060234</guid>
      <pubDate>Tue, 23 May 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Bell, Mark</name>
      </author>
      <author>
        <name>Hass, Joel</name>
        <uri>https://orcid.org/0000-0002-9019-4464</uri>
      </author>
      <author>
        <name>Rubinstein, Joachim Hyam</name>
      </author>
      <author>
        <name>Tillmann, Stephan</name>
      </author>
    </item>
    <item>
      <title>Highly accurate model for prediction of lung nodule malignancy with CT scans</title>
      <link>https://escholarship.org/uc/item/61d0q7sw</link>
      <description>Computed tomography (CT) examinations are commonly used to predict lung nodule malignancy in patients, which are shown to improve noninvasive early diagnosis of lung cancer. It remains challenging for computational approaches to achieve performance comparable to experienced radiologists. Here we present NoduleX, a systematic approach to predict lung nodule malignancy from CT data, based on deep learning convolutional neural networks (CNN). For training and validation, we analyze &amp;gt;1000 lung nodules in images from the LIDC/IDRI cohort. All nodules were identified and classified by four experienced thoracic radiologists who participated in the LIDC project. NoduleX achieves high accuracy for nodule malignancy classification, with an AUC of ~0.99. This is commensurate with the analysis of the dataset by experienced radiologists. Our approach, NoduleX, provides an effective framework for highly accurate nodule malignancy prediction with the model trained on a large patient population....</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/61d0q7sw</guid>
      <pubDate>Sat, 20 May 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Causey, Jason L</name>
      </author>
      <author>
        <name>Zhang, Junyu</name>
      </author>
      <author>
        <name>Ma, Shiqian</name>
        <uri>https://orcid.org/0000-0003-1967-1069</uri>
      </author>
      <author>
        <name>Jiang, Bo</name>
      </author>
      <author>
        <name>Qualls, Jake A</name>
      </author>
      <author>
        <name>Politte, David G</name>
      </author>
      <author>
        <name>Prior, Fred</name>
      </author>
      <author>
        <name>Zhang, Shuzhong</name>
      </author>
      <author>
        <name>Huang, Xiuzhen</name>
      </author>
    </item>
    <item>
      <title>Flagellar swimming in viscoelastic fluids: role of fluid elastic stress revealed by simulations based on experimental data</title>
      <link>https://escholarship.org/uc/item/6564692m</link>
      <description>Many important biological functions depend on microorganisms' ability to move in viscoelastic fluids such as mucus and wet soil. The effects of fluid elasticity on motility remain poorly understood, partly because the swimmer strokes depend on the properties of the fluid medium, which obfuscates the mechanisms responsible for observed behavioural changes. In this study, we use experimental data on the gaits of &lt;i&gt;Chlamydomonas reinhardtii&lt;/i&gt; swimming in Newtonian and viscoelastic fluids as inputs to numerical simulations that decouple the swimmer gait and fluid type in order to isolate the effect of fluid elasticity on swimming. In viscoelastic fluids, cells employing the Newtonian gait swim faster but generate larger stresses and use more power, and as a result the viscoelastic gait is more efficient. Furthermore, we show that fundamental principles of swimming based on viscous fluid theory miss important flow dynamics: fluid elasticity provides an elastic memory effect that...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6564692m</guid>
      <pubDate>Mon, 15 May 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Li, Chuanbin</name>
      </author>
      <author>
        <name>Qin, Boyang</name>
      </author>
      <author>
        <name>Gopinath, Arvind</name>
      </author>
      <author>
        <name>Arratia, Paulo E</name>
      </author>
      <author>
        <name>Thomases, Becca</name>
        <uri>https://orcid.org/0000-0001-8502-8915</uri>
      </author>
      <author>
        <name>Guy, Robert D</name>
        <uri>https://orcid.org/0000-0002-0602-7015</uri>
      </author>
    </item>
    <item>
      <title>Intracellular Pressure Dynamics in Blebbing Cells</title>
      <link>https://escholarship.org/uc/item/2bw8j6sj</link>
      <description>Blebs are pressure-driven protrusions that play an important role in cell migration, particularly in three-dimensional environments. A bleb is initiated when the cytoskeleton detaches from the cell membrane, resulting in the pressure-driven flow of cytosol toward the area of detachment and local expansion of the cell membrane. Recent experiments involving blebbing cells have led to conflicting hypotheses regarding the timescale of intracellular pressure propagation. The interpretation of one set of experiments supports a poroelastic model of the cytoplasm that leads to slow pressure equilibration when compared to the timescale of bleb expansion. A different study concludes that pressure equilibrates faster than the timescale of bleb expansion. To address this discrepancy, a dynamic computational model of the cell was developed that includes mechanics of and the interactions among the cytoplasm, the actin cortex, the cell membrane, and the cytoskeleton. The model results quantify...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2bw8j6sj</guid>
      <pubDate>Tue, 2 May 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Strychalski, Wanda</name>
      </author>
      <author>
        <name>Guy, Robert D</name>
        <uri>https://orcid.org/0000-0002-0602-7015</uri>
      </author>
    </item>
    <item>
      <title>Landmark-free geometric methods in biological shape analysis</title>
      <link>https://escholarship.org/uc/item/5kk16831</link>
      <description>In this paper, we propose a new approach for computing a distance between two shapes embedded in three-dimensional space. We take as input a pair of triangulated genus zero surfaces that are topologically equivalent to spheres with no holes or handles, and construct a discrete conformal map f between the surfaces. The conformal map is chosen to minimize a symmetric deformation energy Esd(f) which we introduce. This measures the distance of f from an isometry, i.e. a non-distorting correspondence. We show that the energy of the minimizing map gives a well-behaved metric on the space of genus zero surfaces. In contrast to most methods in this field, our approach does not rely on any assignment of landmarks on the two surfaces. We illustrate applications of our approach to geometric morphometrics using three datasets representing the bones and teeth of primates. Experiments on these datasets show that our approach performs remarkably well both in shape recognition and in identifying...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5kk16831</guid>
      <pubDate>Fri, 28 Apr 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Koehl, Patrice</name>
      </author>
      <author>
        <name>Hass, Joel</name>
        <uri>https://orcid.org/0000-0002-9019-4464</uri>
      </author>
    </item>
    <item>
      <title>An immersed boundary method for two-fluid mixtures</title>
      <link>https://escholarship.org/uc/item/31p591tb</link>
      <description>We present an Immersed Boundary method for interactions between elastic boundaries and mixtures of two fluids. Each fluid has its own velocity field and volume-fraction. A penalty method is used to enforce the condition that both fluids' velocities agree with that of the elastic boundaries. The method is applied to several problems: Taylor's swimming sheet problem for a mixture of two viscous fluids, peristaltic pumping of a mixture of two viscous fluids, with and without immersed particles, and peristaltic pumping of a mixture of a viscous fluid and a viscoelastic fluid. The swimming sheet and peristalsis problems have received much attention recently in the context of a single viscoelastic fluid. Numerical results demonstrate that the method converges and show its capability to handle a number of flow problems of substantial current interest. They illustrate that for each of these problems, the relative motion between the two fluids changes the observed behaviors profoundly...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/31p591tb</guid>
      <pubDate>Mon, 24 Apr 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Du, Jian</name>
      </author>
      <author>
        <name>Guy, Robert D</name>
        <uri>https://orcid.org/0000-0002-0602-7015</uri>
      </author>
      <author>
        <name>Fogelson, Aaron L</name>
      </author>
    </item>
    <item>
      <title>Coordination of contractility, adhesion and flow in migrating Physarum amoebae</title>
      <link>https://escholarship.org/uc/item/54t7v4pg</link>
      <description>This work examines the relationship between spatio-temporal coordination of intracellular flow and traction stress and the speed of amoeboid locomotion of microplasmodia of Physarum polycephalum. We simultaneously perform particle image velocimetry and traction stress microscopy to measure the velocity of cytoplasmic flow and the stresses applied to the substrate by migrating Physarum microamoebae. In parallel, we develop a mathematical model of a motile cell which includes forces from the viscous cytosol, a poro-elastic, contractile cytoskeleton and adhesive interactions with the substrate. Our experiments show that flow and traction stress exhibit back-to-front-directed waves with a distinct phase difference. The model demonstrates that the direction and speed of locomotion are determined by this coordination between contraction, flow and adhesion. Using the model, we identify forms of coordination that generate model predictions consistent with experiments. We demonstrate that...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/54t7v4pg</guid>
      <pubDate>Mon, 17 Apr 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Lewis, Owen L</name>
      </author>
      <author>
        <name>Zhang, Shun</name>
      </author>
      <author>
        <name>Guy, Robert D</name>
        <uri>https://orcid.org/0000-0002-0602-7015</uri>
      </author>
      <author>
        <name>del Álamo, Juan C</name>
      </author>
    </item>
    <item>
      <title>Actin-Myosin Spatial Patterns from a Simplified Isotropic Viscoelastic Model</title>
      <link>https://escholarship.org/uc/item/2z5444v6</link>
      <description>F-actin networks are involved in cell mechanical processes ranging from motility to endocytosis. The mesoscale architecture of assemblies of individual F-actin polymers that gives rise to micrometer-scale rheological properties is poorly understood, despite numerous in vivo and vitro studies. In vitro networks have been shown to organize into spatial patterns when spatially confined, including dense spherical shells inside spherical emulsion droplets. Here we develop a simplified model of an isotropic, compressible, viscoelastic material continually assembling and disassembling. We demonstrate that spherical shells emerge naturally when the strain relaxation rate (corresponding to internal network reorganization) is slower than the disassembly rate (corresponding to F-actin depolymerization). These patterns are consistent with recent experiments, including a collapse of shells to a central high-density focus of F-actin when either assembly or disassembly is reduced with drugs....</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/2z5444v6</guid>
      <pubDate>Sat, 8 Apr 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Lewis, Owen L</name>
      </author>
      <author>
        <name>Guy, Robert D</name>
        <uri>https://orcid.org/0000-0002-0602-7015</uri>
      </author>
      <author>
        <name>Allard, Jun F</name>
      </author>
    </item>
    <item>
      <title>Linear Algebra as an Introduction to Abstract Mathematics</title>
      <link>https://escholarship.org/uc/item/0nf7j6sq</link>
      <description>Linear Algebra as an Introduction to Abstract Mathematics</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0nf7j6sq</guid>
      <pubDate>Wed, 15 Feb 2023 00:00:00 +0000</pubDate>
      <author>
        <name>Lankham, Isaiah</name>
      </author>
      <author>
        <name>Nachtergaele, Bruno</name>
        <uri>https://orcid.org/0000-0002-7835-3776</uri>
      </author>
      <author>
        <name>Schilling, Anne</name>
        <uri>https://orcid.org/0000-0002-2601-7340</uri>
      </author>
    </item>
    <item>
      <title>Dissipation-Dependent Thermal Escape from a Potential Well</title>
      <link>https://escholarship.org/uc/item/0sw44707</link>
      <description>Langevin simulations are conducted to investigate the Josephson escape statistics over a large set of parameter values for damping and temperature. The results are compared to both Kramers and Büttiker-Harris-Landauer (BHL) models, and good agreement is found with the Kramers model for high to moderate damping, while the BHL model provides further good agreement down to lower damping values. However, for extremely low damping, even the BHL model fails to reproduce the progression of the escape statistics. In order to explain this discrepancy, we develop a new model which shows that the bias sweep effectively cools the system below the thermodynamic value as the potential well broadens due to the increasing bias. A simple expression for the temperature is derived, and the model is validated against direct Langevin simulations for extremely low damping values.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0sw44707</guid>
      <pubDate>Sun, 9 Oct 2022 00:00:00 +0000</pubDate>
      <author>
        <name>Cheng, Chungho</name>
      </author>
      <author>
        <name>Cirillo, Matteo</name>
      </author>
      <author>
        <name>Grønbech-Jensen, Niels</name>
      </author>
    </item>
    <item>
      <title>eGHWT: The Extended Generalized Haar–Walsh Transform</title>
      <link>https://escholarship.org/uc/item/1kw35428</link>
      <description>Extending computational harmonic analysis tools from the classical setting of regular lattices to the more general setting of graphs and networks is very important, and much research has been done recently. The generalized Haar–Walsh transform (GHWT) developed by Irion and Saito (2014) is a multiscale transform for signals on graphs, which is a generalization of the classical Haar and Walsh–Hadamard transforms. We propose the extended generalized Haar–Walsh transform (eGHWT), which is a generalization of the adapted time–frequency tilings of Thiele and Villemoes (1996). The eGHWT examines not only the efficiency of graph-domain partitions but also that of “sequency-domain” partitions simultaneously. Consequently, the eGHWT and its associated best-basis selection algorithm for graph signals significantly improve the performance of the previous GHWT with the similar computational cost, O(NlogN)$$O(N \log N)$$, where N is the number of nodes of an input graph. While the GHWT best-basis...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1kw35428</guid>
      <pubDate>Wed, 22 Jun 2022 00:00:00 +0000</pubDate>
      <author>
        <name>Saito, Naoki</name>
        <uri>https://orcid.org/0000-0001-5234-4719</uri>
      </author>
      <author>
        <name>Shao, Yiqun</name>
      </author>
    </item>
    <item>
      <title>An evolving perspective on the dynamic brain: Notes from the Brain Conference on Dynamics of the brain: Temporal aspects of computation</title>
      <link>https://escholarship.org/uc/item/9nb8p4kx</link>
      <description>An evolving perspective on the dynamic brain: Notes from the Brain Conference on Dynamics of the brain: Temporal aspects of computation</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/9nb8p4kx</guid>
      <pubDate>Fri, 20 Aug 2021 00:00:00 +0000</pubDate>
      <author>
        <name>Langdon, Angela J</name>
      </author>
      <author>
        <name>Chaudhuri, Rishidev</name>
        <uri>https://orcid.org/0000-0003-2301-3261</uri>
      </author>
    </item>
    <item>
      <title>Robust parallel decision-making in neural circuits with nonlinear inhibition</title>
      <link>https://escholarship.org/uc/item/050485rm</link>
      <description>An elemental computation in the brain is to identify the best in a set of options and report its value. It is required for inference, decision-making, optimization, action selection, consensus, and foraging. Neural computing is considered powerful because of its parallelism; however, it is unclear whether neurons can perform this max-finding operation in a way that improves upon the prohibitively slow optimal serial max-finding computation (which takes [Formula: see text] time for N noisy candidate options) by a factor of N, the benchmark for parallel computation. Biologically plausible architectures for this task are winner-take-all (WTA) networks, where individual neurons inhibit each other so only those with the largest input remain active. We show that conventional WTA networks fail the parallelism benchmark and, worse, in the presence of noise, altogether fail to produce a winner when N is large. We introduce the nWTA network, in which neurons are equipped with a second nonlinearity...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/050485rm</guid>
      <pubDate>Fri, 20 Aug 2021 00:00:00 +0000</pubDate>
      <author>
        <name>Kriener, Birgit</name>
      </author>
      <author>
        <name>Chaudhuri, Rishidev</name>
        <uri>https://orcid.org/0000-0003-2301-3261</uri>
      </author>
      <author>
        <name>Fiete, Ila R</name>
      </author>
    </item>
    <item>
      <title>Natural Graph Wavelet Packet Dictionaries</title>
      <link>https://escholarship.org/uc/item/7gv0n3hf</link>
      <description>We introduce a set of novel multiscale basis transforms for signals on graphs that utilize their “dual” domains by incorporating the “natural” distances between graph Laplacian eigenvectors, rather than simply using the eigenvalue ordering. These basis dictionaries can be seen as generalizations of the classical Shannon wavelet packet dictionary to arbitrary graphs, and do not rely on the frequency interpretation of Laplacian eigenvalues. We describe the algorithms (involving either vector rotations or orthogonalizations) to construct these basis dictionaries, use them to efficiently approximate graph signals through the best basis search, and demonstrate the strengths of these basis dictionaries for graph signals measured on sunflower graphs and street networks.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7gv0n3hf</guid>
      <pubDate>Wed, 12 May 2021 00:00:00 +0000</pubDate>
      <author>
        <name>Cloninger, Alexander</name>
      </author>
      <author>
        <name>Li, Haotian</name>
      </author>
      <author>
        <name>Saito, Naoki</name>
        <uri>https://orcid.org/0000-0001-5234-4719</uri>
      </author>
    </item>
    <item>
      <title>Quantitative Study of the Chiral Organization of the Phage Genome Induced by the Packaging Motor</title>
      <link>https://escholarship.org/uc/item/53z4f791</link>
      <description>Molecular motors that translocate DNA are ubiquitous in nature. During morphogenesis of double-stranded DNA bacteriophages, a molecular motor drives the viral genome inside a protein capsid. Several models have been proposed for the three-dimensional geometry of the packaged genome, but very little is known of the signature of the molecular packaging motor. For instance, biophysical experiments show that in some systems, DNA rotates during the packaging reaction, but most current biophysical models fail to incorporate this property. Furthermore, studies including rotation mechanisms have reached contradictory conclusions. In this study, we compare the geometrical signatures imposed by different possible mechanisms for the packaging motors: rotation, revolution, and rotation with revolution. We used a previously proposed kinetic Monte Carlo model of the motor, combined with Brownian dynamics simulations of DNA to simulate deterministic and stochastic motor models. We find that...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/53z4f791</guid>
      <pubDate>Tue, 5 Jan 2021 00:00:00 +0000</pubDate>
      <author>
        <name>Cruz, Brian</name>
      </author>
      <author>
        <name>Zhu, Zihao</name>
      </author>
      <author>
        <name>Calderer, Carme</name>
      </author>
      <author>
        <name>Arsuaga, Javier</name>
      </author>
      <author>
        <name>Vazquez, Mariel</name>
        <uri>https://orcid.org/0000-0001-8328-6806</uri>
      </author>
    </item>
    <item>
      <title>Fine structure of viral dsDNA encapsidation</title>
      <link>https://escholarship.org/uc/item/9rj6g2gn</link>
      <description>Unraveling the mechanisms of packing of DNA inside viral capsids is of fundamental importance to understanding the spread of viruses. It could also help develop new applications to targeted drug delivery devices for a large range of therapies. In this article, we present a robust, predictive mathematical model and its numerical implementation to aid the study and design of bacteriophage viruses for application purposes. Exploiting the analogies between the columnar hexagonal chromonic phases of encapsidated viral DNA and chromonic aggregates formed by plank-shaped molecular compounds, we develop a first-principles effective mechanical model of DNA packing in a viral capsid. The proposed expression of the packing energy, which combines relevant aspects of the liquid crystal theory, is developed from the model of hexagonal columnar phases, together with that describing configurations of polymeric liquid crystals. The method also outlines a parameter selection strategy that uses...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/9rj6g2gn</guid>
      <pubDate>Tue, 4 Aug 2020 00:00:00 +0000</pubDate>
      <author>
        <name>Walker, Shawn</name>
      </author>
      <author>
        <name>Arsuaga, Javier</name>
      </author>
      <author>
        <name>Hiltner, Lindsey</name>
      </author>
      <author>
        <name>Calderer, M Carme</name>
      </author>
      <author>
        <name>Vázquez, Mariel</name>
      </author>
    </item>
    <item>
      <title>Identification of Copy Number Aberrations in Breast Cancer Subtypes Using Persistence Topology</title>
      <link>https://escholarship.org/uc/item/6rq2j8rt</link>
      <description>DNA copy number aberrations (CNAs) are of biological and medical interest because they help identify regulatory mechanisms underlying tumor initiation and evolution. Identification of tumor-driving CNAs (driver CNAs) however remains a challenging task, because they are frequently hidden by CNAs that are the product of random events that take place during tumor evolution. Experimental detection of CNAs is commonly accomplished through array comparative genomic hybridization (aCGH) assays followed by supervised and/or unsupervised statistical methods that combine the segmented profiles of all patients to identify driver CNAs. Here, we extend a previously-presented supervised algorithm for the identification of CNAs that is based on a topological representation of the data. Our method associates a two-dimensional (2D) point cloud with each aCGH profile and generates a sequence of simplicial complexes, mathematical objects that generalize the concept of a graph. This representation...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/6rq2j8rt</guid>
      <pubDate>Tue, 19 May 2020 00:00:00 +0000</pubDate>
      <author>
        <name>Arsuaga, Javier</name>
      </author>
      <author>
        <name>Borrman, Tyler</name>
      </author>
      <author>
        <name>Cavalcante, Raymond</name>
      </author>
      <author>
        <name>Gonzalez, Georgina</name>
      </author>
      <author>
        <name>Park, Catherine</name>
      </author>
    </item>
    <item>
      <title>Automatic Design of Synthetic Gene Circuits through Mixed Integer Non-linear Programming</title>
      <link>https://escholarship.org/uc/item/5jz8t8b7</link>
      <description>Automatic design of synthetic gene circuits poses a significant challenge to synthetic biology, primarily due to the complexity of biological systems, and the lack of rigorous optimization methods that can cope with the combinatorial explosion as the number of biological parts increases. Current optimization methods for synthetic gene design rely on heuristic algorithms that are usually not deterministic, deliver sub-optimal solutions, and provide no guaranties on convergence or error bounds. Here, we introduce an optimization framework for the problem of part selection in synthetic gene circuits that is based on mixed integer non-linear programming (MINLP), which is a deterministic method that finds the globally optimal solution and guarantees convergence in finite time. Given a synthetic gene circuit, a library of characterized parts, and user-defined constraints, our method can find the optimal selection of parts that satisfy the constraints and best approximates the objective...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/5jz8t8b7</guid>
      <pubDate>Tue, 19 May 2020 00:00:00 +0000</pubDate>
      <author>
        <name>Huynh, Linh</name>
      </author>
      <author>
        <name>Kececioglu, John</name>
      </author>
      <author>
        <name>Köppe, Matthias</name>
      </author>
      <author>
        <name>Tagkopoulos, Ilias</name>
        <uri>https://orcid.org/0000-0003-1104-7616</uri>
      </author>
    </item>
    <item>
      <title>Pathways of DNA unlinking: A story of stepwise simplification</title>
      <link>https://escholarship.org/uc/item/3rt3b7bk</link>
      <description>In Escherichia coli DNA replication yields interlinked chromosomes. Controlling topological changes associated with replication and returning the newly replicated chromosomes to an unlinked monomeric state is essential to cell survival. In the absence of the topoisomerase topoIV, the site-specific recombination complex XerCD- dif-FtsK can remove replication links by local reconnection. We previously showed mathematically that there is a unique minimal pathway of unlinking replication links by reconnection while stepwise reducing the topological complexity. However, the possibility that reconnection preserves or increases topological complexity is biologically plausible. In this case, are there other unlinking pathways? Which is the most probable? We consider these questions in an analytical and numerical study of minimal unlinking pathways. We use a Markov Chain Monte Carlo algorithm with Multiple Markov Chain sampling to model local reconnection on 491 different substrate topologies,...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3rt3b7bk</guid>
      <pubDate>Tue, 19 May 2020 00:00:00 +0000</pubDate>
      <author>
        <name>Stolz, Robert</name>
      </author>
      <author>
        <name>Yoshida, Masaaki</name>
      </author>
      <author>
        <name>Brasher, Reuben</name>
      </author>
      <author>
        <name>Flanner, Michelle</name>
      </author>
      <author>
        <name>Ishihara, Kai</name>
      </author>
      <author>
        <name>Sherratt, David J</name>
      </author>
      <author>
        <name>Shimokawa, Koya</name>
      </author>
      <author>
        <name>Vazquez, Mariel</name>
        <uri>https://orcid.org/0000-0001-8328-6806</uri>
      </author>
    </item>
    <item>
      <title>Automated Recognition of RNA Structure Motifs by Their SHAPE Data Signatures</title>
      <link>https://escholarship.org/uc/item/1f03w77b</link>
      <description>High-throughput structure profiling (SP) experiments that provide information at nucleotide resolution are revolutionizing our ability to study RNA structures. Of particular interest are RNA elements whose underlying structures are necessary for their biological functions. We previously introduced &lt;i&gt;patteRNA&lt;/i&gt;, an algorithm for rapidly mining SP data for patterns characteristic of such motifs. This work provided a proof-of-concept for the detection of motifs and the capability of distinguishing structures displaying pronounced conformational changes. Here, we describe several improvements and automation routines to &lt;i&gt;patteRNA&lt;/i&gt;. We then consider more elaborate biological situations starting with the comparison or integration of results from searches for distinct motifs and across datasets. To facilitate such analyses, we characterize &lt;i&gt;patteRNA&lt;/i&gt;’s outputs and describe a normalization framework that regularizes results. We then demonstrate that our algorithm successfully...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1f03w77b</guid>
      <pubDate>Tue, 19 May 2020 00:00:00 +0000</pubDate>
      <author>
        <name>Radecki, Pierce</name>
      </author>
      <author>
        <name>Ledda, Mirko</name>
      </author>
      <author>
        <name>Aviran, Sharon</name>
        <uri>https://orcid.org/0000-0003-1872-9820</uri>
      </author>
    </item>
    <item>
      <title>A Computational Modeling and Simulation Approach to Investigate Mechanisms of Subcellular cAMP Compartmentation</title>
      <link>https://escholarship.org/uc/item/10x3x8xb</link>
      <description>Subcellular compartmentation of the ubiquitous second messenger cAMP has been widely proposed as a mechanism to explain unique receptor-dependent functional responses. How exactly compartmentation is achieved, however, has remained a mystery for more than 40 years. In this study, we developed computational and mathematical models to represent a subcellular sarcomeric space in a cardiac myocyte with varying detail. We then used these models to predict the contributions of various mechanisms that establish subcellular cAMP microdomains. We used the models to test the hypothesis that phosphodiesterases act as functional barriers to diffusion, creating discrete cAMP signaling domains. We also used the models to predict the effect of a range of experimentally measured diffusion rates on cAMP compartmentation. Finally, we modeled the anatomical structures in a cardiac myocyte diad, to predict the effects of anatomical diffusion barriers on cAMP compartmentation. When we incorporated...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/10x3x8xb</guid>
      <pubDate>Tue, 19 May 2020 00:00:00 +0000</pubDate>
      <author>
        <name>Yang, Pei-Chi</name>
        <uri>https://orcid.org/0000-0002-5753-1131</uri>
      </author>
      <author>
        <name>Boras, Britton W</name>
      </author>
      <author>
        <name>Jeng, Mao-Tsuen</name>
      </author>
      <author>
        <name>Docken, Steffen S</name>
      </author>
      <author>
        <name>Lewis, Timothy J</name>
      </author>
      <author>
        <name>McCulloch, Andrew D</name>
      </author>
      <author>
        <name>Harvey, Robert D</name>
      </author>
      <author>
        <name>Clancy, Colleen E</name>
      </author>
    </item>
    <item>
      <title>iGTP: A software package for large-scale gene tree parsimony analysis</title>
      <link>https://escholarship.org/uc/item/0t30p5hk</link>
      <description>BackgroundThe ever-increasing wealth of genomic sequence information provides an unprecedented opportunity for large-scale phylogenetic analysis. However, species phylogeny inference is obfuscated by incongruence among gene trees due to evolutionary events such as gene duplication and loss, incomplete lineage sorting (deep coalescence), and horizontal gene transfer. Gene tree parsimony (GTP) addresses this issue by seeking a species tree that requires the minimum number of evolutionary events to reconcile a given set of incongruent gene trees. Despite its promise, the use of gene tree parsimony has been limited by the fact that existing software is either not fast enough to tackle large data sets or is restricted in the range of evolutionary events it can handle.ResultsWe introduce iGTP, a platform-independent software program that implements state-of-the-art algorithms that greatly speed up species tree inference under the duplication, duplication-loss, and deep coalescence reconciliation...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0t30p5hk</guid>
      <pubDate>Tue, 19 May 2020 00:00:00 +0000</pubDate>
      <author>
        <name>Chaudhary, Ruchi</name>
      </author>
      <author>
        <name>Bansal, Mukul S</name>
      </author>
      <author>
        <name>Wehe, André</name>
      </author>
      <author>
        <name>Fernández-Baca, David</name>
      </author>
      <author>
        <name>Eulenstein, Oliver</name>
      </author>
    </item>
    <item>
      <title>How round is a protein? Exploring protein structures for globularity using conformal mapping</title>
      <link>https://escholarship.org/uc/item/06f3k947</link>
      <description>We present a new algorithm that automatically computes a measure of the geometric difference between the surface of a protein and a round sphere. The algorithm takes as input two triangulated genus zero surfaces representing the protein and the round sphere, respectively, and constructs a discrete conformal map f between these surfaces. The conformal map is chosen to minimize a symmetric elastic energy E S (f) that measures the distance of f from an isometry. We illustrate our approach on a set of basic sample problems and then on a dataset of diverse protein structures. We show first that E S (f) is able to quantify the roundness of the Platonic solids and that for these surfaces it replicates well traditional measures of roundness such as the sphericity. We then demonstrate that the symmetric elastic energy E S (f) captures both global and local differences between two surfaces, showing that our method identifies the presence of protruding regions in protein structures and quantifies...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/06f3k947</guid>
      <pubDate>Tue, 19 May 2020 00:00:00 +0000</pubDate>
      <author>
        <name>Hass, Joel</name>
        <uri>https://orcid.org/0000-0002-9019-4464</uri>
      </author>
      <author>
        <name>Koehl, Patrice</name>
      </author>
    </item>
    <item>
      <title>The Rabl configuration limits topological entanglement of chromosomes in budding yeast</title>
      <link>https://escholarship.org/uc/item/7vr0x0rm</link>
      <description>The three dimensional organization of genomes remains mostly unknown due to their high degree of condensation. Biophysical studies predict that condensation promotes the topological entanglement of chromatin fibers and the inhibition of function. How organisms balance between functionally active genomes and a high degree of condensation remains to be determined. Here we hypothesize that the Rabl configuration, characterized by the attachment of centromeres and telomeres to the nuclear envelope, helps to reduce the topological entanglement of chromosomes. To test this hypothesis we developed a novel method to quantify chromosome entanglement complexity in 3D reconstructions obtained from Chromosome Conformation Capture (CCC) data. Applying this method to published data of the yeast genome, we show that computational models implementing the attachment of telomeres or centromeres alone are not sufficient to obtain the reduced entanglement complexity observed in 3D reconstructions....</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/7vr0x0rm</guid>
      <pubDate>Sun, 17 May 2020 00:00:00 +0000</pubDate>
      <author>
        <name>Pouokam, Maxime</name>
      </author>
      <author>
        <name>Cruz, Brian</name>
      </author>
      <author>
        <name>Burgess, Sean</name>
        <uri>https://orcid.org/0000-0003-0511-0084</uri>
      </author>
      <author>
        <name>Segal, Mark R</name>
      </author>
      <author>
        <name>Vazquez, Mariel</name>
        <uri>https://orcid.org/0000-0001-8328-6806</uri>
      </author>
      <author>
        <name>Arsuaga, Javier</name>
      </author>
    </item>
    <item>
      <title>Chromosomes are predominantly located randomly with respect to each other in interphase human cells</title>
      <link>https://escholarship.org/uc/item/0hw7r55m</link>
      <description>To test quantitatively whether there are systematic chromosome-chromosome associations within human interphase nuclei, interchanges between all possible heterologous pairs of chromosomes were measured with 24-color whole-chromosome painting (multiplex FISH), after damage to interphase lymphocytes by sparsely ionizing radiation in vitro. An excess of interchanges for a specific chromosome pair would indicate spatial proximity between the chromosomes comprising that pair. The experimental design was such that quite small deviations from randomness (extra pairwise interchanges within a group of chromosomes) would be detectable. The only statistically significant chromosome cluster was a group of five chromosomes previously observed to be preferentially located near the center of the nucleus. However, quantitatively, the overall deviation from randomness within the whole genome was small. Thus, whereas some chromosome-chromosome associations are clearly present, at the whole-chromosomal...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0hw7r55m</guid>
      <pubDate>Fri, 15 May 2020 00:00:00 +0000</pubDate>
      <author>
        <name>Cornforth, Michael N</name>
      </author>
      <author>
        <name>Greulich-Bode, Karin M</name>
      </author>
      <author>
        <name>Loucas, Bradford D</name>
      </author>
      <author>
        <name>Arsuaga, Javier</name>
      </author>
      <author>
        <name>Vázquez, Mariel</name>
      </author>
      <author>
        <name>Sachs, Rainer K</name>
      </author>
      <author>
        <name>Brückner, Martina</name>
      </author>
      <author>
        <name>Molls, Michael</name>
      </author>
      <author>
        <name>Hahnfeldt, Philip</name>
      </author>
      <author>
        <name>Hlatky, Lynn</name>
      </author>
      <author>
        <name>Brenner, David J</name>
      </author>
    </item>
    <item>
      <title>Quadruply-graded colored homology of knots</title>
      <link>https://escholarship.org/uc/item/0zh8n5mh</link>
      <description>We conjecture the existence of four independent gradings in colored HOMFLYPT homology, and make qualitative predictions of various interesting structures and symmetries in the colored homology of arbitrary knots. We propose an explicit conjectural description for the rectangular colored homology of torus knots, and identify the new gradings in this context. While some of these structures have a natural interpretation in the physical realization of knot homologies based on counting supersymmetric configurations (BPS states, instantons, and vortices), others are completely new. They suggest new geometric and physical realizations of colored HOMFLYPT homology as the Hochschild homology of the category of branes in a Landau-Ginzburg B-model or, equivalently, in the mirror A-model. Supergroups and supermanifolds are surprisingly ubiquitous in all aspects of this work.</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0zh8n5mh</guid>
      <pubDate>Tue, 17 Mar 2020 00:00:00 +0000</pubDate>
      <author>
        <name>Gorsky, Eugene</name>
      </author>
      <author>
        <name>Gukov, Sergei</name>
      </author>
      <author>
        <name>Stošić, Marko</name>
      </author>
    </item>
  </channel>
</rss>
