Search

We construct a Hunt process that can be described as an isotropic $\alpha$-stable L\'evy process reflected from the complement of a bounded open Lipschitz set. In fact, we introduce a new analytic method for concatenating Markov processes. It is based on nonlocal Schr\"odinger perturbations of sub-Markovian transition kernels and the construction of two supermedian functions with different growth rates at infinity. We apply this framework to describe the return distribution and the stationary distribution of the process. To handle the strong Markov property at the reflection time, we introduce a novel ladder process, whose transition semigroup encodes not only the position of the process, but also the number of reflections., Comment: 21 pages, no figures

We present a generative AI algorithm for addressing the challenging task of fast, accurate and robust statistical computation of three-dimensional turbulent fluid flows. Our algorithm, termed as GenCFD, is based on a conditional score-based diffusion model. Through extensive numerical experimentation with both incompressible and compressible fluid flows, we demonstrate that GenCFD provides very accurate approximation of statistical quantities of interest such as mean, variance, point pdfs, higher-order moments, while also generating high quality realistic samples of turbulent fluid flows and ensuring excellent spectral resolution. In contrast, ensembles of operator learning baselines which are trained to minimize mean (absolute) square errors regress to the mean flow. We present rigorous theoretical results uncovering the surprising mechanisms through which diffusion models accurately generate fluid flows. These mechanisms are illustrated with solvable toy models that exhibit the relevant features of turbulent fluid flows while being amenable to explicit analytical formulas., Comment: 71 pages, 30 figures

In the spirit of the action of the symmetric group on the ring of polynomials in $n$ variables, we consider the actions of the seven frieze groups on rings of formal infinite linear combinations of monomials of restricted degree. For each group we describe the respective subring of invariants. We discuss also the structure of those rings as modules over each frieze group., Comment: 16 pages, 7 figures

Image compression is a critical tool in decreasing the cost of storage and improving the speed of transmission over the internet. While deep learning applications for natural images widely adopts the usage of lossy compression techniques, it is not widespread for 3D medical images. Using three CT datasets (17 tasks) and one MRI dataset (3 tasks) we demonstrate that lossy compression up to 20 times have no negative impact on segmentation quality with deep neural networks (DNN). In addition, we demonstrate the ability of DNN models trained on compressed data to predict on uncompressed data and vice versa with no quality deterioration., Comment: 12 pages, 5 figures, 2 tables; accepted on MICCAI Workshop on Advancing Data Solutions in Medical Imaging AI

In this paper, we record some foundational results on adic geometry that seem to be missing in the existing literature. Namely, we develop the Proj construction and a theory of lci closed immersions in the context of locally noetherian analytic adic spaces. In the context of rigid-analytic spaces, these topics have previously been considered in [GL21] and [Con07]. We also develop an etale six functor formalism in the analytic geometry and give a categorical description of lisse and constructible sheaves. All results of this paper are probably well-known to the experts., Comment: Comments are very welcome. A previous version of the paper appeared before here https://bogdanzavyalov.com/refs/notes/adic_notes.pdf

The extraction of blood vessels has recently experienced a widespread interest in medical image analysis. Automatic vessel segmentation is highly desirable to guide clinicians in computer-assisted diagnosis, therapy or surgical planning. Despite a good ability to extract large anatomical structures, the capacity of U-Net inspired architectures to automatically delineate vascular systems remains a major issue, especially given the scarcity of existing datasets. In this paper, we present a novel approach that integrates into deep segmentation shape priors from a Semi-Overcomplete Convolutional Auto-Encoder (S-OCAE) embedding. Compared to standard Convolutional Auto-Encoders (CAE), it exploits an over-complete branch that projects data onto higher dimensions to better characterize tiny structures. Experiments on retinal and liver vessel extraction, respectively performed on publicly-available DRIVE and 3D-IRCADb datasets, highlight the effectiveness of our method compared to U-Net trained without and with shape priors from a traditional CAE., Comment: 5 pages, 4 figures, conference

The paper addresses task assignment and trajectory generation for collaborative inspection missions using a fleet of multi-rotors, focusing on the wind turbine inspection scenario. The proposed solution enables safe and feasible trajectories while accommodating heterogeneous time-bound constraints and vehicle physical limits. An optimization problem is formulated to meet mission objectives and temporal requirements encoded as Signal Temporal Logic (STL) specifications. Additionally, an event-triggered replanner is introduced to address unforeseen events and compensate for lost time. Furthermore, a generalized robustness scoring method is employed to reflect user preferences and mitigate task conflicts. The effectiveness of the proposed approach is demonstrated through MATLAB and Gazebo simulations, as well as field multi-robot experiments in a mock-up scenario., Comment: This work has been submitted to "Robotics and Autonomous Systems" for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible

The precise delineation of blood vessels in medical images is critical for many clinical applications, including pathology detection and surgical planning. However, fully-automated vascular segmentation is challenging because of the variability in shape, size, and topology. Manual segmentation remains the gold standard but is time-consuming, subjective, and impractical for large-scale studies. Hence, there is a need for automatic and reliable segmentation methods that can accurately detect blood vessels from medical images. The integration of shape and topological priors into vessel segmentation models has been shown to improve segmentation accuracy by offering contextual information about the shape of the blood vessels and their spatial relationships within the vascular tree. To further improve anatomical consistency, we propose a new joint prior encoding mechanism which incorporates both shape and topology in a single latent space. The effectiveness of our method is demonstrated on the publicly available 3D-IRCADb dataset. More globally, the proposed approach holds promise in overcoming the challenges associated with automatic vessel delineation and has the potential to advance the field of deep priors encoding., Comment: 5 pages, 3 figures, conference

Extracting hepatic vessels from abdominal images is of high interest for clinicians since it allows to divide the liver into functionally-independent Couinaud segments. In this respect, an automated liver blood vessel extraction is widely summoned. Despite the significant growth in performance of semantic segmentation methodologies, preserving the complex multi-scale geometry of main vessels and ramifications remains a major challenge. This paper provides a new deep supervised approach for vessel segmentation, with a strong focus on representations arising from the different scales inherent to the vascular tree geometry. In particular, we propose a new clustering technique to decompose the tree into various scale levels, from tiny to large vessels. Then, we extend standard 3D UNet to multi-task learning by incorporating scale-specific auxiliary tasks and contrastive learning to encourage the discrimination between scales in the shared representation. Promising results, depicted in several evaluation metrics, are revealed on the public 3D-IRCADb dataset., Comment: 5 pages, 5 figures, conference

As QKD infrastructure becomes increasingly complex while being developed by different actors (typically national governments), interconnecting them into a federated network of very elaborate sub-networks that maintain a high degree of autonomy will pose unique challenges. We identify several such challenges and propose a 4-step orchestration framework to address them based on centralized research, target network planning, optimal QKD design, and protocol enforcement.

Recent advances in machine learning algorithms have unlocked new insights in observational astronomy by allowing astronomers to probe new frontiers. In this article, we present a methodology to disentangle the intrinsic X-ray spectrum of galaxy clusters from the instrumental response function. Employing state-of-the-art modeling software and data mining techniques of the Chandra data archive, we construct a set of 100,000 mock Chandra spectra. We train a recurrent inference machine (RIM) to take in the instrumental response and mock observation and output the intrinsic X-ray spectrum. The RIM can recover the mock intrinsic spectrum below the 1-$\sigma$ error threshold; moreover, the RIM reconstruction of the mock observations are indistinguishable from the observations themselves. To further test the algorithm, we deconvolve extracted spectra from the central regions of the galaxy group NGC 1550, known to have a rich X-ray spectrum, and the massive galaxy clusters Abell 1795. Despite the RIM reconstructions consistently remaining below the 1-$\sigma$ noise level, the recovered intrinsic spectra did not align with modeled expectations. This discrepancy is likely attributable to the RIM's method of implicitly encoding prior information within the neural network. This approach holds promise for unlocking new possibilities in accurate spectral reconstructions and advancing our understanding of complex X-ray cosmic phenomena., Comment: Submitted to AJ

Nighttime camera-based depth estimation is a highly challenging task, especially for autonomous driving applications, where accurate depth perception is essential for ensuring safe navigation. We aim to improve the reliability of perception systems at night time, where models trained on daytime data often fail in the absence of precise but costly LiDAR sensors. In this work, we introduce Light Enhanced Depth (LED), a novel cost-effective approach that significantly improves depth estimation in low-light environments by harnessing a pattern projected by high definition headlights available in modern vehicles. LED leads to significant performance boosts across multiple depth-estimation architectures (encoder-decoder, Adabins, DepthFormer) both on synthetic and real datasets. Furthermore, increased performances beyond illuminated areas reveal a holistic enhancement in scene understanding. Finally, we release the Nighttime Synthetic Drive Dataset, a new synthetic and photo-realistic nighttime dataset, which comprises 49,990 comprehensively annotated images., Comment: Preprint. Code and dataset available at https://github.com/SimondeMoreau/LED

This paper introduces a new C++/CUDA library for GPU-accelerated stochastic optimization called MPPI-Generic. It provides implementations of Model Predictive Path Integral control, Tube-Model Predictive Path Integral Control, and Robust Model Predictive Path Integral Control, and allows for these algorithms to be used across many pre-existing dynamics models and cost functions. Furthermore, researchers can create their own dynamics models or cost functions following our API definitions without needing to change the actual Model Predictive Path Integral Control code. Finally, we compare computational performance to other popular implementations of Model Predictive Path Integral Control over a variety of GPUs to show the real-time capabilities our library can allow for. Library code can be found at: https://acdslab.github.io/mppi-generic-website/ .

Recent work on dictionary learning with set-atoms has shown benefits in anomaly detection. Instead of viewing an atom as a single vector, these methods allow building sparse representations with atoms taken from a set around a central vector; the set can be a cone or may have a probability distribution associated to it. We propose a method for adaptively adjusting the size of set-atoms in Gaussian and cone dictionary learning. The purpose of the algorithm is to match the atom sizes with their contribution in representing the signals. The proposed algorithm not only decreases the representation error, but also improves anomaly detection, for a class of anomalies called `dependency'. We obtain better detection performance than state-of-the-art methods., Comment: 16 pages, 3 figures

With the emergence of Foundational Machine Learning Interatomic Potential (FMLIP) models trained on extensive datasets, transferring data between different ML architectures has become increasingly important. In this work, we examine the extent to which training data optimised for one machine-learning forcefield algorithm may be re-used to train different models, aiming to accelerate FMLIP fine-tuning and to reduce the need for costly iterative training. As a test case, we train models of an organic liquid mixture that is commonly used as a solvent in rechargeable battery electrolytes, making it an important target for reactive MLIP development. We assess model performance by analysing the properties of molecular dynamics trajectories, showing that this is a more stringent test than comparing prediction errors for fixed datasets. We consider several types of training data, and several popular MLIPs - notably the recent MACE architecture, a message-passing neural network designed for high efficiency and smoothness. We demonstrate that simple training sets constructed without any ab initio dynamics are sufficient to produce stable models of molecular liquids. For simple neural-network architectures, further iterative training is required to capture thermodynamic and kinetic properties correctly, but MACE performs well with extremely limited datsets. We find that configurations designed by human intuition to correct systematic model deficiencies transfer effectively between algorithms, but active-learned data that are generated by one MLIP do not typically benefit a different algorithm. Finally, we show that any training data which improve model performance also improve its ability to generalise to similar unseen molecules. This suggests that trajectory failure modes are connected with chemical structure rather than being entirely system-specific., Comment: 23 pages, 7 figures

We investigate quantum dynamics for an ion confined within an oscillating quadrupole field, starting from two well known and elegant approaches. It is established that the Hamilton equations of motion, in both Schr\"{o}dinger and Heisenberg representations, are equivalent to the Hill equation. One searches for a linear independent solution associated to a harmonic oscillator (HO). An adiabatic invariant, which is also a constant of motion, is introduced based on the Heisenberg representation. Thus, the state of the non-autonomous system can be determined at any subsequent moment of time. The quantum states for trapped ions are demonstrated to be Fock (number) states, while the exact solutions of the Schr\"{o}dinger equation for a trapped ion are exactly the quasienergy states. Semiclassical dynamics is also investigated for many-body systems of trapped ions, where the wavefunction associated to the Schr\"{o}dinger equation is prepared as a Gauss package multiplied by a Hermite polynomial. We also discuss time evolution for the system under investigation and supply the propagator.

This paper describes the 2nd edition of the ICML Topological Deep Learning Challenge that was hosted within the ICML 2024 ELLIS Workshop on Geometry-grounded Representation Learning and Generative Modeling (GRaM). The challenge focused on the problem of representing data in different discrete topological domains in order to bridge the gap between Topological Deep Learning (TDL) and other types of structured datasets (e.g. point clouds, graphs). Specifically, participants were asked to design and implement topological liftings, i.e. mappings between different data structures and topological domains --like hypergraphs, or simplicial/cell/combinatorial complexes. The challenge received 52 submissions satisfying all the requirements. This paper introduces the main scope of the challenge, and summarizes the main results and findings., Comment: Proceedings of the Geometry-grounded Representation Learning and Generative Modeling Workshop (GRaM) at ICML 2024

The ability to accurately discern active massive black holes (BHs) in nearby dwarf galaxies is paramount to understanding the origins and processes of "seed" BHs in the early Universe. We present Chandra X-ray Observatory observations of a sample of three local dwarf galaxies (M$_{*}$ $\leqslant 3 \times 10^{9}$ M$_\odot$, z $\leqslant$ 0.15) previously identified as candidates for hosting active galactic nuclei (AGN). The galaxies were selected from the NASA-Sloan Atlas (NSA) with spatially coincident X-ray detections in the eROSITA Final Equatorial Depth Survey (eFEDS). Our new Chandra data reveal three X-ray point sources in two of the target galaxies with luminosities between log(L$_{\rm \text{2-10 keV}}$ [erg s$^{-1}$]) = 39.1 and 40.4. Our results support the presence of an AGN in these two galaxies and a ULX in one of them. For the AGNs, we estimate BH masses of $M_{\rm BH} \sim 10^{5-6} M_\odot$ and Eddington ratios on the order of $\sim 10^{-3}$., Comment: Accepted for publication in The Astrophysical Journal. 7 pages

Motivated by the spectral theory of relativistic atoms, we prove matching upper and lower bounds for the transition density of Hardy perturbations of subordinated Bessel heat kernels. The analysis is based on suitable supermedian functions, in particular invariant functions., Comment: 59 pages

Respiratory diseases impose a significant burden on global health, with current diagnostic and management practices primarily reliant on specialist clinical testing. This work aims to develop machine learning-based algorithms to facilitate at-home respiratory disease monitoring and assessment for patients undergoing continuous positive airway pressure (CPAP) therapy. Data were collected from 30 healthy adults, encompassing respiratory pressure, flow, and dynamic thoraco-abdominal circumferential measurements under three breathing conditions: normal, panting, and deep breathing. Various machine learning models, including the random forest classifier, logistic regression, and support vector machine (SVM), were trained to predict breathing types. The random forest classifier demonstrated the highest accuracy, particularly when incorporating breathing rate as a feature. These findings support the potential of AI-driven respiratory monitoring systems to transition respiratory assessments from clinical settings to home environments, enhancing accessibility and patient autonomy. Future work involves validating these models with larger, more diverse populations and exploring additional machine learning techniques., Comment: 10 pages, 2 figures

Biopharmaceutical products, particularly monoclonal antibodies (mAbs), have gained prominence in the pharmaceutical market due to their high specificity and efficacy. As these products are projected to constitute a substantial portion of global pharmaceutical sales, the application of machine learning models in mAb development and manufacturing is gaining momentum. This paper addresses the critical need for uncertainty quantification in machine learning predictions, particularly in scenarios with limited training data. Leveraging ensemble learning and Monte Carlo simulations, our proposed method generates additional input samples to enhance the robustness of the model in small training datasets. We evaluate the efficacy of our approach through two case studies: predicting antibody concentrations in advance and real-time monitoring of glucose concentrations during bioreactor runs using Raman spectra data. Our findings demonstrate the effectiveness of the proposed method in estimating the uncertainty levels associated with process performance predictions and facilitating real-time decision-making in biopharmaceutical manufacturing. This contribution not only introduces a novel approach for uncertainty quantification but also provides insights into overcoming challenges posed by small training datasets in bioprocess development. The evaluation demonstrates the effectiveness of our method in addressing key challenges related to uncertainty estimation within upstream cell cultivation, illustrating its potential impact on enhancing process control and product quality in the dynamic field of biopharmaceuticals.

Surveys and experiments in economics involve stateful interactions: participants receive different messages based on earlier answers, choices, and performance, or trade across many rounds with other participants. In the design of Congame, a platform for running such economic studies, we decided to use delimited continuations to manage the common flow of participants through a study. Here we report on the positives of this approach, as well as some challenges of using continuations, such as persisting data across requests, working with dynamic variables, avoiding memory leaks, and the difficulty of debugging continuations.

To enhance the understanding of air quality within underground railway stations (URS), a methodology has been developed to establish a baseline profile of particle concentrations (PM10 and PM2.5). This approach incorporates an extensive data cleaning process based on the identification of URS operation periods, physically inconsistent or mathematically aberrant data, and comparing the profile of each day to an average profile. The versatility of this methodology allows its application to different particle classes within various URS. The results obtained from the three studied URS indicate the possibility of obtaining reliable daily typical profiles even over short measurement periods (up to one or two weeks)., Comment: in French language, Congr{\`e}s Fran\c{c}ais sur les A{\'e}rosols 2024, ASFERA, Mar 2024, Paris, France

In recent years, the number and importance of autonomous racing leagues, and consequently the number of studies on them, has been growing. The seamless integration between different series has gained attention due to the scene's diversity. However, the high cost of full scale racing makes it a more accessible development model, to research at smaller form factors and scale up the achieved results. This paper presents a scalable architecture designed for autonomous racing that emphasizes modularity, adaptability to diverse configurations, and the ability to supervise parallel execution of pipelines that allows the use of different dynamic strategies. The system showcased consistent racing performance across different environments, demonstrated through successful participation in two relevant competitions. The results confirm the architecture's scalability and versatility, providing a robust foundation for the development of competitive autonomous racing systems. The successful application in real-world scenarios validates its practical effectiveness and highlights its potential for future advancements in autonomous racing technology.

The modeling of electric machines and power transformers typically involves systems of nonlinear magnetostatics or -quasistatics, and their efficient and accurate simulation is required for the reliable design, control, and optimization of such devices. We study the numerical solution of the vector potential formulation of nonlinear magnetostatics by means of higher-order finite element methods. Numerical quadrature is used for the efficient handling of the nonlinearities and domain mappings are employed for the consideration of curved boundaries. The existence of a unique solution is proven on the continuous and discrete level and a full convergence analysis of the resulting finite element schemes is presented indicating order optimal convergence rates under appropriate smoothness assumptions. For the solution of the nonlinear discretized problems, we consider a Newton method with line search for which we establish global linear convergence with convergence rates that are independent of the discretization parameters. We further prove local quadratic convergence in a mesh-dependent neighborhood of the solution which becomes effective when high accuracy of the nonlinear solver is demanded. The assumptions required for our analysis cover inhomogeneous, nonlinear, and anisotropic materials, which may arise in typical applications, including the presence of permanent magnets. The theoretical results are illustrated by numerical tests for some typical benchmark problems.

The use of single-photon sources (SPSs) is central to numerous systems and devices proposed amidst a modern surge in quantum technology. However, manufacturing schemes remain imperfect, and single-photon emission purity must often be experimentally verified via interferometry. Such a process is typically slow and costly, which has motivated growing research into whether SPS quality can be more rapidly inferred from incomplete emission statistics. Hence, this study is a sequel to previous work that demonstrated significant uncertainty in the standard method of quality estimation, i.e. the least-squares fitting of a physically motivated function, and asks: can machine learning (ML) do better? The study leverages eight datasets obtained from measurements involving an exemplary quantum emitter, i.e. a single InGaAs/GaAs epitaxial quantum dot; these eight contexts predominantly vary in the intensity of the exciting laser. Specifically, via a form of `transfer learning', five ML models, three linear and two ensemble-based, are trained on data from seven of the contexts and tested on the eighth. Validation metrics quickly reveal that even a linear regressor can outperform standard fitting when it is tested on the same contexts it was trained on, but the success of transfer learning is less assured, even though statistical analysis, made possible by data augmentation, suggests its superiority as an early estimator. Accordingly, the study concludes by discussing future strategies for grappling with the problem of SPS context dissimilarity, e.g. feature engineering and model adaptation., Comment: The data and software that supports the findings of this study are openly available at https://github.com/UTS-CASLab/sps-quality

Identity Access Management (IAM) is an area posing significant challenges, particularly in the context of remote connectivity and distributed or cloud-based systems. A wide range of technical solutions have been proposed by prior research, but the integration of these solutions in the commercial sector represent steps that significantly hamper their acceptance. The study aims to outline the current perception and security issues associated with IAMs solutions from the perspective of the beneficiaries. The analysis relies on a series of interviews with 45 cyber security professionals from different organisations all over the world. As results showed, cloud IAM solutions and on premises IAM solutions are affected by different issues. The main challenges for cloud based IAM solutions were Default configurations, Poor management of Non-Human Identities such as Service accounts, Poor certificate management, Poor API configuration and limited Log analysis. In contrast, the challenges for on premise solutions were Multi Factor Authentication, insecure Default configurations, Lack of skillsets required to manage IAM solution securely, Poor password policies, Unpatched vulnerabilities, and compromise of Single-Sign on leading to compromise of multiple entities. The study also determined that, regardless the evolving functionality of cloud based IAM solutions, 41% of respondents believe that the on premise solutions more secure than the cloud-based ones. As pointed out by the respondents, cloud IAM may potentially expose organisations to a wider range of vulnerabilities due to the complexity of the underlying solutions, challenges with managing permissions, and compliance to dynamic IAM policies., Comment: Will be published in 2024 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom), Tbilisi, Georgia, 24_27 June 2024

Gamma-ray bursts (GRBs) are intense, short-lived bursts of gamma-ray radiation observed up to a high redshift ($z \sim 10$) due to their luminosities. Thus, they can serve as cosmological tools to probe the early Universe. However, we need a large sample of high$-z$ GRBs, currently limited due to the difficulty in securing time at the large aperture Telescopes. Thus, it is painstaking to determine quickly whether a GRB is high$z$ or low$-z$, which hampers the possibility of performing rapid follow-up observations. Previous efforts to distinguish between high$-$ and low$-z$ GRBs using GRB properties and machine learning (ML) have resulted in limited sensitivity. In this study, we aim to improve this classification by employing an ensemble ML method on 251 GRBs with measured redshifts and plateaus observed by the Neil Gehrels Swift Observatory. Incorporating the plateau phase with the prompt emission, we have employed an ensemble of classification methods to enhance the sensitivity unprecedentedly. Additionally, we investigate the effectiveness of various classification methods using different redshift thresholds, $z_{threshold}$=$z_t$ at $z_{t}=$ 2.0, 2.5, 3.0, and 3.5. We achieve a sensitivity of 87\% and 89\% with a balanced sampling for both $z_{t}=3.0$ and $z_{t}=3.5$, respectively, representing a 9\% and 11\% increase in the sensitivity over Random Forest used alone. Overall, the best results are at $z_{t} = 3.5$, where the difference between the sensitivity of the training set and the test set is the smallest. This enhancement of the proposed method paves the way for new and intriguing follow-up observations of high$-z$ GRBs., Comment: 36 pages, 14 Figures (6 Figures with single panel, 4 Figures with 8 panels, 2 Figures with 4 panels, 1 Figure with 12 panels, 1 Figure with 2 panels), 6 Tables, submitted to ApJS

Well-posedness in time-weighted spaces for quasilinear (and semilinear) parabolic evolution equations $u'=A(u)u+f(u)$ is established in a certain critical case of strict inclusion $\mathrm{dom}(f)\subsetneq \mathrm{dom}(A)$ for the domains of the (superlinear) function $u\mapsto f(u)$ and the quasilinear part $u\mapsto A(u)$. Based upon regularizing effects of parabolic equations, it is proven that the solution map generates a semiflow in a critical intermediate space. The applicability of the abstract results is demonstrated by several examples including a model for atmospheric flows and semilinear and quasilinear evolution equations with scaling invariance for which well-posedness in the critical scaling invariant intermediate spaces is shown., Comment: 25 pages

We propose a scalable approximate algorithm for the NP-hard maximum-weight independent set problem. The core of our algorithm is a dual coordinate descent applied to a smoothed LP relaxation of the problem. This technique is referred to as Bregman method or Sinkhorn algorithm in the literature. Our algorithm addresses a family of clique cover LP relaxations, where the constraints are determined by the set of cliques covering the underlying graph. The objective function of the relaxation is smoothed with an entropy term. An important question determining efficiency of our algorithm is the control of the smoothing level over the course of optimization. While several dedicated techniques have been considered in the literature to this end, we propose a new one based on estimation of the relaxed duality gap. To make this estimation possible, we developed a new projection method to the feasible set of the considered LP relaxation. We experimentally show that our technique notably outperforms the standard one based on feasibility estimation. Additionally to solving the relaxed dual, we utilize a simple and very efficient primal heuristic to obtain feasible integer solutions of the initial non-relaxed problem. Our heuristic is a combination of the greedy generation and optimal recombination applied to the reduced costs computed by the dual optimization. Our experimental validation considers two datasets based on real-life applications, where our method shows competitive results being able to find high quality approximate solutions within 10 seconds for graphs with hundreds of thousands of nodes and dozens of millions of edges.

The basic equations, concepts, and modes of linear, ideal, MHD waves -- slow, Alfv\'en and fast -- are set out and generalised to gravitationally-stratified atmospheres. Particular attention is devoted to mode conversion, wherein the local behavior of a global wave changes from one mode to another in passing through particular atmospheric layers. Exact solutions are explored where available. Eikonal methods -- WKBJ and ray theory -- are described. Although our emphasis is on the theoretical underpinning of the subject, the solar atmospheric heating implications of fast/slow and fast/Alfv\'en conversions are discussed in detail., Comment: https://www.sciencedirect.com/book/9780323956642/magnetohydrodynamic-processes-in-solar-plasmas

Leveraging the advanced manufacturing capabilities of the semiconductor industry promises to help scale up silicon-based quantum processors by increasing yield, uniformity and integration. Recent studies of quantum dots fabricated on 300 mm wafer metal-oxide-semiconductor (MOS) processes have shown control and readout of individual spin qubits, yet quantum processors require two-qubit interactions to operate. Here, we use a 300 mm wafer MOS process customized for spin qubits and demonstrate coherent control of two electron spins using the spin-spin exchange interaction, forming the basis of an entangling gate such as $\sqrt{\text{SWAP}}$. We observe gate dephasing times of up to $T_2^{*}\approx500$ ns and a gate quality factor of 10. We further extend the coherence by up to an order of magnitude using an echo sequence. For readout, we introduce a dispersive readout technique, the radiofrequency electron cascade, that amplifies the signal while retaining the spin-projective nature of dispersive measurements. Our results demonstrate an industrial grade platform for two-qubit operations, alongside integration with dispersive sensing techniques.

A new unsupervised predictive maintenance analysis method based on the renormalization group approach used to discover critical behavior in complex systems has been proposed. The algorithm analyzes univariate time series and detects critical points based on a newly proposed theorem that identifies critical points using a Log Periodic Power Law function fits. Application of a new algorithm for predictive maintenance analysis of industrial data collected from reciprocating compressor systems is presented. Based on the knowledge of the dynamics of the analyzed compressor system, the proposed algorithm predicts valve and piston rod seal failures well in advance., Comment: 14 pages, 4 figures, 1 table

Reinforcement learning practitioners often avoid hierarchical policies, especially in image-based observation spaces. Typically, the single-task performance improvement over flat-policy counterparts does not justify the additional complexity associated with implementing a hierarchy. However, by introducing multiple decision-making levels, hierarchical policies can compose lower-level policies to more effectively generalize between tasks, highlighting the need for multi-task evaluations. We analyze the benefits of hierarchy through simulated multi-task robotic control experiments from pixels. Our results show that hierarchical policies trained with task conditioning can (1) increase performance on training tasks, (2) lead to improved reward and state-space generalizations in similar tasks, and (3) decrease the complexity of fine tuning required to solve novel tasks. Thus, we believe that hierarchical policies should be considered when building reinforcement learning architectures capable of generalizing between tasks.

The DArk Matter In CCDs at Modane (DAMIC-M) experiment is designed to search for light dark matter (m$_{\chi}$<10\,GeV/c$^2$) at the Laboratoire Souterrain de Modane (LSM) in France. DAMIC-M will use skipper charge-coupled devices (CCDs) as a kg-scale active detector target. Its single-electron resolution will enable eV-scale energy thresholds and thus world-leading sensitivity to a range of hidden sector dark matter candidates. A DAMIC-M prototype, the Low Background Chamber (LBC), has been taking data at LSM since 2022. The LBC provides a low-background environment, which has been used to characterize skipper CCDs, study dark current, and measure radiopurity of materials planned for DAMIC-M. It also allows testing of various subsystems like readout electronics, data acquisition software, and slow control. This paper describes the technical design and performance of the LBC.

Inspired by transformation optics and photonic crystals, this paper presents a computational investigation into the interaction between water surface waves and array waveguides of cylinders with multiple previously unexplored lattice geometries, including, for the first time, quasiperiodic geometries. Extending beyond conventional square and hexagonal periodic arrays, transformation optics has opened up entirely new opportunities to investigate water wave propagation through arrays based on quasiperiodic lattices, and quasiperiodically arranged vacancy defects. Using the linear potential flow open-source code Capytaine, missing element and $\tau$-scaled Fibonacci square lattices, the Penrose lattice, hexagonal $H_{00}$ lattice and Amman-Beenker lattice are investigated. The existence of band gaps for all arrays is observed. An hexagonal lattice with vacancy defects transmits the least energy. Bragg diffraction consistent with rotational symmetry is observed from all arrays. Waves will distort significantly to achieve resonance with arrays, supporting transformation-based waveguides. The possible uses include adaptation to more versatile waveguides with applications such as offshore renewable energy and coastal defence., Comment: 23 pages, 6 figures

The emergence of negative longitudinal magnetoresistance in the topologically non-trivial transition-metal dichalcogenide PtSe$_2$ is studied. Low $T$/high $\mu_0 H$ transport is performed for arbitrary field directions, and an analytical framework is established. The source of the negative longitudinal magnetoresistance is identified as the Kondo effect stemming from Pt-vacancies contributing an uncompensated spin, exclusively at the sample surface. The concentration of vacancies and the sample thickness are identified as tuning parameters. The findings are substantiated by density functional theory, which corroborates the proposed Pt-vacancy model., Comment: 11 pages, 15 figures

Understanding the neural mechanisms underlying the transitions between different states of consciousness is a fundamental challenge in neuroscience. Thus, we investigate the underlying drivers of changes during the resting-state dynamics of the human brain, as captured by functional magnetic resonance imaging (fMRI) across varying levels of consciousness (awake, light sedation, deep sedation, and recovery). We deploy a model-based approach relying on linear time-invariant (LTI) dynamical systems under unknown inputs (UI). Our findings reveal distinct changes in the spectral profile of brain dynamics - particularly regarding the stability and frequency of the system's oscillatory modes during transitions between consciousness states. These models further enable us to identify external drivers influencing large-scale brain activity during naturalistic auditory stimulation. Our findings suggest that these identified inputs delineate how stimulus-induced co-activity propagation differs across consciousness states. Notably, our approach showcases the effectiveness of LTI models under UI in capturing large-scale brain dynamic changes and drivers in complex paradigms, such as naturalistic stimulation, which are not conducive to conventional general linear model analysis. Importantly, our findings shed light on how brain-wide dynamics and drivers evolve as the brain transitions towards conscious states, holding promise for developing more accurate biomarkers of consciousness recovery in disorders of consciousness.

The advance of diffusion-based generative models in recent years has revolutionized state-of-the-art (SOTA) techniques in a wide variety of image analysis and synthesis tasks, whereas their adaptation on image restoration, particularly within computational microscopy remains theoretically and empirically underexplored. In this research, we introduce a multi-scale generative model that enhances conditional image restoration through a novel exploitation of the Brownian Bridge process within wavelet domain. By initiating the Brownian Bridge diffusion process specifically at the lowest-frequency subband and applying generative adversarial networks at subsequent multi-scale high-frequency subbands in the wavelet domain, our method provides significant acceleration during training and sampling while sustaining a high image generation quality and diversity on par with SOTA diffusion models. Experimental results on various computational microscopy and imaging tasks confirm our method's robust performance and its considerable reduction in its sampling steps and time. This pioneering technique offers an efficient image restoration framework that harmonizes efficiency with quality, signifying a major stride in incorporating cutting-edge generative models into computational microscopy workflows.

Abell 2744, also known as Pandora's Cluster, is a complex merging galaxy cluster. While a major merger is clear along the north-south axis, the dynamical state of the northwest subcluster has been highly uncertain. We present ultra-deep ($\approx$2.1 Ms) X-ray observations of Abell 2744 obtained with the Chandra X-ray Observatory and reinterpret the multi-wavelength picture with a suite of idealised simulations of galaxy cluster mergers. The new data reveal in unprecedented detail the disruption of cool cores in the three X-ray luminous subclusters and confirm the presence of a shock to the NW. A position-velocity clustering of the cluster member galaxies shows a clearly separated S2 component, with a $\Delta z$ implying a separation of 53 Mpc or a line-of-sight velocity of $4500\ \rm{km \ s^{-1}}$, or likely some combination of the two. While binary simulations allow NW to have undergone a gravitational slingshot after the first pericenter passage, triple merger simulations rule out this scenario, because the two mergers would have had to occur $\sim$0.5 Gyr apart, and the joint impact of the shocks from the two mergers would completely disrupt the SE and NW cool cores; they only reform after 1-2 Gyr, by which point the core separations greatly exceed observations. The scenario that best describes Abell 2744 is a head-on N-S merger $0.5-0.6$ Gyrs ago followed by a first infall of the NW subcluster. Furthermore, we note that a model with three cluster-size halos, with masses consistent with gravitational lensing constraints, nevertheless produces a lensing convergence and surface brightness lower than observed in most of the field of view, whereas the temperatures are consistent with observations. This suggests the presence of a large-scale overdensity, which contributes to the diffuse emission and total surface density without heating the densest gas., Comment: Submitted to the Open Journal of Astrophysics

Differential privacy (DP) is a widely used approach for mitigating privacy risks when training machine learning models on sensitive data. DP mechanisms add noise during training to limit the risk of information leakage. The scale of the added noise is critical, as it determines the trade-off between privacy and utility. The standard practice is to select the noise scale in terms of a privacy budget parameter $\epsilon$. This parameter is in turn interpreted in terms of operational attack risk, such as accuracy, or sensitivity and specificity of inference attacks against the privacy of the data. We demonstrate that this two-step procedure of first calibrating the noise scale to a privacy budget $\epsilon$, and then translating $\epsilon$ to attack risk leads to overly conservative risk assessments and unnecessarily low utility. We propose methods to directly calibrate the noise scale to a desired attack risk level, bypassing the intermediate step of choosing $\epsilon$. For a target attack risk, our approach significantly decreases noise scale, leading to increased utility at the same level of privacy. We empirically demonstrate that calibrating noise to attack sensitivity/specificity, rather than $\epsilon$, when training privacy-preserving ML models substantially improves model accuracy for the same risk level. Our work provides a principled and practical way to improve the utility of privacy-preserving ML without compromising on privacy.

Decompilers are widely used by security researchers and developers to reverse engineer executable code. While modern decompilers are adept at recovering instructions, control flow, and function boundaries, some useful information from the original source code, such as variable types and names, is lost during the compilation process. Our work aims to predict these variable types and names from the remaining information. We propose STRIDE, a lightweight technique that predicts variable names and types by matching sequences of decompiler tokens to those found in training data. We evaluate it on three benchmark datasets and find that STRIDE achieves comparable performance to state-of-the-art machine learning models for both variable retyping and renaming while being much simpler and faster. We perform a detailed comparison with two recent SOTA transformer-based models in order to understand the specific factors that make our technique effective. We implemented STRIDE in fewer than 1000 lines of Python and have open-sourced it under a permissive license at https://github.com/hgarrereyn/STRIDE.

With the recent advancements in quantum technologies, the QKD market exploded. World players are scrambling to win the race towards global QKD networks, even before the rules and policies required by such large endeavors were even discussed. Several vendors are on the market, each with specific parameters and advantages (in terms of key rate, link range, KMS software, etc.), hence considerable effort is now made towards standardization. While quantum communications is expected to reach a market size of up to \$36B by 2040, the largest QKD initiative to date is EuroQCI, which, due to its sheer scale, is forcing the market to mature. Although building a QKD network is believed to be trivial today, inter-connecting federated networks on a global scale is a heavy challenge. We propose QKD virtual networks not only as a useful infrastructure abstraction for increased flexibility and granular security, but as an inevitable solution for several problems that future QKD networks will encounter on the way towards widespread adoption.

Detecting anomalous events in satellite telemetry is a critical task in space operations. This task, however, is extremely time-consuming, error-prone and human dependent, thus automated data-driven anomaly detection algorithms have been emerging at a steady pace. However, there are no publicly available datasets of real satellite telemetry accompanied with the ground-truth annotations that could be used to train and verify anomaly detection supervised models. In this article, we address this research gap and introduce the AI-ready benchmark dataset (OPSSAT-AD) containing the telemetry data acquired on board OPS-SAT -- a CubeSat mission which has been operated by the European Space Agency which has come to an end during the night of 22--23 May 2024 (CEST). The dataset is accompanied with the baseline results obtained using 30 supervised and unsupervised classic and deep machine learning algorithms for anomaly detection. They were trained and validated using the training-test dataset split introduced in this work, and we present a suggested set of quality metrics which should be always calculated to confront the new algorithms for anomaly detection while exploiting OPSSAT-AD. We believe that this work may become an important step toward building a fair, reproducible and objective validation procedure that can be used to quantify the capabilities of the emerging anomaly detection techniques in an unbiased and fully transparent way., Comment: 13 pages, 8 figures, 3 tables

We consider the incomplete multi-graph matching problem, which is a generalization of the NP-hard quadratic assignment problem for matching multiple finite sets. Multi-graph matching plays a central role in computer vision, e.g., for matching images or shapes, so that a number of dedicated optimization techniques have been proposed. While the closely related NP-hard multi-dimensional assignment problem (MDAP) has been studied for decades in the operations research community, it only considers complete matchings and has a different cost structure. We bridge this gap and transfer well-known approximation algorithms for the MDAP to incomplete multi-graph matching. To this end, we revisit respective algorithms, adapt them to incomplete multi-graph matching, and propose their extended and parallelized versions. Our experimental validation shows that our new method substantially outperforms the previous state of the art in terms of objective and runtime. Our algorithm matches, for example, 29 images with more than 500 keypoints each in less than two minutes, whereas the fastest considered competitor requires at least half an hour while producing far worse results.

This white paper discusses the breadth of science related to active galactic nuclei (AGN) and associated phenomena to be enabled by a mission with microcalorimeter energy resolution in the soft X-ray band, a large collecting area, and wide-field imaging. Such a mission, the Line Emission Mapper (LEM), has been proposed to NASA's 2023 Astrophysics Probe Explorer call. While the science pillars of the PI-led part of the mission focus on galaxy evolution, the PI-led LEM All-Sky Survey (LASS) and General Observer/Investigator opportunities will enable vital discoveries for AGN science in the critical soft X-ray band., Comment: 22 pages, 16 figures

Machine learning has vast potential to improve anomaly detection in satellite telemetry which is a crucial task for spacecraft operations. This potential is currently hampered by a lack of comprehensible benchmarks for multivariate time series anomaly detection, especially for the challenging case of satellite telemetry. The European Space Agency Benchmark for Anomaly Detection in Satellite Telemetry (ESA-ADB) aims to address this challenge and establish a new standard in the domain. It is a result of close cooperation between spacecraft operations engineers from the European Space Agency (ESA) and machine learning experts. The newly introduced ESA Anomalies Dataset contains annotated real-life telemetry from three different ESA missions, out of which two are included in ESA-ADB. Results of typical anomaly detection algorithms assessed in our novel hierarchical evaluation pipeline show that new approaches are necessary to address operators' needs. All elements of ESA-ADB are publicly available to ensure its full reproducibility., Comment: 87 pages, 24 figures, 19 tables