Searcharxiv⌕ Search

arXiv subjects

James A. Glazier

Publications and source records attributed to James A. Glazier.

At least 19 recordsLinked to original sources
arXiv2025

Developing an Agent-Based Mathematical Model for Simulating Post-Irradiation Cellular Response: A Crucial Component of a Digital Twin Framework for Personalized Radiation Treatment

In this study, we present the Physical-Bio Translator, an agent-based simulation model designed to simulate cellular responses following irradiation. This simulation framework is based on a novel cell-state transition model that accurately reflects the characteristics of irradiated cells. To validate the Physical-Bio Translator, we performed simulations of cell phase evolution, cell phenotype evolution, and cell survival. The results indicate that the Physical-Bio Translator effectively replicates experimental cell irradiation outcomes, suggesting that digital cell irradiation experiments can be conducted via computer simulation, offering a more sophisticated model for radiation biology. This work lays the foundation for developing a robust and versatile digital twin at multicellular or tissue scales, aiming to comprehensively study and predict patient responses to radiation therapy.

physics.med-ph↗
arXiv2025

Surrogate modeling of Cellular-Potts Agent-Based Models as a segmentation task using the U-Net neural network architecture

The Cellular-Potts model is a powerful and ubiquitous framework for developing computational models for simulating complex multicellular biological systems. Cellular-Potts models (CPMs) are often computationally expensive due to the explicit modeling of interactions among large numbers of individual model agents and diffusive fields described by partial differential equations (PDEs). In this work, we develop a convolutional neural network (CNN) surrogate model using a U-Net architecture that accounts for periodic boundary conditions. We use this model to accelerate the evaluation of a mechanistic CPM previously used to investigate in vitro vasculogenesis. The surrogate model was trained to predict 100 computational steps ahead (Monte-Carlo steps, MCS), accelerating simulation evaluations by a factor of 590 times compared to CPM code execution. Over multiple recursive evaluations, our model effectively captures the emergent behaviors demonstrated by the original Cellular-Potts model of such as vessel sprouting, extension and anastomosis, and contraction of vascular lacunae. This approach demonstrates the potential for deep learning to serve as efficient surrogate models for CPM simulations, enabling faster evaluation of computationally expensive CPM of biological processes at greater spatial and temporal scales.

cs.LG↗
arXiv2025

Generative diffusion model surrogates for mechanistic agent-based biological models

Mechanistic, multicellular, agent-based models are commonly used to investigate tissue, organ, and organism-scale biology at single-cell resolution. The Cellular-Potts Model (CPM) is a powerful and popular framework for developing and interrogating these models. CPMs become computationally expensive at large space- and time- scales making application and investigation of developed models difficult. Surrogate models may allow for the accelerated evaluation of CPMs of complex biological systems. However, the stochastic nature of these models means each set of parameters may give rise to different model configurations, complicating surrogate model development. In this work, we leverage denoising diffusion probabilistic models to train a generative AI surrogate of a CPM used to investigate in vitro vasculogenesis. We describe the use of an image classifier to learn the characteristics that define unique areas of a 2-dimensional parameter space. We then apply this classifier to aid in surrogate model selection and verification. Our CPM model surrogate generates model configurations 20,000 timesteps ahead of a reference configuration and demonstrates approximately a 22x reduction in computational time as compared to native code execution. Our work represents a step towards the implementation of DDPMs to develop digital twins of stochastic biological systems.

q-bio.QM↗
arXiv2025

EFECT: A Method to Quantify the Reproducibility of Stochastic Simulations

Reproducibility is a fundamental requirement for validating scientific claims in computational research. Stochastic computational models are widely used in fields such as systems biology, financial modeling and environmental sciences. However, achieving reproducibility in stochastic simulations remains challenging, as each run can produce different outcomes. Existing infrastructure and software tools do not address independent reproduction of simulation results. Without independent reproducibility, results and conclusions lack credibility, as it remains unclear whether observed findings reflect model behavior or are artifacts of stochastic variation or an underpowered study. To bridge this gap, we introduce the Empirical Characteristic Function Equality Convergence Test (EFECT), a data-driven method to quantify the reproducibility of stochastic simulation results. EFECT employs empirical characteristic functions to compare reported results with those independently generated by assessing distributional inequality, termed EFECT error. Additionally, we establish the EFECT convergence point, a quantitative metric for determining the required number of simulation runs to achieve an EFECT error value of a priori significance. EFECT is applicable to all bounded, real-valued outputs, regardless of the model type or simulation method that produced them. We tested EFECT with over 40 use cases to demonstrate its broad applicability and effectiveness. EFECT standardizes stochastic simulation reproducibility, establishing a workflow that guarantees reliable results, supporting a wide range of stakeholders, and thereby enhancing validation of stochastic simulation studies, across a model's lifecycle. To promote standardization, we are developing the open-source software library libSSR in multiple programming languages for easy integration of EFECT.

stat.ME↗
arXiv2025

From FAIR to CURE: Guidelines for Computational Models of Biological Systems

Guidelines for managing scientific data have been established under the FAIR principles requiring that data be Findable, Accessible, Interoperable, and Reusable. In many scientific disciplines, especially computational biology, both data and models are key to progress. For this reason, and recognizing that such models are a very special type of 'data', we argue that computational models, especially mechanistic models prevalent in medicine, physiology and systems biology, deserve a complementary set of guidelines. We propose the CURE principles, emphasizing that models should be Credible, Understandable, Reproducible, and Extensible. We delve into each principle, discussing verification, validation, and uncertainty quantification for model credibility; the clarity of model descriptions and annotations for understandability; adherence to standards and open science practices for reproducibility; and the use of open standards and modular code for extensibility and reuse. We outline recommended and baseline requirements for each aspect of CURE, aiming to enhance the impact and trustworthiness of computational models, particularly in biomedical applications where credibility is paramount. Our perspective underscores the need for a more disciplined approach to modeling, aligning with emerging trends such as Digital Twins and emphasizing the importance of data and modeling standards for interoperability and reuse. Finally, we emphasize that given the non-trivial effort required to implement the guidelines, the community moves to automate as many of the guidelines as possible.

q-bio.OT↗
arXiv2023

Analyzing the Performance of Deep Encoder-Decoder Networks as Surrogates for a Diffusion Equation

Neural networks (NNs) have proven to be a viable alternative to traditional direct numerical algorithms, with the potential to accelerate computational time by several orders of magnitude. In the present paper we study the use of encoder-decoder convolutional neural network (CNN) as surrogates for steady-state diffusion solvers. The construction of such surrogates requires the selection of an appropriate task, network architecture, training set structure and size, loss function, and training algorithm hyperparameters. It is well known that each of these factors can have a significant impact on the performance of the resultant model. Our approach employs an encoder-decoder CNN architecture, which we posit is particularly well-suited for this task due to its ability to effectively transform data, as opposed to merely compressing it. We systematically evaluate a range of loss functions, hyperparameters, and training set sizes. Our results indicate that increasing the size of the training set has a substantial effect on reducing performance fluctuations and overall error. Additionally, we observe that the performance of the model exhibits a logarithmic dependence on the training set size. Furthermore, we investigate the effect on model performance by using different subsets of data with varying features. Our results highlight the importance of sampling the configurational space in an optimal manner, as this can have a significant impact on the performance of the model and the required training time. In conclusion, our results suggest that training a model with a pre-determined error performance bound is not a viable approach, as it does not guarantee that edge cases with errors larger than the bound do not exist. Furthermore, as most surrogate tasks involve a high dimensional landscape, an ever increasing training set size is, in principle, needed, however it is not a practical solution.

cs.LG↗
arXiv2021

Real-Time Interactive Modeling and Simulation in Biological Physics and Active Matter with Mechanica

Modeling and simulation (M&S) has revolutionized the way modern engineered products are designed, tested and evaluated. Yet modeling and simulation is much less frequently applied in the study of natural biological and active matter systems. Two of the greatest challenges in applying M\&S approaches to natural biological systems are (1) difficulty in specifying a model, and developing a simulation from it, and (2) tuning and optimizing parameters. Here we address the first challenge directly, and develop a software library that can lead to progress in the second.

q-bio.SC↗
arXiv2021

Exact solution for the Anisotropic Ornstein-Uhlenbeck Process

Active Matter models commonly consider particles with overdamped dynamics subject to a force (speed) with constant modulus and random direction. Some models include also random noise in particle displacement (Wiener process) resulting in a diffusive motion at short time scales. On the other hand, Ornstein-Uhlenbeck processes consider Langevin dynamics for the particle velocity and predict a motion that is not diffusive at short time scales. However, experiments show that migrating cells may present a varying speed as well as a short-time diffusive behavior. While Ornstein-Uhlenbeck processes can describe the varying speed, Active Mater models can explain the short-time diffusive behavior. Isotropic models cannot explain both: short-time diffusion renders instantaneous velocity ill-defined, hence impeding dynamical equations that consider velocity time-derivatives. On the other hand, both models apply for migrating biological cells and must, in some limit, yield the same observable predictions. Here we propose and analytically solve an Anisotropic Ornstein-Uhlenbeck process that considers polarized particles, with a Langevin dynamics for the particle movement in the polarization direction while following a Wiener process for displacement in the orthogonal direction. Our characterization provides a theoretically robust way to compare movement in dimensionless simulations to movement in dimensionful experiments, besides proposing a procedure to deal with inevitable finite precision effects in experiments or simulations.

physics.bio-ph↗
arXiv2021

Deep learning approaches to surrogates for solving the diffusion equation for mechanistic real-world simulations

In many mechanistic medical, biological, physical and engineered spatiotemporal dynamic models the numerical solution of partial differential equations (PDEs) can make simulations impractically slow. Biological models require the simultaneous calculation of the spatial variation of concentration of dozens of diffusing chemical species. Machine learning surrogates, neural networks trained to provide approximate solutions to such complicated numerical problems, can often provide speed-ups of several orders of magnitude compared to direct calculation. PDE surrogates enable use of larger models than are possible with direct calculation and can make including such simulations in real-time or near-real time workflows practical. Creating a surrogate requires running the direct calculation tens of thousands of times to generate training data and then training the neural network, both of which are computationally expensive. We use a Convolutional Neural Network to approximate the stationary solution to the diffusion equation in the case of two equal-diameter, circular, constant-value sources located at random positions in a two-dimensional square domain with absorbing boundary conditions. To improve convergence during training, we apply a training approach that uses roll-back to reject stochastic changes to the network that increase the loss function. The trained neural network approximation is about 1e3 times faster than the direct calculation for individual replicas. Because different applications will have different criteria for acceptable approximation accuracy, we discuss a variety of loss functions and accuracy estimators that can help select the best network for a particular application.

cond-mat.soft↗
arXiv2021

Using Deep LSD to build operators in GANs latent space with meaning in real space

Generative models rely on the key idea that data can be represented in terms of latent variables which are uncorrelated by definition. Lack of correlation is important because it suggests that the latent space manifold is simpler to understand and manipulate. Generative models are widely used in deep learning, e.g., variational autoencoders (VAEs) and generative adversarial networks (GANs). Here we propose a method to build a set of linearly independent vectors in the latent space of a GANs, which we call quasi-eigenvectors. These quasi-eigenvectors have two key properties: i) They span all the latent space, ii) A set of these quasi-eigenvectors map to each of the labeled features one-on-one. We show that in the case of the MNIST, while the number of dimensions in latent space is large by construction, 98% of the data in real space map to a sub-domain of latent space of dimensionality equal to the number of labels. We then show how the quasi-eigenvalues can be used for Latent Spectral Decomposition (LSD), which has applications in denoising images and for performing matrix operations in latent space that map to feature transformations in real space. We show how this method provides insight into the latent space topology. The key point is that the set of quasi-eigenvectors form a basis set in latent space and each direction corresponds to a feature in real space.

cs.LG↗
arXiv2019

Learning Everywhere: Pervasive Machine Learning for Effective High-Performance Computation

The convergence of HPC and data-intensive methodologies provide a promising approach to major performance improvements. This paper provides a general description of the interaction between traditional HPC and ML approaches and motivates the Learning Everywhere paradigm for HPC. We introduce the concept of effective performance that one can achieve by combining learning methodologies with simulation-based approaches, and distinguish between traditional performance as measured by benchmark scores. To support the promise of integrating HPC and learning methods, this paper examines specific examples and opportunities across a series of domains. It concludes with a series of open computer science and cyberinfrastructure questions and challenges that the Learning Everywhere paradigm presents.

cs.DC↗
arXiv2018

Instantaneous cell migration velocity may be ill-defined

Cell crawling is critical to biological development, homeostasis and disease. In many cases, cell trajectories are quasi-random-walk. In vitro assays on flat surfaces often described such quasi-random-walk cell trajectories as approximations to a solution of a Langevin process. However, experiments show quasi-diffusive behavior at small timescales, indicating that instantaneous velocity and velocity autocorrelations are not well-defined. We propose to characterize mean-squared cell displacement using a modified Fürth equation with three temporal and spatial regimes: short- and long-time/range diffusion and intermediate time/range ballistic motion. This analysis collapses mean-squared displacements of previously published experimental data onto a single-parameter family of curves, allowing direct comparison between movement in different cell types, and between experiments and numerical simulations. Our method also show that robust cell-motility quantification requires an experiment with a maximum interval between images of a few percent of the cell-motion persistence time or less, and a duration of a few orders-of-magnitude longer than the cell-motion persistence time or more.

physics.bio-ph↗
arXiv2017

A modeling and simulation language for biological cells with coupled mechanical and chemical processes

Biological cells are the prototypical example of active matter. Cells sense and respond to mechanical, chemical and electrical environmental stimuli with a range of behaviors, including dynamic changes in morphology and mechanical properties, chemical uptake and secretion, cell differentiation, proliferation, death, or migration. Modeling and simulation of such dynamic phenomena poses a number of computational challenges. A modeling language to describe cellular dynamics must be able to naturally represent complex intra and extra-cellular spatial structures, and coupled mechanical, chemical and electrical processes. In order to be useful to domain experts, a modeling language should be based on concepts, terms and principles native to the problem domain. A compiler must then be able to generate an executable model from this physically motivated description. Finally, an executable model must efficiently calculate the time evolution of such dynamic and inhomogeneous phenomena. We present a spatial hybrid systems modeling language, compiler and mesh-free Lagrangian based simulation engine which will enable domain experts to define models using natural, biologically motivated constructs and to simulate time evolution of coupled cellular, mechanical and chemical processes acting on a time varying number of cells and their environment.

cs.CE↗
arXiv2015

libRoadRunner: A High Performance SBML Simulation and Analysis Library

This paper presents libRoadRunner, an extensible, high-performance, cross-platform, open-source software library for the simulation and analysis of models \ expressed using Systems Biology Markup Language (SBML). SBML is the most widely used standard for representing dynamic networks, especially biochemical networks. libRoadRunner supports solution of both large models and multiple replicas of a single model on desktop, mobile and cluster computers. libRoadRunner is a self-contained library, able to run both as a component inside other tools via its C++ and C bindings andnteractively through its Python interface. The Python Application Programming Interface (API) is similar to the APIs of Matlab and SciPy, making it fast and easy to learn, even for new users. libRoadRunner uses a custom Just-In-Time (JIT) compiler built on the widely-used LLVM JIT compiler framework to compile SBML-specified models directly into very fast native machine code for a variety of processors, making it appropriate for solving very large models or multiple replicas of smaller models. libRoadRunner is flexible, supporting the bulk of the SBML specification (except for delay and nonlinear algebraic equations) and several of its extensions. It offers multiple deterministic and stochastic integrators, as well as tools for steady-state, stability analyses and flux balance analysis. We regularly update libRoadRunner binary distributions for Mac OS X, Linux and Windows and license them under Apache License Version 2.0. http://www.libroadrunner.org provides online documentation, full build instructions, binaries and a git source repository.

q-bio.SC↗
arXiv2015

3D simulations of wet foam coarsening evidence a self similar growth regime

In wet liquid foams, slow diffusion of gas through bubble walls changes bubble pressure, volume and wall curvature. Large bubbles grow at the expenses of smaller ones. The smaller the bubble, the faster it shrinks. As the number of bubbles in a given volume decreases in time, the average bubble size increases: i.e. the foam coarsens. During coarsening, bubbles also move relative to each other, changing bubble topology and shape, while liquid moves within the regions separating the bubbles. Analyzing the combined effects of these mechanisms requires examining a volume with enough bubbles to provide appropriate statistics throughout coarsening. Using a Cellular Potts model, we simulate these mechanisms during the evolution of three-dimensional foams with wetnesses of $ϕ=0.00$, $0.05$ and $ 0.20$. We represent the liquid phase as an ensemble of many small fluid particles, which allows us to monitor liquid flow in the region between bubbles. The simulations begin with $2 \times 10^5$ bubbles for $ϕ= 0.00$ and $1.25 \times 10^5$ bubbles for $ϕ= 0.05$ and $0.20$, allowing us to track the distribution functions for bubble size, topology and growth rate over two and a half decades of volume change. All simulations eventually reach a self-similar growth regime, with the distribution functions time independent and the number of bubbles decreasing with time as a power law whose exponent depends on the wetness.

cond-mat.soft↗
arXiv2008

Contact-inhibited chemotaxis in de novo and sprouting blood-vessel growth

Blood vessels form either when dispersed endothelial cells (the cells lining the inner walls of fully-formed blood vessels) organize into a vessel network (vasculogenesis), or by sprouting or splitting of existing blood vessels (angiogenesis). Although they are closely related biologically, no current model explains both phenomena with a single biophysical mechanism. Most computational models describe sprouting at the level of the blood vessel, ignoring how cell behavior drives branch splitting during sprouting. We present a cell-based, Glazier-Graner-Hogeweg-model simulation of the initial patterning before the vascular cords form lumens, based on plausible behaviors of endothelial cells. The endothelial cells secrete a chemoattractant, which attracts other endothelial cells. As in the classic Keller-Segel model, chemotaxis by itself causes cells to aggregate into isolated clusters. However, including experimentally-observed adhesion-driven contact inhibition of chemotaxis in the simulation causes randomly-distributed cells to organize into networks and cell aggregates to sprout, reproducing aspects of both de novo and sprouting blood-vessel growth. We discuss two branching instabilities responsible for our results. Cells at the surfaces of cell clusters attempting to migrate to the centers of the clusters produce a buckling instability. In a model variant that eliminates the surface-normal force, a dissipative mechanism drives sprouting, with the secreted chemical acting both as a chemoattractant and as an inhibitor of pseudopod extension. The branching instabilities responsible for our results, which result from contact inhibition of chemotaxis, are both generic developmental mechanisms and interesting examples of unusual patterning instabilities.

q-bio.TO↗
arXiv2007

Experimental growth law for bubbles in a "wet" 3D liquid foam

We used X-ray tomography to characterize the geometry of all bubbles in a liquid foam of average liquid fraction $ϕ_l\approx 17 %$ and to follow their evolution, measuring the normalized growth rate $\mathcal{G}=V^{-{1/3}}\frac{dV} {dt}$ for 7000 bubbles. While $\mathcal{G}$ does not depend only on the number of faces of a bubble, its average over $f-$faced bubbles scales as $G_f\sim f-f_0$ for large $f$s at all times. We discuss the dispersion of $\mathcal{G}$ and the influence of $V$ on $\mathcal{G}$.

cond-mat.soft↗