In the field of software traceability (ST), machine learning (ML) has become a common and effective method for automated issue-commit link recovery. The features extracted from issue and commit artifacts are composed of significantly different types of data, such as issue summaries, diff codes, and hashes. Such complex and diverse data poses a challenge to conventional ML methods. To overcome this challenge, we propose a novel model named FRELinker, which trains independent classifiers based on the type of issue-commit training data, fully leveraging the effectiveness of ML for single type data, and then fuses the classifiers. Specifically, we categorize the features into four types: textual features, code features, non-textual features, and similarity features, and extend text similarity features by adding hybrid textual similarity measures. And then, we use a ranking method to select the optimal classifiers corresponding to these four types of features. Among them, the optimal classifier for textual features is Gradient Boosting (GB), the optimal classifier for code features is Logistic Regression (LR), and the optimal classifier for non-textual features and similarity features is Random Forest (RF). Finally, we use a Bayesian optimization model to fuse these four classifiers. Experimental results show that our method outperforms competing methods Hybrid-Linker and DeepLink in terms of Precision, Recall, and F-measure on six real-world open-source software (OSS) datasets, demonstrating significant performance advantages in complex and diverse data.

Deep learning-based methods have made significant achievements in music source separation. However, obtaining good results while maintaining a low model complexity remains challenging in super wide-band music source separation. Previous works either overlook the differences in subbands or inadequately address the problem of information loss when generating subband features. In this paper, we propose SCNet, a novel frequency-domain network to explicitly split the spectrogram of the mixture into several subbands and introduce a sparsity-based encoder to model different frequency bands. We use a higher compression ratio on subbands with less information to improve the information density and focus on modeling subbands with more information. In this way, the separation performance can be significantly improved using lower computational consumption. Experiment results show that the proposed model achieves a signal to distortion ratio (SDR) of 9.0 dB on the MUSDB18-HQ dataset without using extra data, which outperforms state-of-the-art methods. Specifically, SCNet’s CPU inference time is only 48% of HT Demucs, one of the previous state-of-the-art models.

The Lion optimizer has been a promising competitor with the AdamW for training large AI models, with advantages in memory, computation, and sample efficiency. In this paper, we introduce Distributed Lion, an innovative adaptation of Lion for distributed training environments. Leveraging the sign operator in Lion, our Distributed Lion only requires to communicate binary or lower-precision vectors between workers to the center server, significantly reducing the communication cost. Our theoretical analysis confirms Distributed Lion's convergence properties. Empirical results demonstrate its robustness across a range of tasks, worker counts, and batch sizes, on both vision and language problems. Notably, Distributed Lion attains comparable performance to standard Lion or AdamW optimizers applied on aggregated gradients, but with significantly reduced communication bandwidth. This feature is particularly advantageous for training large models. In addition, we also demonstrate that \mavolion{} presents a more favorable performance-bandwidth balance compared to existing efficient distributed methods such as deep gradient compression and ternary gradients.

Traceability refers to the potential for traces to be established (i.e., created and maintained) and used. Bug Traceability (BT) is critical for enhancing software quality, reducing maintenance costs, and boosting team efficiency. To explore the trends and advancements of BT, we conduct a systematic mapping study (SMS). We initially retrieve 4674 citations from 7 databases spanning 2014 to 2023, and 24 primary studies meet the rigorous selection criteria. Our study identifies 6 types of bug trace links, 8 traceability strategies, and 47 bug traceability recovery (BTR) techniques. Among them, 47 BTR techniques can be further classified into 6 categories. At the same time, we perform statistics on 113 datasets and 16 evaluation metrics used to assess the performance of BTR techniques proposed in the primary studies. In evaluating the overall quality of the primary studies, 8 dimensions are utilized to support technology transfer, categorizing the overall quality into 4 levels: poor, middle, good, and excellent, with 79% of primary studies evaluated at a good level. This study not only furnishes a clear definition of BT for scholarly reference, but also highlights that information retrieval (IR), machine learning (ML) and deep learning (DL) techniques are the mainstream techniques used for BTR.

Deep learning-based methods have made significant achievements in speech separation. Especially the time-domain separation methods have achieved the best performance in recent years. However, time-domain methods are unstable for waveform transformation, which is prone to amplitude and phase errors. Considering the robustness of time-frequency (T-F) domain methods, we propose an innovative network architecture called Time-Frequency Domain Corrector Network (TFCNet), which consists of a time-domain separator and a specially-designed T-F domain corrector. The corrector module is added after the time-domain separation step to correct the real and imaginary parts information in the T-F domain. The proposed model achieves state-of-the-art performance with an SI-SDRi of 22.2dB on the WSJ0-2mix dataset and an SI-SDRi of 19.4dB on the Libri-2mix dataset.

Recently, excellent progress has been made in speech recognition. However, pure data-driven approaches have struggled to solve the problem in domain-mismatch and long-tailed data. Considering that knowledge-driven approaches can help data-driven approaches alleviate their flaws, we introduce sememe-based semantic knowledge information to speech recognition (SememeASR). Sememe, according to the linguistic definition, is the minimum semantic unit in a language and is able to represent the implicit semantic information behind each word very well. Our experiments show that the introduction of sememe information can improve the effectiveness of speech recognition. In addition, our further experiments show that sememe knowledge can improve the model's recognition of long-tailed data and enhance the model's domain generalization ability.

Mapping two modalities, speech and text, into a shared representation space, is a research topic of using text-only data to improve end-to-end automatic speech recognition (ASR) performance in new domains. However, the length of speech representation and text representation is inconsistent. Although the previous method up-samples the text representation to align with acoustic modality, it may not match the expected actual duration. In this paper, we proposed novel representations match strategy through down-sampling acoustic representation to align with text modality. By introducing a continuous integrate-and-fire (CIF) module generating acoustic representations consistent with token length, our ASR model can learn unified representations from both modalities better, allowing for domain adaptation using text-only data of the target domain. Experiment results of new domain data demonstrate the effectiveness of the proposed method.

We present VeLoc, a smartphone-based vehicle localization approach that tracks the vehicle's parking location without GPS or WiFi signals. It uses only the embedded accelerometer and gyroscope sensors. VeLoc harnesses constraints imposed by the map and landmarks (e.g., speed bumps) recognized from inertial data, employs a Bayesian filtering framework to estimate the location of the vehicle. We have conducted experiments in three parking structures of different sizes and configurations, using three vehicles and three kinds of driving styles. We find that VeLoc can always localize the vehicle within 10m, which is sufficient for the driver to trigger a honk using the car key.