Searcharxiv⌕ Search

arXiv subjects

Yuan Zhang

Publications and source records attributed to Yuan Zhang.

At least 145 records · Page 8Linked to original sources

Design and fabrication of ultrasound linear array transducer used in ultrasound endoscope

This report details the successful construction of an ultrasound imaging platform and the design and fabrication of a novel ultrasound endoscope probe. The projects primary objective was to establish a functional system for acquiring and processing ultrasound signals, specifically targeting minimally invasive endoscopic applications. The ultrasound imaging platform was primarily designed and developed based on Texas Instruments (TI) Evaluation Modules (EVMs). It enables the transmission of 32-channel high-voltage signals and the reception of echo signals, with on-chip signal amplification and acquisition capabilities. Furthermore, the platform integrates a complete Time Gain Control (TGC) imaging path and a ContinuousWave Doppler (CWD) path. In conjunction with host computer software, it supports imaging with linear array, convex array, and phased array probes. Concurrently, a 64-element, 5MHz center frequency, phased array linear ultrasound endoscopic probe was designed, aiming for miniaturization and optimal imaging performance. The fabrication and assembly of its matching layer, backing layer, 2-2 piezoelectric composite material, and electrodes were completed.

physics.med-ph↗

MedReadCtrl: Personalizing medical text generation with readability-controlled instruction learning

Generative AI has demonstrated strong potential in healthcare, from clinical decision support to patient-facing chatbots that improve outcomes. A critical challenge for deployment is effective human-AI communication, where content must be both personalized and understandable. We introduce MedReadCtrl, a readability-controlled instruction tuning framework that enables LLMs to adjust output complexity without compromising meaning. Evaluations of nine datasets and three tasks across medical and general domains show that MedReadCtrl achieves significantly lower readability instruction-following errors than GPT-4 (e.g., 1.39 vs. 1.59 on ReadMe, p<0.001) and delivers substantial gains on unseen clinical tasks (e.g., +14.7 ROUGE-L, +6.18 SARI on MTSamples). Experts consistently preferred MedReadCtrl (71.7% vs. 23.3%), especially at low literacy levels. These gains reflect MedReadCtrl's ability to restructure clinical content into accessible, readability-aligned language while preserving medical intent, offering a scalable solution to support patient education and expand equitable access to AI-enabled care.

cs.CL↗

Superradiant Echoes Induced by Multiple Re-phasing of NV Spin Sub-ensembles Grating at Room Temperature

In this Letter, we propose that superradiant echoes can be achieved at room temperature by applying a laser illumination and a microwave Hahn echo sequence to a diamond with a high concentration of nitrogen-vacancy (NV) centers placed in a dielectric microwave cavity. We identify that the combined action of two microwave driving pulses and a free evolution imprints a phase grating among NV spin sub-ensembles in frequency space, and multiple re-phasing of the grated spin sub-ensembles leads to multiple superradiant echoes through a collective coupling with the cavity. Furthermore, we show that the superradiant echoes can be actively tailored with the microwave pulses and the laser illumination by modifying the grating parameters, and the multiple re-phasing dynamics is analogous to the one leading to superradiant beats in optical clock system. In the future, the spin sub-ensembles grating and the resulting echoes can be further optimized with dynamical decoupling, which might pave the way for applications in quantum sensing.

quant-ph↗

Beyond Attention or Similarity: Maximizing Conditional Diversity for Token Pruning in MLLMs

In multimodal large language models (MLLMs), the length of input visual tokens is often significantly greater than that of their textual counterparts, leading to a high inference cost. Many works aim to address this issue by removing redundant visual tokens. However, current approaches either rely on attention-based pruning, which retains numerous duplicate tokens, or use similarity-based pruning, overlooking the instruction relevance, consequently causing suboptimal performance. In this paper, we go beyond attention or similarity by proposing a novel visual token pruning method named CDPruner, which maximizes the conditional diversity of retained tokens. We first define the conditional similarity between visual tokens conditioned on the instruction, and then reformulate the token pruning problem with determinantal point process (DPP) to maximize the conditional diversity of the selected subset. The proposed CDPruner is training-free and model-agnostic, allowing easy application to various MLLMs. Extensive experiments across diverse MLLMs show that CDPruner establishes new state-of-the-art on various vision-language benchmarks. By maximizing conditional diversity through DPP, the selected subset better represents the input images while closely adhering to user instructions, thereby preserving strong performance even with high reduction ratios. When applied to LLaVA, CDPruner reduces FLOPs by 95\% and CUDA latency by 78\%, while maintaining 94\% of the original accuracy. Our code is available at https://github.com/Theia-4869/CDPruner.

cs.CV↗

L-2 Regularized maximum likelihood for $β$-model in large and sparse networks

The $β$-model is a powerful tool for modeling large and sparse networks driven by degree heterogeneity, where many network models become infeasible due to computational challenge and network sparsity. However, existing estimation algorithms for $β$-model do not scale up. Also, theoretical understandings remain limited to dense networks. This paper brings several significant improvements over existing results to address the urgent needs of practice. We propose a new $\ell_2$-penalized MLE algorithm that can comfortably handle sparse networks of millions of nodes with much-improved memory parsimony. We establish the first rate-optimal error bounds and high-dimensional asymptotic normality results for $β$-models, under much weaker network sparsity assumptions than best existing results. Application of our method to large COVID-19 network data sets discovered meaningful results.

stat.ME↗

Inverse Reinforcement Learning via Convex Optimization

We consider the inverse reinforcement learning (IRL) problem, where an unknown reward function of some Markov decision process is estimated based on observed expert demonstrations. In most existing approaches, IRL is formulated and solved as a nonconvex optimization problem, posing challenges in scenarios where robustness and reproducibility are critical. We discuss a convex formulation of the IRL problem (CIRL) initially proposed by Ng and Russel, and reformulate the problem such that the domain-specific language CVXPY can be applied directly to specify and solve the convex problem. We also extend the CIRL problem to scenarios where the expert policy is not given analytically but by trajectory as state-action pairs, which can be strongly inconsistent with optimality, by augmenting some of the constraints. Theoretical analysis and practical implementation for hyperparameter auto-selection are introduced. This note helps the users to easily apply CIRL for their problems, without background knowledge on convex optimization.

cs.LG↗

SparseVLM: Visual Token Sparsification for Efficient Vision-Language Model Inference

In vision-language models (VLMs), visual tokens usually bear a significant amount of computational overhead despite sparsity of information in them when compared to text tokens. To address this, most existing methods learn a network to prune redundant visual tokens using certain training data. Differently, we propose a text-guided training-free token optimization mechanism dubbed SparseVLM that eliminates the need of extra parameters or fine-tuning costs. Given that visual tokens complement text tokens in VLM's linguistic reasoning, we select relevant text tokens to rate the significance of visual tokens using self-attention matrices and, then, prune visual tokens using the proposed strategy to maximize sparsity while retaining information. In particular, we introduce a rank-based strategy to adaptively determine the sparsification ratio for each layer, alongside a token recycling method that compresses pruned tokens into more compact representations. Experimental results show that SparseVLM increases the efficiency of various VLMs in a number of image and video understanding tasks. For example, LLaVA when equipped with SparseVLM achieves 54% reduction in FLOPs, 37% decrease in CUDA latency while maintaining 97% of its original accuracy. Our code is available at https://github.com/Gumpest/SparseVLMs.

cs.CV↗

PathFL: Multi-Alignment Federated Learning for Pathology Image Segmentation

Pathology image segmentation across multiple centers encounters significant challenges due to diverse sources of heterogeneity including imaging modalities, organs, and scanning equipment, whose variability brings representation bias and impedes the development of generalizable segmentation models. In this paper, we propose PathFL, a novel multi-alignment Federated Learning framework for pathology image segmentation that addresses these challenges through three-level alignment strategies of image, feature, and model aggregation. Firstly, at the image level, a collaborative style enhancement module aligns and diversifies local data by facilitating style information exchange across clients. Secondly, at the feature level, an adaptive feature alignment module ensures implicit alignment in the representation space by infusing local features with global insights, promoting consistency across heterogeneous client features learning. Finally, at the model aggregation level, a stratified similarity aggregation strategy hierarchically aligns and aggregates models on the server, using layer-specific similarity to account for client discrepancies and enhance global generalization. Comprehensive evaluations on four sets of heterogeneous pathology image datasets, encompassing cross-source, cross-modality, cross-organ, and cross-scanner variations, validate the effectiveness of our PathFL in achieving better performance and robustness against data heterogeneity.

cs.CV↗

Data-Driven Existence and Design of Target Output Controllers

Target output controllers aim at regulating a system's target outputs by placing poles of a suitable subsystem using partial state feedback, where full state controllability is not required. This paper establishes existence conditions for such controllers using input and partial state data, where the system dynamics are unknown. The approach bypasses traditional system identification steps and leverages the intrinsic structure of historical data to certify controller existence and synthesize a suitable feedback gain. Analytical characterizations are provided, ensuring that the resulting closed-loop system satisfies desired performance objectives such as pole placement or stabilization. Data-driven algorithms are then proposed to design target output controllers directly from data without identifying system parameters, where controllers with the order matching the number of target outputs and with minimum-order augmented target outputs are both addressed. Furthermore, a separation principle is revealed, decoupling the design of target output controllers from state observers. This enables the development of data-driven observer-based controllers that integrate estimation and control. Numerical examples validate the theoretical results and demonstrate the efficacy of the proposed approach.

eess.SY↗

CXXCrafter: An LLM-Based Agent for Automated C/C++ Open Source Software Building

Project building is pivotal to support various program analysis tasks, such as generating intermediate rep- resentation code for static analysis and preparing binary code for vulnerability reproduction. However, automating the building process for C/C++ projects is a highly complex endeavor, involving tremendous technical challenges, such as intricate dependency management, diverse build systems, varied toolchains, and multifaceted error handling mechanisms. Consequently, building C/C++ projects often proves to be difficult in practice, hindering the progress of downstream applications. Unfortunately, research on facilitating the building of C/C++ projects remains to be inadequate. The emergence of Large Language Models (LLMs) offers promising solutions to automated software building. Trained on extensive corpora, LLMs can help unify diverse build systems through their comprehension capabilities and address complex errors by leveraging tacit knowledge storage. Moreover, LLM-based agents can be systematically designed to dynamically interact with the environment, effectively managing dynamic building issues. Motivated by these opportunities, we first conduct an empirical study to systematically analyze the current challenges in the C/C++ project building process. Particularly, we observe that most popular C/C++ projects encounter an average of five errors when relying solely on the default build systems. Based on our study, we develop an automated build system called CXXCrafter to specifically address the above-mentioned challenges, such as dependency resolution. Our evaluation on open-source software demonstrates that CXXCrafter achieves a success rate of 78% in project building. Specifically, among the Top100 dataset, 72 projects are built successfully by both CXXCrafter and manual efforts, 3 by CXXCrafter only, and 14 manually only. ...

cs.SE↗

STORYANCHORS: Generating Consistent Multi-Scene Story Frames for Long-Form Narratives

This paper introduces StoryAnchors, a unified framework for generating high-quality, multi-scene story frames with strong temporal consistency. The framework employs a bidirectional story generator that integrates both past and future contexts to ensure temporal consistency, character continuity, and smooth scene transitions throughout the narrative. Specific conditions are introduced to distinguish story frame generation from standard video synthesis, facilitating greater scene diversity and enhancing narrative richness. To further improve generation quality, StoryAnchors integrates Multi-Event Story Frame Labeling and Progressive Story Frame Training, enabling the model to capture both overarching narrative flow and event-level dynamics. This approach supports the creation of editable and expandable story frames, allowing for manual modifications and the generation of longer, more complex sequences. Extensive experiments show that StoryAnchors outperforms existing open-source models in key areas such as consistency, narrative coherence, and scene diversity. Its performance in narrative consistency and story richness is also on par with GPT-4o. Ultimately, StoryAnchors pushes the boundaries of story-driven frame generation, offering a scalable, flexible, and highly editable foundation for future research.

cs.CV↗

The Ripple Effect: On Unforeseen Complications of Backdoor Attacks

Recent research highlights concerns about the trustworthiness of third-party Pre-Trained Language Models (PTLMs) due to potential backdoor attacks. These backdoored PTLMs, however, are effective only for specific pre-defined downstream tasks. In reality, these PTLMs can be adapted to many other unrelated downstream tasks. Such adaptation may lead to unforeseen consequences in downstream model outputs, consequently raising user suspicion and compromising attack stealthiness. We refer to this phenomenon as backdoor complications. In this paper, we undertake the first comprehensive quantification of backdoor complications. Through extensive experiments using 4 prominent PTLMs and 16 text classification benchmark datasets, we demonstrate the widespread presence of backdoor complications in downstream models fine-tuned from backdoored PTLMs. The output distribution of triggered samples significantly deviates from that of clean samples. Consequently, we propose a backdoor complication reduction method leveraging multi-task learning to mitigate complications without prior knowledge of downstream tasks. The experimental results demonstrate that our proposed method can effectively reduce complications while maintaining the efficacy and consistency of backdoor attacks. Our code is available at https://github.com/zhangrui4041/Backdoor_Complications.

cs.CR↗

Quantifying the Spread of Online Incivility in Brazilian Politics

Incivility refers to behaviors that violate collective norms and disrupt cooperation within the political process. Although large-scale online data and automated techniques have enabled the quantitative analysis of uncivil discourse, prior research has predominantly focused on impoliteness or toxicity, often overlooking other behaviors that undermine democratic values. To address this gap, we propose a multidimensional conceptual framework encompassing Impoliteness, Physical Harm and Violent Political Rhetoric, Hate Speech and Stereotyping, and Threats to Democratic Institutions and Values. Using this framework, we measure the spread of online political incivility in Brazil using approximately 5 million tweets posted by 2,307 political influencers during the 2022 Brazilian general election. Through statistical modeling and network analysis, we examine the dynamics of uncivil posts at different election stages, identify key disseminators and audiences, and explore the mechanisms driving the spread of uncivil information online. Our findings indicate that impoliteness is more likely to surge during election campaigns. In contrast, the other dimensions of incivility are often triggered by specific violent events. Moreover, we find that left-aligned individual influencers are the primary disseminators of online incivility in the Brazilian Twitter/X sphere and that they disseminate not only direct incivility but also indirect incivility when discussing or opposing incivility expressed by others. They relay those content from politicians, media agents, and individuals to reach broader audiences, revealing a diffusion pattern mixing the direct and two-step flows of communication theory. This study offers new insights into the multidimensional nature of incivility in Brazilian politics and provides a conceptual framework that can be extended to other political contexts.

cs.SI↗

Complementary Collective Spin Descriptions of Superradiant Ramsey Spectroscopy

A recent experiment demonstrated delayed superradiance from strontium-88 atoms, which are coupled to a longitudinal mode of a cavity while being excited by laser pulses propagating along a transversal direction [Nat. Commun. 15, 1084 (2024)]. A coherent picture of the atomic ensemble dynamics in this experiment requires complementary representations of the external driving dynamics and the superradiant dynamics. To complement previous analyses, we introduce these representations by considering in-phase and out-of-phase superpositions of transverse collective spin components of two atomic sub-ensembles, and analyze the dynamics with the corresponding collective Dicke states and Bloch vectors. This approach also explains Ramsey spectroscopy experiments with the ensemble, and it may be employed to explore other phenomena, such as weak-to-strong coupling phase transitions and triggered superradiance.

quant-ph↗

Unique continuation for a gradient inequality with $L^n$ potential

We establish a unique continuation property for solutions of the differential inequality $|\nabla u|\leq V|u|$, where $V$ is locally $L^n$ integrable on a domain in $\mathbb R^n$. A stronger uniqueness result is obtained if in addition the solutions are locally Lipschitz. One application is a finite order vanishing property in the $L^2$ sense for the exponential of $W^{1,n}$ functions. We further discuss related results for the Cauchy-Riemann operator $\bar\partial$ and characterize the vanishing order for smooth extension of holomorphic functions across the boundary.

math.AP↗

Bridging Optical Sensing and Wearable Health Monitoring: A Functionalized Plasmonic Nanopillar for Non-Invasive Sweat Glucose Detection

Continuous glucose monitoring (CGM) is vital for diabetes care, but current systems rely on invasive implants or electrochemical sensors that often cause discomfort and skin irritation. Non-invasive alternatives remain limited by low sensitivity and poor compatibility with complex sweat environments, highlighting the urgent need for a comfortable and reliable solution. Here, we report the development of a wearable optical sensor watch that integrates surface plasmon resonance (SPR) technology with a functionalized silver-coated silicon nanowire (Ag/SiNW) substrate for real-time, non-invasive glucose monitoring in sweat. The nanostructured sensor is functionalized with 4-mercaptophenylboronic acid (4-MPBA), enabling selective glucose capture and optical signal transduction through both Raman scattering and SPR shift. The dual-mode detection strategy was systematically optimized, and a miniaturized SPR system operating at 638 nm was successfully integrated into a wearable watch format with wireless data transmission to a mobile application. This wearable device demonstrated excellent sensitivity (LOD down to 0.12 mM) and high selectivity in detecting glucose within physiological sweat concentration ranges. Human subject trials confirmed its applicability in real-life scenarios. This study offers a promising non-invasive alternative to traditional CGM and highlights the potential of integrating nanophotonic sensors with wearable platforms for continuous health monitoring and personalized medicine.

physics.optics↗

Non-quadratic solutions to the Monge-Ampère equation

We construct ample smooth strictly plurisubharmonic non-quadratic solutions to the Monge-Ampère equation on either cylindrical type domains or the whole complex Euclidean space $\mathbb C^2$. Among these, the entire solutions defined on $\mathbb C^2$ induce flat Kahler metrics, as expected by a question of Calabi. In contrast, those on cylindrical domains produce a family of nowhere flat Kahler metrics. Beyond these smooth solutions, we also classify solutions that are radially symmetric in one variable, which exhibit various types of singularities. Finally, we explore analogous solutions to Donaldson's equation motivated by a result of He.

math.CV↗

On solutions to $-Δu = V u$ near infinity

We investigate the unique continuation property and the sign changing behavior of weak solutions to $-Δu =Vu$ near infinity under certain conditions on the blow-up rate of the potential $V$ near infinity.

math.AP↗