Search

Quantum games, like quantum algorithms, exploit quantum entanglement to establish strong correlations between strategic player actions. This paper introduces quantum game-theoretic models applied to trading and demonstrates their implementation on an ion-trap quantum computer. The results showcase a quantum advantage, previously known only theoretically, realized as higher-paying market Nash equilibria. This advantage could help uncover alpha in trading strategies, defined as excess returns compared to established benchmarks. These findings suggest that quantum computing could significantly influence the development of financial strategies., Comment: 16 pages, 10 figures

Quantum system calibration is limited by the ability to characterize a quantum state under unknown device errors. We develop an accurate calibration protocol that is blind to the precise preparation of a specific quantum state. It extracts device errors from simple tomographic data only, and does not require bespoke experiments for a priori specified error mechanisms. Using a trapped-ion quantum computer, we experimentally demonstrate the accuracy of the method by recovering intentional miscalibrations. We then use blind calibration to estimate the native calibration parameters of the experimental system. The recovered calibrations are close to directly measured values and perform similarly in predicting state properties.

The quantum chromodynamics (QCD) phase diagram is key to answering open questions in physics, from states of matter in neutron stars to the early universe. However, classical simulations of QCD face significant computational barriers, such as the sign problem at finite matter densities. Quantum computing offers a promising solution to overcome these challenges. Here, we take an important step toward exploring the QCD phase diagram with quantum devices by preparing thermal states in one-dimensional non-Abelian gauge theories. We experimentally simulate the thermal states of SU(2) and SU(3) gauge theories at finite densities on a trapped-ion quantum computer using a variational method. This is achieved by introducing two features: Firstly, we add motional ancillae to the existing qubit register to efficiently prepare thermal probability distributions. Secondly, we introduce gauge-invariant measurements to enforce local gauge symmetries. This work marks the first lattice gauge theory quantum simulation of QCD at finite density and temperature for two and three colors, laying the foundation to explore QCD phenomena on quantum platforms., Comment: 20 pages, 10 figures

Document content extraction is crucial in computer vision, especially for meeting the high-quality data needs of large language models (LLMs) and retrieval-augmented generation (RAG) technologies. However, current document parsing methods suffer from significant limitations in terms of diversity and comprehensive evaluation. To address these challenges, we introduce OmniDocBench, a novel multi-source benchmark designed to advance automated document content extraction. OmniDocBench includes a meticulously curated and annotated high-quality evaluation dataset comprising nine diverse document types, such as academic papers, textbooks, slides, among others. Our benchmark provides a flexible and comprehensive evaluation framework with 19 layout category labels and 14 attribute labels, enabling multi-level assessments across entire datasets, individual modules, or specific data types. Using OmniDocBench, we perform an exhaustive comparative analysis of existing modular pipelines and multimodal end-to-end methods, highlighting their limitations in handling document diversity and ensuring fair evaluation. OmniDocBench establishes a robust, diverse, and fair evaluation standard for the document content extraction field, offering crucial insights for future advancements and fostering the development of document parsing technologies. The codes and dataset is available in https://github.com/opendatalab/OmniDocBench.

Retrieval-augmented Generation (RAG) enhances Large Language Models (LLMs) by integrating external knowledge to reduce hallucinations and incorporate up-to-date information without retraining. As an essential part of RAG, external knowledge bases are commonly built by extracting structured data from unstructured PDF documents using Optical Character Recognition (OCR). However, given the imperfect prediction of OCR and the inherent non-uniform representation of structured data, knowledge bases inevitably contain various OCR noises. In this paper, we introduce OHRBench, the first benchmark for understanding the cascading impact of OCR on RAG systems. OHRBench includes 350 carefully selected unstructured PDF documents from six real-world RAG application domains, along with Q&As derived from multimodal elements in documents, challenging existing OCR solutions used for RAG To better understand OCR's impact on RAG systems, we identify two primary types of OCR noise: Semantic Noise and Formatting Noise and apply perturbation to generate a set of structured data with varying degrees of each OCR noise. Using OHRBench, we first conduct a comprehensive evaluation of current OCR solutions and reveal that none is competent for constructing high-quality knowledge bases for RAG systems. We then systematically evaluate the impact of these two noise types and demonstrate the vulnerability of RAG systems. Furthermore, we discuss the potential of employing Vision-Language Models (VLMs) without OCR in RAG systems. Code: https://github.com/opendatalab/OHR-Bench

Photometric galaxy surveys, despite their limited resolution along the line of sight, encode rich information about the large-scale structure (LSS) of the Universe thanks to the large number density and extensive depth of the data. However, the complicated selection effects in wide and deep surveys will potentially cause significant bias in the angular two-point correlation function (2PCF) measured from those surveys. In this paper, we measure the 2PCF from the newly published KiDS-Legacy sample. Given an $r$-band $5\sigma$ magnitude limit of $24.8$ and survey footprint of $1347$ deg$^2$, it achieves an excellent combination of sky coverage and depth for such a measurement. We find that complex selection effects, primarily induced by varying seeing, introduce over-estimation of the 2PCF by approximately an order of magnitude. To correct for such effects, we apply a machine learning-based method to recover an ``organised random'' (OR) that presents the same selection pattern as the galaxy sample. The basic idea is to find the selection-induced clustering of galaxies using a combination of self-organising maps (SOM) and hierarchical clustering (HC). This unsupervised machine learning method is able to recover complicated selection effects without specifying their functional forms. We validate this ``SOM+HC'' method on mock deep galaxy samples with realistic systematics and selections derived from the KiDS-Legacy catalogue. Using mock data, we demonstrate that the OR delivers unbiased 2PCF cosmological parameter constraints, removing the $27\sigma$ offset in the galaxy bias parameter that is recovered when adopting uniform randoms. Blinded measurements on the real KiDS-Legacy data show that the corrected 2PCF is robust to the SOM+HC configuration near the optimal setup suggested by the mock tests. Our software is open-source for future usage., Comment: 29 pages, 27 figures, 4 tables

We introduce OneCovariance, an open-source software designed to accurately compute covariance matrices for an arbitrary set of two-point summary statistics across a variety of large-scale structure tracers. Utilising the halo model, we estimate the statistical properties of matter and biased tracer fields, incorporating all Gaussian, non-Gaussian, and super-sample covariance terms. The flexible configuration permits user-specific parameters, such as the complexity of survey geometry, the halo occupation distribution employed to define each galaxy sample, or the form of the real-space and/or Fourier space statistics to be analysed. We illustrate the capabilities of OneCovariance within the context of a cosmic shear analysis of the final data release of the Kilo-Degree Survey (KiDS-Legacy). Upon comparing our estimated covariance with measurements from mock data and calculations from independent software, we ascertain that OneCovariance achieves accuracy at the per cent level. When assessing the impact of ignoring complex survey geometry in the cosmic shear covariance computation, we discover misestimations at approximately the $10\%$ level for cosmic variance terms. Nonetheless, these discrepancies do not significantly affect the KiDS-Legacy recovery of cosmological parameters. We derive the cross-covariance between real-space correlation functions, bandpowers, and COSEBIs, facilitating future consistency tests among these three cosmic shear statistics. Additionally, we calculate the covariance matrix of photometric-spectroscopic galaxy clustering measurements, validating Jackknife covariance estimates for calibrating KiDS-Legacy redshift distributions. The OneCovariance can be found on github Hub together with a comprehensive documentation and examples., Comment: 37 pages, 11 figures, to be submitted to A&A, code available at https://github.com/rreischke/OneCovariance

The wide deployment of Large Language Models (LLMs) has given rise to strong demands for optimizing their inference performance. Today's techniques serving this purpose primarily focus on reducing latency and improving throughput through algorithmic and hardware enhancements, while largely overlooking their privacy side effects, particularly in a multi-user environment. In our research, for the first time, we discovered a set of new timing side channels in LLM systems, arising from shared caches and GPU memory allocations, which can be exploited to infer both confidential system prompts and those issued by other users. These vulnerabilities echo security challenges observed in traditional computing systems, highlighting an urgent need to address potential information leakage in LLM serving infrastructures. In this paper, we report novel attack strategies designed to exploit such timing side channels inherent in LLM deployments, specifically targeting the Key-Value (KV) cache and semantic cache widely used to enhance LLM inference performance. Our approach leverages timing measurements and classification models to detect cache hits, allowing an adversary to infer private prompts with high accuracy. We also propose a token-by-token search algorithm to efficiently recover shared prompt prefixes in the caches, showing the feasibility of stealing system prompts and those produced by peer users. Our experimental studies on black-box testing of popular online LLM services demonstrate that such privacy risks are completely realistic, with significant consequences. Our findings underscore the need for robust mitigation to protect LLM systems against such emerging threats., Comment: This work was submitted for review on Sept. 5, 2024, and the initial version was uploaded to Arxiv on Sept. 30, 2024

Document content analysis has been a crucial research area in computer vision. Despite significant advancements in methods such as OCR, layout detection, and formula recognition, existing open-source solutions struggle to consistently deliver high-quality content extraction due to the diversity in document types and content. To address these challenges, we present MinerU, an open-source solution for high-precision document content extraction. MinerU leverages the sophisticated PDF-Extract-Kit models to extract content from diverse documents effectively and employs finely-tuned preprocessing and postprocessing rules to ensure the accuracy of the final results. Experimental results demonstrate that MinerU consistently achieves high performance across various document types, significantly enhancing the quality and consistency of content extraction. The MinerU open-source project is available at https://github.com/opendatalab/MinerU., Comment: MinerU Technical Report

We explore the enhanced self-calibration of photometric galaxy redshift distributions, $n(z)$, through the combination of up to six two-point functions. Our $\rm 3\times2pt$ configuration is comprised of photometric shear, spectroscopic galaxy clustering, and spectroscopic-photometric galaxy-galaxy lensing (GGL). We further include spectroscopic-photometric cross-clustering; photometric GGL; and photometric auto-clustering, using the photometric shear sample as density tracer. We perform simulated likelihood forecasts of the cosmological and nuisance parameter constraints for Stage-III- and Stage-IV-like surveys. For the Stage-III-like case, we employ realistic but perturbed redshift distributions, and distinguish between "coherent" shifting in one direction, versus more internal scattering and full-shape errors. For perfectly known $n(z)$, a $\rm 6\times2pt$ analysis gains $\sim40\%$ in Figure of Merit (FoM) in the $S_8\equiv\sigma_8\sqrt{\Omega_{\rm m}/0.3}$ and $\Omega_{\rm m}$ plane relative to the $\rm 3\times2pt$ analysis. If untreated, coherent and incoherent redshift errors lead to inaccurate inferences of $S_8$ and $\Omega_{\rm m}$, respectively. Employing bin-wise scalar shifts $\delta{z}_i$ in the tomographic mean redshifts reduces cosmological parameter biases, with a $\rm 6x2pt$ analysis constraining the shift parameters with $2-4$ times the precision of a photometric $\rm 3^{ph}\times2pt$ analysis. For the Stage-IV-like survey, a $\rm 6\times2pt$ analysis doubles the FoM($\sigma_8{-}\Omega_{\rm m}$) compared to any $\rm 3\times2pt$ or $\rm 3^{ph}\times2pt$ analysis, and is only $8\%$ less constraining than if the $n(z)$ were perfectly known. A Gaussian mixture model for the $n(z)$ reduces mean-redshift errors and preserves the $n(z)$ shape. It also yields the most accurate and precise cosmological constraints for any $N\rm\times2pt$ configuration given $n(z)$ biases., Comment: 38 pages, 20 figures, to be submitted to A&A

To date, galaxy image simulations for weak lensing surveys usually approximate the light profiles of all galaxies as a single or double S\'ersic profile, neglecting the influence of galaxy substructures and morphologies deviating from such a simplified parametric characterization. While this approximation may be sufficient for previous data sets, the stringent cosmic shear calibration requirements and the high quality of the data in the upcoming Euclid survey demand a consideration of the effects that realistic galaxy substructures have on shear measurement biases. Here we present a novel deep learning-based method to create such simulated galaxies directly from HST data. We first build and validate a convolutional neural network based on the wavelet scattering transform to learn noise-free representations independent of the point-spread function of HST galaxy images that can be injected into simulations of images from Euclid's optical instrument VIS without introducing noise correlations during PSF convolution or shearing. Then, we demonstrate the generation of new galaxy images by sampling from the model randomly and conditionally. Next, we quantify the cosmic shear bias from complex galaxy shapes in Euclid-like simulations by comparing the shear measurement biases between a sample of model objects and their best-fit double-S\'ersic counterparts. Using the KSB shape measurement algorithm, we find a multiplicative bias difference between these branches with realistic morphologies and parametric profiles on the order of $6.9\times 10^{-3}$ for a realistic magnitude-S\'ersic index distribution. Moreover, we find clear detection bias differences between full image scenes simulated with parametric and realistic galaxies, leading to a bias difference of $4.0\times 10^{-3}$ independent of the shape measurement method. This makes it relevant for stage IV weak lensing surveys such as Euclid., Comment: Submitted to A&A. 29 pages, 20 figures, 2 tables

Formula recognition presents significant challenges due to the complicated structure and varied notation of mathematical expressions. Despite continuous advancements in formula recognition models, the evaluation metrics employed by these models, such as BLEU and Edit Distance, still exhibit notable limitations. They overlook the fact that the same formula has diverse representations and is highly sensitive to the distribution of training data, thereby causing the unfairness in formula recognition evaluation. To this end, we propose a Character Detection Matching (CDM) metric, ensuring the evaluation objectivity by designing a image-level rather than LaTex-level metric score. Specifically, CDM renders both the model-predicted LaTeX and the ground-truth LaTeX formulas into image-formatted formulas, then employs visual feature extraction and localization techniques for precise character-level matching, incorporating spatial position information. Such a spatially-aware and character-matching method offers a more accurate and equitable evaluation compared with previous BLEU and Edit Distance metrics that rely solely on text-based character matching. Experimentally, we evaluated various formula recognition models using CDM, BLEU, and ExpRate metrics. Their results demonstrate that the CDM aligns more closely with human evaluation standards and provides a fairer comparison across different models by eliminating discrepancies caused by diverse formula representations., Comment: Project Website: https://github.com/opendatalab/UniMERNet/tree/main/cdm

Indonesian and Western gamelan ensembles are investigated with respect to performance differences. Thereby, the often exotistic history of this music in the West might be reflected in contemporary tonal system, articulation, or large-scale form differences. Analyzing recordings of four Western and five Indonesian orchestras with respect to tonal systems and timbre features and using self-organizing Kohonen map (SOM) as a machine learning algorithm, a clear clustering between Indonesian and Western ensembles appears using certain psychoacoustic features. These point to a reduced articulation and large-scale form variability of Western ensembles compared to Indonesian ones. The SOM also clusters the ensembles with respect to their tonal systems, but no clusters between Indonesian and Western ensembles can be found in this respect. Therefore, a clear analogy between lower articulatory variability and large-scale form variation and a more exostistic, mediative and calm performance expectation and reception of gamelan in the West therefore appears., Comment: 5 figures, 4 tables

Semantic communication (SemCom) has been a transformative paradigm, emphasizing the precise exchange of meaningful information over traditional bit-level transmissions. However, existing SemCom research, primarily centered on simplified scenarios like single-pair transmissions with direct wireless links, faces significant challenges when applied to real-world radio access networks (RANs). This article introduces a Semantic-aware Radio Access Network (S-RAN), offering a holistic systematic view of SemCom beyond single-pair transmissions. We begin by outlining the S-RAN architecture, introducing new physical components and logical functions along with key design challenges. We then present transceiver design for end-to-end transmission to overcome conventional SemCom transceiver limitations, including static channel conditions, oversimplified background knowledge models, and hardware constraints. Later, we delve into the discussion on radio resource management for multiple users, covering semantic channel modeling, performance metrics, resource management algorithms, and a case study, to elaborate distinctions from resource management for legacy RANs. Finally, we highlight open research challenges and potential solutions. The objective of this article is to serve as a basis for advancing SemCom research into practical wireless systems.

The transition from current Stage-III surveys such as the Kilo-Degree Survey (KiDS) to the increased area and redshift range of Stage IV surveys such as Euclid will significantly increase the precision of weak lensing analyses. However, with increasing precision, the accuracy of model assumptions needs to be evaluated. In this study, we quantify the impact of the correlated clustering of weak lensing source galaxies with the surrounding large-scale structure, known as source-lens clustering (SLC), which is commonly neglected. For this, we use simulated cosmological datasets with realistically distributed galaxies and measure shear correlation functions for both clustered and uniformly distributed source galaxies. Cosmological analyses are performed for both scenarios to quantify the impact of SLC on parameter inference for a KiDS-like and a Euclid-like setting. We find for Stage III surveys, SLC has a minor impact when accounting for nuisance parameters for intrinsic alignments and shifts of tomographic bins, as these nuisance parameters absorb the effect of SLC, thus changing their original meaning. For KiDS (Euclid), the inferred intrinsic alignment amplitude $A_{IA}$ changes from $0.11_{-0.46}^{+0.44}$ ($-0.009_{-0.080}^{+0.079}$) for data without SLC to $0.28_{-0.44}^{+0.42}$ ($0.022_{-0.082}^{+0.081}$) with SLC. However, fixed nuisance parameters lead to shifts in $S_8$ and $\Omega_{m}$, emphasizing the need for including SLC in the modelling. For Euclid, we find that $\sigma_8$, $\Omega_m$, and $w_0$ are shifted by $0.19$, $0.12$, and $0.12\, \sigma$, respectively, when including free nuisance parameters, and by $0.20$, $0.16$, and $0.32\,\sigma$ when fixing the nuisance parameters. Consequently, SLC on its own has only a small impact on the inferred parameter inference when using uninformative priors for nuisance parameters., Comment: 17 pages plus appendix, 10 figures, replaced by version accepted by Astronomy & Astrophysics. Abstract abridged on arXiv

We present InternLM-XComposer-2.5 (IXC-2.5), a versatile large-vision language model that supports long-contextual input and output. IXC-2.5 excels in various text-image comprehension and composition applications, achieving GPT-4V level capabilities with merely 7B LLM backend. Trained with 24K interleaved image-text contexts, it can seamlessly extend to 96K long contexts via RoPE extrapolation. This long-context capability allows IXC-2.5 to excel in tasks requiring extensive input and output contexts. Compared to its previous 2.0 version, InternLM-XComposer-2.5 features three major upgrades in vision-language comprehension: (1) Ultra-High Resolution Understanding, (2) Fine-Grained Video Understanding, and (3) Multi-Turn Multi-Image Dialogue. In addition to comprehension, IXC-2.5 extends to two compelling applications using extra LoRA parameters for text-image composition: (1) Crafting Webpages and (2) Composing High-Quality Text-Image Articles. IXC-2.5 has been evaluated on 28 benchmarks, outperforming existing open-source state-of-the-art models on 16 benchmarks. It also surpasses or competes closely with GPT-4V and Gemini Pro on 16 key tasks. The InternLM-XComposer-2.5 is publicly available at https://github.com/InternLM/InternLM-XComposer., Comment: Technical Report. https://github.com/InternLM/InternLM-XComposer

Network-based biocomputation (NBC) is an alternative parallel computing paradigm that encodes combinatorial problems into a nanofabricated device's graphical network of channels, enabling cytoskeletal filaments propelled by molecular motors to explore the problems' solution space. NBC promises to require significantly less energy than traditional computers due to the high energy efficiency of molecular motors. However, error rates associated with the pass junction crossing, the primary path-regulating geometry, pose a bottleneck for scaling up this technology. Here, we optimize the geometry of the pass junction for low error rates for the actin-myosin system. To do so, we evaluate various pass junction designs that differ in features, such as the nanochannel width, junction crossing area, and angles of a funnel-shaped output part of the junction. Error rates were measured experimentally by using gliding motility assay and as well as by simulation methods. The final optimized design displayed a decreased error rate of under 1 percent compared to the previous 2-4 percent. We anticipate this improvement will enable scaling up NBC networks from tens to hundreds of pass junctions. However, the results of 2D junction optimizations also suggest that further drastic reduction of error rates in two-dimensional pass junctions is unlikely, necessitating three-dimensional junctions, such as bridges or tunnels, for complete error rate mitigation. Furthermore, the simulation results demonstrate that including a layer of myosin motor on the channel provides a better fit between simulation and experimental results., Comment: 22 pages plus supplementary information, 6 figures

Cosmic shear is a powerful probe of cosmology, but it is affected by the intrinsic alignment (IA) of galaxy shapes with the large-scale structure. Upcoming surveys like Euclid and Vera C. Rubin Observatory's Legacy Survey of Space and Time (LSST) require an accurate understanding of IA, particularly for higher-order cosmic shear statistics that are vital for extracting the most cosmological information. In this paper, we report the first detection of third-order IA correlations using the LOWZ galaxy sample from the Sloan Digital Sky Survey (SDSS) Baryon Oscillation Spectroscopic Survey (BOSS). We compare our measurements with predictions from the MICE cosmological simulation and an analytical NLA-inspired model informed by second-order correlations. We also explore the dependence of the third-order correlation on the galaxies' luminosity. We find that the amplitude $A_\mathrm{IA}$ of the IA signal is non-zero at the $4.7\sigma$ ($7.6\sigma$) level for scales between $6 h^{-1} \mathrm{Mpc}$ ($1 h^{-1} \mathrm{Mpc}$) and $20 h^{-1} \mathrm{Mpc}$. For scales above $6 h^{-1}\mathrm{Mpc}$ the inferred AIA agrees both with the prediction from the simulation and estimates from second-order statistics within $1\sigma$ but deviations arise at smaller scales. Our results demonstrate the feasibility of measuring third-order IA correlations and using them for constraining IA models. The agreement between second- and third-order IA constraints also opens the opportunity for a consistent joint analysis and IA self-calibration, promising tighter parameter constraints for upcoming cosmological surveys., Comment: 10 pages + appendix, 4 figures, replaced by version accepted by Astronomy and Astrophysics after minor changes

In the era of artificial intelligence, the diversity of data modalities and annotation formats often renders data unusable directly, requiring understanding and format conversion before it can be used by researchers or developers with different needs. To tackle this problem, this article introduces a framework called Dataset Description Language (DSDL) that aims to simplify dataset processing by providing a unified standard for AI datasets. DSDL adheres to the three basic practical principles of generic, portable, and extensible, using a unified standard to express data of different modalities and structures, facilitating the dissemination of AI data, and easily extending to new modalities and tasks. The standardized specifications of DSDL reduce the workload for users in data dissemination, processing, and usage. To further improve user convenience, we provide predefined DSDL templates for various tasks, convert mainstream datasets to comply with DSDL specifications, and provide comprehensive documentation and DSDL tools. These efforts aim to simplify the use of AI data, thereby improving the efficiency of AI development.

We present the Flagship galaxy mock, a simulated catalogue of billions of galaxies designed to support the scientific exploitation of the Euclid mission. Euclid is a medium-class mission of the European Space Agency optimised to determine the properties of dark matter and dark energy on the largest scales of the Universe. It probes structure formation over more than 10 billion years primarily from the combination of weak gravitational lensing and galaxy clustering data. The breath of Euclid's data will also foster a wide variety of scientific analyses. The Flagship simulation was developed to provide a realistic approximation to the galaxies that will be observed by Euclid and used in its scientific analyses. We ran a state-of-the-art N-body simulation with four trillion particles, producing a lightcone on the fly. From the dark matter particles, we produced a catalogue of 16 billion haloes in one octant of the sky in the lightcone up to redshift z=3. We then populated these haloes with mock galaxies using a halo occupation distribution and abundance matching approach, calibrating the free parameters of the galaxy mock against observed correlations and other basic galaxy properties. Modelled galaxy properties include luminosity and flux in several bands, redshifts, positions and velocities, spectral energy distributions, shapes and sizes, stellar masses, star formation rates, metallicities, emission line fluxes, and lensing properties. We selected a final sample of 3.4 billion galaxies with a magnitude cut of H_E<26, where we are complete. We have performed a comprehensive set of validation tests to check the similarity to observational data and theoretical models. In particular, our catalogue is able to closely reproduce the main characteristics of the weak lensing and galaxy clustering samples to be used in the mission's main cosmological analysis. (abridged), Comment: Paper submitted as part of the A&A special issue `Euclid on Sky', which contains Euclid key reference papers and first results from the Euclid Early Release Observations

The current standard model of cosmology successfully describes a variety of measurements, but the nature of its main ingredients, dark matter and dark energy, remains unknown. Euclid is a medium-class mission in the Cosmic Vision 2015-2025 programme of the European Space Agency (ESA) that will provide high-resolution optical imaging, as well as near-infrared imaging and spectroscopy, over about 14,000 deg^2 of extragalactic sky. In addition to accurate weak lensing and clustering measurements that probe structure formation over half of the age of the Universe, its primary probes for cosmology, these exquisite data will enable a wide range of science. This paper provides a high-level overview of the mission, summarising the survey characteristics, the various data-processing steps, and data products. We also highlight the main science objectives and expected performance., Comment: Accepted for publication in the A&A special issue`Euclid on Sky'

Euclid is a recently launched medium-class mission by the European Space Agency (ESA) designed to measure cosmological parameters, test the cosmological standard model, and explore the nature of dark matter and dark energy. To this end, Euclid conducts a survey of up to 14000 square degrees of the extra-galactic sky and obtains optical and near-infrared photometric measurements for more than a billion galaxies as well as near-infrared slitless spectroscopy for more than 35 million galaxies. These observations will be used to estimate galaxy clustering and cosmic shear. It is expected that Euclid will achieve percent-level constraints on the Dark Energy equation of state parameter. The survey will also be exploited with a range of other cosmological probes and prove revolutionary for non-cosmological science., Comment: 8 pages, 3 figures, contribution to the 2024 Cosmology session of the 58th Rencontres de Moriond

Task-oriented semantic communications (TSC) enhance radio resource efficiency by transmitting task-relevant semantic information. However, current research often overlooks the inherent semantic distinctions among encoded features. Due to unavoidable channel variations from time and frequency-selective fading, semantically sensitive feature units could be more susceptible to erroneous inference if corrupted by dynamic channels. Therefore, this letter introduces a unified channel-resilient TSC framework via information bottleneck. This framework complements existing TSC approaches by controlling information flow to capture fine-grained feature-level semantic robustness. Experiments on a case study for real-time subchannel allocation validate the framework's effectiveness., Comment: This work has been submitted to the IEEE Communications Letters

The Large Vision-Language Model (LVLM) field has seen significant advancements, yet its progression has been hindered by challenges in comprehending fine-grained visual content due to limited resolution. Recent efforts have aimed to enhance the high-resolution understanding capabilities of LVLMs, yet they remain capped at approximately 1500 x 1500 pixels and constrained to a relatively narrow resolution range. This paper represents InternLM-XComposer2-4KHD, a groundbreaking exploration into elevating LVLM resolution capabilities up to 4K HD (3840 x 1600) and beyond. Concurrently, considering the ultra-high resolution may not be necessary in all scenarios, it supports a wide range of diverse resolutions from 336 pixels to 4K standard, significantly broadening its scope of applicability. Specifically, this research advances the patch division paradigm by introducing a novel extension: dynamic resolution with automatic patch configuration. It maintains the training image aspect ratios while automatically varying patch counts and configuring layouts based on a pre-trained Vision Transformer (ViT) (336 x 336), leading to dynamic training resolution from 336 pixels to 4K standard. Our research demonstrates that scaling training resolution up to 4K HD leads to consistent performance enhancements without hitting the ceiling of potential improvements. InternLM-XComposer2-4KHD shows superb capability that matches or even surpasses GPT-4V and Gemini Pro in 10 of the 16 benchmarks. The InternLM-XComposer2-4KHD model series with 7B parameters are publicly available at https://github.com/InternLM/InternLM-XComposer., Comment: Code and models are publicly available at https://github.com/InternLM/InternLM-XComposer

A nonlinear-dynamical algorithm for city planning is proposed as an Impulse Pattern Formulation (IPF) for predicting relevant parameters like health, artistic freedom, or financial developments of different social or political stakeholders over the cause of a planning process. The IPF has already shown high predictive precision at low computational cost in musical instrument simulations, brain dynamics, and human-human interactions. The social and political IPF consists of three basic equations of system state developments, self-adaptation of stakeholders, two adaptive interactions, and external impact terms suitable for respective planning situations. Typical scenarios of stakeholder interactions and developments are modeled by adjusting a set of system parameters. These include stakeholder reaction to external input, enhanced system stability through self-adaptation, stakeholder convergence due to adaptive interaction, as well as complex dynamics in terms of fixed stakeholder impacts. A workflow for implementing the algorithm in real city planning scenarios is outlined. This workflow includes machine learning of a suitable set of parameters suggesting best-practice planning to aim at the desired development of the planning process and its output.

The evolution of Large Language Models (LLMs) like ChatGPT and GPT-4 has sparked discussions on the advent of Artificial General Intelligence (AGI). However, replicating such advancements in open-source models has been challenging. This paper introduces InternLM2, an open-source LLM that outperforms its predecessors in comprehensive evaluations across 6 dimensions and 30 benchmarks, long-context modeling, and open-ended subjective evaluations through innovative pre-training and optimization techniques. The pre-training process of InternLM2 is meticulously detailed, highlighting the preparation of diverse data types including text, code, and long-context data. InternLM2 efficiently captures long-term dependencies, initially trained on 4k tokens before advancing to 32k tokens in pre-training and fine-tuning stages, exhibiting remarkable performance on the 200k ``Needle-in-a-Haystack" test. InternLM2 is further aligned using Supervised Fine-Tuning (SFT) and a novel Conditional Online Reinforcement Learning from Human Feedback (COOL RLHF) strategy that addresses conflicting human preferences and reward hacking. By releasing InternLM2 models in different training stages and model sizes, we provide the community with insights into the model's evolution.

Objective: Most current wearable tonic-clonic seizure (TCS) detection systems are based on extra-cerebral signals, such as electromyography (EMG) or accelerometry (ACC). Although many of these devices show good sensitivity in seizure detection, their false positive rates (FPR) are still relatively high. Wearable EEG may improve performance; however, studies investigating this remain scarce. This paper aims 1) to investigate the possibility of detecting TCSs with a behind-the-ear, two-channel wearable EEG, and 2) to evaluate the added value of wearable EEG to other non-EEG modalities in multimodal TCS detection. Method: We included 27 participants with a total of 44 TCSs from the European multicenter study SeizeIT2. The multimodal wearable detection system Sensor Dot (Byteflies) was used to measure two-channel, behind-the-ear EEG, EMG, electrocardiography (ECG), ACC and gyroscope (GYR). First, we evaluated automatic unimodal detection of TCSs, using performance metrics such as sensitivity, precision, FPR and F1-score. Secondly, we fused the different modalities and again assessed performance. Algorithm-labeled segments were then provided to a neurologist and a wearable data expert, who reviewed and annotated the true positive TCSs, and discarded false positives (FPs). Results: Wearable EEG outperformed the other modalities in unimodal TCS detection by achieving a sensitivity of 100.0% and a FPR of 10.3/24h (compared to 97.7% sensitivity and 30.9/24h FPR for EMG; 95.5% sensitivity and 13.9 FPR for ACC). The combination of wearable EEG and EMG achieved overall the most clinically useful performance in offline TCS detection with a sensitivity of 97.7%, a FPR of 0.4/24 h, a precision of 43.0%, and a F1-score of 59.7%. Subsequent visual review of the automated detections resulted in maximal sensitivity and zero FPs.

Kohonen Maps, aka. Self-organizing maps (SOMs) are neural networks that visualize a high-dimensional feature space on a low-dimensional map. While SOMs are an excellent tool for data examination and exploration, they inherently cause a loss of detail. Visualizations of the underlying data do not integrate well and, therefore, fail to provide an overall picture. Consequently, we suggest SOMson, an interactive sonification of the underlying data, as a data augmentation technique. The sonification increases the amount of information provided simultaneously by the SOM. Instead of a user study, we present an interactive online example, so readers can explore SOMson themselves. Its strengths, weaknesses, and prospects are discussed., Comment: 8 pages, 5 figures, linked YouTube videos and interactive demos

Integrity is critical for maintaining system security, as it ensures that only genuine software is loaded onto a machine. Although confidential virtual machines (CVMs) function within isolated environments separate from the host, it is important to recognize that users still encounter challenges in maintaining control over the integrity of the code running within the trusted execution environments (TEEs). The presence of a sophisticated operating system (OS) raises the possibility of dynamically creating and executing any code, making user applications within TEEs vulnerable to interference or tampering if the guest OS is compromised. To address this issue, this paper introduces NestedSGX, a framework which leverages virtual machine privilege level (VMPL), a recent hardware feature available on AMD SEV-SNP to enable the creation of hardware enclaves within the guest VM. Similar to Intel SGX, NestedSGX considers the guest OS untrusted for loading potentially malicious code. It ensures that only trusted and measured code executed within the enclave can be remotely attested. To seamlessly protect existing applications, NestedSGX aims for compatibility with Intel SGX by simulating SGX leaf functions. We have also ported the SGX SDK and the Occlum library OS to NestedSGX, enabling the use of existing SGX toolchains and applications in the system. Performance evaluations show that context switches in NestedSGX take about 32,000 -- 34,000 cycles, approximately $1.9\times$ -- $2.1\times$ higher than that of Intel SGX. NestedSGX incurs minimal overhead in most real-world applications, with an average overhead below 2% for computation and memory intensive workloads and below 15.68% for I/O intensive workloads., Comment: NDSS 2025 accepted version

As data science applications gain adoption across industries, the tooling landscape matures to facilitate the life cycle of such applications and provide solutions to the challenges involved to boost the productivity of the people involved. Reinforcement learning with agents in a 3D world could still face challenges: the knowledge required to use a simulation software as well as the utilization of a standalone simulation software in unattended training pipelines. In this paper we review tools and approaches to train reinforcement learning agents for robots in 3D worlds with respect to the robot Robotino and argue that the separation of the simulation environment for creators of virtual worlds and the model development environment for data scientists is not a well covered topic. Often both are the same and data scientists require knowledge of the simulation software to work directly with their APIs. Moreover, sometimes creators of virtual worlds and data scientists even work on the same files. We want to contribute to that topic by describing an approach where data scientists don't require knowledge about the simulation software. Our approach uses the standalone simulation software Webots, the Robot Operating System to communicate with simulated robots as well as the simulation software itself and container technology to separate the simulation from the model development environment. We put emphasize on the APIs the data scientists work with and the use of a standalone simulation software in unattended training pipelines. We show the parts that are specific to the Robotino and the robot task to learn., Comment: Latex with llncs.cls, 17 pages, 5 figures

Background. The Expected Value of Sample Information (EVSI) measures the expected benefits that could be obtained by collecting additional data. Estimating EVSI using the traditional nested Monte Carlo method is computationally expensive but the recently developed Gaussian approximation (GA) approach can efficiently estimate EVSI across different sample sizes. However, the conventional GA may result in biased EVSI estimates if the decision models are highly nonlinear. This bias may lead to suboptimal study designs when GA is used to optimize the value of different studies. Therefore, we extend the conventional GA approach to improve its performance for nonlinear decision models. Methods. Our method provides accurate EVSI estimates by approximating the conditional benefit based on two steps. First, a Taylor series approximation is applied to estimate the conditional benefit as a function of the conditional moments of the parameters of interest using a spline, which is fitted to the samples of the parameters and the corresponding benefits. Next, the conditional moments of parameters are approximated by the conventional GA and Fisher information. The proposed approach is applied to several data collection exercises involving non-Gaussian parameters and nonlinear decision models. Its performance is compared with the nested Monte Carlo method, the conventional GA approach, and the nonparametric regression-based method for EVSI calculation. Results. The proposed approach provides accurate EVSI estimates across different sample sizes when the parameters of interest are non-Gaussian and the decision models are nonlinear. The computational cost of the proposed method is similar to other novel methods. Conclusions. The proposed approach can estimate EVSI across sample sizes accurately and efficiently, which may support researchers in determining an economically optimal study design using EVSI., Comment: 11 pages, 2 figures, presented at 44th Medical Decision Making Annual North American Meeting

We introduce InternLM-XComposer2, a cutting-edge vision-language model excelling in free-form text-image composition and comprehension. This model goes beyond conventional vision-language understanding, adeptly crafting interleaved text-image content from diverse inputs like outlines, detailed textual specifications, and reference images, enabling highly customizable content creation. InternLM-XComposer2 proposes a Partial LoRA (PLoRA) approach that applies additional LoRA parameters exclusively to image tokens to preserve the integrity of pre-trained language knowledge, striking a balance between precise vision understanding and text composition with literary talent. Experimental results demonstrate the superiority of InternLM-XComposer2 based on InternLM2-7B in producing high-quality long-text multi-modal content and its exceptional vision-language understanding performance across various benchmarks, where it not only significantly outperforms existing multimodal models but also matches or even surpasses GPT-4V and Gemini Pro in certain assessments. This highlights its remarkable proficiency in the realm of multimodal understanding. The InternLM-XComposer2 model series with 7B parameters are publicly available at https://github.com/InternLM/InternLM-XComposer., Comment: Code and models are available at https://github.com/InternLM/InternLM-XComposer

The effective sample size (ESS) measures the informational value of a probability distribution in terms of an equivalent number of study participants. The ESS plays a crucial role in estimating the Expected Value of Sample Information (EVSI) through the Gaussian approximation approach. Despite the significance of ESS, existing ESS estimation methods within the Gaussian approximation framework are either computationally expensive or potentially inaccurate. To address these limitations, we propose a novel approach that estimates the ESS using the summary statistics of generated datasets and nonparametric regression methods. The simulation results suggest that the proposed method provides accurate ESS estimates at a low computational cost, making it an efficient and practical way to quantify the information contained in the probability distribution of a parameter. Overall, determining the ESS can help analysts understand the uncertainty levels in complex prior distributions in the probability analyses of decision models and perform efficient EVSI calculations., Comment: 5 pages