Search

We describe the software package $\texttt{ESpRESSO}$ - [E]xtragalactic [Sp]ectroscopic [R]oman [E]mulator and [S]imulator of [S]ynthetic [O]bjects, created to emulate the slitless spectroscopic observing modes of the Nancy Grace Roman Space Telescope (Roman) Wide Field Instrument (WFI). We combine archival Hubble Space Telescope (HST) imaging data of comparable spatial resolution with model spectral energy distributions to create a data-cube of flux density as a function of position and wavelength. This data-cube is used for simulating a nine detector grism observation, producing a crowded background scene which model field angle dependent optical distortions expected for the grism. We also demonstrate the ability to inject custom sources using the described tools and pipelines. In addition, we show that spectral features such as emission line pairs are unlikely to be mistaken as off order contaminating features and vice versa. Our result is a simulation suite of half of the eighteen detector array, with a realistic background scene and injected Ly$\alpha$ emitter (LAE) galaxies, realized at 25 position angles (PAs), 12 with analogous positive and negative dithers, Using an exposure time of 10ks per PA, the full PA set can be used as a mock deep Roman grism survey with high (synthetic) LAE completeness for developing future spectral data analysis tools., Comment: 15 pages, 10 figures, 1 supplementary figure, 1 table. Submitted to MNRAS. Comments are welcome!

We perform the first direct cosmological and astrophysical parameter inference from the combination of galaxy luminosity functions and colours using a simulation based inference approach. Using the Synthesizer code we simulate the dust attenuated ultraviolet--near infrared stellar emission from galaxies in thousands of cosmological hydrodynamic simulations from the CAMELS suite, including the Swift-EAGLE, Illustris-TNG, Simba & Astrid galaxy formation models. For each galaxy we calculate the rest-frame luminosity in a number of photometric bands, including the SDSS $\textit{ugriz}$ and GALEX FUV & NUV filters; this dataset represents the largest catalogue of synthetic photometry based on hydrodynamic galaxy formation simulations produced to date, totalling >200 million sources. From these we compile luminosity functions and colour distributions, and find clear dependencies on both cosmology and feedback. We then perform simulation based (likelihood-free) inference using these distributions, and obtain constraints on both cosmological and astrophysical parameters. Both colour distributions and luminosity functions provide complementary information on certain parameters when performing inference. Most interestingly we achieve constraints on $\sigma_8$, describing the clustering of matter. This is attributable to the fact that the photometry encodes the star formation--metal enrichment history of each galaxy; galaxies in a universe with a higher $\sigma_8$ tend to form earlier and have higher metallicities, which leads to redder colours. We find that a model trained on one galaxy formation simulation generalises poorly when applied to another, and attribute this to differences in the subgrid prescriptions, and lack of flexibility in our emission modelling. The photometric catalogues are publicly available at: https://camels.readthedocs.io/ ., Comment: 28 pages, 20 figures, submitted to MNRAS. Comments and feedback welcome!

Outflows are critical components of many astrophysical systems, including accreting compact binaries and active galactic nuclei (AGN). These outflows can significantly affect a system's evolution and alter its observational appearance by reprocessing the radiation produced by the central engine. Sirocco (Simulating Ionization and Radiation in Outflows Created by Compact Objects - or "the code formerly known as Python") is a Sobolev-based Monte Carlo ionization and radiative transfer code. It is designed to simulate the spectra produced by any system with an azimuthally-symmetric outflow, from spherical stellar winds to rotating, biconical accretion disc winds. Wind models can either be parametrized or imported, e.g. from hydrodynamical simulations. The radiation sources include an optically thick accretion disc and various central sources with flexible spectra and geometries. The code tracks the "photon packets" produced by the sources in any given simulation as they traverse and interact with the wind. The code assumes radiative near-equilibrium, so the thermal and ionization state can be determined iteratively from these interactions. Once the physical properties in the wind have converged, Sirocco can be used to generate synthetic spectra at a series of observer sightlines. Here, we describe the physical assumptions, operation, performance and limitations of the code. We validate it against tardis, cmfgen and cloudy, finding good agreement, and present illustrative synthetic spectra from disc winds in cataclysmic variables, tidal disruption events, AGN and X-ray binaries. Sirocco is publicly available on GitHub, alongside its associated data, documentation and sample input files covering a wide range of astrophysical applications., Comment: 26 pages, 16 figures. Submitted to MNRAS. This is the release paper for the SIROCCO code, which can be found at https://github.com/sirocco-rt/sirocco with links to documentation. Underlying data and figure scripts available at https://github.com/sirocco-rt/release-models -- comments on the code, paper or documentation are welcomed

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.

Game-playing agents like AlphaGo have achieved superhuman performance through self-play, which is theoretically guaranteed to yield optimal policies in competitive games. However, most language tasks are partially or fully cooperative, so it is an open question whether techniques like self-play can effectively be used to improve language models. We empirically investigate this question in a negotiation game setting known as Deal or No Deal (DoND). Crucially, the objective in DoND can be modified to produce a fully cooperative game, a strictly competitive one, or anything in between. We finetune language models in self-play over multiple rounds of filtered behavior cloning in DoND for each of these objectives and evaluate them in self-play and in collaboration with humans. We find that language models improve substantially in self-play, achieving 14-17x higher scores in task reward after finetuning. Further, the trained models generalize to both cooperation and competition with humans, scoring 2.5-6x higher than base models. We view these results as an early promising sign for language model self-play in cooperative settings, despite a lack of theoretical guarantees.

The use of assistive robots in domestic environments can raise significant ethical concerns, from the risk of individual ethical harm to wider societal ethical impacts including culture flattening and compromise of human dignity. It is therefore essential to ensure that technological development of these robots is informed by robust and inclusive techniques for mitigating ethical concerns. This paper presents EHAZOP, a method for conducting an ethical hazard analysis on an assistive robot. EHAZOP draws upon collaborative, creative and structured processes originating within safety engineering, using these to identify ethical concerns associated with the operation of a given assistive robot. We present the results of a proof of concept study of EHAZOP, demonstrating the potential for this process to identify diverse ethical hazards in these systems., Comment: Presented in ICRA 2024 WORKSHOP ON ROBOT ETHICS Ethical, Legal and User Perspectives in Robotics & Automation WOROBET: https://sites.google.com/view/icra2024-robot-ethics

Join evaluation is one of the most fundamental operations performed by database systems and arguably the most well-studied problem in the Database community. A staggering number of join algorithms have been developed, and commercial database engines use finely tuned join heuristics that take into account many factors including the selectivity of predicates, memory, IO, etc. However, most of the results have catered to either full join queries or non-full join queries but with degree constraints (such as PK-FK relationships) that make joins \emph{easier} to evaluate. Further, most of the algorithms are also not output-sensitive. In this paper, we present a novel, output-sensitive algorithm for the evaluation of acyclic Conjunctive Queries (CQs) that contain arbitrary free variables. Our result is based on a novel generalization of the Yannakakis algorithm and shows that it is possible to improve the running time guarantee of the Yannakakis algorithm by a polynomial factor. Importantly, our algorithmic improvement does not depend on the use of fast matrix multiplication, as a recently proposed algorithm does. The upper bound is complemented with matching lower bounds conditioned on two variants of the $k$-clique conjecture. The application of our algorithm recovers known prior results and improves on known state-of-the-art results for common queries such as paths and stars., Comment: 24 pages, accepted to PODS'2025

Many-body quantum dynamics defined on a spatial lattice and in discrete time -- either as stroboscopic Floquet systems or quantum circuits -- has been an active area of research for several years. Being discrete in space and time, a natural question arises: when can such a model be viewed as evolving unitarily in space as well as in time? Models with this property, which sometimes goes by the name space-time duality, have been shown to have a number of interesting features related to entanglement growth and correlations. One natural way in which the property arises in the context of (brickwork) quantum circuits is by choosing dual unitary gates: two site operators that are unitary in both the space and time directions. We introduce a class of models with $q$ states per site, defined on the square lattice by a complex partition function and paremeterized in terms of $q\times q$ Hadamard matrices, that have the property of space-time duality. These may interpreted as particular dual unitary circuits or stroboscopically evolving systems, and generalize the well studied self-dual kicked Ising model. We explore the operator dynamics in the case of Clifford circuits, making connections to Clifford cellular automata [J. Math. Phys. 49, 112104 (2008)] and in the $q\to\infty$ limit to the classical spatiotemporal cat model of many body chaos [Nonlinearity 34, 2800 (2021)]. We establish integrability and the corresponding conserved charges for a large subfamily and show how the long-range entanglement protocol discussed in the recent paper [Phys. Rev. B 105, 144306 (2022)] can be reinterpreted in purely graphical terms and directly applied here.

We introduce and study the planted directed polymer, in which the path of a random walker is inferred from noisy 'images' accumulated at each timestep. Formulated as a nonlinear problem of Bayesian inference for a hidden Markov model, this problem is a generalization of the directed polymer problem of statistical physics, coinciding with it in the limit of zero signal to noise. For a 1D walker we present numerical investigations and analytical arguments that no phase transition is present. When formulated on a Cayley tree, methods developed for the directed polymer are used to show that there is a transition with decreasing signal to noise where effective inference becomes impossible, meaning that the average fractional overlap between the inferred and true paths falls from one to zero., Comment: 11 pages, 12 figures

A family of discrete Schroedinger operators is investigated through scattering theory. The continuous spectrum of these operators exhibit changes of multiplicity, and some of these operators possess resonances at thresholds. It is shown that the corresponding wave operators belong to an explicitly constructed C*-algebra, whose K-theory is carefully analysed. An index theorem is deduced from these investigations, which corresponds to a topological version of Levinson's theorem in presence of embedded thresholds, resonances, and changes of multiplicity of the scattering matrices. In the second half of the paper, very detailed computations for the simplest realisation of this family of operators are provided. In particular, a surface of resonances is exhibited, probably for the first time. For Levinson's theorem, it is shown that contributions due to resonances at the lowest value and at the highest value of the continuous spectrum play an essential role., Comment: 44 pages

We present Atacama Large Millimeter/sub-millimeter Array (ALMA) Cycle-5 observations of HBC 494, as well as calculations of the kinematic and dynamic variables which represent the object's wide-angle bipolar outflows. HBC 494 is a binary FU Orionis type object located in the Orion A molecular cloud. We take advantage of combining the ALMA main array, Atacama Compact Array (ACA), and Total Power (TP) array in order to map HBC 494's outflows and thus, estimate their kinematic parameters with higher accuracy in comparison to prior publications. We use $^{12}$CO, $^{13}$CO, C$^{18}$O and SO observations to describe the object's outflows, envelope, and disc, as well as estimate the mass, momentum, and kinetic energy of the outflows. After correcting for optical opacity near systemic velocities, we estimate a mass of $3.0\times10^{-2}$ M$_{\odot}$ for the southern outflow and $2.8\times10^{-2}$ M$_{\odot}$ for the northern outflow. We report the first detection of a secondary outflow cavity located approximately $15$" north of the central binary system, which could be a remnant of a previous large-scale accretion outburst. Furthermore, we find CO spatial features in HBC 494's outflows corresponding to position angles of $\sim35^{\circ}$ and $\sim145^{\circ}$. This suggests that HBC 494's outflows are most likely a composite of overlapping outflows from two different sources, i.e., HBC 494a and HBC 494b, the two objects in the binary system., Comment: 26 pages, 24 figures, accepted to MNRAS

In this paper, we study the complexity of evaluating Conjunctive Queries with negation (\cqneg). First, we present an algorithm with linear preprocessing time and constant delay enumeration for a class of CQs with negation called free-connex signed-acyclic queries. We show that no other queries admit such an algorithm subject to lower bound conjectures. Second, we extend our algorithm to Conjunctive Queries with negation and aggregation over a general semiring, which we call Functional Aggregate Queries with negation (\faqneg). Such an algorithm achieves constant delay enumeration for the same class of queries, but with a slightly increased preprocessing time which includes an inverse Ackermann function. We show that this surprising appearance of the Ackermmann function is probably unavoidable for general semirings, but can be removed when the semiring has specific structure. Finally, we show an application of our results to computing the difference of CQs., Comment: 39 pages

$\operatorname{Holant}^*(f)$ denotes a class of counting problems specified by a constraint function $f$. We prove complexity dichotomy theorems for $\operatorname{Holant}^*(f)$ in two settings: (1) $f$ is any arity-3 real-valued function on input of domain size 3. (2) $f$ is any arity-3 $\{0,1\}$-valued function on input of domain size 4.

Biofilms are communities of microorganisms that grow on virtually all surfaces with sufficient nutrients including aquatic and industrial water systems and medical devices. Biofilms are complex, structured communities where the interplay of growth, metabolism, and competition between species interact with physical processes of diffusion, convection, attachment, and detachment. This work describes a model of a one-dimensional biofilm in a stirred tank reactor that incorporates these complexities. The model is implemented in the modern Julia programming language providing an efficient tool for studying a large variety of biofilms and the intricate communities the microorganisms create. Details of the new software, known as Biofilm.jl, including the mathematical model and organization and execution of the code, are provided. Examples of biofilms modeled using Biofilm.jl are presented such as a single heterotroph, a sulfide-oxidizing bacteria (SOB) and sulfate-reducing bacteria (SRB), and a phototroph. Postprocessing tools are described that allow a Biofilm.jl user to make plots and extract specific values from the solution and explore the simulated biofilm results.

The slitless grism on the Nancy Grace Roman Space Telescope will enable deep near-infrared spectroscopy over a wide field of view. We demonstrate Roman's capability to detect Ly$\alpha$ galaxies at $z>7$ using a multi-position-angle (PA) observational strategy. We simulate Roman grism data using a realistic foreground scene from the COSMOS field. We also input fake Ly$\alpha$ galaxies spanning redshift z=7.5-10.5 and a line-flux range of interest. We show how a novel data cube search technique -- CUBGRISM -- originally developed for GALEX can be applied to Roman grism data to produce a Ly$\alpha$ flux-limited sample without the need for continuum detections. We investigate the impact of altering the number of independent PAs and exposure time. A deep Roman grism survey with 25 PAs and a total exposure time of $70$hrs can achieve Ly$\alpha$ line depths comparable to the deepest $z=7$ narrow-band surveys ($L_{{\rm{Ly}}\alpha}\gtrsim10^{43}$erg s$^{-1}$). Assuming a null result, where the opacity of the intergalactic medium (IGM) remains unchanged from $z\sim7$, this level of sensitivity will detect $\sim400$ deg$^{-2}$ Ly$\alpha$ emitters from $z=7.25-8.75$. A decline from this expected number density is the signature of an increasing neutral hydrogen fraction and the onset of reionization. Our simulations indicate that a deep Roman grism survey has the ability to measure the timing and magnitude of this decline, allowing us to infer the ionization state of the IGM and helping us to distinguish between models of reionization., Comment: 11 pages, 7 figures, Submitted to ApJ

We study the fine-grained complexity of evaluating Boolean Conjunctive Queries and their generalization to sum-of-product problems over an arbitrary semiring. For these problems, we present a general semiring-oblivious reduction from the k-clique problem to any query structure (hypergraph). Our reduction uses the notion of embedding a graph to a hypergraph, first introduced by Marx. As a consequence of our reduction, we can show tight conditional lower bounds for many classes of hypergraphs, including cycles, Loomis-Whitney joins, some bipartite graphs, and chordal graphs. These lower bounds have a dependence on what we call the clique embedding power of a hypergraph H, which we believe is a quantity of independent interest. We show that the clique embedding power is always less than the submodular width of the hypergraph, and present a decidable algorithm for computing it. We conclude with many open problems for future research., Comment: To appear in ICALP'23; 23 pages; comments welcome

We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be negative), the problem is either computable in polynomial time if $f$ satisfies a tractability criterion, or \#P-hard otherwise. One particular problem in this problem space is a long-standing open problem of Moore and Robson on counting Cubic Planar X3C. The dichotomy resolves this problem by showing that it is \numP-hard. Our proof relies on the machinery of signature theory developed in the study of Holant problems. An essential ingredient in our proof of the main dichotomy theorem is a pure graph-theoretic result: Excepting some trivial cases, every 3-regular plane graph has a planar 3-way edge perfect matching. The proof technique of this graph-theoretic result is a combination of algebraic and combinatorial methods. The P-time tractability criterion of the dichotomy is explicit. Other than the known classes of tractable constraint functions (degenerate, affine, product type, matchgates-transformable) we also identify a new infinite set of P-time computable planar Holant problems; however, its tractability is not by a direct holographic transformation to matchgates, but by a combination of this method and a global argument. The complexity dichotomy states that everything else in this Holant class is \#P-hard., Comment: arXiv admin note: text overlap with arXiv:2110.01173

We study the properties of elections that have a given position matrix (in such elections each candidate is ranked on each position by a number of voters specified in the matrix). We show that counting elections that generate a given position matrix is #P-complete. Consequently, sampling such elections uniformly at random seems challenging and we propose a simpler algorithm, without hard guarantees. Next, we consider the problem of testing if a given matrix can be implemented by an election with a certain structure (such as single-peakedness or group-separability). Finally, we consider the problem of checking if a given position matrix can be implemented by an election with a Condorcet winner. We complement our theoretical findings with experiments., Comment: Accepted to AAAI 2023

Dual-unitary brickwork circuits are an exactly-solvable model for many-body chaotic quantum systems, based on 2-site gates which are unitary in both the time and space directions. Prosen has recently described an alternative model called 'dual-unitary interactions round-a-face', which we here call 'clockwork', based on 2-controlled 1-site unitaries composed in a non-brickwork structure, yet with many of the same attractive global properties. We present a 2-categorical framework that simultaneously generalizes these two existing models, and use it to show that brickwork and clockwork circuits can interact richly, yielding new types of generalized heterogeneous circuits. We show that these interactions are governed by quantum combinatorial data, which we precisely characterize. These generalized circuits remain exactly-solvable and we show that they retain the attractive features of the original models such as single-site correlation functions vanishing everywhere except on the causal light-cone. Our presented framework allows us to directly extend the notion of solvable initial states to these biunitary circuits, which are shown to result in maximal entanglement growth and exact thermalization after finitely many time steps under biunitary circuit dynamics., Comment: 29 pages. Updated introduction to shaded calculus, introduced periodic biunitary circuits in Section 2.5, and provided explicit parametrizations of composite biunitaries in Appendix A

We study the chaotic motion of an optomechanical system coupled to a non-Markovian environment. We show that the environmental memory time can significantly affect chaos in an enhancing way. In addition to classical chaotic motion, the quantum entanglement in the presence of chaos is investigated. It is found that both the environmental memory and chaos can lift up bipartite entanglement in a non-linear optomechanical system. These observations may help expand our understanding of the transition from classical to quantum dynamics.

Cloud computing has made federated database systems (FDBS) significantly more practical to implement than in the past. As part of a recent Web-based Geographic Information System (WebGIS) project, we are employing cloud-native technologies (from the container ecosystem) to develop a federated database (DB) infrastructure, to help manage and utilise the distributed and various geospatial data. Unfortunately, there seem to be inherent challenges and complexity of applying the container and Kubernetes technologies to building and running DB systems. Considering that most of the geospatial and theme data are pre-obtained and fixed in our WebGIS project, we decided to focus on the read-only user queries and still resort to Kubernetes to implement an FDBS instance to use. Unlike the de facto practices (e.g., using the StatefulSets mechanism, extending Kuberentes APIs, or employing KubeFed), our solution for Kubernetes-aided FDBS simplifies the tech stack by investigating the fractal object of federated data management, inclusively containerising DB instances, and using the lightweight Deployment mechanism to handle stateless DB containers. Overall, this research not only reveals an easy-to-implement approach to constructing read-only components in a fully-fledged FDBS, but also proposes and demonstrates a novel methodology for FDBS investigations., Comment: 8 pages

Background: Academic search engines (i.e., digital libraries and indexers) play an increasingly important role in systematic reviews however these engines do not seem to effectively support such reviews, e.g., researchers confront usability issues with the engines when conducting their searches. Aims: To investigate whether the usability issues are bugs (i.e., faults in the search engines) or constraints, and to provide recommendations to search-engine providers and researchers on how to tackle these issues. Method: Using snowball-sampling from tertiary studies, we identify a set of 621 secondary studies in software engineering. By physically re-attempting the searches for all of these 621 studies, we effectively conduct regression testing for 42 search engines. Results: We identify 13 bugs for eight engines, and also identify other constraints. We provide recommendations for tackling these issues. Conclusions: There is still a considerable gap between the search-needs of researchers and the usability of academic search engines. It is not clear whether search-engine developers are aware of this gap. Also, the evaluation, by academics, of academic search engines has not kept pace with the development, by search-engine providers, of those search engines. Thus, the gap between evaluation and development makes it harder to properly understand the gap between the search-needs of researchers and search-features of the search engines., Comment: 8 pages

Efficiently mapping baryonic properties onto dark matter is a major challenge in astrophysics. Although semi-analytic models (SAMs) and hydrodynamical simulations have made impressive advances in reproducing galaxy observables across cosmologically significant volumes, these methods still require significant computation times, representing a barrier to many applications. Graph Neural Networks (GNNs) have recently proven to be the natural choice for learning physical relations. Among the most inherently graph-like structures found in astrophysics are the dark matter merger trees that encode the evolution of dark matter halos. In this paper we introduce a new, graph-based emulator framework, $\texttt{Mangrove}$, and show that it emulates the galactic stellar mass, cold gas mass and metallicity, instantaneous and time-averaged star formation rate, and black hole mass -- as predicted by a SAM -- with root mean squared error up to two times lower than other methods across a $(75 Mpc/h)^3$ simulation box in 40 seconds, 4 orders of magnitude faster than the SAM. We show that $\texttt{Mangrove}$ allows for quantification of the dependence of galaxy properties on merger history. We compare our results to the current state of the art in the field and show significant improvements for all target properties. $\texttt{Mangrove}$ is publicly available., Comment: 15 pages, 9 figures, 3 tables, 10 pages of Appendices. Accepted for publication in ApJ