Search

Distributed massive multiple-input multiple-output networks utilize a large number of distributed access points (APs) to serve multiple user equipments (UEs), offering significant potential for both communication and localization. However, these networks require frequent phase and time calibration between distributed antennas due to oscillator phase drifts, crucial for reciprocity-based coherent beamforming and accurate localization. While this calibration is typically performed through bi-directional measurements between antennas, it can be simplified to unidirectional measurement under perfect knowledge of antenna locations. This paper extends a recent phase calibration narrowband line-of-sight (LoS) model to a phase and time calibration wideband orthogonal frequency division multiplexing model, including both LoS and reflection paths and allowing for joint phase and time calibrations. We explore different scenarios, considering whether or not prior knowledge of antenna locations and the map is available. For each case, we introduce a practical maximum likelihood estimator and conduct Cramer-Rao lower bound (CRLB) analyses to benchmark performance. Simulations validate our estimators against the CRLB in these scenarios., Comment: 6 pages, to appear in IEEE GLOBECOM 2024

To every non-extreme point $b$ of the unit ball of $\hil^\infty$ of the unit disk there corresponds a Pythagorean mate, a bounded outer function $a$ satisfying the equation $|a|^2 + |b|^2 = 1$ on the boundary of the disk. We study universal, i.e., simultaneous multipliers for families of de Branges-Rovnyak spaces $\hb$, and develop a general framework for this purpose. Our main results include a new proof of the Davis-McCarthy universal multiplier theorem for the class of all non-extreme spaces $\hb$, a characterization of the Lipschitz classes as the universal multipliers for spaces $\hb$ for which the quotient $b/a$ is contained in a Hardy space, and a similar characterization of the Gevrey classes as the universal multipliers for spaces $\hb$ for which $b/a$ is contained in a Privalov class.

6G networks aim to enable applications like autonomous driving by providing complementary localization services through key technologies such as non-terrestrial networks (NTNs) with low Earth orbit (LEO) satellites and reconfigurable intelligent surfaces (RIS). Prior research in 6G localization using single LEO, multi-LEO, and multi-LEO multi-RIS setups has limitations: single LEO lacks the required accuracy, while multi-LEO/RIS setups demand many visible satellites and RISs, which is not always feasible in practice. This paper explores the novel problem of localization with a single LEO satellite and a single RIS, bridging these research areas. We present a comprehensive signal model accounting for user carrier frequency offset (CFO), clock bias, and fast and slow Doppler effects. Additionally, we derive a low-complexity estimator that achieves theoretical bounds at high signal-to-noise ratios (SNR). Our results demonstrate the feasibility and accuracy of RIS-aided single-LEO localization in 6G networks and highlight potential research directions., Comment: Accepted for publication in IEEE GLOBECOM Workshops 2024

Extremely large-scale antenna array (ELAA) systems emerge as a promising technology in beyond 5G and 6G wireless networks to support the deployment of distributed architectures. This paper explores the use of ELAAs to enable joint localization, synchronization and mapping in sub-6 GHz uplink channels, capitalizing on the near-field effects of phase-coherent distributed arrays. We focus on a scenario where a single-antenna user equipment (UE) communicates with a network of access points (APs) distributed in an indoor environment, considering both specular reflections from walls and scattering from objects. The UE is assumed to be unsynchronized to the network, while the APs can be time- and phase-synchronized to each other. We formulate the problem of joint estimation of location, clock offset and phase offset of the UE, and the locations of scattering points (SPs) (i.e., mapping). Through comprehensive Fisher information analysis, we assess the impact of bandwidth, AP array size, wall reflections, SPs and phase synchronization on localization accuracy. Furthermore, we derive the maximum-likelihood (ML) estimator, which optimally combines the information collected by all the distributed arrays. To overcome its intractable high dimensionality, we propose a novel three-step algorithm that first estimates phase offset leveraging carrier phase information of line-of-sight (LoS) paths, then determines the UE location and clock offset via LoS paths and wall reflections, and finally locates SPs using a null-space transformation technique. Simulation results demonstrate the effectiveness of our approach in distributed architectures supported by radio stripes (RSs) -- an innovative alternative for implementing ELAAs -- while revealing the benefits of carrier phase exploitation and showcasing the interplay between delay and angular information under different bandwidth regimes.

In this paper, we investigate 3-D localization and frequency synchronization with multiple reconfigurable intelligent surfaces (RISs) in the presence of carrier frequency offset (CFO) for a stationary user equipment (UE). In line with the 6G goals of sustainability and efficiency, we focus on a frugal communication scenario with minimal spatial and spectral resources (i.e., narrowband single-input single-ouput system), considering both the presence and blockage of the line-of-sight (LoS) path between the base station (BS) and the UE. We design a generalized likelihood ratio test (GLRT)-based LoS detector, channel parameter estimation and localization algorithms, with varying complexity. To verify the efficiency of our estimators, we compare the root mean-squared error (RMSE) to the Cram\'er- Rao bound (CRB) of the unknown parameters. We also evaluate the sensitivity of our algorithms to the presence of uncontrolled multi-path components (MPC) and various levels of CFO. Simulation results showcase the effectiveness of the proposed algorithms under minimal hardware and spectral requirements, and a wide range of operating conditions, thereby confirming the viability of RIS-aided frugal localization in 6G scenarios., Comment: 13 pages, 11 figures

Ensuring positioning integrity amid faulty measurements is crucial for safety-critical applications, making receiver autonomous integrity monitoring (RAIM) indispensable. This paper introduces a Bayesian RAIM algorithm with a streamlined architecture for snapshot-type 3D cellular positioning. Unlike traditional frequentist-type RAIM algorithms, it computes the exact posterior probability density function (PDF) of the position vector as a Gaussian mixture (GM) model using efficient message passing along a factor graph. This Bayesian approach retains all crucial information from the measurements, eliminates the need to discard faulty measurements, and results in tighter protection levels (PLs) in 3D space and 1D/2D subspaces that meet target integrity risk (TIR) requirements. Numerical simulations demonstrate that the Bayesian RAIM algorithm significantly outperforms a baseline algorithm, achieving over $50\%$ PL reduction at a comparable computational cost., Comment: Submitted to IEEE Transactions on Vehicular Technology

The complexity of financial data, characterized by its variability and low signal-to-noise ratio, necessitates advanced methods in quantitative investment that prioritize both performance and interpretability.Transitioning from early manual extraction to genetic programming, the most advanced approach in the alpha factor mining domain currently employs reinforcement learning to mine a set of combination factors with fixed weights. However, the performance of resultant alpha factors exhibits inconsistency, and the inflexibility of fixed factor weights proves insufficient in adapting to the dynamic nature of financial markets. To address this issue, this paper proposes a two-stage formulaic alpha generating framework AlphaForge, for alpha factor mining and factor combination. This framework employs a generative-predictive neural network to generate factors, leveraging the robust spatial exploration capabilities inherent in deep learning while concurrently preserving diversity. The combination model within the framework incorporates the temporal performance of factors for selection and dynamically adjusts the weights assigned to each component alpha factor. Experiments conducted on real-world datasets demonstrate that our proposed model outperforms contemporary benchmarks in formulaic alpha factor mining. Furthermore, our model exhibits a notable enhancement in portfolio returns within the realm of quantitative investment and real money investment., Comment: 10 pages, 3 figures

We give an example of a function $f$ non-vanishing in the closed bidisk and the affine polynomial minimizing the norm of $1-pf$ in the Hardy space of the bidisk among all affine polynomials $p$. We show that this polynomial vanishes inside the bidisk. This provides a counterexample to the weakest form of a conjecture due to Shanks that has been open since 1980, with applications that arose from digital filter design. This counterexample has a simple form and follows naturally from [7], where the phenomenon of zeros seeping into the unit disk was already observed for similar minimization problems in one variable.

Electromechanical relays and contactors suffer from strong collisions at the end of the switching operations. This causes several undesirable phenomena, such as clicking, mechanical wear and contact bounce. Thus, there is great interest in mitigating these switching impacts while keeping the advantageous features of these devices. This paper proposes a complete control strategy for soft landing. The control structure includes three main components. The first one is a real-time flux-tracking feedback controller, which presents several advantages over voltage or current control. The second one is a feedforward controller, which computes the flux reference signal based on a proposed dynamical model and the desired position trajectory for the switching operations. Lastly, the third control component is a learning-type run-to-run adaptation law that iteratively adapts the model parameters based on an audio signal. It exploits the repetitive nature of these devices in order to circumvent modeling discrepancies due to unit-to-unit variability or small changes between operations. The effectiveness of the proposed control is demonstrated through various experiments., Comment: 9 pages, 10 figures. Version accepted for publication in the IEEE Transactions on Industrial Electronics

Automated medical image analysis systems often require large amounts of training data with high quality labels, which are difficult and time consuming to generate. This paper introduces Radiology Object in COntext version 2 (ROCOv2), a multimodal dataset consisting of radiological images and associated medical concepts and captions extracted from the PMC Open Access subset. It is an updated version of the ROCO dataset published in 2018, and adds 35,705 new images added to PMC since 2018. It further provides manually curated concepts for imaging modalities with additional anatomical and directional concepts for X-rays. The dataset consists of 79,789 images and has been used, with minor modifications, in the concept detection and caption prediction tasks of ImageCLEFmedical Caption 2023. The dataset is suitable for training image annotation models based on image-caption pairs, or for multi-label image classification using Unified Medical Language System (UMLS) concepts provided with each image. In addition, it can serve for pre-training of medical domain models, and evaluation of deep learning models for multi-task learning., Comment: Accepted for Scientific Data

Power system operation is of vital importance and must be developed far beyond today's practice to meet future needs. Almost all European countries are facing an abrupt and very important increase of renewables with intrinsically varying yields which are difficult to predict. In addition, an increase of new types of electric loads and a reduction of traditional production from bulk generation can be observed as well. Hence, the level of complexity of system operation steadily increases. Because of these developments, the traditional power system is being transformed into a smart grid. Previous and ongoing research has tended to focus on how specific aspects of smart grids can be developed and validated, but until now there exists no integrated approach for analysing and evaluating complex smart grid configurations. To tackle these research and development needs, a pan-European research infrastructure is realized in the ERIGrid project that supports the technology development as well as the roll out of smart grid technologies and solutions. This paper provides an overview of the main results of ERIGrid which have been achieved during the last four years. Also, experiences and lessons learned are discussed and an outlook to future research needs is provided.

Progress in the realm of quantum technologies is paving the way for a multitude of potential applications across different sectors. However, the reduced number of available quantum computers, their technical limitations and the high demand for their use are posing some problems for developers and researchers. Mainly, users trying to execute quantum circuits on these devices are usually facing long waiting times in the tasks queues. In this context, this work propose a technique to reduce waiting times and optimize quantum computers usage by scheduling circuits from different users into combined circuits that are executed at the same time. To validate this proposal, different widely known quantum algorithms have been selected and executed in combined circuits. The obtained results are then compared with the results of executing the same algorithms in an isolated way. This allowed us to measure the impact of the use of the scheduler. Among the obtained results, it has been possible to verify that the noise suffered by executing a combination of circuits through the proposed scheduler does not critically affect the outcomes.

We study conditions for containment of a given space $X$ of analytic functions on the unit disk $\mathbb{D}$ in the de Branges-Rovnyak space $\mathcal{H}(b)$. We deal with the non-extreme case in which $b$ admits a Pythagorean mate $a$, and derive a multiplier boundedness criterion on the function $\phi = b/a$ which implies the containment $X \subset \mathcal{H}(b)$. With our criterion, we are able to characterize the containment of the Hardy space $\mathcal{H}^p$ inside $\mathcal{H}(b)$, for $p \in [2, \infty]$. The end-point cases have previously been considered by Sarason, and we show that in his result, stating that $\phi \in \mathcal{H}^2$ is equivalent to $\mathcal{H}^\infty \subset \mathcal{H}(b)$, one can in fact replace $\mathcal{H}^\infty$ by BMOA. We establish various other containment results, and study in particular the case of the Dirichlet space $\mathcal{D}$, containment of which is characterized by a Carleson measure condition. In this context, we show that matters are not as simple as in the case of the Hardy spaces, and we carefully work out an example.

Electromechanical switching devices such as relays, solenoid valves, and contactors offer several technical and economic advantages that make them widely used in industry. However, uncontrolled operations result in undesirable impact-related phenomena at the end of the stroke. As a solution, different soft-landing controls have been proposed. Among them, feedforward control with iterative techniques that adapt its parameters is a solution when real-time feedback is not available. However, these techniques typically require a large number of operations to converge or are computationally intensive, which limits a real implementation. In this paper, we present a new algorithm for the iterative adaptation that is able to eventually adapt the search coordinate system and to reduce the search dimensional size in order to accelerate convergence. Moreover, it automatically toggles between a derivative-free and a gradient-based method to balance exploration and exploitation. To demonstrate the high potential of the proposal, each novel part of the algorithm is compared with a state-of-the-art approach via simulation., Comment: 7 pages, 5 figures. Major changes in all the sections. Version submitted to the 23rd European Control Conference (ECC)

Galileo is the first global navigation satellite system to authenticate their civilian signals through the Open Service Galileo Message Authentication (OSNMA) protocol. However, OSNMA delays the time to obtain a first position and time fix, the Time To First Authentication Fix (TTFAF). Reducing the TTFAF as much as possible is crucial to integrate the technology seamlessly into the current products. In the cases where the receiver already has cryptographic data available, the so-called hot start mode and focus of this article, the currently available implementations achieve an average TTFAF of around 100 seconds in ideal environments. In this work, we explore the TTFAF optimizations available to general OSNMA capable receivers and to receivers with a tighter time synchronization than the required by the OSNMA guidelines. We dissect the TTFAF process, describe the optimizations, and benchmark them in three distinct scenarios with recorded real data (open-sky, soft urban, and hard urban) and the official OSNMA test vectors. The first block of optimizations centers on extracting as much information as possible from broken sub-frames by processing them at page level and combining redundant data from multiple satellites. The second block of optimizations aims to reconstruct missed navigation data by the intelligent use of fields in the authentication tags belonging to the same sub-frame as the authentication key. Combining both optimization ideas improves the TTFAF substantially for all considered scenarios. We obtain an average TTFAF of 60.9 and 68.8 seconds for the test vectors and the open-sky scenario, respectively, with a lowest TTFAF of 44.0 seconds in both. Likewise, the urban scenarios see a drastic reduction of the average TTFAF between the non-optimized and optimized cases. These optimizations have been made available as part of the open-source OSNMAlib library on GitHub., Comment: This work has been submitted to the IEEE for possible publication. 15 pages, 17 figures. Updated version with major changes. New sections II-B, IV-A, IV-C. Updated sections IV-B, VI-D. Acronym changes and fixed typos

Background and purpose: The unanticipated detection by magnetic resonance imaging (MRI) in the brain of asymptomatic subjects of white matter lesions suggestive of multiple sclerosis (MS) has been named radiologically isolated syndrome (RIS). As the difference between early MS [i.e. clinically isolated syndrome (CIS)] and RIS is the occurrence of a clinical event, it is logical to improve detection of the subclinical form without interfering with MRI as there are radiological diagnostic criteria for that. Our objective was to use machine-learning classification methods to identify morphometric measures that help to discriminate patients with RIS from those with CIS. Methods: We used a multimodal 3-T MRI approach by combining MRI biomarkers (cortical thickness, cortical and subcortical grey matter volume, and white matter integrity) of a cohort of 17 patients with RIS and 17 patients with CIS for single-subject level classification. Results: The best proposed models to predict the diagnosis of CIS and RIS were based on the Naive Bayes, Bagging and Multilayer Perceptron classifiers using only three features: the left rostral middle frontal gyrus volume and the fractional anisotropy values in the right amygdala and right lingual gyrus. The Naive Bayes obtained the highest accuracy [overall classification, 0.765; area under the receiver operating characteristic (AUROC), 0.782]. Conclusions: A machine-learning approach applied to multimodal MRI data may differentiate between the earliest clinical expressions of MS (CIS and RIS) with an accuracy of 78%. Keywords: Bagging; Multilayer Perceptron; Naive Bayes classifier; clinically isolated syndrome; diffusion tensor imaging; machine-learning; magnetic resonance imaging; multiple sclerosis; radiologically isolated syndrome., Comment: 24 pages, 2 tables

The latest assessments of the emerging technologies for reconfigurable intelligent surfaces (RISs) have indicated the concept's significant potential for localization and sensing, either as individual or simultaneously realized tasks. However, in the vast majority of those studies, the RIS state (i.e., its position and rotation angles) is required to be known a priori. In this paper, we address the problem of the joint three-dimensional (3D) localization of a hybrid RIS (HRIS) and a user. The most cost- and power-efficient hybrid version of an RIS is equipped with a single reception radio-frequency chain and meta-atoms capable of simultaneous reconfigurable reflection and sensing. This dual functionality is controlled by adjustable power splitters embedded at each hybrid meta-atom. Focusing on a downlink scenario where a multi-antenna base station transmits multicarrier signals to a user via an HRIS, we propose a multistage approach to jointly estimate the metasurface's 3D position and 3D rotation matrix (i.e., 6D parameter estimation) as well as the user's 3D position. Our simulation results verify the validity of the proposed estimator via extensive comparisons of the root-mean-square error of the state estimations with the Cram\'{e}r-Rao lower bound (CRB), which is analytically derived. Furthermore, it is showcased that there exists an optimal hybrid reconfigurable intelligent surface (HRIS) power splitting ratio for the desired multi-parameter estimation problem. We also study the robustness of the proposed method in the presence of scattering points in the wireless propagation environment., Comment: 14 pages, 6 figures, IEEE Transactions Journal

The contemporary landscape of wireless technology underscores the critical role of precise localization services. Traditional global navigation satellite systems (GNSS)-based solutions, however, fall short when it comes to indoor environments, and existing indoor localization techniques such as electromagnetic fingerprinting methods face challenges of high implementation costs and limited coverage. This article explores an innovative solution that seamlessly blends low Earth orbit (LEO) satellites with reconfigurable intelligent surfaces (RISs), unlocking its potential for realizing uninterrupted indoor and outdoor localization with global coverage. By leveraging the strong signal reception of the LEO satellite signals and capitalizing on the radio environment-reshaping capability of RISs, the integration of these two technologies presents a vision of a future where localization services transcend existing constraints. After a comprehensive review of the distinctive attributes of LEO satellites and RISs, we evaluate the localization error bounds for the proposed collaborative system, showcasing their promising performance on simultaneous indoor and outdoor localization. To conclude, we engage in a discussion on open problems and future research directions for LEO satellite and RIS-enabled localization.

Reconfigurable intelligent surfaces (RISs) are considered as an enabling technology for the upcoming sixth generation of wireless systems, exhibiting significant potential for radio localization and sensing. An RIS is usually treated as an anchor point with known position and orientation when deployed to offer user localization. However, it can also be attached to a user to enable its localization in a semi-passive manner. In this paper, we consider a static user equipped with an RIS and study the RIS localization problem (i.e., joint three-dimensional position and orientation estimation), when operating in a system comprising a single-antenna transmitter and multiple synchronized single-antenna receivers with known locations. We present a multi-stage estimator using time-of-arrival and spatial frequency measurements, and derive the Cram\'er-Rao lower bounds for the estimated parameters to validate the estimator's performance. Our simulation results demonstrate the efficiency of the proposed RIS state estimation approach under various system operation parameters.

Electromechanical switching devices, such as solenoid valves, contactors, and relays, suffer from undesirable phenomena like clicking, mechanical wear, and contact bounce. Despite that, they are still widely used in industry due to their various economic and technical advantages. This has encouraged the development of controllers aimed at reducing the collisions that occur at the end of the switching operations. One of the most successful approaches has been the use of iterative techniques. However, these algorithms typically require a large number of operations to converge, which is definitely a clear drawback. This paper presents a strategy to improve the convergence rate of such controllers. Our proposal, which is based on the sensitivity of the control law with respect to the parameters, assumes that the performance of the system is more heavily affected by some parameters than others. Thus, by avoiding movements in the directions that have less impact, the search algorithm is expected to drive the system to near-optimal behaviors using fewer operations. Results obtained by simulation show significant improvement in the convergence rate of a state-of-the-art run-to-run feedforward controller, which demonstrates the high potential of the proposal., Comment: 6 pages, 4 figures. Final version, after peer review and acceptance, submitted to the 22nd European Control Conference (ECC)

Feedforward control can greatly improve the response time and control accuracy of any mechatronic system. However, in order to compensate for the effects of modeling errors or disturbances, it is imperative that this type of control works in conjunction with some form of feedback. In this paper, we present a new adaptive feedforward control scheme for electromechanical systems in which real-time measurements or estimates of the position and its derivatives are not technically or economically feasible. This is the case, for example, of commercial electromechanical switching devices such as solenoid actuators. Our proposal consists of two blocks: on the one hand, a feedforward controller based on differential flatness theory; on the other, an iterative adaptation law that exploits the repetitive operation of these devices to modify the controller parameters cycle by cycle. As shown, this law can be fed with any available measurement of the system, with the only requirement that it can be processed and converted into an indicator of the performance of any given operation. Simulated and experimental results show that our proposal is effective in dealing with a long-standing control problem in electromechanics: the soft-landing control of electromechanical switching devices., Comment: 6 pages, 6 figures. Typo corrected on page 2

The carrier phase of cellular signals can be utilized for highly accurate positioning, with the potential for orders-of-magnitude performance improvements compared to standard time-difference-of-arrival positioning. Due to the integer ambiguities, standard performance evaluation tools such as the Cram\'er-Rao bound (CRB) are overly optimistic. In this paper, a new performance bound, called the mixed-integer CRB (MICRB) is introduced that explicitly accounts for this integer ambiguity. While computationally more complex than the standard CRB, the MICRB can accurately predict positioning performance, as verified by numerical simulations, and hence it serves as a useful guide to choose the system parameters that facilitate carrier phase positioning.

Edge computing enables data processing and storage closer to where the data are created. Given the largely distributed compute environment and the significantly dispersed data distribution, there are increasing demands of data sharing and collaborative processing on the edge. Since data shuffling can dominate the overall execution time of collaborative processing jobs, considering the limited power supply and bandwidth resource in edge environments, it is crucial and valuable to reduce the communication overhead across edge devices. Compared with data compression, compact data structures (CDS) seem to be more suitable in this case, for the capability of allowing data to be queried, navigated, and manipulated directly in a compact form. However, the relevant work about applying CDS to edge computing generally focuses on the intuitive benefit from reduced data size, while few discussions about the challenges are given, not to mention empirical investigations into real-world edge use cases. This research highlights the challenges, opportunities, and potential scenarios of CDS implementation in edge computing. Driven by the use case of shuffling-intensive data analytics, we proposed a three-layer architecture for CDS-aided data processing and particularly studied the feasibility and efficiency of the CDS layer. We expect this research to foster conjoint research efforts on CDS-aided edge data analytics and to make wider practical impacts.

In this paper we present the Process-To-Text (P2T) framework for the automatic generation of textual descriptive explanations of processes. P2T integrates three AI paradigms: process mining for extracting temporal and structural information from a process, fuzzy linguistic protoforms for modelling uncertain terms, and natural language generation for building the explanations. A real use-case in the cardiology domain is presented, showing the potential of P2T for providing natural language explanations addressed to specialists., Comment: This version of the article has been accepted for publication, after peer review and is subject to Springer Nature's AM terms of use, but is not the Version of Record and does not reflect postacceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/978-3-030-73959-1_19

In this paper, we propose a series of fuzzy temporal protoforms in the framework of the automatic generation of quantitative and qualitative natural language descriptions of processes. The model includes temporal and causal information from processes and attributes, quantifies attributes in time during the process life-span and recalls causal relations and temporal distances between events, among other features. Through integrating process mining techniques and fuzzy sets within the usual Data-to-Text architecture, our framework is able to extract relevant quantitative temporal as well as structural information from a process and describe it in natural language involving uncertain terms. A real use-case in the cardiology domain is presented, showing the potential of our model for providing natural language explanations addressed to domain experts., Comment: Accepted and published in FUZZ-IEEE 2021: https://doi.org/10.1109/FUZZ45933.2021.9494444 Cite as: Y. Fontenla-Seco, A. Bugarin and M. Lama, "Fuzzy Temporal Protoforms for the Quantitative Description of Processes in Natural Language," 2021 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), Luxembourg, Luxembourg, 2021, pp. 1-6, doi: 10.1109/FUZZ45933.2021.9494444