SearcharxivSearch

arXiv subjects

Zhaohua Lin

Publications and source records attributed to Zhaohua Lin.

3 recordsLinked to original sources

When is vaccine prioritization worth optimizing?

Optimizing vaccine prioritization is often treated as the default policy response when vaccine supply is limited. Yet optimized prioritization carries administrative, ethical and communication costs, motivating an upstream question: whether differences among vaccine allocations can alter epidemic outcomes enough to make optimization epidemiologically necessary. We show that optimization is not always worth pursuing: in some regimes, vaccination markedly reduces epidemic burden, but many feasible allocation rules perform almost equally well, making the necessity of optimization low. We quantify this necessity as the range of epidemic outcomes generated by different allocations under fixed supply and show that it is governed by competition between vaccinating high-contact groups to slow transmission and vaccinating groups that benefit most directly: necessity is low when these protection routes are balanced and high when one dominates. Increasing transmission intensity changes this balance and drives a transition in the optimal allocation from transmission-focused prioritization toward direct protection. Different prevention objectives exhibit distinct transition thresholds, creating regimes in which optimizing one objective substantially compromises another, thereby revealing when the choice of prevention target matters most. This framework reframes vaccine prioritization as a prior decision problem, identifying when optimization is warranted, when simpler rules suffice, and when prevention goals conflict.

physics.bio-ph

KidMesh: Computational Mesh Reconstruction for Pediatric Congenital Hydronephrosis Using Deep Neural Networks

Pediatric congenital hydronephrosis (CH) is a common urinary tract disorder, primarily caused by obstruction at the renal pelvis-ureter junction. Magnetic resonance urography (MRU) can visualize hydronephrosis, including renal pelvis and calyces, by utilizing the natural contrast provided by water. Existing voxel-based segmentation approaches can extract CH regions from MRU, facilitating disease diagnosis and prognosis. However, these segmentation methods predominantly focus on morphological features, such as size, shape, and structure. To enable functional assessments, such as urodynamic simulations, external complex post-processing steps are required to convert these results into mesh-level representations. To address this limitation, we propose an end-to-end method based on deep neural networks, namely KidMesh, which could automatically reconstruct CH meshes directly from MRU. Generally, KidMesh extracts feature maps from MRU images and converts them into feature vertices through grid sampling. It then deforms a template mesh according to these feature vertices to generate the specific CH meshes of MRU images. Meanwhile, we develop a novel schema to train KidMesh without relying on accurate mesh-level annotations, which are difficult to obtain due to the sparsely sampled MRU slices. Experimental results show that KidMesh could reconstruct CH meshes in an average of 0.4 seconds, and achieve comparable performance to conventional methods without requiring post-processing. The reconstructed meshes exhibited no self-intersections, with only 3.7% and 0.2% of the vertices having error distances exceeding 3.2mm and 6.4mm, respectively. After rasterization, these meshes achieved a Dice score of 0.86 against manually delineated CH masks. Furthermore, these meshes could be used in renal urine flow simulations, providing valuable urodynamic information for clinical practice.

cs.CV

Non-Markovian epidemic spreading on temporal networks

Many empirical studies have revealed that the occurrences of contacts associated with human activities are non-Markovian temporal processes with a heavy tailed inter-event time distribution. Besides, there has been increasing empirical evidence that the infection and recovery rates are time-dependent. However, we lack a comprehensive framework to analyze and understand non-Markovian contact and spreading processes on temporal networks. In this paper, we propose a general formalism to study non-Markovian dynamics on non-Markovian temporal networks. We find that, under certain conditions, non-Markovian dynamics on temporal networks are equivalent to Markovian dynamics on static networks. Interestingly, this result is independent of the underlying network topology.

physics.soc-ph