Paper List
-
Discovery of a Hematopoietic Manifold in scGPT Yields a Method for Extracting Performant Algorithms from Biological Foundation Model Internals
This work addresses the core challenge of extracting reusable, interpretable, and high-performance biological algorithms from the opaque internal repr...
-
MS2MetGAN: Latent-space adversarial training for metabolite–spectrum matching in MS/MS database search
This paper addresses the critical bottleneck in metabolite identification: the generation of high-quality negative training samples that are structura...
-
Toward Robust, Reproducible, and Widely Accessible Intracranial Language Brain-Computer Interfaces: A Comprehensive Review of Neural Mechanisms, Hardware, Algorithms, Evaluation, Clinical Pathways and Future Directions
This review addresses the core challenge of fragmented and heterogeneous evidence that hinders the clinical translation of intracranial language BCIs,...
-
Less Is More in Chemotherapy of Breast Cancer
通过纳入细胞周期时滞和竞争项,解决了现有肿瘤-免疫模型的过度简化问题,以定量比较化疗方案。
-
Fold-CP: A Context Parallelism Framework for Biomolecular Modeling
This paper addresses the critical bottleneck of GPU memory limitations that restrict AlphaFold 3-like models to processing only a few thousand residue...
-
Open Biomedical Knowledge Graphs at Scale: Construction, Federation, and AI Agent Access with Samyama Graph Database
This paper addresses the core pain point of fragmented biomedical data by constructing and federating large-scale, open knowledge graphs to enable sea...
-
Predictive Analytics for Foot Ulcers Using Time-Series Temperature and Pressure Data
This paper addresses the critical need for continuous, real-time monitoring of diabetic foot health by developing an unsupervised anomaly detection fr...
-
Hypothesis-Based Particle Detection for Accurate Nanoparticle Counting and Digital Diagnostics
This paper addresses the core challenge of achieving accurate, interpretable, and training-free nanoparticle counting in digital diagnostic assays, wh...
A Unified Variational Principle for Branching Transport Networks: Wave Impedance, Viscous Flow, and Tissue Metabolism
Unknown
30秒速读
IN SHORT: This paper solves the core problem of predicting the empirically observed branching exponent (α≈2.7) in mammalian arterial trees, which neither Murray's cubic law (α=3) nor pure impedance matching (α≈2) can explain in isolation.
核心创新
- Methodology Introduces a unified network-level Lagrangian that combines dimensionless wave-reflection and metabolic transport penalties, eliminating the need for a free weighting parameter.
- Theory Formulates the morphological optimization as a zero-sum game and applies von Neumann's minimax theorem to derive a unique saddle point (α*, η*) from an equal-cost condition.
- Biology Derives binary branching (N=2) as a dynamic topological optimum that maximizes the network stiffness ratio κ_eff, rather than assuming it as an anatomical constraint.
主要结论
- The empirical branching exponent α_exp=2.70±0.20 emerges as a robust minimax optimum (α*=2.72 for G=11) between competing wave (α_w≈2.115) and transport (α_t∈[2.90,2.94]) attractors.
- The prediction is structurally robust, with sensitivity |Δα*|<0.01 across physiological parameter ranges, and depends critically only on the histological scaling exponent p=0.77.
- Binary branching (N=2) is uniquely selected as it maximizes the emergent network stiffness ratio κ_eff(N), a derived property of the unified framework.
摘要: The branching geometry of biological transport networks is canonically characterized by a diameter scaling exponent α. Traditionally, this exponent interpolates between two structural attractors: impedance matching (α∼2) for pulsatile wave propagation and viscous-metabolic minimization (α=3) for steady flow. We demonstrate that neither mechanism in isolation can predict the empirically observed αexp=2.70±0.20 in mammalian arterial trees. Incorporating the empirical sub-linear vessel-wall scaling h(r)∝r^p (p=0.77) into a three-term metabolic cost function rigorously breaks the universality of Murray’s cubic law — a consequence of cost-function inhomogeneity established via Cauchy’s functional equation — and bounds the static transport optimum to αt∈[2.90,2.94]. To account for the dynamic pulsatile environment, we formulate a unified network-level Lagrangian balancing wave-reflection penalties against steady transport-metabolic costs. Because the operational duty cycle η between pulsatile and steady states is inherently uncertain over developmental timescales, we cast the morphological optimization as a zero-sum game between network architecture and environmental state. By von Neumann’s minimax theorem — for which we provide a direct constructive proof exploiting the strict monotonicity of the cost curves — this game admits a unique saddle point (α∗,η∗) satisfying an exact equal-cost condition, from which the empirical exponent emerges as the robust optimal compromise between competing thermodynamic demands. We further prove that N=2 (binary branching) uniquely maximizes the network stiffness ratio κ_eff(N), establishing the universal preference for bifurcations not as an anatomical assumption but as a derived property of the unified wave-transport framework. Numerical evaluation on the porcine coronary tree (G=11 generations) yields α∗=2.72, in quantitative agreement with morphometric data. Sensitivity analysis confirms that this prediction is structurally robust to metabolic parameter variation (|Δα∗|<0.01 across the physiological range of viscosity and wall metabolic rates), depending critically only on the histological scaling exponent p — the single parameter with direct anatomical grounding. Specifically, the prediction is analytically insensitive to the exact value of the wall-thickness pre-factor c0, making the framework a zero-parameter derivation from fundamental scaling principles.