arXiv subjects

Yong Wang

Publications and source records attributed to Yong Wang.

At least 199 records · Page 11Linked to original sources

arXiv2025

UPRE: Zero-Shot Domain Adaptation for Object Detection via Unified Prompt and Representation Enhancement

Zero-shot domain adaptation (ZSDA) presents substantial challenges due to the lack of images in the target domain. Previous approaches leverage Vision-Language Models (VLMs) to tackle this challenge, exploiting their zero-shot learning capabilities. However, these methods primarily address domain distribution shifts and overlook the misalignment between the detection task and VLMs, which rely on manually crafted prompts. To overcome these limitations, we propose the unified prompt and representation enhancement (UPRE) framework, which jointly optimizes both textual prompts and visual representations. Specifically, our approach introduces a multi-view domain prompt that combines linguistic domain priors with detection-specific knowledge, and a visual representation enhancement module that produces domain style variations. Furthermore, we introduce multi-level enhancement strategies, including relative domain distance and positive-negative separation, which align multi-modal representations at the image level and capture diverse visual representations at the instance level, respectively. Extensive experiments conducted on nine benchmark datasets demonstrate the superior performance of our framework in ZSDA detection scenarios. Code is available at https://github.com/AMAP-ML/UPRE.

cs.CV↗

arXiv2025

Envisage: Towards Expressive Visual Graph Querying

Graph querying is the process of retrieving information from graph data using specialized languages (e.g., Cypher), often requiring programming expertise. Visual Graph Querying (VGQ) streamlines this process by enabling users to construct and execute queries via an interactive interface without resorting to complex coding. However, current VGQ tools only allow users to construct simple and specific query graphs, limiting users' ability to interactively express their query intent, especially for underspecified query intent. To address these limitations, we propose Envisage, an interactive visual graph querying system to enhance the expressiveness of VGQ in complex query scenarios by supporting intuitive graph structure construction and flexible parameterized rule specification. Specifically, Envisage comprises four stages: Query Expression allows users to interactively construct graph queries through intuitive operations; Query Verification enables the validation of constructed queries via rule verification and query instantiation; Progressive Query Execution can progressively execute queries to ensure meaningful querying results; and Result Analysis facilitates result exploration and interpretation. To evaluate Envisage, we conducted two case studies and in-depth user interviews with 14 graph analysts. The results demonstrate its effectiveness and usability in constructing, verifying, and executing complex graph queries.

cs.HC↗

arXiv2025

Preserving spreading dynamics and information flow in complex network reduction

Effectively preserving both the structural and dynamical properties during the reduction of complex networks remains a significant research topic. Existing network reduction methods based on renormalization group or sampling often face challenges such as high computational complexity and the loss of critical dynamic attributes. This paper proposes an efficient network reduction framework based on subgraph extraction, which accurately preserves epidemic spreading dynamics and information flow through a coordinated optimization strategy of node removal and edge pruning. Specifically, a node removal algorithm driven by enhanced degree centrality is introduced to preferentially remove low-centrality nodes, thereby constructing a smaller-scale subnetwork. Subsequently, an edge pruning algorithm is designed to regulate the edge density of the subnetwork, ensuring that its average degree remains approximately consistent with that of the original network. Experimental results on Erdös-Rényi random graphs, Barabási-Albert scale-free networks, and real-world social contact networks from various domains demonstrate that this proposed method can reduce the size of networks with heterogeneous structures by more than 85\%, while preserving their epidemic dynamics and information flow. More importantly, our method almost always achieves the highest accuracy compared to state-of-the-art techniques. These findings provide valuable insights for predicting the dynamical behavior of large-scale real-world networks, and also reveal that a large number of nodes and edges in real-world networks play redundant roles in information transmission.

cs.SI↗

arXiv2025

The Einstein-Hilbert action for perturbed second-order spectral triples

In [6], the higher-order spectral triple and its relative K-homology were studied. Motivated by the Kastler-Kalau-Walze theorem, we propose an extension of the Einstein-Hilbert action to the framework of higher-order spectral triples. To illustrate this construction, we introduce two second-order spectral triples and explicitly compute their respective Einstein-Hilbert action, demonstrating the applicability of our theoretical framework.

math.KT↗

arXiv2025

SimVecVis: A Dataset for Enhancing MLLMs in Visualization Understanding

Current multimodal large language models (MLLMs), while effective in natural image understanding, struggle with visualization understanding due to their inability to decode the data-to-visual mapping and extract structured information. To address these challenges, we propose SimVec, a novel simplified vector format that encodes chart elements such as mark type, position, and size. The effectiveness of SimVec is demonstrated by using MLLMs to reconstruct chart information from SimVec formats. Then, we build a new visualization dataset, SimVecVis, to enhance the performance of MLLMs in visualization understanding, which consists of three key dimensions: bitmap images of charts, their SimVec representations, and corresponding data-centric question-answering (QA) pairs with explanatory chain-of-thought (CoT) descriptions. We finetune state-of-the-art MLLMs (e.g., MiniCPM and Qwen-VL), using SimVecVis with different dataset dimensions. The experimental results show that it leads to substantial performance improvements of MLLMs with good spatial perception capabilities (e.g., MiniCPM) in data-centric QA tasks. Our dataset and source code are available at: https://github.com/VIDA-Lab/SimVecVis.

cs.HC↗

arXiv2025

An H$α$ Cloud in the HI Tail: Recent Star Formation in the Outskirts of NGC 4258 Revealed by Nanshan 1-m Telescope

We present first-light deep H$α$ imaging taken with the Nanshan 1-meter wide-field telescope on the local galaxy NGC 4258, alongside archival data from Hubble Space telescope (HST), Westerbork Synthesis Radio Telescope, and The Dark Energy Camera Legacy Survey. The H$α$ image shows ongoing star formation not only inside the galaxy but also in an HI cloud in the eastern HI tail, which is roughly 16 kpc away from the main galaxy. The HST images reveal several ultra-blue compact objects ($\rm F555W - F814W <-0.5 mag,\, FWHM\sim 0.2''$) in the H$α$ bright region, aligned with the HI tail, suggesting the presence of young open cluster candidate in the HI tail. Our results suggest that wide field H$α$ imaging is a valuable tool for investigating recent star formation in the extended regions of NGC 4258. Furthermore, the star formation in diffuse HI tails could highlight an potential aspect of galaxy stellar halo formation, warranting further investigation of the impact of star formation in halos on galaxy evolution.

astro-ph.GA↗

arXiv2025

The noncommutative residue, divergence theorems and the spectral geometry functional

In this paper, a simple proof of the divergence theorem is given by using the Dirac operator and noncommutative residues. Then we extend the divergence theorem to compact manifolds with boundary by the noncommutative residue of the B-algebra. Furthermore, we present some spectral geometric functionals which we call spectral divergence functionals, and we calculate the spectral divergence functionals of manifolds with (or without) boundary.

math-ph↗

arXiv2025

Optimal decay of global strong solutions to nematic liquid crystal flows in the half-space

We study asymptotic behaviors of the higher-order spatial derivatives and the first-order time derivatives for the strong solution to nematic liquid crystal flows in the half-space $\mathbb{R}_+^3$. Furthermore, when the initial data lie in an appropriately weighted Sobolev space, we obtain the decay rates that are faster than the heat kernel. The main tools employed in this paper are the $L^p-L^q$ estimates of the Stokes semigroup, the a priori estimates of the steady Stokes system in $\mathbb{R}_+^3$, and the representation formula of the Leray projection operator.

math.AP↗

arXiv2025

Teaching in adverse scenes: a statistically feedback-driven threshold and mask adjustment teacher-student framework for object detection in UAV images under adverse scenes

Unsupervised Domain Adaptation (UDA) has shown promise in effectively alleviating the performance degradation caused by domain gaps between source and target domains, and it can potentially be generalized to UAV object detection in adverse scenes. However, existing UDA studies are based on natural images or clear UAV imagery, and research focused on UAV imagery in adverse conditions is still in its infancy. Moreover, due to the unique perspective of UAVs and the interference from adverse conditions, these methods often fail to accurately align features and are influenced by limited or noisy pseudo-labels. To address this, we propose the first benchmark for UAV object detection in adverse scenes, the Statistical Feedback-Driven Threshold and Mask Adjustment Teacher-Student Framework (SF-TMAT). Specifically, SF-TMAT introduces a design called Dynamic Step Feedback Mask Adjustment Autoencoder (DSFMA), which dynamically adjusts the mask ratio and reconstructs feature maps by integrating training progress and loss feedback. This approach dynamically adjusts the learning focus at different training stages to meet the model's needs for learning features at varying levels of granularity. Additionally, we propose a unique Variance Feedback Smoothing Threshold (VFST) strategy, which statistically computes the mean confidence of each class and dynamically adjusts the selection threshold by incorporating a variance penalty term. This strategy improves the quality of pseudo-labels and uncovers potentially valid labels, thus mitigating domain bias. Extensive experiments demonstrate the superiority and generalization capability of the proposed SF-TMAT in UAV object detection under adverse scene conditions. The Code is released at https://github.com/ChenHuyoo .

cs.CV↗

arXiv2025

Decay estimates for the compressible viscoelastic equations in an exterior domain

In this paper, we study the compressible viscoelastic equations in an exterior domain. We prove the $L_2$ estimates for the solution to the linearized problem and show the decay estimates for the solution to the nonlinear problem. In particular, we obtain the optimal decay rates of the solution itself and its spatial-time derivatives in the $L_2$-norm.

math.AP↗

arXiv2025

Inner fluctuations and the spectral Einstein functional

The spectral metric and Einstein functionals defined by two vector fields and Laplace-type operators over vector bundles, giving an interesting example of the spinor connection and square of the Dirac operator. Motivated by the spectral functionals and Dirac operators with inner fluctuations, we give some new spectral functionals which is the extension of spectral functionals for Dirac operators, and compute the spectral Einstein functional for the Dirac operator with inner fluctuations on even-dimensional spin manifolds without boundary.

math.DG↗

arXiv2025

The spectral torsion for the rescaled Dirac operator

In the paper, we give four different examples of the rescaled Dirac operator by the perturbation of the function f. Further, based on the trilinear Clifford multiplication by functional of differential one-forms, we compute the spectral torsion for four kinds of rescaled Dirac operator on even-dimensional oriented compact spin Riemannian manifolds without boundary.

math.DG↗

arXiv2025

A New Spatiotemporal Correlation Anomaly Detection Method that Integrates Contrastive Learning and Few-Shot Learning in Wireless Sensor Networks

Detecting anomalies in the data collected by WSNs can provide crucial evidence for assessing the reliability and stability of WSNs. Existing methods for WSN anomaly detection often face challenges such as the limited extraction of spatiotemporal correlation features, the absence of sample labels, few anomaly samples, and an imbalanced sample distribution. To address these issues, a spatiotemporal correlation detection model (MTAD-RD) considering both model architecture and a two-stage training strategy perspective is proposed. In terms of model structure design, the proposed MTAD-RD backbone network includes a retentive network (RetNet) enhanced by a cross-retention (CR) module, a multigranular feature fusion module, and a graph attention network module to extract internode correlation information. This proposed model can integrate the intermodal correlation features and spatial features of WSN neighbor nodes while extracting global information from time series data. Moreover, its serialized inference characteristic can remarkably reduce inference overhead. For model training, a two-stage training approach was designed. First, a contrastive learning proxy task was designed for time series data with graph structure information in WSNs, enabling the backbone network to learn transferable features from unlabeled data using unsupervised contrastive learning methods, thereby addressing the issue of missing sample labels in the dataset. Then, a caching-based sample sampler was designed to divide samples into few-shot and contrastive learning data. A specific joint loss function was developed to jointly train the dual-graph discriminator network to address the problem of sample imbalance effectively. In experiments carried out on real public datasets, the designed MTAD-RD anomaly detection method achieved an F1 score of 90.97%, outperforming existing supervised WSN anomaly detection methods.

cs.LG↗

arXiv2025

Three Kinds of Negation in Knowledge and Their Mathematical Foundations

In the field of artificial intelligence, understanding, distinguishing, expressing, and computing the negation in knowledge is a fundamental issue in knowledge processing and research. In this paper, we examine and analyze the understanding and characteristics of negation in various fields such as philosophy, logic, and linguistics etc. Based on the distinction between the concepts of contradiction and opposition, we propose that there are three different types of negation in knowledge from a conceptual perspective: contradictory negation, opposite negation, and intermediary negation. To establish a mathematical foundation that fully reflects the intrinsic connections, properties, and laws of these different forms of negation, we introduce SCOI: sets with contradictory negation, opposite negation and intermediary negation, and LCOI: logic with contradictory negation, opposite negation and intermediary negation, and we proved the main operational properties of SCOI as well as the formal inference relations in LCOI.

cs.AI↗

arXiv2025

The spectral torsion for the one form rescaled Dirac operator

The spectral torsion is defined by three vector fields and Dirac operators and the noncommutative residue. Motivated by the spectral torsion and the one form rescaled Dirac operator, we give some new spectral torsion which is the extension of spectral torsion for Dirac operators, and compute the spectral torsion for the one form rescaled Dirac operator on even-dimensional spin manifolds without boundary.

math.DG↗

arXiv2025

Knowledge-Aligned Counterfactual-Enhancement Diffusion Perception for Unsupervised Cross-Domain Visual Emotion Recognition

Visual Emotion Recognition (VER) is a critical yet challenging task aimed at inferring emotional states of individuals based on visual cues. However, existing works focus on single domains, e.g., realistic images or stickers, limiting VER models' cross-domain generalizability. To fill this gap, we introduce an Unsupervised Cross-Domain Visual Emotion Recognition (UCDVER) task, which aims to generalize visual emotion recognition from the source domain (e.g., realistic images) to the low-resource target domain (e.g., stickers) in an unsupervised manner. Compared to the conventional unsupervised domain adaptation problems, UCDVER presents two key challenges: a significant emotional expression variability and an affective distribution shift. To mitigate these issues, we propose the Knowledge-aligned Counterfactual-enhancement Diffusion Perception (KCDP) framework. Specifically, KCDP leverages a VLM to align emotional representations in a shared knowledge space and guides diffusion models for improved visual affective perception. Furthermore, a Counterfactual-Enhanced Language-image Emotional Alignment (CLIEA) method generates high-quality pseudo-labels for the target domain. Extensive experiments demonstrate that our model surpasses SOTA models in both perceptibility and generalization, e.g., gaining 12% improvements over the SOTA VER model TGCA-PVT. The project page is at https://yinwen2019.github.io/ucdver.

cs.CV↗

arXiv2025

METDrive: Multi-modal End-to-end Autonomous Driving with Temporal Guidance

Multi-modal end-to-end autonomous driving has shown promising advancements in recent work. By embedding more modalities into end-to-end networks, the system's understanding of both static and dynamic aspects of the driving environment is enhanced, thereby improving the safety of autonomous driving. In this paper, we introduce METDrive, an end-to-end system that leverages temporal guidance from the embedded time series features of ego states, including rotation angles, steering, throttle signals, and waypoint vectors. The geometric features derived from perception sensor data and the time series features of ego state data jointly guide the waypoint prediction with the proposed temporal guidance loss function. We evaluated METDrive on the CARLA leaderboard benchmarks, achieving a driving score of 70%, a route completion score of 94%, and an infraction score of 0.78.

cs.RO↗

arXiv2025

Enhanced timing of a 113 km O-TWTFT link with digital maximum likelihood estimation process

Optical two-way time-frequency transfer (O-TWTFT), employing linear optical sampling and based on frequency combs, is a promising approach for future large-scale optical clock synchronization. It offers the dual benefits of high temporal resolution and an extensive unambiguous range. A critical challenge in establishing long-distance free-space optical links is enhancing detection sensitivity. Particularly at ultra-low received power levels, the error caused by time extraction algorithms for linear optical sampling becomes a significant hindrance to system sensitivity, surpassing the constraints imposed by quantum limitations. In this work, we introduce the Complex Least Squares (CLS) method to enhance both the accuracy and sensitivity of time extraction. Unlike most previous methods that relied solely on phase information, our scheme utilizes a maximum likelihood estimation technique incorporating both amplitude and phase data. Our experiments, conducted over a 113 km free-space link with an average link loss of up to 100 dB, achieved a record minimum received power of 0.1 nW, which is over ten times lower than previous benchmarks. The precision also approaches the quantum limitation.

physics.optics↗