Search

In view of recently demonstrated joint use of novel Fourier-transform techniques and effective high-accuracy frequency domain solvers related to the Method of Moments, it is argued that a set of transformative innovations could be developed for the effective, accurate and efficient simulation of problems of wave propagation and scattering of broadband, time-dependent wavefields. This contribution aims to convey the character of these methods and to highlight their applicability in computational modeling of electromagnetic configurations across various fields of science and engineering.

We demonstrate the inter-translatability of proofs between the most prominent sequent-based formalisms for G\"odel-L\"ob provability logic. In particular, we consider Sambin and Valentini's sequent system GLseq, Shamkanov's non-wellfounded and cyclic sequent systems GL$\infty$ and GLcirc, Poggiolesi's tree-hypersequent system CSGL, and Negri's labeled sequent system G3GL. Shamkanov showed how to transform proofs between GLseq, GL$\infty$, and GLcirc, and Gor\'e and Ramanayake showed how to transform proofs between CSGL and G3GL, however, the exact nature of proof transformations between the former three systems and the latter two systems has remained an open problem. We solve this open problem by showing how to restructure tree-hypersequent proofs into an end-active form and introduce a novel linearization technique that transforms such proofs into linear nested sequent proofs. As a result, we obtain a new proof-theoretic tool for extracting linear nested sequent systems from tree-hypersequent systems, which yields the first cut-free linear nested sequent calculus LNGL for G\"odel-L\"ob provability logic. We show how to transform proofs in LNGL into a certain normal form, where proofs repeat in stages of modal and local rule applications, and which are translatable into GLseq and G3GL proofs. These new syntactic transformations, together with those mentioned above, establish full proof-theoretic correspondences between GLseq, GL$\infty$, GLcirc, CSGL, G3GL, and LNGL while also giving (to the best of the author's knowledge) the first constructive proof mappings between structural (viz. labeled, tree-hypersequent, and linear nested sequent) systems and a cyclic sequent system., Comment: Accepted to CSL 2025

The in-plane motion of an electron on helium can couple to superconducting microwave resonators via electrical dipole coupling, offering a robust and rapid readout scheme. In previous efforts, microwave resonator designs for electrons on helium have lacked the coupling strength to reach the strong coupling regime, where coherent quantum effects outlast both electron and resonator decoherence rates. High-impedance superconducting microwave resonators offer a path to strong coupling, but integrating such resonators with electrons on helium remains an outstanding challenge. Here, we introduce a high-impedance resonator design compatible with strong coupling to electrons on helium. We fabricate and measure titanium nitride resonators with median internal quality factors of $3.9\times 10^5$ and average impedance of 2.5 k$\Omega$, promising a seven-fold increase in coupling strength compared with standard 50$\Omega$ resonators. Additionally, we develop a simplified resonator model from the capacitance matrix and sheet inductance that accurately predicts the mode frequencies, significantly simplifying the design process of future resonators for investigating quantum effects with electrons on helium., Comment: 15 pages, 7 figures, 2 tables

This study presents a comprehensive analysis of the infrared (IR) luminosity functions (LF) of star-forming (SF) galaxies and active galactic nuclei (AGN) using data from the ZFOURGE survey. We employ CIGALE to decompose the spectral energy distribution (SED) of galaxies into SF and AGN components to investigate the co-evolution of these processes at higher redshifts and fainter luminosities. Our CIGALE-derived SF and AGN LFs are generally consistent with previous studies, with an enhancement at the faint end of the AGN LFs. We attribute this to CIGALE's capability to recover low-luminosity AGN more accurately, which may be underrepresented in other works. As anticipated, the CIGALE SF LFs are best fit with a Schechter function, whereas the AGN LFs align more closely with a Saunders function. We find evidence for a significant evolutionary epoch for AGN activity at $z \approx 1$, comparable to the peak of cosmic star formation at $z \approx 2$, which we also recover well. Based on our results, the gas supply in the early universe favoured the formation of brighter star-forming galaxies until $z=2$, below which the gas for SF becomes increasingly exhausted. Conversely, AGN activity peaked earlier and declined more slowly until $z \approx 1$, suggesting a possible feedback scenario in which $2.5-3$ Gyrs offset the evolution of SF and AGN activity., Comment: 16 pages, 7 figures, 8 tables. Submitted for publication in PASA

Low latency models are critical for real-time speech enhancement applications, such as hearing aids and hearables. However, the sub-millisecond latency space for resource-constrained hearables remains underexplored. We demonstrate speech enhancement using a computationally efficient minimum-phase FIR filter, enabling sample-by-sample processing to achieve mean algorithmic latency of 0.32 ms to 1.25 ms. With a single microphone, we observe a mean SI-SDRi of 4.1 dB. The approach shows generalization with a DNSMOS increase of 0.2 on unseen audio recordings. We use a lightweight LSTM-based model of 644k parameters to generate FIR taps. We benchmark that our system can run on low-power DSP with 388 MIPS and mean end-to-end latency of 3.35 ms. We provide a comparison with baseline low-latency spectral masking techniques. We hope this work will enable a better understanding of latency and can be used to improve the comfort and usability of hearables.

While there is much indirect evidence for the existence of dark matter (DM), to date it has evaded detection. Current efforts focus on DM masses over $\sim$GeV -- to push the sensitivity of DM searches to lower masses, new DM targets and detection schemes are needed. In this work, we focus on the latter - a novel detection scheme recently proposed to detect ~10-100 meV phonons in polar target materials. Previous work showed that well-motivated models of DM can interact with polar semiconductors to produce an athermal population of phonons. This new sensing scheme proposes that these phonons then facilitate quantum evaporation of $^3$He from a van der Waals film deposited on the target material. However, a fundamental understanding of the underlying process is still unclear, with several uncertainties related to the precise rate of evaporation and how it can be controlled. In this work, we use \textit{ab initio} density functional theory (DFT) calculations to compare the adsorption energies of helium atoms on a polar target material, sodium iodide (NaI), to understand the underlying evaporation physics. We explore the role of surface termination, monolayer coverage and elemental species on the rate of He evaporation from the target material. Using this, we discuss the optimal target features for He-evaporation experiments and their range of tunability through chemical and physical modifications such as applied field and surface termination.

For learned image representations, basic autoencoders often produce blurry results. Reconstruction quality can be improved by incorporating additional penalties such as adversarial (GAN) and perceptual losses. Arguably, these approaches lack a principled interpretation. Concurrently, in generative settings diffusion has demonstrated a remarkable ability to create crisp, high quality results and has solid theoretical underpinnings (from variational inference to direct study as the Fisher Divergence). Our work combines autoencoder representation learning with diffusion and is, to our knowledge, the first to demonstrate the efficacy of jointly learning a continuous encoder and decoder under a diffusion-based loss. We demonstrate that this approach yields better reconstruction quality as compared to GAN-based autoencoders while being easier to tune. We also show that the resulting representation is easier to model with a latent diffusion model as compared to the representation obtained from a state-of-the-art GAN-based loss. Since our decoder is stochastic, it can generate details not encoded in the otherwise deterministic latent representation; we therefore name our approach "Sample what you can't compress", or SWYCC for short.

In order to develop robots that can effectively serve as versatile and capable home assistants, it is crucial for them to reliably perceive and interact with a wide variety of objects across diverse environments. To this end, we proposed Open Vocabulary Mobile Manipulation as a key benchmark task for robotics: finding any object in a novel environment and placing it on any receptacle surface within that environment. We organized a NeurIPS 2023 competition featuring both simulation and real-world components to evaluate solutions to this task. Our baselines on the most challenging version of this task, using real perception in simulation, achieved only an 0.8% success rate; by the end of the competition, the best participants achieved an 10.8\% success rate, a 13x improvement. We observed that the most successful teams employed a variety of methods, yet two common threads emerged among the best solutions: enhancing error detection and recovery, and improving the integration of perception with decision-making processes. In this paper, we detail the results and methodologies used, both in simulation and real-world settings. We discuss the lessons learned and their implications for future research. Additionally, we compare performance in real and simulated environments, emphasizing the necessity for robust generalization to novel settings.

We define and study translations between the maximal class of analytic display calculi for tense logics and labeled sequent calculi, thus solving an open problem about the translatability of proofs between the two formalisms. In particular, we provide PTIME translations that map cut-free display proofs to and from special cut-free labeled proofs, which we dub 'strict' labeled proofs. This identifies the space of cut-free display proofs with a polynomially equivalent subspace of labeled proofs, showing how calculi within the two formalisms polynomially simulate one another. We analyze the relative sizes of proofs under this translation, finding that display proofs become polynomially shorter when translated to strict labeled proofs, though with a potential increase in the length of sequents; in the reverse translation, strict labeled proofs may become polynomially larger when translated into display proofs. In order to achieve our results, we formulate labeled sequent calculi in a new way that views rules as 'templates', which are instantiated with substitutions to obtain rule applications; we also provide the first definition of primitive tense structural rules within the labeled sequent formalism. Therefore, our formulation of labeled calculi more closely resembles how display calculi are defined for tense logics, which permits a more fine-grained analysis of rules, substitutions, and translations. This work establishes that every analytic display calculus for a tense logic can be viewed as a labeled sequent calculus, showing conclusively that the labeled formalism subsumes and extends the display formalism in the setting of primitive tense logics.

A review of recent results from searches for new physics is presented. The analyses exploit data sets collected by the CMS experiment during Run 2 of the CERN LHC. Searches for exotic particles decaying into two bosons and for heavy neutral leptons, as well as a model-agnostic search based on anomaly detection are summarised. No significant sign for the presence of new physics was found. Prospects for the CMS parking strategy during Run 3 are also discussed., Comment: Contribution to the 2024 QCD session of the 58th Rencontres de Moriond

A number of nearby dwarf galaxies have globular cluster (GC) candidates that require spectroscopic confirmation. Here we present Keck telescope spectra for 15 known GCs and GC candidates that may be associated with a host dwarf galaxy, and an additional 3 GCs in the halo of M31 that are candidates for accretion from a now disrupted dwarf galaxy. We confirm 6 star clusters (of intermediate-to-old age) to be associated with NGC~247. The vast bulk of its GC system remains to be studied spectroscopically. We also confirm the GC candidates in F8D1 and DDO190, finding both to be young star clusters. The 3 M31 halo GCs all have radial velocities consistent with M31, are old and very metal-poor. Their ages and metallicities are consistent with accretion from a low mass satellite galaxy. Finally, three objects are found to be background galaxies -- two are projected near NGC~247 and one (candidate GCC7) is near the IKN dwarf. The IKN dwarf thus has only 5 confirmed GCs but still a remarkable specific frequency of 124., Comment: 7 pages, 5 figures, accepted for publication in PASA

The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form $\Diamond^{k} p \rightarrow \Diamond^{n} p$, has remained a long-standing open problem. In this paper, we make significant progress toward solving this problem and show that decidability holds for a large subclass of these logics, namely, for 'quasi-dense logics.' Such logics are extensions of K with with modal reduction axioms such that $0 < k < n$ (dubbed 'quasi-density axioms'). To prove decidability, we define novel proof systems for quasi-dense logics consisting of disjunctive existential rules, which are first-order formulae typically used to specify ontologies in the context of database theory. We show that such proof systems can be used to generate proofs and models of modal formulae, and provide an intricate model-theoretic argument showing that such generated models can be encoded as finite objects called 'templates.' By enumerating templates of bound size, we obtain an EXPSPACE decision procedure as a consequence., Comment: preprint; accepted to LICS 2024

We present the census of H$\beta$+[OIII] 4960,5008 \AA emitters at 6.87$ galaxies. We report a rapid decline of the [OIII] luminosity density at $z\gtrsim 6-7$ which cannot be explained by the evolution of the cosmic star-formation rate density. Finally we find that FRESCO detects in only 2h galaxies likely accounting for $\sim 10-20\%$ of the ionising budget at $z=7-8$ (assuming an escape fraction of 10%), raising the prospect of directly detecting a significant fraction of the sources of reionisation with JWST., Comment: 20 pages + appendices. Accepted in MNRAS. Public catalogue release at https://github.com/rameyer/fresco. V3: matching accepted version

We present the first results on the spatial distribution of star formation in 454 star-forming galaxies at $4.8

The open-source CARFAC (Cascade of Asymmetric Resonators with Fast-Acting Compression) cochlear model is upgraded to version 2, with improvements to the Matlab implementation, and with new Python/NumPy and JAX implementations -- but C++ version changes are still pending. One change addresses the DC (direct current, or zero frequency) quadratic distortion anomaly previously reported; another reduces the neural synchrony at high frequencies; the others have little or no noticeable effect in the default configuration. A new feature allows modeling a reduction of cochlear amplifier function, as a step toward a differentiable parameterized model of hearing impairment. In addition, the integration into the Auditory Model Toolbox (AMT) has been extensively improved, as the prior integration had bugs that made it unsuitable for including CARFAC in multi-model comparisons.

It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains in the model into a constant domain. This makes it a very challenging problem to find a sound and complete proof system for first-order bi-intuitionistic logic with non-constant domains, that is also conservative over first-order intuitionistic logic. We solve this problem by presenting the first sound and complete proof system for first-order bi-intuitionistic logic with increasing domains. We formalize our proof system in a labeled polytree sequent calculus (a notational variant of nested sequents), and prove that it enjoys cut-elimination and is conservative over first-order intuitionistic logic. A key feature of our calculus is an explicit eigenvariable context, which allows us to control precisely the scope of free variables in a polytree structure. Semantically this context can be seen as encoding a notion of Scott's existence predicate for intuitionistic logic. This turns out to be crucial to avoid the collapse of domains and to prove the completeness of our proof system. The explicit consideration of the variable context in a formula sheds light on a previously overlooked dependency between the residuation principle and the existence predicate in the first-order setting, that may help explain the difficulty in obtaining a complete proof system for first-order bi-intuitionistic logic.

We introduce a constructive method applicable to a large number of description logics (DLs) for establishing the concept-based Beth definability property (CBP) based on sequent systems. Using the highly expressive DL RIQ as a case study, we introduce novel sequent calculi for RIQ-ontologies and show how certain interpolants can be computed from sequent calculus proofs, which permit the extraction of explicit definitions of implicitly definable concepts. To the best of our knowledge, this is the first sequent-based approach to computing interpolants and definitions within the context of DLs, as well as the first proof that RIQ enjoys the CBP. Moreover, due to the modularity of our sequent systems, our results hold for restrictions of RIQ, and are applicable to other DLs by suitable modifications., Comment: Accepted to IJCAI 2024

We present JWST/NIRCam observations of a strongly-lensed, multiply-imaged galaxy at $z=6.072$, with magnification factors >~20 across the galaxy. We perform a spatially-resolved analysis of the physical properties at scales of ~200 pc, inferred from SED modelling of 5 NIRCam imaging bands on a pixel-by-pixel basis. We find young stars surrounded by extended older stellar populations. By comparing H$\alpha$+[NII] and [OIII]+H$\beta$ maps inferred from the image analysis with our additional NIRSpec IFU data, we find that the spatial distribution and strength of the line maps are in agreement with the IFU measurements. We explore different parametric SFH forms with Bagpipes on the spatially-integrated photometry, finding that a double power-law star formation history retrieves the closest value to the spatially-resolved stellar mass estimate, and other SFH forms suffer from the dominant outshining emission from the youngest stars, thus underestimating the stellar mass - up to ~0.5 dex-. On the other hand, the DPL cannot match the IFU measured emission lines. Additionally, the ionizing photon production efficiency may be overestimated in a spatially-integrated approach by ~0.15 dex, when compared to a spatially-resolved analysis. The agreement with the IFU measurements points towards the pixel-by-pixel approach as a way to mitigate the general degeneracy between the flux excess from emission lines and underlying continuum, especially when lacking photometric medium-band coverage and/or IFU observations. This study stresses the importance of studying galaxies as the complex systems that they are, resolving their stellar populations when possible, or using more flexible SFH parameterisations. This can aid our understanding of the early stages of galaxy evolution by addressing the challenge of inferring robust stellar masses and ionizing photon production efficiencies of high redshift galaxies., Comment: Submitted to A&A; 13 pages. See also the companion papers on arXiv today: Fujimoto+2024 and Valentino+2024

We present details on a new measurement of the muon magnetic anomaly, $a_\mu = (g_\mu -2)/2$. The result is based on positive muon data taken at Fermilab's Muon Campus during the 2019 and 2020 accelerator runs. The measurement uses $3.1$ GeV$/c$ polarized muons stored in a $7.1$-m-radius storage ring with a $1.45$ T uniform magnetic field. The value of $ a_{\mu}$ is determined from the measured difference between the muon spin precession frequency and its cyclotron frequency. This difference is normalized to the strength of the magnetic field, measured using Nuclear Magnetic Resonance (NMR). The ratio is then corrected for small contributions from beam motion, beam dispersion, and transient magnetic fields. We measure $a_\mu = 116 592 057 (25) \times 10^{-11}$ (0.21 ppm). This is the world's most precise measurement of this quantity and represents a factor of $2.2$ improvement over our previous result based on the 2018 dataset. In combination, the two datasets yield $a_\mu(\text{FNAL}) = 116 592 055 (24) \times 10^{-11}$ (0.20 ppm). Combining this with the measurements from Brookhaven National Laboratory for both positive and negative muons, the new world average is $a_\mu$(exp) $ = 116 592 059 (22) \times 10^{-11}$ (0.19 ppm)., Comment: 48 pages, 29 figures; 4 pages of Supplement Material; version accepted for publication in Physical Review D

This paper provides a set of cut-free complete sequent-style calculi for deontic STIT ('See To It That') logics used to formally reason about choice-making, obligations, and norms in a multi-agent setting. We leverage these calculi to write a proof-search algorithm deciding deontic, multi-agent STIT logics with (un)limited choice and introduce a loop-checking mechanism to ensure the termination of the algorithm. Despite the acknowledged potential for deontic reasoning in the context of autonomous, multi-agent scenarios, this work is the first to provide a syntactic decision procedure for this class of logics. Our proof-search procedure is designed to provide verifiable witnesses/certificates of the (in)validity of formulae, which permits an analysis of the (non)theoremhood of formulae and act as explanations thereof. We show how the proof system and decision algorithm can be used to automate normative reasoning tasks such as duty checking (viz. determining an agent's obligations relative to a given knowledge base), compliance checking (viz. determining if a choice, considered by an agent as potential conduct, complies with the given knowledge base), and joint fulfillment checking (viz. determining whether under a specified factual context an agent can jointly fulfill all their duties)., Comment: Preprint; published in the Journal of Artificial Intelligence Research 2024

Individuals with suspected rare genetic disorders often undergo multiple clinical evaluations, imaging studies, laboratory tests and genetic tests, to find a possible answer over a prolonged period of time. Addressing this "diagnostic odyssey" thus has substantial clinical, psychosocial, and economic benefits. Many rare genetic diseases have distinctive facial features, which can be used by artificial intelligence algorithms to facilitate clinical diagnosis, in prioritizing candidate diseases to be further examined by lab tests or genetic assays, or in helping the phenotype-driven reinterpretation of genome/exome sequencing data. Existing methods using frontal facial photos were built on conventional Convolutional Neural Networks (CNNs), rely exclusively on facial images, and cannot capture non-facial phenotypic traits and demographic information essential for guiding accurate diagnoses. Here we introduce GestaltMML, a multimodal machine learning (MML) approach solely based on the Transformer architecture. It integrates facial images, demographic information (age, sex, ethnicity), and clinical notes (optionally, a list of Human Phenotype Ontology terms) to improve prediction accuracy. Furthermore, we also evaluated GestaltMML on a diverse range of datasets, including 528 diseases from the GestaltMatcher Database, several in-house datasets of Beckwith-Wiedemann syndrome (BWS, over-growth syndrome with distinct facial features), Sotos syndrome (overgrowth syndrome with overlapping features with BWS), NAA10-related neurodevelopmental syndrome, Cornelia de Lange syndrome (multiple malformation syndrome), and KBG syndrome (multiple malformation syndrome). Our results suggest that GestaltMML effectively incorporates multiple modalities of data, greatly narrowing candidate genetic diagnoses of rare diseases and may facilitate the reinterpretation of genome/exome sequencing data., Comment: Significant revisions

This report introduces our UniTeam agent - an improved baseline for the "HomeRobot: Open Vocabulary Mobile Manipulation" challenge. The challenge poses problems of navigation in unfamiliar environments, manipulation of novel objects, and recognition of open-vocabulary object classes. This challenge aims to facilitate cross-cutting research in embodied AI using recent advances in machine learning, computer vision, natural language, and robotics. In this work, we conducted an exhaustive evaluation of the provided baseline agent; identified deficiencies in perception, navigation, and manipulation skills; and improved the baseline agent's performance. Notably, enhancements were made in perception - minimizing misclassifications; navigation - preventing infinite loop commitments; picking - addressing failures due to changing object visibility; and placing - ensuring accurate positioning for successful object placement.

This paper gives a broad account of the various sequent-based proof formalisms in the proof-theoretic literature. We consider formalisms for various modal and tense logics, intuitionistic logic, conditional logics, and bunched logics. After providing an overview of the logics and proof formalisms under consideration, we show how these sequent-based formalisms can be placed in a hierarchy in terms of the underlying data structure of the sequents. We then discuss how this hierarchy can be traversed using translations. Translating proofs up this hierarchy is found to be relatively easy while translating proofs down the hierarchy is substantially more difficult. Finally, we inspect the prevalent distinction in structural proof theory between 'internal calculi' and 'external calculi'. It is observed that these classes resist a rigorous separation, and we critically assess the properties that (calculi from) these classes are purported to possess.