Search

Quantum computing with qudits, an extension of qubits to multiple levels, is a research field less mature than qubit-based quantum computing. However, qudits can offer some advantages over qubits, by representing information with fewer separated components. In this article, we present QuForge, a Python-based library designed to simulate quantum circuits with qudits. This library provides the necessary quantum gates for implementing quantum algorithms, tailored to any chosen qudit dimension. Built on top of differentiable frameworks, QuForge supports execution on accelerating devices such as GPUs and TPUs, significantly speeding up simulations. It also supports sparse operations, leading to a reduction in memory consumption compared to other libraries. Additionally, by constructing quantum circuits as differentiable graphs, QuForge facilitates the implementation of quantum machine learning algorithms, enhancing the capabilities and flexibility of quantum computing research., Comment: 18 pages, 7 figures

We explore the enhanced self-calibration of photometric galaxy redshift distributions, $n(z)$, through the combination of up to six two-point functions. Our $\rm 3\times2pt$ configuration is comprised of photometric shear, spectroscopic galaxy clustering, and spectroscopic-photometric galaxy-galaxy lensing (GGL). We further include spectroscopic-photometric cross-clustering; photometric GGL; and photometric auto-clustering, using the photometric shear sample as density tracer. We perform simulated likelihood forecasts of the cosmological and nuisance parameter constraints for Stage-III- and Stage-IV-like surveys. For the Stage-III-like case, we employ realistic but perturbed redshift distributions, and distinguish between "coherent" shifting in one direction, versus more internal scattering and full-shape errors. For perfectly known $n(z)$, a $\rm 6\times2pt$ analysis gains $\sim40\%$ in Figure of Merit (FoM) in the $S_8\equiv\sigma_8\sqrt{\Omega_{\rm m}/0.3}$ and $\Omega_{\rm m}$ plane relative to the $\rm 3\times2pt$ analysis. If untreated, coherent and incoherent redshift errors lead to inaccurate inferences of $S_8$ and $\Omega_{\rm m}$, respectively. Employing bin-wise scalar shifts $\delta{z}_i$ in the tomographic mean redshifts reduces cosmological parameter biases, with a $\rm 6x2pt$ analysis constraining the shift parameters with $2-4$ times the precision of a photometric $\rm 3^{ph}\times2pt$ analysis. For the Stage-IV-like survey, a $\rm 6\times2pt$ analysis doubles the FoM($\sigma_8{-}\Omega_{\rm m}$) compared to any $\rm 3\times2pt$ or $\rm 3^{ph}\times2pt$ analysis, and is only $8\%$ less constraining than if the $n(z)$ were perfectly known. A Gaussian mixture model for the $n(z)$ reduces mean-redshift errors and preserves the $n(z)$ shape. It also yields the most accurate and precise cosmological constraints for any $N\rm\times2pt$ configuration given $n(z)$ biases., Comment: 38 pages, 20 figures, to be submitted to A&A

Incorporating cross-speaker style transfer in text-to-speech (TTS) models is challenging due to the need to disentangle speaker and style information in audio. In low-resource expressive data scenarios, voice conversion (VC) can generate expressive speech for target speakers, which can then be used to train the TTS model. However, the quality and style transfer ability of the VC model are crucial for the overall TTS model quality. In this work, we explore the use of synthetic data generated by a VC model to assist the TTS model in cross-speaker style transfer tasks. Additionally, we employ pre-training of the style encoder using timbre perturbation and prototypical angular loss to mitigate speaker leakage. Our results show that using VC synthetic data can improve the naturalness and speaker similarity of TTS in cross-speaker scenarios. Furthermore, we extend this approach to a cross-language scenario, enhancing accent transfer., Comment: Accepted at SynData4GenAI 2024

Protein compartmentalization in the frame of a liquid-liquid phase separation is a key mechanism to optimize spatiotemporal control of biological systems. Such a compartmentalization process reduces the intrinsic noise in protein concentration due to stochasticity in gene expression. Employing Flory-Huggins solution theory, Avramov/Casalini's model, and the Gr\"uneisen parameter, we unprecedentedly propose a cellular Griffiths-like phase (CGLP), which can impact its functionality and self-organization. The here-proposed CGLP is key ranging from the understanding of primary organisms' evolution to the treatment of diseases. Our findings pave the way for an alternative Biophysics approach to investigate coacervation processes., Comment: 13 pages, 2 figures, suppl. material upon request

For a perfect fluid, pressure $p$ and energy density $\rho$ are related via the equation of state (EOS) $\omega = p/\rho$, where $\omega$ is the EOS parameter, being its interpretation usually constrained to a numerical value for each universe era. Here, based on the Mie-Gr\"uneisen EOS, we show that $\omega$ is recognized as the effective Gr\"uneisen parameter $\Gamma_{eff}$, whose singular contribution, the so-called Gr\"uneisen ratio $\Gamma$, quantifies the barocaloric effect. Our analysis suggests that the negative $p$ associated with dark-energy implies a metastable state and that in the dark-energy-dominated era $\omega$ is time-dependent, which reinforces recent proposals of a time-dependent cosmological constant. Furthermore, we demonstrate that $\Gamma_{eff}$ is embodied in the energy-momentum stress tensor in the Einstein field equations, enabling us to analyse, in the frame of an imperfect fluid picture, anisotropic effects of the universe expansion. We propose that upon going from decelerated- to accelerated-expansion, a phase transition-like behavior can be inferred. Yet, our analysis in terms of entropy, $\Gamma$, and a by us adapted version of Avramov/Casalini's model to Cosmology unveil hidden aspects related to the expansion of the universe. Our findings pave the way to interpret cosmological phenomena in connection with concepts of condensed matter Physics via $\Gamma_{eff}$., Comment: 11 pages, 1 figure, comments are welcome

Real-life medical data is often multimodal and incomplete, fueling the growing need for advanced deep learning models capable of integrating them efficiently. The use of diverse modalities, including histopathology slides, MRI, and genetic data, offers unprecedented opportunities to improve prognosis prediction and to unveil new treatment pathways. Contrastive learning, widely used for deriving representations from paired data in multimodal tasks, assumes that different views contain the same task-relevant information and leverages only shared information. This assumption becomes restrictive when handling medical data since each modality also harbors specific knowledge relevant to downstream tasks. We introduce DRIM, a new multimodal method for capturing these shared and unique representations, despite data sparsity. More specifically, given a set of modalities, we aim to encode a representation for each one that can be divided into two components: one encapsulating patient-related information common across modalities and the other, encapsulating modality-specific details. This is achieved by increasing the shared information among different patient modalities while minimizing the overlap between shared and unique components within each modality. Our method outperforms state-of-the-art algorithms on glioma patients survival prediction tasks, while being robust to missing modalities. To promote reproducibility, the code is made publicly available at https://github.com/Lucas-rbnt/DRIM

While convolutional neural networks (CNNs) excel at clean image classification, they struggle to classify images corrupted with different common corruptions, limiting their real-world applicability. Recent work has shown that incorporating a CNN front-end block that simulates some features of the primate primary visual cortex (V1) can improve overall model robustness. Here, we expand on this approach by introducing two novel biologically-inspired CNN model families that incorporate a new front-end block designed to simulate pre-cortical visual processing. RetinaNet, a hybrid architecture containing the novel front-end followed by a standard CNN back-end, shows a relative robustness improvement of 12.3% when compared to the standard model; and EVNet, which further adds a V1 block after the pre-cortical front-end, shows a relative gain of 18.5%. The improvement in robustness was observed for all the different corruption categories, though accompanied by a small decrease in clean image accuracy, and generalized to a different back-end architecture. These findings show that simulating multiple stages of early visual processing in CNN early layers provides cumulative benefits for model robustness.

This paper presents a novel approach for robust global localisation and 6DoF pose estimation of ground robots in forest environments by leveraging cross-view factor graph optimisation and deep-learned re-localisation. The proposed method addresses the challenges of aligning aerial and ground data for pose estimation, which is crucial for accurate point-to-point navigation in GPS-denied environments. By integrating information from both perspectives into a factor graph framework, our approach effectively estimates the robot's global position and orientation. We validate the performance of our method through extensive experiments in diverse forest scenarios, demonstrating its superiority over existing baselines in terms of accuracy and robustness in these challenging environments. Experimental results show that our proposed localisation system can achieve drift-free localisation with bounded positioning errors, ensuring reliable and safe robot navigation under canopies., Comment: 7 pages, 4 figures, Submitted to ICRA2025

Gathering observational data for medical decision-making often involves uncertainties arising from both type I (false positive)and type II (false negative) errors. In this work, we develop a statistical model to study how medical decision-making can be improved by repeating diagnostic and screening tests, and aggregating their results. This approach is relevant not only in clinical settings, such as medical imaging, but also in public health, as highlighted by the need for rapid, cost-effective testing methods during the SARS-CoV-2pandemic. Our model enables the development of testing protocols with an arbitrary number of tests, which can be customized to meet requirements for type I and type II errors. This allows us to adjust sensitivity and specificity according to application-specific needs. Additionally, we derive generalized Rogan--Gladen estimates for estimating disease prevalence, accounting for an arbitrary number of tests with potentially different type I and type II errors. We also provide the corresponding uncertainty quantification., Comment: 24 pages, 6 figures, 2 tables

This paper shows that a wide class of effective learning rules -- those that improve a scalar performance measure over a given time window -- can be rewritten as natural gradient descent with respect to a suitably defined loss function and metric. Specifically, we show that parameter updates within this class of learning rules can be expressed as the product of a symmetric positive definite matrix (i.e., a metric) and the negative gradient of a loss function. We also demonstrate that these metrics have a canonical form and identify several optimal ones, including the metric that achieves the minimum possible condition number. The proofs of the main results are straightforward, relying only on elementary linear algebra and calculus, and are applicable to continuous-time, discrete-time, stochastic, and higher-order learning rules, as well as loss functions that explicitly depend on time., Comment: 14 pages, 3 figures

This work aims at providing fundamental general tools for the analysis of water spectra as observed in protoplanetary disks with JWST-MIRI. We analyze 25 high-quality spectra from the JDISC Survey reduced with asteroid calibrators as presented in Pontoppidan et al. 2024. First, we present a spectral atlas to illustrate the clustering of water transitions from different upper level energies ($E_u$) and identify single (un-blended) lines that provide the most reliable measurements. With the atlas, we demonstrate two important excitation effects: one related to the opacity saturation of ortho-para line pairs that overlap, and the other to the sub-thermal excitation of $v=1-1$ lines scattered across the $v=0-0$ rotational band. Second, from this larger line selection we define a list of fundamental lines spanning $E_u$ from 1500 to 6000 K to develop simple line-ratio diagrams as diagnostics of temperature components and column density. Third, we report the detection of disk-rotation Doppler broadening of molecular lines, which demonstrates the radial distribution of water emission at different $E_u$ and confirms from gas kinematics a radially-extended $\approx 170$--220 K reservoir, close to the ice sublimation front. We also report the detection of narrow blue-shifted absorption from an inner disk wind in ro-vibrational H2O and CO lines, which may be observed in disks at inclinations $> 50$ deg. We summarize these findings and tools into a general recipe that should be beneficial to community efforts to study water in planet-forming regions., Comment: Community input and feedback is very welcome. Referee report received and asking for minor revisions. Some analysis updates are in progress. The rest of the sample in Appendix H will be included later

We give a complete characterisation of the linear isometries of ${\rm Hol}(\Omega)$, where $\Omega$ is the half-plane, the complex plane or an annulus centered at 0 and symmetric to the unit circle. Moreover, we introduce new techniques to describe the holomorphic maps on the annulus that preserve the unit circle, and we finish by proving results about the spectra of the linear isometries on the annulus., Comment: 14 pages

Atrial fibrillation (AF) is the most prevalent form of cardiac arrhythmia and is associated with increased morbidity and mortality. The effectiveness of current clinical interventions for AF is often limited by an incomplete understanding of the atrial anatomical structures that sustain this arrhythmia. Late Gadolinium-Enhanced MRI (LGE-MRI) has emerged as a critical imaging modality for assessing atrial fibrosis and scarring, which are essential markers for predicting the success of ablation procedures in AF patients. The Multi-class Bi-Atrial Segmentation (MBAS) challenge at MICCAI 2024 aims to enhance the segmentation of both left and right atria and their walls using a comprehensive dataset of 200 multi-center 3D LGE-MRIs, labelled by experts. This work presents an ensemble approach that integrates multiple machine learning models, including Unet, ResNet, EfficientNet and VGG, to perform automatic bi-atrial segmentation from LGE-MRI data. The ensemble model was evaluated using the Dice Similarity Coefficient (DSC) and 95% Hausdorff distance (HD95) on the left & right atrium wall, right atrium cavity, and left atrium cavity. On the internal testing dataset, the model achieved a DSC of 88.41%, 98.48%, 98.45% and an HD95 of 1.07, 0.95, 0.64 respectively. This demonstrates the effectiveness of the ensemble model in improving segmentation accuracy. The approach contributes to advancing the understanding of AF and supports the development of more targeted and effective ablation strategies.

Christoffel polynomials are classical tools from approximation theory. They can be used to estimate the (compact) support of a measure $\mu$ on $\mathbb{R}^d$ based on its low-degree moments. Recently, they have been applied to problems in data science, including outlier detection and support inference. A major downside of Christoffel polynomials in such applications is the fact that, in order to compute their coefficients, one must invert a matrix whose size grows rapidly with the dimension $d$. In this paper, we propose a modification of the Christoffel polynomial which is significantly cheaper to compute, but retains many of its desirable properties. Our approach relies on sparsity of the underlying measure $\mu$, described by a graphical model. The complexity of our modification depends on the treewidth of this model., Comment: 21 pages, 1 figure

This paper offers a strategic rationale for zero-sum thinking in elections. We show that asymmetric information and distributional considerations together make voters wary of policies supported by others. This force impels a majority of voters to support policies contrary to their preferences and information. Our analysis identifies and interprets a form of "adverse correlation" that is necessary and sufficient for zero-sum thinking to prevail in equilibrium.

The proliferation of Artificial Neural Networks (ANNs) has led to increased energy consumption, raising concerns about their sustainability. Spiking Neural Networks (SNNs), which are inspired by biological neural systems and operate using sparse, event-driven spikes to communicate information between neurons, offer a potential solution due to their lower energy requirements. An alternative technique for reducing a neural network's footprint is quantization, which compresses weight representations to decrease memory usage and energy consumption. In this study, we present Twin Network Augmentation (TNA), a novel training framework aimed at improving the performance of SNNs while also facilitating an enhanced compression through low-precision quantization of weights. TNA involves co-training an SNN with a twin network, optimizing both networks to minimize their cross-entropy losses and the mean squared error between their output logits. We demonstrate that TNA significantly enhances classification performance across various vision datasets and in addition is particularly effective when applied when reducing SNNs to ternary weight precision. Notably, during inference , only the ternary SNN is retained, significantly reducing the network in number of neurons, connectivity and weight size representation. Our results show that TNA outperforms traditional knowledge distillation methods and achieves state-of-the-art performance for the evaluated network architecture on benchmark datasets, including CIFAR-10, CIFAR-100, and CIFAR-10-DVS. This paper underscores the effectiveness of TNA in bridging the performance gap between SNNs and ANNs and suggests further exploration into the application of TNA in different network architectures and datasets.

Objective: To propose a mathematical model for applying Ionization Detail (ID), the detailed spatial distribution of ionization along a particle track, to proton and ion beam radiotherapy treatment planning (RTP). Approach: Our model provides for selection of preferred ID parameters (I_p) for RTP, that associate closest to biological effects. Cluster dose is proposed to bridge the large gap between nanoscopic I_p and macroscopic RTP. Selection of I_p is demonstrated using published cell survival measurements for protons through argon, comparing results for nineteen Ip: N_k; k = 2,3,...,10, the number of ionizations in clusters of k or more per particle, and F_k; k = 1,2,...,10, the number of clusters of k or more per particle. We then describe application of the model to ID-based RTP and propose a path to clinical translation. Main results: The preferred I_p were N_4 and F_5 for aerobic cells, N_5 and F_7 for hypoxic cells. Signifcant differences were found in cell survival for beams having the same LET or the preferred N_k. Conversely, there was no signi?cant difference for F_5 for aerobic cells and F_7 for hypoxic cells, regardless of ion beam atomic number or energy. Further, cells irradiated with the same cluster dose for these I_p had the same cell survival. Based on these preliminary results and other compelling results in nanodosimetry, it is reasonable to assert that I_p exist that are more closely associated with biological effects than current LET-based approaches and microdosimetric RBE-based models used in particle RTP. However, more biological variables such as cell line and cycle phase, as well as ion beam pulse structure and rate still need investigation. Signifcance: Our model provides a practical means to select preferred I_p from radiobiological data, and to convert I_p to the macroscopic cluster dose for particle RTP., Comment: 31 pages, 12 figures

Optical microscopy has long been the standard method for diagnosis in cytopathology. Whole slide scanners can image and digitize large sample areas automatically, but are slow, expensive and therefore not widely available. Clinical diagnosis of cytology specimens is especially challenging since these samples are both spread over large areas and thick, which requires 3D capture. Here, we introduce a new parallelized microscope for scanning thick specimens across extremely wide fields-of-view (54x72 mm^2) at 1.2 and 0.6 {\mu}m resolutions, accompanied by machine learning software to rapidly assess these 16 gigapixel scans. This Multi-Camera Array Scanner (MCAS) comprises 48 micro-cameras closely arranged to simultaneously image different areas. By capturing 624 megapixels per snapshot, the MCAS is significantly faster than most conventional whole slide scanners. We used this system to digitize entire cytology samples (scanning three entire slides in 3D in just several minutes) and demonstrate two machine learning techniques to assist pathologists: first, an adenocarcinoma detection model in lung specimens (0.73 recall); second, a slide-level classification model of lung smears (0.969 AUC).

This paper presents the novel Dual Stream Graph-Transformer Fusion (DS-GTF) architecture designed specifically for classifying task-based Magnetoencephalography (MEG) data. In the spatial stream, inputs are initially represented as graphs, which are then passed through graph attention networks (GAT) to extract spatial patterns. Two methods, TopK and Thresholded Adjacency are introduced for initializing the adjacency matrix used in the GAT. In the temporal stream, the Transformer Encoder receives concatenated windowed input MEG data and learns new temporal representations. The learned temporal and spatial representations from both streams are fused before reaching the output layer. Experimental results demonstrate an enhancement in classification performance and a reduction in standard deviation across multiple test subjects compared to other examined models., Comment: 6 pages

Quantum optimization, both for classical and quantum functions, is one of the most well-studied applications of quantum computing, but recent trends have relied on hybrid methods that push much of the fine-tuning off onto costly classical algorithms. Feedback-based quantum algorithms, such as FALQON, avoid these fine-tuning problems but at the cost of additional circuit depth and a lack of convergence guarantees. In this work, we take the local greedy information collected by Lyapunov feedback control and develop an analytic framework to use it to perturbatively update previous control layers, similar to the global optimal control achievable using Pontryagin optimal control. This perturbative methodology, which we call Feedback Optimally Controlled Quantum States (FOCQS), can be used to improve the results of feedback-based algorithms, like FALQON. Furthermore, this perturbative method can be used to push smooth annealing-like control protocol closer to the control optimum, even providing and iterative approach, albeit with diminishing returns. In numerical testing, we show improvements in convergence and required depth due to these methods over existing quantum feedback control methods., Comment: 13 pages, 3 figures

Jamming devices present a significant threat by disrupting signals from the global navigation satellite system (GNSS), compromising the robustness of accurate positioning. The detection of anomalies within frequency snapshots is crucial to counteract these interferences effectively. A critical preliminary measure involves the reliable classification of interferences and characterization and localization of jamming devices. This paper introduces an extensive dataset compromising snapshots obtained from a low-frequency antenna, capturing diverse generated interferences within a large-scale environment including controlled multipath effects. Our objective is to assess the resilience of ML models against environmental changes, such as multipath effects, variations in interference attributes, such as the interference class, bandwidth, and signal-to-noise ratio, the accuracy jamming device localization, and the constraints imposed by snapshot input lengths. By analyzing the aleatoric and epistemic uncertainties, we demonstrate the adaptness of our model in generalizing across diverse facets, thus establishing its suitability for real-world applications. https://gitlab.cc-asp.fraunhofer.de/darcy_gnss/controlled_low_frequency

Recent constraints on neutron star mass and radius have advanced our understanding of the equation of state of cold dense matter. Some of them have been obtained by modeling the pulses of three millisecond X-ray pulsars observed by the Neutron Star Interior Composition Explorer (NICER). Here, we present a Bayesian parameter inference for a fourth pulsar, PSR J1231-1411, using the same technique with NICER and XMM-Newton data. When applying a broad mass-inclination prior from radio timing measurements and the emission region geometry model that can best explain the data, we find likely-converged results only when using a limited radius prior. If limiting the radius to be consistent with the previous observational constraints and equation of state analyses, we infer the radius to be $12.6 \pm 0.3$ km and the mass to be $1.04_{-0.03}^{+0.05}$ $M_\odot$, each reported as the posterior credible interval bounded by the $16\,\%$ and $84\,\%$ quantiles. If using an uninformative prior but limited between $10$ and $14$ km, we find otherwise similar results, but $R_{\mathrm{eq}} = 13.5_{-0.5}^{+0.3}$ km for the radius. In both cases, we find a non-antipodal hot region geometry where one emitting spot is at the equator or slightly above, surrounded by a large colder region, and where a non-circular hot region lies close to southern rotational pole. If using a wider radius prior, we only find solutions that fit the data significantly worse. We discuss the challenges in finding the better fitting solutions, possibly related to the weak interpulse feature in the pulse profile., Comment: 22 pages, 13 figures (2 of which are figure sets), 3 tables, accepted for publication in ApJ

In this paper we study the norm-attainment of positive operators between Banach lattices. By considering an absolute version of James boundaries, we prove that: If $E$ is a reflexive Banach lattice whose order is given by a basis and $F$ is a Dedekind complete Banach lattice, then every positive operator from $E$ to $F$ is compact if and only if every positive operator from $E$ to $F$ attains its norm. An analogue result considering that $E$ is reflexive and the order in $F$ is continuous and given by a basis was proven. We applied our result to study a positive version of the weak maximizing property., Comment: 15 pages

We develop a parabolic inf-sup theory for a modified TraceFEM semi-discretization in space of the heat equation posed on a stationary surface embedded in $\mathbb{R}^n$. We consider the normal derivative volume stabilization and add an $L^2$-type stabilization to the time derivative. We assume that the representation of and the integration over the surface are exact, however, all our results are independent of how the surface cuts the bulk mesh. For any mesh for which the method is well-defined, we establish necessary and sufficient conditions for inf-sup stability of the proposed TraceFEM in terms of $H^1$-stability of a stabilized $L^2$-projection and of an inverse inequality constant that accounts for the lack of conformity of TraceFEM. Furthermore, we prove that the latter two quantities are bounded uniformly for a sequence of shape-regular and quasi-uniform bulk meshes. We derive several consequences of uniform discrete inf-sup stability, namely uniform well-posedness, discrete maximal parabolic regularity, parabolic quasi-best approximation, convergence to minimal regularity solutions, and optimal order-regularity energy and $L^2 L^2$ error estimates. We show that the additional stabilization of the time derivative restores optimal conditioning of time-discrete TraceFEM typical of fitted discretizations., Comment: 39 pages, 1 figure

The ER=EPR conjecture states that quantum entanglement between boundary degrees of freedom leads to the emergence of bulk spacetime itself. Although this has been tested extensively in String Theory for asymptotically anti-de Sitter spacetimes, its implications for an accelerating universe, such as our own, remain less explored. Assuming a cosmic version of ER=EPR for de Sitter space, we explore computational complexity corresponding to long-range entanglement responsible for bulk states on spacelike hypersurfaces. Rather remarkably, we find that the complexity (per unit volume) of the Euclidean vacuum, as an entangled state over two boundary CFT vacua, is finite both in the UV and the IR, which provides additional evidence for cosmic ER=EPR. Our result seems to be a universal feature of spacetimes with horizons and is explicitly independent of the details of the model under consideration., Comment: 5 pages, 1 figure, comments welcome

Collective decision-making is the process through which diverse stakeholders reach a joint decision. Within societal settings, one example is participatory budgeting, where constituents decide on the funding of public projects. How to most efficiently aggregate diverse stakeholder inputs on a portfolio of projects with uncertain long-term benefits remains an open question. We address this problem by studying collective decision-making through the integration of preference aggregation and knapsack allocation methods. Since different stakeholder groups may evaluate projects differently,we examine several aggregation methods that combine their diverse inputs. The aggregated evaluations are then used to fill a ``collective'' knapsack. Among the methods we consider are the arithmetic mean, Borda-type rankings, and delegation to experts. We find that the factors improving an aggregation method's ability to identify projects with the greatest expected long-term value include having many stakeholder groups, moderate variation in their expertise levels, and some degree of delegation or bias favoring groups better positioned to objectively assess the projects. We also discuss how evaluation errors and heterogeneous costs impact project selection. Our proposed aggregation methods are relevant not only in the context of funding public projects but also, more generally, for organizational decision-making under uncertainty., Comment: 31 pages, 10 figures, 1 table

We demonstrate spectral shaping of entangled photons with a six-channel microring-resonator-based silicon photonic pulse shaper. Through precise calibration of thermal phase shifters in a microresonator-based pulse shaper, we demonstrate line-by-line phase control on a 3~GHz grid for two frequency-bin-entangled qudits, corresponding to Hilbert spaces of up to $6\times 6$ ($3\times 3$) dimensions for shared (independent) signal-idler filters. The pulse shaper's fine spectral resolution enables control of nanosecond-scale temporal features, which are observed by direct coincidence detection of biphoton correlation functions that show excellent agreement with theory. This work marks, to our knowledge, the first demonstration of biphoton pulse shaping using an integrated spectral shaper and holds significant promise for applications in quantum information processing.

Synchronization is a ubiquitous phenomenon in nature. Although it is necessary for the functioning of many systems, too much synchronization can also be detrimental, e.g., (partially) synchronized brain patterns support high-level cognitive processes and bodily control, but hypersynchronization can lead to epileptic seizures and tremors, as in neurodegenerative conditions such as Parkinson's disease. Consequently, a critical research question is how to develop effective pinning control methods capable to reduce or modulate synchronization as needed. Although such methods exist to control pairwise-coupled oscillators, there are none for higher-order interactions, despite the increasing evidence of their relevant role in brain dynamics. In this work, we fill this gap by proposing a generalized control method designed to desynchronize Kuramoto oscillators connected through higher-order interactions. Our method embeds a higher-order Kuramoto model into a suitable Hamiltonian flow, and builds up on previous work in Hamiltonian control theory to analytically construct a feedback control mechanism. We numerically show that the proposed method effectively prevents synchronization. Although our findings indicate that pairwise contributions in the feedback loop are often sufficient, the higher-order generalization becomes crucial when pairwise coupling is weak. Finally, we explore the minimum number of controlled nodes required to fully desynchronize oscillators coupled via an all-to-all hypergraphs.

While typical qualitative T1-weighted magnetic resonance images reflect scanner and protocol differences, quantitative T1 mapping aims to measure T1 independent of these effects. Changes in T1 in the brain reflect chemical and physical changes in brain tissue, such as the demyelination of axons in multiple sclerosis. Magnetization-prepared two rapid acquisition gradient echo (MP2RAGE) is an acquisition protocol that allows for efficient T1 mapping with a much lower scan time per slice compared to multi-TI inversion recovery (IR) protocols. We collect and register B1-corrected MP2RAGE acquisitions with an additional inversion time (MP3RAGE) alongside multi-TI selective inversion recovery acquisitions for four subjects and find a tissue-dependent bias between the derived T1 values. We train a patch-based ResNet-18 to calibrate the MP3RAGE T1 values to the multi-TI IR T1 values, incorporating the standard deviation of T1 calculated from a Monte Carlo simulation as an additional channel. Across four folds, the error between the MP2RAGE and T1 maps varies substantially (RMSE in white matter: 0.30 +/- 0.01 seconds, subcortical gray matter: 0.26 +/- 0.02 seconds, cortical gray matter: 0.36 +/- 0.02 seconds). Our network reduces the RMSE significantly (RMSE in white matter: 0.11 +/- 0.02 seconds, subcortical gray matter: 0.10 +/- 0.02 seconds, cortical gray matter: 0.17 +/- 0.03 seconds). Adding the standard deviation channel does not substantially change the RMSE. Using limited paired training data from both sequences, we can reduce the error between quantitative imaging methods and calibrate to one of the protocols with a neural network., Comment: 20 pages, 10 figures. Submitted to Magnetic Resonance Imaging

Real-time control (RTC) is pivotal for any Adaptive Optics (AO) system, including high-contrast imaging of exoplanets and circumstellar environments. It is the brain of the AO system, and what wavefront sensing and control (WFS\&C) techniques need to work with to achieve unprecedented image quality and contrast, ultimately advancing our understanding of exoplanetary systems in the context of high contrast imaging (HCI). Developing WFS\&C algorithms first happens in simulation or a lab before deployment on-sky. The transition to on-sky testing is often challenging due to the different RTCs used. Sharing common RTC standards across labs and telescope instruments would considerably simplify this process. A data architecture based on the interprocess communication method known as shared memory is ideally suited for this purpose. The CACAO package, an example of RTC based on shared memory, was initially developed for the Subaru-SCExAO instrument and now deployed on several benches and instruments. This proceeding discusses the challenges, requirements, implementation strategies, and performance evaluations associated with integrating a shared memory-based RTC. The Santa Cruz Extreme AO Laboratory (SEAL) bench is a platform for WFS\&C development for large ground-based segmented telescopes. Currently, SEAL offers the user a non-real-time version of CACAO, a shared-memory based RTC package initially developed for the Subaru-SCExAO instrument, and now deployed on several benches and instruments. We show here the example of the SEAL RTC upgrade as a precursor to both RTC upgrade at the 3-m Shane telescopes at Lick Observatory (Shane-AO) and a future development platform for the Keck II AO. This paper is aimed at specialists in AO, astronomers, and WFS\&C scientists seeking a deeper introduction to the world of RTCs., Comment: SPIE Astronomical Telescope and Intrumentation 2024

Students often drift in and out of focus during class. Effective teachers recognize this and re-engage them when necessary. With the shift to remote learning, teachers have lost the visual feedback needed to adapt to varying student engagement. We propose using readily available front-facing video to infer attention levels based on movements of the eyes, head, and face. We train a deep learning model to predict a measure of attention based on overt eye movements. Specifically, we measure Inter-Subject Correlation of eye movements in ten-second intervals while students watch the same educational videos. In 3 different experiments (N=83) we show that the trained model predicts this objective metric of attention on unseen data with $R^2$=0.38, and on unseen subjects with $R^2$=0.26-0.30. The deep network relies mostly on a student's eye movements, but to some extent also on movements of the brows, cheeks, and head. In contrast to Inter-Subject Correlation of the eyes, the model can estimate attentional engagement from individual students' movements without needing reference data from an attentive group. This enables a much broader set of online applications. The solution is lightweight and can operate on the client side, which mitigates some of the privacy concerns associated with online attention monitoring. GitHub implementation is available at https://github.com/asortubay/timeISC, Comment: 10 pages, 3 figures

The empirical wavelet transform is a fully adaptive time-scale representation that has been widely used in the last decade. Inspired by the empirical mode decomposition, it consists of filter banks based on harmonic mode supports. Recently, it has been generalized to build the filter banks from any generating function using mappings. In practice, the harmonic mode supports can have low constrained shape in 2D, leading to numerical difficulties to compute the mappings and therefore the related wavelet filters. This work aims to propose an efficient numerical scheme to compute empirical wavelet coefficients using the demons registration algorithm. Results show that the proposed approach gives a numerically robust wavelet transform. An application to texture segmentation of scanning tunnelling microscope images is also presented.

The translation of imaging Mueller polarimetry to clinical practice is often hindered by large footprint and relatively slow acquisition speed of the existing instruments. Using polarization-sensitive camera as a detector may reduce instrument dimensions and allow data streaming at video rate. However, only the first three rows of a complete 4x4 Mueller matrix can be measured. To overcome this hurdle we developed a machine learning approach using sequential neural network algorithm for the reconstruction of missing elements of a Mueller matrix from the measured elements of the first three rows. The algorithm was trained and tested on the dataset of polarimetric images of various excised human tissues (uterine cervix, colon, skin, brain) acquired with two different imaging Mueller polarimeters operating in either reflection (wide-field imaging system) or transmission (microscope) configurations at different wavelengths of 550 nm and 385 nm, respectively. The reconstruction performance was evaluated using various error metrics, all of which confirmed low error values. The execution time of the trained neural network algorithm was about 300 microseconds for a single image pixel. It suggests that a machine learning approach with parallel processing of all image pixels combined with the partial Mueller polarimeter operating at video rate can effectively substitute for the complete Mueller polarimeter and produce accurate maps of depolarization, linear retardance and orientation of the optical axis of biological tissues, which can be used for medical diagnosis in clinical settings.

Finite element method applications are a common approach to simulate a handful of phenomena but can take a lot of computing power, causing elevated waiting time to produce precise results. The radiofrequency ablation finite element method is an application to simulate the medical procedure of radiofrequency ablation, a minimally invasive liver cancer treatment. The application runs sequentially and can take up to 20 hours of execution to generate 15 minutes of simulation results. Most of this time arises from the need to solve a sparse system of linear equations. In this work, we accelerate this application by using three sparse solvers packages (MAGMA cuSOLVER, and QRMumps), including direct and iterative methods over different multicore and GPU architectures. We conducted a numerical result analysis to access the solution quality provided by the distinct solvers and their configurations, proposing the use of the peak signal-to-noise ratio metric. We were able to reduce the application execution time up to 40 times compared to the original sequential version while keeping a similar numerical quality for the results., Comment: 8 pages, 11 figures

Many cells face search problems, such as finding food, mates or shelter, where their success depends on their search strategy. In contrast to other unicellular organisms, the slime mold Physarum polycephalum forms a giant network-shaped plasmodium while foraging for food. What is the advantage of the giant cell on the verge of multicellularity? We experimentally study and quantify the migration behavior of P. polycephalum plasmodia on the time scale of days in the absence and presence of food. We develop a model which successfully describes its migration in terms of ten data-derived parameters. Using the mechanistic insights provided by our data-driven model, we find that regardless of the absence or presence of food, P. polycephalum achieves superdiffusive migration by performing a self-avoiding run-and-tumble movement. In the presence of food, the run duration statistics change, only controlling the short-term migration dynamics. However, varying organism size, we find that the long-term superdiffusion arises from self-avoidance determined by cell size, highlighting the potential evolutionary advantage that this macroscopically large cell may have., Comment: 10 pages, 4 figures

Teams of mobile [aerial, ground, or aquatic] robots have applications in resource delivery, patrolling, information-gathering, agriculture, forest fire fighting, chemical plume source localization and mapping, and search-and-rescue. Robot teams traversing hazardous environments -- with e.g. rough terrain or seas, strong winds, or adversaries capable of attacking or capturing robots -- should plan and coordinate their trails in consideration of risks of disablement, destruction, or capture. Specifically, the robots should take the safest trails, coordinate their trails to cooperatively achieve the team-level objective with robustness to robot failures, and balance the reward from visiting locations against risks of robot losses. Herein, we consider bi-objective trail-planning for a mobile team of robots orienteering in a hazardous environment. The hazardous environment is abstracted as a directed graph whose arcs, when traversed by a robot, present known probabilities of survival. Each node of the graph offers a reward to the team if visited by a robot (which e.g. delivers a good to or images the node). We wish to search for the Pareto-optimal robot-team trail plans that maximize two [conflicting] team objectives: the expected (i) team reward and (ii) number of robots that survive the mission. A human decision-maker can then select trail plans that balance, according to their values, reward and robot survival. We implement ant colony optimization, guided by heuristics, to search for the Pareto-optimal set of robot team trail plans. As a case study, we illustrate with an information-gathering mission in an art museum., Comment: v0.0

In 2014, Vesti proposed the problem of determining the repetition threshold for infinite rich words, i.e., for infinite words in which all factors of length $n$ contain $n$ distinct nonempty palindromic factors. In 2020, Currie, Mol, and Rampersad proved a conjecture of Baranwal and Shallit that the repetition threshold for binary rich words is $2 + \sqrt{2}/2$. In this paper, we prove a structure theorem for $16/7$-power-free ternary rich words. Using the structure theorem, we deduce that the repetition threshold for ternary rich words is $1 + 1/(3 - \mu) \approx 2.25876324$, where $\mu$ is the unique real root of the polynomial $x^3 - 2x^2 - 1$., Comment: 60 pages

Advances in microscopy imaging enable researchers to visualize structures at the nanoscale level thereby unraveling intricate details of biological organization. However, challenges such as image noise, photobleaching of fluorophores, and low tolerability of biological samples to high light doses remain, restricting temporal resolutions and experiment durations. Reduced laser doses enable longer measurements at the cost of lower resolution and increased noise, which hinders accurate downstream analyses. Here we train a denoising diffusion probabilistic model (DDPM) to predict high-resolution images by conditioning the model on low-resolution information. Additionally, the probabilistic aspect of the DDPM allows for repeated generation of images that tend to further increase the signal-to-noise ratio. We show that our model achieves a performance that is better or similar to the previously best-performing methods, across four highly diverse datasets. Importantly, while any of the previous methods show competitive performance for some, but not all datasets, our method consistently achieves high performance across all four data sets, suggesting high generalizability.

About seven years ago, Volvo Cars initiated a large-scale agile transformation. Midst this journey, a significant restructuring of the R&D department took place. Our study aims to illuminate how team maturity levels are impacted during such comprehensive reorganizations. We collected data from 63 teams to comprehend the effects of organizational changes on these agile teams. Additionally, qualitative data was gathered to validate our findings and explore underlying reasons. Contrary to what was expected, the reorganization did not significantly alter the distribution of team maturity. High turnover rates and frequent reorganizations were identified as key factors to why the less mature teams remained in the early stages of team development. Conversely, teams in the second category remained stable at a higher maturity stage, primarily because the teams themselves remained largely intact, with only management structures changing. In conclusion, while reorganizations may hinder some teams' development, others maintain stability at a higher level of maturity despite substantial managerial changes.

From 2019 to 2022, Volvo Cars successfully translated our research discoveries regarding group dynamics within agile teams into widespread industrial practice. We wish to illuminate the insights gained through the process of garnering support, providing training, executing implementation, and sustaining a tool embraced by approximately 700 teams and 9,000 employees. This tool was designed to empower agile teams and propel their internal development. Our experiences underscore the necessity of comprehensive team training, the cultivation of a cadre of trainers across the organization, and the creation of a novel software solution. In essence, we deduce that an automated concise survey tool, coupled with a repository of actionable strategies, holds remarkable potential in fostering the maturation of agile teams, but we also share many of the challenges we encountered during the implementation.

The theory of linear time invariant systems is well established and allows, among other things, to formulate and solve control problems in finite time. In this context the control laws are typically taken in a space of the form L^p(0,T;U). In this paper we consider the possibility of taking control laws in (H^1(0,T;U))* , which induces non-trivial issues. We overcome these difficulties by adapting the functional setting, notably by considering a generalized final state for the systems under consideration. In addition we collect time regularity properties and we pretend that in general it is not possible to consider control laws in H^{-1}(0,T;U). Then, we apply our results to propose an interpretation of the inifinite order of defect for an observability inequality, in terms of controllability properties.

Understanding and optimizing the design of helical micro-swimmers is crucial for advancing their application in various fields. This study presents an innovative approach combining Free-Form Deformation with Bayesian Optimization to enhance the shape of these swimmers. Our method facilitates the computation of generic swimmer shapes that achieve optimal average speed and efficiency. Applied to both monoflagellated and biflagellated swimmers, our optimization framework has led to the identification of new optimal shapes. These shapes are compared with biological counterparts, highlighting a diverse range of swimmers, including both pushers and pullers.

Leadership in agile teams is a collective responsibility where team members share leadership work based on expertise and skills. However, the understanding of leadership in this context is limited. This study explores the under-researched area of prototypical leadership, aiming to understand if and how leaders who are perceived as more representative of the team are more effective leaders. Qualitative interviews were conducted with eleven members of six agile software teams in five Swedish companies from various industries and sizes. In this study, the effectiveness of leadership was perceived as higher when it emerged from within the team or when leaders aligned with the group. In addition, leaders in managerial roles that align with the team's shared values and traits were perceived as more effective, contributing to overall team success.

Gaussian unitary transformations are generated by quadratic Hamiltonians, i.e., Hamiltonians containing quadratic terms in creations and annihilation operators, and are heavily used in many areas of quantum physics, ranging from quantum optics and condensed matter theory to quantum information and quantum field theory in curved spacetime. They are known to form a representation of the metaplectic and spin group for bosons and fermions, respectively. These groups are the double covers of the symplectic and special orthogonal group, respectively, and our goal is to analyze the behavior of the sign ambiguity that one needs to deal with when moving between these groups and their double cover. We relate this sign ambiguity to expectation values of the form $\langle 0|\exp{(-i\hat{H})}|0\rangle$, where $|0\rangle$ is a Gaussian state and $\hat{H}$ an arbitrary quadratic Hamiltonian. We provide closed formulas for $\langle 0|\exp{(-i\hat{H})}|0\rangle$ and show how we can efficiently describe group multiplications in the double cover without the need of going to a faithful representation on an exponentially large or even infinite-dimensional space. Our construction relies on an explicit parametrization of these two groups (metaplectic, spin) in terms of symplectic and orthogonal group elements together with a twisted U(1) group., Comment: 35+3 pages, 8 figures

We developed a jitted compiler for training Artificial Neural Networks using C++, LLVM and Cuda. It features object-oriented characteristics, strong typing, parallel workers for data pre-processing, pythonic syntax for expressions, PyTorch like model declaration and Automatic Differentiation. We implement the mechanisms of cache and pooling in order to manage VRAM, cuBLAS for high performance matrix multiplication and cuDNN for convolutional layers. Our experiments with Residual Convolutional Neural Networks on ImageNet, we reach similar speed but degraded performance. Also, the GRU network experiments show similar accuracy, but our compiler have degraded speed in that task. However, our compiler demonstrates promising results at the CIFAR-10 benchmark, in which we reach the same performance and about the same speed as PyTorch. We make the code publicly available at: https://github.com/NoSavedDATA/NoSavedKaleidoscope, Comment: 12 pages, 3 figures and 3 tables

The variety of today's multicore architectures motivates researchers to explore parallel scientific applications on different platforms. Load imbalance is one performance issue that can prejudice parallel applications from exploiting the computational power of these platforms. Ondes3D is a scientific application for seismic wave simulation used to assess the geological impact of earthquakes. Its parallelism relies on applying a regular domain decomposition in the geological domain provided and distributing each sub-domain to MPI ranks. Previous works investigate the significant spatial and temporal imbalance in Ondes3D and suggest new parallelization and load balancing techniques to minimize them. However, none explored its execution on different architectures. Our paper evaluates the performance of Ondes3D for two earthquake scenarios on eight different multicore architectures, including Intel, AMD, and ARM processors. We measure the load distribution per MPI rank, evaluate the temporal load imbalance, and compare the execution of the application's kernels. Our results show that the temporal load imbalance in Ondes3D depends on the architecture chosen, with some platforms minimizing such imbalance more effectively., Comment: The 2020 International Conference on High Performance Computing and Simulation (HPCS 2020)

Implementing visual and audio notifications on augmented reality devices is a crucial element of intuitive and easy-to-use interfaces. In this paper, we explored creating intuitive interfaces through visual and audio notifications. The study evaluated user performance and preference across three conditions: visual notifications in fixed positions, visual notifications above objects, and no visual notifications with monaural sounds. The users were tasked with cooking and serving customers in an open-source Augmented-Reality sandbox environment called ARtisan Bistro. The results indicated that visual notifications above objects combined with localized audio feedback were the most effective and preferred method by participants. The findings highlight the importance of strategic placement of visual and audio notifications in AR, providing insights for engineers and developers to design intuitive 3D user interfaces.

There is growing evidence of the effectiveness of Shampoo, a higher-order preconditioning method, over Adam in deep learning optimization tasks. However, Shampoo's drawbacks include additional hyperparameters and computational overhead when compared to Adam, which only updates running averages of first- and second-moment quantities. This work establishes a formal connection between Shampoo (implemented with the 1/2 power) and Adafactor -- a memory-efficient approximation of Adam -- showing that Shampoo is equivalent to running Adafactor in the eigenbasis of Shampoo's preconditioner. This insight leads to the design of a simpler and computationally efficient algorithm: $\textbf{S}$hampo$\textbf{O}$ with $\textbf{A}$dam in the $\textbf{P}$reconditioner's eigenbasis (SOAP). With regards to improving Shampoo's computational efficiency, the most straightforward approach would be to simply compute Shampoo's eigendecomposition less frequently. Unfortunately, as our empirical results show, this leads to performance degradation that worsens with this frequency. SOAP mitigates this degradation by continually updating the running average of the second moment, just as Adam does, but in the current (slowly changing) coordinate basis. Furthermore, since SOAP is equivalent to running Adam in a rotated space, it introduces only one additional hyperparameter (the preconditioning frequency) compared to Adam. We empirically evaluate SOAP on language model pre-training with 360m and 660m sized models. In the large batch regime, SOAP reduces the number of iterations by over 40% and wall clock time by over 35% compared to AdamW, with approximately 20% improvements in both metrics compared to Shampoo. An implementation of SOAP is available at https://github.com/nikhilvyas/SOAP.

According to Boltzmann-Gibbs (BG) statistical mechanics, the thermodynamic response, such as the isothermal susceptibility, at critical points (CPs) presents a divergent-like behavior. An appropriate parameter to probe both classical and quantum CPs is the so-called Gr\"uneisen ratio $\Gamma$. Motivated by the results reported in Phys. Rev. B $\textbf{108}$, L140403 (2023), we extend the quantum version of $\Gamma$ to the non-additive $q$-entropy $S_q$. Our findings indicate that using $S_q$ at the unique value of $q$ restoring the extensivity of the entropy, $\Gamma$ is universally non-diverging at CPs. We unprecedentedly introduce $\Gamma$ in terms of $S_q$, being BG recovered for $q \rightarrow 1$. We thus solve a long-standing problem related to the $\textit{illusory}$ diverging susceptibilities at CPs., Comment: 5 pages, 3 figs, comments are welcome

k-Contact geometry appeared as a generalisation of contact geometry to analyse field theories. This work provides a new insightful approach to k-contact geometry by devising a theory of k-contact forms and proving that the kernel of a k-contact form is locally equivalent to a distribution of corank k that is distributionally maximally non-integrable and admits k commuting Lie symmetries: a so-called k-contact distribution. Compact manifolds admitting a global k-contact form are analysed, we give necessary topological conditions for their existence, k-contact Lie groups are defined and studied, we extend the Weinstein conjecture for the existence of closed orbits of Reeb vector fields in compact manifolds to the k-contact setting after studying compact low-dimensional manifolds endowed with a global k-contact form, and we provide some physical applications of some of our results. Polarisations for k-contact distributions are introduced and it is shown that a polarised k-contact distribution is locally diffeomorphic to the Cartan distribution of the first-order jet bundle over a fibre bundle of order k, which is a globally defined polarised k-contact distribution. Then, we relate k-contact manifolds to presymplectic and k-symplectic manifolds on fibre bundles of larger dimension and define for the first time types of submanifolds in k-contact geometry. We also review the theory of Hamiltonian k-vector fields, studying Hamilton-De Donder-Weyl equations in general and in Lie groups, which are here studied in an unprecedented manner. A theory of k-contact Hamiltonian vector fields is developed, which describes the theory of characteristics for Lie symmetries for first-order partial differential equations in a k-contact Hamiltonian manner. Our new Hamiltonian k-contact techniques are illustrated by analysing Hamilton-Jacobi and Dirac equations., Comment: 59 pp