13 June 2011 in Physical Review A
We establish that if a scheme can control a time-independent system arbitrarily coupled to a generic finite bath over a short period of time with control precision , it can also realize the control with the same order of precision on smoothly time-dependent systems. This result extends the validity of various universal dynamical control schemes to arbitrary analytically time-dependent systems. DOI: http://dx.doi.org/10.1103/PhysRevA.83.062313 ©2011 American Physical Society
11 May 2022 in IEEE Access
Aiming at the problem that it takes too long to manually label numerous semantic segmentation data sets of vehicle images, a fast and effective vehicle image semantic segmentation data augmentation algorithm is proposed. Firstly, to solve the problem that traditional data augmentation algorithms are difficult to generate vehicle images and corresponding labels at the same time, a vehicle image semantic segmentation data augmentation algorithm based on FCN (Fully Convolutional Network) and GCIoU (Generally Contour Intersection over Union) is proposed, which can simultaneously generate vehicle images and corresponding labels. Then, aiming at the problem that some low-quality data exist in the generated dataset, a data set quality discriminator based on LQE (Label Quality Evaluation) head is proposed. The discriminator can distinguish between low-quality and high-quality label files. Finally, aiming at the problem that the excessive weight of the label file causes the calculation speed to decrease, a lightweight algorithm for the label file based on BAS-DP (Beetle Antennae Search Douglas-Peucker Algorithm) is proposed. The lightweight algorithm can greatly decrease parameters of the label file and improve availability of data-augmented results. Experimental results show that the proposed data augmentation algorithm is better than DCGAN (Deep Convolutional Generative Adversarial Networks), WGAN (Wasserstein Generative Adversarial Networks) and other data augmentation algorithms in accuracy. The AP50 and AP75 of the proposed algorithm reach 0.924 and 0.41, respectively. In addition, the proposed data augmentation algorithm still performs well in scenes with single-object, multi-object and ultra-multi-object. Simultaneously, the proposed data augmentation algorithm has three advantages, which are higher accuracy, faster speed, and less training data required.
27 October 2025 in PLOS ONE
To overcome the limitations of current bibliographic search systems, such as low semantic precision and inadequate handling of complex queries, this study introduces a novel conversational search framework for the Chinese bibliographic domain. Our approach makes several contributions. We first developed BibSQL, the first Chinese Text-to-SQL dataset for bibliographic metadata. Using this dataset, we built a two-stage conversational system that combines semantic retrieval of relevant question-SQL pairs with in-context SQL generation by large language models (LLMs). To enhance retrieval, we designed SoftSimMatch, a supervised similarity learning model that improves semantic alignment. We further refined SQL generation using a Program-of-Thoughts (PoT) prompting strategy, which guides the LLM to produce more accurate output by first creating Python pseudocode. Experimental results demonstrate the framework’s effectiveness. Retrieval-augmented generation (RAG) significantly boosts performance, achieving up to 96.6% execution accuracy. Our SoftSimMatch-enhanced RAG approach surpasses zero-shot prompting and random example selection in both semantic alignment and SQL accuracy. Ablation studies confirm that the PoT strategy and self-correction mechanism are particularly beneficial under low-resource conditions, increasing one model’s exact matching accuracy from 74.8% to 82.9%. While acknowledging limitations such as potential logic errors in complex queries and reliance on domain-specific knowledge, the proposed framework shows strong generalizability and practical applicability. By uniquely integrating semantic similarity learning, RAG, and PoT prompting, this work establishes a scalable foundation for future intelligent bibliographic retrieval systems and domain-specific Text-to-SQL applications.