Search

We report on the first measurement of the elemental fragmentation cross sections (EFCSs) of $^{29-33}\mathrm{Si}$ on a carbon target at $\sim$230~MeV/nucleon. The experimental data covering charge changes of $\Delta Z$ = 1-4 are reproduced well by the isospin-dependent quantum molecular dynamics (IQMD) coupled with the evaporation GEMINI (IQMD+GEMINI) model. We further explore the mechanisms underlying the single-proton removal reaction in this model framework. We conclude that the cross sections from direct proton knockout exhibit a overall weak dependence on the mass number of $\mathrm{Si}$ projectiles. The proton evaporation induced after the projectile excitation significantly affects the cross sections for neutron-deficient $\mathrm{Si}$ isotopes, while neutron evaporation plays a crucial role in the reactions of neutron-rich $\mathrm{Si}$ isotopes. It is presented that the relative magnitude of one-proton and one-neutron separation energies is an essential factor that influences evaporation processes., Comment: 7 pages, 4 figures

This paper presents a general scheme for enhancing the convergence and performance of DETR (DEtection TRansformer). We investigate the slow convergence problem in transformers from a new perspective, suggesting that it arises from the self-attention that introduces no structural bias over inputs. To address this issue, we explore incorporating position relation prior as attention bias to augment object detection, following the verification of its statistical significance using a proposed quantitative macroscopic correlation (MC) metric. Our approach, termed Relation-DETR, introduces an encoder to construct position relation embeddings for progressive attention refinement, which further extends the traditional streaming pipeline of DETR into a contrastive relation pipeline to address the conflicts between non-duplicate predictions and positive supervision. Extensive experiments on both generic and task-specific datasets demonstrate the effectiveness of our approach. Under the same configurations, Relation-DETR achieves a significant improvement (+2.0% AP compared to DINO), state-of-the-art performance (51.7% AP for 1x and 52.1% AP for 2x settings), and a remarkably faster convergence speed (over 40% AP with only 2 training epochs) than existing DETR detectors on COCO val2017. Moreover, the proposed relation encoder serves as a universal plug-in-and-play component, bringing clear improvements for theoretically any DETR-like methods. Furthermore, we introduce a class-agnostic detection dataset, SA-Det-100k. The experimental results on the dataset illustrate that the proposed explicit position relation achieves a clear improvement of 1.3% AP, highlighting its potential towards universal object detection. The code and dataset are available at https://github.com/xiuqhou/Relation-DETR., Comment: Accepted to ECCV 2024

In this work, we introduce Speech-Copilot, a modular framework for instruction-oriented speech-processing tasks that minimizes human effort in toolset construction. Unlike end-to-end methods using large audio-language models, Speech-Copilot builds speech processing-specific toolsets by analyzing pre-collected task instructions and breaking tasks into manageable sub-tasks. It features a flexible agent based on large language models that performs tasks through program generation. Our approach achieves state-of-the-art performance on the Dynamic-SUPERB benchmark, demonstrating its effectiveness across diverse speech-processing tasks. Key contributions include: 1) developing an innovative framework for speech processing-specific toolset construction, 2) establishing a high-performing agent based on large language models, and 3) offering a new perspective on addressing challenging instruction-oriented speech-processing tasks. Without additional training processes required by end-to-end approaches, our method provides a flexible and extendable solution for a wide range of speech-processing applications., Comment: 8 pages, 2 figures

Deep learning-based end-to-end automatic speech recognition (ASR) has made significant strides but still struggles with performance on out-of-domain (OOD) samples due to domain shifts in real-world scenarios. Test-Time Adaptation (TTA) methods address this issue by adapting models using test samples at inference time. However, current ASR TTA methods have largely focused on non-continual TTA, which limits cross-sample knowledge learning compared to continual TTA. In this work, we propose a Fast-slow TTA framework for ASR, which leverages the advantage of continual and non-continual TTA. Within this framework, we introduce Dynamic SUTA (DSUTA), an entropy-minimization-based continual TTA method for ASR. To enhance DSUTA's robustness on time-varying data, we propose a dynamic reset strategy that automatically detects domain shifts and resets the model, making it more effective at handling multi-domain data. Our method demonstrates superior performance on various noisy ASR datasets, outperforming both non-continual and continual TTA baselines while maintaining robustness to domain changes without requiring domain boundary information., Comment: 13 pages

Large audio-language models (LALMs) enhance traditional large language models by integrating audio perception capabilities, allowing them to tackle audio-related tasks. Previous research has primarily focused on assessing the performance of LALMs across various tasks, yet overlooking their reliability, particularly concerning issues like object hallucination. In our study, we introduce methods to assess the extent of object hallucination of publicly available LALMs. Our findings reveal that LALMs are comparable to specialized audio captioning models in their understanding of audio content, but struggle to answer discriminative questions, specifically those requiring the identification of the presence of particular object sounds within an audio clip. This limitation highlights a critical weakness in current LALMs: their inadequate understanding of discriminative queries. Moreover, we explore the potential of prompt engineering to enhance LALMs' performance on discriminative questions., Comment: Accepted to Interspeech 2024

Video moment retrieval and highlight detection are two highly valuable tasks in video understanding, but until recently they have been jointly studied. Although existing studies have made impressive advancement recently, they predominantly follow the data-driven bottom-up paradigm. Such paradigm overlooks task-specific and inter-task effects, resulting in poor model performance. In this paper, we propose a novel task-driven top-down framework TaskWeave for joint moment retrieval and highlight detection. The framework introduces a task-decoupled unit to capture task-specific and common representations. To investigate the interplay between the two tasks, we propose an inter-task feedback mechanism, which transforms the results of one task as guiding masks to assist the other task. Different from existing methods, we present a task-dependent joint loss function to optimize the model. Comprehensive experiments and in-depth ablation studies on QVHighlights, TVSum, and Charades-STA datasets corroborate the effectiveness and flexibility of the proposed framework. Codes are available at https://github.com/EdenGabriel/TaskWeave.

DETR-like methods have significantly increased detection performance in an end-to-end manner. The mainstream two-stage frameworks of them perform dense self-attention and select a fraction of queries for sparse cross-attention, which is proven effective for improving performance but also introduces a heavy computational burden and high dependence on stable query selection. This paper demonstrates that suboptimal two-stage selection strategies result in scale bias and redundancy due to the mismatch between selected queries and objects in two-stage initialization. To address these issues, we propose hierarchical salience filtering refinement, which performs transformer encoding only on filtered discriminative queries, for a better trade-off between computational efficiency and precision. The filtering process overcomes scale bias through a novel scale-independent salience supervision. To compensate for the semantic misalignment among queries, we introduce elaborate query refinement modules for stable two-stage initialization. Based on above improvements, the proposed Salience DETR achieves significant improvements of +4.0% AP, +0.2% AP, +4.4% AP on three challenging task-specific detection datasets, as well as 49.2% AP on COCO 2017 with less FLOPs. The code is available at https://github.com/xiuqhou/Salience-DETR., Comment: Accepted to CVPR 2024

Beam misalignment is one of the main challenges for the design of reliable wireless systems in terahertz (THz) bands. This paper investigates how to apply user-centric base station (BS) clustering as a valuable add-on in THz networks. In particular, to reduce the impact of beam misalignment, a user-centric BS clustering design that provides multi-connectivity via BS cooperation is investigated. The coverage probability is derived by leveraging an accurate approximation of the aggregate interference distribution that captures the effect of beam misalignment and THz fading. The numerical results reveal the impact of beam misalignment with respect to crucial link parameters, such as the transmitter's beam width and the serving cluster size, demonstrating that user-centric BS clustering is a promising enabler of THz networks.

Age verification, which is a mandatory legal requirement for delivering certain age-appropriate services or products, has recently been emphasized around the globe to ensure online safety for children. The rapid advancement of artificial intelligence has facilitated the recent development of some cutting-edge age-verification technologies, particularly using biometrics. However, successful deployment and mass acceptance of these technologies are significantly dependent on the corresponding socio-economic and regulatory context. This paper reviews such key dynamics for improvising age-verification technologies in Canada. It is particularly essential for such technologies to be inclusive, transparent, adaptable, privacy-preserving, and secure. Effective collaboration between academia, government, and industry entities can help to meet the growing demands for age-verification services in Canada while maintaining a user-centric approach., Comment: Presented and accepted for publication in the 2023 IEEE International Humanitarian Technologies Conference (IEEE IHTC 2023), November 1 to 3, 2023, Cartagena, Colombia

This paper presents an effective transfer learning framework for language adaptation in text-to-speech systems, with a focus on achieving language adaptation using minimal labeled and unlabeled data. While many works focus on reducing the usage of labeled data, very few consider minimizing the usage of unlabeled data. By utilizing self-supervised features in the pretraining stage, replacing the noisy portion of pseudo labels with these features during fine-tuning, and incorporating an embedding initialization trick, our method leverages more information from unlabeled data compared to conventional approaches. Experimental results show that our framework is able to synthesize intelligible speech in unseen languages with only 4 utterances of labeled data and 15 minutes of unlabeled data. Our methodology continues to surpass conventional techniques, even when a greater volume of data is accessible. These findings highlight the potential of our data-efficient language adaptation framework., Comment: Accepted by ASRU 2023

We reveal that the criticality of the chiral phase transition in QCD at the macroscale arises from the microscopic energy levels of its fundamental constituents, the quarks. We establish a novel relation between cumulants of the chiral order parameter (i.e., chiral condensate) and correlations among the energy levels of quarks (i.e., eigenspectra of the massless Dirac operator), which naturally leads to a generalization of the Banks-Casher relation. Based on this novel relation and through (2+1)-flavor lattice QCD calculations using the HISQ action with varying light quark masses in the vicinity of the chiral phase transition, we demonstrate that the correlations among the infrared part of the Dirac eigenspectra exhibit same universal scaling behaviors as expected of the cumulants of the chiral condensate. We find that these universal scaling behaviors extend up to the physical values of the up and down quark masses., Comment: 4 pages, 2 figures, talk presented at the 30th International Conference on Ultra-relativistic Nucleus-Nucleus Collisions (Quark Matter 2023), September 3-9, 2023, Houston, Texas, USA. arXiv admin note: text overlap with arXiv:2401.10263

We reveal that the universal scaling properties of the chiral phase transition in quantum chromodynamics (QCD) at the macroscale are, in fact, encoded within the microscopic energy levels of its fundamental constituents, the quarks. We introduce a novel relation between the cumulants of the chiral order parameter, i.e., the chiral condensate, and the correlations among the energy levels of quarks, i.e., the eigenspectra of the massless QCD Dirac operator. This relation elucidates how the fluctuations of the chiral condensate arise from the correlations within the infrared part of the energy spectra of quarks, and naturally leads to a generalization of the Banks-Casher relation for the cumulants of the chiral condensate. Then, through (2+1)-flavor lattice QCD calculations using HISQ action with varying light quark masses around the chiral phase transition temperature, we demonstrate that the correlations among the infrared part of the Dirac eigenvalue spectra exhibit same universal scaling behaviors as expected of the cumulants of the chiral condensate. We find that these universal scaling behaviors extend up to the physical values of the up and down quark masses., Comment: 9 pages, 3 figures, talk presented at the 40th International Symposium on Lattice Field Theory (Lattice2023), July 31st - August 4th, 2023, Fermi National Accelerator Laboratory

Let $G$ be a reductive group acting on an affine scheme $V$. We study the set of principal $G$-bundles on a smooth projective curve $\mathcal C$ such that the associated $V$-bundle admits a section sending the generic point of $\mathcal C$ into the GIT stable locus $V^{\mathrm{s}}(\theta)$. We show that after fixing the degree of the line bundle induced by the character $\theta$, the set of such principal $G$-bundles is bounded. The statement of our theorem is made slightly more general so that we deduce from it the boundedness for $\epsilon$-stable quasimaps and $\Omega$-stable LG-quasimap., Comment: 16 pages, bibliography updated

The theory of Mixed-Spin-P (MSP) fields was introduced by Chang-Li-Li-Liu for the quintic threefold, aiming at studying its higher-genus Gromov-Witten invariants. Chang-Guo-Li has successfully applied it to prove conjectures on the higher-genus Gromov-Witten invariants, including the BCOV Feynman rule and Yamaguchi-Yau's polynomiality conjecture. This paper generalizes the MSP fields construction to more general GIT quotients, including global complete intersection Calabi-Yau manifolds in toric varieties. This hopefully provides a geometric platform to effectively compute higher-genus Gromov-Witten invariants for complete intersections in toric varieties. The key to our paper is a stability condition which guarantees the separatedness and properness of the cosection degeneracy locus in the moduli. It also gives a mathematical definitions for more general Landau-Ginzburg theories., Comment: 46 pages, bibliography updated

The 2023 Multilingual Speech Universal Performance Benchmark (ML-SUPERB) Challenge expands upon the acclaimed SUPERB framework, emphasizing self-supervised models in multilingual speech recognition and language identification. The challenge comprises a research track focused on applying ML-SUPERB to specific multilingual subjects, a Challenge Track for model submissions, and a New Language Track where language resource researchers can contribute and evaluate their low-resource language data in the context of the latest progress in multilingual speech recognition. The challenge garnered 12 model submissions and 54 language corpora, resulting in a comprehensive benchmark encompassing 154 languages. The findings indicate that merely scaling models is not the definitive solution for multilingual speech tasks, and a variety of speech/voice types present significant challenges in multilingual speech processing., Comment: Accepted by ASRU

Speech enhancement is a demanding task in automated speech processing pipelines, focusing on separating clean speech from noisy channels. Transformer based models have recently bested RNN and CNN models in speech enhancement, however at the same time they are much more computationally expensive and require much more high quality training data, which is always hard to come by. In this paper, we present an improvement for speech enhancement models that maintains the expressiveness of self-attention while significantly reducing model complexity, which we have termed Spectrum Attention Fusion. We carefully construct a convolutional module to replace several self-attention layers in a speech Transformer, allowing the model to more efficiently fuse spectral features. Our proposed model is able to achieve comparable or better results against SOTA models but with significantly smaller parameters (0.58M) on the Voice Bank + DEMAND dataset.

This paper emphasizes the importance of reporting experiment details in subjective evaluations and demonstrates how such details can significantly impact evaluation results in the field of speech synthesis. Through an analysis of 80 papers presented at INTERSPEECH 2022, we find a lack of thorough reporting on critical details such as evaluator recruitment and filtering, instructions and payments, and the geographic and linguistic backgrounds of evaluators. To illustrate the effect of these details on evaluation outcomes, we conducted mean opinion score (MOS) tests on three well-known TTS systems under different evaluation settings and we obtain at least three distinct rankings of TTS models. We urge the community to report experiment details in subjective evaluations to improve the reliability and interpretability of experimental results., Comment: Interspeech 2023 camera-ready version

Macroscopic properties of the strong interaction near its chiral phase transition exhibit scaling behaviors, which are the same as those observed close to the magnetic transition in a 3-dimensional classical spin system with $O(4)$ symmetry. We show that the universal scaling properties of the chiral phase transition in Quantum Chromodynamics (QCD) at the macroscale are, in fact, encoded within the microscopic energy levels of its fundamental constituents, the quarks. We establish a connection between the cumulants of the chiral order parameter, i.e., the chiral condensate, and the correlations among the energy levels of quarks, i.e., the eigenspectra of the massless QCD Dirac operator. This relation elucidates how the fluctuations of the chiral condensate arise from the correlations within the infrared part of the energy spectra of quarks, and naturally leads to a generalization of the Banks-Casher relation for the cumulants of the chiral condensate. Then, through (2+1)-flavor lattice QCD calculations with varying light quark masses near the QCD chiral transition, we demonstrate that the correlations among the infrared part of the Dirac eigenvalue spectra exhibit same universal scaling behaviors as expected of the cumulants of the chiral condensate. We find that these universal scaling behaviors extend up to the physical values of the up and down quark masses. Our study reveals how the hidden scaling features at the microscale give rise to the macroscopic universal properties of QCD., Comment: 5 pages main text + 3 pages supplemental material, version to appear in PRL

Speech processing Universal PERformance Benchmark (SUPERB) is a leaderboard to benchmark the performance of Self-Supervised Learning (SSL) models on various speech processing tasks. However, SUPERB largely considers English speech in its evaluation. This paper presents multilingual SUPERB (ML-SUPERB), covering 143 languages (ranging from high-resource to endangered), and considering both automatic speech recognition and language identification. Following the concept of SUPERB, ML-SUPERB utilizes frozen SSL features and employs a simple framework for multilingual tasks by learning a shallow downstream model. Similar to the SUPERB benchmark, we find speech SSL models can significantly improve performance compared to FBANK features. Furthermore, we find that multilingual models do not always perform better than their monolingual counterparts. We will release ML-SUPERB as a challenge with organized datasets and reproducible training scripts for future multilingual representation research., Comment: Accepted by Interspeech

Gesture recognition using low-resolution instantaneous HD-sEMG images opens up new avenues for the development of more fluid and natural muscle-computer interfaces. However, the data variability between inter-session and inter-subject scenarios presents a great challenge. The existing approaches employed very large and complex deep ConvNet or 2SRNN-based domain adaptation methods to approximate the distribution shift caused by these inter-session and inter-subject data variability. Hence, these methods also require learning over millions of training parameters and a large pre-trained and target domain dataset in both the pre-training and adaptation stages. As a result, it makes high-end resource-bounded and computationally very expensive for deployment in real-time applications. To overcome this problem, we propose a lightweight All-ConvNet+TL model that leverages lightweight All-ConvNet and transfer learning (TL) for the enhancement of inter-session and inter-subject gesture recognition performance. The All-ConvNet+TL model consists solely of convolutional layers, a simple yet efficient framework for learning invariant and discriminative representations to address the distribution shifts caused by inter-session and inter-subject data variability. Experiments on four datasets demonstrate that our proposed methods outperform the most complex existing approaches by a large margin and achieve state-of-the-art results on inter-session and inter-subject scenarios and perform on par or competitively on intra-session gesture recognition. These performance gaps increase even more when a tiny amount (e.g., a single trial) of data is available on the target domain for adaptation. These outstanding experimental results provide evidence that the current state-of-the-art models may be overparameterized for sEMG-based inter-session and inter-subject gesture recognition tasks.

Generative steganography (GS) is a new data hiding manner, featuring direct generation of stego media from secret data. Existing GS methods are generally criticized for their poor performances. In this paper, we propose a novel flow based GS approach -- Generative Steganographic Flow (GSF), which provides direct generation of stego images without cover image. We take the stego image generation and secret data recovery process as an invertible transformation, and build a reversible bijective mapping between input secret data and generated stego images. In the forward mapping, secret data is hidden in the input latent of Glow model to generate stego images. By reversing the mapping, hidden data can be extracted exactly from generated stego images. Furthermore, we propose a novel latent optimization strategy to improve the fidelity of stego images. Experimental results show our proposed GSF has far better performances than SOTA works., Comment: The accepted paper in ICME 2022

Generative steganography (GS) is an emerging technique that generates stego images directly from secret data. Various GS methods based on GANs or Flow have been developed recently. However, existing GAN-based GS methods cannot completely recover the hidden secret data due to the lack of network invertibility, while Flow-based methods produce poor image quality due to the stringent reversibility restriction in each module. To address this issue, we propose a novel GS scheme called "Generative Steganography Diffusion" (GSD) by devising an invertible diffusion model named "StegoDiffusion". It not only generates realistic stego images but also allows for 100\% recovery of the hidden secret data. The proposed StegoDiffusion model leverages a non-Markov chain with a fast sampling technique to achieve efficient stego image generation. By constructing an ordinary differential equation (ODE) based on the transition probability of the generation process in StegoDiffusion, secret data and stego images can be converted to each other through the approximate solver of ODE -- Euler iteration formula, enabling the use of irreversible but more expressive network structures to achieve model invertibility. Our proposed GSD has the advantages of both reversibility and high performance, significantly outperforming existing GS methods in all metrics., Comment: Shall not be reproduced without permission, rights reserved!