Searcharxiv⌕ Search

arXiv subjects

Jun Liu

Publications and source records attributed to Jun Liu.

At least 253 records · Page 14Linked to original sources

Simulation of radiation environment for the beam monitor of CEE experiment

The cooling storage ring external-target experiment is a large-scale nuclear physics experiment, which aims to study the physics of heavy-ion collisions at low temperatures and high baryon densities. A beam monitor (BM) is placed in the beam line to monitor the beam status and to improve the reconstruction resolution of the primary vertices. The radiation dose and particle fluence stemming from the beam interactions with gases and detector materials affect the performance of the sensors and electronics of BM. This paper uses FLUKA Monte Carlo code to simulate the radiation environment of BM detector. Radiation quantities including the total ionizing dose, 1 MeV neutron equivalent fluence, high-energy hadron flux, thermal neutron flux, and nuclear fragment flux are presented. Results of alternative simulation setups, including adding shielding layers inside the BM, are also investigated.

physics.ins-det↗

Design and performance of the prototype gaseous beam monitor with GEM and pixel sensors for the CSR external-target experiment

A gaseous beam monitor utilizing gas electron multiplier (GEM) and pixel sensors is being developed for the Cooling Storage Ring (CSR) External-target Experiment (CEE) at Heavy Ion Research Facility in Lanzhou (HIRFL). The beam monitor is mainly used to track each beam particle, providing an accurate reconstruction of the primary vertex of the collision. Two generations of the pixel sensors (named Topmetal-CEE) were produced, with the second generation's performance improving over the first one. The design and performance of the prototype are described in the paper. Characterization of the prototype with heavy-ion beams and laser beams are presented, showing a spatial resolution better than 50 $\mum$ and a time resolution better than 15 ns.

physics.ins-det↗

Chirality-Driven Magnetization Emerges from Relativistic Four-Current Dynamics

Chirality-induced spin selectivity (CISS) is a striking quantum phenomenon in which electron transport through chiral molecules leads to spin polarization -- even in the absence of external magnetic fields or magnetic components. Although observed in systems such as DNA, helicenes, proteins, and polymers, the fundamental physical origin of CISS remains unresolved. Here, we introduce a time-dependent relativistic four-current framework, in which charge and current densities evolve according to the time-dependent variational principle. Real-time relativistic four-current simulations enable direct analysis of helical currents and induced magnetization dynamics. Applied to helicenes -- axially chiral molecules lacking stereocenters -- our simulations reveal curvature-induced helical electron currents that generate spontaneous magnetic fields aligned along the molecular axis. These fields are handedness-dependent and reach magnitudes of $10^{-1}$ Tesla per single helicene strand. Our results suggest that CISS may arise from intrinsic, relativistic curvature-induced helical currents and the associated magnetic fields within chiral molecules. This four-current mechanism offers a self-contained explanation for the driving force underlying spin selectivity, independent of interfacial effects or unphysically enhanced spin-orbit coupling. Furthermore, our results provide a new perspective that offers a unifying framework with the potential to reconcile many existing hypotheses and theoretical models, while also suggesting several testable predictions that can be examined experimentally.

cond-mat.mes-hall↗

High-order staggered Lagrangian hydrodynamics (II) : the artificial viscosity and hourglass control algorithm

In this article, we investigate the artificial viscosity and hourglass control algorithms for high-order staggered Lagrangian hydrodynamics(SGH), as proposed in~\cite[Sun et al., 2025]{Sun2025High}. Inspired by the subzonal pressure method in classical staggered Lagrangian hydrodynamics, we extend the stiffness-based hourglass control algorithm to the high-order setting, enriching the pressure field from the $Q^{m-1}$ to the $Q^{m}$ polynomial space. A unified framework for this hourglass control approach is established, from which the classical subzonal pressure method naturally emerges as the special case of the $Q^1-P^0$ space. The artificial viscosity follows the formulation in~\cite[Dobrev et al., 2012]{Dobrev2012High}. We show that the viscosity admits a concise form, with intermediate variables explicitly computable, leading to improved computational efficiency and easier implementation. Moreover, the tensor viscosity in classical staggered Lagrangian hydrodynamics can be derived in a similarly compact and explicit form. Numerical experiments on two-dimensional problems are presented to demonstrate the accuracy and efficiency of the proposed algorithms.

math.NA↗

Contradictions

Trustworthy AI requires reasoning systems that are not only powerful but also transparent and reliable. Automated Theorem Proving (ATP) is central to formal reasoning, yet classical binary resolution remains limited, as each step involves only two clauses and eliminates at most two literals. To overcome this bottleneck, the concept of standard contradiction and the theory of contradiction-separation-based deduction were introduced in 2018. This paper advances that framework by focusing on the systematic construction of standard contradictions. Specially, this study investigates construction methods for two principal forms of standard contradiction: the maximum triangular standard contradiction and the triangular-type standard contradiction. Building on these structures, we propose a procedure for determining the satisfiability and unsatisfiability of clause sets via maximum standard contradiction. Furthermore, we derive formulas for computing the number of standard sub-contradictions embedded within both the maximum triangular standard contradiction and the triangular-type standard contradiction. The results presented herein furnish the methodological basis for advancing contradiction-separation-based dynamic multi-clause automated deduction, thereby extending the expressive and deductive capabilities of automated reasoning systems beyond the classical binary paradigm.

cs.LO↗

Diagram-Driven Course Questions Generation

Visual Question Generation (VQG) research focuses predominantly on natural images while neglecting the diagram, which is a critical component in educational materials. To meet the needs of pedagogical assessment, we propose the Diagram-Driven Course Questions Generation (DDCQG) task and construct DiagramQG, a comprehensive dataset with 15,720 diagrams and 25,798 questions across 37 subjects and 371 courses. Our approach employs course and input text constraints to generate course-relevant questions about specific diagram elements. We reveal three challenges of DDCQG: domain-specific knowledge requirements across courses, long-tail distribution in course coverage, and high information density in diagrams. To address these, we propose the Hierarchical Knowledge Integration framework (HKI-DDCQG), which utilizes trainable CLIP for identifying relevant diagram patches, leverages frozen vision-language models for knowledge extraction, and generates questions with trainable T5. Experiments demonstrate that HKI-DDCQG outperforms existing models on DiagramQG while maintaining strong generalizability across natural image datasets, establishing a strong baseline for DDCQG.

cs.CV↗

Dual-Scale Volume Priors with Wasserstein-Based Consistency for Semi-Supervised Medical Image Segmentation

Despite signi cant progress in semi-supervised medical image segmentation, most existing segmentation networks overlook e ective methodological guidance for feature extraction and important prior information from datasets. In this paper, we develop a semi-supervised medical image segmentation framework that e ectively integrates spatial regularization methods and volume priors. Speci cally, our approach integrates a strong explicit volume prior at the image scale and Threshold Dynamics spatial regularization, both derived from variational models, into the backbone segmentation network. The target region volumes for each unlabeled image are estimated by a regression network, which e ectively regularizes the backbone segmentation network through an image-scale Wasserstein distance constraint, ensuring that the class ratios in the segmentation results for each unlabeled image match those predicted by the regression network. Additionally, we design a dataset-scale Wasserstein distance loss function based on a weak implicit volume prior, which enforces that the volume distribution predicted for the unlabeled dataset is similar to that of labeled dataset. Experimental results on the 2017 ACDC dataset, PROMISE12 dataset, and thigh muscle MR image dataset show the superiority of the proposed method.

cs.CV↗

AMCR: A Framework for Assessing and Mitigating Copyright Risks in Generative Models

Generative models have achieved impressive results in text to image tasks, significantly advancing visual content creation. However, this progress comes at a cost, as such models rely heavily on large-scale training data and may unintentionally replicate copyrighted elements, creating serious legal and ethical challenges for real-world deployment. To address these concerns, researchers have proposed various strategies to mitigate copyright risks, most of which are prompt based methods that filter or rewrite user inputs to prevent explicit infringement. While effective in handling obvious cases, these approaches often fall short in more subtle situations, where seemingly benign prompts can still lead to infringing outputs. To address these limitations, this paper introduces Assessing and Mitigating Copyright Risks (AMCR), a comprehensive framework which i) builds upon prompt-based strategies by systematically restructuring risky prompts into safe and non-sensitive forms, ii) detects partial infringements through attention-based similarity analysis, and iii) adaptively mitigates risks during generation to reduce copyright violations without compromising image quality. Extensive experiments validate the effectiveness of AMCR in revealing and mitigating latent copyright risks, offering practical insights and benchmarks for the safer deployment of generative models.

cs.LG↗

Statistical Physics of the Polarised IKKT Matrix Model

The polarised IKKT matrix model is the worldpoint theory of $N$ D-instantons in a background three-form flux of magnitude $Ω$, and promises to be a highly tractable model of holography. The matrix integral can be viewed as a statistical physics partition function with inverse temperature $Ω^4$. At large $Ω$ the model is dominated by a matrix configuration corresponding to a 'polarised' spherical D1-brane. We show that at a critical value of $Ω^2 N$ the model undergoes a first order phase transition, corresponding to tunneling into a collection of well-separated D-instantons. These instantons are the remnant of a competing saddle in the high $Ω$ phase corresponding to spherical $(p,q)$ fivebranes. We use a combination of numerical and analytical arguments to capture the different regimes of the model.

hep-th↗

Verifying Probabilistic Regions of Attraction with Neural Lyapunov Functions for Stochastic Systems

Leveraging a stochastic extension of Zubov's equation, we develop a physics-informed neural network (PINN) approach for learning a neural Lyapunov function that captures the largest probabilistic region of attraction (ROA) for stochastic systems. We then provide sufficient conditions for the learned neural Lyapunov functions that can be readily verified by satisfiability modulo theories (SMT) solvers, enabling formal verification of both local stability analysis and probabilistic ROA estimates. By solving Zubov's equation for the maximal Lyapunov function, our method provides more accurate and larger probabilistic ROA estimates than traditional sum-of-squares (SOS) methods. Numerical experiments on nonlinear stochastic systems validate the effectiveness of our approach in training and verifying neural Lyapunov functions for probabilistic stability analysis and ROA estimates.

math.OC↗

Generation of ultra-intense spatiotemporal optical vortex

Spatiotemporal optical vortex (STOV) with transverse orbital angular momentum (TOAM) can induce some novel properties in high energy density physics. However, the current STOV pulse energy is limited to the mJ level, which greatly hinders the development of the research field of relativistic laser-matter interaction. Combined with the large-scale grating pair in high-peak-power laser facility, the method for generating of STOV with ultra-high intensity up to 1021 W/cm2 is proposed. The numerical simulation proves that the wave packet with 60 fs duration and 83 J energy can be generated in the far field, maintaining an integral spatiotemporal vortex construction. Finally, STOVs with 1.1 mJ single pulse energy were obtained in a proof-of-principle experiment, and characterized by a home-made measuring device.

physics.optics↗

An Efficient and Adaptive Framework for Achieving Underwater High-performance Maintenance Networks

With the development of space-air-ground-aqua integrated networks (SAGAIN), high-speed and reliable network services are accessible at any time and any location. However, the long propagation delay and limited network capacity of underwater communication networks (UCN) negatively impact the service quality of SAGAIN. To address this issue, this paper presents U-HPNF, a hierarchical framework designed to achieve a high-performance network with self-management, self-configuration, and self-optimization capabilities. U-HPNF leverages the sensing and decision-making capabilities of deep reinforcement learning (DRL) to manage limited resources in UCNs, including communication bandwidth, computational resources, and energy supplies. Additionally, we incorporate federated learning (FL) to iteratively optimize the decision-making model, thereby reducing communication overhead and protecting the privacy of node observation information. By deploying digital twins (DT) at both the intelligent sink layer and aggregation layer, U-HPNF can mimic numerous network scenarios and adapt to varying network QoS requirements. Through a three-tier network design with two-levels DT, U-HPNF provides an AI-native high-performance underwater network. Numerical results demonstrate that the proposed U-HPNF framework can effectively optimize network performance across various situations and adapt to changing QoS requirements.

cs.NI↗

SAGE: Scale-Aware Gradual Evolution for Continual Knowledge Graph Embedding

Traditional knowledge graph (KG) embedding methods aim to represent entities and relations in a low-dimensional space, primarily focusing on static graphs. However, real-world KGs are dynamically evolving with the constant addition of entities, relations and facts. To address such dynamic nature of KGs, several continual knowledge graph embedding (CKGE) methods have been developed to efficiently update KG embeddings to accommodate new facts while maintaining learned knowledge. As KGs grow at different rates and scales in real-world scenarios, existing CKGE methods often fail to consider the varying scales of updates and lack systematic evaluation throughout the entire update process. In this paper, we propose SAGE, a scale-aware gradual evolution framework for CKGE. Specifically, SAGE firstly determine the embedding dimensions based on the update scales and expand the embedding space accordingly. The Dynamic Distillation mechanism is further employed to balance the preservation of learned knowledge and the incorporation of new facts. We conduct extensive experiments on seven benchmarks, and the results show that SAGE consistently outperforms existing baselines, with a notable improvement of 1.38% in MRR, 1.25% in H@1 and 1.6% in H@10. Furthermore, experiments comparing SAGE with methods using fixed embedding dimensions show that SAGE achieves optimal performance on every snapshot, demonstrating the importance of adaptive embedding dimensions in CKGE. The codes of SAGE are publicly available at: https://github.com/lyfxjtu/Dynamic-Embedding.

cs.AI↗

Traffic Load-Aware Resource Management Strategy for Underwater Wireless Sensor Networks

Underwater Wireless Sensor Networks (UWSNs) represent a promising technology that enables diverse underwater applications through acoustic communication. However, it encounters significant challenges including harsh communication environments, limited energy supply, and restricted signal transmission. This paper aims to provide efficient and reliable communication in underwater networks with limited energy and communication resources by optimizing the scheduling of communication links and adjusting transmission parameters (e.g., transmit power and transmission rate). The efficient and reliable communication multi-objective optimization problem (ERCMOP) is formulated as a decentralized partially observable Markov decision process (Dec-POMDP). A Traffic Load-Aware Resource Management (TARM) strategy based on deep multi-agent reinforcement learning (MARL) is presented to address this problem. Specifically, a traffic load-aware mechanism that leverages the overhear information from neighboring nodes is designed to mitigate the disparity between partial observations and global states. Moreover, by incorporating a solution space optimization algorithm, the number of candidate solutions for the deep MARL-based decision-making model can be effectively reduced, thereby optimizing the computational complexity. Simulation results demonstrate the adaptability of TARM in various scenarios with different transmission demands and collision probabilities, while also validating the effectiveness of the proposed approach in supporting efficient and reliable communication in underwater networks with limited resources.

cs.NI↗

Achieving Fair-Effective Communications and Robustness in Underwater Acoustic Sensor Networks: A Semi-Cooperative Approach

This paper investigates the fair-effective communication and robustness in imperfect and energy-constrained underwater acoustic sensor networks (IC-UASNs). Specifically, we investigate the impact of unexpected node malfunctions on the network performance under the time-varying acoustic channels. Each node is expected to satisfy Quality of Service (QoS) requirements. However, achieving individual QoS requirements may interfere with other concurrent communications. Underwater nodes rely excessively on the rationality of other underwater nodes when guided by fully cooperative approaches, making it difficult to seek a trade-off between individual QoS and global fair-effective communications under imperfect conditions. Therefore, this paper presents a SEmi-COoperative Power Allocation approach (SECOPA) that achieves fair-effective communication and robustness in IC-UASNs. The approach is distributed multi-agent reinforcement learning (MARL)-based, and the objectives are twofold. On the one hand, each intelligent node individually decides the transmission power to simultaneously optimize individual and global performance. On the other hand, advanced training algorithms are developed to provide imperfect environments for training robust models that can adapt to the time-varying acoustic channels and handle unexpected node failures in the network. Numerical results are presented to validate our proposed approach.

cs.NI↗

Joint link scheduling and power allocation in imperfect and energy-constrained underwater wireless sensor networks

Underwater wireless sensor networks (UWSNs) stand as promising technologies facilitating diverse underwater applications. However, the major design issues of the considered system are the severely limited energy supply and unexpected node malfunctions. This paper aims to provide fair, efficient, and reliable (FER) communication to the imperfect and energy-constrained UWSNs (IC-UWSNs). Therefore, we formulate a FER-communication optimization problem (FERCOP) and propose ICRL-JSA to solve the formulated problem. ICRL-JSA is a deep multi-agent reinforcement learning (MARL)-based optimizer for IC-UWSNs through joint link scheduling and power allocation, which automatically learns scheduling algorithms without human intervention. However, conventional RL methods are unable to address the challenges posed by underwater environments and IC-UWSNs. To construct ICRL-JSA, we integrate deep Q-network into IC-UWSNs and propose an advanced training mechanism to deal with complex acoustic channels, limited energy supplies, and unexpected node malfunctions. Simulation results demonstrate the superiority of the proposed ICRL-JSA scheme with an advanced training mechanism compared to various benchmark algorithms.

cs.NI↗

Exploiting Scale-Variant Attention for Segmenting Small Medical Objects

Early detection and accurate diagnosis can predict the risk of malignant disease transformation, thereby increasing the probability of effective treatment. Identifying mild syndrome with small pathological regions serves as an ominous warning and is fundamental in the early diagnosis of diseases. While deep learning algorithms, particularly convolutional neural networks (CNNs), have shown promise in segmenting medical objects, analyzing small areas in medical images remains challenging. This difficulty arises due to information losses and compression defects from convolution and pooling operations in CNNs, which become more pronounced as the network deepens, especially for small medical objects. To address these challenges, we propose a novel scale-variant attention-based network (SvANet) for accurately segmenting small-scale objects in medical images. The SvANet consists of scale-variant attention, cross-scale guidance, Monte Carlo attention, and vision transformer, which incorporates cross-scale features and alleviates compression artifacts for enhancing the discrimination of small medical objects. Quantitative experimental results demonstrate the superior performance of SvANet, achieving 96.12%, 96.11%, 89.79%, 84.15%, 80.25%, 73.05%, and 72.58% in mean Dice coefficient for segmenting kidney tumors, skin lesions, hepatic tumors, polyps, surgical excision cells, retinal vasculatures, and sperms, which occupy less than 1% of the image areas in KiTS23, ISIC 2018, ATLAS, PolypGen, TissueNet, FIVES, and SpermHealth datasets, respectively.

eess.IV↗

ST-GDance: Long-Term and Collision-Free Group Choreography from Music

Group dance generation from music has broad applications in film, gaming, and animation production. However, it requires synchronizing multiple dancers while maintaining spatial coordination. As the number of dancers and sequence length increase, this task faces higher computational complexity and a greater risk of motion collisions. Existing methods often struggle to model dense spatial-temporal interactions, leading to scalability issues and multi-dancer collisions. To address these challenges, we propose ST-GDance, a novel framework that decouples spatial and temporal dependencies to optimize long-term and collision-free group choreography. We employ lightweight graph convolutions for distance-aware spatial modeling and accelerated sparse attention for efficient temporal modeling. This design significantly reduces computational costs while ensuring smooth and collision-free interactions. Experiments on the AIOZ-GDance dataset demonstrate that ST-GDance outperforms state-of-the-art baselines, particularly in generating long and coherent group dance sequences. Project page: https://yilliajing.github.io/ST-GDance-Website/.

cs.AI↗