Searcharxiv⌕ Search

arXiv subjects

Meng Wu

Publications and source records attributed to Meng Wu.

At least 37 records · Page 2Linked to original sources

UniCoN: Universal Conditional Networks for Multi-Age Embryonic Cartilage Segmentation with Sparsely Annotated Data

Osteochondrodysplasia, affecting 2-3% of newborns globally, is a group of bone and cartilage disorders that often result in head malformations, contributing to childhood morbidity and reduced quality of life. Current research on this disease using mouse models faces challenges since it involves accurately segmenting the developing cartilage in 3D micro-CT images of embryonic mice. Tackling this segmentation task with deep learning (DL) methods is laborious due to the big burden of manual image annotation, expensive due to the high acquisition costs of 3D micro-CT images, and difficult due to embryonic cartilage's complex and rapidly changing shapes. While DL approaches have been proposed to automate cartilage segmentation, most such models have limited accuracy and generalizability, especially across data from different embryonic age groups. To address these limitations, we propose novel DL methods that can be adopted by any DL architectures -- including CNNs, Transformers, or hybrid models -- which effectively leverage age and spatial information to enhance model performance. Specifically, we propose two new mechanisms, one conditioned on discrete age categories and the other on continuous image crop locations, to enable an accurate representation of cartilage shape changes across ages and local shape details throughout the cranial region. Extensive experiments on multi-age cartilage segmentation datasets show significant and consistent performance improvements when integrating our conditional modules into popular DL segmentation architectures. On average, we achieve a 1.7% Dice score increase with minimal computational overhead and a 7.5% improvement on unseen data. These results highlight the potential of our approach for developing robust, universal models capable of handling diverse datasets with limited annotated data, a key challenge in DL-based medical image analysis.

eess.IV↗

Geometric, Variational, and Bracket Descriptions of Fluid Motion with Open Boundaries

We develop a Lie group geometric framework for the motion of fluids with permeable boundaries that extends Arnold's geometric description of fluid in closed domains. Our setting is based on the classical Hamilton principle applied to fluid trajectories, appropriately amended to incorporate bulk and boundary forces via a Lagrange-d'Alembert approach, and to take into account only the fluid particles present in the fluid domain at a given time. By applying a reduction by relabelling symmetries, we deduce a variational formulation in the Eulerian description that extends the Euler-Poincaré framework to open fluids. On the Hamiltonian side, our approach yields a bracket formulation that consistently extends the Lie-Poisson bracket of fluid dynamics and contains as a particular case a bulk+boundary bracket formulation proposed earlier. We illustrate the geometric framework with several examples, and also consider the extension of this setting to include multicomponent fluids, the consideration of general advected quantities, the analysis of higher-order fluids, and the incorporation of boundary stresses. Open fluids are found in a wide range of physical systems, including geophysical fluid dynamics, porous media, incompressible flow and magnetohydrodynamics. This new formulation permits a description based on geometric mechanics that can be applied to a broad class of models.

math.DS↗

Accelerating Mini-batch HGNN Training by Reducing CUDA Kernels

Heterogeneous graph neural networks (HGNNs) are essential for capturing the structure and semantic information in heterogeneous graphs. However, existing GPU-based solutions, such as PyTorch Geometric, suffer from low GPU utilization due to numerous short-execution-time and memory-bound CUDA kernels during HGNN training. To address this issue, we introduce HiFuse, an enhancement for PyTorch Geometric designed to accelerate mini-batch HGNN training on CPU-GPU systems. From the data perspective, we reorganize and merge multiple smaller vertex feature matrices into larger ones, enabling a single kernel to process larger data chunks. This efficiently exploits data locality, reduces the kernel launch overhead, and improves overall GPU utilization. From the workflow perspective, we sophisticatedly offload the construction of semantic graphs from GPU to CPU to reduce the number of CUDA kernels. To meet the parallelism requirements on CPU and ensure seamless execution between CPU and GPU, we employ parallelization techniques including multi-threading and asynchronous pipeline. This allows different stages of the process to overlap, enhancing GPU utilization and reducing end-to-end execution latency, leading to a more efficient and balanced use of computational resources. Through extensive experiments, HiFuse demonstrates an average 2.38 times speedup compared to a state-of-the-art solution.

cs.AR↗

On orbit complexity of dynamical systems: intermediate value property and level set related to a Furstenberg problem

For symbolic dynamics with some mild conditions, we solve the lowering topological entropy problem for subsystems and determine the Hausdorff dimension of the level set with given complexity, where the complexity is represented by Hausdorff dimension of orbit closure. These results can be applied to some dynamical systems such as $β$-transformations, conformal expanding repeller, etc. We also determine the dimension of the Furstenberg level set, which is related to a problem of Furstenberg on the orbits under two multiplicatively independent maps.

math.DS↗

ADE-HGNN: Accelerating HGNNs through Attention Disparity Exploitation

Heterogeneous Graph Neural Networks (HGNNs) have recently demonstrated great power in handling heterogeneous graph data, rendering them widely applied in many critical real-world domains. Most HGNN models leverage attention mechanisms to significantly improvemodel accuracy, albeit at the cost of increased computational complexity and memory bandwidth requirements. Fortunately, the attention disparity from source vertices towards a common target vertex unveils an opportunity to boost the model execution performance by pruning unimportant source vertices during neighbor aggregation. In this study, we commence with a quantitative analysis of the attention disparity in HGNN models, where the importance of different source vertices varies for the same target vertex. To fully exploit this finding for inference acceleration, we propose a runtime pruning method based on min-heap and map it to a dedicated hardware pruner to discard unimportant vertices. Given that the pruning overhead itself is non-negligible and cannot be amortized by conventional staged execution paradigm, an operation-fusion execution fow of HGNNs is introduced to overlap the pruning overhead while harnessing inter-stage parallelism. Finally, we present the design of a novel HGNN accelerator, ADE-HGNN, tailored to support the proposed execution framework. Our experimental results demonstrate that ADE-HGNN achieves an average performance improvement of 28.21x over the NVIDIA GPU T4 platform and 7.98x over the advanced GPU A100, with the inference accuracy loss kept within a negligible range of 0.11%~1.47%. Furthermore, ADE-HGNN significantly reduces energy consumption to 1.97% and 5.37% of the two platforms, respectively.

cs.AR↗

Disttack: Graph Adversarial Attacks Toward Distributed GNN Training

Graph Neural Networks (GNNs) have emerged as potent models for graph learning. Distributing the training process across multiple computing nodes is the most promising solution to address the challenges of ever-growing real-world graphs. However, current adversarial attack methods on GNNs neglect the characteristics and applications of the distributed scenario, leading to suboptimal performance and inefficiency in attacking distributed GNN training. In this study, we introduce Disttack, the first framework of adversarial attacks for distributed GNN training that leverages the characteristics of frequent gradient updates in a distributed system. Specifically, Disttack corrupts distributed GNN training by injecting adversarial attacks into one single computing node. The attacked subgraphs are precisely perturbed to induce an abnormal gradient ascent in backpropagation, disrupting gradient synchronization between computing nodes and thus leading to a significant performance decline of the trained GNN. We evaluate Disttack on four large real-world graphs by attacking five widely adopted GNNs. Compared with the state-of-the-art attack method, experimental results demonstrate that Disttack amplifies the model accuracy degradation by 2.75$\times$ and achieves speedup by 17.33$\times$ on average while maintaining unnoticeability.

cs.LG↗

Revisiting Edge Perturbation for Graph Neural Network in Graph Data Augmentation and Attack

Edge perturbation is a basic method to modify graph structures. It can be categorized into two veins based on their effects on the performance of graph neural networks (GNNs), i.e., graph data augmentation and attack. Surprisingly, both veins of edge perturbation methods employ the same operations, yet yield opposite effects on GNNs' accuracy. A distinct boundary between these methods in using edge perturbation has never been clearly defined. Consequently, inappropriate perturbations may lead to undesirable outcomes, necessitating precise adjustments to achieve desired effects. Therefore, questions of ``why edge perturbation has a two-faced effect?'' and ``what makes edge perturbation flexible and effective?'' still remain unanswered. In this paper, we will answer these questions by proposing a unified formulation and establishing a clear boundary between two categories of edge perturbation methods. Specifically, we conduct experiments to elucidate the differences and similarities between these methods and theoretically unify the workflow of these methods by casting it to one optimization problem. Then, we devise Edge Priority Detector (EPD) to generate a novel priority metric, bridging these methods up in the workflow. Experiments show that EPD can make augmentation or attack flexibly and achieve comparable or superior performance to other counterparts with less time overhead.

cs.LG↗

ConUNETR: A Conditional Transformer Network for 3D Micro-CT Embryonic Cartilage Segmentation

Studying the morphological development of cartilaginous and osseous structures is critical to the early detection of life-threatening skeletal dysmorphology. Embryonic cartilage undergoes rapid structural changes within hours, introducing biological variations and morphological shifts that limit the generalization of deep learning-based segmentation models that infer across multiple embryonic age groups. Obtaining individual models for each age group is expensive and less effective, while direct transfer (predicting an age unseen during training) suffers a potential performance drop due to morphological shifts. We propose a novel Transformer-based segmentation model with improved biological priors that better distills morphologically diverse information through conditional mechanisms. This enables a single model to accurately predict cartilage across multiple age groups. Experiments on the mice cartilage dataset show the superiority of our new model compared to other competitive segmentation models. Additional studies on a separate mice cartilage dataset with a distinct mutation show that our model generalizes well and effectively captures age-based cartilage morphology patterns.

eess.IV↗

Van der Corput and metric theorems for geometric progressions for self-similar measures

We prove a van der Corput lemma for non-atomic self-similar measures $μ$. As an application, we show that the correlations of all finite orders of $( x^n \mod 1 )_{n\geq 1}$ converge to the Poissonian model for $μ$-a.e. $x$, assuming $x>1$. We also complete a recent result of Algom, Rodriguez Hertz, and Wang (obtained simultaneously by Baker and Banaji), showing that any self-conformal measure with respect to a non-affine real analytic IFS has polynomial Fourier decay.

math.DS↗

TLMCM Network for Medical Image Hierarchical Multi-Label Classification

Medical Image Hierarchical Multi-Label Classification (MI-HMC) is of paramount importance in modern healthcare, presenting two significant challenges: data imbalance and \textit{hierarchy constraint}. Existing solutions involve complex model architecture design or domain-specific preprocessing, demanding considerable expertise or effort in implementation. To address these limitations, this paper proposes Transfer Learning with Maximum Constraint Module (TLMCM) network for the MI-HMC task. The TLMCM network offers a novel approach to overcome the aforementioned challenges, outperforming existing methods based on the Area Under the Average Precision and Recall Curve($AU\overline{(PRC)}$) metric. In addition, this research proposes two novel accuracy metrics, $EMR$ and $HammingAccuracy$, which have not been extensively explored in the context of the MI-HMC task. Experimental results demonstrate that the TLMCM network achieves high multi-label prediction accuracy($80\%$-$90\%$) for MI-HMC tasks, making it a valuable contribution to healthcare domain applications.

cs.CV↗

Scaling limits of self-conformal measures

We show that any self-conformal measure $μ$ on $\mathbb{R}$ is uniformly scaling and generates an ergodic fractal distribution. This generalizes existing results by removing the need for any separation condition. We also obtain applications to the prevalence of normal numbers in self-conformal sets, the resonance between self-conformal measures on the line, and projections of self-affine measures on carpets.

math.DS↗

The growth of 2D crystalline g-C3N4 films and the control of optoelectronic properties

g-C3N4 is a novel semiconductor photocatalyst material; however, the low specific surface area and rapid carrier compliance hinder its photocatalytic performance. On the other hand, the synthesis of 2D g-C3N4 with high crystallinity remains challenging. Here, we report the growth of 2D crystalline g-C3N4 films with thicknesses up to 100 nm on the indium tin oxide substrates by chemical vapor deposition. The films show high quality, as shown by scanning electron microscopy and X-ray diffraction, and exhibit intense fluorescence at room temperature. The optimal growth conditions, such as temperature and carrier gas flow rate, were achieved by analyzing their effects on the electronic structure through X-ray absorption spectra and X-ray photoelectron spectroscopy. By adding thiourea to the melamine precursors, we introduced N vacancies to achieve band gap modulation and promote carrier separation. This work provides guidelines for the further improvement of g-C3N4 performance and for extending its application in the field of photocatalytic devices.

physics.app-ph↗

Transmission and Distribution Coordination for DER-rich Energy Markets: A Parametric Programming Approach

In this paper, a framework is proposed to coordinate the operation of the independent system operator (ISO) and distribution system operator (DSO). The framework is compatible with current practice of the U.S. wholesale market to enable massive distributed energy resources (DERs) to participate in the wholesale market. The DSO builds a bid-in cost function to be submitted to the ISO market through parametric programming. Once the ISO clears the wholesale market, the dispatch and payment of the DSO are determined by ISO. Then, the DSO determines the dispatch and payment of the DER aggregators. To compare the proposed framework, an ideal case is defined in which DER aggregators can participate in the wholesale market directly and ISO overseas operation of both transmission and distribution systems. We proved 1) the dispatches of the proposed ISO-DSO coordination framework are identical to those of the ideal case; 2) the payments to each DER aggregator are identical in the proposed framework and in the ideal case. Case studies are performed on a small illustrative example as well as a large test system which includes IEEE 118 bus transmission system and two distribution systems - the IEEE 33 node and IEEE 240 node test systems.

eess.SY↗

Large slices through self affine carpets

Let $F\subseteq [0,1]^2$ be a Bedford-McMullen carpet defined by exponents $m>n$, that projects to $[0,1]$ on the $y$-axis. We show that under mild conditions on $F$, there are many non principle lines $\ell$ such that $\dim^* F\cap \ell = \dim^* F -1$, where $\dim^*$ is Furstenberg's star dimension (maximal dimension of a microset). This exhibits the sharpness of recent Furstenberg-type slicing theorems obtained by Algom (2020) about upper bounds on the dimension of every such slice.

math.DS↗

Detaching and Boosting: Dual Engine for Scale-Invariant Self-Supervised Monocular Depth Estimation

Monocular depth estimation (MDE) in the self-supervised scenario has emerged as a promising method as it refrains from the requirement of ground truth depth. Despite continuous efforts, MDE is still sensitive to scale changes especially when all the training samples are from one single camera. Meanwhile, it deteriorates further since camera movement results in heavy coupling between the predicted depth and the scale change. In this paper, we present a scale-invariant approach for self-supervised MDE, in which scale-sensitive features (SSFs) are detached away while scale-invariant features (SIFs) are boosted further. To be specific, a simple but effective data augmentation by imitating the camera zooming process is proposed to detach SSFs, making the model robust to scale changes. Besides, a dynamic cross-attention module is designed to boost SIFs by fusing multi-scale cross-attention features adaptively. Extensive experiments on the KITTI dataset demonstrate that the detaching and boosting strategies are mutually complementary in MDE and our approach achieves new State-of-The-Art performance against existing works from 0.097 to 0.090 w.r.t absolute relative error. The code will be made public soon.

cs.CV↗

A topological version of Furstenberg-Kesten theorem

Let $A(x): =(A_{i, j}(x))$ be a continuous function defined on some subshift of $Ω:= \{0,1, \cdots, m-1\}^\mathbb{N}$, taking $d\times d$ non-negative matrices as values and let $ν$ be an ergodic $σ$-invariant measure on the subshift where $σ$ is the shift map. Under the condition that $ A(x)A(σx)\cdots A(σ^{\ell-1} x)$ is a positive matrix for some point $ x$ in the support of $ν$ and some integer $\ell\ge 1$ and that every entry function $A_{i,j}(\cdot)$ is either identically zero or bounded from below by a positive number which is independent of $i$ and $j$, it is proved that for any $ν$-generic point $ω\in Ω$, the limit defining the Lyapunov exponent $\lim_{n\to \infty} n^{-1} \log \|A(ω) A(σω)\cdots A(σ^{n-1}ω)\|$ exists.

math.DS↗

Understanding Concurrency Vulnerabilities in Linux Kernel

While there is a large body of work on analyzing concurrency related software bugs and developing techniques for detecting and patching them, little attention has been given to concurrency related security vulnerabilities. The two are different in that not all bugs are vulnerabilities: for a bug to be exploitable, there needs be a way for attackers to trigger its execution and cause damage, e.g., by revealing sensitive data or running malicious code. To fill the gap, we conduct the first empirical study of concurrency vulnerabilities reported in the Linux operating system in the past ten years. We focus on analyzing the confirmed vulnerabilities archived in the Common Vulnerabilities and Exposures (CVE) database, which are then categorized into different groups based on bug types, exploit patterns, and patch strategies adopted by developers. We use code snippets to illustrate individual vulnerability types and patch strategies. We also use statistics to illustrate the entire landscape, including the percentage of each vulnerability type. We hope to shed some light on the problem, e.g., concurrency vulnerabilities continue to pose a serious threat to system security, and it is difficult even for kernel developers to analyze and patch them. Therefore, more efforts are needed to develop tools and techniques for analyzing and patching these vulnerabilities.

cs.CR↗

CMOS based high-resolution dynamic X-ray imaging with inorganic perovskite

High-resolution dynamic X-ray detector is crucial for time-resolved digital radiography (DR) imaging and fast 3D medical computed tomography (CT) imaging. Recently, perovskites have become promising alternatives to conventional semi-conductor materials, e.g., Si, a-Se and CdTe, for direct X-ray detection. However, the feasibility of their combination with high-speed pixelated complementary metal-oxide-semiconductor (CMOS) arrays remains unknown. This work originally reports an innovative direct-conversion X-ray detector fabricated with 300 micrometer thick inorganic perovskite film printed on a tailored CMOS array. In-house measurements demonstrate that the CsPbBr3 film has excellent optoelectric properties of an electron mobility-lifetime product of 3.40x10$^{-5}$ cm$^2$ V$^{-1}$, and the X-ray detector exhibits high sensitivity of 9341uC Gy$_{\rm air}^{-1}$ cm$^{-2}$, and low detection limit of 588 nGy$_{\rm air}^{-1}$. This CMOS X-ray imaging detector achieves a high spatial resolution up to 5.5 lp/mm (close to the resolution limit of 6.0 lp/mm), and >300 frame per second (fps) readout speed. DR image of a resolution pattern phantom and a anesthesia mice, CT images of a biological specimen are acquired for the first time.

physics.app-ph↗