Search

A novel framework for covert communications aided by Reconfigurable Intelligent Surfaces (RIS) is proposed. In this general framework, the use of multiport network theory for modelling the RIS consider various aspects that traditional RIS models in communication theory often overlook, including mutual coupling between elements and the impact of structural scattering. Moreover, the transmitter has only limited knowledge about the channels of the warden and the intended receiver. The proposed approach is validated through numerical results, demonstrating that communication with the legitimate user is successfully achieved while satisfying the covertness constraint., Comment: 13 pages, 7 figures, journal paper

In most applications, robots need to adapt to new environments and be multi-functional without forgetting previous information. This requirement gains further importance in real-world scenarios where robots operate in coexistence with humans. In these complex environments, human actions inevitably lead to changes, requiring robots to adapt accordingly. To effectively address these dynamics, the concept of continual learning proves essential. It not only enables learning models to integrate new knowledge while preserving existing information but also facilitates the acquisition of insights from diverse contexts. This aspect is particularly relevant to the issue of context-switching, where robots must navigate and adapt to changing situational dynamics. Our approach introduces a novel approach to effectively tackle the problem of context drifts by designing a Streaming Graph Neural Network that incorporates both regularization and rehearsal techniques. Our Continual\_GTM model enables us to retain previous knowledge from different contexts, and it is more effective than traditional fine-tuning approaches. We evaluated the efficacy of Continual\_GTM in predicting human routines within household environments, leveraging spatio-temporal object dynamics across diverse scenarios.

This document is comprised of a collection of updated preliminary parameters for the key parts of the muon collider. The updated preliminary parameters follow on from the October 2023 Tentative Parameters Report. Particular attention has been given to regions of the facility that are believed to hold greater technical uncertainty in their design and that have a strong impact on the cost and power consumption of the facility. The data is collected from a collaborative spreadsheet and transferred to overleaf.

In this note we show (for a large enough dimension of the underlying field) a conjecture of [C. Beierle, C. Carlet, G. Leander, L. Perrin, {\em A further study of quadratic APN permutations in dimension nine}, Finite Fields Appl. 81 (2022), 102049] on a trivariate permutation. This function is a global representation of two new sporadic quadratic APN permutations in dimension $9$ found by [C. Beierle, G. Leander, {\em New instances of quadratic APN functions}, IEEE Trans. Inf. Theory 68(1) (2022), 670--678].

In this paper we use algebraic curves and other algebraic number theory methods to show the validity of a permutation polynomial conjecture regarding $f(X)=X^{q(p-1)+1} +\alpha X^{pq}+X^{q+p-1}$, on finite fields $\mathbb{F}_{q^2}, q=p^k$, from [A. Rai, R. Gupta, {\it Further results on a class of permutation trinomials}, Cryptogr. Commun. 15 (2023), 811--820].

This study focuses on the optimization of a single-cell multi-user multiple-input multiple-output (MIMO) system with multiple large-size reconfigurable intelligent surfaces (RISs). The overall transmit power is minimized by optimizing the precoding coefficients and the RIS configuration, with constraints on users' signal-to-interference-plus-noise ratios (SINRs). The minimization problem is divided into two sub-problems and solved by means of an iterative alternating optimization (AO) approach. The first sub-problem focuses on finding the best precoder design. The second sub-problem optimizes the configuration of the RISs by partitioning them into smaller tiles. Each tile is then configured as a combination of pre-defined configurations. This allows the efficient optimization of RISs, especially in scenarios where the computational complexity would be prohibitive using traditional approaches. Simulation results show the good performance and limited complexity of the proposed method in comparison to benchmark schemes.

The International Muon Collider Collaboration (IMCC) [1] was established in 2020 following the recommendations of the European Strategy for Particle Physics (ESPP) and the implementation of the European Strategy for Particle Physics-Accelerator R&D Roadmap by the Laboratory Directors Group [2], hereinafter referred to as the the European LDG roadmap. The Muon Collider Study (MuC) covers the accelerator complex, detectors and physics for a future muon collider. In 2023, European Commission support was obtained for a design study of a muon collider (MuCol) [3]. This project started on 1st March 2023, with work-packages aligned with the overall muon collider studies. In preparation of and during the 2021-22 U.S. Snowmass process, the muon collider project parameters, technical studies and physics performance studies were performed and presented in great detail. Recently, the P5 panel [4] in the U.S. recommended a muon collider R&D, proposed to join the IMCC and envisages that the U.S. should prepare to host a muon collider, calling this their "muon shot". In the past, the U.S. Muon Accelerator Programme (MAP) [5] has been instrumental in studies of concepts and technologies for a muon collider., Comment: This document summarises the International Muon Collider Collaboration (IMCC) progress and status of the Muon Collider R&D programme

In this paper we propose a novel macroscopic (fluid dynamics) model for describing pedestrian flow in low and high density regimes. The model is characterized by the fact that the maximal density reachable by the crowd - usually a fixed model parameter - is instead a state variable. To do that, the model couples a conservation law, devised as usual for tracking the evolution of the crowd density, with a Burgers-like PDE with a nonlocal term describing the evolution of the maximal density. The variable maximal density is used here to describe the effects of the psychological/physical pushing forces which are observed in crowds during competitive or emergency situations. Specific attention is also dedicated to the fundamental diagram, i.e., the function which expresses the relationship between crowd density and flux. Although the model needs a well defined fundamental diagram as known input parameter, it is not evident a priori which relationship between density and flux will be actually observed, due to the time-varying maximal density. An a posteriori analysis shows that the observed fundamental diagram has an elongated "tail" in the congested region, thus resulting similar to the concave/concave fundamental diagram with a "double hump" observed in real crowds. The main features of the model are investigated through 1D and 2D numerical simulations. The numerical code for the 1D simulation is freely available at https://gitlab.com/cristiani77/code_arxiv_2406.14649

The exploration of linear subspaces, particularly scattered subspaces, has garnered considerable attention across diverse mathematical disciplines in recent years, notably within finite geometries and coding theory. Scattered subspaces play a pivotal role in analyzing various geometric structures such as blocking sets, two-intersection sets, complete arcs, caps in affine and projective spaces over finite fields and rank metric codes. This paper introduces a new infinite family of $h$-subspaces, along with their associated MRD codes. Additionally, it addresses the task of determining the generalized weights of these codes. Notably, we demonstrate that these MRD codes exhibit some larger generalized weights compared to those previously identified.

In this work we present results on the classification of $\mathbb{F}_{q^n}$-linear MRD codes of dimension three. In particular, using connections with certain algebraic varieties over finite fields, we provide non-existence results for MRD codes $\mathcal{C}=\langle x^{q^t}, F(x), G(x) \rangle \subseteq \mathcal{L}_{n,q}$ of exceptional type, i.e. such that $\mathcal{C}$ is MRD over infinite many extensions of the field $\mathbb{F}_{q^n}$. These results partially address a conjecture of Bartoli, Zini and Zullo in 2023.

Scattered subspaces and $h$-scattered subspaces have been extensively studied in recent decades for both theoretical purposes and their connections to various applications. While numerous constructions of scattered subspaces exist, relatively few are known about $h$-scattered subspaces with $h\geq2$. In this paper, we establish the existence of maximum $2$-scattered $\F_q$-subspaces in $V(r,q^6)$ whenever $r\geq 3$, $r\ne 5$, and $q$ is an odd power of $2$. Additionally, we explore the corresponding MRD codes.

Over the past few decades, there has been extensive research on scattered subspaces, partly because of their link to MRD codes. These subspaces can be characterized using linearized polynomials over finite fields. Within this context, scattered sequences extend the concept of scattered polynomials and can be viewed as geometric equivalents of exceptional MRD codes. Up to now, only scattered sequences of orders one and two have been developed. However, this paper presents an infinite series of exceptional scattered sequences of any order beyond two which correspond to scattered subspaces that cannot be obtained as direct sum of scattered subspaces in smaller dimensions. The paper also addresses equivalence concerns within this framework., Comment: arXiv admin note: substantial text overlap with arXiv:2306.03448

Augmented reality for laparoscopic liver resection is a visualisation mode that allows a surgeon to localise tumours and vessels embedded within the liver by projecting them on top of a laparoscopic image. Preoperative 3D models extracted from CT or MRI data are registered to the intraoperative laparoscopic images during this process. In terms of 3D-2D fusion, most of the algorithms make use of anatomical landmarks to guide registration. These landmarks include the liver's inferior ridge, the falciform ligament, and the occluding contours. They are usually marked by hand in both the laparoscopic image and the 3D model, which is time-consuming and may contain errors if done by a non-experienced user. Therefore, there is a need to automate this process so that augmented reality can be used effectively in the operating room. We present the Preoperative-to-Intraoperative Laparoscopic Fusion Challenge (P2ILF), held during the Medical Imaging and Computer Assisted Interventions (MICCAI 2022) conference, which investigates the possibilities of detecting these landmarks automatically and using them in registration. The challenge was divided into two tasks: 1) A 2D and 3D landmark detection task and 2) a 3D-2D registration task. The teams were provided with training data consisting of 167 laparoscopic images and 9 preoperative 3D models from 9 patients, with the corresponding 2D and 3D landmark annotations. A total of 6 teams from 4 countries participated, whose proposed methods were evaluated on 16 images and two preoperative 3D models from two patients. All the teams proposed deep learning-based methods for the 2D and 3D landmark segmentation tasks and differentiable rendering-based methods for the registration task. Based on the experimental outcomes, we propose three key hypotheses that determine current limitations and future directions for research in this domain., Comment: 24 pages

Recently, there has been a growing interest in mixed-categorical metamodels based on Gaussian Process (GP) for Bayesian optimization. In this context, different approaches can be used to build the mixed-categorical GP. Many of these approaches involve a high number of hyperparameters; in fact, the more general and precise the strategy used to build the GP, the greater the number of hyperparameters to estimate. This paper introduces an innovative dimension reduction algorithm that relies on partial least squares regression to reduce the number of hyperparameters used to build a mixed-variable GP. Our goal is to generalize classical dimension reduction techniques commonly used within GP (for continuous inputs) to handle mixed-categorical inputs. The good potential of the proposed method is demonstrated in both structural and multidisciplinary application contexts. The targeted applications include the analysis of a cantilever beam as well as the optimization of a green aircraft, resulting in a significant 439-kilogram reduction in fuel consumption during a single mission., Comment: v2 - Structural and Multidisciplinary Optimization

We systematically investigate the functors between sites which induce morphisms of relative toposes. In particualar, we establish a relative version of Diaconescu's theorem, characterizing the relative geometric morphisms towards a relative sheaf topos in terms of a notion of flat (equivalently, filtered) functor relative to the base topos., Comment: 47 pages

We study the generalized Procrustes analysis (GPA), as a minimal formulation to the simultaneous localization and mapping (SLAM) problem. We propose KernelGPA, a novel global registration technique to solve SLAM in the deformable environment. We propose the concept of deformable transformation which encodes the entangled pose and deformation. We define deformable transformations using a kernel method, and show that both the deformable transformations and the environment map can be solved globally in closed-form, up to global scale ambiguities. We solve the scale ambiguities by an optimization formulation that maximizes rigidity. We demonstrate KernelGPA using the Gaussian kernel, and validate the superiority of KernelGPA with various datasets. Code and data are available at \url{https://bitbucket.org/FangBai/deformableprocrustes}., Comment: This paper has been accepted for publication in the International Journal of Robotics Research, 2023. https://doi.org/10.1177/02783649231195380

Ovoids of the Klein quadric $Q^+(5,q)$ of $\mathrm{PG}(5,q)$ have been studied in the last 40 year, also because of their connection with spreads of $\mathrm{PG}(3,q)$ and hence translation planes. Beside the classical example given by a three dimensional elliptic quadric (corresponding to the regular spread of $\mathrm{PG}(3,q)$) many other classes of examples are known. First of all the other examples (beside the elliptic quadric) of ovoids of $Q(4,q)$ give also examples of ovoids of $Q^+(5,q)$. Another important class of ovoids of $Q^+(5,q)$ is given by the ones associated to a flock of a three dimensional quadratic cone. To every ovoid of $Q^+(5,q)$ two bivariate polynomials $f_1(x,y)$ and $f_2(x,y)$ can be associated. In this paper, we classify ovoids of $Q^+(5,q)$ such that $f_1(x,y)=y+g(x)$ and $\max\{deg(f_1),deg(f_2)\}<(\frac{1}{6.3}q)^{\frac{3}{13}}-1$, that is $f_1(x,y)$ and $f_2(x,y)$ have "low degree" compared with $q$., Comment: Submitted to Journal of Algebraic Combinatorics. arXiv admin note: substantial text overlap with arXiv:2203.14687

The Indy Autonomous Challenge (IAC) brought together for the first time in history nine autonomous racing teams competing at unprecedented speed and in head-to-head scenario, using independently developed software on open-wheel racecars. This paper presents the complete software architecture used by team TII EuroRacing (TII-ER), covering all the modules needed to avoid static obstacles, perform active overtakes and reach speeds above 75 m/s (270 km/h). In addition to the most common modules related to perception, planning, and control, we discuss the approaches used for vehicle dynamics modelling, simulation, telemetry, and safety. Overall results and the performance of each module are described, as well as the lessons learned during the first two events of the competition on oval tracks, where the team placed respectively second and third., Comment: Preprint: Accepted to Field Robotics "Opportunities and Challenges with Autonomous Racing" Special Issue