Search

The vertical plane transverse emittance of accelerated electron bunches at the AWAKE experiment at CERN has been determined, using three different methods of data analysis. This is a proof-of-principle measurement using the existing AWAKE electron spectrometer to validate the measurement technique. Large values of the geometric emittance, compared to that of the injection beam, are observed ($\sim \SI{0.5}{\milli\metre\milli\radian}$ compared with $\sim \SI{0.08}{\milli\metre\milli\radian}$), which is in line with expectations of emittance growth arising from plasma density ramps and large injection beam bunch size. Future iterations of AWAKE are anticipated to operate in conditions where emittance growth is better controlled, and the effects of the imaging systems of the existing and future spectrometer designs on the ability to measure the emittance are discussed. Good performance of the instrument down to geometric emittances of approximately $\SI{1e-4}{\milli\metre\milli\radian}$ is required, which may be possible with improved electron optics and imaging., Comment: 20 pages, 9 figures

We consider the transport properties of non-interacting, gapless one-dimensional quantum systems and of the edge modes of two-dimensional topological insulators, in the presence of time-dependent perturbations. We prove the validity of Kubo formula, in the zero temperature and infinite volume limit, for a class of perturbations that are weak and slowly varying in space and in time, in an Euler-like scaling. The proof relies on the representation of the real time Duhamel series in imaginary time, which allows to prove its convergence uniformly in the scaling parameter and in the size of system, at low temperatures. Furthermore, it allows to exploit a suitable cancellation for the scaling limit of the model, related to the emergent anomalous chiral gauge symmetry of relativistic one-dimensional fermions. The cancellation implies that, as the temperature and the scaling parameter are sent to zero, the linear response is the only contribution to the full response of the system. The explicit form of the leading contribution to the response function is determined by lattice conservation laws. In particular, the method allows to prove the quantization of the edge conductance of $2d$ quantum Hall systems from quantum dynamics., Comment: 56 pages, 3 figures

Robotic manipulation of fresh fruits and vegetables, including the grasping of multiple loose items, has a strong industrial need but it still is a challenging task for robotic manipulation. This paper outlines the distinctive manipulation strategies used by humans to pick loose fruits and vegetables with the aim to better adopt them for robotic manipulation of diverse items. In this work we present a first version of a robotic setup designed to pick different single or multiple fresh items, featuring multi-fingered compliant robotic gripper. We analyse human grasping strategies from the perspective of industrial Key Performance Indicators (KPIs) used in the logistic sector. The robotic system was validated using the same KPIs, as well as taking into account human performance and strategies. This paper lays the foundation for future development of the robotic demonstrator for fresh fruit and vegetable intelligent manipulation, and outlines the need for generic approaches to handle the complexity of the task., Comment: *Authors contributed equally

In this paper we establish combinatorial characterisations of symmetry-generic infinitesimally rigid frameworks in the Euclidean plane for rotational groups of order 4 and 6, and of odd order between 5 and 1000, where a joint may lie at the centre of rotation. This extends the corresponding results for these groups in the free action case obtained by R. Ikeshita and S. Tanigawa in 2015, and our recent results for the reflection group and the rotational groups of order 2 and 3 in the non-free action case. The characterisations are given in terms of sparsity counts on the corresponding group-labelled quotient graphs, and are obtained via symmetry-adapted versions of recursive Henneberg-type graph constructions. For rotational groups of even order at least 8, we show that the sparsity counts alone are not sufficient for symmetry-generic infinitesimal rigidity., Comment: 25 pages (excluding references), 7 figures

We consider Haldane-like $2d$ topological insulators on the cylinder, in the presence of weak quasi-periodic disorder. We prove that, at large distances, the boundary correlations agree with the correlations of a renormalized, translation-invariant, massless relativistic model in $1+1$ dimensions, multiplied by non-universal oscillatory factors, incommensurate with the lattice spacing. Furthermore, we compute the edge conductance and the edge susceptibility, starting from Kubo formula. We obtain explicit expressions for these response functions, completely determined by the renormalized Fermi velocity of the edge modes. In particular, we prove the quantization of the edge conductance, and the non-universality of the susceptibility. The proof relies on multiscale analysis and rigorous renormalization group methods for quasi-periodic systems, and on lattice Ward identities., Comment: 92 pages, 5 figures

In recent years, drone detection has quickly become a subject of extreme interest: the potential for fast-moving objects of contained dimensions to be used for malicious intents or even terrorist attacks has posed attention to the necessity for precise and resilient systems for detecting and identifying such elements. While extensive literature and works exist on object detection based on RGB data, it is also critical to recognize the limits of such modality when applied to UAVs detection. Detecting drones indeed poses several challenges such as fast-moving objects and scenes with a high dynamic range or, even worse, scarce illumination levels. Neuromorphic cameras, on the other hand, can retain precise and rich spatio-temporal information in situations that are challenging for RGB cameras. They are resilient to both high-speed moving objects and scarce illumination settings, while prone to suffer a rapid loss of information when the objects in the scene are static. In this context, we present a novel model for integrating both domains together, leveraging multimodal data to take advantage of the best of both worlds. To this end, we also release NeRDD (Neuromorphic-RGB Drone Detection), a novel spatio-temporally synchronized Event-RGB Drone detection dataset of more than 3.5 hours of multimodal annotated recordings., Comment: Accepted at NeVi Workshop at ECCV24

We give a rigorous derivation of the Hartree equation for the many-body dynamics of pseudo-relativistic Fermi systems at high density $\varrho \gg 1$, on arbitrarily large domains, at zero temperature. With respect to previous works, we show that the many-body evolution can be approximated by the Hartree dynamics locally, proving convergence of the expectation of observables that are supported in regions with fixed volume, independent of $\varrho$. The result applies to initial data describing fermionic systems at equilibrium confined in arbitrarily large domains, under the assumption that a suitable local Weyl-type estimate holds true. The proof relies on the approximation of the initial data through positive temperature quasi-free states, that satisfy strong local semiclassical bounds, which play a key role in controlling the growth of the local excitations of the quasi-free state along the many-body dynamics., Comment: 58 pages, no figures

Prototypical part learning is emerging as a promising approach for making semantic segmentation interpretable. The model selects real patches seen during training as prototypes and constructs the dense prediction map based on the similarity between parts of the test image and the prototypes. This improves interpretability since the user can inspect the link between the predicted output and the patterns learned by the model in terms of prototypical information. In this paper, we propose a method for interpretable semantic segmentation that leverages multi-scale image representation for prototypical part learning. First, we introduce a prototype layer that explicitly learns diverse prototypical parts at several scales, leading to multi-scale representations in the prototype activation output. Then, we propose a sparse grouping mechanism that produces multi-scale sparse groups of these scale-specific prototypical parts. This provides a deeper understanding of the interactions between multi-scale object representations while enhancing the interpretability of the segmentation model. The experiments conducted on Pascal VOC, Cityscapes, and ADE20K demonstrate that the proposed method increases model sparsity, improves interpretability over existing prototype-based methods, and narrows the performance gap with the non-interpretable counterpart models. Code is available at github.com/eceo-epfl/ScaleProtoSeg., Comment: 8 pages, 5 figures, 4 tables

Software-defined networking (SDN) is a centralized, dynamic, and programmable network management technology that enables flexible traffic control and scalability. SDN facilitates network administration through a centralized view of the underlying physical topology; tampering with this topology view can result in catastrophic damage to network management and security. To underscore this issue, we introduce Marionette, a new topology poisoning technique that manipulates OpenFlow link discovery packet forwarding to alter topology information. Our approach exposes an overlooked yet widespread attack vector, distinguishing itself from traditional link fabrication attacks that tamper, spoof, or relay discovery packets at the data plane. Unlike localized attacks observed in existing methods, our technique introduces a globalized topology poisoning attack that leverages control privileges. Marionette implements a reinforcement learning algorithm to compute a poisoned topology target, and injects flow entries to achieve a long-lived stealthy attack. Our evaluation shows that Marionette successfully attacks five open-source controllers and nine OpenFlow-based discovery protocols. Marionette overcomes the state-of-the-art topology poisoning defenses, showcasing a new class of topology poisoning that initiates on the control plane. This security vulnerability was ethically disclosed to OpenDaylight, and CVE-2024-37018 has been assigned., Comment: 17 pages, 12 figures, CCS 2024

We provide an approach enabling one to employ physics-informed neural networks (PINNs) for uncertainty quantification. Our approach is applicable to systems where observations are scarce (or even lacking), these being typical situations associated with subsurface water bodies. Our novel physics-informed neural network under uncertainty (PINN-UU) integrates the space-time domain across which processes take place and uncertain parameter spaces within a unique computational domain. PINN-UU is then trained to satisfy the relevant physical principles (e.g., mass conservation) in the defined input domain. We employ a stage training approach via transfer learning to accommodate high-dimensional solution spaces. We demonstrate the effectiveness of PINN-UU in a scenario associated with reactive transport in porous media, showcasing its reliability, efficiency, and applicability to sensitivity analysis. PINN-UU emerges as a promising tool for robust uncertainty quantification, with broad applicability to groundwater systems. As such, it can be considered as a valuable alternative to traditional methods such as multi-realization Monte Carlo simulations based on direct solvers or black-box surrogate models., Comment: 25 pages, 9 figures

For plane frameworks with reflection or rotational symmetries, where the group action is not necessarily free on the vertex set, we introduce a phase-symmetric orbit rigidity matrix for each irreducible representation of the group. We then use these generalised orbit rigidity matrices to provide necessary conditions for infinitesimal rigidity for frameworks that are symmetric with a cyclic group that acts freely or non-freely on the vertices. Moreover, for the reflection, the half-turn, and the three-fold rotational group in the plane, we establish complete combinatorial characterisations of symmetry-generic infinitesimally rigid frameworks. This extends well-known characterisations for these groups to the case when the group action is not necessarily free on the vertices. The presence of vertices that are fixed by non-trivial group elements requires the introduction of generalised versions of group-labelled quotient graphs leads to more refined types of combinatorial sparsity counts for characterising symmetry-generic infinitesimal rigidity., Comment: 36 pages excluding references, 17 figures

We show experimentally that an effect of motion of ions, observed in a plasma-based accelerator, depends inversely on the plasma ion mass. The effect appears within a single wakefield event and manifests itself as a bunch tail, occurring only when sufficient motion of ions suppresses wakefields. Wakefields are driven resonantly by multiple bunches, and simulation results indicate that the ponderomotive force causes the motion of ions. In this case, the effect is also expected to depend on the amplitude of the wakefields, experimentally confirmed through variations in the drive bunch charge.

Plasma wakefields offer high acceleration gradients, orders of magnitude larger than conventional RF accelerators. However, the achievable luminosity remains relatively low, typically limited by the plasma recovery time and the charge which can be accelerated per shot. In this work, we show that a train of drive bunches can be harnessed to accelerate multiple witness bunches in a single shot. We demonstrate that periodically loading the wakefields removes the limit on the energy transfer from the drive beam to the plasma, which allows the luminosity to be increased. Proof-of-concept simulations for the AWAKE scheme are carried out to demonstrate the technique, achieving a doubling of the accelerated charge while exploiting only a fraction of the drive train., Comment: 5 pages, 4 figures

Edge computing has become a very popular service that enables mobile devices to run complex tasks with the help of network-based computing resources. However, edge clouds are often resource-constrained, which makes resource allocation a challenging issue. In addition, edge cloud servers must make allocation decisions with only limited information available, since the arrival of future client tasks might be impossible to predict, and the states and behavior of neighboring servers might be obscured. We focus on a distributed resource allocation method in which servers operate independently and do not communicate with each other, but interact with clients (tasks) to make allocation decisions. We follow a two-round bidding approach to assign tasks to edge cloud servers, and servers are allowed to preempt previous tasks to allocate more useful ones. We evaluate the performance of our system using realistic simulations and real-world trace data from a high-performance computing cluster. Results show that our heuristic improves system-wide performance by $20-25\%$ over previous work when accounting for the time taken by each approach. In this way, an ideal trade-off between performance and speed is achieved., Comment: 13 pages,added IEEE disclaimer