Miracle-dz/UniFAR-FTUs huggingface dataset:
Quantum sensing for particle physics

Quantum sensing is a rapidly growing approach to probe fundamental physics and explore new phase space for possible new physics with precision and highly sensitive measurements in our quest to understand the deep structure of matter and its interactions. This field uses properties of quantum mechanics in the detectors to go beyond traditional measurement techniques. Key particle physics topics where quantum sensing can play a vital role include neutrino properties, tests of fundamental symmetries (Lorentz invariance and the equivalence principle as well as searches for electric dipole moments and possible variations in fundamental constants), the search for dark matter and testing ideas about the nature of dark energy. Interesting new sensor technologies include atom interferometry, optomechanical devices, and atomic and nuclear clocks including with entanglement. This Perspective explores the opportunities for these technologies in future particle physics experiments, opening new windows on the structure of the Universe.
Nonconvex Robust High-Order Tensor Completion Using Randomized Low-Rank Approximation

Within the tensor singular value decomposition (T-SVD) framework, existing robust low-rank tensor completion approaches have made great achievements in various areas of science and engineering. Nevertheless, these methods involve the T-SVD based low-rank approximation, which suffers from high computational costs when dealing with large-scale tensor data. Moreover, most of them are only applicable to third-order tensors. Against these issues, in this article, two efficient low-rank tensor approximation approaches fusing randomized techniques are first devised under the order-d (d>= 3) T-SVD framework. On this basis, we then further investigate the robust high-order tensor completion (RHTC) problem, in which a double nonconvex model along with its corresponding fast optimization algorithms with convergence guarantees are developed. To the best of our knowledge, this is the first study to incorporate the randomized low-rank approximation into the RHTC problem. Empirical studies on large-scale synthetic and real tensor data illustrate that the proposed method outperforms other state-of-the-art approaches in terms of both computational efficiency and estimated precision.
What You Hear Is What You See: Audio Quality Metrics From Image Quality Metrics

In this study, we investigate the feasibility of utilizing state-of-the-art image perceptual metrics for evaluating audio signals by representing them as spectrograms. The encouraging outcome of the proposed approach is based on the similarity between the neural mechanisms in the auditory and visual pathways. Furthermore, we customise one of the metrics which has a psychoacoustically plausible architecture to account for the peculiarities of sound signals. We evaluate the effectiveness of our proposed metric and several baseline metrics using a music dataset, with promising results in terms of the correlation between the metrics and the perceived quality of audio as rated by human evaluators.
Persian Typographical Error Type Detection using Many-to-Many Deep Neural Networks on Algorithmically-Generated Misspellings

Digital technologies have led to an influx of text created daily in a variety of languages, styles, and formats. A great deal of the popularity of spell-checking systems can be attributed to this phenomenon since they are crucial to polishing the digitally conceived text. In this study, we tackle Typographical Error Type Detection in Persian, which has been relatively understudied. In this paper, we present a public dataset named FarsTypo, containing 3.4 million chronologically ordered and part-of-speech tagged words of diverse topics and linguistic styles. An algorithm for applying Persian-specific errors is developed and applied to a scalable size of these words, forming a parallel dataset of correct and incorrect words. Using FarsTypo, we establish a firm baseline and compare different methodologies using various architectures. In addition, we present a novel Many-to-Many Deep Sequential Neural Network to perform token classification using both word and character embeddings in combination with bidirectional LSTM layers to detect typographical errors across 51 classes. We compare our approach with highly-advanced industrial systems that, unlike this study, have been developed utilizing a variety of resources. The results of our final method were competitive in that we achieved an accuracy of 97.62%, a precision of 98.83%, a recall of 98.61%, and outperformed the rest in terms of speed.
Average fold-change of genetic pathways in biological transitions

A biological transition from a state N to a state T is characterized by a rearrangement of the gene expression profile in the system, quantitatively measured through the differential expression of genes. In contrast, changes in genetic pathways are usually evaluated by means of hypothesis testing schemes. We introduce a quantitative measure in order to evaluate the average fold-change of genetic pathways in biological transitions and applied it to characterize in general grounds the transition from a normal tissue to a tumor. Additionally, we study the transformation from primary to metastatic melanoma. Gene expression data from the TCGA portal for 16 tumors and the Reactome compilation of pathways are used for this purpose.
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees

Projection-free online learning has drawn increasing interest due to its efficiency in solving high-dimensional problems with complicated constraints. However, most existing projection-free online methods focus on minimizing the static regret, which unfortunately fails to capture the challenge of changing environments. In this paper, we investigate non-stationary projection-free online learning, and choose dynamic regret and adaptive regret to measure the performance. Specifically, we first provide a novel dynamic regret analysis for an existing projection-free method named BOGD_IP, and establish an O(T^¾ (1+P_T)) dynamic regret bound, where P_T denotes the path-length of the comparator sequence. Then, we improve the upper bound to O(T^¾ (1+P_T)^¼) by running multiple BOGD_IP algorithms with different step sizes in parallel, and tracking the best one on the fly. Our results are the first general-case dynamic regret bounds for projection-free online learning, and can recover the existing O(T^¾) static regret by setting P_T = 0. Furthermore, we propose a projection-free method to attain an O(? ^¾) adaptive regret bound for any interval with length ? , which nearly matches the static regret over that interval. The essential idea is to maintain a set of BOGD_IP algorithms dynamically, and combine them by a meta algorithm. Moreover, we demonstrate that it is also equipped with an O(T^¾ (1+P_T)^¼) dynamic regret bound. Finally, empirical studies verify our theoretical findings.
Towards Human-AI Collaborative Urban Science Research Enabled by Pre-trained Large Language Models

Pre-trained large language models (PLMs) have the potential to support urban science research through content creation, information extraction, assisted programming, text classification, and other technical advances. In this research, we explored the opportunities, challenges, and prospects of PLMs in urban science research. Specifically, we discussed potential applications of PLMs to urban institution, urban space, urban information, and citizen behaviors research through seven examples using ChatGPT. We also examined the challenges of PLMs in urban science research from both technical and social perspectives. The prospects of the application of PLMs in urban science research were then proposed. We found that PLMs can effectively aid in understanding complex concepts in urban science, facilitate urban spatial form identification, assist in disaster monitoring, and sense public sentiment. At the same time, however, the applications of PLMs in urban science research face evident threats, such as technical limitations, security, privacy, and social bias. The development of fundamental models based on domain knowledge and human-AI collaboration may help improve PLMs to support urban science research in future.
Language-Universal Phonetic Representation in Multilingual Speech Pretraining for Low-Resource Speech Recognition

We improve low-resource ASR by integrating the ideas of multilingual training and self-supervised learning. Concretely, we leverage an International Phonetic Alphabet (IPA) multilingual model to create frame-level pseudo labels for unlabeled speech, and use these pseudo labels to guide hidden-unit BERT (HuBERT) based speech pretraining in a phonetically-informed manner. The experiments on the Multilingual Speech (MLS) Corpus show that the proposed approach consistently outperforms the standard HuBERT on all the target languages. Moreover, on 3 of the 4 languages, comparing to the standard HuBERT, the approach performs better, meanwhile is able to save supervised training data by 1.5k hours (75%) at most. Our approach outperforms most of the state of the arts, with much less pretraining data in terms of hours and language diversity. Compared to XLSR-53 and a retraining based multilingual method, our approach performs better with full and limited finetuning data scenarios.
Stochastic Discounting, Aggregate Claims, and the Bootstrap

Obtaining good estimates for the distribution function of random variables like (‘perpetuity’) and (‘aggregate claim amount’), where the (Yi ), (Zi ) are independent i.i. d. sequences and (N(t)) is a general point process, is a key question in insurance mathematics. In this paper, we show how suitably chosen metrics provide a theoretical justification for bootstrap estimation in these cases. In the perpetuity case, we also give a detailed discussion of how the method works in practice.
Unsupervised Domain-agnostic Fake News Detection using Multi-modal Weak Signals

The emergence of social media as one of the main platforms for people to access news has enabled the wide dissemination of fake news. This has motivated numerous studies on automating fake news detection. Although there have been limited attempts at unsupervised fake news detection, their performance suffers due to not exploiting the knowledge from various modalities related to news records and due to the presence of various latent biases in the existing news datasets. To address these limitations, this work proposes an effective framework for unsupervised fake news detection, which first embeds the knowledge available in four modalities in news records and then proposes a novel noise-robust self-supervised learning technique to identify the veracity of news records from the multi-modal embeddings. Also, we propose a novel technique to construct news datasets minimizing the latent biases in existing news datasets. Following the proposed approach for dataset construction, we produce a Large-scale Unlabelled News Dataset consisting 419,351 news articles related to COVID-19, acronymed as LUND-COVID. We trained the proposed unsupervised framework using LUND-COVID to exploit the potential of large datasets, and evaluate it using a set of existing labelled datasets. Our results show that the proposed unsupervised framework largely outperforms existing unsupervised baselines for different tasks such as multi-modal fake news detection, fake news early detection and few-shot fake news detection, while yielding notable improvements for unseen domains during training.
Nucleon isovector axial form factors

We present results for the isovector axial vector form factors obtained using thirteen 2+1+1-flavor highly improved staggered quark (HISQ) ensembles generated by the MILC collaboration. The calculation of nucleon two- and three-point correlation functions has been done using Wilson-clover fermions. In the analysis of these data, we quantify the sensitivity of the results to strategies used for removing excited state contamination and invoke the partially conserved axial current relation between the form factors to choose between them. Our data driven analysis includes removing contributions from multihadron $N \pi$ states that make significant contributions. Our final results are: $g_A = 1.295 (50)_\text{stat}\,(24)_\text{sys}$ for the axial charge; $g_S = 1.085 (50)_\text{stat}\, (103)_\text{sys}$ and $g_T = 0.991 (21)_\text{stat}\, (10)_\text{sys}$ for the scalar and tensor charges; $\langle r_A^2 \rangle = 0.418 (33)_\text{stat} (34)_\text{sys}$ fm${}^2$ for the mean squared axial charge radius, $g_P^\ast = 9.03(47)_\text{stat}(42)_\text{sys} $ for the induced pseudoscalar charge; and $g_{\pi NN} = 14.14(81)_\text{stat}(85)_\text{sys}$ for the pion-nucleon coupling. We also provide a parameterization of the axial form factor $G_A(Q^2)$ over the range $0 \le Q^2 \le 1$ GeV${}^2$ for use in phenomenology and a comparison with other lattice determinations. We find that the various lattice data agree within 10\% but are significantly different from the extraction of $G_A(Q^2)$ from the $\nu$-deuterium scattering data.
JetSeg: Efficient Real-Time Semantic Segmentation Model for Low-Power GPU-Embedded Systems

Real-time semantic segmentation is a challenging task that requires high-accuracy models with low-inference times. Implementing these models on embedded systems is limited by hardware capability and memory usage, which produces bottlenecks. We propose an efficient model for real-time semantic segmentation called JetSeg, consisting of an encoder called JetNet, and an improved RegSeg decoder. The JetNet is designed for GPU-Embedded Systems and includes two main components: a new light-weight efficient block called JetBlock, that reduces the number of parameters minimizing memory usage and inference time without sacrificing accuracy; a new strategy that involves the combination of asymmetric and non-asymmetric convolutions with depthwise-dilated convolutions called JetConv, a channel shuffle operation, light-weight activation functions, and a convenient number of group convolutions for embedded systems, and an innovative loss function named JetLoss, which integrates the Precision, Recall, and IoUB losses to improve semantic segmentation and reduce computational complexity. Experiments demonstrate that JetSeg is much faster on workstation devices and more suitable for Low-Power GPU-Embedded Systems than existing state-of-the-art models for real-time semantic segmentation. Our approach outperforms state-of-the-art real-time encoder-decoder models by reducing 46.70M parameters and 5.14% GFLOPs, which makes JetSeg up to 2x faster on the NVIDIA Titan RTX GPU and the Jetson Xavier than other models. The JetSeg code is available at https://github.com/mmontielpz/jetseg.
Towards Code Generation from BDD Test Case Specifications: A Vision

Automatic code generation has recently attracted large attention and is becoming more significant to the software development process. Solutions based on Machine Learning and Artificial Intelligence are being used to increase human and software efficiency in potent and innovative ways. In this paper, we aim to leverage these developments and introduce a novel approach to generating frontend component code for the popular Angular framework. We propose to do this using behavior-driven development test specifications as input to a transformer-based machine learning model; however, we do not provide any proof-of-concept solution in this work. Our approach aims to drastically reduce the development time needed for web applications while potentially increasing software quality and introducing new research ideas toward automatic code generation.
MUSE AO spectroscopy confirms five dual AGNs and two strongly lensed QSOs at sub-arcsec separation

The novel Gaia Multi Peak (GMP) technique has proven to be able to successfully select dual and lensed AGN candidates at sub-arcsec separations. Both populations are important because dual AGNs represent one of the central, still largely untested, predictions of lamdaCDM cosmology, and compact lensed quasars allow to probe the central regions of the lensing galaxies. In this work, we present high spatial resolution spectroscopy of twelve GMP-selected systems. We use the the adaptive-optics assisted integral-field spectrograph MUSE at VLT to resolve each system and study the nature of each component. All the targets reveal the presence of two components confirming the GMP selection. We classify five targets as dual AGNs, two as lensed systems, and five as a chance alignment of a star and and AGN. Having separations between 0.30"and 0.86", these dual and lensed systems are, to date, among the most compact ever discovered at z>0.3. This is the largest sample of distant dual AGNs with sub-arcsec separations ever presented in a single paper.
A Cyberattack Detection-Isolation Scheme For CAV Under Changing Driving Environment

Under a changing driving environment, a Connected Autonomous Vehicle (CAV) platoon relies strongly on the acquisition of accurate traffic information from neighboring vehicles as well as reliable commands from a centralized supervisory controller through the communication network. Even though such modalities are imperative to ensure the safe and efficient driving performance of CAVs, they led to multiple security challenges. Thus, a cyberattack on this network can corrupt vehicle-to-infrastructure (V2I) and vehicle-to-vehicle (V2V) communication, which can lead to unsafe or undesired driving scenarios. Hence, in this paper, we propose a unified V2V and V2I cyberattack detection scheme along with a V2I isolation scheme for CAVs under changing driving conditions. The proposed scheme is constructed using a bank of residual generators with Lyapunov function-based performance guarantees, such as disturbance-to-state stability, robustness, and sensitivity. Finally, we showcase the efficacy of our proposed algorithm through two simulation studies, namely under highway driving and urban driving. The results show that the proposed scheme can enhance the cybersecurity of CAVs by detecting and isolating cyberattacks on CAV platoons.
The helion charge radius from laser spectroscopy of muonic helium-3 ions

Hydrogen-like light muonic ions, in which one negative muon replaces all the electrons, are extremely sensitive probes of nuclear structure, because the large muon mass increases tremendously the wave function overlap with the nucleus. Using pulsed laser spectroscopy we have measured three 2S-2P transitions in the muonic helium-3 ion ($\mu^3$He$^+$), an ion formed by a negative muon and bare helium-3 nucleus. This allowed us to extract the Lamb shift $E(2P_{1/2}-2S_{1/2})= 1258.598(48)^{\rm exp}(3)^{\rm theo}$ meV, the 2P fine structure splitting $E_{\rm FS}^{\rm exp} = 144.958(114)$ meV, and the 2S-hyperfine splitting (HFS) $E_{\rm HFS}^{\rm exp} = -166.495(104)^{\rm exp}(3)^{\rm theo}$ meV in $\mu^3$He$^+$. Comparing these measurements to theory we determine the rms charge radius of the helion ($^3$He nucleus) to be $r_h$ = 1.97007(94) fm. This radius represents a benchmark for few nucleon theories and opens the way for precision tests in $^3$He atoms and $^3$He-ions. This radius is in good agreement with the value from elastic electron scattering, but a factor 15 more accurate. Combining our Lamb shift measurement with our earlier one in $\mu^4$He$^+$ we obtain $r_h^2-r_\alpha^2 = 1.0636(6)^{\rm exp}(30)^{\rm theo}$ fm$^2$ to be compared to results from the isotope shift measurements in regular He atoms, which are however affected by long-standing tensions. By comparing $E_{\rm HFS}^{\rm exp}$ with theory we also obtain the two-photon-exchange contribution (including higher orders) which is another important benchmark for ab-initio few-nucleon theories aiming at understanding the magnetic and current structure of light nuclei.
Terraforming - Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery

In automated warehouses, teams of mobile robots fulfill the packaging process by transferring inventory pods to designated workstations while navigating narrow aisles formed by tightly packed pods. This problem is typically modeled as a Multi-Agent Pickup and Delivery (MAPD) problem, which is then solved by repeatedly planning collision-free paths for agents on a fixed graph, as in the Rolling-Horizon Collision Resolution (RHCR) algorithm. However, existing approaches make the limiting assumption that agents are only allowed to move pods that correspond to their current task, while considering the other pods as stationary obstacles (even though all pods are movable). This behavior can result in unnecessarily long paths which could otherwise be avoided by opening additional corridors via pod manipulation. To this end, we explore the implications of allowing agents the flexibility of dynamically relocating pods. We call this new challenging problem Terraforming MAPD (tMAPD) and develop an RHCR-based approach to tackle it. As the extra flexibility of terraforming comes at a significant computational cost, we utilize this capability judiciously by identifying situations where it could make a significant impact on the solution quality. In particular, we invoke terraforming in response to disruptions that often occur in automated warehouses, e.g., when an item is dropped from a pod or when agents malfunction. Empirically, using our approach for tMAPD, where disruptions are modeled via a stochastic process, we improve throughput by over 10%, reduce the maximum service time (the difference between the drop-off time and the pickup time of a pod) by more than 50%, without drastically increasing the runtime, compared to the MAPD setting.
Scalable Algorithmic Infrastructure for Computation of Social Crowding and Viral Disease Encounters - mContain Case Study

mContain was developed (and sparsely deployed) by MD2K center at University of Memphis in the early stages of COVID-19 pandemic to help reduce community transmission in Shelby County and Memphis metropolitan area. The application counts and displays the number of daily proximity encounters with other app users. To reduce the chances of entering crowded places, users can see the level of crowding at busy places on a map. If a user and their COVID-19 test provider both agree to share the results of their test, the app can notify other users about possible exposures to COVID-19. The smartphone application collects location and Bluetooth data and sends it to cloud for near real time processing and decisions to be sent back for visualization and interface with the user. The backend algorithmic infrastructure responsible for real time crowd estimation and contact tracing from streaming batch data use open-source cloud analytics platform Cerebral-Cortex. This project concerns about presenting the authors contributions in the algorithmic development, design and implementation of mContain application as part of the entire collaborative project. We describe the mcontain algorithmic infrastructure and major computational challenges encountered when developing and deploying this application for real-life usage. Details of the app can be found in https://mcontain.md2k. org/
DUB: Discrete Unit Back-translation for Speech Translation

How can speech-to-text translation (ST) perform as well as machine translation (MT)? The key point is to bridge the modality gap between speech and text so that useful MT techniques can be applied to ST. Recently, the approach of representing speech with unsupervised discrete units yields a new way to ease the modality problem. This motivates us to propose Discrete Unit Back-translation (DUB) to answer two questions: (1) Is it better to represent speech with discrete units than with continuous features in direct ST? (2) How much benefit can useful MT techniques bring to ST? With DUB, the back-translation technique can successfully be applied on direct ST and obtains an average boost of 5.5 BLEU on MuST-C En-De/Fr/Es. In the low-resource language scenario, our method achieves comparable performance to existing methods that rely on large-scale external data. Code and models are available at https://github.com/0nutation/DUB.