Search

The increasing demand for highly customized products, as well as flexible production lines, can be seen as trigger for the "fourth industrial revolution", referred to as "Industrie 4.0". Current systems usually rely on wire-line technologies to connect sensors and actuators. To enable a higher flexibility such as moving robots or drones, these connections need to be replaced by wireless technologies in the future. Furthermore, this facilitates the renewal of brownfield deployments to address Industrie 4.0 requirements. This paper proposes representative use cases, which have been examined in the German Tactile Internet 4.0 (TACNET 4.0) research project. In order to analyze these use cases, this paper identifies the main challenges and requirements of communication networks in Industrie 4.0 and discusses the applicability of 5th generation wireless communication systems (5G).

Processing large-scale graphs, containing billions of entities, is critical across fields like bioinformatics, high-performance computing, navigation and route planning, among others. Efficient graph partitioning, which divides a graph into sub-graphs while minimizing inter-block edges, is essential to graph processing, as it optimizes parallel computing and enhances data locality. Traditional in-memory partitioners, such as METIS and KaHIP, offer high-quality partitions but are often infeasible for enormous graphs due to their substantial memory overhead. Streaming partitioners reduce memory usage to O(n), where 'n' is the number of nodes of the graph, by loading nodes sequentially and assigning them to blocks on-the-fly. This paper introduces StreamCPI, a novel framework that further reduces the memory overhead of streaming partitioners through run-length compression of block assignments. Notably, StreamCPI enables the partitioning of trillion-edge graphs on edge devices. Additionally, within this framework, we propose a modification to the LA-vector bit vector for append support, which can be used for online run-length compression in other streaming applications. Empirical results show that StreamCPI reduces memory usage while maintaining or improving partition quality. For instance, using StreamCPI, the Fennel partitioner effectively partitions a graph with 17 billion nodes and 1.03 trillion edges on a Raspberry Pi, achieving significantly better solution quality than Hashing, the only other feasible algorithm on edge devices. StreamCPI thus advances graph processing by enabling high-quality partitioning on low-cost machines.

We prove that strictly mean convex toroids contain infinitely many (geometrically distinct) embedded free boundary minimal M\"obius bands as well as infinitely many embedded free boundary minimal annuli. The surfaces in both families are constructed by means of equivariant variational methods and their areas grow linearly with the order of their symmetry groups., Comment: 19 pages, 8 figures

Gravitational redshift and Doppler effects give rise to an antisymmetric component of the galaxy correlation function when cross-correlating two galaxy populations or two different tracers. In this paper, we assess the detectability of these effects in the Euclid spectroscopic galaxy survey. We model the impact of gravitational redshift on the observed redshift of galaxies in the Flagship mock catalogue using a Navarro-Frenk-White profile for the host haloes. We isolate these relativistic effects, largely subdominant in the standard analysis, by splitting the galaxy catalogue into two populations of faint and bright objects and estimating the dipole of their cross-correlation in four redshift bins. In the simulated catalogue, we detect the dipole signal on scales below $30\,h^{-1}{\rm Mpc}$, with detection significances of $4\,\sigma$ and $3\,\sigma$ in the two lowest redshift bins, respectively. At higher redshifts, the detection significance drops below $2\,\sigma$. Overall, we estimate the total detection significance in the Euclid spectroscopic sample to be approximately $6\,\sigma$. We find that on small scales, the major contribution to the signal comes from the nonlinear gravitational potential. Our study on the Flagship mock catalogue shows that this observable can be detected in Euclid Data Release 2 and beyond., Comment: 21 pages, 11 figures, 1 appendix; submitted on behalf of the Euclid Collaboration

Compositional representations are thought to enable humans to generalize across combinatorially vast state spaces. Models with learnable object slots, which encode information about objects in separate latent codes, have shown promise for this type of generalization but rely on strong architectural priors. Models with distributed representations, on the other hand, use overlapping, potentially entangled neural codes, and their ability to support compositional generalization remains underexplored. In this paper we examine whether distributed models can develop linearly separable representations of objects, like slotted models, through unsupervised training on videos of object interactions. We show that, surprisingly, models with distributed representations often match or outperform models with object slots in downstream prediction tasks. Furthermore, we find that linearly separable object representations can emerge without object-centric priors, with auxiliary objectives like next-state prediction playing a key role. Finally, we observe that distributed models' object representations are never fully disentangled, even if they are linearly separable: Multiple objects can be encoded through partially overlapping neural populations while still being highly separable with a linear classifier. We hypothesize that maintaining partially shared codes enables distributed models to better compress object dynamics, potentially enhancing generalization.

Cloaking has important applications but entails sophisticated control of signal propagation and scattering characteristics. Here, we show that invisibility for magnon signals is achievable in a non-reciprocal and electrically controlled way by engineering the magnonic channels such that they exhibit PT-symmetry. This is accomplished by attaching current-carrying heavy metal contacts to the magnon waveguides and exerting fields from an attached bias layer. Tuning the current density in the metal layer, the magnons in this setup experience electrically controlled, compensated gain and loss due to spin-orbit torque which renders the setup PT-symmetric. The magnon dynamics is then shown to be pseudo-Hermitian with exceptional points (EPs) determined actively by an external electric field. We analyze the magnon scattering from single and periodic PT-symmetric regions and identify the conditions necessary for the formation of unidirectional invisibility which can be steered by specific combinations of bias layers and current amplitudes in the heavy metal as to reach the EP. The unidirectional invisibility at EP is found to be extended for a periodic PT-symmetric region. Intrinsic damping on PT-symmetric unidirectional invisibility is shown to be marginal confirming the experimental feasibility. It is shown how the unidirectional magnons can be utilized to amplify and generate magnonic orbital angular momentum states in coupled magnetic rings demonstrating a new path for manipulating magnon propagation and processing., Comment: 25 pages, 6 figures

In-context learning, the ability to adapt based on a few examples in the input prompt, is a ubiquitous feature of large language models (LLMs). However, as LLMs' in-context learning abilities continue to improve, understanding this phenomenon mechanistically becomes increasingly important. In particular, it is not well-understood how LLMs learn to solve specific classes of problems, such as reinforcement learning (RL) problems, in-context. Through three different tasks, we first show that Llama $3$ $70$B can solve simple RL problems in-context. We then analyze the residual stream of Llama using Sparse Autoencoders (SAEs) and find representations that closely match temporal difference (TD) errors. Notably, these representations emerge despite the model only being trained to predict the next token. We verify that these representations are indeed causally involved in the computation of TD errors and $Q$-values by performing carefully designed interventions on them. Taken together, our work establishes a methodology for studying and manipulating in-context learning with SAEs, paving the way for a more mechanistic understanding.

When assessing the quality of prediction models in machine learning, confidence intervals (CIs) for the generalization error, which measures predictive performance, are a crucial tool. Luckily, there exist many methods for computing such CIs and new promising approaches are continuously being proposed. Typically, these methods combine various resampling procedures, most popular among them cross-validation and bootstrapping, with different variance estimation techniques. Unfortunately, however, there is currently no consensus on when any of these combinations may be most reliably employed and how they generally compare. In this work, we conduct the first large-scale study comparing CIs for the generalization error - empirically evaluating 13 different methods on a total of 18 tabular regression and classification problems, using four different inducers and a total of eight loss functions. We give an overview of the methodological foundations and inherent challenges of constructing CIs for the generalization error and provide a concise review of all 13 methods in a unified framework. Finally, the CI methods are evaluated in terms of their relative coverage frequency, width, and runtime. Based on these findings, we are able to identify a subset of methods that we would recommend. We also publish the datasets as a benchmarking suite on OpenML and our code on GitHub to serve as a basis for further studies.

We investigate charged-hadron production in relativistic heavy-ion collisions of asymmetric systems within a nonequilibrium-statistical framework. Calculated centrality-dependent pseudorapidity distributions for p-Pb collisions at sqrt(s_NN)=5.02 and 8.16 TeV are compared with data from the Large Hadron Collider (LHC). Our approach combines a relativistic diffusion model with formulations based on quantum chromodynamics while utilizing numerical solutions of a Fokker-Planck equation to account for the shift and broadening of the fragmentation sources for particle-production with respect to the stopping (net-baryon) rapidity distributions. To represent the centrality dependence of charged-hadron production in asymmetric systems over a broad region of pseudorapidities, the consideration and precise modelling of the fragmentation sources - along with the central gluon-gluon source - is found to be essential. Specifically, this results in an inversion of the particle-production amplitude from backward- to forward-dominance when transitioning from central to peripheral collisions, in agreement with recent ATLAS and ALICE p-Pb data at sqrt(s_NN)=5.02 TeV., Comment: 13 pages, 6 figures, submitted to Phys. Rev. C

Introduction: Medication prescriptions are often in free text and include a mix of two languages, local brand names, and a wide range of idiosyncratic formats and abbreviations. Large language models (LLMs) have shown promising ability to generate text in response to input prompts. We use ChatGPT 3.5 to automatically structure and expand medication statements in discharge summaries and thus make them easier to interpret for people and machines. Methods: Named-entity Recognition (NER) and Text Expansion (EX) are used in a zero- and few-shot setting with different prompt strategies. 100 medication statements were manually annotated and curated. NER performance was measured by using strict and partial matching. For the task EX, two experts interpreted the results by assessing semantic equivalence between original and expanded statements. The model performance was measured by precision, recall, and F1 score. Results: For NER, the best-performing prompt reached an average F1 score of 0.94 in the test set. For EX, the few-shot prompt showed superior performance among other prompts, with an average F1 score of 0.87. Conclusion: Our study demonstrates good performance for NER and EX tasks in free-text medication statements using ChatGPT. Compared to a zero-shot baseline, a few-shot approach prevented the system from hallucinating, which would be unacceptable when processing safety-relevant medication data.

In neutral atom quantum computers, readout and preparation of the atomic qubits are usually based on fluorescence imaging and subsequent analysis of the acquired image. For each atom site, the brightness or some comparable metric is estimated and used to predict the presence or absence of an atom. Across different setups, we can see a vast number of different approaches used to analyze these images. Often, the choice of detection algorithm is either not mentioned at all or it is not justified. We investigate several different algorithms and compare their performance in terms of both precision and execution run time. To do so, we rely on a set of synthetic images across different simulated exposure times with known occupancy states. Since the use of simulation provides us with the ground truth of atom site occupancy, we can easily state precise error rates and variances of the reconstructed property. To also rule out the possibility of better algorithms existing, we calculated the Cram\'er-Rao bound in order to establish an upper limit that even a perfect estimator cannot outperform. As the metric of choice, we used the number of photonelectrons that can be contributed to a specific atom site. Since the bound depends on the occupancy of neighboring sites, we provide the best and worst cases, as well as a half filled one. Our comparison shows that of our tested algorithms, a global non-linear least-squares solver that uses the optical system's PSF to return a each sites' number of photoelectrons performed the best, on average crossing the worst-case bound for longer exposure times. Its main drawback is its huge computational complexity and, thus, required calculation time. We manage to somewhat reduce this problem, suggesting that its use may be viable. However, our study also shows that for cases where utmost speed is required, simple algorithms may be preferable., Comment: 10 pages, 11 figures

Research in Explainable Artificial Intelligence (XAI) is increasing, aiming to make deep learning models more transparent. Most XAI methods focus on justifying the decisions made by Artificial Intelligence (AI) systems in security-relevant applications. However, relatively little attention has been given to using these methods to improve the performance and robustness of deep learning algorithms. Additionally, much of the existing XAI work primarily addresses classification problems. In this study, we investigate the potential of feature attribution methods to filter out uninformative features in input data for regression problems, thereby improving the accuracy and stability of predictions. We introduce a feature selection pipeline that combines Integrated Gradients with k-means clustering to select an optimal set of variables from the initial data space. To validate the effectiveness of this approach, we apply it to a real-world industrial problem - blade vibration analysis in the development process of turbo machinery.

We introduce a novel mesh-free and direct method for computing the shape derivative in PDE-constrained shape optimization problems. Our approach is based on a probabilistic representation of the shape derivative and is applicable for second-order semilinear elliptic PDEs with Dirichlet boundary conditions and a general class of target functions. The probabilistic representation derives from an extension of a boundary sensitivity result for diffusion processes due to Costantini, Gobet and El Karoui [14]. Moreover, we present a simulation methodology based on our results that does not necessarily require a mesh of the relevant domain, and provide Taylor tests to verify its numerical accuracy

Cen X-3 is a compact, high-mass X-ray binary (HMXRB), likely powered by Roche lobe overflow. We present a phase-resolved X-ray spectral and timing analysis of a target of opportunity \textit{Chandra} observation made during a low-flux to high-flux transition. The high-resolution spectra allow us to delve into the events that occurred during this episode. The spectrum is described by a single black body absorbed by a local column density of the order of $10^{23-24}$ cm$^{-2}$, which is one to two orders of magnitude higher than found for previous analyses of data taken at similar orbital phases. Such a large column produces a Compton shoulder in the Fe K$\alpha$ line. The transition appears to be caused by the onset of efficient cooling, which cools the plasma by 10 million degrees in just 10 ks, allowing matter to enter the magnetosphere. This happens after a major disturbance, probably the arrival of a train of wind clumps with individual masses in the range $10^{19-20}$ g. This train moves ballistically in an eccentric orbit around the NS, producing a distinctive Doppler modulation in the \ion{Fe}{xxv} line.

We use variational methods to construct a free boundary minimal surface in the three-dimensional unit ball with genus one, two boundary components and prismatic symmetry. Key ingredients are an extension of the equivariant min-max theory to include orientation-reversing isometries and the discovery of a nontrivial two-parameter sweepout.

Online adaptation of exoskeleton control based on muscle activity sensing is a promising way to personalize exoskeletons based on the user's biosignals. While several electromyography (EMG) based methods have been shown to improve joint torque estimation, EMG sensors require direct skin contact and complex post-processing. In contrast, force myography (FMG) measures normal forces from changes in muscle volume due to muscle activity. We propose an FMG-based method to estimate knee and ankle joint torques by combining joint angles and velocities with muscle activity information. We learn a model for joint torque estimation using Gaussian process regression (GPR). The effectiveness of the proposed FMG-based method is validated on isokinetic motions performed by two subjects. The model is compared to a baseline model using only joint angle and velocity, as well as a model augmented by EMG data. The results show that integrating FMG into exoskeleton control improves the joint torque estimation for the ankle and knee and is therefore a promising way to improve adaptability to different exoskeleton users., Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible

In contrast with the diversity of materials found in nature, most robots are designed with some combination of aluminum, stainless steel, and 3D-printed filament. Additionally, robotic systems are typically assumed to follow basic rigid-body dynamics. However, several examples in nature illustrate how changes in physical material properties yield functional advantages. In this paper, we explore how physical materials (non-rigid bodies) affect the functional performance of a hopping robot. In doing so, we address the practical question of how to model and simulate material properties. Through these simulations we demonstrate that material gradients in the limb system of a single-limb hopper provide functional advantages compared to homogeneous designs. For example, when considering incline ramp hopping, a material gradient with increasing density provides a 35\% reduction in tracking error and a 23\% reduction in power consumption compared to isotropic stainless steel. By providing bio-inspiration to the rigid limbs in a robotic system, we seek to show that future fabrication of robots should look to leverage the material anisotropies of moduli and density found in nature. This would allow for reduced vibrations in the system and would provide offsets of joint torques and vibrations while protecting their structural integrity against reduced fatigue and wear. This simulation system could inspire future intelligent material gradients of custom-fabricated robotic locomotive devices.

Soliton automata are mathematical models of soliton switching in chemical molecules. Several concepts of determinism for soliton automata have been defined. The concept of strong determinism has been investigated for the case in which only a single soliton can be present in a molecule. In the present paper, several different concepts of determinism are explored for the multi-soliton case. It is shown that the degree of non-determinism is a connected measure of descriptional complexity for multi-soliton automata. A characterization of the class of strongly deterministic multi-soliton automata is presented. Finally, the concept of perfect determinism, forming a natural extension of strong determinism, is introduced and considered for multi-soliton automata., Comment: In Proceedings NCMA 2024, arXiv:2409.06120

Carbon dioxide levels below the soil surface are an important measurement relating to plant health, especially for plants such as perennial grasses in northern climates where ice encasement can occur over winter. In such cases, the CO$_2$ levels can build up and become toxic. This is likely a significant contributor to turfgrass death over winter; however, there is an insufficient amount of data regarding this phenomenon in large part due to the lack of effective sensors. Many off the shelf CO$_2$ sensors exist, but they are not sufficiently hardened for in ground deployment over winter. As a result, the only options currently available are very costly automated gas samplers or manual sampling at intervals with laboratory testing -- a process that results in a limited number of data points and is labor intensive. To combat this problem we have taken an established NDIR CO$_2$ sensor and hardened it for use in winter and ice encased environments to allow for continuous automated sampling of subsurface CO$_2$ levels to better understand ice encasement damage in perennial grass systems.

Statistical shape analysis of slabular objects like groups of hippocampi is highly useful for medical researchers as it can be useful for diagnoses and understanding diseases. This work proposes a novel object representation based on locally parameterized discrete swept skeletal structures. Further, model fitting and analysis of such representations are discussed. The model fitting procedure is based on boundary division and surface flattening. The quality of the model fitting is evaluated based on the symmetry and tidiness of the skeletal structure as well as the volume of the implied boundary. The power of the method is demonstrated by visual inspection and statistical analysis of a synthetic and an actual data set in comparison with an available skeletal representation.

Addressing the challenges posed by climate change, biodiversity loss, and environmental pollution requires comprehensive monitoring and effective data management strategies that are applicable across various scales in environmental system science. This paper introduces a versatile and transferable digital ecosystem for managing time series data, designed to adhere to the FAIR principles (Findable, Accessible, Interoperable, and Reusable). The system is highly adaptable, cloud-ready, and suitable for deployment in a wide range of settings, from small-scale projects to large-scale monitoring initiatives. The ecosystem comprises three core components: the Sensor Management System (SMS) for detailed metadata registration and management; time$.$IO, a platform for efficient time series data storage, transfer, and real-time visualization; and the System for Automated Quality Control (SaQC), which ensures data integrity through real-time analysis and quality assurance. The modular architecture, combined with standardized protocols and interfaces, ensures that the ecosystem can be easily transferred and deployed across different environments and institutions. This approach enhances data accessibility for a broad spectrum of stakeholders, including researchers, policymakers, and the public, while fostering collaboration and advancing scientific research in environmental monitoring.

This paper summarises the Competition on Presentation Attack Detection on ID Cards (PAD-IDCard) held at the 2024 International Joint Conference on Biometrics (IJCB2024). The competition attracted a total of ten registered teams, both from academia and industry. In the end, the participating teams submitted five valid submissions, with eight models to be evaluated by the organisers. The competition presented an independent assessment of current state-of-the-art algorithms. Today, no independent evaluation on cross-dataset is available; therefore, this work determined the state-of-the-art on ID cards. To reach this goal, a sequestered test set and baseline algorithms were used to evaluate and compare all the proposals. The sequestered test dataset contains ID cards from four different countries. In summary, a team that chose to be "Anonymous" reached the best average ranking results of 74.80%, followed very closely by the "IDVC" team with 77.65%.

We investigate the effect of focused-ion-beam (FIB) irradiation on spin waves with sub-micron wavelengths in Yttrium-Iron-Garnet (YIG) films. Time-resolved scanning transmission X-ray (TR-STXM) microscopy was used to image the spin waves in irradiated regions and deduce corresponding changes in the magnetic parameters of the film. We find that the changes of Ga$^+$ irradiation can be understood by assuming a few percent change in the effective magnetization $M_\mathrm{eff}$ of the film due to a trade-off between changes in anisotropy and effective film thickness. Our results demonstrate that FIB irradiation can be used to locally alter the dispersion relation and the effective refractive index $n_\textrm{eff}$ of the film, even for submicron wavelengths. To achieve the same change in $n_\textrm{eff}$ for shorter wavelengths, a higher dose is required, but no significant deterioration of spin wave propagation length in the irradiated regions was observed, even at the highest applied doses., Comment: 5 pages, 6 figures

Recently, researchers have extended the concept of matchings to the more general problem of finding $b$-matchings in hypergraphs broadening the scope of potential applications and challenges. The concept of $b$-matchings, where $b$ is a function that assigns positive integers to the vertices of the graph, is a natural extension of matchings in graphs, where each vertex $v$ is allowed to be matched to up to $b(v)$ edges, rather than just one. The weighted $b$-matching problem then seeks to select a subset of the hyperedges that fulfills the constraint and maximizes the weight. In this work, we engineer novel algorithms for this generalized problem. More precisely, we introduce exact data reductions for the problem as well as a novel greedy initial solution and local search algorithms. These data reductions allow us to significantly shrink the input size. This is done by either determining if a hyperedge is guaranteed to be in an optimum $b$-matching and thus can be added to our solution or if it can be safely ignored. Our iterated local search algorithm provides a framework for finding suitable improvement swaps of edges. Experiments on a wide range of real-world hypergraphs show that our new set of data reductions are highly practical, and our initial solutions are competitive for graphs and hypergraphs as well.

Results are presented for the measurement of large-scale anisotropies in the arrival directions of ultra-high-energy cosmic rays detected at the Pierre Auger Observatory during 19 years of operation, prior to AugerPrime, the upgrade of the Observatory. The 3D dipole amplitude and direction are reconstructed above $4\,$EeV in four energy bins. Besides the established dipolar anisotropy in right ascension above $8\,$EeV, the Fourier amplitude of the $8$ to $16\,$EeV energy bin is now also above the $5\sigma$ discovery level. No time variation of the dipole moment above $8\,$EeV is found, setting an upper limit to the rate of change of such variations of $0.3\%$ per year at the $95\%$ confidence level. Additionally, the results for the angular power spectrum are shown, demonstrating no other statistically significant multipoles. The results for the equatorial dipole component down to $0.03\,$EeV are presented, using for the first time a data set obtained with a trigger that has been optimized for lower energies. Finally, model predictions are discussed and compared with observations, based on two source emission scenarios obtained in the combined fit of spectrum and composition above $0.6\,$EeV., Comment: Minor modifications, accepted for publication in Astrophysical Journal

Collective perception has received considerable attention as a promising approach to overcome occlusions and limited sensing ranges of vehicle-local perception in autonomous driving. In order to develop and test novel collective perception technologies, appropriate datasets are required. These datasets must include not only different environmental conditions, as they strongly influence the perception capabilities, but also a wide range of scenarios with different road users as well as realistic sensor models. Therefore, we propose the Synthetic COllective PErception (SCOPE) dataset. SCOPE is the first synthetic multi-modal dataset that incorporates realistic camera and LiDAR models as well as parameterized and physically accurate weather simulations for both sensor types. The dataset contains 17,600 frames from over 40 diverse scenarios with up to 24 collaborative agents, infrastructure sensors, and passive traffic, including cyclists and pedestrians. In addition, recordings from two novel digital-twin maps from Karlsruhe and T\"ubingen are included. The dataset is available at https://ekut-es.github.io/scope

TeNPy (short for 'Tensor Network Python') is a python library for the simulation of strongly correlated quantum systems with tensor networks. The philosophy of this library is to achieve a balance of readability and usability for new-comers, while at the same time providing powerful algorithms for experts. The focus is on MPS algorithms for 1D and 2D lattices, such as DMRG ground state search, as well as dynamics using TEBD, TDVP, or MPO evolution. This article is a companion to the recent version 1.0 release of TeNPy and gives a brief overview of the package., Comment: v2: updated funding acknowledgement

The IEA's International Civic and Citizenship Education Study (ICCS) investigates the ways in which young people around the world are prepared to undertake their roles as citizens. This report presents the European results from the third cycle of the study (ICCS 2022). Eighteen countries and two benchmarking participants (the German states of North Rhine-Westphalia and Schleswig-Holstein) administered the European student questionnaire to target grade students in this study cycle. ICCS 2022 studied contexts for and learning outcomes of civic and citizenship education in a wide range of national contexts at the beginning of the third decade of the 21st Century. The general purpose of the European student questionnaire is to explore specific European-related civic and citizenship issues derived from the overarching ICCS 2022 assessment framework, supplementing the data obtained from the international survey with a specific European perspective. The ICCS 2022 European student questionnaire included 12 questions aimed at examining students' interest and their opinions regarding European-related civic and citizenship issues such as students' sense of European identity; students' opportunities for learning about Europe provided by schools; and students' attitudes toward free movement of European citizens within Europe, toward the European Union, and toward cooperation among European countries. It also encompasses questions on students' perceptions of discrimination in their country, of the future of Europe, and of their life in the future, as well as on students' sustainable behaviors and those related to political and ethical consumerism. Over the past 50 years, the IEA has conducted comparative research studies in a range of domains focusing on educational policies, practices, and outcomes in many countries around the world. Prior to ICCS 2022, the IEA had conducted four international comparative studies of civic and citizenship education, with a first survey implemented in 1971, a second in 1999, a third in 2009 and a fourth in 2016. ICCS 2022 data will allow education systems to evaluate the strengths of educational policies, both internationally and in the European regional context, and to measure progress in achieving critical social objectives of their educational policy. [This report was jointly prepared by Libera Università Maria Santissima Assunta (LUMSA Università -- Rome, Italy).]

Understanding the dynamics of the land-atmosphere exchange of CO$_2$ is key to advance our predictive capacities of the coupled climate-carbon feedback system. In essence, the net vegetation flux is the difference of the uptake of CO$_2$ via photosynthesis and the release of CO$_2$ via respiration, while the system is driven by periodic processes at different time-scales. The complexity of the underlying dynamics poses challenges to classical decomposition methods focused on maximizing data variance, such as singular spectrum analysis. Here, we explore whether nonlinear data-driven methods can better separate periodic patterns and their harmonics from noise and stochastic variability. We find that Nonlinear Laplacian Spectral Analysis (NLSA) outperforms the linear method and detects multiple relevant harmonics. However, these harmonics are not detected in the presence of substantial measurement irregularities. In summary, the NLSA approach can be used to both extract the seasonal cycle more accurately than linear methods, but likewise detect irregular signals resulting from irregular land-atmosphere interactions or measurement failures. Improving the detection capabilities of time-series decomposition is essential for improving land-atmosphere interactions models that should operate accurately on any time scale., Comment: 18 pages, 11 figures, research article

To harness the power of quantum computing (QC) in the near future, tight and efficient integration of QC with high performance computing (HPC) infrastructure (both on the software (SW) and the hardware (HW) level) is crucial. This paper addresses the development of a unified quantum platform (UQP) and how it is being integrated into the HPC ecosystem. It builds on the concepts of hybrid high performance computing - quantum computing (HPCQC) workflows and a unified HPCQC toolchain, introduced in our previous work and makes the next needed step: it unifies the low-level interface between the existing classical HPC systems and the emerging quantum hardware technologies, including but not limited to machines based on superconducting qubits, neutral atoms or trapped ions. The UQP consists of three core components: a runtime library, an instruction set architecture (ISA) and a quantum control processor (QCP) micro-architecture. In particular, this work contributes a unified HPCQC runtime library that bridges the gap between programming systems built on quantum intermediate representation (QIR) standard with a novel, unified hybrid ISA. It then introduces the initial extension of an ISA and QCP micro-architecture to be platform and technology agnostic and enables it as an efficient execution platform. The UQP has been verified to ensure correctness. Further, our performance analysis shows that the execution time and memory requirements of the runtime library scale super-linearly with number of qubits, which is critical to support scalability efforts in QC hardware., Comment: 10 pages, 8 figures, 2 tables, IEEE QCE24 conference

Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \beta x)$ is already definable in $(\mathbb{R},{<},+,\mathbb{Z})$. As a consequence we generalize Cobham-Semenov theorems for sets of real numbers to $\beta$-numeration systems, where $\beta$ is a quadratic irrational.

Dataset Distillation is used to create a concise, yet informative, synthetic dataset that can replace the original dataset for training purposes. Some leading methods in this domain prioritize long-range matching, involving the unrolling of training trajectories with a fixed number of steps (NS) on the synthetic dataset to align with various expert training trajectories. However, traditional long-range matching methods possess an overfitting-like problem, the fixed step size NS forces synthetic dataset to distortedly conform seen expert training trajectories, resulting in a loss of generality-especially to those from unencountered architecture. We refer to this as the Accumulated Mismatching Problem (AMP), and propose a new approach, Automatic Training Trajectories (ATT), which dynamically and adaptively adjusts trajectory length NS to address the AMP. Our method outperforms existing methods particularly in tests involving cross-architectures. Moreover, owing to its adaptive nature, it exhibits enhanced stability in the face of parameter variations., Comment: The paper is accepted at ECCV 2024

A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also known as the fully dynamic $\Delta$-orientation problem. The objective is to maintain an orientation of the edges in an undirected graph such that the out-degree of any vertex remains low. When edges are inserted or deleted, it may be necessary to reorient some edges to prevent vertices from having excessively high out-degrees. In this paper, we introduce the first algorithm that maintains an optimal edge orientation during both insertions and deletions. In experiments comparing with recent nearly exact algorithms, we achieve a 32% lower running time. The update time of our algorithm is up to 6 orders of magnitude faster than static exact algorithms.

Single-stranded RNA viruses co-assemble their capsid with the genome and variations in capsid structures can have significant functional relevance. In particular, viruses need to respond to a dehydrating environment to prevent genomic degradation and remain active upon rehydration. Theoretical work has predicted low-energy buckling transitions in icosahedral capsids which could protect the virus from further dehydration. However, there has been no direct experimental evidence, nor molecular mechanism, for such behaviour. Here we observe this transition using X-ray single particle imaging of MS2 bacteriophages after aerosolization. Using a combination of machine learning tools, we classify hundreds of thousands of single particle diffraction patterns to learn the structural landscape of the capsid morphology as a function of time spent in the aerosol phase. We found a previously unreported compact conformation as well as intermediate structures which suggest an incoherent buckling transition which does not preserve icosahedral symmetry. Finally, we propose a mechanism of this buckling, where a single 19-residue loop is destabilised, leading to the large observed morphology change. Our results provide experimental evidence for a mechanism by which viral capsids protect themselves from dehydration. In the process, these findings also demonstrate the power of single particle X-ray imaging and machine learning methods in studying biomolecular structural dynamics., Comment: 10 pages, 4 figures plus 9 pages supplementary information

We employ partitioning methods, in the spirit of Montiel--Ros but here recast for general actions of compact Lie groups, to prove effective lower bounds on the Morse index of certain families of closed minimal hypersurfaces in the round four-dimensional sphere, and of free boundary minimal hypersurfaces in the Euclidean four-dimensional ball. Our analysis reveals, in particular, phenomena of linear index growth for sequences of minimal hypersurfaces of fixed topological type, in strong contrast to the three-dimensional scenario.

Realizing tunable functional materials with built-in nanoscale heat flow directionality represents a significant challenge with the potential to enable novel thermal management strategies. Here we use spatiotemporally-resolved thermoreflectance to visualize lateral thermal transport anisotropy in self-assembled supercrystals of anisotropic Au nanocrystals. Correlative electron and thermoreflectance microscopy reveal that heat predominantly flows along the long-axis of the anisotropic nanocrystals, and does so across grain boundaries and curved assemblies while voids disrupt heat flow. We finely control the anisotropy via the aspect ratio of constituent nanorods, and it exceeds the aspect ratio for nano-bipyramid supercrystals and certain nanorod arrangements. Finite element simulations and effective medium modeling rationalize the emergent anisotropic behavior in terms of a simple series resistance model, further providing a framework for estimating thermal anisotropy as a function of material and structural parameters. Self-assembly of colloidal nanocrystals promises a novel route to direct heat flow in a wide range of applications that utilize this important class of materials.

A dynamic graph algorithm is a data structure that supports edge insertions, deletions, and specific problem queries. While extensive research exists on dynamic algorithms for graph problems solvable in polynomial time, most of these algorithms have not been implemented or empirically evaluated. This work addresses the NP-complete maximum weight and cardinality independent set problems in a dynamic setting, applicable to areas like dynamic map-labeling and vehicle routing. Real-world instances can be vast, with millions of vertices and edges, making it challenging to find near-optimal solutions quickly. Exact solvers can find optimal solutions but have exponential worst-case runtimes. Conversely, heuristic algorithms use local search techniques to improve solutions by optimizing vertices. In this work, we introduce a novel local search technique called optimal neighborhood exploration. This technique creates independent subproblems that are solved to optimality, leading to improved overall solutions. Through numerous experiments, we assess the effectiveness of our approach and compare it with other state-of-the-art dynamic solvers. Our algorithm features a parameter, the subproblem size, that balances running time and solution quality. With this parameter, our configuration matches state-of-the-art performance for the cardinality independent set problem. By increasing the parameter, we significantly enhance solution quality., Comment: arXiv admin note: text overlap with arXiv:2208.13645

Ultra-high-energy cosmic rays are known to be mainly of extragalactic origin, and their propagation is limited by energy losses, so their arrival directions are expected to correlate with the large-scale structure of the local Universe. In this work, we investigate the possible presence of intermediate-scale excesses in the flux of the most energetic cosmic rays from the direction of the supergalactic plane region using events with energies above 20 EeV recorded with the surface detector array of the Pierre Auger Observatory up to 31 December 2022, with a total exposure of 135,000 km^2 sr yr. The strongest indication for an excess that we find, with a post-trial significance of 3.1{\sigma}, is in the Centaurus region, as in our previous reports, and it extends down to lower energies than previously studied. We do not find any strong hints of excesses from any other region of the supergalactic plane at the same angular scale. In particular, our results do not confirm the reports by the Telescope Array collaboration of excesses from two regions in the Northern Hemisphere at the edge of the field of view of the Pierre Auger Observatory. With a comparable exposure, our results in those regions are in good agreement with the expectations from an isotropic distribution., Comment: submitted to ApJ

Multi-dimensional data frequently occur in many different fields, including risk management, insurance, biology, environmental sciences, and many more. In analyzing multivariate data, it is imperative that the underlying modelling assumptions adequately reflect both the marginal behavior as well as the associations between components. This work focuses specifically on developing a new multivariate Poisson model appropriate for multi-dimensional count data. The proposed formulation is based on convolutions of comonotonic shock vectors with Poisson distributed components and allows for flexibility in capturing different degrees of positive dependence. In this paper, the general model framework will be presented along with various distributional properties. Several estimation techniques will be explored and assessed both through simulations and in a real data application involving extreme rainfall events., Comment: 36 pages, 7 figures

The Carrollian fluid equations arise as the $c \to 0$ limit of the relativistic fluid equations and have recently experienced a surge of activity in the flat-space holography community. However, the rigorous mathematical well-posedness theory for these equations does not appear to have been previously studied. This paper is the third in a series in which we initiate the systematic analysis of the Carrollian fluid equations. In the present work we prove the global-in-time existence of bounded entropy solutions to the isentropic Carrollian fluid equations in one spatial dimension for a particular constitutive law ($\gamma = 3$). Our method is to use a vanishing viscosity approximation for which we establish a compensated compactness framework. Using this framework we also prove the compactness of entropy solutions in $L^\infty$, and establish a kinetic formulation of the problem. This global existence result in $L^\infty$ extends the $C^1$ theory presented in our companion paper ``One-Dimensional Carrollian Fluids II: $C^1$ Blow-up Criteria''., Comment: 31 pages

The Carrollian fluid equations arise from the equations for relativistic fluids in the limit as the speed of light vanishes, and have recently experienced a surge of interest in the theoretical physics community in the context of asymptotic symmetries and flat-space holography. In this paper we initiate the rigorous systematic analysis of these equations by studying them in one space dimension in the $C^1$ setting. We begin by proposing a notion of isentropic Carrollian equations, and use this to reduce the Carrollian equations to a $2 \times 2$ system of conservation laws. Using the scheme of Lax, we then classify when $C^1$ solutions to the isentropic Carrollian equations exist globally, or blow up in finite time. Our analysis assumes a Carrollian analogue of a constitutive relation for the Carrollian energy density, with exponent in the range $\gamma \in (1,3]$., Comment: 24 pages

Galilean and Carrollian algebras acting on two-dimensional Newton-Cartan and Carrollian manifolds are isomorphic. A consequence of this property is a duality correspondence between one-dimensional Galilean and Carrollian fluids. We describe the dynamics of these systems as they emerge from the relevant limits of Lorentzian hydrodynamics, and explore the advertised duality relationship. This interchanges longitudinal and transverse directions with respect to the flow velocity, and permutes equilibrium and out-of-equilibrium observables, unveiling specific features of Carrollian physics. We investigate the action of local hydrodynamic-frame transformations in the Galilean and Carrollian configurations, i.e. dual Galilean and Carrollian local boosts, and comment on their potential breaking. Emphasis is laid on the additional geometric elements that are necessary to attain complete systems of hydrodynamic equations in Newton-Cartan and Carroll spacetimes. Our analysis is conducted in general Cartan frames as well as in more explicit coordinates, specifically suited to Galilean or Carrollian use., Comment: 23 pages

Large Language Models (LLMs) vary in their abilities on a range of tasks. Initiatives such as the $\texttt{Open LLM Leaderboard}$ aim to quantify these differences with several large benchmarks (sets of test items to which an LLM can respond either correctly or incorrectly). However, high correlations within and between benchmark scores suggest that (1) there exists a small set of common underlying abilities that these benchmarks measure, and (2) items tap into redundant information and the benchmarks may thus be considerably compressed. We use data from $n > 5000$ LLMs to identify the most informative items of six benchmarks, ARC, GSM8K, HellaSwag, MMLU, TruthfulQA and WinoGrande (with $d=28,632$ items in total). From them we distill a sparse benchmark, $\texttt{metabench}$, that has less than $3\%$ of the original size of all six benchmarks combined. This new sparse benchmark goes beyond point scores by yielding estimators of the underlying benchmark-specific abilities. We show that these estimators (1) can be used to reconstruct each original $\textit{individual}$ benchmark score with, on average, $1.5\%$ root mean square error (RMSE), (2) reconstruct the original $\textit{total}$ score with $0.8\%$ RMSE, and (3) have a single underlying common factor whose Spearman correlation with the total score is $r = 0.93$., Comment: LLMs, benchmarking, IRT, information, compression

We present the history-aware transformer (HAT), a transformer-based model that uses shoppers' purchase history to personalise outfit predictions. The aim of this work is to recommend outfits that are internally coherent while matching an individual shopper's style and taste. To achieve this, we stack two transformer models, one that produces outfit representations and another one that processes the history of purchased outfits for a given shopper. We use these models to score an outfit's compatibility in the context of a shopper's preferences as inferred from their previous purchases. During training, the model learns to discriminate between purchased and random outfits using 3 losses: the focal loss for outfit compatibility typically used in the literature, a contrastive loss to bring closer learned outfit embeddings from a shopper's history, and an adaptive margin loss to facilitate learning from weak negatives. Together, these losses enable the model to make personalised recommendations based on a shopper's purchase history. Our experiments on the IQON3000 and Polyvore datasets show that HAT outperforms strong baselines on the outfit Compatibility Prediction (CP) and the Fill In The Blank (FITB) tasks. The model improves AUC for the CP hard task by 15.7% (IQON3000) and 19.4% (Polyvore) compared to previous SOTA results. It further improves accuracy on the FITB hard task by 6.5% and 9.7%, respectively. We provide ablation studies on the personalisation, constrastive loss, and adaptive margin loss that highlight the importance of these modelling choices.