Search

Process mining is shifting towards use cases that explicitly leverage the relations between data objects and events under the term of object-centric process mining. Realizing this shift and generally simplifying the exchange and transformation of data between source systems and process mining solutions requires a standardized data format for such object-centric event data (OCED). This report summarizes the activities and results for identifying requirements and challenges for a community-supported standard for OCED. (1) We present a proposal for a core model for object-centric event data that underlies all known use cases. (2) We detail the limitations of the core model wrt. a broad range of use cases and discuss how to overcome them through conventions, usage patterns, and extensions of OCED, exhausting the design-space for an OCED data model and the inherent trade-offs in representing object-centric event data. (3) These insights are backed by five independent OCED implementations which are presented alongside a series of lessons learned in academic and industrial case studies. The results of this report provide guidance to the community to start adopting and building new process mining use cases and solutions around the reliable concepts for object-centric event data, and to engage in a structured process for standardizing OCED based on the known OCED design space., Comment: 46 pages, 11 figures, report of the OCED working group of the IEEE Taskforce on Process Mining towards the development of a new standard for exchange and storage of object-centric event data

Nuclear magnetic resonance (NMR) techniques have been used to study the static and dynamic microscopic properties of the Weyl semimetal NbP. From a complete analysis of the angular dependence of the $^{93}$Nb-NMR spectra in a single crystal, the parameters for the electric quadrupole interactions and the magnetic hyperfine interactions were determined to be $\nu_{\rm Q} = 0.61$\,MHz, $\eta = 0.20$, $(K_{XX}, K_{YY}, K_{ZZ}) = (- 0.06, 0.11, - 0.11)$\% at 4.5\,K. The temperature and field dependence of the $^{93}$Nb Knight shift revealed a characteristic feature of the shape of the density of states with nearly massless fermions. We clearly observed a quantum oscillation of the Knight shift associated with the band structure, whose frequency was in good agreement with the previous bulk measurements. The temperature dependence of the spin-lattice relaxation rate, $1 / T_{1} T$, showed an almost constant behavior for $30 < T < 180$\,K, while a weak temperature dependence was observed below $\sim 30$\,K. This contrasts with the behavior observed in TaP and TaAs, where the $1 / T_{1} T$ measured by the $^{181}$Ta nuclear quadrupole resonance (NQR) shows $1 / T_{1} T \propto T^{2}$ and $T^{4}$ above approximately 30\,K. In TaP, the temperature dependent orbital hyperfine interaction plays a signficant role in nuclear relaxation, whereas this contribution is not observed in TaAs. Two-component spin echo oscillations were observed. The shorter-period oscillation is attributed to the origin of quadrupole coupling, while the longer-period oscillation indicates the presence of indirect nuclear spin-spin coupling, as discussed in other Weyl semimetal like TaP.

Recent developments in AI have reinvigorated pursuits to advance the (life) sciences using AI techniques, thereby creating a renewed opportunity to bridge different fields and find synergies. Headlines for AI and the life sciences have been dominated by data-driven techniques, for instance, to solve protein folding with next to no expert knowledge. In contrast to this, we argue for the necessity of a formal representation of expert knowledge - either to develop explicit scientific theories or to compensate for the lack of data. Specifically, we argue that the fields of knowledge representation (KR) and systems biology (SysBio) exhibit important overlaps that have been largely ignored so far. This, in turn, means that relevant scientific questions are ready to be answered using the right domain knowledge (SysBio), encoded in the right way (SysBio/KR), and by combining it with modern automated reasoning tools (KR). Hence, the formal representation of domain knowledge is a natural meeting place for SysBio and KR. On the one hand, we argue that such an interdisciplinary approach will advance the field SysBio by exposing it to industrial-grade reasoning tools and thereby allowing novel scientific questions to be tackled. On the other hand, we see ample opportunities to move the state-of-the-art in KR by tailoring KR methods to the field of SysBio, which comes with challenging problem characteristics, e.g. scale, partial knowledge, noise, or sub-symbolic data. We stipulate that this proposed interdisciplinary research is necessary to attain a prominent long-term goal in the health sciences: precision medicine.

We introduce the notion of Laurent multiple orthogonal polynomials on the unit circle. These are the trigonometric polynomials that satisfy simultaneous orthogonality conditions with respect to several measures on the unit circle. This provides an alternative way to the approach of extending the usual theory of orthogonal polynomials on the unit circle to the multiple orthogonality case. We introduce Angelesco and AT systems, prove normality, and exhibit a connection to multiple orthogonal polynomials on the real line through the Szeg\H{o} mapping. We also present a generalized two-point Hermite-Pad\'e problem, whose solutions include multiple orthogonal polynomials of previous papers on the subject, as well as Laurent multiple orthogonal polynomials from the current paper, as special cases. Finally, we show that the Szeg\H{o} recurrence relations naturally extend to the solutions of this generalized Hermite-Pad\'e problem., Comment: 21 pages

In these notes we review, for a mathematical audience, the computation of (tree-level) scattering amplitudes in Yang-Mills theory in detail. In particular we demonstrate explicitly how the same formulas for six-particle NMHV helicity amplitudes are obtained from summing Feynman diagrams and from computing the canonical form of the $n=6, k=1, m=4$ amplituhedron., Comment: solicited contribution to a special volume on Positive Geometry for Le Matematiche; 20 pages, 4 figures

The distributed nature of cellular networks is one of the main enablers for integrated sensing and communication (ISAC). For target positioning and tracking, making use of bistatic measurements is non-trivial due to their non-linear relationship with Cartesian coordinates. Most of the literature proposes geometric-based methods to determine the target's location by solving a well-defined set of equations stemming from the available measurements. The error covariance to be used for Bayesian tracking is then derived from local Taylor expansions. In our work we adaptively fuse any subset of bistatic measurements using a maximum likelihood (ML) framework, allowing to incorporate every possible combination of available measurements, i.e., transmitter angle, receiver angle and bistatic range. Moreover, our ML approach is intrinsically flexible, as it can be extended to fuse an arbitrary number of measurements by multistatic setups. Finally, we propose both a fixed and dynamic way to compute the covariance matrix for the position error to be fed to Bayesian tracking techniques, like a Kalman filter. Numerical evaluations with realistic cellular communications parameters at mmWave frequencies show that our proposal outperforms the considered baselines, achieving a location and velocity root mean square error of 0.25 m and 0.83 m/s, respectively., Comment: 6 pages, 6 figures, 3 tables

Several gamma-ray observatories have discovered photons of cosmic origin with energies in the PeV ($10^{15}\,\text{eV}$) range. Photons at these energies might be produced as by-products from particle acceleration in so-called PeVatrons, which are widely assumed to be the sources of a large part of galactic cosmic rays. Based on recent measurements of these PeV $\gamma$-sources by LHAASO and HAWC, we extrapolate the energy spectra of selected sources up to the ultra-high-energy (UHE, ${\geq}10\,\text{PeV}$) regime. The goal of this study is to evaluate if (and under what conditions) giant air-shower observatories, for example the Pierre Auger Observatory, could contribute to testing the UHE luminosity of PeV $\gamma$-sources. Possible propagation effects are investigated as well as the required discrimination power to distinguish photon- and hadron-initiated air showers. For present detector setups, it turns out to be challenging to achieve the required sensitivity due to the energy threshold being too high or the detection area too small. Dedicated detector concepts appear to be needed to explore the UHE frontier. Ultimately, this could provide complementary information on the sources of cosmic rays beyond the PeV regime -- a key objective of current efforts in multimessenger astronomy., Comment: 8 pages, 3 figures, 2 tables

Quantum mechanics has greatly impacted our understanding of the microscopic nature. One of the key concepts of this theory is generalized measurements, which have proven useful in various quantum information processing tasks. However, despite their significance, they have not yet been shown empirically to provide an advantage in quantum randomness certification and expansion protocols. This investigation explores scenarios where generalized measurements can yield more than one bit of certified randomness with a single qubit system measurement on untrusted devices and against a quantum adversary. We compare the robustness of several protocols to exhibit the advantage of exploiting generalized measurements. In our analysis of experimental data, we were able to obtain $1.21$ bits of min-entropy from a measurement taken on one qubit of an entangled state. We also obtained $1.07$ bits of min-entropy from an experiment with quantum state preparation and generalized measurement on a single qubit. We also provide finite data analysis for a protocol using generalized measurements and the Entropy Accumulation Theorem. Our exploration demonstrates the potential of generalized measurements to improve the certification of quantum sources of randomness and enhance the security of quantum cryptographic protocols and other areas of quantum information., Comment: 14 pages, 5 figures

Many applications benefit from computations over the data of multiple users while preserving confidentiality. We present a solution where multiple mutually distrusting users' data can be aggregated with an acceptable overhead, while allowing users to be added to the system at any time without re-encrypting data. Our solution to this problem is to use a Trusted Execution Environment (Intel SGX) for the computation, while the confidential data is encrypted with the data owner's key and can be stored anywhere, without trust in the service provider. We do not require the user to be online during the computation phase and do not require a trusted party to store data in plain text. Still, the computation can only be carried out if the data owner explicitly has given permission. Experiments using common functions such as the sum, least square fit, histogram, and SVM classification, exhibit an average overhead of $1.6 \times$. In addition to these performance experiments, we present a use case for computing the distributions of taxis in a city without revealing the position of any other taxi to the other parties.

Accurate flood modeling is crucial for effective analysis and forecasting. Full momentum hydrodynamic models often require extensive computational time, sometimes exceeding the forecast horizon. In contrast, low-complexity models, like local-inertial approximations, provide accurate results in subcritical flows but may have limited skillfulness in supercritical conditions. This paper explores two main aspects: (i) the impact of urban infrastructure on 2D hydrodynamic modeling without detailed sewer and drainage data, and (ii) the accuracy of 2D local-inertial modeling using three numerical schemes (original formulation, s-centered, and s-upwind) in a dam-break scenario on complex, flat terrain. The HydroPol2D model is benchmarked against HEC-RAS 2D full momentum solver. We present one numerical case study and three real-world scenarios in S\~ao Paulo, Brazil: a detention pond with a $1$ in $100$-year inflow, a highly urbanized catchment with a $1$ in $50$-year hyetograph, and a dam-break scenario threatening a coastal city of nearly 200,000 residents. Results show that the model accurately simulates internal boundary conditions, achieving peak errors under 5\% compared to HEC-RAS 2D. However, neglecting urban infrastructure can lead to a 17.5\% difference in peak discharges at the outlet and significant mismatches in hydrographs, with computational times nearly doubling. The dam-break scenario demonstrates good predictive performance for maximum flood depths (CSI = $0.95$ for the original model, $0.92$ for s-centered, and $0.89$ for s-upwind), though the model's lack of convective inertia results in faster flood wave propagation than the full momentum solver. Notably, HydroPol2D is 23 times faster than HEC-RAS 2D, making it well-suited for simulating dam collapses in forecasting systems and capable of modeling urban drainage infrastructure such as orifices, weirs, and pumps., Comment: 1 table and 10 figures, under review

Empirical software engineering faces a critical gap: the lack of standardized tools for rapid development and execution of Test-Driven Software Experiments (TDSEs) - that is, experiments that involve the execution of software subjects and the observation and analysis of their "de facto" run-time behavior. In this paper we present a general-purpose analysis platform called LASSO that provides a minimal set of domain-specific languages and data structures to conduct TDSEs. By empowering users with an executable scripting language to design and execute TDSEs, LASSO enables efficient evaluation of run-time semantics and execution characteristics in addition to statically determined properties. We present an example TDSE that demonstrates the practical benefits of LASSO's scripting capabilities for assessing the reliability of LLMs for code generation by means of a self-contained, reusable and extensible study script. The LASSO platform is freely available at: https://softwareobservatorium.github.io/, and a demo video is available on YouTube: https://youtu.be/tzY9oNTWXzw

We study two dimensional and three dimensional tropical subrepresentations of the regular representation $\mathbb{B}[G]$ of a finite group over the tropical booleans, utilizing the theory of group representations over a fixed idempotent semifield as developed by Giansiracusa--Manaker. In dimension two we completely classify all two dimensional tropical subrepresentations of $\mathbb{B}[G]$, provide an explicit characterization for the set of bases of the corresponding matroids, and show an equivalence with the subgroups of $G$. In dimension three we show such an equivalence no longer holds. Towards a classification in dimension three we give a collection of tropical subrepresentations corresponding to subgroups of index 2, and we show that in the special case of finite cyclic groups, one can find three dimensional tropical subrepresentations that do not correspond to subgroups in a similar way., Comment: 18 pages

3D Gaussian Splats (3DGS) have proven a versatile rendering primitive, both for inverse rendering as well as real-time exploration of scenes. In these applications, coherence across camera frames and multiple views is crucial, be it for robust convergence of a scene reconstruction or for artifact-free fly-throughs. Recent work started mitigating artifacts that break multi-view coherence, including popping artifacts due to inconsistent transparency sorting and perspective-correct outlines of (2D) splats. At the same time, real-time requirements forced such implementations to accept compromises in how transparency of large assemblies of 3D Gaussians is resolved, in turn breaking coherence in other ways. In our work, we aim at achieving maximum coherence, by rendering fully perspective-correct 3D Gaussians while using a high-quality approximation of accurate blending, hybrid transparency, on a per-pixel level, in order to retain real-time frame rates. Our fast and perspectively accurate approach for evaluation of 3D Gaussians does not require matrix inversions, thereby ensuring numerical stability and eliminating the need for special handling of degenerate splats, and the hybrid transparency formulation for blending maintains similar quality as fully resolved per-pixel transparencies at a fraction of the rendering costs. We further show that each of these two components can be independently integrated into Gaussian splatting systems. In combination, they achieve up to 2$\times$ higher frame rates, 2$\times$ faster optimization, and equal or better image quality with fewer rendering artifacts compared to traditional 3DGS on common benchmarks., Comment: Project page: https://fhahlbohm.github.io/htgs/

With increasing amounts of data in astronomy, automated analysis methods have become crucial. Synthetic data are required for developing and testing such methods. Current simulations often suffer from insufficient detail or inaccurate representation of source type occurrences. To overcome those deficiencies, we implemented a deep generative model trained on observations to generate realistic radio galaxy images with full control over the flux and source morphology. We used a diffusion model, trained with continuous time steps to reduce sampling time without quality impairments. Two models were trained on two different datasets, respectively. One set was a selection of images from the second data release of the LOFAR Two-Metre Sky Survey (LoTSS). The model is conditioned on peak flux values to preserve signal intensity information after re-scaling image pixel values. The other, smaller set was obtained from the VLA survey of Faint Images of the Radio Sky at Twenty-Centimeters (FIRST). In that set, every image was provided with a morphological class label the corresponding model was conditioned on. Conditioned sampling is realized with classifier-free diffusion guidance. We evaluated the quality of generated images by comparing distributions of different quantities over the real and generated data, including results from the standard source-finding algorithms. The class conditioning was evaluated by training a classifier and comparing its performance on both real and generated data. We were able to generate realistic images of high quality using 25 sampling steps, which is unprecedented in the field of radio astronomy. The generated images are visually indistinguishable from the training data and the distributions of different image metrics were replicated. The classifier performs equally well for real and generated images, indicating strong sampling control over morphological properties.

This paper introduces a novel classification for Autonomous Mobile Robots (AMRs), into three phases and five steps, focusing on autonomous collision-free navigation. Additionally, it presents the main methods and widely accepted technologies for each phase of the proposed classification. The purpose of this classification is to facilitate understanding and establish connections between the independent input variables of the system (hardware, software) and autonomous navigation. By analyzing well-established technologies in terms of sensors and methods used for autonomous navigation, this paper aims to provide a foundation of knowledge that can be applied in future projects of mobile robots., Comment: This paper was presented at the JAR Congress in Buenos Aires, Argentina, and published as ID 27 at 9:20 on June 5, 2024. You can find more details on the conference at the following link: https://jar.com.ar/programa.html#programa. Additionally, the content of the presentation was re-recorded and uploaded to YouTube for better understanding: https://www.youtube.com/watch?v=TU6EkT43VfE&t=4s

Most robotic behaviours focus on either manipulation or locomotion, where tasks that require the integration of both, such as full-body throwing, remain under-explored. Throwing with a robot involves complex coordination between object manipulation and legged locomotion, which is crucial for advanced real-world interactions. This work investigates the challenge of full-body throwing in robotic systems and highlights the advantages of utilising the robot's entire body. We propose a deep reinforcement learning (RL) approach that leverages the robot's body to enhance throwing performance through a strategically designed curriculum to avoid local optima and sparse but informative reward functions to improve policy flexibility. The robot's body learns to generate additional momentum and fine-tune the projectile release velocity. Our full-body method achieves on average 47% greater throwing distance and 34% greater throwing accuracy than the arm alone, across two robot morphologies - an armed quadruped and a humanoid. We also extend our method to optimise robot stability during throws. The learned policy effectively generalises throwing to targets at any 3D point in space within a specified range, which has not previously been achieved and does so with human-level throwing accuracy. We successfully transferred this approach from simulation to a real robot using sim2real techniques, demonstrating its practical viability.

In reinforcement learning, if the agent's reward differs from the designers' true utility, even only rarely, the state distribution resulting from the agent's policy can be very bad, in theory and in practice. When RL policies would devolve into undesired behavior, a common countermeasure is KL regularization to a trusted policy ("Don't do anything I wouldn't do"). All current cutting-edge language models are RL agents that are KL-regularized to a "base policy" that is purely predictive. Unfortunately, we demonstrate that when this base policy is a Bayesian predictive model of a trusted policy, the KL constraint is no longer reliable for controlling the behavior of an advanced RL agent. We demonstrate this theoretically using algorithmic information theory, and while systems today are too weak to exhibit this theorized failure precisely, we RL-finetune a language model and find evidence that our formal results are plausibly relevant in practice. We also propose a theoretical alternative that avoids this problem by replacing the "Don't do anything I wouldn't do" principle with "Don't do anything I mightn't do"., Comment: 10 pages, 7 page appendix, 4 figures

Gaia astrometry of nearby stars is precise enough to detect the tiny displacements induced by substellar companions, but radial velocity data are needed for definitive confirmation. Here we present radial velocity follow-up observations of 28 M and K stars with candidate astrometric substellar companions, which led to the confirmation of two systems, Gaia-4b and Gaia-5b, and the refutation of 21 systems as stellar binaries. Gaia-4b is a massive planet ($M = 11.8 \pm 0.7 \:\mathrm{M_J}$) in a $P = 571.3 \pm 1.4\:\mathrm{day}$ orbit with a projected semi-major axis $a_0=0.312 \pm 0.040\:\mathrm{mas}$ orbiting a $0.644 \pm 0.02 \:\mathrm{M_\odot}$ star. Gaia-5b is a brown dwarf ($M = 20.9 \pm 0.5\:\mathrm{M_J}$) in a $P = 358.58 \pm 0.19\:\mathrm{days}$ eccentric $e=0.6412 \pm 0.0027$ orbit with a projected angular semi-major axis of $a_0 = 0.947 \pm 0.038\:\mathrm{mas}$ around a $0.34 \pm 0.03 \mathrm{M_\odot}$ star. Gaia-4b is one of the first exoplanets discovered via the astrometric technique, and is one of the most massive planets known to orbit a low-mass star., Comment: Submitted to AAS journals. 26 pages, 12 figures, 4 tables

Hydrogen, while a promising sustainable energy carrier, presents challenges such as the embrittlement of materials due to its ability to penetrate and weaken their crystal structures. Here we investigate Fe4N nitride layers, formed on iron through a cost-effective gas nitriding process, as an effective hydrogen permeation barrier. A combination of screening using advanced characterization, density functional theory calculations, and hydrogen permeation analysis reveals that a nitride layer reduces hydrogen diffusion by a factor of 20 at room temperature. This reduction is achieved by creating energetically unfavorable states due to stronger H-binding at the surface and high energy barriers for diffusion. The findings demonstrate the potential of Fe4N as a cost-efficient and easy-to-process solution to protecting metallic materials exposed to hydrogen, with great advantages for large-scale applications.

With the rapid advancement of Natural Language Processing in recent years, numerous studies have shown that generic summaries generated by Large Language Models (LLMs) can sometimes surpass those annotated by experts, such as journalists, according to human evaluations. However, there is limited research on whether these generic summaries meet the individual needs of ordinary people. The biggest obstacle is the lack of human-annotated datasets from the general public. Existing work on personalized summarization often relies on pseudo datasets created from generic summarization datasets or controllable tasks that focus on specific named entities or other aspects, such as the length and specificity of generated summaries, collected from hypothetical tasks without the annotators' initiative. To bridge this gap, we propose a high-quality, personalized, manually annotated abstractive summarization dataset called PersonalSum. This dataset is the first to investigate whether the focus of public readers differs from the generic summaries generated by LLMs. It includes user profiles, personalized summaries accompanied by source sentences from given articles, and machine-generated generic summaries along with their sources. We investigate several personal signals - entities/topics, plot, and structure of articles - that may affect the generation of personalized summaries using LLMs in a few-shot in-context learning scenario. Our preliminary results and analysis indicate that entities/topics are merely one of the key factors that impact the diverse preferences of users, and personalized summarization remains a significant challenge for existing LLMs., Comment: Accepted at NeurIPS 2024 Track on Datasets and Benchmarks. Code available at https://github.com/SmartmediaAI/PersonalSum

Interferometers are essential tools to measure and shape optical fields, and are widely used in optical metrology, sensing, laser physics, and quantum mechanics. They superimpose waves with a mutual phase delay, resulting in a change in light intensity. A frequency-dependent phase delay then allows to shape the spectrum of light, which is essential for filtering, routing, wave shaping, or multiplexing. Simple Mach-Zehnder interferometers superimpose spatial waves and typically generate an output intensity that depends sinusoidally on frequency, limiting the capabilities for spectral engineering. Here, we present a novel framework that uses the interference of multiple transverse modes in a single multimode waveguide to achieve arbitrary spectral shapes in a compact geometry. Through the design of corrugated gratings, these modes couple to each other, allowing the exchange of energy similar to a beam splitter, facilitating easy handling of multiple modes. We theoretically and experimentally demonstrate narrow-linewidth spectra with independently tunable free spectral range and linewidth, as well as independent spectral shapes for various transverse modes. Our methodology can be applied to orthogonal optical modes of different orders, polarization, and angular momentum, and holds promise for sensing, optical metrology, calibration, and computing., Comment: 19 pages, 4 figures

We characterise quantitative semi-uniform stability for $C_0$-semigroups arising from port-Hamiltonian systems, complementing recent works on exponential and strong stability. With the result, we present a simple universal example class of port-Hamiltonian $C_0$-semigroups exhibiting arbitrary decay rates slower than $t^{-1/2}$. The latter is based on results from the theory of Diophantine approximation as the decay rates will be strongly related to approximation properties of irrational numbers by rationals given through cut-offs of continued fraction expansions., Comment: 22 pages

The quantum molecular dynamics (QMD) part of the UrQMD model is extended to allow implementation of momentum dependent potentials from a parity doubling chiral mean field (CMF) model. Important aspects like energy conservation and effects on particle production and flow are discussed. It is shown, that this new implementation reproduces qualitatively and quantitatively available data over a wide range of beam energies and improves the description of observables without exception. In particular the description of hyperon and pion production at SIS18 energies is improved. From a comparison with HADES data one could conclude that the present parametrization of the CMF model leads to a slightly too weak momentum dependence. However, a more firm conclusion will require a systematic comparison with flow and multiplicity data over a range of beam energies and system sizes. Our work serves as an important step towards such future studies where the properties of dense QCD matter, through parameters of the CMF model, can be constraint using a comparison of the UrQMD model with high precision heavy ion data, finally also allowing direct comparisons with neutron star and neutron star merger observables., Comment: 13 pages, 15 figures

The accurate modelling of structural dynamics is crucial across numerous engineering applications, such as Structural Health Monitoring (SHM), seismic analysis, and vibration control. Often, these models originate from physics-based principles and can be derived from corresponding governing equations, often of differential equation form. However, complex system characteristics, such as nonlinearities and energy dissipation mechanisms, often imply that such models are approximative and often imprecise. This challenge is further compounded in SHM, where sensor data is often sparse, making it difficult to fully observe the system's states. To address these issues, this paper explores the use of Physics-Informed Neural Networks (PINNs), a class of physics-enhanced machine learning (PEML) techniques, for the identification and estimation of dynamical systems. PINNs offer a unique advantage by embedding known physical laws directly into the neural network's loss function, allowing for simple embedding of complex phenomena, even in the presence of uncertainties. This study specifically investigates three key applications of PINNs: state estimation in systems with sparse sensing, joint state-parameter estimation, when both system response and parameters are unknown, and parameter estimation within a Bayesian framework to quantify uncertainties. The results demonstrate that PINNs deliver an efficient tool across all aforementioned tasks, even in presence of modelling errors. However, these errors tend to have a more significant impact on parameter estimation, as the optimization process must reconcile discrepancies between the prescribed model and the true system behavior. Despite these challenges, PINNs show promise in dynamical system modeling, offering a robust approach to handling uncertainties.

Convolutional neural networks (CNNs) have shown great effectiveness in medical image segmentation. However, they may be limited in modeling large inter-subject variations in organ shapes and sizes and exploiting global long-range contextual information. This is because CNNs typically employ convolutions with fixed-sized local receptive fields and lack the mechanisms to utilize global information. To address these limitations, we developed Dynamic Multi-Resolution Convolution (DMRC) and Dynamic Multi-Scale Convolution (DMSC) modules. Both modules enhance the representation capabilities of single convolutions to capture varying scaled features and global contextual information. This is achieved in the DMRC module by employing a convolutional filter on images with different resolutions and subsequently utilizing dynamic mechanisms to model global inter-dependencies between features. In contrast, the DMSC module extracts features at different scales by employing convolutions with different kernel sizes and utilizing dynamic mechanisms to extract global contextual information. The utilization of convolutions with different kernel sizes in the DMSC module may increase computational complexity. To lessen this burden, we propose to use a lightweight design for convolution layers with a large kernel size. Thus, DMSC and DMRC modules are designed as lightweight drop-in replacements for single convolutions, and they can be easily integrated into general CNN architectures for end-to-end training. The segmentation network was proposed by incorporating our DMSC and DMRC modules into a standard U-Net architecture, termed Dynamic Multi-scale and Multi-resolution Convolution network (DMC-Net). The results demonstrate that our proposed DMSC and DMRC can enhance the representation capabilities of single convolutions and improve segmentation accuracy., Comment: 14 pages, 4 figures

We show that, under mild assumptions, every distribution on the hypercube $\{0, 1\}^{n}$ that admits a polynomial-time Markov chain approximate sampler also has an exact sampling algorithm with expected running time in poly$(n)$., Comment: 12 pages

Deep learning-based methods have been widely researched in the areas of language and vision, demonstrating their capacity to understand long sequences of data and their usefulness in numerous helio-physics applications. Foundation models (FMs), which are pre-trained on a large-scale datasets, form the basis for a variety of downstream tasks. These models, especially those based on transformers in vision and language, show exceptional potential for adapting to a wide range of downstream applications. In this paper, we provide our perspective on the criteria for designing an FM for heliophysics and associated challenges and applications using the Solar Dynamics Observatory (SDO) dataset. We believe that this is the first study to design an FM in the domain of heliophysics., Comment: 31 Pages, 12 figures

Brain-body-computer interfaces aim to provide a fluid and natural way for humans to interact with technology. Among noninvasive interfaces, surface electromyogram (sEMG) signals have shown particular utility. However, much remains unknown about how sEMG is affected by various physiological and anatomical factors and how these confounds might affect gesture decoding across individuals or groups. In this article, we show that sEMG signals evince non-Euclidean graph data structure that is defined by a set of orthogonal axes and explain the signal distribution shift across individuals. We provide a dataset of upper limb sEMG signals and physiological measures of 91 adults as they perform 10 different hand gestures. Participants were selected to be representative of various age groups (18to 92 years) and BMI (healthy, overweight, and obese). Additional anatomical or physiological measures that might impact sEMG signals were also collected, such as skin hydration and elasticity. The article describes the inherent structure of sEMG data and provides methods to construct differentiable signal features that can be used with machine learning algorithms that use backpropagation. We then analyze how those parameters correlate with various physiological measures to probe if they can induce bias against (or towards) certain population groups. We find that higher frequencies in sEMG, although comprising less power than lower ones, provide better gesture decoding and show less bias with regard to demographic, circumstantial, and physiological confounds (such as age, skin hydration, and skin elasticity)., Comment: 24 pages

We present a new additive method, nicknamed sage for Simplified Additive Gaussian processes Emulator, to emulate climate model Perturbed Parameter Ensembles (PPEs). It estimates the value of a climate model output as the sum of additive terms. Each additive term is the mean of a Gaussian Process, and corresponds to the impact of a parameter or parameter group on the variable of interest. This design caters to the sparsity of PPEs which are characterized by limited ensemble members and high dimensionality of the parameter space. sage quantifies the variability explained by different parameters and parameter groups, providing additional insights on the parameter-climate model output relationship. We apply the method to two climate model PPEs and compare it to a fully connected Neural Network. The two methods have comparable performance with both PPEs, but sage provides insights on parameter and parameter group importance as well as diagnostics useful for optimizing PPE design. Insights gained are valid regardless of the emulator method used, and have not been previously addressed. Our work highlights that analyzing the PPE used to train an emulator is different from analyzing data generated from an emulator trained on the PPE, as the former provides more insights on the data structure in the PPE which could help inform the emulator design., Comment: Manuscript to be submitted to Journal of Advances in Modeling Earth Systems (JAMES)

The task of automated code review has recently gained a lot of attention from the machine learning community. However, current review comment evaluation metrics rely on comparisons with a human-written reference for a given code change (also called a diff), even though code review is a one-to-many problem like generation and summarization with many "valid reviews" for a diff. To tackle these issues we develop a CRScore - a reference-free metric to measure dimensions of review quality like conciseness, comprehensiveness, and relevance. We design CRScore to evaluate reviews in a way that is grounded in claims and potential issues detected in the code by LLMs and static analyzers. We demonstrate that CRScore can produce valid, fine-grained scores of review quality that have the greatest alignment with human judgment (0.54 Spearman correlation) and are more sensitive than reference-based metrics. We also release a corpus of 2.6k human-annotated review quality scores for machine-generated and GitHub review comments to support the development of automated metrics.

The study of magnetoresistance (MR) phenomena has been pivotal in advancing magnetic sensors and spintronic devices. Helimagnets present an intriguing avenue for spintronics research. Theoretical predictions suggest that MR magnitude in the helimagnetic (HM) regime surpasses that in the ferromagnetic (FM) regime by over an order of magnitude. However, in metallic helimagnets like manganese phosphide, MR in the HM phase remains modest (10%), limiting its application in MR devices. Here, a groundbreaking approach is presented to achieve a giant low field MR effect in nanostructured manganese phosphide films by leveraging confinement and strain effects along with spin helicity. Unlike the modest MR observed in bulk manganese phosphide single crystals and large grain polycrystalline films, which exhibit a small negative MR in the FM region (2%) increasing to 8% in the HM region across 10-300 K, a grain size-dependent giant positive MR (90%) is discovered near FM to HM transition temperature (110 K), followed by a rapid decline to a negative MR below 55 K in manganese phosphide nanocrystalline films. These findings illuminate a novel strain-mediated spin helicity phenomenon in nanostructured helimagnets, presenting a promising pathway for the development of high-performance MR sensors and spintronic devices through the strategic utilization of confinement and strain effects.

In this paper, we develop an embodied AI system for human-in-the-loop navigation with a wheeled mobile robot. We propose a direct yet effective method of monitoring the robot's current plan to detect changes in the environment that impact the intended trajectory of the robot significantly and then query a human for feedback. We also develop a means to parse human feedback expressed in natural language into local navigation waypoints and integrate it into a global planning system, by leveraging a map of semantic features and an aligned obstacle map. Extensive testing in simulation and physical hardware experiments with a resource-constrained wheeled robot tasked to navigate in a real-world environment validate the efficacy and robustness of our method. This work can support applications like precision agriculture and construction, where persistent monitoring of the environment provides a human with information about the environment state.

The challenge in reconfigurable manipulation of sound waves using metasurfaces lies in achieving precise control over acoustic behavior while developing efficient and practical tuning methods for structural configurations. However, most studies on reconfigurable acoustic metasurfaces rely on cumbersome and time-consuming control systems. These approaches often struggle with fabrication techniques, as conventional methods face limitations such as restricted material choices, challenges in achieving complex geometries, and difficulties in incorporating flexible components. This paper proposes a novel approach for developing a reconfigurable metasurface inspired by the Kresling origami pattern, designed for programmable manipulation of acoustic waves at an operating frequency of 2000 Hz. The origami unit cell is fabricated using multi-material 3D printing technology, allowing for the simultaneous printing of two materials with different mechanical properties, thus creating a bistable origami-based structure. Through optimization, two equilibrium states achieve a reflection phase difference of {\pi} through the application of small axial force, F, or torque, T. Various configurations of the metasurface, generated from different combinations of these two equilibria, enable distinct reflective behaviors with switchable and programmable functionalities. The principle of this work simplifies the shaping of acoustic waves through a straightforward mechanical mechanism, eliminating the need for complex control systems and time-consuming adjustments. This innovative approach paves a novel and effective perspective for developing on-demand switchable and tunable devices across diverse fields, including electromagnetics, mechanics, and elastics, leveraging multi-material printing technology.

Adaptivity and local mesh refinement are crucial for the efficient numerical simulation of wave phenomena in complex geometry. Local mesh refinement, however, can impose a tiny time-step across the entire computational domain when using explicit time integration. By taking smaller time-steps yet only inside locally refined regions, local time-stepping methods overcome the stringent CFL stability restriction imposed on the global time-step by a small fraction of the elements without sacrificing explicitness. In [21], a leapfrog based local time-stepping method was proposed for the inhomogeneous wave equation, which applies standard leapfrog time-marching with a smaller time-step inside the refined region. Here, to remove potential instability at certain time-steps, a stabilized version is proposed which leads to optimal L2-error estimates under a CFL condition independent of the coarse-to-fine mesh ratio. Moreover, a weighted transition is introduced to restore optimal H1-convergence when the source is nonzero across the coarse-to-fine mesh interface. Numerical experiments corroborate the theoretical error estimates and illustrate the usefulness of these improvements.

Improved surgical skill is generally associated with improved patient outcomes, although assessment is subjective; labour-intensive; and requires domain specific expertise. Automated data driven metrics can alleviate these difficulties, as demonstrated by existing machine learning instrument tracking models in minimally invasive surgery. However, these models have been tested on limited datasets of laparoscopic surgery, with a focus on isolated tasks and robotic surgery. In this paper, a new public dataset is introduced, focusing on simulated surgery, using the nasal phase of endoscopic pituitary surgery as an exemplar. Simulated surgery allows for a realistic yet repeatable environment, meaning the insights gained from automated assessment can be used by novice surgeons to hone their skills on the simulator before moving to real surgery. PRINTNet (Pituitary Real-time INstrument Tracking Network) has been created as a baseline model for this automated assessment. Consisting of DeepLabV3 for classification and segmentation; StrongSORT for tracking; and the NVIDIA Holoscan SDK for real-time performance, PRINTNet achieved 71.9% Multiple Object Tracking Precision running at 22 Frames Per Second. Using this tracking output, a Multilayer Perceptron achieved 87% accuracy in predicting surgical skill level (novice or expert), with the "ratio of total procedure time to instrument visible time" correlated with higher surgical skill. This therefore demonstrates the feasibility of automated surgical skill assessment in simulated endoscopic pituitary surgery. The new publicly available dataset can be found here: https://doi.org/10.5522/04/26511049., Comment: 7 pages, 6 figures

Accurate intra-operative Remaining Surgery Duration (RSD) predictions allow for anaesthetists to more accurately decide when to administer anaesthetic agents and drugs, as well as to notify hospital staff to send in the next patient. Therefore RSD plays an important role in improving patient care and minimising surgical theatre costs via efficient scheduling. In endoscopic pituitary surgery, it is uniquely challenging due to variable workflow sequences with a selection of optional steps contributing to high variability in surgery duration. This paper presents PitRSDNet for predicting RSD during pituitary surgery, a spatio-temporal neural network model that learns from historical data focusing on workflow sequences. PitRSDNet integrates workflow knowledge into RSD prediction in two forms: 1) multi-task learning for concurrently predicting step and RSD; and 2) incorporating prior steps as context in temporal learning and inference. PitRSDNet is trained and evaluated on a new endoscopic pituitary surgery dataset with 88 videos to show competitive performance improvements over previous statistical and machine learning methods. The findings also highlight how PitRSDNet improve RSD precision on outlier cases utilising the knowledge of prior steps., Comment: Accepted to the Augmented Environments for Computer-Assisted Interventions (AE-CAI) Workshop at the Medical Image Computing and Computer-Assisted Interventions (MICCAI) Conference 2024

The realization of fault-tolerant quantum computing requires the execution of quantum error-correction (QEC) schemes, to mitigate the fragile nature of qubits. In this context, to ensure the success of QEC, a protocol capable of implementing both qubit reset and leakage reduction is highly desirable. We demonstrate such a protocol in an architecture consisting of fixed-frequency transmon qubits pair-wise coupled via tunable couplers -- an architecture that is compatible with the surface code. We use tunable couplers to transfer any undesired qubit excitation to the readout resonator of the qubit, from which this excitation decays into the feedline. In total, the combination of qubit reset, leakage reduction, and coupler reset takes only 83ns to complete. Our reset scheme is fast, unconditional, and achieves fidelities well above 99%, thus enabling fixed-frequency qubit architectures as future implementations of fault-tolerant quantum computers. Our protocol also provides a means to both reduce QEC cycle runtime and improve algorithmic fidelity on quantum computers.

This paper classifies all Higgs branch Higgsing patterns for simply-laced unitary quiver gauge theories with eight supercharges (including multiple loops) and introduces a Higgs branch subtraction algorithm. All possible minimal transitions are given, identifying differences between slices that emerge on the Higgs and Coulomb branches. In particular, the algorithm is sensitive to global information including monodromies and Namikawa-Weyl groups. Guided by symplectic duality, the algorithm further determines the global symmetry on the Coulomb branch, and verifies the exclusion of $C$ type or $F_4$ global symmetry for (simply-laced) unitary quiver gauge theories. The Higgs branches of some unitary quivers are verified to give slices in the nilpotent cones of exceptional simple Lie algebras.

Crop field boundaries are foundational datasets for agricultural monitoring and assessments but are expensive to collect manually. Machine learning (ML) methods for automatically extracting field boundaries from remotely sensed images could help realize the demand for these datasets at a global scale. However, current ML methods for field instance segmentation lack sufficient geographic coverage, accuracy, and generalization capabilities. Further, research on improving ML methods is restricted by the lack of labeled datasets representing the diversity of global agricultural fields. We present Fields of The World (FTW) -- a novel ML benchmark dataset for agricultural field instance segmentation spanning 24 countries on four continents (Europe, Africa, Asia, and South America). FTW is an order of magnitude larger than previous datasets with 70,462 samples, each containing instance and semantic segmentation masks paired with multi-date, multi-spectral Sentinel-2 satellite images. We provide results from baseline models for the new FTW benchmark, show that models trained on FTW have better zero-shot and fine-tuning performance in held-out countries than models that aren't pre-trained with diverse datasets, and show positive qualitative zero-shot results of FTW models in a real-world scenario -- running on Sentinel-2 scenes over Ethiopia.

Developing robust representations of chemical structures that enable models to learn topological inductive biases is challenging. In this manuscript, we present a representation of atomistic systems. We begin by proving that our representation satisfies all structural, geometric, efficiency, and generalizability constraints. Afterward, we provide a general algorithm to encode any atomistic system. Finally, we report performance comparable to state-of-the-art methods on numerous tasks. We open-source all code and datasets. The code and data are available at https://github.com/rahulkhorana/PolyatomicComplexes.

In this paper we generalize the technique of deflation to define two new methods to systematically find many local minima of a nonlinear least squares problem. The methods are based on the Gauss-Newton algorithm, and as such do not require the calculation of a Hessian matrix. They also require fewer deflations than for applying the deflated Newton method on the first order optimality conditions, as the latter finds all stationary points, not just local minima. One application of interest covered in this paper is the inverse eigenvalue problem (IEP) associated with the modelling of spectroscopic data of relevance to the physical and chemical sciences. Open source MATLAB code is provided at https://github.com/AlbanBloorRiley/DeflatedGaussNewton.

Generative AI (GAI) holds great potential to improve software engineering productivity, but its untrustworthy outputs, particularly in code synthesis, pose significant challenges. The need for extensive verification and validation (V&V) of GAI-generated artifacts may undermine the potential productivity gains. This paper proposes a way of mitigating these risks by exploiting GAI's ability to generate multiple versions of code and tests to facilitate comparative analysis across versions. Rather than relying on the quality of a single test or code module, this "differential GAI" (D-GAI) approach promotes more reliable quality evaluation through version diversity. We introduce the Large-Scale Software Observatorium (LASSO), a platform that supports D-GAI by executing and analyzing large sets of code versions and tests. We discuss how LASSO enables rigorous evaluation of GAI-generated artifacts and propose its application in both software development and GAI research., Comment: This work has been accepted for publication in an upcoming issue of IEEE Software. This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible

Perspective distortion (PD) leads to substantial alterations in the shape, size, orientation, angles, and spatial relationships of visual elements in images. Accurately determining camera intrinsic and extrinsic parameters is challenging, making it hard to synthesize perspective distortion effectively. The current distortion correction methods involve removing distortion and learning vision tasks, thus making it a multi-step process, often compromising performance. Recent work leverages the M\"obius transform for mitigating perspective distortions (MPD) to synthesize perspective distortions without estimating camera parameters. M\"obius transform requires tuning multiple interdependent and interrelated parameters and involving complex arithmetic operations, leading to substantial computational complexity. To address these challenges, we propose Log Conformal Maps (LCM), a method leveraging the logarithmic function to approximate perspective distortions with fewer parameters and reduced computational complexity. We provide a detailed foundation complemented with experiments to demonstrate that LCM with fewer parameters approximates the MPD. We show that LCM integrates well with supervised and self-supervised representation learning, outperform standard models, and matches the state-of-the-art performance in mitigating perspective distortion over multiple benchmarks, namely Imagenet-PD, Imagenet-E, and Imagenet-X. Further LCM demonstrate seamless integration with person re-identification and improved the performance. Source code is made publicly available at https://github.com/meenakshi23/Log-Conformal-Maps., Comment: Accepted to Asian Conference on Computer Vision (ACCV2024)

The integration of computing with memory is essential for distributed, massively parallel, and adaptive architectures such as neural networks in artificial intelligence (AI). Accelerating AI can be achieved through photonic computing, but it requires nonvolatile photonic memory capable of rapid updates during on-chip training sessions or when new information becomes available during deployment. Phase-change materials (PCMs) are promising for providing compact, nonvolatile optical weighting; however, they face limitations in terms of bit precision, programming speed, and cycling endurance. Here, we propose a novel photonic memory cell that merges nonvolatile photonic weighting using PCMs with high-speed, volatile tuning enabled by an integrated PN junction. Our experiments demonstrate that the same PN modulator, fabricated via a foundry compatible process, can achieve dual functionality. It supports coarse programmability for setting initial optical weights and facilitates high-speed fine-tuning to adjust these weights dynamically. The result showcases a 400-fold increase in volatile tuning speed and a 10,000-fold enhancement in efficiency. This multifunctional photonic memory with volatile and nonvolatile capabilities could significantly advance the performance and versatility of photonic memory cells, providing robust solutions for dynamic computing environments.

Reid-Smith recently parametrised groups acting on trees with Tits' independence property (P) using graph-based combinatorial structures known as local action diagrams. Properties of the acting (topological) group, such as being locally compact, compactly generated or simple, are reflected in its local action diagram. In this article we provide necessary and sufficient conditions on the local action diagram for the associated group to be discrete., Comment: 16 pages, 2 figures

In gossip networks, a source node forwards time-stamped updates to a network of observers according to a Poisson process. The observers then update each other on this information according to Poisson processes as well. The Age of Information (AoI) of a given node is the difference between the current time and the most recent time-stamp of source information that the node has received. We provide a method for evaluating the AoI of a node in terms of first passage percolation. We then use this distributional identity to prove matching upper and lower bounds on the AoI in terms of connectivity properties of the underlying network. In particular, if one sets $X_v$ to be the AoI of node $v$ on a finite graph $G$ with $n$ nodes, then we define $m_\ast = \min\{m : m \cdot |B_m(v)| \geq n\}$ where $B_m(v)$ is the ball of radius $m$ in $G$. In the case when the maximum degree of $G$ is bounded by $\Delta$ we prove $\mathbb{E} X_v = \Theta_\Delta(m_\ast)$. As corollaries, we solve multiple open problems in the literature such as showing the age of information on a subset of $\mathbb{Z}^d$ is $\Theta(n^{1/(d+1)})$. We also demonstrate examples of graphs with AoI scaling like $n^{\alpha}$ for each $\alpha \in (0,1/2)$. These graphs are not vertex-transitive and in fact we show that if one considers the AoI on a graph coming from a vertex-transitive infinite graph then either $\mathbb{E} X_v = \Theta(n^{1/k})$ for some integer $k \geq 2$ or $\mathbb{E} X_v = n^{o(1)}$., Comment: 12 pages

Principal component analysis (PCA) is often used to analyze multivariate data together with cluster analysis, which depends on the number of principal components used. It is therefore important to determine the number of significant principal components (PCs) extracted from a data set. Here we use a variational Bayesian version of classical PCA, to develop a new method for estimating the number of significant PCs in contexts where the number of samples is of a similar to or greater than the number of features. This eliminates guesswork and potential bias in manually determining the number of principal components and avoids overestimation of variance by filtering noise. This framework can be applied to datasets of different shapes (number of rows and columns), different data types (binary, ordinal, categorical, continuous), and with noisy and missing data. Therefore, it is especially useful for data with arbitrary encodings and similar numbers of rows and columns, such as cultural, ecological, morphological, and behavioral datasets. We tested our method on both synthetic data and empirical datasets and found that it may underestimate but not overestimate the number of principal components for the synthetic data. A small number of components was found for each empirical dataset. These results suggest that it is broadly applicable across the life sciences., Comment: 9 pages, 2 figures

We determine the onset of Quarkyonic Matter corresponding to values of temperature and baryon chemical potential at which the quark phase space density becomes one. At zero temperature for baryon chemical potentials below the mass of the Lambda baryon, only nucleons contribute to the quark density. This is different at finite temperature, where all baryons, mesons and their resonances can be excited and thus add quarks to the phase space. The probability density to find a quark inside a hadron is determined using the Yukawa ansatz of the IdylliQ model of Quarkyonic Matter. We estimate separately the magnitude of the various contributions of nucleons, Delta baryons, pions as well as further hadrons and resonances. The uncertainty in the parametrization of the probability density to find a quark inside a nucleon is spanned by assuming that at zero temperature the transition density to Quarkyonic Matter is between one and three times that of nuclear matter. Various predictions for a possible critical point associated with the chiral phase transition are found close to a triple point at which the line of the deconfinement transition and the curve associated with the transition to Quarkyonic Matter intersect. These considerations provide an estimate for the region in the QCD phase diagram where Quarkyonic Matter may be found., Comment: 24 pages, 5 figures

We study open-ended evolution by focusing on computational and information-processing dynamics underlying major evolutionary transitions. In doing so, we consider biological organisms as hierarchical dynamical systems that generate regularities in their phase-spaces through interactions with their environment. These emergent information patterns can then be encoded within the organism's components, leading to self-modelling "tangled hierarchies". Our main conjecture is that when macro-scale patterns are encoded within micro-scale components, it creates fundamental tensions (computational inconsistencies) between what is encodable at a particular evolutionary stage and what is potentially realisable in the environment. A resolution of these tensions triggers an evolutionary transition which expands the problem-space, at the cost of generating new tensions in the expanded space, in a continual process. We argue that biological complexification can be interpreted computation-theoretically, within the G\"odel--Turing--Post recursion-theoretic framework, as open-ended generation of computational novelty. In general, this process can be viewed as a meta-simulation performed by higher-order systems that successively simulate the computation carried out by lower-order systems. This computation-theoretic argument provides a basis for hypothesising the biological arrow of time., Comment: 30 pages, 13 figures

We investigate the role of assortative mating in speciation using the sympatric model of Derrida and Higgs. The model explores the idea that genetic differences create incompatibilities between individuals, preventing mating if the number of such differences is too large. Speciation, however, only happens in this mating system if the number of genes is large. Here we show that speciation with small genome sizes can occur if assortative mating is introduced. In our model individuals are represented by three chromosomes: one responsible for reproductive compatibility, one for coding the trait on which assortativity will operate, and a neutral chromosome. Reproduction is possible if individuals are genetically similar with respect to the first chromosome, but among these compatible mating partners, the one with the most similar trait coded by the second chromosome is selected. We show that this type of assortativity facilitates speciation, which can happen with a small number of genes in the first chromosome. Species, classified according to reproductive isolation, dictated by the first chromosome, can display different traits values, as measured by the second and the third chromosomes. Therefore, species can also be identified based on similarity of the neutral trait, which works as a proxy for reproductive isolation., Comment: 23 pages, 7 figures