Searcharxiv⌕ Search

arXiv subjects

Zhijun Zhang

Publications and source records attributed to Zhijun Zhang.

At least 19 recordsLinked to original sources

HINSPHERES: Spherically Symmetric Radiative Transfer Modeling of HINSA and the Radial HI-to-H$_2$ Transition in Molecular Clouds

The transition from atomic hydrogen (HI) to molecular hydrogen (H$_2$) is the first step in the evolution from diffuse interstellar gas to dense star-forming cores. HI narrow self-absorption (HINSA), produced by cold atomic gas mixed with molecular material, provides a direct tracer of the HI-to-H$_2$ transition in molecular clouds. Existing HINSA analyses typically model HINSA as a single Gaussian component with a uniform spin temperature. This approach cannot recover the radial HI distribution and yields large errors for young cores whose profiles deviate from a Gaussian shape. Here we present hinspheres, an open-source framework that models the core as onion-like spherically symmetric concentric shells, solves radiative transfer along the line of sight and jointly fits the HI abundance, temperature, and kinematic parameters. The framework recovers all parameters with a mean relative error of 4.6-6.8% on our synthetic data with different ages. A combined resolution-noise grid shows that the median recovery error remains below 16% for cores within 1 kpc observed at FAST resolution with noise levels below 0.2 K. Applying it to the dark cores L1574 and L1544, we reveal radial HI abundance profiles that span about three orders of magnitude, which were missed by the single-Gaussian method. The derived chemical ages are $6.5\times10^6$ and $8.7\times10^6$ yr, respectively. Compared with the commonly used single-Gaussian method, hinspheres characterizes the radial profile of HINSA structures more accurately, making it well suited to identifying and analyzing young cores undergoing the HI-to-H$_2$ transition.

astro-ph.GA↗

Settling Nondeterministic Communication Complexity of Graph Connectivity

Determining the communication complexity of graph connectivity has been one of the longest standing open problems in communication complexity since the seminal work of Babai, Frankl, and Simon [FOCS'86]. A simple protocol transmits a spanning forest using $O(N\log N)$ communication on $N$-vertex graphs. While this was shown optimal for deterministic protocols by Hajnal, Maass, and Turán [STOC'88], the optimal nondeterministic and randomized complexities have remained unresolved for decades. We settle the nondeterministic communication complexity of graph connectivity by proving an optimal $Ω(N\log N)$ lower bound. The best prior bound was $Ω(N\log\log N)$ due to Raz and Spieker [Combinatorica'95]. Our bound is shown by upper bounding the maximum size of $1$-monochromatic rectangles. Generalizing our techniques to weighted, almost $1$-monochromatic rectangles yields an $Ω(N \cdot \log(\min(1/\varepsilon,N)))$ lower bound for randomized protocols with error probability $\varepsilon$. In particular, this bound is optimal for any polynomially small $\varepsilon$. For constant error probability, we also prove that any $r$-round protocol requires $Ω(N/r \cdot \log N)$ communication, which is optimal for every constant $r$. Previously, optimal $Ω(N\log N)$ lower bounds for graph connectivity were known only for $1$-round [Sun, Woodruff; APPROX/RANDOM'15] and $2$-round protocols [Radhakrishnan, Reddy, Venkat; ITCS'26]. Our proof introduces a new communication problem which can be viewed as a composition of inner product and pointer chasing problems. Our lower bounds can be extended to other fundamental graph properties, and also imply optimality of known query and streaming algorithms for related problems.

cs.CC↗

Identifying the principal mechanism of star formation feedback

Feedback from massive stars regulates the formation of next-generation stars and planets and thus shapes the evolution of galaxies, yet observational evidence capable of determining which mechanism dominates the feedback process has long been lacking. Here,we present a large-scale HI survey toward Orion A$.$ With an unprecedented sensitivity and superior resolution, FAST (Five-hundred-meter Aperture Spherical radio Telescope) reveals a well-defined heart-shaped expanding HI bubble, enshrouding the well-known "Veil" bubble of ionized gas. The photoionization-driven and wind-driven gas expands at 10.9 and 13.8 kilometers per second, respectively, with a kinetic energy ratio of 1:2 assuming a spherical symmetry and a uniform HI-to-H2 ratio. This first direct comparison within a single bubble shows that radiation does not dominate the feedback process as predicted by classical theories; instead, stellar winds contribute a comparable share of the injected kinetic energy.

astro-ph.GA↗

Improving Synthetic Data Generation for Argument Mining via Adversarial Reinforcement Learning

Argument Mining (AM) is fundamentally constrained by the scarcity of high-quality structure-annotated datasets. While LLMs have shown promise in synthetic data generation, producing synthetic AM data that is both structurally accurate and sufficiently diverse remains a challenging problem. To address this problem, we revisit synthetic data generation for AM from a new perspective and propose a novel adversarial reinforcement learning framework for data synthesis. The proposed framework jointly optimizes the generator and the discriminator in an adversarial loop, in which the generator produces structured AM instances, and the discriminator provides learning signals by distinguishing real data from synthetic candidates. This enables the generator to progressively improve both the structural accuracy of generated argument data while maintaining diversity through adversarial feedback. Extensive experiments demonstrate that the proposed framework consistently improves AM performance on three benchmark datasets in both full-data and low-resource settings, validating its effectiveness and scalability.

cs.LG↗

High-Speed and High-Responsivity Asymmetric Waveguide Photodiode with Low Optical Back-Reflection

We numerically demonstrate an asymmetric corner-reflector uni-traveling-carrier waveguide photodiode (UTC-WGPD) that simultaneously suppresses optical back-reflection and breaks the bandwidth-responsivity trade-off. Off-center beam coupling introduces geometric asymmetry to eliminate retroreflection while maintaining efficient light trapping. 3D optoelectronic simulations reveal that at 1550 nm, a 15-μm^2 device exhibits a 275-GHz 3-dB bandwidth, 0.68-A/W responsivity (54.5% quantum efficiency), and -29-dB back-reflection, achieving a 150-GHz bandwidth-efficiency product. This design offers a scalable, low-reflection detection scheme for sub-terahertz transceivers and dense photonic integration.

physics.optics↗

Toward Metacognitive One-Shot Indirect Prompt Injection: Strategy Abstraction Via Outcome-Conditioned Reflection

Tool-using large language model (LLM) agents are vulnerable to indirect prompt injection (IPI), in which malicious instructions embedded in external observations manipulate subsequent agent decisions and actions. Most existing adaptive attacks rely on repeatedly querying and refining against the target agent, whereas realistic attackers may have only a single opportunity to interact with an unknown target agent. We propose SAVOR (Strategy Abstraction Via Outcome-Conditioned Reflection), which shifts attack adaptation from test-time iteration to offline strategy distillation. SAVOR performs outcome-conditioned reflection over successful and failed trajectories collected from disjoint training environments, validates context-conditioned candidate strategies, and iteratively consolidates them into a reusable strategy memory. At test time, the frozen memory guides the generation of a single payload for each unseen target, requiring only one target-agent query and no target-agent feedback. Across two benchmarks and three victim models, SAVOR attains the highest average attack success rate in all six settings, leading the strongest prior attack by 2.5 to 11.8 points and the same injection channel without strategy learning by 23.1 points on Agent Security Bench, which holds out attacker tools, and 28.6 points on OpenClaw-IPI, an executable benchmark we introduce that holds out attack goals and verifies attacks through tool interactions and execution receipts. A memory learned under one defense also transfers to another.

cs.CR↗

PC-Edit: Prompt-Contrastive Region Discovery and Region-Guided Editing

Replacing an object with one that differs in category or shape requires complete source removal, natural target formation unconstrained by the source silhouette, and preservation of unrelated content. Existing training-free editors either localize edits from terminal predictions under source and target prompts or preserve unrelated content through spatially unselective source-feature reuse without explicit region discovery. Before reaching the terminal predictions, prompt-induced semantic differences undergo additional network transformations that may obscure their spatial localization, reducing localization precision. Spatially unselective feature reuse forces a trade-off between edit completeness and background preservation. Therefore, we propose PC-Edit, a prompt-contrastive framework for training-free MM-DiT editing. PC-Edit contrasts the image-token attention outputs under the source and target prompts, capturing prompt-induced semantic differences directly where text-conditioned information is delivered to image tokens. The same contrast identifies a source-erasure region during inversion and a target-emergence region during denoising. Their union suppresses source remnants while allowing the target object to form naturally. PC-Edit further couples region discovery and background preservation within each sampling step by estimating the current edit region from preceding attention blocks and immediately injecting cached source K/V features outside it in subsequent blocks, thereby protecting unrelated content before the latent update. Experiments on PIE-Bench and our EditRegion-Bench, with human-verified edit-region annotations for single- and multi-object addition and replacement, show that PC-Edit achieves the best editing quality and background preservation among methods without user-specified edit regions.

cs.CV↗

UBG-Net: An Uncertainty-aware Bayesian Gating Network for Robust Audio-Visual Speech Recognition

Audio-Visual speech recognition systems often degrade in real-world scenarios due to signal corruption and distribution shifts. To address this, we propose a unified uncertainty-modeling framework, namely the uncertainty-aware Bayesian gating network (UBG-Net). UBG-Net features a Modality Uncertainty-aware Bayesian Fusion (MUBF) mechanism that injects signal-level aleatoric uncertainty into a Bayesian network to model epistemic uncertainty, thereby ensuring robust fusion of pre-trained backbone features. For inference, we introduce Distribution Uncertainty-aware Hierarchical Voting (DUHV) to select transcripts from Monte Carlo samples, prioritizing frequency and using inference scores in case of a tie. Experiments on the AVCocktail and LRS2 datasets demonstrate the overall superiority of UBG-Net compared to SOTA baselines. Ablation studies confirm that MUBF and DUHV effectively filter noise, enhancing fusion and decoding robustness.

eess.AS↗

AnchorDiff: Training-Free Concept Grounding for MM-DiTs via Anchor-Based Graph Propagation

Multi-Modal Diffusion Transformers (MM-DiTs) encode rich representations for training-free concept grounding, but existing attention-based methods often produce overlapping activations on visually confusable concepts, a failure mode we call concept leakage, where target responses spill over to non-target objects. To address this issue, we propose AnchorDiff, a training-free grounding method that decouples semantic localization from structural refinement. AnchorDiff selects a high-confidence anchor from concept-to-image attention map and propagates it as a one-hot seed over a hybrid graph derived from image-to-image self-attention. The graph uses output-space similarity for dense within-object propagation and a row-wise attention gate to suppress cross-object connections. Additionally, we introduce the Multi-Concept Confusion Dataset, which contains images with multiple visually similar concepts and separate masks, enabling explicit evaluation of concept leakage. Experiments show that AnchorDiff achieves strong grounding performance on ImageNet-Segmentation and PascalVOC, while substantially reducing concept leakage on our Multi-Concept Confusion Dataset.

cs.CV↗

Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness

All parallel algorithms for directed reachability and shortest paths crucially rely on efficient shortcut constructions. These constructions find directed paths and shortcut them by adding edges, with the goal to reduce the diameter of the graph. A long sequence of works has studied (efficient) shortcut constructions as well as impossibility results on the best diameter and therefore the best parallelism that can be achieved via this approach. This paper introduces a new conceptual tool for this line of research in the form of a simple and natural structural criterion: A shortcut $H$ for a graph $G$ is certified if for any shortcut edge $(u, v) \in H$, there exists a vertex $w$ such that the edges $(u, w)$ and $(w, v)$ are also in $G \cup H$. We show that this criterion captures constructiveness in the following sense: A shortcut $H$ can be constructed in $t$ time by repeatedly spending $\ell$ time on shortcutting a path of length $\ell$, if and only if, there exists a certified shortcut $H' \supseteq H$ of size $\tilde{O}(t)$. Furthermore, all known shortcut constructions with efficient algorithms can be extended to produce certified shortcuts of size $\tilde{O}(m)$. On the other hand, for shortcut constructions for which attempts to find efficient implementations have failed, we can show that this is impossible. We also obtain stronger diameter lower bounds for certified shortcuts and hopsets. For example, no certified shortcut construction with almost-linear size can reduce a graph's diameter below $n^{1/4-o(1)}$. This seems to be the best bound one can hope for with current techniques.

cs.DS↗

Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation

This paper significantly strengthens directed low-diameter decompositions in several ways. We define and give the first results for separated low-diameter decompositions in directed graphs, tighten and generalize probabilistic guarantees, and prove new independence results between (far away) edges. Our results are the first to give meaningful guarantees for decompositions with small diameters $D = Ω(\log\log n)$ in contrast to the state of the art that only applies to super-logarithmic diameters $D = ω(\log n)$. These results transfer several important and widely used aspects of undirected low-diameter decompositions to the directed setting. All our results are algorithmic -- small modifications to two existing directed low-diameter decompositions [BFHL25; Li25] can be used to sample decompositions with our new guarantees in near-linear time $\tilde{O}(m)$.

cs.DS↗

Polarization-controlled pattern formation in antiparallel dipolar binary condensates

We investigate non-equilibrium pattern formation in an antiparallel two-component dipolar Bose-Einstein condensate by varying the polarization angle and the trap aspect ratio. At finite tilt, the condensate supports stripe order. Quenching the angle to zero triggers a roton-assisted, mushroom-like corrugation that destroys translational order and drives the system into labyrinthine textures, whereas a slow linear ramp produces long-lived curved stripes that ultimately converge to labyrinths. Population imbalance strongly biases the evolution: the minority component preferentially fragments into a stable droplet array while the majority remains comparatively diffuse; once formed, the droplet crystal is robust under polarization hysteresis with largely reversible shape changes and unchanged lattice topology. The trap aspect ratio controls both the initial stripe number and the instability timescale, with tighter axial confinement accelerating corrugation and yielding denser labyrinths at late times. All behaviors arise within a quasi-two-dimensional mean-field regime where beyond-mean-field corrections are negligible; accordingly, the droplets reported here are not self-bound in free space. The observed textures (such as stripes, curved stripes, and labyrinths) mirror the taxonomy and instability pathways of nuclear "pasta" morphologies (rods and slabs) known from neutron-star and supernova matter, highlighting polarization angle, trap geometry, and population imbalance as practical, experimentally accessible controls for selecting and steering patterns in dipolar mixtures.

cond-mat.quant-gas↗

The Impact of Automation on Risk-Taking: The Role of Sense of Agency

Automation significantly alters human behavior, particularly risk-taking. Previous researches have paid limited attention to the underlying characteristics of automation and their mechanisms of influence on risk-taking. This study investigated how automation affects risk-taking and examined the role of sense of agency therein. By quantifying sense of agency through subjective ratings, this research explored the impact of automation level and reliability level on risk-taking. The results of three experiments indicated that automation reduced the level of risk-taking; higher automation level was associated with lower sense of agency and lower risk-taking, with sense of agency playing a complete mediating role; higher automation reliability was associated with higher sense of agency and higher risk-taking, with sense of agency playing a partial mediating role. The study concludes that automation influences risk-taking, such that higher automation level or lower reliability is associated with a lower likelihood of risk-taking. Sense of agency mediates the impact of automation on risk-taking, and automation level and reliability have different effects on risk-taking.

cs.HC↗

MEDebiaser: A Human-AI Feedback System for Mitigating Bias in Multi-label Medical Image Classification

Medical images often contain multiple labels with imbalanced distributions and co-occurrence, leading to bias in multi-label medical image classification. Close collaboration between medical professionals and machine learning practitioners has significantly advanced medical image analysis. However, traditional collaboration modes struggle to facilitate effective feedback between physicians and AI models, as integrating medical expertise into the training process via engineers can be time-consuming and labor-intensive. To bridge this gap, we introduce MEDebiaser, an interactive system enabling physicians to directly refine AI models using local explanations. By combining prediction with attention loss functions and employing a customized ranking strategy to alleviate scalability, MEDebiaser allows physicians to mitigate biases without technical expertise, reducing reliance on engineers, and thus enhancing more direct human-AI feedback. Our mechanism and user studies demonstrate that it effectively reduces biases, improves usability, and enhances collaboration efficiency, providing a practical solution for integrating medical expertise into AI-driven healthcare.

cs.HC↗

RIS Assisted Wireless Communication: Advanced Modeling, Simulation, and Analytical Insights

This article presents a novel perspective to model and simulate reconfigurable intelligent surface (RIS)-assisted communication systems. Traditional methods in antenna design often rely on array method to simulate, whereas communication system modeling tends to idealize antenna behavior. Neither approach sufficiently captures the detailed characteristics of RIS-assisted communication. To address this limitation, we propose a comprehensive simulation framework that jointly models RIS antenna design and the communication process. This framework simulates the entire communication pipeline, encompassing signal generation, modulation, propagation, RIS-based radiation, signal reception, alignment, demodulation, decision, and processing. Using a QPSK-modulated signal for validation, we analyze system performance and investigate the relationship between bit error rate (BER), aperture fill time, array size, and baseband symbol frequency. The results indicate that larger array sizes and higher baseband symbol frequencies exacerbate aperture fill time effects, leading to increased BER. Furthermore, we examine BER variation with respect to signal-to-noise ratio (SNR) and propose an optimal matching-based alignment algorithm, which significantly reduces BER compared to conventional pilot-based alignment methods. This work demonstrates the entire process of RIS communication, and reveals the source of bit errors, which provides valuable insights into the design and performance optimization of RIS-assisted communication systems.

physics.app-ph↗

Transient chirp reconstruction of electron beam via tightly focused chirped laser pulse

Controlling the phase space of particle beams is essential for the generation of high-quality, ultrashort electron beams in plasma-based accelerators. Accurately diagnosing the transient energy chirp, which evolves rapidly at the onset of acceleration, presents a significant challenge. This paper introduces a novel method for reconstructing the transient energy chirp of ultrashort electron beams by employing tightly focused and chirped laser pulses. We investigate the conditions that enhance the modulation of electron-beam divergence and illustrate the reconstruction of transient chirp based on the intrinsic phase correlation of the modulated divergence as projected onto specific phase space coordinates. Additionally, we estimate the temporal delay between the laser and electron beam by applying a Fourier transform to the reconstructed divergence modulation in the frequency domain. This approach holds promise for optimizing accelerator performance and facilitates the probing of timing jitter in ultrafast electron diffraction with attosecond-level precision.

physics.plasm-ph↗

EMOdiffhead: Continuously Emotional Control in Talking Head Generation via Diffusion

The task of audio-driven portrait animation involves generating a talking head video using an identity image and an audio track of speech. While many existing approaches focus on lip synchronization and video quality, few tackle the challenge of generating emotion-driven talking head videos. The ability to control and edit emotions is essential for producing expressive and realistic animations. In response to this challenge, we propose EMOdiffhead, a novel method for emotional talking head video generation that not only enables fine-grained control of emotion categories and intensities but also enables one-shot generation. Given the FLAME 3D model's linearity in expression modeling, we utilize the DECA method to extract expression vectors, that are combined with audio to guide a diffusion model in generating videos with precise lip synchronization and rich emotional expressiveness. This approach not only enables the learning of rich facial information from emotion-irrelevant data but also facilitates the generation of emotional videos. It effectively overcomes the limitations of emotional data, such as the lack of diversity in facial and background information, and addresses the absence of emotional details in emotion-irrelevant data. Extensive experiments and user studies demonstrate that our approach achieves state-of-the-art performance compared to other emotion portrait animation methods.

cs.CV↗

Brain-Conditional Multimodal Synthesis: A Survey and Taxonomy

In the era of Artificial Intelligence Generated Content (AIGC), conditional multimodal synthesis technologies (e.g., text-to-image, text-to-video, text-to-audio, etc) are gradually reshaping the natural content in the real world. The key to multimodal synthesis technology is to establish the mapping relationship between different modalities. Brain signals, serving as potential reflections of how the brain interprets external information, exhibit a distinctive One-to-Many correspondence with various external modalities. This correspondence makes brain signals emerge as a promising guiding condition for multimodal content synthesis. Brian-conditional multimodal synthesis refers to decoding brain signals back to perceptual experience, which is crucial for developing practical brain-computer interface systems and unraveling complex mechanisms underlying how the brain perceives and comprehends external stimuli. This survey comprehensively examines the emerging field of AIGC-based Brain-conditional Multimodal Synthesis, termed AIGC-Brain, to delineate the current landscape and future directions. To begin, related brain neuroimaging datasets, functional brain regions, and mainstream generative models are introduced as the foundation of AIGC-Brain decoding and analysis. Next, we provide a comprehensive taxonomy for AIGC-Brain decoding models and present task-specific representative work and detailed implementation strategies to facilitate comparison and in-depth analysis. Quality assessments are then introduced for both qualitative and quantitative evaluation. Finally, this survey explores insights gained, providing current challenges and outlining prospects of AIGC-Brain. Being the inaugural survey in this domain, this paper paves the way for the progress of AIGC-Brain research, offering a foundational overview to guide future work.

cs.AI↗