Search

In soft ferroelectric crystals, the depolarization field can be reduced by periodic distortion of the polarization direction. In the polar nematic and tilted smectic phases, this process is energetically favorured , as it only requires changes in the director orientation. We demonstrate the spontaneous formation of a helical structure in the proper ferroelectric tilted smectic (SmCTBF) phase, the phase is formed below the heliconical polar nematic (NTBF) phase. The helical pitch in the smectic phase is approximately 600 nm and remains nearly constant across the entire temperature range of the phase. Under weak electric fields, the helix reorients while its structure remains largely intact; however, in stronger fields, the helix is destroyed as the electric polarization aligns along the electric field.

We introduce a simple microscopic quantum mechanical model of low-dimensional de Sitter holography with an observer. Using semiclassical gravity and elementary thermodynamic considerations, we derive a formula for the total entropy of a 3D Schwarzschild-de Sitter universe with an observer. We then match this entropy formula with the exactly known spectral density of the double scaled SYK model. Our result gives a de Sitter interpretation of the appearance of two notions of temperature in DSSYK., Comment: 15 pages, 3 figures

Network threat detection has been challenging due to the complexities of attack activities and the limitation of historical threat data to learn from. To help enhance the existing practices of using analytics, machine learning, and artificial intelligence methods to detect the network threats, we propose an integrated modelling framework, where Knowledge Graph is used to analyze the users' activity patterns, Imbalanced Learning techniques are used to prune and weigh Knowledge Graph, and LLM is used to retrieve and interpret the users' activities from Knowledge Graph. The proposed framework is applied to Agile Threat Detection through Online Sequential Learning. The preliminary results show the improved threat capture rate by 3%-4% and the increased interpretabilities of risk predictions based on the users' activities., Comment: Accepted by "Combining AI and OR/MS for Better Trustworthy Decision Making" Bridge Program co-organized by AAAI and INFORMS as poster and demo

Point cloud is an important type of geometric data structure for many embedded applications such as autonomous driving and augmented reality. Current Point Cloud Networks (PCNs) have proven to achieve great success in using inference to perform point cloud analysis, including object part segmentation, shape classification, and so on. However, point cloud applications on the computing edge require more than just the inference step. They require an end-to-end (E2E) processing of the point cloud workloads: pre-processing of raw data, input preparation, and inference to perform point cloud analysis. Current PCN approaches to support end-to-end processing of point cloud workload cannot meet the real-time latency requirement on the edge, i.e., the ability of the AI service to keep up with the speed of raw data generation by 3D sensors. Latency for end-to-end processing of the point cloud workloads stems from two reasons: memory-intensive down-sampling in the pre-processing phase and the data structuring step for input preparation in the inference phase. In this paper, we present HgPCN, an end-to-end heterogeneous architecture for real-time embedded point cloud applications. In HgPCN, we introduce two novel methodologies based on spatial indexing to address the two identified bottlenecks. In the Pre-processing Engine of HgPCN, an Octree-Indexed-Sampling method is used to optimize the memory-intensive down-sampling bottleneck of the pre-processing phase. In the Inference Engine, HgPCN extends a commercial DLA with a customized Data Structuring Unit which is based on a Voxel-Expanded Gathering method to fundamentally reduce the workload of the data structuring step in the inference phase., Comment: Accepted by MICRO2024

We develop automatic speech recognition (ASR) systems for stories told by Afrikaans and isiXhosa preschool children. Oral narratives provide a way to assess children's language development before they learn to read. We consider a range of prior child-speech ASR strategies to determine which is best suited to this unique setting. Using Whisper and only 5 minutes of transcribed in-domain child speech, we find that additional in-domain adult data (adult speech matching the story domain) provides the biggest improvement, especially when coupled with voice conversion. Semi-supervised learning also helps for both languages, while parameter-efficient fine-tuning helps on Afrikaans but not on isiXhosa (which is under-represented in the Whisper model). Few child-speech studies look at non-English data, and even fewer at the preschool ages of 4 and 5. Our work therefore represents a unique validation of a wide range of previous child-speech ASR strategies in an under-explored setting., Comment: Accepted to ICASSP 2025

Codec-based text-to-speech (TTS) models have shown impressive quality with zero-shot voice cloning abilities. However, they often struggle with more expressive references or complex text inputs. We present MARS6, a robust encoder-decoder transformer for rapid, expressive TTS. MARS6 is built on recent improvements in spoken language modelling. Utilizing a hierarchical setup for its decoder, new speech tokens are processed at a rate of only 12 Hz, enabling efficient modelling of long-form text while retaining reconstruction quality. We combine several recent training and inference techniques to reduce repetitive generation and improve output stability and quality. This enables the 70M-parameter MARS6 to achieve similar performance to models many times larger. We show this in objective and subjective evaluations, comparing TTS output quality and reference speaker cloning ability. Project page: https://camb-ai.github.io/mars6-turbo/, Comment: 5 pages, 2 figures, 1 table. Accepted at ICASSP 2025

We investigate the terahertz conductivity of conventional superconductors in Voigt and Faraday magneto-optical configurations. First, we review theoretical approaches describing the fundamental processes of suppression of superconductivity in magnetic field and how the in-gap states are filled. In the Voigt geometry, thin superconducting films are fully penetrated by the magnetic field which interacts with the spin, thus modifying the magnitudes of the optical gap and of the density of the condensate. In this configuration, we provide an alternative description of the recent experiments showing the gapless conductivity of a Nb film measured by Lee ${\it et\,al.}$ [Nat. Commun. 14,2737 (2023)], which better fits their data for magnetic fields above 1 T. In the Faraday geometry, we measured and analyzed the terahertz conductivity of three NbN films with varying thicknesses using the Maxwell-Garnett model, treating vortices as normal-state inclusions within a superconducting matrix. In both geometries, the optical conductivity can be comprehensively described by the model of Herman and Hlubina [Phys. Rev. B 96, 014509 (2017)] involving pair-conserving, and magnetic-field-dependent pair-breaking disorder scattering processes., Comment: 7 pages, 6 figures

The higher Bruhat orders $\mathcal{B}(n,k)$ were introduced by Manin-Schechtman to study discriminantal hyperplane arrangements and subsequently studied by Ziegler, who connected $\mathcal{B}(n,k)$ to oriented matroids. In this paper, we consider the enumeration of $\mathcal{B}(n,k)$ and improve upon Balko's asymptotic lower and upper bounds on $|\mathcal{B}(n,k)|$ by a factor exponential in $k$. A proof of Ziegler's formula for $|\mathcal{B}(n,n-3)|$ is given and a bijection between a certain subset of $\mathcal{B}(n,n-4)$ and totally symmetric plane partitions is proved. Central to our proofs are deletion and contraction operations for the higher Bruhat orders, defined in analogy with matroids. Dual higher Bruhat orders are also introduced, and we construct isomorphisms relating the higher Bruhat orders and their duals. Additionally, weaving functions are introduced to generalize Felsner's encoding of elements in $\mathcal{B}(n,2)$ to all higher Bruhat orders $\mathcal{B}(n,k)$., Comment: 28 pages

Hierarchical Text Classification (HTC) is a natural language processing task with the objective to classify text documents into a set of classes from a structured class hierarchy. Many HTC approaches have been proposed which attempt to leverage the class hierarchy information in various ways to improve classification performance. Machine learning-based classification approaches require large amounts of training data and are most-commonly compared through three established benchmark datasets, which include the Web Of Science (WOS), Reuters Corpus Volume 1 Version 2 (RCV1-V2) and New York Times (NYT) datasets. However, apart from the RCV1-V2 dataset which is well-documented, these datasets are not accompanied with detailed description methodologies. In this paper, we introduce three new HTC benchmark datasets in the domain of research publications which comprise the titles and abstracts of papers from the Web of Science publication database. We first create two baseline datasets which use existing journal-and citation-based classification schemas. Due to the respective shortcomings of these two existing schemas, we propose an approach which combines their classifications to improve the reliability and robustness of the dataset. We evaluate the three created datasets with a clustering-based analysis and show that our proposed approach results in a higher quality dataset where documents that belong to the same class are semantically more similar compared to the other datasets. Finally, we provide the classification performance of four state-of-the-art HTC approaches on these three new datasets to provide baselines for future studies on machine learning-based techniques for scientific publication classification., Comment: 16 pages, 11 figures

We present q2-fmt, a QIIME 2 plugin that provides diverse methods for assessing the extent of microbiome engraftment following fecal microbiota transplant. The methods implemented here were informed by a recent literature review on approaches for assessing FMT engraftment, and cover aspects of engraftment including Chimeric Asymmetric Community Coalescence, Donated Microbiome Indicator Features, and Temporal Stability. q2-fmt is free for all use, and detailed documentation illustrating worked examples on a real-world data set are provided in the project's documentation., Comment: 5 pages, 1 figure

The X-ray polarization observations made possible with the Imaging X-ray Polarimetry Explorer (IXPE) offer new ways of probing high-energy emission processes in astrophysical jets from blazars. Here we report on the first X-ray polarization observation of the blazar S4 0954+65 in a high optical and X-ray state. During our multi-wavelength campaign on the source, we detected an optical flare whose peak coincided with the peak of an X-ray flare. This optical-X-ray flare most likely took place in a feature moving along the parsec-scale jet, imaged at 43 GHz by the Very Long Baseline Array. The 43 GHz polarization angle of the moving component underwent a rotation near the time of the flare. In the optical band, prior to the IXPE observation, we measured the polarization angle to be aligned with the jet axis. In contrast, during the optical flare the optical polarization angle was perpendicular to the jet axis; after the flare, it reverted to being parallel to the jet axis. Due to the smooth behavior of the optical polarization angle during the flare, we favor shocks as the main acceleration mechanism. We also infer that the ambient magnetic field lines in the jet were parallel to the jet position angle. The average degree of optical polarization during the IXPE observation was (14.3$\pm$4.1)%. Despite the flare, we only detected an upper limit of 14% (at 3$\sigma$ level) on the X-ray polarization degree; although a reasonable assumption on the X-ray polarization angle results in an upper limit of 8.8% ($3\sigma$). We model the spectral energy distribution (SED) and spectral polarization distribution (SPD) of S4 0954+65 with leptonic (synchrotron self-Compton) and hadronic (proton and pair synchrotron) models. The constraints we obtain with our combined multi-wavelength polarization observations and SED modeling tentatively disfavor hadronic models for the X-ray emission in S4 0954+65., Comment: Submitted to A&A, 16 pages, 5 figures, and 7 tables

A dip in coincidence peaks for an electron beam is an experimental signature to detect Coulomb repulsion and Pauli pressure. This paper discusses another effect that can produce a similar signature but that does not originate from the properties of the physical system under scrutiny. Instead, the detectors and electronics used to measure those coincidences suffer significantly even from weak crosstalk. A simple model that explains our experimental observations is given. Furthermore we provide an experimental approach to correct for this type of crosstalk., Comment: 6 pages, 4 figures

We study Defant and Kravitz's generalization of Sch\"utzenberger's promotion operator to arbitrary labelings of finite posets in two directions. Defant and Kravitz showed that applying the promotion operator $n-1$ times to a labeling of a poset on $n$ elements always gives a natural labeling of the poset and called a labeling tangled if it requires the full $n-1$ promotions to reach a natural labeling. They also conjectured that there are at most $(n-1)!$ tangled labelings for any poset on $n$ elements. In the first direction, we propose a further strengthening of their conjecture by partitioning tangled labelings according to the element labeled $n-1$ and prove that this stronger conjecture holds for inflated rooted forest posets and a new class of posets called shoelace posets. In the second direction, we introduce sorting generating functions and cumulative generating functions for the number of labelings that require $k$ applications of the promotion operator to give a natural labeling. We prove that the coefficients of the cumulative generating function of the ordinal sum of antichains are log-concave and obtain a refinement of the weak order on the symmetric group., Comment: 24 pages, 11 figures

We consider different schemes for the electrodynamic Aharonov-Bohm (AB) effect introduced in Ref. [Phys. Rev. A $\mathbf{108}$, 062218 (2023)], exploring subtleties of the phenomenon to enhance the understanding of its topological nature. In the treated examples, the electric current in a solenoid varies in time, changing its internal magnetic field and producing an external electric field, while a quantum charged particle is in a superposition state inside two Faraday cages in an interferometer. The Faraday cages cancel the electric field at their interiors, such that the particle is always subjected to null electromagnetic fields. We discuss how the AB phase difference depends on the topology of the electric and magnetic fields in spacetime in the different treated situations., Comment: 5 pages, 3 figures

Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class association schemes of the symmetric groups $\operatorname {sym}(n)$, for $3\leq n \leq 6$, have been studied and completely determined. The case for $\operatorname {sym}(7)$ is computationally much more difficult and has a potential application to find the size of the largest permutation codes of $\operatorname {sym}(7)$ with a minimal distance of at least $4$. In this paper, the dimension, the Wedderburn decomposition, and the block dimension decomposition of the Terwilliger algebra of the conjugacy class scheme of the group $\operatorname {sym}(7)$ are determined.

This report investigates the relationship between software refactoring and behavior preservation. Existing behavior preservation analyses often lack comprehensive insights into refactoring rejections and do not provide actionable solutions. To address these issues, we developed a conceptual model to detect refactoring dangers, and created an Eclipse plugin based upon this model, called ReFD. Every refactoring can be partitioned in microsteps, each of which carries potential risks. ReFD evaluates a given code context to identify if these potential risks are present, making them actual risks, and employs a verdict mechanism to reduce false positives. To facilitate the risk detection, several components called detectors and subdetectors are defined, which can be reused for multiple refactorings. The tool was validated by implementing the detection for multiple refactorings, which produce the expected information about the risks detected. This information leads a developer to actively think about solutions to the problems a refactoring might cause within an actual codebase., Comment: 35 pages, 19 figures

Machine learning is becoming an increasingly valuable tool in mathematics, enabling one to identify subtle patterns across collections of examples so vast that they would be impossible for a single researcher to feasibly review and analyze. In this work, we use graph neural networks to investigate quiver mutation -- an operation that transforms one quiver (or directed multigraph) into another -- which is central to the theory of cluster algebras with deep connections to geometry, topology, and physics. In the study of cluster algebras, the question of mutation equivalence is of fundamental concern: given two quivers, can one efficiently determine if one quiver can be transformed into the other through a sequence of mutations? Currently, this question has only been resolved in specific cases. In this paper, we use graph neural networks and AI explainability techniques to discover mutation equivalence criteria for the previously unknown case of quivers of type $\tilde{D}_n$. Along the way, we also show that even without explicit training to do so, our model captures structure within its hidden representation that allows us to reconstruct known criteria from type $D_n$, adding to the growing evidence that modern machine learning models are capable of learning abstract and general rules from mathematical data.

The goal of this paper is to develop a multilingual classifier and conditional probability estimator of occupation codes for online job advertisements according in accordance with the International Standard Classification of Occupations (ISCO) extended with the Polish Classification of Occupations and Specializations (KZiS), which is analogous to the European Classification of Occupations. In this paper, we utilise a range of data sources, including a novel one, namely the Central Job Offers Database, which is a register of all vacancies submitted to Public Employment Offices. Their staff members code the vacancies according to the ISCO and KZiS. A hierarchical multi-class classifier has been developed based on the transformer architecture. The classifier begins by encoding the jobs found in advertisements to the widest 1-digit occupational group, and then narrows the assignment to a 6-digit occupation code. We show that incorporation of the hierarchical structure of occupations improves prediction accuracy by 1-2 percentage points, particularly for the hand-coded online job advertisements. Finally, a bilingual (Polish and English) and multilingual (24 languages) model is developed based on data translated using closed and open-source software. The open-source software is provided for the benefit of the official statistics community, with a particular focus on international comparability., Comment: 51 pages

Human excrement composting (HEC) is a sustainable strategy for human excrement (HE) management that recycles nutrients and mitigates health risks while reducing reliance on freshwater, fossil fuels, and fertilizers. We present a comprehensive microbial time series analysis of HEC and show that the initial gut-like microbiome of HEC systems transitions to a microbiome similar to soil and traditional compost in fifteen biological replicates tracked weekly for one year., Comment: Main text: 9 pages, 2 figures; Extended data: 10 figures; Supplemental Text: 32 pages, 8 figures, 2 tables

This document is comprised of a collection of updated preliminary parameters for the key parts of the muon collider. The updated preliminary parameters follow on from the October 2023 Tentative Parameters Report. Particular attention has been given to regions of the facility that are believed to hold greater technical uncertainty in their design and that have a strong impact on the cost and power consumption of the facility. The data is collected from a collaborative spreadsheet and transferred to overleaf.

This study investigates the propagation of an ultrafast laser pulse through a liquid medium. A femtosecond laser oscillator with a pulse duration of less than 8 fs is used. By conducting experiments with coumarin and fluorescein dyes in water, methanol, and chloroform, we analyze two-photon absorption (TPA) fluorescence, a method pioneered by Schr\"oder [Opt. Express 14, 10125 (2006)]. A numerical algorithm we developed to model the fluorescence signal determines the group velocity dispersion (GVD), the third-order dispersion (TOD), and the group delay dispersion (GDD). Autocorrelation measurements combined with a detailed analysis confirm the validity of our method and the accuracy of the retrieved temporal profile of the pulse. This cost-effective approach is robust and useful for laser pulse characterization, outperforming traditional methods in terms of alignment sensitivity. Our method allows us to study the time evolution of the pulses as they propagate through the liquid, determines higher-order phase terms as acquired by the pulse while reflecting off the chirped mirrors and propagating through the liquid, and even works for non-Gaussian spectral intensities of the laser., Comment: 15 pages, 8 figures

We present the first X-ray polarization measurement of the neutron star low-mass X-ray binary and Z-source, GX 340$+$0, in the normal branch (NB) using a 200 ks observation with the Imaging X-ray Polarimetric Explorer (IXPE). This observation was performed in 2024 August. Along with IXPE, we also conducted simultaneous observations with NICER, AstroSat, Insight-HXMT, ATCA, and GMRT to investigate the broadband spectral and timing properties in the X-ray and radio wavelengths. During the campaign, the source traced a complete Z-track during the IXPE observation but spent most of the time in the NB. We measure X-ray polarization degree (PD) of $1.22\pm0.25\%$ in the 2-8 keV energy band with a polarization angle (PA) of $38\pm6^\circ$. The PD in the NB is observed to be weaker than in the horizontal branch (HB) but aligned in the same direction. The PD of the source exhibits a marginal increase with energy while the PA shows no energy dependence. The joint spectro-polarimetric modeling is consistent with the observed X-ray polarization originating from a single spectral component from the blackbody, the Comptonized emission, or reflection feature, while the disk emission does not contribute towards the X-ray polarization. GMRT observations at 1.26 GHz during HB had a tentative detection at 4.5$\pm$0.7 mJy while ATCA observations a day later during the NB detected the source at 0.70$\pm$0.05 mJy and 0.59$\pm$0.05 mJy in the 5.5 & 9 GHz bands, respectively, suggesting an evolving jet structure depending on the Z-track position., Comment: 17 pages, 5 figures, 4 tables; Submitted to ApJ

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every Johnson graph has a signed variant with exactly two distinct eigenvalues. We also explore applications to weighing matrices, linear ternary codes, tight frames, and compute the minimum rank of Johnson graphs. Further results involve the minimum number of distinct eigenvalues for graphs in association schemes, distance-regular graphs, and Hamming graphs. We also draw some connections with simplicial complexes and higher-order Laplacians., Comment: 33 pages, 2 figures, and 2 tables. This version includes new results added in Section 6. Additionally, Section 7, which discusses the summary and further questions, has been introduced

We analyze generalizations of algorithms based on the short-path framework first proposed by Hastings [Quantum 2, 78 (2018)], which has been extended and shown by Dalzell et al. [STOC '22] to achieve super-Grover speedups for certain binary optimization problems. We demonstrate that, under some commonly satisfied technical conditions, an appropriate generalization can achieve super-quadratic speedups not only over unstructured search but also over a classical optimization algorithm that searches for the optimum by drawing samples from the stationary distribution of a Markov Chain. We employ this framework to obtain algorithms for problems including variants of Max-Bisection, Max Independent Set, the Ising Model, and the Sherrington Kirkpatrick Model, whose runtimes are asymptotically faster than those obtainable from previous short path techniques. For random regular graphs of sufficiently high degree, our algorithm is super-quadratically faster than the best rigorously proven classical runtimes for regular graphs. Our results also shed light on the quantum nature of short path algorithms, by identifying a setting where our algorithm is super-quadratically faster than any polynomial time Gibbs sampler, unless NP = RP. We conclude the paper with a numerical analysis that guides the choice of parameters for short path algorithms and raises the possibility of super-quadratic speedups in settings that are currently beyond our theoretical analysis.

Companies support their customers using live chats and chatbots to gain their loyalty. AFAS is a Dutch company aiming to leverage the opportunity large language models (LLMs) offer to answer customer queries with minimal to no input from its customer support team. Adding to its complexity, it is unclear what makes a response correct, and that too in Dutch. Further, with minimal data available for training, the challenge is to identify whether an answer generated by a large language model is correct and do it on the fly. This study is the first to define the correctness of a response based on how the support team at AFAS makes decisions. It leverages literature on natural language generation and automated answer grading systems to automate the decision-making of the customer support team. We investigated questions requiring a binary response (e.g., Would it be possible to adjust tax rates manually?) or instructions (e.g., How would I adjust tax rate manually?) to test how close our automated approach reaches support rating. Our approach can identify wrong messages in 55\% of the cases. This work shows the viability of automatically assessing when our chatbot tell lies., Comment: 10 pages + 2 pages references, 4 figures

Synchrotron X-ray emission has been detected from nearly a dozen young supernova remnants (SNRs). X-rays of synchrotron origin exhibit linear polarization in a regular, non-randomly oriented magnetic field. The significant polarized X-ray emission from four such SNRs has already been reported on the basis of observations with the Imaging X-ray Polarimetry Explorer (IXPE). The magnetic-field structure as derived from IXPE observations is radial for Cassiopeia A, Tycho's SNR, and SN 1006, and tangential for RX J1713.7-3946. The latter together with the recent detection of a tangential magnetic field in SNR 1E 0102.2-7219 by the Australia Telescope Compact Array in the radio band shows that tangential magnetic fields can also be present in young SNRs. Thus, the dichotomy in polarization between young and middle-aged SNRs (radial magnetic fields in young SNRs, but tangential magnetic fields in middle-aged SNRs), previously noticed in the radio band, deserves additional attention. The present analysis of IXPE observations determines, for the first time, a magnetic-field structure in the northwestern rim of Vela Jr, also known as RX J0852.0-4622, and provides a new example of a young SNR with a tangential magnetic field., Comment: Accepted for publication in Astronomy and Astrophysics

X-ray polarization is a unique new probe of the particle acceleration in astrophysical jets made possible through the Imaging X-ray Polarimetry Explorer. Here we report on the first dense X-ray polarization monitoring campaign on the blazar Mrk 421. Our observations were accompanied by an even denser radio and optical polarization campaign. We find significant short-timescale variability in both X-ray polarization degree and angle, including a $\sim90^\circ$ angle rotation about the jet axis. We attribute this to random variations of the magnetic field, consistent with the presence of turbulence but also unlikely to be explained by turbulence alone. At the same time, the degree of lower-energy polarization is significantly lower and shows no more than mild variability. Our campaign provides further evidence for a scenario in which energy-stratified shock-acceleration of relativistic electrons, combined with a turbulent magnetic field, is responsible for optical to X-ray synchrotron emission in blazar jets., Comment: 23 pages, including 8 pages of appendices. 12 figures, 3 tables. Submitted to ApJ

This paper presents a framework for multi-agent navigation in structured but dynamic environments, integrating three key components: a shared semantic map encoding metric and semantic environmental knowledge, a claim policy for coordinating access to areas within the environment, and a Model Predictive Controller for generating motion trajectories that respect environmental and coordination constraints. The main advantages of this approach include: (i) enforcing area occupancy constraints derived from specific task requirements; (ii) enhancing computational scalability by eliminating the need for collision avoidance constraints between robotic agents; and (iii) the ability to anticipate and avoid deadlocks between agents. The paper includes both simulations and physical experiments demonstrating the framework's effectiveness in various representative scenarios.

Return words are a classical tool for studying shift spaces with low factor complexity. In recent years, their projection inside groups have attracted some attention, for instance in the context of dendric shift spaces, of generation of pseudorandom numbers (through the welldoc property), and of profinite invariants of shift spaces. Aiming at unifying disparate works, we introduce a notion of stability for subgroups generated by return words. Within this framework, we revisit several existing results and generalize some of them. We also study general aspects of stability, such as decidability or closure under certain operations.

The significant growth in the aquaculture industry over the last few decades encourages new technological and robotic solutions to help improve the efficiency and safety of production. In sea-based farming of Atlantic salmon in Norway, Unmanned Underwater Vehicles (UUVs) are already being used for inspection tasks. While new methods, systems and concepts for sub-sea operations are continuously being developed, these systems generally does not take into account how their presence might impact the fish. This abstract presents an experimental study on how underwater robotic operations at fish farms in Norway can affect farmed Atlantic salmon, and how the fish behaviour changes when exposed to the robot. The abstract provides an overview of the case study, the methods of analysis, and some preliminary results., Comment: 5 pages, 3 figures, accepted to IEEE IROS Workshop on Autonomous Robotic Systems in Aquaculture: Research Challenges and Industry Needs

We look at the long-standing problem of segmenting unlabeled speech into word-like segments and clustering these into a lexicon. Several previous methods use a scoring model coupled with dynamic programming to find an optimal segmentation. Here we propose a much simpler strategy: we predict word boundaries using the dissimilarity between adjacent self-supervised features, then we cluster the predicted segments to construct a lexicon. For a fair comparison, we update the older ES-KMeans dynamic programming method with better features and boundary constraints. On the five-language ZeroSpeech benchmarks, our simple approach gives similar state-of-the-art results compared to the new ES-KMeans+ method, while being almost five times faster. Project webpage: https://s-malan.github.io/prom-seg-clus., Comment: Accepted at ICASSP 2025

We employ a probabilistic mesoscopic description to draw conceptual and quantitative analogies between Brownian motion and late-time fluctuations of thermal correlation functions in generic chaotic systems respecting ETH. In this framework, thermal correlation functions of `simple' operators are described by stochastic processes, which are able to probe features of the microscopic theory only in a probabilistic sense. We apply this formalism to the case of semiclassical gravity in AdS$_3$, showing that wormhole contributions can be naturally identified as moments of stochastic processes. We also point out a `Matryoshka doll' recursive structure in which information is hidden in higher and higher moments, and which can be naturally justified within the stochastic framework. We then re-interpret the gravitational results from the boundary perspective, promoting the OPE data of the CFT to probability distributions. The outcome of this study shows that semiclassical gravity in AdS can be naturally interpreted as a mesoscopic description of quantum gravity, and a mesoscopic holographic duality can be framed as a moment-vs-probability-distribution duality., Comment: 28 pages and 3 figures

We propose a triality relating the Double-Scaled SYK model, $SL(2,\mathbb{C})$ Chern-Simons theory on a disk with an irregular singularity at the center and the outcome of ``real Schur quantization'' applied to $SU(2)$ Seiberg-Witten theory with Neumann boundary conditions. We give supporting evidence for our conjecture by establishing a precise match between a general class of correlators in all three systems., Comment: 38 pages, 6 figures

Industrially relevant constrained optimization problems, such as portfolio optimization and portfolio rebalancing, are often intractable or difficult to solve exactly. In this work, we propose and benchmark a decomposition pipeline targeting portfolio optimization and rebalancing problems with constraints. The pipeline decomposes the optimization problem into constrained subproblems, which are then solved separately and aggregated to give a final result. Our pipeline includes three main components: preprocessing of correlation matrices based on random matrix theory, modified spectral clustering based on Newman's algorithm, and risk rebalancing. Our empirical results show that our pipeline consistently decomposes real-world portfolio optimization problems into subproblems with a size reduction of approximately 80%. Since subproblems are then solved independently, our pipeline drastically reduces the total computation time for state-of-the-art solvers. Moreover, by decomposing large problems into several smaller subproblems, the pipeline enables the use of near-term quantum devices as solvers, providing a path toward practical utility of quantum computers in portfolio optimization.

High-quality element distribution maps enable precise analysis of the material composition and condition of Old Master paintings. These maps are typically produced from data acquired through Macro X-ray fluorescence (MA-XRF) scanning, a non-invasive technique that collects spectral information. However, MA-XRF is often limited by a trade-off between acquisition time and resolution. Achieving higher resolution requires longer scanning times, which can be impractical for detailed analysis of large artworks. Super-resolution MA-XRF provides an alternative solution by enhancing the quality of MA-XRF scans while reducing the need for extended scanning sessions. This paper introduces a tailored super-resolution approach to improve MA-XRF analysis of Old Master paintings. Our method proposes a novel adversarial neural network architecture for MA-XRF, inspired by the Learned Iterative Shrinkage-Thresholding Algorithm. It is specifically designed to work in an unsupervised manner, making efficient use of the limited available data. This design avoids the need for extensive datasets or pre-trained networks, allowing it to be trained using just a single high-resolution RGB image alongside low-resolution MA-XRF data. Numerical results demonstrate that our method outperforms existing state-of-the-art super-resolution techniques for MA-XRF scans of Old Master paintings.

Computed Tomography (CT) is widely used in healthcare for detailed imaging. However, Low-dose CT, despite reducing radiation exposure, often results in images with compromised quality due to increased noise. Traditional methods, including preprocessing, post-processing, and model-based approaches that leverage physical principles, are employed to improve the quality of image reconstructions from noisy projections or sinograms. Recently, deep learning has significantly advanced the field, with diffusion models outperforming both traditional methods and other deep learning approaches. These models effectively merge deep learning with physics, serving as robust priors for the inverse problem in CT. However, they typically require prolonged computation times during sampling. This paper introduces the first approach to merge deep unfolding with Direct Diffusion Bridges (DDBs) for CT, integrating the physics into the network architecture and facilitating the transition from degraded to clean images by bypassing excessively noisy intermediate stages commonly encountered in diffusion models. Moreover, this approach includes a tailored training procedure that eliminates errors typically accumulated during sampling. The proposed approach requires fewer sampling steps and demonstrates improved fidelity metrics, outperforming many existing state-of-the-art techniques.

As statistical analyses become more central to science, industry and society, there is a growing need to ensure correctness of their results. Approximate correctness can be verified by replicating the entire analysis, but can we verify without replication? Building on a recent line of work, we study proof-systems that allow a probabilistic verifier to ascertain that the results of an analysis are approximately correct, while drawing fewer samples and using less computational resources than would be needed to replicate the analysis. We focus on distribution testing problems: verifying that an unknown distribution is close to having a claimed property. Our main contribution is a interactive protocol between a verifier and an untrusted prover, which can be used to verify any distribution property that can be decided in polynomial time given a full and explicit description of the distribution. If the distribution is at statistical distance $\varepsilon$ from having the property, then the verifier rejects with high probability. This soundness property holds against any polynomial-time strategy that a cheating prover might follow, assuming the existence of collision-resistant hash functions (a standard assumption in cryptography). For distributions over a domain of size $N$, the protocol consists of $4$ messages and the communication complexity and verifier runtime are roughly $\widetilde{O}\left(\sqrt{N} / \varepsilon^2 \right)$. The verifier's sample complexity is $\widetilde{O}\left(\sqrt{N} / \varepsilon^2 \right)$, and this is optimal up to $\polylog(N)$ factors (for any protocol, regardless of its communication complexity). Even for simple properties, approximately deciding whether an unknown distribution has the property can require quasi-linear sample complexity and running time. For any such property, our protocol provides a quadratic speedup over replicating the analysis.

Given an image query, visually prompted keyword localisation (VPKL) aims to find occurrences of the depicted word in a speech collection. This can be useful when transcriptions are not available for a low-resource language (e.g. if it is unwritten). Previous work showed that VPKL can be performed with a visually grounded speech model trained on paired images and unlabelled speech. But all experiments were done on English. Moreover, transcriptions were used to get positive and negative pairs for the contrastive loss. This paper introduces a few-shot learning scheme to mine pairs automatically without transcriptions. On English, this results in only a small drop in performance. We also - for the first time - consider VPKL on a real low-resource language, Yoruba. While scores are reasonable, here we see a bigger drop in performance compared to using ground truth pairs because the mining is less accurate in Yoruba.

Nowadays superconducting radio frequency (SRF) cavities represent fundamental tools used for (Standard Model) particle acceleration, (beyond Standard Model) particle probing and long-lifetime photon preservation. We study the SRF frequency shift in the vicinity of the critical temperature $T_c$ and the quality factor mainly at low temperatures within the Dynes superconductor model. We scrutinize and use the local limit response to the external electromagnetic field. Our approach allows for a finer analysis of the peculiar behavior of the resonant frequency shift immensely close to $T_c$, observed in recent experiments. In the ideal dirty limit, we analytically elaborate on the width and depth of the resulting dip. Studying the sign of the slope of the resonant frequency shift at $T_c$ in the moderately clean regime reveals the role of the pair-breaking and pair-conserving disorder. Next, to find the relevance of our description, we compare and also fit our results with the recent experimental data from the N-doped Nb sample presented in [arXiv:2307.07905v1]. Our analysis remarkably complies with the experimental findings, especially concerning the dip width. We offer straightforward, homogeneous-disorder-based interpretation within the moderately clean regime. Assuming the same regime at low temperatures, we address details of the high-quality plateaus. Summing all up, this work presents (and studies the limits of) the simple effective description of the complex problem corresponding to the electromagnetic response in the superconductors combining homogeneous conventional pairing and two different kinds of disorder scattering., Comment: 16 pages, 13 figures, 2 appendices

Quasi-periodic Eruptions (QPEs) are luminous bursts of soft X-rays from the nuclei of galaxies, repeating on timescales of hours to weeks. The mechanism behind these rare systems is uncertain, but most theories involve accretion disks around supermassive black holes (SMBHs), undergoing instabilities or interacting with a stellar object in a close orbit. It has been suggested that this disk could be created when the SMBH disrupts a passing star, implying that many QPEs should be preceded by observable tidal disruption events (TDEs). Two known QPE sources show long-term decays in quiescent luminosity consistent with TDEs, and two observed TDEs have exhibited X-ray flares consistent with individual eruptions. TDEs and QPEs also occur preferentially in similar galaxies. However, no confirmed repeating QPEs have been associated with a spectroscopically confirmed TDE or an optical TDE observed at peak brightness. Here we report the detection of nine X-ray QPEs with a mean recurrence time of approximately 48 hours from AT2019qiz, a nearby and extensively studied optically-selected TDE. We detect and model the X-ray, ultraviolet and optical emission from the accretion disk, and show that an orbiting body colliding with this disk provides a plausible explanation for the QPEs.

Modern artificial intelligence (AI) systems are powered by foundation models. This paper presents a new set of foundation models, called Llama 3. It is a herd of language models that natively support multilinguality, coding, reasoning, and tool usage. Our largest model is a dense Transformer with 405B parameters and a context window of up to 128K tokens. This paper presents an extensive empirical evaluation of Llama 3. We find that Llama 3 delivers comparable quality to leading language models such as GPT-4 on a plethora of tasks. We publicly release Llama 3, including pre-trained and post-trained versions of the 405B parameter language model and our Llama Guard 3 model for input and output safety. The paper also presents the results of experiments in which we integrate image, video, and speech capabilities into Llama 3 via a compositional approach. We observe this approach performs competitively with the state-of-the-art on image, video, and speech recognition tasks. The resulting models are not yet being broadly released as they are still under development.