Searcharxiv⌕ Search

arXiv subjects

Xiaodong Zhang

Publications and source records attributed to Xiaodong Zhang.

At least 37 records · Page 2Linked to original sources

The Safety Reminder: A Soft Prompt to Reactivate Delayed Safety Awareness in Vision-Language Models

As Vision-Language Models (VLMs) demonstrate increasing capabilities across real-world applications such as code generation and chatbot assistance, ensuring their safety has become paramount. Unlike traditional Large Language Models (LLMs), VLMs face unique vulnerabilities due to their multimodal nature, allowing adversaries to modify visual or textual inputs to bypass safety guardrails and trigger the generation of harmful content. Through systematic analysis of VLM behavior under attack, we identify a novel phenomenon termed ``delayed safety awareness''. Specifically, we observe that safety-aligned VLMs may initially be compromised to produce harmful content, but eventually recognize the associated risks and attempt to self-correct. This pattern suggests that VLMs retain their underlying safety awareness but experience a temporal delay in their activation. Building on this insight, we hypothesize that VLMs' safety awareness can be proactively reactivated through carefully designed prompts. To this end, we introduce ``The Safety Reminder'', a soft prompt tuning approach that optimizes learnable prompt tokens, which are periodically injected during the text generation process to enhance safety awareness, effectively preventing harmful content generation. Additionally, our safety reminder only activates when harmful content is detected, leaving normal conversations unaffected and preserving the model's performance on benign tasks. Through comprehensive evaluation across three established safety benchmarks and one adversarial attacks, we demonstrate that our approach significantly reduces attack success rates while maintaining model utility, offering a practical solution for deploying safer VLMs in real-world applications.

cs.AI↗

MSSDF: Modality-Shared Self-supervised Distillation for High-Resolution Multi-modal Remote Sensing Image Learning

Remote sensing image interpretation plays a critical role in environmental monitoring, urban planning, and disaster assessment. However, acquiring high-quality labeled data is often costly and time-consuming. To address this challenge, we proposes a multi-modal self-supervised learning framework that leverages high-resolution RGB images, multi-spectral data, and digital surface models (DSM) for pre-training. By designing an information-aware adaptive masking strategy, cross-modal masking mechanism, and multi-task self-supervised objectives, the framework effectively captures both the correlations across different modalities and the unique feature structures within each modality. We evaluated the proposed method on multiple downstream tasks, covering typical remote sensing applications such as scene classification, semantic segmentation, change detection, object detection, and depth estimation. Experiments are conducted on 15 remote sensing datasets, encompassing 26 tasks. The results demonstrate that the proposed method outperforms existing pretraining approaches in most tasks. Specifically, on the Potsdam and Vaihingen semantic segmentation tasks, our method achieved mIoU scores of 78.30\% and 76.50\%, with only 50\% train-set. For the US3D depth estimation task, the RMSE error is reduced to 0.182, and for the binary change detection task in SECOND dataset, our method achieved mIoU scores of 47.51\%, surpassing the second CS-MAE by 3 percentage points. Our pretrain code, checkpoints, and HR-Pairs dataset can be found in https://github.com/CVEO/MSSDF.

cs.CV↗

An Improved Finite Element Modeling Method for Triply Periodic Minimal Surface Structures Based on Element Size and Minimum Jacobian

Triply periodic minimal surface (TPMS) structures, a type of lattice structure, have garnered significant attention due to their lightweight nature, controllability, and excellent mechanical properties. Voxel-based modeling is a widely used method for investigating the mechanical behavior of such lattice structures through finite element simulations. This study proposes a two-parameter voxel method that incorporates joint control of element size and minimum Jacobian (MJ). Numerical results indicate that the simulation outcomes tend to stabilize when the MJ reaches 0.3. The grid convergence index (GCI), based on Richardson extrapolation, is introduced to systematically assess the numerical convergence behavior of both voxel models and the proposed two-parameter voxel models. This provides a systematic and objective framework for evaluating discretization errors and mesh convergence in TPMS modeling. Compared with traditional voxel method, the proposed method exhibits superior mesh convergence, solution accuracy, and computational efficiency. Furthermore, the two-parameter voxel method also shows excellent applicability in the analysis of graded TPMS structures, exhibiting even better convergence behavior than in uniform structures.

eess.SY↗

Logical Consistency is Vital: Neural-Symbolic Information Retrieval for Negative-Constraint Queries

Information retrieval plays a crucial role in resource localization. Current dense retrievers retrieve the relevant documents within a corpus via embedding similarities, which compute similarities between dense vectors mainly depending on word co-occurrence between queries and documents, but overlook the real query intents. Thus, they often retrieve numerous irrelevant documents. Particularly in the scenarios of complex queries such as \emph{negative-constraint queries}, their retrieval performance could be catastrophic. To address the issue, we propose a neuro-symbolic information retrieval method, namely \textbf{NS-IR}, that leverages first-order logic (FOL) to optimize the embeddings of naive natural language by considering the \emph{logical consistency} between queries and documents. Specifically, we introduce two novel techniques, \emph{logic alignment} and \emph{connective constraint}, to rerank candidate documents, thereby enhancing retrieval relevance. Furthermore, we construct a new dataset \textbf{NegConstraint} including negative-constraint queries to evaluate our NS-IR's performance on such complex IR scenarios. Our extensive experiments demonstrate that NS-IR not only achieves superior zero-shot retrieval performance on web search and low-resource retrieval tasks, but also performs better on negative-constraint queries. Our scource code and dataset are available at https://github.com/xgl-git/NS-IR-main.

cs.IR↗

On-Demand Scenario Generation for Testing Automated Driving Systems

The safety and reliability of Automated Driving Systems (ADS) are paramount, necessitating rigorous testing methodologies to uncover potential failures before deployment. Traditional testing approaches often prioritize either natural scenario sampling or safety-critical scenario generation, resulting in overly simplistic or unrealistic hazardous tests. In practice, the demand for natural scenarios (e.g., when evaluating the ADS's reliability in real-world conditions), critical scenarios (e.g., when evaluating safety in critical situations), or somewhere in between (e.g., when testing the ADS in regions with less civilized drivers) varies depending on the testing objectives. To address this issue, we propose the On-demand Scenario Generation (OSG) Framework, which generates diverse scenarios with varying risk levels. Achieving the goal of OSG is challenging due to the complexity of quantifying the criticalness and naturalness stemming from intricate vehicle-environment interactions, as well as the need to maintain scenario diversity across various risk levels. OSG learns from real-world traffic datasets and employs a Risk Intensity Regulator to quantitatively control the risk level. It also leverages an improved heuristic search method to ensure scenario diversity. We evaluate OSG on the Carla simulators using various ADSs. We verify OSG's ability to generate scenarios with different risk levels and demonstrate its necessity by comparing accident types across risk levels. With the help of OSG, we are now able to systematically and objectively compare the performance of different ADSs based on different risk levels.

cs.RO↗

Variational Autoencoder Framework for Hyperspectral Retrievals (Hyper-VAE) of Phytoplankton Absorption and Chlorophyll a in Coastal Waters for NASA's EMIT and PACE Missions

Phytoplankton absorb and scatter light in unique ways, subtly altering the color of water, changes that are often minor for human eyes to detect but can be captured by sensitive ocean color instruments onboard satellites from space. Hyperspectral sensors, paired with advanced algorithms, are expected to significantly enhance the characterization of phytoplankton community composition, especially in coastal waters where ocean color remote sensing applications have historically encountered significant challenges. This study presents novel machine learning-based solutions for NASA's hyperspectral missions, including EMIT and PACE, tackling high-fidelity retrievals of phytoplankton absorption coefficient and chlorophyll a from their hyperspectral remote sensing reflectance. Given that a single Rrs spectrum may correspond to varied combinations of inherent optical properties and associated concentrations, the Variational Autoencoder (VAE) is used as a backbone in this study to handle such multi-distribution prediction problems. We first time tailor the VAE model with innovative designs to achieve hyperspectral retrievals of aphy and of Chl-a from hyperspectral Rrs in optically complex estuarine-coastal waters. Validation with extensive experimental observation demonstrates superior performance of the VAE models with high precision and low bias. The in-depth analysis of VAE's advanced model structures and learning designs highlights the improvement and advantages of VAE-based solutions over the mixture density network (MDN) approach, particularly on high-dimensional data, such as PACE. Our study provides strong evidence that current EMIT and PACE hyperspectral data as well as the upcoming Surface Biology Geology mission will open new pathways toward a better understanding of phytoplankton community dynamics in aquatic ecosystems when integrated with AI technologies.

cs.LG↗

Ultrahigh room-temperature hole conductivity in a perovskite cuprate with vanishing electron-correlation

Electron-correlated two-dimensional (2D) cuprates have been extensively studied since the discovery of high-Tc superconductivity, in contrast, the three-dimensional (3D) counterpart perovskite cuprates remain largely unexplored due to their chemical instability and synthesis challenges. Herein, we develop an efficient two-step approach that combines symmetry-selective growth and topotactic oxidization to synthesize high-quality perovskite LaCuO3 films, and furthermore reveal its exotic electronic states. The compressively strained LaCuO3 films exhibit an unexpected ultrahigh p-type conductivity of ~1.5*10^5 S/cm with a hole mobility of ~30 cm2 V-1 s-1 at room-temperature. X-ray absorption spectra and first-principles calculations unveil a ligand-hole state of p-d hybridization with degenerate eg orbitals and light effective mass, indicating nearly-vanishing electron-correlation. These features contrast sharply with 2D cuprates and offer physical insights into the design of high-performance electronic devices.

cond-mat.str-el↗

Phase Stability Analysis of Volume-preserving Algorithms for Accurate Single Particle Orbit Simulations in Tokamak Plasmas

Second-order Volume-preserving algorithms (VPAs) for simulating charged particle motion in electromagnetic fields have been generalized to a rotating angle formulation by using the matrix decomposition methods. Based on this method, the phase stability of this class of VPAs has been analyzed by using the Discrete Fourier Transformations (DFT) technique. It is found that two prominent VPAs, namely the $G_h^2$ and the Boris algorithm, exhibit optimal phase precision for high-frequency (gyro motion) and low-frequency dynamics (transit/bounce motion), respectively. These findings have been empirically verified through numerical experiments. The insights gained from this study enable the selection of an appropriate VPA for practical simulations based on the characteristic frequencies of specific physics problems, which can substantially enhance numerical accuracy and improve computational efficiency for long-term simulations.

physics.plasm-ph↗

Solving Crystal Structures by Carrying Out the Calculation of the Single-Atom R1 Method in a Lottery Mode

As originally designed [Zhang & Donahue (2024), Acta Cryst. A80, 2370248.], after one cycle of calculation, the single-atom R1 (sR1) method required a user to intelligently determine a partial structure to start the next cycle. In this paper, a lottery scheme has been designed to randomly split a parent model into two child models. This allows the calculation to be carried out in care-free manner. By chance, one child model may have higher amounts of "good" atoms than the parent model. Thus, its expansion in the next cycle favors an improved model. These "lucky" results are carried onto the next cycles. while "unlucky" results in which no improvements occur are discarded. Furthermore, unchanged models are carried onto the next cycles in those "unlucky" occasions. On average a child model has the same fraction of "good" atoms as the parent. Only a substantial statistical fluctuation results in appreciable deviation. This lottery scheme works because such fluctuations do happen. Indeed, test applications with the computing power accessibly by the author have demonstrated that the designed scheme can drive an sR1 calculation to or close to reaching a correct structure solution.

physics.chem-ph↗

Simulated Bifurcation with High-dimensional Expansion for Traffic Signal Optimization on Real-world Networks

With accelerating urbanization and worsening traffic congestion, optimizing traffic signal systems to improve road throughput and alleviate congestion has become a critical issue. This study proposes a short-term traffic prediction model based on real-world road topologies and a typical four-way, eight-phase traffic signal control scheme. The model accounts for traffic flow disparities across directions and signal phase change frequencies, integrating these factors into an optimization objective for global traffic optimization. The structure of this objective function is similar to spin-glass systems in statistical physics. A Simulated Bifurcation optimization algorithm is introduced, with traditional simulated annealing as a benchmark. The results show that Simulated Bifurcation outperforms simulated annealing in both efficiency and effectiveness. Using real traffic flow and road network data from Beijing, we initialized the model and conducted numerical optimization experiments. The results indicate that Simulated Bifurcation significantly outperforms simulated annealing in computational efficiency, effectively solving combinatorial optimization problems with multiple spin interactions, and reducing the time complexity to $O(N^{1.35})$. This solution addresses the NP-hard problem of global traffic signal optimization. Importantly, the signal phase patterns generated by Simulated Bifurcation align with the operational requirements of real traffic signal systems, showcasing its potential in optimizing signal control for large, complex urban traffic networks. This work provides solid theoretical and practical foundations for future urban traffic management and intelligent transportation systems.

physics.soc-ph↗

Observation of prethermalization in weakly nonintegrable unitary maps

We investigate prethermalization by studying the statistical properties of the time-dependent largest Lyapunov exponent $Λ(t)$ for unitary-circuit maps upon approaching integrability. We follow the evolution of trajectories for different initial conditions and compute the mean $μ(t)$ and standard deviation $σ(t)$ of $Λ(t)$. Thermalization implies a temporal decay $σ\sim t^{-1/2}$ at a converged finite value of $μ$. We report prethermalization plateaus that persist for long times where both $μ$ and $σ$ appear to have converged to finite values, seemingly implying differing saturated Lyapunov exponent values for different trajectories. The lifetime of such plateaus furnishes a novel time scale characterizing the thermalization dynamics of many-body systems close to integrability. We also find that the plateaus converge to their respective thermal values for long enough times.

nlin.CD↗

Using Partial Structure R1 to Do Molecular Replacement Calculations

The concept of partial structure R1 (pR1) is a generalization of the concept of single atom R1 (sR1) (Zhang & Donahue, 2024). The hypothesis is that the deepest hole of a pR1 map determines the orientation and location of a missing fragment. In current implementation, the calculation is divided into two steps. The first step is to detect possible orientations of all missing fragments by the holes of a pR1 map of a free-standing fragment in a 3-dimensional orientation space. The second step is to determine the orientation and location of a missing fragment. To this end, if done strictly, all the candidate orientations are tried. With each candidate orientation, the best choice of location of the missing fragment is determined by the deepest hole of a pR1 map in a 3-dimensional location space. This best choice is combined with the trial orientation to form one candidate orientation-location. After trying all candidate orientations, a list of candidate orientation-locations are formed, from which, the one with the lowest R1 determines the orientation and location of a missing fragment. Then a newer pR1 is defined by including the atoms of this newly determined fragment into the known atoms. This newer pR1 is used to determine the next missing fragment in the same way. To shorten the calculation time, the possible locations of all missing fragments can be predicted by the holes of a pR1 map of a completely disoriented model of a fragment. All these ideas of using pR1 to do molecular replacement calculations have been demonstrated by four example data sets.

physics.data-an↗

Case Studies of Using the Partial-Structure R1 and the Single-Atom R1 to Assemble Small-Molecule Crystal Structures

This paper demonstrates how pre-knowledge of a crystal structure, including the constituent fragments, the atomic connectivity, and the approximate bond lengths, etc., can be utilized in the partial-structure R1 (pR1) and the single-atom R1 (sR1) calculations. It has been shown that taking advantage of pre-known information the calculations can proceed in an orderly and well-planned manner. Furthermore, in the case of the sR1 calculation, computer time can also be greatly reduced. Because the pR1 calculation is more time-consuming than the sR1 calculation, when there is a choice between the pR1 and the sR1, the former should be avoided. So, the usual strategy of assembling a light-atom-only structure should start with the normal sR1 method to determine a basic framework of the structure, and then uses the connectivity-guided sR1 method to complete the model. However, when the data resolution is low, the first step is necessary to use the pR1 method to assemble the known fragments. For a heavy-atom-containing structure, the correct strategy starts with the normal sR1 method to determine the heavy-atom substructure, and then uses the connectivity-guided sR1 to complete the model.

cond-mat.mtrl-sci↗

RTCUDB: Building Databases with RT Processors

A spectrum of new hardware has been studied to accelerate database systems in the past decade. Specifically, CUDA cores are known to benefit from the fast development of GPUs and make notable performance improvements. The state-of-the-art GPU-based implementation, i.e., Crystal, can achieve up to 61 times higher performance than CPU-based implementations. However, experiments show that the approach has already saturated almost all GPU memory bandwidth, which means there is little room left for further performance improvements. We introduce RTCUDB, the first query engine that leverages ray tracing (RT) cores in GPUs to accelerate database query processing. RTCUDB efficiently transforms the evaluation of a query into a ray-tracing job in a three-dimensional space. By dramatically reducing the amount of accessed data and optimizing the data access pattern with the ray tracing mechanism, the performance of RTCUDB is no longer limited by the memory bandwidth as in CUDA-based implementations. Experimental results show that RTCUDB outperforms the state-of-the-art GPU-based query engine by up to 18.3 times while the memory bandwidth usage drops to only 36.7% on average.

cs.DB↗

Integrated trucks assignment and scheduling problem with mixed service mode docks: A Q-learning based adaptive large neighborhood search algorithm

Mixed service mode docks enhance efficiency by flexibly handling both loading and unloading trucks in warehouses. However, existing research often predetermines the number and location of these docks prior to planning truck assignment and sequencing. This paper proposes a new model integrating dock mode decision, truck assignment, and scheduling, thus enabling adaptive dock mode arrangements. Specifically, we introduce a Q-learning-based adaptive large neighborhood search (Q-ALNS) algorithm to address the integrated problem. The algorithm adjusts dock modes via perturbation operators, while truck assignment and scheduling are solved using destroy and repair local search operators. Q-learning adaptively selects these operators based on their performance history and future gains, employing the epsilon-greedy strategy. Extensive experimental results and statistical analysis indicate that the Q-ALNS benefits from efficient operator combinations and its adaptive mechanism, consistently outperforming benchmark algorithms in terms of optimality gap and Pareto front discovery. In comparison to the predetermined service mode, our adaptive strategy results in lower average tardiness and makespan, highlighting its superior adaptability to varying demands.

cs.LG↗

BFA-YOLO: A balanced multiscale object detection network for building façade attachments detection

The detection of façade elements on buildings, such as doors, windows, balconies, air conditioning units, billboards, and glass curtain walls, is a critical step in automating the creation of Building Information Modeling (BIM). Yet, this field faces significant challenges, including the uneven distribution of façade elements, the presence of small objects, and substantial background noise, which hamper detection accuracy. To address these issues, we develop the BFA-YOLO model and the BFA-3D dataset in this study. The BFA-YOLO model is an advanced architecture designed specifically for analyzing multi-view images of façade attachments. It integrates three novel components: the Feature Balanced Spindle Module (FBSM) that tackles the issue of uneven object distribution; the Target Dynamic Alignment Task Detection Head (TDATH) that enhances the detection of small objects; and the Position Memory Enhanced Self-Attention Mechanism (PMESA), aimed at reducing the impact of background noise. These elements collectively enable BFA-YOLO to effectively address each challenge, thereby improving model robustness and detection precision. The BFA-3D dataset, offers multi-view images with precise annotations across a wide range of façade attachment categories. This dataset is developed to address the limitations present in existing façade detection datasets, which often feature a single perspective and insufficient category coverage. Through comparative analysis, BFA-YOLO demonstrated improvements of 1.8\% and 2.9\% in mAP$_{50}$ on the BFA-3D dataset and the public Façade-WHU dataset, respectively, when compared to the baseline YOLOv8 model. These results highlight the superior performance of BFA-YOLO in façade element detection and the advancement of intelligent BIM technologies.

cs.CV↗

GOVERN: Gradient Orientation Vote Ensemble for Multi-Teacher Reinforced Distillation

Pre-trained language models have become an integral component of question-answering systems, achieving remarkable performance. However, for practical deployment, it is crucial to perform knowledge distillation to maintain high performance while operating under computational constraints. In this paper, we address a key question: given the importance of unsupervised distillation for student model performance, how can knowledge from multiple teacher models be effectively ensemble during this stage without the guidance of labels? We propose a novel algorithm, GOVERN, to tackle this issue. GOVERN has demonstrated significant improvements in both offline and online experiments, enabling the student model to achieve results comparable to that of teacher ensembles. Our experiments show that GOVERN remarkably requires a mere 1\% of the ensemble method's inference budget to achieve 99.5\% of performance. The proposed algorithm has been successfully deployed in a real-world commercial question-answering system, demonstrating its real-world applicability.

cs.CL↗

S3Net: Innovating Stereo Matching and Semantic Segmentation with a Single-Branch Semantic Stereo Network in Satellite Epipolar Imagery

Stereo matching and semantic segmentation are significant tasks in binocular satellite 3D reconstruction. However, previous studies primarily view these as independent parallel tasks, lacking an integrated multitask learning framework. This work introduces a solution, the Single-branch Semantic Stereo Network (S3Net), which innovatively combines semantic segmentation and stereo matching using Self-Fuse and Mutual-Fuse modules. Unlike preceding methods that utilize semantic or disparity information independently, our method dentifies and leverages the intrinsic link between these two tasks, leading to a more accurate understanding of semantic information and disparity estimation. Comparative testing on the US3D dataset proves the effectiveness of our S3Net. Our model improves the mIoU in semantic segmentation from 61.38 to 67.39, and reduces the D1-Error and average endpoint error (EPE) in disparity estimation from 10.051 to 9.579 and 1.439 to 1.403 respectively, surpassing existing competitive methods. Our codes are available at:https://github.com/CVEO/S3Net.

cs.CV↗