Search

The challenges in dense ultra-reliable low-latency communication networks to deliver the required service to multiple devices are addressed by three main technologies: multiple antennas at the base station (MISO), rate splitting multiple access (RSMA) with private and common message encoding, and simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RIS). Careful resource allocation, encompassing beamforming and RIS optimization, is required to exploit the synergy between the three. We propose an alternating optimization-based algorithm, relying on minorization-maximization. Numerical results show that the achievable second-order max-min rates of the proposed scheme outperform the baselines significantly. MISO, RSMA, and STAR-RIS all contribute to enabling ultra-reliable low-latency communication (URLLC)., Comment: Accepted at 2025 International Conference on Mobile and Miniaturized Terahertz Systems (ICMMTS)

This paper presents the winning solution of task 1 and the third-placed solution of task 3 of the BraTS challenge. The use of automated tools in clinical practice has increased due to the development of more and more sophisticated and reliable algorithms. However, achieving clinical standards and developing tools for real-life scenarios is a major challenge. To this end, BraTS has organised tasks to find the most advanced solutions for specific purposes. In this paper, we propose the use of synthetic data to train state-of-the-art frameworks in order to improve the segmentation of adult gliomas in a post-treatment scenario, and the segmentation of meningioma for radiotherapy planning. Our results suggest that the use of synthetic data leads to more robust algorithms, although the synthetic data generation pipeline is not directly suited to the meningioma task. In task 1, we achieved a DSC of 0.7900, 0.8076, 0.7760, 0.8926, 0.7874, 0.8938 and a HD95 of 35.63, 30.35, 44.58, 16.87, 38.19, 17.95 for ET, NETC, RC, SNFH, TC and WT, respectively and, in task 3, we achieved a DSC of 0.801 and HD95 of 38.26, in the testing phase. The code for these tasks is available at https://github.com/ShadowTwin41/BraTS_2023_2024_solutions.

We develop the barycenter technique of Besson--Courtois--Gallot so that it can be applied on RCD metric measure spaces. Given a continuous map $f$ from a non-collapsed RCD$(-(N-1),N)$ space $X$ without boundary to a locally symmetric $N$-manifold we show a version of BCG's entropy-volume inequality. The lower bound involves homological and homotopical indices which we introduce. We prove that when equality holds and these indices coincide $X$ is a locally symmetric manifold, and $f$ is homotopic to a Riemannian covering whose degree equals the indices. Moreover, we show a measured Gromov--Hausdorff stability of $X$ and $Y$ involving the homotopical invariant. As a byproduct, we extend a Lipschitz volume rigidity result of Li--Wang to RCD$(K,N)$ spaces without boundary. Finally, we include an application of these methods to the study of Einstein metrics on $4$-orbifolds.

Accurate, efficient, and robust state estimation is more important than ever in robotics as the variety of platforms and complexity of tasks continue to grow. Historically, discrete-time filters and smoothers have been the dominant approach, in which the estimated variables are states at discrete sample times. The paradigm of continuous-time state estimation proposes an alternative strategy by estimating variables that express the state as a continuous function of time, which can be evaluated at any query time. Not only can this benefit downstream tasks such as planning and control, but it also significantly increases estimator performance and flexibility, as well as reduces sensor preprocessing and interfacing complexity. Despite this, continuous-time methods remain underutilized, potentially because they are less well-known within robotics. To remedy this, this work presents a unifying formulation of these methods and the most exhaustive literature review to date, systematically categorizing prior work by methodology, application, state variables, historical context, and theoretical contribution to the field. By surveying splines and Gaussian processes together and contextualizing works from other research domains, this work identifies and analyzes open problems in continuous-time state estimation and suggests new research directions., Comment: Submitted to IEEE Transactions on Robotics (T-RO)

Differentiable simulators provide analytic gradients, enabling more sample-efficient learning algorithms and paving the way for data intensive learning tasks such as learning from images. In this work, we demonstrate that locomotion policies trained with analytic gradients from a differentiable simulator can be successfully transferred to the real world. Typically, simulators that offer informative gradients lack the physical accuracy needed for sim-to-real transfer, and vice-versa. A key factor in our success is a smooth contact model that combines informative gradients with physical accuracy, ensuring effective transfer of learned behaviors. To the best of our knowledge, this is the first time a real quadrupedal robot is able to locomote after training exclusively in a differentiable simulation., Comment: Presented at the CoRL 2024 Workshop 'Differentiable Optimization Everywhere'

We present a framework for Multi-Robot Task Allocation (MRTA) in heterogeneous teams performing long-endurance missions in dynamic scenarios. Given the limited battery of robots, especially in the case of aerial vehicles, we allow for robot recharges and the possibility of fragmenting and/or relaying certain tasks. We also address tasks that must be performed by a coalition of robots in a coordinated manner. Given these features, we introduce a new class of heterogeneous MRTA problems which we analyze theoretically and optimally formulate as a Mixed-Integer Linear Program. We then contribute a heuristic algorithm to compute approximate solutions and integrate it into a mission planning and execution architecture capable of reacting to unexpected events by repairing or recomputing plans online. Our experimental results show the relevance of our newly formulated problem in a realistic use case for inspection with aerial robots. We assess the performance of our heuristic solver in comparison with other variants and with exact optimal solutions in small-scale scenarios. In addition, we evaluate the ability of our replanning framework to repair plans online., Comment: 20 pages, 10 figures

Evaluating the performance of classifiers is critical in machine learning, particularly in high-stakes applications where the reliability of predictions can significantly impact decision-making. Traditional performance measures, such as accuracy and F-score, often fail to account for the uncertainty inherent in classifier predictions, leading to potentially misleading assessments. This paper introduces the Certainty Ratio ($C_\rho$), a novel metric designed to quantify the contribution of confident (certain) versus uncertain predictions to any classification performance measure. By integrating the Probabilistic Confusion Matrix ($CM^\star$) and decomposing predictions into certainty and uncertainty components, $C_\rho$ provides a more comprehensive evaluation of classifier reliability. Experimental results across 21 datasets and multiple classifiers, including Decision Trees, Naive-Bayes, 3-Nearest Neighbors, and Random Forests, demonstrate that $C_\rho$ reveals critical insights that conventional metrics often overlook. These findings emphasize the importance of incorporating probabilistic information into classifier evaluation, offering a robust tool for researchers and practitioners seeking to improve model trustworthiness in complex environments.

The Bondi-Hoyle-Lyttleton (BHL) accretion model is widely used to describe how a compact object accretes material from a companion's stellar wind in binary systems. However, its standard implementation becomes inaccurate when the wind velocity ($v_\mathrm{w}$) is comparable to or less than the orbital velocity ($v_\mathrm{o}$), predicting non-physical accretion efficiencies above unity. This limits its applicability to systems with low wind-to-orbital velocity ratios ($w= v_\mathrm{w} / v_\mathrm{o} \leq 1$), such as symbiotic systems. We revisit the implementation of the BHL model and introduce a geometric correction factor that accounts for the varying orientation of the accretion cylinder relative to the wind direction. This correction ensures physically plausible accretion efficiencies ($\eta \leq 1$) for all $w$ in circular orbits. Our new implementation naturally predicts the flattening of the accretion efficiency observed in numerical simulations for $w < 1$, without the need for ad hoc adjustments. We also peer into the implications of our prescription for the less-explored case of eccentric orbits, highlighting the key role of the geometric correction factor in shaping the accretion process. We compare our predictions with numerical simulations, finding good agreement for a wide range of parameters. Applications to the symbiotic star R~Aqr and the X-ray binary LS 5039 are presented. This improved implementation offers a more accurate description of wind accretion in binary systems, with implications for stellar evolution, population synthesis, and observational data interpretation., Comment: 16 pages, 2 Tables, 11 Figures; Accepted to ApJ

We present and analyze two stabilized finite element methods for solving numerically the Poisson--Nernst--Planck equations. The stabilization we consider is carried out by using a shock detector and a discrete graph Laplacian operator for the ion equations, whereas the discrete equation for the electric potential need not be stabilized. Discrete solutions stemmed from the first algorithm preserve both maximum and minimum discrete principles. For the second algorithm, its discrete solutions are conceived so that they hold discrete principles and obey an entropy law provided that an acuteness condition is imposed for meshes. Remarkably the latter is found to be unconditionally stable. We validate our methodology through numerical experiments., Comment: 29 pages, 25 figures

Feature Selection techniques aim at finding a relevant subset of features that perform equally or better than the original set of features at explaining the behavior of data. Typically, features are extracted from feature ranking or subset selection techniques, and the performance is measured by classification or regression tasks. However, while selected features may not have equal importance for the task, they do have equal importance for each class. This work first introduces a comprehensive review of the concept of class-specific, with a focus on feature selection and classification. The fundamental idea of the class-specific concept resides in the understanding that the significance of each feature can vary from one class to another. This contrasts with the traditional class-independent approach, which evaluates the importance of attributes collectively for all classes. For example, in tumor prediction scenarios, each type of tumor may be associated with a distinct subset of relevant features. These features possess significant discriminatory power, enabling the differentiation of one tumor type from others. This class-specific perspective offers a more effective approach to classification tasks by recognizing and leveraging the unique characteristics of each class. Secondly, classification schemes from one-versus-all and one-versus-each strategies are described, and a novel deep one-versus-each strategy is introduced, which offers advantages from the point of view of explainability (feature selection) and decomposability (classification). Thirdly, a novel class-specific relevance matrix is presented, from which some more sophisticated classification schemes can be derived, such as the three-layer class-specific scheme. The potential for further advancements is wide and will open new horizons for exploring novel research directions in multiclass hyperdimensional contexts.

In today's data-intensive landscape, where high-dimensional datasets are increasingly common, reducing the number of input features is essential to prevent overfitting and improve model accuracy. Despite numerous efforts to tackle dimensionality reduction, most approaches apply a universal set of features across all classes, potentially missing the unique characteristics of individual classes. This paper presents the Explainable Class-Specific Naive Bayes (XNB) classifier, which introduces two critical innovations: 1) the use of Kernel Density Estimation to calculate posterior probabilities, allowing for a more accurate and flexible estimation process, and 2) the selection of class-specific feature subsets, ensuring that only the most relevant variables for each class are utilized. Extensive empirical analysis on high-dimensional genomic datasets shows that XNB matches the classification performance of traditional Naive Bayes while drastically improving model interpretability. By isolating the most relevant features for each class, XNB not only reduces the feature set to a minimal, distinct subset for each class but also provides deeper insights into how the model makes predictions. This approach offers significant advantages in fields where both precision and explainability are critical.

For a finite group $H$ and connected topological spaces $X$ and $Y$ such that $X$ is endowed with a free left $H$-action $\tau$, we provide a geometric condition in terms of the existence of a commutative diagram of spaces (arising from the triple $(X,Y;\tau)$) to decide whether the Borsuk--Ulam property holds for based homotopy classes $\alpha\in[X,Y]_0$, as well as for free homotopy classes $\alpha\in[X,Y]$. Here, a homotopy class $\alpha$ is said to satisfy the Borsuk--Ulam property if, for each of its representatives $f\in\alpha$, there exists an $H$-orbit where $f$ fails to be injective. Our geometric characterization is attained by constructing an $H$-equivariant map from $X$ to the classical configuration space $F_{|H|}(Y)$. We derive an algebraic condition from the geometric characterisation, and show that the former one is in fact equivalent to the latter one when $X$ and $Y$ are aspherical. We then specialize to the 1-dimensional case, i.e., when $X$ is an arbitrary connected graph, $H$ is cyclic, and $Y$ is either an interval, a circle, or their wedge sum. The graph-braid-group ingredient in our characterizations is then effectively controlled through the use of discrete Morse theory., Comment: 22 pages

The aim of this study is to implement a method to remove ambient noise in biomedical sounds captured in auscultation. We propose an incremental approach based on multichannel non-negative matrix partial co-factorization (NMPCF) for ambient denoising focusing on high noisy environment with a Signal-to-Noise Ratio (SNR) <= -5 dB. The first contribution applies NMPCF assuming that ambient noise can be modelled as repetitive sound events simultaneously found in two single-channel inputs captured by means of different recording devices. The second contribution proposes an incremental algorithm, based on the previous multichannel NMPCF, that refines the estimated biomedical spectrogram throughout a set of incremental stages by eliminating most of the ambient noise that was not removed in the previous stage at the expense of preserving most of the biomedical spectral content. The ambient denoising performance of the proposed method, compared to some of the most relevant state-of-the-art methods, has been evaluated using a set of recordings composed of biomedical sounds mixed with ambient noise that typically surrounds a medical consultation room to simulate high noisy environments with a SNR from -20 dB to -5 dB. Experimental results report that: (i) the performance drop suffered by the proposed method is lower compared to MSS and NLMS; (ii) unlike what happens with MSS and NLMS, the proposed method shows a stable trend of the average SDR and SIR results regardless of the type of ambient noise and the SNR level evaluated; and (iii) a remarkable advantage is the high robustness of the estimated biomedical sounds when the two single-channel inputs suffer from a delay between them.

The Variational Quantum Eigensolver (VQE) is a promising hybrid algorithm, utilizing both quantum and classical computers to obtain the ground state energy of molecules. In this context, this study applies VQE to investigate the ground state of protocatechuic acid, analyzing its performance with various Ans\"atze and active spaces. Subsequently, all VQE results were compared to those obtained with the Hartree-Fock (HF) method. The results demonstrate that Ans\"atze, like unitary coupled-cluster singles and doubles (UCCSD) and variations of Hardware-Efficient, generally achieve accuracy close to that of HF. Furthermore, the increase in active space has led to the models becoming more difficult to converge to values with a greater distance from the correct energy. In summary, the findings of this study reinforce the use of VQE as a powerful tool for analyzing molecular ground state energies. Finally, the results underscore the critical importance of Ansatz selection and active space size in VQE performance, providing valuable insights into its potential and limitations., Comment: 10 pages, 6 figures, 1 table

Galaxies grow through star formation (in-situ) and accretion (ex-situ) of other galaxies. Reconstructing the relative contribution of these two growth channels is crucial for constraining the processes of galaxy formation in a cosmological context. In this on-going work, we utilize a conditional variational autoencoder along with a normalizing flow - trained on a state-of-the-art cosmological simulation - in an attempt to infer the posterior distribution of the 2D ex-situ stellar mass distribution of galaxies solely from observable two-dimensional maps of their stellar mass, kinematics, age and metallicity. Such maps are typically obtained from large Integral Field Unit Surveys such as MaNGA. We find that the average posterior provides an estimate of the resolved accretion histories of galaxies with a mean ~10% error per pixel. We show that the use of a normalizing flow to conditionally sample the latent space results in a smaller reconstruction error. Due to the probabilistic nature of our architecture, the uncertainty of our predictions can also be quantified. To our knowledge, this is the first attempt to infer the 2D ex-situ fraction maps from observable maps., Comment: 6 pages, 3 figures

The Calar Alto Void Integral-field Treasury surveY (CAVITY) is a legacy project aimed at characterising the population of galaxies inhabiting voids, which are the most under-dense regions of the cosmic web, located in the Local Universe. This paper describes the first public data release (DR1) of CAVITY, comprising science-grade optical data cubes for the initial 100 out of a total of $\sim$300 galaxies in the Local Universe ($0.005 < z < 0.050$). These data were acquired using the integral-field spectrograph PMAS/PPak mounted on the 3.5m telescope at the Calar Alto observatory. The DR1 galaxy sample encompasses diverse characteristics in the color-magnitude space, morphological type, stellar mass, and gas ionisation conditions, providing a rich resource for addressing key questions in galaxy evolution through spatially resolved spectroscopy. The galaxies in this study were observed with the low-resolution V500 set-up, spanning the wavelength range 3745-7500 \AA, with a spectral resolution of 6.0 \AA\ (FWHM). Here, we describe the data reduction and characteristics and data structure of the CAVITY datasets essential for their scientific utilisation, highlighting such concerns as vignetting effects, as well as the identification of bad pixels and management of spatially correlated noise. We also provide instructions for accessing the CAVITY datasets and associated ancillary data through the project's dedicated database., Comment: 17 pages, 9 figures, 5 tables. Accepted for publication in A&A (replacement after minor language edits)

Single-ion mass identification is important for atomic and nuclear physics experiments on ions produced with low yields. Cooling the ion to ultra-low temperatures by interacting with a laser-cooled ion will enhance the precision of the measurements. In this paper we present axial-common-mode frequency measurements of balanced and unbalanced Coulomb crystals from the Fourier transform of the fluorescence photons from a Doppler-cooling transition in calcium ions, after probing the ion/crystal with a 5-radiofrequency comb. A single ion non-destructively detected can be used for identification yielding a mass resolving power $m/\Delta m_\mathrm{FWHM}\approx 310$ from the axial common mode. This identification can be performed from a single measurement within times below one second., Comment: 6 pages, 4 figures

Modern digital applications extensively integrate Artificial Intelligence models into their core systems, offering significant advantages for automated decision-making. However, these AI-based systems encounter reliability and safety challenges when handling continuously generated data streams in complex and dynamic scenarios. This work explores the concept of resilient AI systems, which must operate in the face of unexpected events, including instances that belong to patterns that have not been seen during the training process. This is an issue that regular closed-set classifiers commonly encounter in streaming scenarios, as they are designed to compulsory classify any new observation into one of the training patterns (i.e., the so-called \textit{over-occupied space} problem). In batch learning, the Open Set Recognition research area has consistently confronted this issue by requiring models to robustly uphold their classification performance when processing query instances from unknown patterns. In this context, this work investigates the application of an Open Set Recognition framework that combines classification and clustering to address the \textit{over-occupied space} problem in streaming scenarios. Specifically, we systematically devise a benchmark comprising different classification datasets with varying ratios of known to unknown classes. Experiments are presented on this benchmark to compare the performance of the proposed hybrid framework with that of individual incremental classifiers. Discussions held over the obtained results highlight situations where the proposed framework performs best, and delineate the limitations and hurdles encountered by incremental classifiers in effectively resolving the challenges posed by open-world streaming environments., Comment: 12 pages, 3 figures, an updated version of this article is published in LNAI,volume 14857 as part of the conference proceedings HAIS 2024

The magnetised near detector (ND280) of the T2K long-baseline neutrino oscillation experiment has been recently upgraded aiming to satisfy the requirement of reducing the systematic uncertainty from measuring the neutrinonucleus interaction cross section, which is the largest systematic uncertainty in the search for leptonic charge-parity symmetry violation. A key component of the upgrade is SuperFGD, a 3D segmented plastic scintillator detector made of approximately 2,000,000 optically-isolated 1 cm3 cubes. It will provide a 3D image of GeV neutrino interactions by combining tracking and stopping power measurements of final state particles with sub-nanosecond time resolution. The performance of SuperFGD is characterized by the precision of its response to charged particles as well as the systematic effects that might affect the physics measurements. Hence, a detailed Geant4 based optical simulation of the SuperFGD building block, i.e. a plastic scintillating cube read out by three wavelength shifting fibers, has been developed and validated with the different datasets collected in various beam tests. In this manuscript the description of the optical model as well as the comparison with data are reported., Comment: 31 pages, 15 figures

We prove a regularized determinant formula for the zeta functions of certain 3-dimensional Riemannian foliated dynamical systems, in terms of the infinitesimal operator induced by the flow acting on the reduced leafwise cohomologies. It is the formula conjectured by Deninger. The proof is based on relating the dynamical spectral $\xi$-functions, analogues of the $\xi$-function in analytic number theory, with the zeta function, by applying the distributional dynamical Lefschetz trace formula.

A famous result in arithmetic Ramsey theory says that for many linear homogeneous equations $E$ there is a threshold value $R_k(E)$ (the Rado number of $E$) such that for any $k$-coloring of the integers in the interval $[1,n]$, with $n \ge R_k(E)$, there exists at least one monochromatic solution. But one can further ask, how many monochromatic solutions is the minimum possible in terms of $n$? Several authors have estimated this function before, here we offer new tools from integer and semidefinite optimization that help find either optimal or near optimal 2-colorings minimizing the number of monochromatic solutions of several families of 3-variable non-regular homogeneous linear equations. In the last part of the paper we further extend to three and more colors for the Schur equation, improving earlier work., Comment: 23 pages, 1 figure

This paper presents a new construction of non-Anosov Partially Hyperbolic Geodesic flows. Our construction is closely related to the construction made by Carneiro and Pujals, the novelty is the use of conformal deformations to produce the examples. Some of the necessary conditions appear more naturally and are easier to check. Besides that, we could enumerate the conditions required to produce partially hyperbolic geodesic flow examples. We show how to produce examples with metrics that are non-positively curved and with a finner analysis we can prove ergodicity for the Liouville measure and uniqueness of the measure of maximal entropy. These examples lie on the boundary of Anosov metrics, allowing us to also produce metrics with partially hyperbolic geodesic flows and conjugate points., Comment: 34 pages

We generalize the classic multi-agent DeGroot model for opinion dynamics to incorporate the Spiral of Silence theory from political science. This theory states that individuals may withhold their opinions when they perceive them to be in the minority. As in the DeGroot model, a community of agents is represented as a weighted directed graph whose edges indicate how much agents influence one another. However, agents whose current opinions are in the minority become silent (i.e., they do not express their opinion). Two models for opinion update are then introduced. In the memoryless opinion model ($\mbox{SOM}^-$), agents update their opinion by taking the weighted average of their non-silent neighbors' opinions. In the memory based opinion model ($\mbox{SOM}^+$), agents update their opinions by taking the weighted average of the opinions of all their neighbors, but for silent neighbors, their most recent opinion is considered. We show that for $\mbox{SOM}^-$ convergence to consensus is guaranteed for clique graphs but, unlike for the classic DeGroot, not guaranteed for strongly-connected aperiodic graphs. In contrast, we show that for $\mbox{SOM}^+$ convergence to consensus is not guaranteed even for clique graphs. We showcase our models through simulations offering experimental insights that align with key aspects of the Spiral of Silence theory. These findings reveal the impact of silence dynamics on opinion formation and highlight the limitations of consensus in more nuanced social models., Comment: 20 pages and 5 figures

We study the connections between ordinary differential equations and optimization algorithms in a non-Euclidean setting. We propose a novel accelerated algorithm for minimising convex functions over a convex constrained set. This algorithm is a natural generalization of Nesterov's accelerated gradient descent method to the non-Euclidean setting and can be interpreted as an additive Runge-Kutta algorithm. The algorithm can also be derived as a numerical discretization of the ODE appearing in Krichene et al. (2015a). We use Lyapunov functions to establish convergence rates for the ODE and show that the discretizations considered achieve acceleration beyond the setting studied in Krichene et al. (2015a). Finally, we discuss how the proposed algorithm connects to various equations and algorithms in the literature., Comment: 25 pages, 5 figures

A reference-based classification system for individual Scopus publications is presented which takes into account the categories of the papers citing those references instead of the journals in which those cited papers are published. It supports multiple assignments of up to 5 categories within the Scopus ASJC structure, but eliminates the Multidisciplinary Area and the miscellaneous categories, and it allows for the reclassification of a greater number of publications (potentially 100%) than traditional reference-based systems. Twelve variants of the system were obtained by adjusting different parameters, which were applied to the more than 3.2 million citable papers from the active Scientific Journals in 2020 indexed in Scopus. The results were analyzed and compared with other classification systems such as the original journal-based Scopus ASJC, the 2-generation-reference based M3-AWC-0.8 (\'Alvarez-Llorente et al., 2024), and the corresponding authors' assignment based AAC (\'Alvarez-Llorente et al., 2023). The different variants obtained of the classification give results that improve those used as referents in multiple scientometric fields. The variation called U1-F-0.8 seems especially promising due to its restraint in assigning multiple categories, consistency with reference classifications and the fact of applying normalization processes to avoid the overinfluence of articles that have a greater number of references.

Recent advancements in transition metal dichalcogenides (TMDs) have unveiled exceptional optical and electronic characteristics, opened up new opportunities, and provided a unique platform for exploring light-matter interactions under the strong coupling regime. The exploitation of exciton-polaritons, with their peculiar hybrid light-matter properties, for the development of spintronic customizable devices that enhance both the information capacity and functionality at ambient temperatures is often suggested as a promising route. However, although TMD polaritons have shown promising potential, the microscopic mechanisms leading to nonlinearities in TMD polaritons are complex and their spin-anisotropy, a crucial requirement for many proposed polaritonic devices, has been missing. Here, we demonstrate the absence of spin-anisotropic interaction in a monolayer WS2 microcavity (at room temperature) and show how spin-dependent interactions can be controlled and spin anisotropy recovered by engineering double WS2 layer structures with varied interlayer spacing. We attribute this phenomenon to a distinctive feature in exciton-polariton physics: layer-dependent polariton-phonon coupling. We use theoretical calculations of the phonon electrostatic potentials finding a drastically different coupling strength for single and double monolayer samples and discuss qualitatively how this explains the observed spin-anisotropic response. This is further consistent with experiments on multi WS2 layer samples and the identification of a critical separation distance, above which an effective single monolayer spin-anisotropic response is recovered, both in experiment and theory. Our work lays the groundwork for the development of spin-optronic polaritonic devices at room temperature.

The published method Generative Adversarial Networks for Recommender Systems (GANRS) allows generating data sets for collaborative filtering recommendation systems. The GANRS source code is available along with a representative set of generated datasets. We have tested the GANRS method by creating multiple synthetic datasets from three different real datasets taken as a source. Experiments include variations in the number of users in the synthetic datasets, as well as a different number of samples. We have also selected six state-of-the-art collaborative filtering deep learning models to test both their comparative performance and the GANRS method. The results show a consistent behavior of the generated datasets compared to the source ones; particularly, in the obtained values and trends of the precision and recall quality measures. The tested deep learning models have also performed as expected on all synthetic datasets, making it possible to compare the results with those obtained from the real source data. Future work is proposed, including different cold start scenarios, unbalanced data, and demographic fairness., Comment: 14 pages, 7 figures, In press

Matrix factorization models are the core of current commercial collaborative filtering Recommender Systems. This paper tested six representative matrix factorization models, using four collaborative filtering datasets. Experiments have tested a variety of accuracy and beyond accuracy quality measures, including prediction, recommendation of ordered and unordered lists, novelty, and diversity. Results show each convenient matrix factorization model attending to their simplicity, the required prediction quality, the necessary recommendation quality, the desired recommendation novelty and diversity, the need to explain recommendations, the adequacy of assigning semantic interpretations to hidden factors, the advisability of recommending to groups of users, and the need to obtain reliability values. To ensure the reproducibility of the experiments, an open framework has been used, and the implementation code is provided., Comment: 14 pages, 5 figures, 3 tables

Neural collaborative filtering is the state of art field in the recommender systems area; it provides some models that obtain accurate predictions and recommendations. These models are regression-based, and they just return rating predictions. This paper proposes the use of a classification-based approach, returning both rating predictions and their reliabilities. The extra information (prediction reliabilities) can be used in a variety of relevant collaborative filtering areas such as detection of shilling attacks, recommendations explanation or navigational tools to show users and items dependences. Additionally, recommendation reliabilities can be gracefully provided to users: "probably you will like this film", "almost certainly you will like this song", etc. This paper provides the proposed neural architecture; it also tests that the quality of its recommendation results is as good as the state of art baselines. Remarkably, individual rating predictions are improved by using the proposed architecture compared to baselines. Experiments have been performed making use of four popular public datasets, showing generalizable quality results. Overall, the proposed architecture improves individual rating predictions quality, maintains recommendation results and opens the doors to a set of relevant collaborative filtering fields., Comment: 9 pages, 7 figures

The low energy effective action describing the Kaluza-Klein reduction of string theory on a $d$-torus possesses a continuous O($d, d$) global symmetry. The non-geometric piece of this symmetry, parameterized by a bi-vector $\beta$, was recently shown to effectively act as a hidden symmetry on the massless RR and universal NSNS fields of the ten dimensional parent theory, fixing their couplings. Here we extend the analysis of this symmetry to the massless gauge and fermion fields of heterotic supergravity. While the interactions of the boson fields are univocally fixed by $\beta$ symmetry, we find four bilinear and two quartic $\beta$ invariant combinations of fermions whose relative coefficients in the action must be determined by supersymmetry. Although not fully fixed, bilinear and quartic fermion couplings are strongly restricted by $\beta$ symmetry at leading order in $\alpha'$., Comment: 18 pages

In this paper we prove that solutions to a transmission problem degenerating on the interface are H\"older differentiable up to the interface with universal estimates. Furthermore, we obtain a sharper pointwise $C^{1,\alpha(\cdot)}$ with optimal variable exponent and uniform estimates.

We show that if $p>1$ every subspace of $\ell_p(\Gamma)$ is an $\ell_p$-sum of separable subspaces of $\ell_p$, and we provide examples of subspaces of $\ell_p(\Gamma)$ for $0

Given a bilinear (or sub-bilinear) operator $B$, we prove restricted weighted weak type inequalities of the form $$ ||B(f_1, f_2)||_{L^{p, \infty}(w_1^{p/p_1}w_2^{p/p_2})}\lesssim ||f_1||_{L^{p_1, 1}(w_1)}||f_2||_{L^{p_2, 1}(w_2)}, $$ whenever $B(f_1, f_2)= (T_1f_1) (T_2 f_2)$ is the product of two singular integral operators satisfying Dini conditions. Additionally, we also establish, as an application, the boundedness of a certain class of bounded variation bilinear Fourier multipliers solving a question posted in [Bilinear Fourier multipliers of bounded variation; Int. Math. Res. Not. (2023), no.24, 21943--21975 by Baena-Miret, Carro, Luque and Sanchez-Pascuala]., Comment: 14 pages

Hybrid molecular ferroelectrics with orientationally disordered mesophases offer significant promise as lead-free alternatives to traditional inorganic ferroelectrics owing to properties such as room temperature ferroelectricity, low-energy synthesis, malleability, and potential for multiaxial polarization. The ferroelectric molecular salt HdabcoClO4 is of particular interest due to its ultrafast ferroelectric room-temperature switching. However, so far, there is limited understanding of the nature of dynamical disorder arising in these compounds. Here, we employ the neural network NeuralIL to train a machine-learned force field (MLFF) with training data generated using density functional theory. The resulting MLFF-MD simulations exhibit phase transitions and thermal expansion in line with earlier reported experimental results, for both a low-temperature phasetransition coinciding with the orientational disorder of ClO4- molecules and the onset of rotation of Hdabco+ and ClO4- molecules in a high-temperature phase transition. We also find proton transfer even in the low-temperature phase, which increases with temperature and leads to associated proton disorder as well as the onset of disorder in the direction of the hydrogen-bonded chains., Comment: 12 pages, 10 figures

We propose a self-contained, resilient and fully distributed solution for locating the maximum of an unknown 3D scalar field using a swarm of robots that travel at constant speeds. Unlike conventional reactive methods relying on gradient information, our methodology enables the swarm to determine an ascending direction so that it approaches the source with arbitrary precision. Our source-seeking solution consists of three algorithms. The first two algorithms run sequentially and distributively at a high frequency providing barycentric coordinates and the ascending direction respectively to the individual robots. The third algorithm is the individual control law for a robot to track the estimated ascending direction. We show that the two algorithms with higher frequency have an exponential convergence to their eventual values since they are based on the standard consensus protocol for first-order dynamical systems; their high frequency depends on how fast the robots travel through the scalar field. The robots are not constrained to any particular geometric formation, and we study both discrete and continuous distributions of robots within swarm shapes. The shape analysis reveals the resiliency of our approach as expected in robot swarms, i.e., by amassing robots we ensure the source-seeking functionality in the event of missing or misplaced individuals or even if the robot network splits into two or more disconnected subnetworks. In addition, we also enhance the robustness of the algorithm by presenting conditions for \emph{optimal} swarm shapes, in the sense that the ascending directions can be closely parallel to the field's gradient. We exploit such an analysis so that the swarm can adapt to unknown environments by morphing its shape and maneuvering while still following an ascending direction., Comment: 15 pages, submitted version to T-RO. This version does not contain the field experiments. arXiv admin note: text overlap with arXiv:2309.02937

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

Forecasting demand for assets and services can be addressed in various markets, providing a competitive advantage when the predictive models used demonstrate high accuracy. However, the training of machine learning models incurs high computational costs, which may limit the training of prediction models based on available computational capacity. In this context, this paper presents an approach for training demand prediction models using quantum neural networks. For this purpose, a quantum neural network was used to forecast demand for vehicle financing. A classical recurrent neural network was used to compare the results, and they show a similar predictive capacity between the classical and quantum models, with the advantage of using a lower number of training parameters and also converging in fewer steps. Utilizing quantum computing techniques offers a promising solution to overcome the limitations of traditional machine learning approaches in training predictive models for complex market dynamics., Comment: 22 pages, 13 figures, 10 tables

This paper deals with the long-term behaviour and incidence of a vaccine-preventable contact disease, under the assumption that both vaccine protection and immunity after recovery are not lifelong. The mathematical model is developed in a stochastic markovian framework. The evolution of the disease in a finite population is thus represented by a three-dimensional continuous-time Markov chain, which is versatile enough to be able to compensate for the loss of protection by including vaccination before the onset of the outbreak and also during the course of the epidemics.

New low-precision accelerators, vector instruction sets, and library functions make maximizing accuracy and performance of numerical code increasingly challenging. Two lines of work$\unicode{x2013}$traditional compilers and numerical compilers$\unicode{x2013}$attack this problem from opposite directions. Traditional compiler backends optimize for specific target environments but are limited in their ability to balance performance and accuracy. Numerical compilers trade off accuracy and performance, or even improve both, but ignore the target environment. We join aspects of both to produce Chassis, a target-aware numerical compiler. Chassis compiles mathematical expressions to operators from a target description, which lists the real expressions each operator approximates and estimates its cost and accuracy. Chassis then uses an iterative improvement loop to optimize for speed and accuracy. Specifically, a new instruction selection modulo equivalence algorithm efficiently searches for faster target-specific programs, while a new cost-opportunity heuristic supports iterative improvement. We demonstrate Chassis' capabilities on 9 different targets, including hardware ISAs, math libraries, and programming languages. Chassis finds better accuracy and performance trade-offs than both Clang (by 3.5x) or Herbie (by up to 2.0x) by leveraging low-precision accelerators, accuracy-optimized numerical helper functions, and library subcomponents.

Learning is a fundamental property of intelligent systems, observed across biological organisms and engineered systems. While modern intelligent systems typically rely on gradient descent for learning, the need for exact gradients and complex information flow makes its implementation in biological and neuromorphic systems challenging. This has motivated the exploration of alternative learning mechanisms that can operate locally and do not rely on exact gradients. In this work, we introduce a novel approach that leverages noise in the parameters of the system and global reinforcement signals. Using an Ornstein-Uhlenbeck process with adaptive dynamics, our method balances exploration and exploitation during learning, driven by deviations from error predictions, akin to reward prediction error. Operating in continuous time, Orstein-Uhlenbeck adaptation (OUA) is proposed as a general mechanism for learning dynamic, time-evolving environments. We validate our approach across diverse tasks, including supervised learning and reinforcement learning in feedforward and recurrent systems. Additionally, we demonstrate that it can perform meta-learning, adjusting hyper-parameters autonomously. Our results indicate that OUA provides a viable alternative to traditional gradient-based methods, with potential applications in neuromorphic computing. It also hints at a possible mechanism for noise-driven learning in the brain, where stochastic neurotransmitter release may guide synaptic adjustments.

In this paper, we address the vision-based autonomous landing problem in complex urban environments using deep neural networks for semantic segmentation and risk assessment. We propose employing the SegFormer, a state-of-the-art visual transformer network, for the semantic segmentation of complex, unstructured urban environments. This approach yields valuable information that can be utilized in smart autonomous landing missions, particularly in emergency landing scenarios resulting from system failures or human errors. The assessment is done in real-time flight, when images of an RGB camera at the Unmanned Aerial Vehicle (UAV) are segmented with the SegFormer into the most common classes found in urban environments. These classes are then mapped into a level of risk, considering in general, potential material damage, damaging the drone itself and endanger people. The proposed strategy is validated through several case studies, demonstrating the huge potential of semantic segmentation-based strategies to determining the safest landing areas for autonomous emergency landing, which we believe will help unleash the full potential of UAVs on civil applications within urban areas.

High computational power and the availability of large datasets have supported the development of Foundational Models. They are a new emerging technique widely used in Generative Artificial Intelligence, characterized by their scalability and their use in Transfer Learning. The enormous and heterogeneous amounts of data used in their initial training phase, known as pre-training, give them a higher generalization capacity than any other specific model, constituting a solid base that can be adapted or adjusted to a wide range of tasks, increasing their applicability. This study proposes LLIAM, the Llama Lora-Integrated Autorregresive Model. Low-Rank Adaptations are used to enhance the knowledge of the model with diverse time series datasets, known as the fine-tuning phase. To illustrate the capabilities of our proposal, two sets of experiments have been carried out that obtained favorable and promising results with lower training times than other Deep Learning approaches. With this work, we also encourage the use of available resources (such as these pre-trained models) to avoid unnecessary and costly training, narrowing the gap between the goals of traditional Artificial Intelligence and those specified by the definition of Green Artificial Intelligence.

We re-visit the generation and evolution of (Bell) nonlocality in hybrid scenarios whose dynamics is determined by the Jaynes-Cummings Hamiltonian, a relevant example of which is the atom-cavity system. Previous approaches evaluate the nonlocality through the well-known qubit-qubit CHSH formulae, using combinations of pseudospin operators for the electromagnetic (EM) field observables. While such approach is sensible, it is far from optimal. In the present work we have used recent results on the optimal Bell violation in qubit-qudit systems, showing that the nonlocality is much greater than previously estimated, both with and without noise. We perform also an optimal treatment of the noise, so our results are optimal in this sense as well. We illustrate the results using different initial states for the EM field, including squeezed and coherent states. In addition, we study the asymptotic behavior of the entanglement. Remarkably, starting with a generic separable (pure) coherent state, the asymptotic (mixed) state is entangled, though does not violate Bell inequalities., Comment: 11+3 pages, 3 figures