Search

In this paper, we present a new approach for uncertainty-aware retinal layer segmentation in Optical Coherence Tomography (OCT) scans using probabilistic signed distance functions (SDF). Traditional pixel-wise and regression-based methods primarily encounter difficulties in precise segmentation and lack of geometrical grounding respectively. To address these shortcomings, our methodology refines the segmentation by predicting a signed distance function (SDF) that effectively parameterizes the retinal layer shape via level set. We further enhance the framework by integrating probabilistic modeling, applying Gaussian distributions to encapsulate the uncertainty in the shape parameterization. This ensures a robust representation of the retinal layer morphology even in the presence of ambiguous input, imaging noise, and unreliable segmentations. Both quantitative and qualitative evaluations demonstrate superior performance when compared to other methods. Additionally, we conducted experiments on artificially distorted datasets with various noise types-shadowing, blinking, speckle, and motion-common in OCT scans to showcase the effectiveness of our uncertainty estimation. Our findings demonstrate the possibility to obtain reliable segmentation of retinal layers, as well as an initial step towards the characterization of layer integrity, a key biomarker for disease progression. Our code is available at \url{https://github.com/niazoys/RLS_PSDF}.

Unconstrained global optimisation aims to optimise expensive-to-evaluate black-box functions without gradient information. Bayesian optimisation, one of the most well-known techniques, typically employs Gaussian processes as surrogate models, leveraging their probabilistic nature to balance exploration and exploitation. However, Gaussian processes become computationally prohibitive in high-dimensional spaces. Recent alternatives, based on inverse distance weighting (IDW) and radial basis functions (RBFs), offer competitive, computationally lighter solutions. Despite their efficiency, both traditional global and Bayesian optimisation strategies suffer from the myopic nature of their acquisition functions, which focus solely on immediate improvement neglecting future implications of the sequential decision making process. Nonmyopic acquisition functions devised for the Bayesian setting have shown promise in improving long-term performance. Yet, their use in deterministic strategies with IDW and RBF remains unexplored. In this work, we introduce novel nonmyopic acquisition strategies tailored to IDW- and RBF-based global optimisation. Specifically, we develop dynamic programming-based paradigms, including rollout and multi-step scenario-based optimisation schemes, to enable lookahead acquisition. These methods optimise a sequence of query points over a horizon (instead of only at the next step) by predicting the evolution of the surrogate model, inherently managing the exploration-exploitation trade-off in a systematic way via optimisation techniques. The proposed approach represents a significant advance in extending nonmyopic acquisition principles, previously confined to Bayesian optimisation, to the deterministic framework. Empirical results on synthetic and hyperparameter tuning benchmark problems demonstrate that these nonmyopic methods outperform conventional myopic approaches., Comment: 31 pages, 4 figures, 2 tables, submitted to Springer Computational Optimization and Applications

Blind quantum computing (BQC) is a promising application of distributed quantum systems, where a client can perform computations on a remote server without revealing any details of the applied circuit. While the most promising realizations of quantum computers are based on various matter qubit platforms, implementing BQC on matter qubits remains an outstanding challenge. Using silicon-vacancy (SiV) centers in nanophotonic diamond cavities with an efficient optical interface, we experimentally demonstrate a universal quantum gate set consisting of single- and two-qubit blind gates over a distributed two-node network. Using these ingredients, we perform a distributed algorithm with blind operations across our two-node network, paving the way towards blind quantum computation with matter qubits in distributed, modular architectures., Comment: 47 pages, 29 figures

Online model predictive control (MPC) for piecewise affine (PWA) systems requires the online solution to an optimization problem that implicitly optimizes over the switching sequence of PWA regions, for which the computational burden can be prohibitive. Alternatively, the computation can be moved offline using explicit MPC; however, the online memory requirements and the offline computation can then become excessive. In this work we propose a solution in between online and explicit MPC, addressing the above issues by partially dividing the computation between online and offline. To solve the underlying MPC problem, a policy, learned offline, specifies the sequence of PWA regions that the dynamics must follow, thus reducing the complexity of the remaining optimization problem that solves over only the continuous states and control inputs. We provide a condition, verifiable during learning, that guarantees feasibility of the learned policy's output, such that an optimal continuous control input can always be found online. Furthermore, a method for iteratively generating training data offline allows the feasible policy to be learned efficiently, reducing the offline computational burden. A numerical experiment demonstrates the effectiveness of the method compared to both online and explicit MPC., Comment: 6 pages, 3 figures, submitted to ECC 2025.Code available at https://github.com/SamuelMallick/supervised-learning-pwa-mpc

The recently launched James Webb Space Telescope (JWST) is opening new observing windows on the distant universe. Among JWST's instruments, the Mid Infrared Instrument (MIRI) offers the unique capability of imaging observations at wavelengths $\lambda > 5\mu$m. This enables unique access to the rest frame near infra-red (NIR, $\lambda \ge 1$\mum) emission from galaxies at redshifts $z>4$ and the visual ($\lambda \gtrsim 5000$\AA) rest frame for $z>9$. We here report on the guaranteed time observations (GTO) from the MIRI European Consortium, of the Hubble Ultra Deep Field (HUDF), forming the MIRI Deep Imaging Survey (MIDIS), consisting of an on source integration time of $\sim41$ hours in the MIRI/F560W (5.6 $\mu$m) filter. To our knowledge, this constitutes the longest single filter exposure obtained with JWST of an extragalactic field as yet., Comment: submitted to A&A on July 30, 2024

Highly textured chalcogenide films have recently gained significant interest for phase-change memory applications. Several reports have highlighted that programming efficiency improves in devices featuring superlattice stacks, such as Ge2Sb2Te5/Sb2Te3. However, to be technologically relevant, these films must be deposited on foundry-scale wafers using processes compatible with back end of the line (BEOL) integration and complementary metal-oxide-semiconductor (CMOS) technology, such as, for example, sputter deposition. In this work, we present our observations on the influence of temperature, pressure, and seeding layer parameters on the sputter growth processes of superlattice films. By measuring various material properties, we construct a pseudo-phase diagram to illustrate the growth of both individual and superlattice films with different periodicities on technologically relevant substrates, namely SiO2 and carbon. These results provide important insights into the structure, intermixing and electro-optical properties of superlattice films

Spintronics is concerned with replacing charge current with current of spin, the electron's intrinsic angular momentum. In magnetic insulators, spin currents are carried by magnons, the quanta of spin-wave excitations on top of the magnetically ordered state. Magnon spin currents are especially promising for information technology due to their low intrinsic damping, non-reciprocal transport, micrometer wavelengths at microwave frequencies, and strong interactions that enable signal transduction. In this perspective, we give our view on the progress and challenges towards realizing magnon spintronics based on atomically thin Van der Waals magnets, a recently discovered class of magnetic materials of which the tunability and versatility has attracted a great deal of ongoing research., Comment: 10 pages

This paper presents the spherical lower dimensional representation for daily medium voltage load profiles, based on principal component analysis. The objective is to unify and simplify the tasks for (i) clustering visualisation, (ii) outlier detection and (iii) generative profile modelling under one concept. The lower dimensional projection of standardised load profiles unveils a latent distribution in a three-dimensional sphere. This spherical structure allows us to detect outliers by fitting probability distribution models in the spherical coordinate system, identifying measurements that deviate from the spherical shape. The same latent distribution exhibits an arc shape, suggesting an underlying order among load profiles. We develop a principal curve technique to uncover this order based on similarity, offering new advantages over conventional clustering techniques. This finding reveals that energy consumption in a wide region can be seen as a continuously changing process. Furthermore, we combined the principal curve with a von Mises-Fisher distribution to create a model capable of generating profiles with continuous mixtures between clusters. The presence of the spherical distribution is validated with data from four municipalities in the Netherlands. The uncovered spherical structure implies the possibility of employing new mathematical tools from directional statistics and differential geometry for load profile modelling.

This paper introduces the concept of abstracted model reduction: a framework to improve the tractability of structure-preserving methods for the complexity reduction of interconnected system models. To effectively reduce high-order, interconnected models, it is usually not sufficient to consider the subsystems separately. Instead, structure-preserving reduction methods should be employed, which consider the interconnected dynamics to select which subsystem dynamics to retain in reduction. However, structure-preserving methods are often not computationally tractable. To overcome this issue, we propose to connect each subsystem model to a low-order abstraction of its environment to reduce it both effectively and efficiently. By means of a high-fidelity structural-dynamics model from the lithography industry, we show, on the one hand, significantly increased accuracy with respect to standard subsystem reduction and, on the other hand, similar accuracy to direct application of expensive structure-preserving methods, while significantly reducing computational cost. Furthermore, we formulate a systematic approach to automatically determine sufficient abstraction and reduction orders to preserve stability and guarantee a given frequency-dependent error specification. We apply this approach to the lithography equipment use case and show that the environment model can indeed be reduced by over 80\% without significant loss in the accuracy of the reduced interconnected model., Comment: 16 pages, 13 figures, to appear in IEEE Transactions on Control Systems Technology

As Bitcoin experiences more halving events, the protocol reward converges to zero, making transaction fees the primary source of miner rewards. This shift in Bitcoin's incentivization mechanism, which introduces volatility into block rewards, could lead to the emergence of new security threats or intensify existing ones. Previous security analyses of Bitcoin have either considered a fixed block reward model or a highly simplified volatile model, overlooking the complexities of Bitcoin's mempool behavior. In this paper, we present a reinforcement learning-based tool designed to analyze mining strategies under a more realistic volatile model. Our tool uses the Asynchronous Advantage Actor-Critic (A3C) algorithm to derive near-optimal mining strategies while interacting with an environment that models the complexity of the Bitcoin mempool. This tool enables the analysis of adversarial mining strategies, such as selfish mining and undercutting, both before and after difficulty adjustments, providing insights into the effects of mining attacks in both the short and long term. Our analysis reveals that Bitcoin users' trend of offering higher fees to speed up the inclusion of their transactions in the chain can incentivize payoff-maximizing miners to deviate from the honest strategy. In the fixed reward model, a disincentive for the selfish mining attack is the initial loss period of at least two weeks, during which the attack is not profitable. However, our analysis shows that once the protocol reward diminishes to zero in the future, or even currently on days when transaction fees are comparable to the protocol reward, mining pools might be incentivized to abandon honest mining to gain an immediate profit.

By means of two-dimensional general relativistic resistive magnetohydrodynamic simulations, we investigate the properties of the sheath separating the black hole jet from the surrounding medium. We find that the electromagnetic power flowing through the jet sheath is comparable to the overall accretion power, and is an important site of energy dissipation as revealed by the copious appearance of reconnection layers and plasmoid chains: $\sim20\%$ of the radially flowing electromagnetic power is found to be dissipated between 2 and 10 $R_{\rm g}$. The plasma in these dissipation regions moves along a nearly paraboloidal surface with trans-relativistic bulk motions dominated by the radial component, whose dimensionless 4-velocity is $\sim1.2\pm0.5$. In the frame moving with the mean (radially-dependent) velocity, the distribution of stochastic bulk motions resembles a Maxwellian with an `effective bulk temperature' of $\sim$100 keV. Scaling the global simulation to Cygnus X-1 parameters gives a rough estimate of the Thomson optical depth across the jet sheath $\sim0.01-0.1$, and it may increase in future magnetohydrodynamic simulations with self-consistent radiative losses. These properties suggest that the dissipative jet sheath may be a viable `coronal' region, capable of upscattering seed thermal X-ray photons ($\sim$1 keV) into a hard, nonthermal tail, as seen during the hard states of X-ray binaries and active galactic nuclei., Comment: 19 pages, 14 figures. Submitted for publication in the ApJ, comments welcome

The Event Horizon Telescope Collaboration (EHTC) observed the Galactic centre source Sgr A* and used emission models primarily based on single ion temperature (1T) general relativistic magnetohydrodynamic (GRMHD) simulations. This predicted emission is strongly dependent on a modelled prescription of the ion-to-electron temperature ratio. The two most promising models are magnetically arrested disk (MAD) states. However, these and nearly all MAD models exhibit greater light-curve variability at 230 GHz compared to historical observations. Moreover, no model successfully passes all the variability and multiwavelength constraints. This limitation possibly stems from the fact that the actual temperature ratio depends on microphysical dissipation, radiative processes and other effects not captured in ideal fluid simulations. Therefore, we investigate the effects of two-temperature (2T) thermodynamics in MAD GRMHD simulations of Sgr A*, where the temperatures of both species are evolved more self-consistently. We include Coulomb coupling, radiative cooling of electrons, and model heating via magnetic reconnection. We find that the light-curve variability more closely matches historical observations when we include the 2T treatment and variable adiabatic indices, compared to 1T simulations. Contrary to the common assumption of neglecting radiative cooling for the low accretion rates of Sgr A*, we also find that radiative cooling still affects the accretion flow, reducing the electron temperature in the inner disk by about 10%, which in turn lowers both the average flux and variability at 230 GHz by roughly 10%.

Inspired by animal navigation strategies, we introduce a novel computational model to navigate and map a space rooted in biologically inspired principles. Animals exhibit extraordinary navigation prowess, harnessing memory, imagination, and strategic decision-making to traverse complex and aliased environments adeptly. Our model aims to replicate these capabilities by incorporating a dynamically expanding cognitive map over predicted poses within an Active Inference framework, enhancing our agent's generative model plasticity to novelty and environmental changes. Through structure learning and active inference navigation, our model demonstrates efficient exploration and exploitation, dynamically expanding its model capacity in response to anticipated novel un-visited locations and updating the map given new evidence contradicting previous beliefs. Comparative analyses in mini-grid environments with the Clone-Structured Cognitive Graph model (CSCG), which shares similar objectives, highlight our model's ability to rapidly learn environmental structures within a single episode, with minimal navigation overlap. Our model achieves this without prior knowledge of observation and world dimensions, underscoring its robustness and efficacy in navigating intricate environments., Comment: under submission at Frontiers Computer Neuroscience

We consider goal-oriented optimal design of experiments for infinite-dimensional Bayesian linear inverse problems governed by partial differential equations (PDEs). Specifically, we seek sensor placements that minimize the posterior variance of a prediction or goal quantity of interest. The goal quantity is assumed to be a nonlinear functional of the inversion parameter. We propose a goal-oriented optimal experimental design (OED) approach that uses a quadratic approximation of the goal-functional to define a goal-oriented design criterion. The proposed criterion, which we call the Gq-optimality criterion, is obtained by integrating the posterior variance of the quadratic approximation over the set of likely data. Under the assumption of Gaussian prior and noise models, we derive a closed-form expression for this criterion. To guide development of discretization invariant computational methods, the derivations are performed in an infinite-dimensional Hilbert space setting. Subsequently, we propose efficient and accurate computational methods for computing the Gq-optimality criterion. A greedy approach is used to obtain Gq-optimal sensor placements. We illustrate the proposed approach for two model inverse problems governed by PDEs. Our numerical results demonstrate the effectiveness of the proposed strategy. In particular, the proposed approach outperforms non-goal-oriented (A-optimal) and linearization-based (c-optimal) approaches., Comment: 26 pages

The effective visualization of genomic data is crucial for exploring and interpreting complex relationships within and across genes and genomes. Despite advances in developing dedicated bioinformatics software, common visualization tools often fail to efficiently integrate the diverse datasets produced in comparative genomics, lack intuitive interfaces to construct complex plots and are missing functionalities to inspect the underlying data iteratively and at scale. Here, we introduce gggenomes, a versatile R package designed to overcome these challenges by extending the widely used ggplot2 framework for comparative genomics. gggenomes is available from CRAN and GitHub, accompanied by detailed and user-friendly documentation (https://thackl.github.io/gggenomes)., Comment: TH and MA contributed equally to this work. Corresponding author: Thomas Hackl

Polarons can naturally form in materials from the interaction of extra charge carriers with the atomic lattice. Ubiquitous, they are central to various topics and phenomena such as high-T$_c$ superconductivity, electrochromism, photovoltaics, photocatalysis or ion batteries. However, polaron formation remains poorly understood and mostly relies on few historical models such as Landau-Pekar, Fr\"olich, Holstein or Jahn-Teller polarons. Here, from advanced first-principles calculations, we show that the formation of intriguing medium-size polarons in WO$_3$ does not fit with traditional models but instead arises from the undoing of distortive atomic motions inherent to the pristine phase, which lowers the bandgap through dynamical covalency effects. We so introduce the innovative concept of {\it anti-distortive} polaron and rationalize it from a quantum-dot model. We demonstrate that anti-distortive polarons are generic to different families of compounds and clarify how this new concept opens concrete perspectives for a better control of the polaronic state and related properties., Comment: 9 pages, 2 figures

Nature-inspired computation is receiving increasing attention. Various Ising machine implementations have recently been proven to be effective in solving numerous combinatorial optimization problems including maximum cut, low density parity check (LDPC) decoding, and Boolean satisfiability (SAT) problems. In this paper, a novel method is presented to solve SAT or MAX-SAT problems with a CMOS circuit implementation. The technique solves a SAT problem by mapping the SAT variables onto quantized capacitor voltages generated by an array of nodes that interact through a network of coupling units. The nodal interaction is achieved through coupling currents produced by the coupling units, which charge or discharge capacitor voltages, implementing a gradient descent along the SAT problem's cost function to minimize the number of unsatisfied clauses. The system also incorporates a unique low-complexity perturbation scheme to avoid settling in local minima, greatly enhancing the performance of the system. The simulation results demonstrate that the proposed SKI-SAT is a high-performance and low-energy alternative that surpasses existing solvers by significant margins, achieving more than 10 times faster solution and 300 times less power., Comment: 10 pages, 10 figures, 2 tables

We propose novel numerical schemes based on the Boris method in curved spacetime, incorporating both hadronic and radiative interactions for the first time. Once the proton has lost significant energy due to radiative and hadronic losses, and its gyroradius has decreased below typical scales on which the electromagnetic field varies, we apply a guiding center approximation (GCA). We fundamentally simulate collision processes either with a Monte-Carlo method or, where applicable, as a continuous energy loss, contingent on the local optical depth. To test our algorithm for the first time combining the effects of electromagnetic, gravitational, and radiation fields including hadronic interactions, we simulate highly relativistic protons traveling through various electromagnetic fields and proton backgrounds. We provide unit tests in various spatially dependent electromagnetic and gravitational fields and background photon and proton distributions, comparing the trajectory against analytic results. We propose that our method can be used to analyze hadronic interactions in black hole accretion disks, jets, and coronae to study the neutrino abundance from active galactic nuclei., Comment: 15 pages, 9 figures, submitted to Physical Review D

The cost of stochastic resetting is considered within the context of a discrete random walk model. In addition to standard stochastic resetting, for which a reset occurs with a certain probability after \emph{each} step, we introduce a novel resetting protocol which we dubbed {\it dynamic resetting}. This protocol entails an additional dynamic constraint related to the direction of successive steps of the random walker. We study this novel protocol for a one-dimensional random walker on an infinite lattice. We analyze the impact of the constraint on the walker's mean-first passage time and the cost (fluctuations) of the resets as a function of distance of target from the resetting location. Further, cost optimized search strategies are discussed., Comment: 21 pages, 15 figures

4G and 5G represent the current cellular communication standards utilized daily by billions of users for various applications. Consequently, ensuring the security of 4G and 5G network implementations is critically important. This paper introduces an automated fuzzing framework designed to test the security of 4G and 5G attach procedure implementations. Our framework provides a comprehensive solution for uplink and downlink fuzzing in 4G, as well as downlink fuzzing in 5G, while supporting fuzzing on all layers except the physical layer. To guide the fuzzing process, we introduce a novel algorithm that assigns probabilities to packet fields and adjusts these probabilities based on coverage information from the device-under-test (DUT). For cases where coverage information from the DUT is unavailable, we propose a novel methodology to estimate it. When evaluating our framework, we first run the random fuzzing experiments, where the mutation probabilities are fixed throughout the fuzzing, and give an insight into how those probabilities should be chosen to optimize the Random fuzzer to achieve the best coverage. Next, we evaluate the efficiency of the proposed coverage-based algorithms by fuzzing open-source 4G stack (srsRAN) instances and show that the fuzzer guided by our algorithm outperforms the optimized Random fuzzer in terms of DUT's code coverage. In addition, we run fuzzing tests on 12 commercial off-the-shelf (COTS) devices. In total, we discovered vulnerabilities in 10 COTS devices and all of the srsRAN 4G instances.

We introduce a universal framework for boundary transfer matrices, inspired by Sklyanin's two-row transfer matrix approach for quantum integrable systems with boundary conditions. The main examples arise from quantum symmetric pairs of finite and affine type. As a special case we recover a construction by Kolb in finite type. We review recent work on universal solutions to the reflection equation and highlight several open problems in this field., Comment: 30 pages

Abstract Recent advances in immunology and synthetic biology have accelerated the development of deep generative methods for DNA sequence design. Two dominant approaches in this field are AutoRegressive (AR) models and Diffusion Models (DMs). However, genomic sequences are functionally heterogeneous, consisting of multiple connected regions (e.g., Promoter Regions, Exons, and Introns) where elements within each region come from the same probability distribution, but the overall sequence is non-homogeneous. This heterogeneous nature presents challenges for a single model to accurately generate genomic sequences. In this paper, we analyze the properties of AR models and DMs in heterogeneous genomic sequence generation, pointing out crucial limitations in both methods: (i) AR models capture the underlying distribution of data by factorizing and learning the transition probability but fail to capture the global property of DNA sequences. (ii) DMs learn to recover the global distribution but tend to produce errors at the base pair level. To overcome the limitations of both approaches, we propose a post-training sampling method, termed Absorb & Escape (A&E) to perform compositional generation from AR models and DMs. This approach starts with samples generated by DMs and refines the sample quality using an AR model through the alternation of the Absorb and Escape steps. To assess the quality of generated sequences, we conduct extensive experiments on 15 species for conditional and unconditional DNA generation. The experiment results from motif distribution, diversity checks, and genome integration tests unequivocally show that A&E outperforms state-of-the-art AR models and DMs in genomic sequence generation., Comment: Accepted at NeurIPS 2024

The spatial distribution of spurious dots in SiMOS single-electron transistors (SETs), fabricated on an industrial 300 mm process line, has been statistically analyzed. To have a deeper understanding of the origin of these spurious dots, we analyzed SETs with three different oxide thicknesses: 8 nm, 12 nm and 20 nm. By combining spurious dot triangulation cryo-measurement with simulations of strain, gate bias, and location of the electron wave function, we demonstrate that most spurious dots are formed through the combined effects of strain and gate bias, leading to variations in the conduction band energy. Despite the similar thermal expansion coefficients of polycrystalline silicon gates and single-crystalline silicon substrates, strain remains a crucial factor in spurious dots formation. This learning can be use to optimize the device design and the oxide thickness, to reduce the density of spurious dot while keeping quantum dot tunability., Comment: 10 pages, 9 figures

The origin of nonthermal broadening in solar spectra is one of the long-standing questions in solar physics. Various processes have been invoked - including unresolved flows, waves, and turbulent processes - but definitive answers are lacking. To investigate the physical processes responsible for nonthermal broadening, we examine its relation with the angle between the magnetic field and the line of sight in three different closed-field regions above plage regions at different locations on the solar disk. We obtained the nonthermal width of transition-region Si IV 1403 {\AA} spectra observed in active regions by the Interface Region Imaging Spectrograph, after subtraction of the thermal and instrumental line broadening. To investigate the dependence of the measured broadening on the viewing angle between the line of sight and magnetic field direction, we determined the magnetic field direction at transition-region heights using nonlinear force-free extrapolations based on the observed photospheric vector magnetic field taken by the Helioseismic and Magnetic Imager on board the Solar Dynamics Observatory. We found that the nonthermal broadening shows a correlation with downward motion (redshifts)and alignment between the magnetic field and the observer's line-of-sight direction. Based on the observed correlations, we suggest that velocity gradients within plasma flowing down along the magnetic field may lead to a significant portion of the observed nonthermal broadening of transition-region spectral lines in closed fields above plage regions., Comment: 11 pages, 8 figures

PieceWise Affine (PWA) approximations for nonlinear functions have been extensively used for tractable, computationally efficient control of nonlinear systems. However, reaching a desired approximation accuracy without prior information about the behavior of the nonlinear systems remains a challenge in the function approximation and control literature. As the name suggests, PWA approximation aims at approximating a nonlinear function or system by dividing the domain into multiple subregions where the nonlinear function or dynamics is approximated locally by an affine function also called local mode. Without prior knowledge of the form of the nonlinearity, the required number of modes, the locations of the subregions, and the local approximations need to be optimized simultaneously, which becomes highly complex for large-scale systems with multi-dimensional nonlinear functions. This paper introduces a novel approach for PWA approximation of multi-dimensional nonlinear systems, utilizing a hinging hyperplane formalism for cut-based partitioning of the domain. The complexity of the PWA approximation is iteratively increased until reaching the desired accuracy level. Further, the tractable cut definitions allow for different forms of subregions, as well as the ability to impose continuity constraints on the PWA approximation. The methodology is explained via multiple examples and its performance is compared to two existing approaches through case studies, showcasing its efficacy., Comment: 9 pages, 4 figures, submitted to journal

Fabrication of quantum processors in advanced 300 mm wafer-scale complementary metal-oxide-semiconductor (CMOS) foundries provides a unique scaling pathway towards commercially viable quantum computing with potentially millions of qubits on a single chip. Here, we show precise qubit operation of a silicon two-qubit device made in a 300 mm semiconductor processing line. The key metrics including single- and two-qubit control fidelities exceed 99% and state preparation and measurement fidelity exceeds 99.9%, as evidenced by gate set tomography (GST). We report coherence and lifetimes up to $T_\mathrm{2}^{\mathrm{*}} = 30.4$ $\mu$s, $T_\mathrm{2}^{\mathrm{Hahn}} = 803$ $\mu$s, and $T_1 = 6.3$ s. Crucially, the dominant operational errors originate from residual nuclear spin carrying isotopes, solvable with further isotopic purification, rather than charge noise arising from the dielectric environment. Our results answer the longstanding question whether the favourable properties including high-fidelity operation and long coherence times can be preserved when transitioning from a tailored academic to an industrial semiconductor fabrication technology., Comment: 10 pages, 4 figures, 4 extended data figures

We establish a connection between distributionally robust optimization (DRO) and classical robust statistics. We demonstrate that this connection arises naturally in the context of estimation under data corruption, where the goal is to construct ``minimal'' confidence sets for the unknown data-generating distribution. Specifically, we show that a DRO ambiguity set, based on the Kullback-Leibler divergence and total variation distance, is uniformly minimal, meaning it represents the smallest confidence set that contains the unknown distribution with at a given confidence power. Moreover, we prove that when parametric assumptions are imposed on the unknown distribution, the ambiguity set is never larger than a confidence set based on the optimal estimator proposed by Huber. This insight reveals that the commonly observed conservatism of DRO formulations is not intrinsic to these formulations themselves but rather stems from the non-parametric framework in which these formulations are employed.

The integration of autonomous vehicles (AVs) into transportation systems presents an unprecedented opportunity to enhance road safety and efficiency. However, understanding the interactions between AVs and human-driven vehicles (HVs) at intersections remains an open research question. This study aims to bridge this gap by examining behavioral differences and adaptations of AVs and HVs at unsignalized intersections by utilizing two comprehensive AV datasets from Waymo and Lyft. Using a systematic methodology, the research identifies and analyzes merging and crossing conflicts by calculating key safety and efficiency metrics, including time to collision (TTC), post-encroachment time (PET), maximum required deceleration (MRD), time advantage (TA), and speed and acceleration profiles. The findings reveal a paradox in mixed traffic flow: while AVs maintain larger safety margins, their conservative behavior can lead to unexpected situations for human drivers, potentially causing unsafe conditions. From a performance point of view, human drivers exhibit more consistent behavior when interacting with AVs versus other HVs, suggesting AVs may contribute to harmonizing traffic flow patterns. Moreover, notable differences were observed between Waymo and Lyft vehicles, which highlights the importance of considering manufacturer-specific AV behaviors in traffic modeling and management strategies for the safe integration of AVs. The processed dataset utilized in this study is openly published to foster the research on AV-HV interactions., Comment: This work has been submitted to Transportation Research Record for potential publication

This paper proposes improvements over earlier work by Nazareth and Blei (2022) for estimating the depth of Bayesian neural networks. Here, we propose a discrete truncated normal distribution over the network depth to independently learn its mean and variance. Posterior distributions are inferred by minimizing the variational free energy, which balances the model complexity and accuracy. Our method improves test accuracy on the spiral data set and reduces the variance in posterior depth estimates., Comment: NeurIPS 2024 Workshop on Bayesian Decision-making and Uncertainty. Available at https://openreview.net/forum?id=6TLRVdWGzI

Supermassive binary black holes in galactic centers are potential multimessenger sources in gravitational waves and electromagnetic radiation. To find such objects, isolating unique electromagnetic signatures of their accretion flow is key. With the aid of three-dimensional general-relativistic magnetohydrodynamic (GRMHD) simulations that utilize an approximate, semi-analytic, super-imposed spacetime metric, we identify two such signatures for merging binaries. Both involve magnetic reconnection and are analogous to plasma processes observed in the solar corona. The first, like colliding flux tubes that can cause solar flares, involves colliding jets that form an extended reconnection layer, dissipating magnetic energy and causing the two jets to merge. The second, akin to coronal mass ejection events, involves the accretion of magnetic field lines onto both black holes; these magnetic fields then twist, inflate, and form a trailing current sheet, ultimately reconnecting and driving a hot outflow. We provide estimates for the associated electromagnetic emission for both processes, showing that they likely accelerate electrons to high energies and are promising candidates for continuous, stochastic, and/or quasi-periodic higher energy electromagnetic emission. We also show that the accretion flows around each black hole can display features associated with the magnetically arrested state. However, simulations with black hole spins misaligned with the orbital plane and simulations with larger Bondi radii saturate at lower values of horizon-penetrating magnetic flux than standard magnetically arrested disks, leading to weaker, intermittent jets due to feedback from the weak jets or equatorial flux tubes ejected by reconnecting field lines near the horizon., Comment: 21 pages, 8 Figures, Submitted to ApJL. Animations available at https://www.youtube.com/playlist?list=PL3pLmTeUPcqThCLYhkSrkEBOUutrnSJWq

Probabilistic puzzles can be confusing, partly because they are formulated in natural languages - full of unclarities and ambiguities - and partly because there is no widely accepted and intuitive formal language to express them. We propose a simple formal language with arrow notation ($\gets$) for sampling from a distribution and with observe statements for conditioning (updating, belief revision). We demonstrate the usefulness of this simple language by solving several famous puzzles from probabilistic decision theory. The operational semantics of our language is expressed via the (finite, discrete) subdistribution monad. Our broader message is that proper formalisation dispels confusion., Comment: 40 pages, 15 figures

The first very long baseline interferometry (VLBI) detections at 870$\mu$m wavelength (345$\,$GHz frequency) are reported, achieving the highest diffraction-limited angular resolution yet obtained from the surface of the Earth, and the highest-frequency example of the VLBI technique to date. These include strong detections for multiple sources observed on inter-continental baselines between telescopes in Chile, Hawaii, and Spain, obtained during observations in October 2018. The longest-baseline detections approach 11$\,$G$\lambda$ corresponding to an angular resolution, or fringe spacing, of 19$\mu$as. The Allan deviation of the visibility phase at 870$\mu$m is comparable to that at 1.3$\,$mm on the relevant integration time scales between 2 and 100$\,$s. The detections confirm that the sensitivity and signal chain stability of stations in the Event Horizon Telescope (EHT) array are suitable for VLBI observations at 870$\mu$m. Operation at this short wavelength, combined with anticipated enhancements of the EHT, will lead to a unique high angular resolution instrument for black hole studies, capable of resolving the event horizons of supermassive black holes in both space and time., Comment: Corresponding author: S. Doeleman

Skeleton-based Temporal Action Segmentation involves the dense action classification of variable-length skeleton sequences. Current approaches primarily apply graph-based networks to extract framewise, whole-body-level motion representations, and use one-hot encoded labels for model optimization. However, whole-body motion representations do not capture fine-grained part-level motion representations and the one-hot encoded labels neglect the intrinsic semantic relationships within the language-based action definitions. To address these limitations, we propose a novel method named Language-assisted Human Part Motion Representation Learning (LPL), which contains a Disentangled Part Motion Encoder (DPE) to extract dual-level (i.e., part and whole-body) motion representations and a Language-assisted Distribution Alignment (LDA) strategy for optimizing spatial relations within representations. Specifically, after part-aware skeleton encoding via DPE, LDA generates dual-level action descriptions to construct a textual embedding space with the help of a large-scale language model. Then, LDA motivates the alignment of the embedding space between text descriptions and motions. This alignment allows LDA not only to enhance intra-class compactness but also to transfer the language-encoded semantic correlations among actions to skeleton-based motion learning. Moreover, we propose a simple yet efficient Semantic Offset Adapter to smooth the cross-domain misalignment. Our experiments indicate that LPL achieves state-of-the-art performance across various datasets (e.g., +4.4\% Accuracy, +5.6\% F1 on the PKU-MMD dataset). Moreover, LDA is compatible with existing methods and improves their performance (e.g., +4.8\% Accuracy, +4.3\% F1 on the LARa dataset) without additional inference costs., Comment: This work has been submitted to the IEEE for possible publication

Controlling greenhouse crop production systems is a complex task due to uncertain and non-linear dynamics between crops, indoor and outdoor climate, and economics. The declining number of skilled growers necessitates the development of autonomous greenhouse control systems. Reinforcement Learning (RL) is a promising approach that can learn a control policy to automate greenhouse management. RL optimises a control policy through interactions with a model of the greenhouse while guided by an economic-based reward function. However, its application to real-world systems is limited due to discrepancies between models and real-world dynamics. Moreover, RL controllers may struggle to maintain state constraints while optimising the primary objective, especially when models inadequately capture the adverse effects of constraint violations on crop growth. Also, the generalisation to novel states, for example, due to unseen weather trajectories, is underexplored in RL-based greenhouse control. This work addresses these challenges through three key contributions. First, we present GreenLight-Gym, the first open-source environment designed for training and evaluating RL algorithms on the state-of-the-art greenhouse model GreenLight. GreenLight-Gym enables the community to benchmark RL-based control methodologies. Second, we compare two reward-shaping approaches, using either a multiplicative or additive penalty, to enforce state boundaries. The additive penalty achieves more stable training while better adhering to state constraints, while the multiplicative penalty yields marginally higher profits. Finally, we evaluate RL performance on a disjoint training and testing weather dataset, demonstrating improved generalisation to unseen conditions. Our environment and experiment scripts are open-sourced, facilitating innovative research on learning-based greenhouse control.

We present the ELAS simulator, a discrete event simulator built for the Eurotransplant (ET) Liver Allocation System (ELAS). Eurotransplant uses ELAS to allocate deceased donor livers in eight European countries. The simulator is made publicly available to be transparent on which model Eurotransplant uses to evaluate liver allocation policies, and to facilitate collaborations with policymakers, scientists and other stakeholders in evaluating alternative liver allocation policies. This paper describes the design and modules of the ELAS simulator. One of the included modules is the obligation module, which is instrumental in ensuring that international cooperation in liver allocation benefits all ET member countries. By default, the ELAS simulator simulates liver allocation according to the actual ET allocation rules. Stochastic processes, such as graft offer acceptance behavior and listing for a repeat transplantation, are approximated with statistical models which were calibrated to data from the ET registry. We validate the ELAS simulator by comparing simulated waitlist outcomes to historically observed waitlist outcomes between 2016 and 2019. The modular design of the ELAS simulator gives end users maximal control over the rules and assumptions under which ET liver allocation is simulated, which makes the simulator useful for policy evaluation. We illustrate this with two clinically motivated case studies, for which we collaborated with hepatologists and transplantation surgeons from two liver advisory committees affiliated with Eurotransplant., Comment: 34 pages, 3 figures

The Core Data Ontology (CDO) and the Informatics Domain Model represent a transformative approach to computational systems, shifting from traditional node-centric designs to a data-centric paradigm. This paper introduces a framework where data is categorized into four modalities: objects, events, concepts, and actions. This quadrimodal structure enhances data security, semantic interoperability, and scalability across distributed data ecosystems. The CDO offers a comprehensive ontology that supports AI development, role-based access control, and multimodal data management. By focusing on the intrinsic value of data, the Informatics Domain Model redefines system architectures to prioritize data security, provenance, and auditability, addressing vulnerabilities in current models. The paper outlines the methodology for developing the CDO, explores its practical applications in fields such as AI, robotics, and legal compliance, and discusses future directions for scalable, decentralized, and interoperable data ecosystems., Comment: Proceedings of the 9th International Conference on Data Mining & Knowledge Management (DaKM 2024)

In the past decade, chiral materials have drawn significant attention because it is widely claimed that they can act as spin injectors/detectors due to the chirality-induced spin selectivity (CISS) effect. Nevertheless, the microscopic origin of this effect is not understood, and there is an intensive discussion about the manifestation of the magnetoresistance that is generated between a chiral system and a ferromagnet. Hanle spin precession measurements can unambiguously prove the injection and detection of a spin accumulation in a non-magnetic material, as was shown with traditional ferromagnetic injectors/detectors. Here, we analyze in detail the Hanle spin precession induced magnetoresistance and find that it is inverted as compared to the ferromagnetic case. We explicitly model the spin injection and detection by both a chiral system and a ferromagnetic system, as well as the spin transport in a semiconductor, for a general set of (spin) transport parameters that cover the relevant experimental regime. For all sets of parameters, we find that the Hanle signals for a chiral system and ferromagnet are each others opposites.

We introduce VascX models, a comprehensive set of model ensembles for analyzing retinal vasculature from color fundus images (CFIs). Annotated CFIs were aggregated from public datasets . Additional CFIs, mainly from the population-based Rotterdam Study were annotated by graders for arteries and veins at pixel level, resulting in a dataset diverse in patient demographics and imaging conditions. VascX models demonstrated superior segmentation performance across datasets, image quality levels, and anatomic regions when compared to existing, publicly available models, likely due to the increased size and variety of our training set. Important improvements were observed in artery-vein and disc segmentation performance, particularly in segmentations of these structures on CFIs of intermediate quality, common in large cohorts and clinical datasets. Importantly, these improvements translated into significantly more accurate vascular features when we compared features extracted from VascX segmentation masks with features extracted from segmentation masks generated by previous models. With VascX models we provide a robust, ready-to-use set of model ensembles and inference code aimed at simplifying the implementation and enhancing the quality of automated retinal vasculature analyses. The precise vessel parameters generated by the model can serve as starting points for the identification of disease patterns in and outside of the eye.