Searcharxiv⌕ Search

arXiv subjects

Qianqian Wu

Publications and source records attributed to Qianqian Wu.

8 recordsLinked to original sources

Self-avoiding trails in two and three dimensions

The self-avoiding trail is an important variant of the self-avoiding walk. In this work, we employ an irreversible Markov chain Monte Carlo algorithm, together with the reversible Berretti-Sokal algorithm for comparison, to simulate self-avoiding trails on the square and simple cubic lattices with periodic boundary conditions. Based on finite-size analyses of the unwrapped end-to-end distance and the Binder ratio, we accurately estimate the critical points on the simple cubic and square lattices to be 0.206\,376\,9(2) and 0.367\,561\,1(1), respectively, improving the precision of previous best estimates by factors of 500 and 70. At the estimated critical point of the simple cubic lattice, we numerically demonstrate that both the critical scaling behaviors of various quantities and the length distributions of self-avoiding trails and walks are consistent with each other. Our accurate numerical results are attributed to the efficiency of the irreversible algorithm, whose advantage over the reversible algorithm is even more pronounced for the self-avoiding trail model than for the self-avoiding walk model.

cond-mat.stat-mech↗

MinerU2.5-Pro: Pushing the Limits of Data-Centric Document Parsing at Scale

Current document parsing methods advance primarily through model architecture innovation, while systematic engineering of training data remains underexplored. Yet state-of-the-art models spanning diverse architectures and parameter scales exhibit highly consistent failure patterns on the same set of hard samples, suggesting that the performance bottleneck stems from shared deficiencies in training data rather than from architectural differences. Building on this finding, we present MinerU2.5-Pro, which advances the state of the art purely through data engineering and training strategy design while retaining the 1.2B-parameter architecture of MinerU2.5 unchanged. At its core is a Data Engine co-designed around coverage, informativeness, and annotation accuracy: Diversity-and-Difficulty-Aware Sampling expands training data from under 10M to 65.5M samples while mitigating distribution shift; Cross-Model Consistency Verification leverages output consensus among heterogeneous models to assess sample difficulty and generate reliable annotations; the Judge-and-Refine pipeline improves annotation quality for hard samples through render-then-verify iterative correction. A three-stage progressive training strategy--large-scale pre-training, hard sample fine-tuning, and GRPO alignment--sequentially exploits these data at different quality tiers. On the evaluation front, we rectify element-matching biases in OmniDocBench v1.5 and introduce a Hard subset, establishing the more discriminative OmniDocBench v1.6 protocol. Without any architectural modification, MinerU2.5-Pro achieves 95.69 on OmniDocBench v1.6, improving over the same-architecture baseline by 2.71 points and surpassing all existing methods, including those based on models with over 200x more parameters.

cs.CV↗

Bioluminescence tomography via a shape optimization method based on a complex-valued model

In this study, we investigate the inverse source problem arising in bioluminescence tomography, the objective of which is to reconstruct both the support and the intensity of an internal light source from boundary measurements governed by an elliptic model. A shape optimization framework is developed in which the source intensity and its support are decoupled through first-order optimality conditions. To enhance the stability of the reconstruction, we incorporate a parameter-dependent coupled complex boundary method together with perimeter and volume regularizations. Source support is represented by a level set function, allowing the algorithm to naturally accommodate topological changes and recover multiple, closely spaced, or nested source regions. Theoretical justifications for the proposed formulation and regularization strategy are established, and extensive numerical experiments are performed to assess the reconstruction accuracy for both noise-free and noisy data. The results demonstrate that our method achieves robust and accurate recovery of source geometry and intensity, and exhibits clear advantages over existing approaches.

math.NA↗

MinerU2.5: A Decoupled Vision-Language Model for Efficient High-Resolution Document Parsing

We introduce MinerU2.5, a 1.2B-parameter document parsing vision-language model that achieves state-of-the-art recognition accuracy while maintaining exceptional computational efficiency. Our approach employs a coarse-to-fine, two-stage parsing strategy that decouples global layout analysis from local content recognition. In the first stage, the model performs efficient layout analysis on downsampled images to identify structural elements, circumventing the computational overhead of processing high-resolution inputs. In the second stage, guided by the global layout, it performs targeted content recognition on native-resolution crops extracted from the original image, preserving fine-grained details in dense text, complex formulas, and tables. To support this strategy, we developed a comprehensive data engine that generates diverse, large-scale training corpora for both pretraining and fine-tuning. Ultimately, MinerU2.5 demonstrates strong document parsing ability, achieving state-of-the-art performance on multiple benchmarks, surpassing both general-purpose and domain-specific models across various recognition tasks, while maintaining significantly lower computational overhead.

cs.CV↗

DF4LCZ: A SAM-Empowered Data Fusion Framework for Scene-Level Local Climate Zone Classification

Recent advancements in remote sensing (RS) technologies have shown their potential in accurately classifying local climate zones (LCZs). However, traditional scene-level methods using convolutional neural networks (CNNs) often struggle to integrate prior knowledge of ground objects effectively. Moreover, commonly utilized data sources like Sentinel-2 encounter difficulties in capturing detailed ground object information. To tackle these challenges, we propose a data fusion method that integrates ground object priors extracted from high-resolution Google imagery with Sentinel-2 multispectral imagery. The proposed method introduces a novel Dual-stream Fusion framework for LCZ classification (DF4LCZ), integrating instance-based location features from Google imagery with the scene-level spatial-spectral features extracted from Sentinel-2 imagery. The framework incorporates a Graph Convolutional Network (GCN) module empowered by the Segment Anything Model (SAM) to enhance feature extraction from Google imagery. Simultaneously, the framework employs a 3D-CNN architecture to learn the spectral-spatial features of Sentinel-2 imagery. Experiments are conducted on a multi-source remote sensing image dataset specifically designed for LCZ classification, validating the effectiveness of the proposed DF4LCZ. The related code and dataset are available at https://github.com/ctrlovefly/DF4LCZ.

cs.CV↗

SAM-Assisted Remote Sensing Imagery Semantic Segmentation with Object and Boundary Constraints

Semantic segmentation of remote sensing imagery plays a pivotal role in extracting precise information for diverse down-stream applications. Recent development of the Segment Anything Model (SAM), an advanced general-purpose segmentation model, has revolutionized this field, presenting new avenues for accurate and efficient segmentation. However, SAM is limited to generating segmentation results without class information. Consequently, the utilization of such a powerful general vision model for semantic segmentation in remote sensing images has become a focal point of research. In this paper, we present a streamlined framework aimed at leveraging the raw output of SAM by exploiting two novel concepts called SAM-Generated Object (SGO) and SAM-Generated Boundary (SGB). More specifically, we propose a novel object loss and further introduce a boundary loss as augmentative components to aid in model optimization in a general semantic segmentation framework. Taking into account the content characteristics of SGO, we introduce the concept of object consistency to leverage segmented regions lacking semantic information. By imposing constraints on the consistency of predicted values within objects, the object loss aims to enhance semantic segmentation performance. Furthermore, the boundary loss capitalizes on the distinctive features of SGB by directing the model's attention to the boundary information of the object. Experimental results on two well-known datasets, namely ISPRS Vaihingen and LoveDA Urban, demonstrate the effectiveness of our proposed method. The source code for this work will be accessible at https://github.com/sstary/SSRS.

cs.CV↗

PolarDB-IMCI: A Cloud-Native HTAP Database System at Alibaba

Cloud-native databases have become the de-facto choice for mission-critical applications on the cloud due to the need for high availability, resource elasticity, and cost efficiency. Meanwhile, driven by the increasing connectivity between data generation and analysis, users prefer a single database to efficiently process both OLTP and OLAP workloads, which enhances data freshness and reduces the complexity of data synchronization and the overall business cost. In this paper, we summarize five crucial design goals for a cloud-native HTAP database based on our experience and customers' feedback, i.e., transparency, competitive OLAP performance, minimal perturbation on OLTP workloads, high data freshness, and excellent resource elasticity. As our solution to realize these goals, we present PolarDB-IMCI, a cloud-native HTAP database system designed and deployed at Alibaba Cloud. Our evaluation results show that PolarDB-IMCI is able to handle HTAP efficiently on both experimental and production workloads; notably, it speeds up analytical queries up to $\times149$ on TPC-H (100 $GB$). PolarDB-IMCI introduces low visibility delay and little performance perturbation on OLTP workloads (< 5%), and resource elasticity can be achieved by scaling out in tens of seconds.

cs.DB↗

Key parameters generation of the navigation data of GPS Simulator

The development of the GPS (Global Positioning System) signal simulator involving to a number of key technologies, in which the generation of navigation message has important significance. Based on analysis of the structure of GPS navigation data, the paper researches the production of telemetry word and handover word, parity check code, time parameters and star clock. Using disturbing force equation and Lagrange planetary motion equation extrapolate ephemeris parameters whose feasibility is verified through the Matlab software finally.

cs.IT↗