Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.09067

From Simulation to Suture Lines: Computational Fluid Dynamic Simulation-Guided Baffle Construction for Complex Biventricular Repair

Alexander K. Reed·Elena Sabdy Martinez·Alexander D. Kaiser·Amit Sharir·Caio Carcaioli Bonin·Perry S. Choi·Shiraz A. Maskatia·Alison L. Marsden·Michael R. Ma
View original source ↗Read source document ↗Export metadata ↓

Abstract

Biventricular repair is favored for children with complex double-outlet right ventricle (DORV) to eliminate the long-term morbidity of single ventricle physiology. However, creating a baffle that maintains adequate cross-sectional area while limiting incursion on the tricuspid valve apparatus is challenging in a distorted, arrested heart. Three-dimensional (3D) models have aided baffle design with anatomic visualization but analytic approaches, including computational fluid dynamic (CFD) simulation support, have not yet been incorporated into clinical workflows. We present the preoperative, prospective construction of a DORV repair baffle guided by a semi-automated area-preserving algorithm and CFD analysis.

Explore related subjects

cs.CE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander K. Reed, Elena Sabdy Martinez, Alexander D. Kaiser, Amit Sharir, Caio Carcaioli Bonin, Perry S. Choi, Shiraz A. Maskatia, Alison L. Marsden, Michael R. Ma. 2026-10-06. From Simulation to Suture Lines: Computational Fluid Dynamic Simulation-Guided Baffle Construction for Complex Biventricular Repair. https://arxiv.org/abs/2610.09067

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Differentiable Hybrid Modelling for Learning and Optimising Chemical Transport Processes from Experimental Data

Transport models underpin the design and optimisation of chemical processes, yet their constitutive laws are typically hand-picked, their experimental initial conditions are assumed exact, and their computational cost restricts optimisation to a handful of process variables. Here we introduce a differentiable hybrid modelling framework that embeds neural networks within a GPU-accelerated population balance equation solver to discover constitutive laws and assimilate initial conditions directly from experimental crystallisation data. Using thirteen real experiments with multi-dimensional size and shape measurements, we show that treating measured initial conditions as exact yields a physically inconsistent rate law despite improved predictive accuracy, whereas assimilating them recovers a physically consistent, non-linear law and reduces trajectory error sevenfold relative to conventional modelling. End-to-end differentiability further enables gradient-based optimisation of high-dimensional operating profiles, identifying a 300-variable temperature profile that reduces crystal aspect ratio by 25% at constant mass, facilitating superior product attributes. Our framework augments, rather than replaces, mechanistic modelling, offering a general route to learning transport models from data and optimising processes with them.

cs.CE↗
arXiv2026

Adaptive Encoding Strategy for Quantum Annealing in Mixed-Variable Engineering Optimization

Mixed discrete-continuous optimization is central to engineering design, where discrete choices interact with continuous fields. These problems are difficult due to high-dimensional, complex search spaces. To tackle them, Quantum Annealing (QA) is promising, yet its native binary nature supports only discrete variables, making accurate and efficient encodings of continuous quantities a central challenge. Existing approaches either split the coupled problem, mapping discrete decisions to QA while solving continuous fields classically, or use fixed-bit-depth encodings. The former compromises QA's global search advantages; the latter can underrepresent dynamic range or inflate the number of binary variables. We show that simply increasing bit depth can even degrade performance on current QA hardware, underscoring the need for alternative encodings. In response, we introduce an adaptive encoding strategy for continuous variables in QA that enables efficient treatment of coupled mixed-variable problems. We propose an update strategy for the representable ranges of the continuous variables and demonstrate its utility by integrating it into the minimum complementary energy formulation for structural design optimization, which provides a single, coupled constrained problem. We apply a quadratic penalty method where we update the representation of the continuous variables while targeting the full original objective, preserving QA's global search capability. On a published benchmark, the size optimization of a composite rod, our adaptive encoding improves solution quality under a fixed binary variable budget, demonstrating a superior precision-resource trade-off. Since the framework generalizes beyond structural design, it offers practical guidance for encoding continuous variables for QA and indicates that adaptive representations can enhance precision on current hardware.

cs.CE↗
arXiv2026

Investing Is Compression

In 1956 John Kelly wrote a paper at Bell Labs describing the relationship between gambling and Information Theory. What came to be known as the Kelly Criterion is both an objective and a closed-form solution to sizing wagers when odds and edge are known. Samuelson argued it was arbitrary and subjective, and successfully kept it out of mainstream economics. Luckily it lived on in computer science, mostly because of Tom Cover's work at Stanford. He showed that it is the uniquely optimal way to invest: it maximizes long-term wealth, minimizes the risk of ruin, and is competitively optimal in a game-theoretic sense, even over the short term. One of Cover's most surprising contributions to portfolio theory was the universal portfolio. Related to universal compression in information theory, it performs asymptotically as well as the best constant-rebalanced portfolio in hindsight. I borrow a trick from that algorithm to show that Kelly's objective, even in the general form, factors the investing problem into three terms: a money term, an entropy term, and a divergence term. The only way to maximize growth is to minimize divergence which measures the difference between our distribution and the true distribution in bits. Investing is, fundamentally, a compression problem. This decomposition also yields new practical results. Because the money and entropy terms are constant across strategies in a given backtest, the difference in log growth between two strategies measures their relative divergence in bits. I also introduce a winner fraction heuristic which allocates capital in proportion to each asset's probability of dominating the candidate set. The growth shortfall of this heuristic relative to the optimal portfolio is bounded by the entropy of the winner fraction distribution. To my knowledge, both the heuristic and the entropy bound are original contributions.

cs.CE↗