Search

We present a study of atmospheric disturbances at Jezero Crater, Mars, using ground-based measurements of surface pressure by the Perseverance rover in combination with orbital images from the Mars Express and Mars Reconnaissance Orbiter missions. The study starts at Ls $\sim$ 13.3{\deg} in MY36 (March 6th, 2021) and extends up to Ls $\sim$ 30.3{\deg} in MY37 (February 28th, 2023). We focus on the characterization of the major atmospheric phenomena at synoptic and planetary-scales. These are the thermal tides (measured up to the sixth component), long-period pressure oscillations (periods > 1 sol), the Aphelion Cloud Belt, and the occasional development of regional dust storms over Jezero. We present the seasonal evolution of the amplitudes and phases of the thermal tides and their relation with the atmospheric dust content (optical depth). Three regional dust storms and one polar storm extending over Jezero produced an increase in the diurnal and semidiurnal amplitudes but resulted in inverse responses in their phases. We show that the primary regular wave activity is due to baroclinic disturbances with periods of 2-4 sols and amplitudes $\sim$ 1-15 Pa increasing with dust content, in good agreement with theoretical predictions by model calculations. The spacecraft images show a number of arc-shaped, spiral and irregular cyclonic vortices, traced by dust and clouds at the edge of the North Polar Cap, that could be behind some of the pressure oscillations measured at Jezero.

We initiate the study of deterministic distributed graph algorithms with predictions in synchronous message passing systems. The process at each node in the graph is given a prediction, which is some extra information about the problem instance that may be incorrect. The processes may use the predictions to help them solve the problem. The overall goal is to develop algorithms that both work faster when predictions are good and do not work much worse than algorithms without predictions when predictions are bad. Concepts from the more general area of algorithms with predictions, such as error measures, consistency, robustness, and smoothness, are adapted to distributed graph algorithms with predictions. We consider algorithms with predictions for four distributed graph problems, Maximal Independent Set, Maximal Matching, $(\Delta+1)$-Vertex Coloring, and $(2\Delta-1)$-Edge Coloring, where $\Delta$ denotes the degree of the graph. For each, we define an appropriate error measure. We present generic templates that can be used to design deterministic distributed graph algorithms with predictions from existing algorithms without predictions. Using these templates, we develop algorithms with predictions for Maximal Independent Set. Alternative error measures for the Maximal Independent Set problem are also considered. We obtain algorithms with predictions for general graphs and for rooted trees and analyze them using two of these error measures., Comment: 27 pages, 2 figures, 6 algorithms

Many of the current problems related to the evolution of cataclysmic variables revolve around the magnetic nature of the main sequence secondary. It is known that magnetic fields alter the structure of low mass stars. In particular, they inhibit convection, leading to inflated radii. Here we present a simple model to demonstrate the impact of magneto-convection on the evolution of short period cataclysmic variables. We find that the inclusion of magneto-convection leads to larger secondaries, longer orbital periods and smaller mass-loss rates. When including magnetic effects, the minimum orbital period is increased by 14 minutes, indicating that this could help alleviate the period minimum problem in cataclysmic variable evolution. We also examine the effect of the white dwarf mass on the minimum period. While increasing the white dwarf mass does increase the minimum period, it is not substantial. Therefore it is unlikely that the period minimum problem can be solved with a larger white dwarf mass or with mass growth of white dwarf., Comment: 8 pages, 3 figures, submitted to PASP

To what extent is the underlying distribution of a finitely supported unbiased random walk on $\mathbb{Z}$ determined by the sequence of times at which the walk returns to the origin? The main result of this paper is that, in various senses, most unbiased random walks on $\mathbb{Z}$ are determined up to equivalence by the sequence $I_1,I_2,I_3,\ldots$, where $I_n$ denotes the probability of being at the origin after $n$ steps. The proof depends on the classification of finite simple groups., Comment: 16 pages

Deep surveys reveal tidal debris and associated compact stellar systems. Euclid's unique combination of capabilities (spatial resolution, depth, and wide sky coverage) will make it a groundbreaking tool for galactic archaeology in the local Universe, bringing low surface brightness (LSB) science into the era of large-scale astronomical surveys. Euclid's Early Release Observations (ERO) demonstrate this potential with a field of view that includes several galaxies in the Dorado group. In this paper, we aim to derive from this image a mass assembly scenario for its main galaxies: NGC 1549, NGC 1553, and NGC 1546. We detect internal and external diffuse structures, and identify candidate globular clusters (GCs). By analysing the colours and distributions of the diffuse structures and candidate GCs, we can place constraints on the galaxies' mass assembly and merger histories. The results show that feature morphology, surface brightness, colours, and GC density profiles are consistent with galaxies that have undergone different merger scenarios. We classify NGC 1549 as a pure elliptical galaxy that has undergone a major merger. NGC 1553 appears to have recently transitioned from a late-type galaxy to early type, after a series of radial minor to intermediate mergers. NGC 1546 is a rare specimen of galaxy with an undisturbed disk and a prominent diffuse stellar halo, which we infer has been fed by minor mergers and then disturbed by the tidal effect from NGC 1553. Finally, we identify limitations specific to the observing conditions of this ERO, in particular stray light in the visible and persistence in the near-infrared bands. Once these issues are addressed and the extended emission from LSB objects is preserved by the data-processing pipeline, the Euclid Wide Survey will allow studies of the local Universe to be extended to statistical ensembles over a large part of the extragalactic sky., Comment: 25 pages, 20 figures

Emerging digital twin technology has the potential to revolutionize voltage control in power systems. However, the state-of-the-art digital twin method suffers from low computational and sampling efficiency, which hinders its applications. To address this issue, we propose a Gumbel-Consistency Digital Twin (GC-DT) method that enhances voltage control with improved computational and sampling efficiency. First, the proposed method incorporates a Gumbel-based strategy improvement that leverages the Gumbel-top trick to enhance non-repetitive sampling actions and reduce the reliance on Monte Carlo Tree Search simulations, thereby improving computational efficiency. Second, a consistency loss function aligns predicted hidden states with actual hidden states in the latent space, which increases both prediction accuracy and sampling efficiency. Experiments on IEEE 123-bus, 34-bus, and 13-bus systems demonstrate that the proposed GC-DT outperforms the state-of-the-art DT method in both computational and sampling efficiency., Comment: 6 pages, 1 figure, conference paper

Massive stars are a major source of chemical elements in the cosmos, ejecting freshly produced nuclei through winds and core-collapse supernova explosions into the interstellar medium. Among the material ejected, long lived radioisotopes, such as 60Fe (iron) and 26Al (aluminum), offer unique signs of active nucleosynthesis in our galaxy. There is a long-standing discrepancy between the observed 60Fe/26Al ratio by {\gamma}-ray telescopes and predictions from supernova models. This discrepancy has been attributed to uncertainties in the nuclear reaction networks producing 60Fe, and one reaction in particular, the neutron-capture on 59Fe. Here we present experimental results that provide a strong constraint on this reaction. We use these results to show that the production of 60Fe in massive stars is higher than previously thought, further increasing the discrepancy between observed and predicted 60Fe/26Al ratios. The persisting discrepancy can therefore not be attributed to nuclear uncertainties, and points to issues in massive-star models.

Density functional theory with linear combination of atomic orbitals (LCAO) basis sets is useful for studying large atomic systems, especially when it comes to computationally highly demanding time-dependent dynamics. We have implemented the Ehrenfest molecular dynamics (ED) method with the approximate approach of Tomfohr and Sankey within the projector augmented-wave code GPAW. We apply this method to small molecules as well as larger periodic systems, and elucidate its limits, advantages, and disadvantages in comparison to the existing implementation of Ehrenfest dynamics with a real-space grid representation. For modest atomic velocities, LCAO-ED shows satisfactory accuracy at a much reduced computational cost. This method will be particularly useful for modeling ion irradiation processes that require large amounts of vacuum in the simulation cell.

Evidence has emerged for a stochastic signal correlated among 67 pulsars within the 15-year pulsar-timing data set compiled by the NANOGrav collaboration. Similar signals have been found in data from the European, Indian, Parkes, and Chinese PTAs. This signal has been interpreted as indicative of the presence of a nanohertz stochastic gravitational wave background. To explore the internal consistency of this result we investigate how the recovered signal strength changes as we remove the pulsars one by one from the data set. We calculate the signal strength using the (noise-marginalized) optimal statistic, a frequentist metric designed to measure correlated excess power in the residuals of the arrival times of the radio pulses. We identify several features emerging from this analysis that were initially unexpected. The significance of these features, however, can only be assessed by comparing the real data to synthetic data sets. After conducting identical analyses on simulated data sets, we do not find anything inconsistent with the presence of a stochastic gravitational wave background in the NANOGrav 15-year data. The methodologies developed here can offer additional tools for application to future, more sensitive data sets. While this analysis provides an internal consistency check of the NANOGrav results, it does not eliminate the necessity for additional investigations that could identify potential systematics or uncover unmodeled physical phenomena in the data., Comment: 21 pages, 11 figures, 2 tables

Pulsar timing array observations have found evidence for an isotropic gravitational wave background with the Hellings-Downs angular correlations, expected from general relativity. This interpretation hinges on the measured shape of the angular correlations, which is predominately quadrupolar under general relativity. Here we explore a more flexible parameterization: we expand the angular correlations into a sum of Legendre polynomials and use a Bayesian analysis to constrain their coefficients with the 15-year pulsar timing data set collected by the North American Nanohertz Observatory for Gravitational Waves (NANOGrav). When including Legendre polynomials with multipoles $\ell \geq 2$, we only find a significant signal in the quadrupole with an amplitude consistent with general relativity and non-zero at the $\sim 95\%$ confidence level and a Bayes factor of 200. When we include multipoles $\ell \leq 1$, the Bayes factor evidence for quadrupole correlations decreases by more than an order of magnitude due to evidence for a monopolar signal at approximately 4 nHz which has also been noted in previous analyses of the NANOGrav 15-year data. Further work needs to be done in order to better characterize the properties of this monopolar signal and its effect on the evidence for quadrupolar angular correlations., Comment: 15 pages, 6 figures

Context. HD140283, or the Methuselah star, is a well-known reference object in stellar evolution. Its peculiar chemical composition, proximity and absence of reddening makes it an interesting case-study of Pop II stars. Thanks to recent observational efforts, we now have precise interferometric and spectroscopic constraints, as well as revised astrometric parallaxes from the Gaia mission. Aims. We aim at determining the age of HD140283 with these lastest constraints, as well as quantifying the impact of systematics from physical inaccuracies in the stellar evolution models. Methods. Using recent spectroscopic abundances from the literature, including 3D non-LTE values for C, O, and Fe, we compute opacity tables specific to HD140283. We then use them in grids of stellar evolution models coupled to a Markov Chain Monte Carlo tool to determine the age of HD140283. Results. With our tailored models we find an age of 12.3Gy. Using a solar-scaled mixture instead results in an age value of 14Gy, in tension with the age of the universe ($13.77\pm0.06$Gy). We also find that reducing the mixing length parameter from its solar calibrated value will lead to an even lower age, in agreement with other recent studies. However, we find no direct evidence to favour a lower mixing length parameter value from our modelling. Conclusions. Taking into account the specific elemental abundances is crucial for the modelling of HD140283, as it leads to significant differences in the inferred age. However, this effect is degenerate with a lowering of the mixing length parameter. In this respect, asteroseismic constraints might play a key role in accurately deriving the mass of HD140283, therefore strongly constraining its age., Comment: Accepted for publication in A&A

In this Letter we report on the experimental generation of high energy (10 GeV), ultra-short (fs-duration), ultra-high current (0.1 MA), petawatt peak power electron beams in a particle accelerator. These extreme beams enable the exploration of a new frontier of high intensity beam-light and beam-matter interactions broadly relevant across fields ranging from laboratory astrophysics to strong field quantum electrodynamics and ultra-fast quantum chemistry. We demonstrate our ability to generate and control the properties of these electron beams by means of a laser-electron beam shaping technique. This experimental demonstration opens the door to on-the-fly customization of extreme beam current profiles for desired experiments and is poised to benefit a broad swathe of cross-cutting applications of relativistic electron beams.

Using Langer's construction of Bridgeland stability conditions on normal surfaces, we prove Reider-type theorems generalizing the work done by Arcara-Bertram in the smooth case. Our results still hold in positive characteristic or when $\omega_X \otimes L$ is not necessarily a line bundle. They also hold when the dualizing sheaf is replaced by a variant arising from the theory of Du Bois complexes. For complex surfaces with at most rational double point singularities, we recover the optimal bounds for global generation and very ampleness as predicted by Fujita's conjecture., Comment: 25 pages. Comments welcome

Let $S_n$ denote a symmetric group, $\chi$ an irreducible character of $S_n$, and $g\in S_n$ an element which decomposes into $k$ disjoint cycles, where $1$-cycles are included. Then $|\chi(g)|\le k!$, and this upper bound is sharp for fixed $k$ and varying $n$, $\chi$, and $g$. This implies a sharp upper bound of $k!$ for unipotent character values of $SL_n(q)$ at regular semisimple elements with characteristic polynomial $P(t)=P_1(t)\cdots P_k(t)$, where the $P_i$ are irreducible over $F_q[t]$., Comment: 7 pages

We present the discovery of TOI-6303b and TOI-6330b, two massive transiting super-Jupiters orbiting a M0 and a M2 star respectively, as part of the Searching for GEMS survey. These were detected by TESS and then confirmed via ground-based photometry and radial velocity observations with the Habitable-zone Planet Finder (HPF). TOI-6303b has a mass of 7.84 +/- 0.31 MJ, a radius of 1.03 +/- 0.06 RJ , and an orbital period of 9.485 days. TOI-6330b has a mass of 10.00 +/- 0.31 MJ , a radius of 0.97 +/- 0.03 RJ , and an orbital period of 6.850 days. We put these planets in context of super-Jupiters around M-dwarfs discovered from radial-velocity surveys, as well as recent discoveries from astrometry. These planets have masses that can be attributed to two dominant planet formation mechanisms - gravitational instability and core-accretion. Their masses necessitate massive protoplanetary disks that should either be gravitationally unstable, i.e. forming through gravitational instability, or be amongst some of the most massive protoplanetary disks to form objects through core-accretion. We also discuss the eccentricity distribution of these objects, as a potential indicator of their formation and evolutionary mechanisms., Comment: arXiv admin note: text overlap with arXiv:2408.14694

The detection of a stochastic gravitational wave background by pulsar timing arrays suggests the presence of a supermassive black hole binary population. Although the observed spectrum generally aligns with predictions from orbital evolution driven by gravitational wave emission in circular orbits, there is a discernible preference for a turnover at the lowest observed frequencies. This turnover could indicate a significant hardening phase, transitioning from early environmental influences to later stages predominantly influenced by gravitational wave emission. In the vicinity of these binaries, the ejection of stars or dark matter particles through gravitational three-body slingshots efficiently extracts orbital energy, leading to a low-frequency turnover in the spectrum. By analyzing the NANOGrav 15-year data, we assess how the gravitational wave spectrum depends on the initial inner galactic profile prior to disruption by binary ejections, accounting for a range of initial binary eccentricities. Our findings suggest a parsec-scale galactic center density around $10^6\,M_\odot/\textrm{pc}^3$ across most of the parameter space, offering insights into the environmental effects on black hole evolution and combined matter density near galaxy centers., Comment: 15 pages, 5 figures

The instruments at the focus of the Euclid space observatory offer superb, diffraction-limited imaging over an unprecedented (from space) wide field of view of 0.57 deg$^2$. This exquisite image quality has the potential to produce high-precision astrometry for point sources once the undersampling of Euclid's cameras is taken into account by means of accurate, effective point spread function (ePSF) modelling. We present a complex, detailed workflow to simultaneously solve for the geometric distortion (GD) and model the undersampled ePSFs of the Euclid detectors. Our procedure was successfully developed and tested with data from the Early Release Observations (ERO) programme focused on the nearby globular cluster NGC 6397. Our final one-dimensional astrometric precision for a well-measured star just below saturation is 0.7 mas (0.007 pixel) for the Visible Instrument (VIS) and 3 mas (0.01 pixel) for the Near-Infrared Spectrometer and Photometer (NISP). Finally, we present a specific scientific application of this high-precision astrometry: the combination of Euclid and Gaia data to compute proper motions and study the internal kinematics of NGC 6397. Future work, when more data become available, will allow for a better characterisation of the ePSFs and GD corrections that are derived here, along with assessment of their temporal stability, and their dependencies on the spectral energy distribution of the sources as seen through the wide-band filters of Euclid., Comment: 23 pages, 21 figures. Accepted for publication in A&A on October 24, 2024. Astro-photometric catalogs and stacked images will be available at the CDS after the paper will be published

When learning an input-output mapping from very few examples, is it better to first infer a latent function that explains the examples, or is it better to directly predict new test outputs, e.g. using a neural network? We study this question on ARC by training neural models for induction (inferring latent functions) and transduction (directly predicting the test output for a given test input). We train on synthetically generated variations of Python programs that solve ARC training tasks. We find inductive and transductive models solve different kinds of test problems, despite having the same training problems and sharing the same neural architecture: Inductive program synthesis excels at precise computations, and at composing multiple concepts, while transduction succeeds on fuzzier perceptual concepts. Ensembling them approaches human-level performance on ARC.

Achieving a provable exponential quantum speedup for an important machine learning task has been a central research goal since the seminal HHL quantum algorithm for solving linear systems and the subsequent quantum recommender systems algorithm by Kerenidis and Prakash. These algorithms were initially believed to be strong candidates for exponential speedups, but a lower bound ruling out similar classical improvements remained absent. In breakthrough work by Tang, it was demonstrated that this lack of progress in classical lower bounds was for good reasons. Concretely, she gave a classical counterpart of the quantum recommender systems algorithm, reducing the quantum advantage to a mere polynomial. Her approach is quite general and was named quantum-inspired classical algorithms. Since then, almost all the initially exponential quantum machine learning speedups have been reduced to polynomial via new quantum-inspired classical algorithms. From the current state-of-affairs, it is unclear whether we can hope for exponential quantum speedups for any natural machine learning task. In this work, we present the first such provable exponential separation between quantum and quantum-inspired classical algorithms. We prove the separation for the basic problem of solving a linear system when the input matrix is well-conditioned and has sparse rows and columns.

In molecular systems, the ultrafast motion of electrons initiates the process of chemical change. Tracking this electronic motion across molecules requires coupling attosecond time resolution to atomic-scale spatial sensitivity. In this work, we employ a pair of attosecond x-ray pulses from an x-ray free-electron laser to follow electron motion resulting from the sudden removal of an electron from a prototypical aromatic system, para-aminophenol. X-ray absorption enables tracking this motion with atomic-site specificity. Our measurements are compared with state-of-the-art computational modeling, reproducing the observed response across multiple timescales. Sub-femtosecond dynamics are assigned to states undergoing non-radiative decay, while few-femtosecond oscillatory motion is associated with electronic wavepacket motion in stable cation states, that will eventually couple to nuclear motion. Our work provides insight on the ultrafast charge motion preceding and initiating chemical transformations in moderately complex systems, and provides a powerful benchmark for computational models of ultrafast charge motion in matter.

The present paper reports on wind tunnel tests and analyses carried out to investigate the effect of the static angle of attack on the aerodynamic stability of a twin-box bridge deck section. It is found that the critical wind speed for onset of flutter increases with increasing positive static angles (nose-up) and that this effect relates mainly to a decrease in the loss of aerodynamic stiffness. A simplified flutter analysis, linking the slope of the static moment coefficient to the increase of flutter stability for increasing positive angles of attack. It is concluded that it is desirable to design twin-box bridge deck sections to have a positive moment coefficient at zero angle of attack and a positive, decreasing moment slope for increasing nose-up angles. With these requirements fulfilled, the present study show that the critical wind speeds for onset of flutter increase with increasing angles, and ensures that the elastically supported deck will always meet the wind at ever increasing angles for increasing wind speeds., Comment: 12 pages, 6 figures, submitted to proceedings of the 16th International Conference on Wind Engineering (ICWE16) 2023, Florence, Italy

Accurate time series forecasting is a highly valuable endeavour with applications across many industries. Despite recent deep learning advancements, increased model complexity, and larger model sizes, many state-of-the-art models often perform worse or on par with simpler models. One of those cases is a recently proposed model, FITS, claiming competitive performance with significantly reduced parameter counts. By training a one-layer neural network in the complex frequency domain, we are able to replicate these results. Our experiments on a wide range of real-world datasets further reveal that FITS especially excels at capturing periodic and seasonal patterns, but struggles with trending, non-periodic, or random-resembling behavior. With our two novel hybrid approaches, where we attempt to remedy the weaknesses of FITS by combining it with DLinear, we achieve the best results of any known open-source model on multivariate regression and promising results in multiple/linear regression on price datasets, on top of vastly improving upon what FITS achieves as a standalone model., Comment: arXiv:2307.03756v3 45 pages, 36 figures

The GW approximation represents the state-of-the-art ab-initio method for computing excited-state properties. Its execution requires control over a larger number of (often interdependent) parameters, and therefore its application in high-throughput studies is hindered by the intricate and time-consuming convergence process across a multi-dimensional parameter space. To address these challenges, here we develop a fully-automated open-source workflow for G$_0$W$_0$ calculations within the AiiDA-VASP plugin architecture. The workflow is based on an efficient estimation of the errors on the quasi-particle (QP) energies due to basis-set truncation and the pseudo-potential norm violation, which allows a reduction of the dimensionality of the parameter space and avoids the need for multi-dimensional convergence searches. Protocol validation is conducted through a systematic comparison against established experimental and state-of-the-art GW data. To demonstrate the effectiveness of the approach, we construct a database of QP energies for a diverse dataset of over 320 bulk structures. The openly accessible workflow and resulting dataset can serve as a valuable resource and reference for conducting accurate data-driven research., Comment: 11 pages, 6 figures, 2 tables

Recent years have seen tremendous developments in the use of machine learning models to link amino acid sequence, structure and function of folded proteins. These methods are, however, rarely applicable to the wide range of proteins and sequences that comprise intrinsically disordered regions. We here review developments in the study of disordered proteins that exploit or are used to train machine learning models. These include methods for generating conformational ensembles and designing new sequences, and for linking sequences to biophysical properties and biological functions. We highlight how these developments are built on a tight integration between experiment, theory and simulations, and account for evolutionary constraints, which operate on sequences of disordered regions differently than on those of folded domains., Comment: 11 pages, 2 figures

Quantum many-body scars are energy eigenstates which fail to reproduce thermal expectation values of local observables in systems, where the rest of the many-body spectrum fulfils eigenstate thermalization. Experimental observation of quantum many-body scars has so far been limited to models with multiple scar states. Here we propose protocols to observe single scars in architectures of fixed-frequency, fixed-coupling superconducting qubits. We first adapt known models possessing the desired features into a form particularly suited for the experimental platform. We develop protocols for the implementation of these models, through trotterized sequences of two-qubit cross-resonance interactions, and verify the existence of the approximate scar state in the stroboscopic effective Hamiltonian. Since a single scar cannot be detected from coherent revivals in the dynamics, differently from towers of scar states, we propose and numerically investigate alternative and experimentally-accessible signatures. These include the dynamical response of the scar to local state deformations, to controlled noise, and to the resolution of the Lie-Suzuki-Trotter digitization., Comment: 16 pages, 7 figures, Submission to SciPost

Light-emitting electrochemical cells (LECs) are promising candidates for fully solution-processed lighting applications because they can comprise a single active-material layer and air-stable electrodes. While their performance is often claimed to be independent of the electrode material selection due to the in-situ formation of electric double layers (EDLs), we demonstrate conceptually and experimentally that this understanding needs to be modified. Specifically, the exciton generation zone is observed to be affected by the electrode work function. We rationalize this finding by proposing that the ion concentration in the injection-facilitating EDLs depends on the offset between the electrode work function and the respective semiconductor orbital, which in turn influences the number of ions available for electrochemical doping and hence shifts the exciton generation zone. Further, we investigate the effects of the electrode selection on exciton losses to surface plasmon polaritons and discuss the impact of cavity effects on the exciton density. We conclude by showing that the measured electrode-dependent LEC luminance transients can be replicated by an optical model that considers these electrode-dependent effects to calculate the attained light outcoupling of the LEC stack. As such, our findings provide rational design criteria considering the electrode materials, the active-material thickness, and its composition in concert to achieve optimum LEC performance.

EOSpython is a PyPI published Python package that encompass everything within a centralized earth observation satellite scheduling system in terms of customer database setup, scenario generation, pre-processing, problem setup, scheduling solution approach, decision maker preference integration, and visualization. The package is tailored to easily configure internal parameters and contribute with other solution approaches.

Deep reinforcement learning has emerged as a powerful tool for obtaining high-performance policies. However, the safety of these policies has been a long-standing issue. One promising paradigm to guarantee safety is a shield, which shields a policy from making unsafe actions. However, computing a shield scales exponentially in the number of state variables. This is a particular concern in multi-agent systems with many agents. In this work, we propose a novel approach for multi-agent shielding. We address scalability by computing individual shields for each agent. The challenge is that typical safety specifications are global properties, but the shields of individual agents only ensure local properties. Our key to overcome this challenge is to apply assume-guarantee reasoning. Specifically, we present a sound proof rule that decomposes a (global, complex) safety specification into (local, simple) obligations for the shields of the individual agents. Moreover, we show that applying the shields during reinforcement learning significantly improves the quality of the policies obtained for a given training budget. We demonstrate the effectiveness and scalability of our multi-agent shielding framework in two case studies, reducing the computation time from hours to seconds and achieving fast learning convergence.

Understanding the spatial distribution of palms within tropical forests is essential for effective ecological monitoring, conservation strategies, and the sustainable integration of natural forest products into local and global supply chains. However, the analysis of remotely sensed data in these environments faces significant challenges, such as overlapping palm and tree crowns, uneven shading across the canopy surface, and the heterogeneous nature of the forest landscapes, which often affect the performance of palm detection and segmentation algorithms. To overcome these issues, we introduce PalmDSNet, a deep learning framework for real-time detection, segmentation, and counting of canopy palms. Additionally, we employ a bimodal reproduction algorithm that simulates palm spatial propagation to further enhance the understanding of these point patterns using PalmDSNet's results. We used UAV-captured imagery to create orthomosaics from 21 sites across western Ecuadorian tropical forests, covering a gradient from the everwet Choc\'o forests near Colombia to the drier forests of southwestern Ecuador. Expert annotations were used to create a comprehensive dataset, including 7,356 bounding boxes on image patches and 7,603 palm centers across five orthomosaics, encompassing a total area of 449 hectares. By combining PalmDSNet with the bimodal reproduction algorithm, which optimizes parameters for both local and global spatial variability, we effectively simulate the spatial distribution of palms in diverse and dense tropical environments, validating its utility for advanced applications in tropical forest monitoring and remote sensing analysis., Comment: 25 pages, 8 figures, 5 tables

Particle advection is one of the foundational algorithms for visualization and analysis and is central to understanding vector fields common to scientific simulations. Achieving efficient performance with large data in a distributed memory setting is notoriously difficult. Because of its simplicity and minimized movement of large vector field data, the Parallelize over Data (POD) algorithm has become a de facto standard. Despite its simplicity and ubiquitous usage, the scaling issues with the POD algorithm are known and have been described throughout the literature. In this paper, we describe a set of in-depth analyses of the POD algorithm that shed new light on the underlying causes for the poor performance of this algorithm. We designed a series of representative workloads to study the performance of the POD algorithm and executed them on a supercomputer while collecting timing and statistical data for analysis. We then performed two different types of analysis. In the first analysis, we introduce two novel metrics for measuring algorithmic efficiency over the course of a workload run. The second analysis was from the perspective of the particles being advected. Using particle centric analysis, we identify that the overheads associated with particle movement between processes (not the communication itself) have a dramatic impact on the overall execution time. In the first analysis, we introduce two novel metrics for measuring algorithmic efficiency over the course of a workload run. The second analysis was from the perspective of the particles being advected. Using particle-centric analysis, we identify that the overheads associated with particle movement between processes have a dramatic impact on the overall execution time. These overheads become particularly costly when flow features span multiple blocks, resulting in repeated particle circulation between blocks.

The Visual Monitoring Camera (VMC) is a small imaging instrument onboard Mars Express with a field of view of ~40x30 degrees. The camera was initially intended to provide visual confirmation of the separation of the Beagle 2 lander and has similar technical specifications to a typical webcam of the 2000s. In 2007, a few years after the end of its original mission, VMC was turned on again to obtain full-disk images of Mars to be used for outreach purposes. As VMC obtained more images, the scientific potential of the camera became evident, and in 2018 the camera was given an upgraded status of a new scientific instrument, with science goals in the field of Martian atmosphere meteorology. The wide Field of View of the camera combined with the orbit of Mars Express enable the acquisition of full-disk images of the planet showing different local times, which for a long time has been rare among orbital missions around Mars. The small data volume of images also allows videos that show the atmospheric dynamics of dust and cloud systems to be obtained. This paper is intended to be the new reference paper for VMC as a scientific instrument, and thus provides an overview of the updated procedures to plan, command and execute science observations of the Martian atmosphere. These observations produce valuable science data that is calibrated and distributed to the community for scientific use.

Union volume estimation is a classical algorithmic problem. Given a family of objects $O_1,\ldots,O_n \subseteq \mathbb{R}^d$, we want to approximate the volume of their union. In the special case where all objects are boxes (also known as hyperrectangles) this is known as Klee's measure problem. The state-of-the-art algorithm [Karp, Luby, Madras '89] for union volume estimation and Klee's measure problem in constant dimension $d$ computes a $(1+\varepsilon)$-approximation with constant success probability by using a total of $O(n/\varepsilon^2)$ queries of the form (i) ask for the volume of $O_i$, (ii) sample a point uniformly at random from $O_i$, and (iii) query whether a given point is contained in $O_i$. We show that if one can only interact with the objects via the aforementioned three queries, the query complexity of [Karp, Luby, Madras '89] is indeed optimal, i.e., $\Omega(n/\varepsilon^2)$ queries are necessary. Our lower bound already holds for estimating the union of equiponderous axis-aligned polygons in $\mathbb{R}^2$, and even if the algorithm is allowed to inspect the coordinates of the points sampled from the polygons, and still holds when a containment query can ask containment of an arbitrary (not sampled) point. Guided by the insights of the lower bound, we provide a more efficient approximation algorithm for Klee's measure problem improving the $O(n/\varepsilon^2)$ time to $O((n+\frac{1}{\varepsilon^2}) \cdot \log^{O(d)}n)$. We achieve this improvement by exploiting the geometry of Klee's measure problem in various ways: (1) Since we have access to the boxes' coordinates, we can split the boxes into classes of boxes of similar shape. (2) Within each class, we show how to sample from the union of all boxes, by using orthogonal range searching. And (3) we exploit that boxes of different classes have small intersection, for most pairs of classes.

Multi-distribution or collaborative learning involves learning a single predictor that works well across multiple data distributions, using samples from each during training. Recent research on multi-distribution learning, focusing on binary loss and finite VC dimension classes, has shown near-optimal sample complexity that is achieved with oracle efficient algorithms. That is, these algorithms are computationally efficient given an efficient ERM for the class. Unlike in classical PAC learning, where the optimal sample complexity is achieved with deterministic predictors, current multi-distribution learning algorithms output randomized predictors. This raises the question: can these algorithms be derandomized to produce a deterministic predictor for multiple distributions? Through a reduction to discrepancy minimization, we show that derandomizing multi-distribution learning is computationally hard, even when ERM is computationally efficient. On the positive side, we identify a structural condition enabling an efficient black-box reduction, converting existing randomized multi-distribution predictors into deterministic ones.

We report on the discovery of a transiting giant planet around the 3500 K M3-dwarf star TOI-6383A located 172 pc from Earth. It was detected by the Transiting Exoplanet Survey Satellite (TESS) and confirmed by a combination of ground-based follow-up photometry and precise radial velocity measurements. This planet has an orbital period of $\sim$1.791 days, mass of 1.040$\pm$0.094 $M_J$ and a radius of 1d.008$^{+0.036}_{-0.033} ~R_J$, resulting in a mean bulk density of 1.26$^{+0.18}_{-0.17}$ g cm$^{-3}$. TOI-6383A has an M-dwarf companion star, TOI-6383B, which has a stellar effective temperature $T_{eff}$ $\sim$ 3100 K and a projected orbital separation of 3100 AU. TOI-6383A is a low-mass dwarf star hosting a giant planet and is an intriguing object for planetary evolution studies due to its high planet-to-star mass ratio. This discovery is part of the \textit{Searching for Giant Exoplanets around M-dwarf Stars (GEMS)} Survey, intending to provide robust and accurate estimates of the occurrence of GEMS and the statistics on their physical and orbital parameters. This paper presents an interesting addition to the small number of confirmed GEMS, particularly notable since its formation necessitates massive, ust-rich protoplanetary discs and high accretion efficiency ($>$ 10\%)., Comment: 20 pages, 8 figures

In the realm of industrial manufacturing, Artificial Intelligence (AI) is playing an increasing role, from automating existing processes to aiding in the development of new materials and techniques. However, a significant challenge arises in smaller, experimental processes characterized by limited training data availability, questioning the possibility to train AI models in such small data contexts. In this work, we explore the potential of Transfer Learning to address this challenge, specifically investigating the minimum amount of data required to develop a functional AI model. For this purpose, we consider the use case of quality control of Carbon Fiber Reinforced Polymer (CFRP) tape laying in aerospace manufacturing using optical sensors. We investigate the behavior of different open-source computer vision models with a continuous reduction of the training data. Our results show that the amount of data required to successfully train an AI model can be drastically reduced, and the use of smaller models does not necessarily lead to a loss of performance.

For economic and efficiency reasons, blended acquisition of seismic data is becoming more and more commonplace. Seismic deblending methods are always computationally demanding and normally consist of multiple processing steps. Besides, the parameter setting is not always trivial. Machine learning-based processing has the potential to significantly reduce processing time and to change the way seismic deblending is carried out. We present a data-driven deep learning-based method for fast and efficient seismic deblending. The blended data are sorted from the common source to the common channel domain to transform the character of the blending noise from coherent events to incoherent distributions. A convolutional neural network (CNN) is designed according to the special character of seismic data, and performs deblending with comparable results to those obtained with conventional industry deblending algorithms. To ensure authenticity, the blending was done numerically and only field seismic data were employed, including more than 20000 training examples. After training and validation of the network, seismic deblending can be performed in near real time. Experiments also show that the initial signal to noise ratio (SNR) is the major factor controlling the quality of the final deblended result. The network is also demonstrated to be robust and adaptive by using the trained model to firstly deblend a new data set from a different geological area with a slightly different delay time setting, and secondly deblend shots with blending noise in the top part of the data.

Runtime verification of temporal properties over timed sequences of observations is crucial in various applications within cyber-physical systems ranging from autonomous vehicles over smart grids to medical devices. In this paper, we are addressing the challenge of effectively predicting the failure or success of properties in a continuous real-time setting. Our approach allows predictions to exploit assumptions on the system being monitored and supports predictions of non-observable system behaviour (e.g. internal faults). More concretely, in our approach properties are expressed in Metric Interval Temporal Logic (MITL), assumptions on the monitored system are specified in terms of Timed Automata, and observations are to be provided in terms of sequences of timed constraints. We present an assumption-based runtime verification algorithm and its implementation on top of the real-time verification tool UPPAAL. We show experimentally that assumptions can be effective in anticipating the satisfaction/violation of timed properties and in handling monitoring properties that predicate over unobservable events.

We investigate the impact of spatial survey non-uniformity on the galaxy redshift distributions for forthcoming data releases of the Rubin Observatory Legacy Survey of Space and Time (LSST). Specifically, we construct a mock photometry dataset degraded by the Rubin OpSim observing conditions, and estimate photometric redshifts of the sample using a template-fitting photo-$z$ estimator, BPZ, and a machine learning method, FlexZBoost. We select the Gold sample, defined as $i<25.3$ for 10 year LSST data, with an adjusted magnitude cut for each year and divide it into five tomographic redshift bins for the weak lensing lens and source samples. We quantify the change in the number of objects, mean redshift, and width of each tomographic bin as a function of the coadd $i$-band depth for 1-year (Y1), 3-year (Y3), and 5-year (Y5) data. In particular, Y3 and Y5 have large non-uniformity due to the rolling cadence of LSST, hence provide a worst-case scenario of the impact from non-uniformity. We find that these quantities typically increase with depth, and the variation can be $10-40\%$ at extreme depth values. Using Y3 as an example, we propagate the variable depth effect to the weak lensing $3\times2$pt analysis, and assess the impact on cosmological parameters via a Fisher forecast. We find that galaxy clustering is most susceptible to variable depth, and non-uniformity needs to be mitigated below $3\%$ to recover unbiased cosmological constraints. There is little impact on galaxy-shear and shear-shear power spectra, given the expected LSST Y3 noise., Comment: 28 pages, 23 figures. Matched to the accepted version on MNRAS

Marine seismic interference noise occurs when energy from nearby marine seismic source vessels is recorded during a seismic survey. Such noise tends to be well preserved over large distances and cause coherent artifacts in the recorded data. Over the years, the industry has developed various denoising techniques for seismic interference removal, but although well performing they are still time-consuming in use. Machine-learning based processing represents an alternative approach, which may significantly improve the computational efficiency. In case of conventional images, autoencoders are frequently employed for denoising purposes. However, due to the special characteristics of seismic data as well as the noise, autoencoders failed in the case of marine seismic interference noise. We therefore propose the use of a customized U-Net design with element-wise summation as part of the skip-connection blocks to handle the vanishing gradient problem and to ensure information fusion between high- and low-level features. To secure a realistic study, only seismic field data were employed, including 25000 training examples. The customized U-Net was found to perform well leaving only minor residuals, except for the case when seismic interference noise comes from the side. We further demonstrate that such noise can be treated by slightly increasing the depth of our network. Although our customized U-Net does not outperform a standard commercial algorithm in quality, it can (after proper training) read and process one single shot gather in approximately 0.02s. This is significantly faster than any existing industry denoising algorithm. In addition, the proposed network processes shot gathers in a sequential order, which is an advantage compared with industry algorithms that typically require a multi-shot input to break the coherency of the noise.

We present the discovery of a low-density planet orbiting the high-metallicity early M-dwarf TOI-5688 A b. This planet was characterized as part of the search for transiting giant planets ($R \gtrsim8$ M${}_\oplus$) through the Searching for GEMS (Giant Exoplanets around M-dwarf Stars) survey. The planet was discovered with the Transiting Exoplanet Survey Satellite (TESS), and characterized with ground-based transits from Red Buttes Observatory (RBO), the Table Mountain Observatory of Pomona College, and radial velocity (RV) measurements with the Habitable-Zone Planet Finder (HPF) on the 10 m Hobby Eberly Telescope (HET) and NEID on the WIYN 3.5 m telescope. From the joint fit of transit and RV data, we measure a planetary mass and radius of $124\pm24$ M$_\oplus$ ($0.39\pm0.07$ M${}_J$) and $10.4\pm0.7$ R$_\oplus$ ($0.92\pm0.06$ R${}_J$) respectively. The spectroscopic and photometric analysis of the host star TOI-5688 A shows that it is a metal-rich ([Fe/H] $ = 0.47\pm0.16$ dex) M2V star, favoring the core-accretion formation pathway as the likely formation scenario for this planet. Additionally, Gaia astrometry suggests the presence of a wide-separation binary companion, TOI-5688 B, which has a projected separation of $\sim5"$ (1110 AU) and is an M4V, making TOI-5688 A b part of the growing number of GEMS in wide-separation binary systems., Comment: 20 pages, 7 figures, Accepted in AJ

Notwithstanding the evidence against them, classical variational phase-field models continue to be used and pursued in an attempt to describe fracture nucleation in elastic brittle materials. In this context, the main objective of this paper is to provide a comprehensive review of the existing evidence against such a class of models as descriptors of fracture nucleation. To that end, a review is first given of the plethora of experimental observations of fracture nucleation in nominally elastic brittle materials under quasi-static loading conditions, as well as of classical variational phase-field models, without and with energy splits. These models are then confronted with the experimental observations. The conclusion is that they cannot possibly describe fracture nucleation in general. This because classical variational phase-field models cannot account for material strength as an independent macroscopic material property. The last part of the paper includes a brief summary of a class of phase-field models that can describe fracture nucleation. It also provides a discussion of how pervasively material strength has been overlooked in the analysis of fracture at large, as well as an outlook into the modeling of fracture nucleation beyond the basic setting of elastic brittle materials.

We introduce picasso, a model designed to predict thermodynamic properties of the intracluster medium based on the properties of halos in gravity-only simulations. The predictions result from the combination of an analytical gas model, mapping gas properties to the gravitational potential, and of a machine learning model to predict the model parameters for individual halos based on their scalar properties, such as mass and concentration. Once trained, the model can be applied to make predictions for arbitrary potential distributions, allowing its use with flexible inputs such as N-body particle distributions or radial profiles. We present the model, and train it using pairs of gravity-only and hydrodynamic simulations. We show that when trained to learn the mapping from gravity-only to non-radiative hydrodynamic simulations, picasso can make remarkably accurate and precise predictions of intracluster gas thermodynamics, with percent-level bias and $\sim 20 \%$ scatter for $r / R_{500c} \in [0.1,1]$. Training the model on hydrodynamic simulations including sub-resolution physics modeling yields robust predictions as well, albeit with the introduction of a radius-dependent bias and an increase in scatter. We further show that the model can be trained to make accurate predictions from very minimal halo information, down to mass and concentration, at the cost of modestly reduced precision. picasso is made publicly available as a Python package at https://github.com/fkeruzore/picasso, which includes trained models that can be used to make predictions easily and efficiently, in a fully auto-differentiable and hardware-accelerated framework, Comment: Accepted for publication in the Open Journal of Astrophysics; picasso is publicly available at https://github.com/fkeruzore/picasso

Boosting is an extremely successful idea, allowing one to combine multiple low accuracy classifiers into a much more accurate voting classifier. In this work, we present a new and surprisingly simple Boosting algorithm that obtains a provably optimal sample complexity. Sample optimal Boosting algorithms have only recently been developed, and our new algorithm has the fastest runtime among all such algorithms and is the simplest to describe: Partition your training data into 5 disjoint pieces of equal size, run AdaBoost on each, and combine the resulting classifiers via a majority vote. In addition to this theoretical contribution, we also perform the first empirical comparison of the proposed sample optimal Boosting algorithms. Our pilot empirical study suggests that our new algorithm might outperform previous algorithms on large data sets.