Search

The ability to read, interpret, and critique data visualizations has mainly been assessed using data visualization tasks like value retrieval. Although evidence on different facets of Visual Data Literacy (VDL) is well established in visualization research and includes numeracy, graph familiarity, or aesthetic elements, they have not been sufficiently considered in ability assessments. Here, VDL is considered a multidimensional ability whose facets can be partially self-assessed. We introduce an assessment in which VDL is deconstructed as a process of understanding, in reference to frameworks from the learning sciences. MAVIL, Multidimensional Assessment of Visual Data Literacy, is composed of six ability dimensions: General Impression/Abstract Thinking, Graph Elements/Familiarity, Aesthetic Perception, Visualization Criticism, Data Reading Tasks and Numeracy/Topic Knowledge. MAVIL was designed for general audiences and implemented in a survey (n=438), representative of Austria's age groups (18-74 years) and gender split. The survey mirrors the population's VDL and shows the perception of two climate data visualizations, a line and bar chart. We found that $48\%$ of respondents make mistakes with the simple charts, while $5\%$ believe that they cannot summarize the visualization content. About a quarter have deficits in comprehending simple data units, and $19-20\%$ are unfamiliar with each displayed chart type., Comment: 9 pages, 8 figures, 1 table

Recent advancements in large language models (LLMs) have led to their increased application across various tasks, with reinforcement learning from human feedback (RLHF) being a crucial part of their training to align responses with user intentions. In the RLHF process, a reward model is trained using responses preferences determined by human labelers or AI systems, which then refines the LLM through reinforcement learning. This work introduces weak supervision as a strategy to extend RLHF datasets and enhance reward model performance. Weak supervision employs noisy or imprecise data labeling, reducing reliance on expensive manually labeled data. By analyzing RLHF datasets to identify heuristics that correlate with response preference, we wrote simple labeling functions and then calibrated a label model to weakly annotate unlabeled data. Our evaluation show that while weak supervision significantly benefits smaller datasets by improving reward model performance, its effectiveness decreases with larger, originally labeled datasets. Additionally, using an LLM to generate and then weakly label responses offers a promising method for extending preference data.

GPT-4o is an autoregressive omni model that accepts as input any combination of text, audio, image, and video, and generates any combination of text, audio, and image outputs. It's trained end-to-end across text, vision, and audio, meaning all inputs and outputs are processed by the same neural network. GPT-4o can respond to audio inputs in as little as 232 milliseconds, with an average of 320 milliseconds, which is similar to human response time in conversation. It matches GPT-4 Turbo performance on text in English and code, with significant improvement on text in non-English languages, while also being much faster and 50\% cheaper in the API. GPT-4o is especially better at vision and audio understanding compared to existing models. In line with our commitment to building AI safely and consistent with our voluntary commitments to the White House, we are sharing the GPT-4o System Card, which includes our Preparedness Framework evaluations. In this System Card, we provide a detailed look at GPT-4o's capabilities, limitations, and safety evaluations across multiple categories, focusing on speech-to-speech while also evaluating text and image capabilities, and measures we've implemented to ensure the model is safe and aligned. We also include third-party assessments on dangerous capabilities, as well as discussion of potential societal impacts of GPT-4o's text and vision capabilities.

The even spin components of the strata of Abelian differentials are difficult to handle from a birational geometry perspective due to the fact that their spin line bundles have more sections than expected. Nevertheless, in this paper, we prove that for large genus, the minimal even spin components are of general type. This result complements the previous work by the second and third authors, together with Costantini, on the Kodaira dimension of general strata and the minimal odd spin components of Abelian differentials. Our main technical tool is the computation and estimation of a series of effective divisor classes on the even spin components.

This work addresses the problem of \textit{shape completion}, i.e., the task of restoring incomplete shapes by predicting their missing parts. While previous works have often predicted the fractured and restored shape in one step, we approach the task by separately predicting the fractured and newly restored parts, but ensuring these predictions are interconnected. We use a decoder network motivated by related work on the prediction of signed distance functions (DeepSDF). In particular, our representation allows us to consider test-time-training, i.e., finetuning network parameters to match the given incomplete shape more accurately during inference. While previous works often have difficulties with artifacts around the fracture boundary, we demonstrate that our overfitting to the fractured parts leads to significant improvements in the restoration of eight different shape categories of the ShapeNet data set in terms of their chamfer distances.

Understanding the neurobiology of opioid use disorder (OUD) using resting-state functional magnetic resonance imaging (rs-fMRI) may help inform treatment strategies to improve patient outcomes. Recent literature suggests temporal characteristics of rs-fMRI blood oxygenation level-dependent (BOLD) signals may offer complementary information to functional connectivity analysis. However, existing studies of OUD analyze BOLD signals using measures computed across all time points. This study, for the first time in the literature, employs data-driven machine learning (ML) modeling of rs-fMRI BOLD features representing multiple time points to identify region(s) of interest that differentiate OUD subjects from healthy controls (HC). Following the triple network model, we obtain rs-fMRI BOLD features from the default mode network (DMN), salience network (SN), and executive control network (ECN) for 31 OUD and 45 HC subjects. Then, we use the Boruta ML algorithm to identify statistically significant BOLD features that differentiate OUD from HC, identifying the DMN as the most salient functional network for OUD. Furthermore, we conduct brain activity mapping, showing heightened neural activity within the DMN for OUD. We perform 5-fold cross-validation classification (OUD vs. HC) experiments to study the discriminative power of functional network features with and without fusing demographic features. The DMN shows the most discriminative power, achieving mean AUC and F1 scores of 80.91% and 73.97%, respectively, when fusing BOLD and demographic features. Follow-up Boruta analysis using BOLD features extracted from the medial prefrontal cortex, posterior cingulate cortex, and left and right temporoparietal junctions reveals significant features for all four functional hubs within the DMN., Comment: 20 pages, 7 figures, 8 tables

When can two strongly rational vertex operator algebras or 1+1d rational conformal field theories (RCFTs) be related by topological manipulations? For vertex operator algebras, the term "topological manipulations" refers to operations like passing to a conformal extension or restricting to a conformal subalgebra; for RCFTs, topological manipulations include operations like gauging (or orbifolding) a finite subpart of a generalized global symmetry or interpolating to a new theory via a topological line interface of finite quantum dimension. Inspired by results in the theory of even lattices, and also the theory of tensor categories, we say that two strongly rational vertex operator algebras are Witt equivalent if their central charges agree and if their representation categories are Witt equivalent as modular tensor categories. Two RCFTs are said to be Witt equivalent if their central charges agree and if their associated 2+1d topological field theories can be separated by a topological surface. We argue that Witt equivalence is necessary for two theories to be related by topological manipulations. We conjecture that it is also sufficient, and give proofs in various special cases. We relate this circle of ideas to the problem of classifying RCFTs, and to lore concerning deformation classes of quantum field theories. We use the notion of Witt equivalence to argue, assuming the conjectural classification of unitary, $c=1$ RCFTs, that all of the finite global symmetries of the $\mathrm{SU}(2)_1$ Wess-Zumino-Witten model are invertible. Finally, we sketch a "quantum Galois theory" for chiral CFTs, which generalizes prior mathematical literature by incorporating non-invertible symmetries; we illustrate this non-invertible Galois theory in the context of the monster CFT, for which we produce a Fibonacci symmetry., Comment: 63 pages, 15 figures, LaTeX

Wrinkling is the phenomenon of out-of-plane deformation patterns in thin walled structures, as a result of a local compressive (internal) loads in combination with a large membrane stiffness and a small but non-zero bending stiffness. Numerical modelling typically involves thin shell formulations. As the mesh resolution depends on the wrinkle wave lengths, the analysis can become computationally expensive for shorter ones. Implicitly modeling the wrinkles using a modified kinematic or constitutive relationship based on a taut, slack or wrinkled state derived from a so-called tension field, a simplification is introduced in order to reduce computational efforts. However, this model was restricted to linear elastic material models in previous works. Aiming to develop an implicit isogeometric wrinkling model for large strain and hyperelastic material applications, a modified deformation gradient has been assumed, which can be used for any strain energy density formulation. The model is an extension of a previously published model for linear elastic material behaviour and is generalized to other types of discretisation as well. The extension for hyperelastic materials requires the derivative of the material tensor, which can be computed numerically or derived analytically. The presented model relies on a combination of dynamic relaxation and a Newton-Raphson solver, because of divergence in early Newton-Raphson iterations as a result of a changing tension field, which is not included in the stress tensor variation. Using four benchmarks, the model performance is evaluated. Convergence with the expected order for Newton-Raphson iterations has been observed, provided a fixed tension field. The model accurately approximates the mean surface of a wrinkled membrane with a reduced number of degrees of freedom in comparison to a shell solution.

In this work, we introduce a methodology for alignment designed to enhance the ability of large language models (LLMs) to articulate their reasoning (self-explanation) even in the absence of annotated rationale explanations. Our alignment methodology comprises three key components: explanation quality assessment, self-instruction dataset generation, and model alignment. Additionally, we present a novel technique called Alignment with Anchor Preference Pairs, which improves the selection of preference pairs by categorizing model outputs into three groups: consistently correct, consistently incorrect, and variable. By applying tailored strategies to each category, we enhance the effectiveness of Direct Preference Optimization (DPO). Our experimental results demonstrate that this approach significantly improves explanation quality while maintaining accuracy compared to other fine-tuning strategies.

Deep learning has made significant strides in medical imaging, leveraging the use of large datasets to improve diagnostics and prognostics. However, large datasets often come with inherent errors through subject selection and acquisition. In this paper, we investigate the use of Diffusion Autoencoder (DAE) embeddings for uncovering and understanding data characteristics and biases, including biases for protected variables like sex and data abnormalities indicative of unwanted protocol variations. We use sagittal T2-weighted magnetic resonance (MR) images of the neck, chest, and lumbar region from 11186 German National Cohort (NAKO) participants. We compare DAE embeddings with existing generative models like StyleGAN and Variational Autoencoder. Evaluations on a large-scale dataset consisting of sagittal T2-weighted MR images of three spine regions show that DAE embeddings effectively separate protected variables such as sex and age. Furthermore, we used t-SNE visualization to identify unwanted variations in imaging protocols, revealing differences in head positioning. Our embedding can identify samples where a sex predictor will have issues learning the correct sex. Our findings highlight the potential of using advanced embedding techniques like DAEs to detect data quality issues and biases in medical imaging datasets. Identifying such hidden relations can enhance the reliability and fairness of deep learning models in healthcare applications, ultimately improving patient care and outcomes., Comment: This paper was accepted in the "Workshop on Interpretability of Machine Intelligence in Medical Image Computing" (iMIMIC) at MICCAI 2024

Understanding protein motion within the cell is crucial for predicting reaction rates and macromolecular transport in the cytoplasm. A key question is how crowded environments affect protein dynamics through hydrodynamic and direct interactions at molecular length scales. Using megahertz X-ray Photon Correlation Spectroscopy (MHz-XPCS) at the European X-ray Free Electron Laser (EuXFEL), we investigate ferritin diffusion at microsecond time scales. Our results reveal anomalous diffusion, indicated by the non-exponential decay of the intensity autocorrelation function $g_2(q,t)$ at high concentrations. This behavior is consistent with the presence of cage-trapping in between the short- and long-time protein diffusion regimes. Modeling with the $\delta\gamma$-theory of hydrodynamically interacting colloidal spheres successfully reproduces the experimental data by including a scaling factor linked to the protein direct interactions. These findings offer new insights into the complex molecular motion in crowded protein solutions, with potential applications for optimizing ferritin-based drug delivery, where protein diffusion is the rate-limiting step.

The growing use of Machine Learning and Artificial Intelligence (AI), particularly Large Language Models (LLMs) like OpenAI's GPT series, leads to disruptive changes across organizations. At the same time, there is a growing concern about how organizations handle personal data. Thus, privacy policies are essential for transparency in data processing practices, enabling users to assess privacy risks. However, these policies are often long and complex. This might lead to user confusion and consent fatigue, where users accept data practices against their interests, and abusive or unfair practices might go unnoticed. LLMss can be used to assess privacy policies for users automatically. In this interdisciplinary work, we explore the challenges of this approach in three pillars, namely technical feasibility, ethical implications, and legal compatibility of using LLMs to assess privacy policies. Our findings aim to identify potential for future research, and to foster a discussion on the use of LLM technologies for enabling users to fulfil their important role as decision-makers in a constantly developing AI-driven digital economy., Comment: Published at AISyS 2024

Gravitational lensing magnification of Type Ia supernovae (SNe Ia) allows information to be obtained about the distribution of matter on small scales. In this paper, we derive limits on the fraction $\alpha$ of the total matter density in compact objects (which comprise stars, stellar remnants, small stellar groupings and primordial black holes) of mass $M > 0.03 M_{\odot}$ over cosmological distances. Using 1,532 SNe Ia from the Dark Energy Survey Year 5 sample (DES-SN5YR) combined with a Bayesian prior for the absolute magnitude $M$, we obtain $\alpha < 0.12$ at the 95\% confidence level after marginalisation over cosmological parameters, lensing due to large-scale structure, and intrinsic non-Gaussianity. Similar results are obtained using priors from the cosmic microwave background, baryon acoustic oscillations and galaxy weak lensing, indicating our results do not depend on the background cosmology. We argue our constraints are likely to be conservative (in the sense of the values we quote being higher than the truth), but discuss scenarios in which they could be weakened by systematics of the order of $\Delta \alpha \sim 0.04$, Comment: Submitted to MNRAS

Classically, the splitting principle says how to pull back a vector bundle in such a way that it splits into line bundles and the pullback map induces an injection on $K$-theory. Here we categorify the splitting principle and generalize it to the context of 2-rigs. A 2-rig is a kind of categorified "ring without negatives", such as a category of vector bundles with $\oplus$ as addition and $\otimes$ as multiplication. Technically, we define a 2-rig to be a Cauchy complete $k$-linear symmetric monoidal category where $k$ has characteristic zero. We conjecture that for any suitably finite-dimensional object $r$ of a 2-rig $\mathsf{R}$, there is a 2-rig map $E \colon \mathsf{R} \to \mathsf{R'}$ such that $E(r)$ splits as a direct sum of finitely many "subline objects" and $E$ has various good properties: it is faithful, conservative, essentially injective, and the induced map of Grothendieck rings $K(E) \colon K(\mathsf{R}) \to K(\mathsf{R'})$ is injective. We prove this conjecture for the free 2-rig on one object, namely the category of Schur functors, whose Grothendieck ring is the free $\lambda$-ring on one generator, also known as the ring of symmetric functions. We use this task as an excuse to develop the representation theory of affine categories - that is, categories enriched in affine schemes - using the theory of 2-rigs., Comment: 47 pages

Nowadays, Mixed Reality (MR) headsets are a game-changer for knowledge work. Unlike stationary monitors, MR headsets allow users to work with large virtual displays anywhere they wear the headset, whether in a professional office, a public setting like a cafe, or a quiet space like a library. This study compares four different layouts (eye level-close, eye level-far, below eye level-close, below eye level-far) of virtual displays regarding feelings of safety, perceived productivity, and social acceptability when working with MR in public. We test which layout is most preferred by users and seek to understand which factors affect users' layout preferences. The aim is to derive useful insights for designing better MR layouts. A field study in a public library was conducted using a within-subject design. While the participants interact with a layout, they are asked to work on a planning task. The results from a repeated measure ANOVA show a statistically significant effect on productivity but not on safety and social acceptability. Additionally, we report preferences expressed by the users regarding the layouts and using MR in public., Comment: Part of the 23rd annual IEEE International Symposium on Mixed and Augmented Reality (ISMAR 2024)

The EyeSight feature, introduced with the new Apple Vision Pro XR headset, promises to revolutionize user interaction by simulating real human eye expressions on a digital display. This feature could enhance XR devices' social acceptability and social presence when communicating with others outside the XR experience. In this pilot study, we explore the implications of the EyeSight feature by examining social acceptability, social presence, emotional responses, and technology acceptance. Eight participants engaged in conversational tasks in three conditions to contrast experiencing the Apple Vision Pro with EyeSight, the Meta Quest 3 as a reference XR headset, and a face-to-face setting. Our preliminary findings indicate that while the EyeSight feature improves perceptions of social presence and acceptability compared to the reference headsets, it does not match the social connectivity of direct human interactions., Comment: In 30th ACM Symposium on Virtual Reality Software and Technology (VRST 2024)

We present a hybrid approach combining isogeometric analysis with deep operator networks to solve electromagnetic scattering problems. The neural network takes a computer-aided design representation as input and predicts the electromagnetic field in a de Rham conforming B-spline basis such that for example the tangential continuity of the electric field is respected. The physical problem is included in the loss function during training. Our numerical results demonstrate that a trained network accurately predicts the electric field, showing convergence to the analytical solution with optimal rate. Additionally, training on a variety of geometries highlights the network's generalization capabilities, achieving small error increases when applied to new geometries not included in the training set.

In this article, we develop tools for computing $G$-crossed extensions of braided tensor categories, including all coherence data (associator, braiding, tensor structures). Their equivariantisations describe representation categories of fixed-point vertex operator algebras, also called orbifolds. The seminal work of Etingof, Nikshych and Ostrik asserts the existence and uniqueness of the $G$-crossed extensions we construct. In particular, for the group $G=\mathbb{Z}_2$ acting as inversion on a discriminant form or metric group, we explicitly construct a braided $\mathbb{Z}_2$-crossed tensor category with a nondegenerate braiding that generalises the Tambara-Yamagami category, now with more than one simple object in the twisted sector. Its equivariantisation yields the modular tensor category of the orbifold of a lattice vertex operator algebra under a lift of $-\mathrm{id}$. In order to derive the above result, we show that $G$-crossed extensions and condensations by commutative algebras commute appropriately, leading to an effective method for constructing new $G$-crossed extensions. Based on this, we also outline a strategy for addressing the general problem of lattice orbifolds., Comment: 85 pages, LaTeX

Natural language explanations (NLEs) are vital for elucidating the reasoning behind large language model (LLM) decisions. Many techniques have been developed to generate NLEs using LLMs. However, like humans, LLMs might not always produce optimal NLEs on first attempt. Inspired by human learning processes, we introduce Cross-Refine, which employs role modeling by deploying two LLMs as generator and critic, respectively. The generator outputs a first NLE and then refines this initial explanation using feedback and suggestions provided by the critic. Cross-Refine does not require any supervised training data or additional training. We validate Cross-Refine across three NLP tasks using three state-of-the-art open-source LLMs through automatic and human evaluation. We select Self-Refine (Madaan et al., 2023) as the baseline, which only utilizes self-feedback to refine the explanations. Our findings from automatic evaluation and a user study indicate that Cross-Refine outperforms Self-Refine. Meanwhile, Cross-Refine can perform effectively with less powerful LLMs, whereas Self-Refine only yields strong results with ChatGPT. Additionally, we conduct an ablation study to assess the importance of feedback and suggestions. Both of them play an important role in refining explanations. We further evaluate Cross-Refine on a bilingual dataset in English and German., Comment: 17 pages; under review

Visual Parameter Space Analysis (VPSA) enables domain scientists to explore input-output relationships of computational models. Existing VPSA applications often feature multi-view visualizations designed by visualization experts for a specific scenario, making it hard for domain scientists to adapt them to their problems without professional help. We present RSVP, the Rapid Suggestive Visualization Prototyping system encoding VPSA knowledge to enable domain scientists to prototype custom visualization dashboards tailored to their specific needs. The system implements a task-oriented, multi-view visualization recommendation strategy over a visualization design space optimized for VPSA to guide users in meeting their analytical demands. We derived the VPSA knowledge implemented in the system by conducting an extensive meta design study over the body of work on VPSA. We show how this process can be used to perform a data and task abstraction, extract a common visualization design space, and derive a task-oriented VisRec strategy. User studies indicate that the system is user-friendly and can uncover novel insights., Comment: 16 pages, 16 figures, 3 tables, accepted for publishing at TVCG Journal

Probabilistic relational models provide a well-established formalism to combine first-order logic and probabilistic models, thereby allowing to represent relationships between objects in a relational domain. At the same time, the field of artificial intelligence requires increasingly large amounts of relational training data for various machine learning tasks. Collecting real-world data, however, is often challenging due to privacy concerns, data protection regulations, high costs, and so on. To mitigate these challenges, the generation of synthetic data is a promising approach. In this paper, we solve the problem of generating synthetic relational data via probabilistic relational models. In particular, we propose a fully-fledged pipeline to go from relational database to probabilistic relational model, which can then be used to sample new synthetic relational data points from its underlying probability distribution. As part of our proposed pipeline, we introduce a learning algorithm to construct a probabilistic relational model from a given relational database., Comment: Accepted to the Proceedings of the 47th German Conference on Artificial Intelligence (KI 2024)

Dual encoder architectures like CLIP models map two types of inputs into a shared embedding space and learn similarities between them. However, it is not understood how such models compare two inputs. Here, we address this research gap with two contributions. First, we derive a method to attribute predictions of any differentiable dual encoder onto feature-pair interactions between its inputs. Second, we apply our method to CLIP-type models and show that they learn fine-grained correspondences between parts of captions and regions in images. They match objects across input modes and also account for mismatches. However, this visual-linguistic grounding ability heavily varies between object classes, depends on the training data distribution, and largely improves after in-domain training. Using our method we can identify knowledge gaps about specific object classes in individual models and can monitor their improvement upon fine-tuning.

This study explores the user experience (UX) of virtual reality (VR) cloud gaming under simulated network degradation conditions. Two contrasting games (Beat Saber, Cubism) were streamed via Meta Air Link to a Quest 3 device in a laboratory setup. Packet loss and delay were introduced into the streaming network using NetEm for WiFi traffic manipulation. In a within-subjects experiment, 16 participants played both games under three network conditions (Loss, Delay, Baseline), followed by post-game questionnaires assessing their emotions, perceived quality, game experience, sense of presence, and cybersickness. Friedman's test and Dunn's post-hoc test for pairwise comparisons revealed that packet loss had a greater impact on UX than delay across almost all evaluated aspects. Notably, packet loss in Beat Saber led to a significant increase in cybersickness, whereas in Cubism, players experienced a significant reduction in their sense of presence. Additionally, both games exhibited statistically significant variations between conditions in most game experience dimensions, perceived quality, and emotional responses. This study highlights the critical role of network stability in VR cloud gaming, particularly in minimizing packet loss. The different dynamics between the games suggest the possibility of genre-specific optimization and novel game design considerations for VR cloud games., Comment: Accepted and will be presented in the ISMAR 2024 poster track

The usage of commercial Micro Aerial Vehicles (MAVs) has increased drastically during the last decade. While the added value of MAVs to society is apparent, their growing use is also coming with increasing risks like violating public airspace at airports or committing privacy violations. To mitigate these issues it is becoming critical to develop solutions that incorporate the detection and tracking of MAVs with autonomous systems. This work presents a method for the detection and tracking of MAVs using a novel, low-cost rosette scanning LiDAR on a pan-tilt turret. Once the static background is captured, a particle filter is utilized to detect a possible target and track its position with a physical, programmable pan-tilt system. The tracking makes it possible to keep the MAV in the center, maximizing the density of 3D points measured on the target by the LiDAR sensor. The developed algorithm was evaluated within the indoor MIcro aerial vehicle and MOtion capture (MIMO) arena and has state-of-the-art tracking accuracy, stability, and fast re-detection time in case of tracking loss. Based on the outdoor tests, it was possible to significantly increase the detection distance and number of returned points compared to other similar methods using LiDAR.

We use data from the ALMA Evolutionary Study of High Mass Protocluster Formation in the Galaxy (ALMAGAL) survey to study 100 ALMAGAL regions at $\sim$ 1 arsecond resolution located between $\sim$ 2 and 6 kpc distance. Using ALMAGAL $\sim$ 1.3mm line and continuum data we estimate flow rates onto individual cores. We focus specifically on flow rates along filamentary structures associated with these cores. Our primary analysis is centered around position velocity cuts in H$_2$CO (3$_{0,3}$ - 2$_{0,2}$) which allow us to measure the velocity fields, surrounding these cores. Combining this work with column density estimates we derive the flow rates along the extended filamentary structures associated with cores in these regions. We select a sample of 100 ALMAGAL regions covering four evolutionary stages from quiescent to protostellar, Young Stellar Objects (YSOs), and HII regions (25 each). Using dendrogram and line analysis, we identify a final sample of 182 cores in 87 regions. In this paper, we present 728 flow rates for our sample (4 per core), analysed in the context of evolutionary stage, distance from the core, and core mass. On average, for the whole sample, we derive flow rates on the order of $\sim$10$^{-4}$ M$_{sun}$yr$^{-1}$ with estimated uncertainties of $\pm$50%. We see increasing differences in the values among evolutionary stages, most notably between the less evolved (quiescent/protostellar) and more evolved (YSO/HII region) sources. We also see an increasing trend as we move further away from the centre of these cores. We also find a clear relationship between the flow rates and core masses $\sim$M$^{2/3}$ which is in line with the result expected from the tidal-lobe accretion mechanism. Overall, we see increasing trends in the relationships between the flow rate and the three investigated parameters; evolutionary stage, distance from the core, and core mass., Comment: 11 pages, 11 figures, accepted for publication in A&A

In this first of a series of two papers, we investigate two different equivalence relations obtained by generalizing the notion of genus of even lattices to the setting of vertex operator algebras (or two-dimensional chiral algebras). The bulk genus equivalence relation was defined in arXiv:math/0209333 and groups (suitably regular) vertex operator algebras according to their modular tensor category and central charge. Hyperbolic genus arXiv:2004.01441 tests isomorphy after tensoring with a hyperbolic plane vertex algebra. Physically, two rational chiral algebras are said to belong to the same bulk genus if they live on the boundary of the same 2+1d topological quantum field theory; they belong to the same hyperbolic genus if they can be related by current-current exactly marginal deformations after tensoring a non-chiral compact boson. As one main result, we prove the conjecture that the hyperbolic genus defines a finer equivalence relation than the bulk genus. This is based on a new, equivalent characterization of the hyperbolic genus that uses the maximal lattice inside a vertex operator algebra and its commutant (or coset). We discuss the implications of these constructions for the classification of rational conformal field theory. In particular, we propose a program for (partially) classifying $c=32$, holomorphic vertex operator algebras (or chiral conformal field theories), and obtain novel lower bounds, via a generalization of the Smith-Minkowski-Siegel mass formula, on the number of vertex operator algebras at higher central charges. Finally, we conjecture a Siegel-Weil identity which computes the "average" torus partition function of an ensemble of chiral conformal field theories defined by any hyperbolic genus, and interpret this formula physically in terms of disorder-averaged holography., Comment: 66 pages, LaTeX

Accurate calibration of finite element (FE) models of human intervertebral discs (IVDs) is essential for their reliability and application in diagnosing and planning treatments for spinal conditions. Traditional calibration methods are computationally intensive, requiring iterative, derivative-free optimization algorithms that often take hours or days to converge. This study addresses these challenges by introducing a novel, efficient, and effective calibration method for an L4-L5 IVD FE model using a neural network (NN) surrogate. The NN surrogate predicts simulation outcomes with high accuracy, outperforming other machine learning models, and significantly reduces the computational cost associated with traditional FE simulations. Next, a Projected Gradient Descent (PGD) approach guided by gradients of the NN surrogate is proposed to efficiently calibrate FE models. Our method explicitly enforces feasibility with a projection step, thus maintaining material bounds throughout the optimization process. The proposed method is evaluated against state-of-the-art Genetic Algorithm (GA) and inverse model baselines on synthetic and in vitro experimental datasets. Our approach demonstrates superior performance on synthetic data, achieving a Mean Absolute Error (MAE) of 0.06 compared to the baselines' MAE of 0.18 and 0.54, respectively. On experimental specimens, our method outperforms the baseline in 5 out of 6 cases. Most importantly, our approach reduces calibration time to under three seconds, compared to up to 8 days per sample required by traditional calibration. Such efficiency paves the way for applying more complex FE models, enabling accurate patient-specific simulations and advancing spinal treatment planning., Comment: Under submission. Project code: https://github.com/matanat/IVD-CalibNN/

Interstellar molecules, which play an important role in astrochemistry, are identified using observed spectral lines. Despite the advent of spectral analysis tools in the past decade, the identification of spectral lines remains a tedious task that requires extensive manual intervention, preventing us from fully exploiting the vast amounts of data generated by large facilities such as ALMA. This study aims to address the aforementioned issue by developing a framework of automated line identification. We introduce a robust spectral fitting technique applicable for spectral line identification with minimal human supervision. Our method is assessed using published data from five line surveys of hot cores, including W51, Orion-KL, Sgr B2(M), and Sgr B2(N). By comparing the identified lines, our algorithm achieves a recall of ~ 84% - 98%. Our code, named Spectuner, is publicly available on GitHub., Comment: 25 pages, 22 figures, submitted to ApJS

As wearable-based data annotation remains, to date, a tedious, time-consuming task requiring researchers to dedicate substantial time, benchmark datasets within the field of Human Activity Recognition in lack richness and size compared to datasets available within related fields. Recently, vision foundation models such as CLIP have gained significant attention, helping the vision community advance in finding robust, generalizable feature representations. With the majority of researchers within the wearable community relying on vision modalities to overcome the limited expressiveness of wearable data and accurately label their to-be-released benchmark datasets offline, we propose a novel, clustering-based annotation pipeline to significantly reduce the amount of data that needs to be annotated by a human annotator. We show that using our approach, the annotation of centroid clips suffices to achieve average labelling accuracies close to 90% across three publicly available HAR benchmark datasets. Using the weakly annotated datasets, we further demonstrate that we can match the accuracy scores of fully-supervised deep learning classifiers across all three benchmark datasets. Code as well as supplementary figures and results are publicly downloadable via github.com/mariusbock/weak_har., Comment: 8 pages, 3 figures, accepted at ISWC'24: International Symposium on Wearable Computers, Oct, 2024

We introduce a framework where the announcements of a clearinghouse about the allocation process are opaque in the sense that there can be more than one outcome compatible with a realization of type reports. We ask whether desirable properties can be ensured under opacity in a robust sense. A property can be guaranteed under an opaque announcement if every mechanism compatible with it satisfies the property. We find an impossibility result: strategy-proofness cannot be guaranteed under any level of opacity. In contrast, in some environments, weak Maskin monotonicity and non-bossiness can be guaranteed under opacity.

Using 1533 type Ia supernovae (SNe Ia) from the five-year sample of the Dark Energy Survey (DES), we investigate the effects of projected galactocentric separation between the SNe and their host galaxies on their light curves and standardization. We show, for the first time, that the difference in SN Ia post-standardization brightnesses between high and low-mass hosts reduces from $0.078\pm0.011$ mag in the full sample to $0.036 \pm 0.018$ mag for SNe Ia located in the outer regions of their host galaxies, while increasing to $0.100 \pm 0.014$ mag for SNe in the inner regions. In these inner regions, the step can be reduced (but not removed) using a model where the $R_V$ of dust along the line-of-sight to the SN changes as a function of galaxy properties. To explain the remaining difference, we use the distributions of the SN Ia stretch parameter to test whether the inferred age of SN progenitors are more varied in the inner regions of galaxies. We find that the proportion of high-stretch SNe Ia in red (older) environments is more prominent in outer regions and that the outer regions stretch distributions are overall more homogeneous compared to inner regions, but conclude that this effect cannot explain the reduction in significance of any Hubble residual step in outer regions. We conclude that the standardized distances of SNe Ia located in the outer regions of galaxies are less affected by their global host galaxy properties than those in the inner regions., Comment: 17 pages, 13 figures

Automated Machine Learning (AutoML) significantly simplifies the deployment of machine learning models by automating tasks from data preprocessing to model selection to ensembling. AutoML systems for tabular data often employ post hoc ensembling, where multiple models are combined to improve predictive accuracy. This typically results in longer inference times, a major limitation in practical deployments. Addressing this, we introduce a hardware-aware ensemble selection approach that integrates inference time into post hoc ensembling. By leveraging an existing framework for ensemble selection with quality diversity optimization, our method evaluates ensemble candidates for their predictive accuracy and hardware efficiency. This dual focus allows for a balanced consideration of accuracy and operational efficiency. Thus, our approach enables practitioners to choose from a Pareto front of accurate and efficient ensembles. Our evaluation using 83 classification datasets shows that our approach sustains competitive accuracy and can significantly improve ensembles' operational efficiency. The results of this study provide a foundation for extending these principles to additional hardware constraints, setting the stage for the development of more resource-efficient AutoML systems., Comment: Accepted at Third International Conference on Automated Machine Learning (AutoML 2024), Workshop Track; for code, see https://github.com/Atraxus/HA-ES

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

Counterfactual explanations (CEs) aim to enhance the interpretability of machine learning models by illustrating how alterations in input features would affect the resulting predictions. Common CE approaches require an additional model and are typically constrained to binary counterfactuals. In contrast, we propose a novel method that operates directly on the latent space of a generative model, specifically a Diffusion Autoencoder (DAE). This approach offers inherent interpretability by enabling the generation of CEs and the continuous visualization of the model's internal representation across decision boundaries. Our method leverages the DAE's ability to encode images into a semantically rich latent space in an unsupervised manner, eliminating the need for labeled data or separate feature extraction models. We show that these latent representations are helpful for medical condition classification and the ordinal regression of severity pathologies, such as vertebral compression fractures (VCF) and diabetic retinopathy (DR). Beyond binary CEs, our method supports the visualization of ordinal CEs using a linear model, providing deeper insights into the model's decision-making process and enhancing interpretability. Experiments across various medical imaging datasets demonstrate the method's advantages in interpretability and versatility. The linear manifold of the DAE's latent space allows for meaningful interpolation and manipulation, making it a powerful tool for exploring medical image properties. Our code is available at https://doi.org/10.5281/zenodo.13859266., Comment: Accepted for publication at the Journal of Machine Learning for Biomedical Imaging (MELBA) https://melba-journal.org/2024:024. arXiv admin note: text overlap with arXiv:2303.12031

The present state of cosmology is facing a crisis where there is a fundamental disagreement in measurements of the Hubble constant ($H_{0}$), with significant tension between the early and late universe methods. Type Ia supernovae (SNe Ia) are important to measuring $H_{0}$ through the astronomical distance ladder. However, there remains potential to better standardise SN Ia light curves by using known dependencies on host galaxy properties after the standard light curve width and colour corrections have been applied to the peak SN Ia luminosities. To explore this, we use the 5-year photometrically identified SNe Ia sample obtained by the Dark Energy Survey, along with host galaxy spectra obtained by the Australian Dark Energy Survey. Using host galaxy spectroscopy, we find a significant trend with the equivalent width (EW) of the [OII] $\lambda\lambda$ 3727, 29 doublet, a proxy for specific star formation rate, and Hubble residuals. We find that the correlation with [OII] EW is a powerful alternative to the commonly used mass step after initial light curve corrections. We applied our [OII] EW correction to a sample of 20 SN Ia hosted by calibrator galaxies observed using WiFeS, and examined the impact on both the SN Ia absolute magnitude and $H_{0}$. We then explored different [OII] EW corrections and found $H_{0}$ values ranging between $72.80$ to $73.28~\mathrm{km} \mathrm{s}^{-1} \mathrm{Mpc}^{-1}$. Notably, even after using an additional [OII] EW correction, the impact of host galaxy properties in standardising SNe Ia appears limited in reducing the current tension ($\sim$5$\sigma$) with the Cosmic Microwave Background result for $H_{0}$., Comment: 16 pages, 13 figures. Submitting to MNRAS

Cosmological analyses with Type Ia Supernovae (SNe Ia) have traditionally been reliant on spectroscopy for both classifying the type of supernova and obtaining reliable redshifts to measure the distance-redshift relation. While obtaining a host-galaxy spectroscopic redshift for most SNe is feasible for small-area transient surveys, it will be too resource intensive for upcoming large-area surveys such as the Vera Rubin Observatory Legacy Survey of Space and Time, which will observe on the order of millions of SNe. Here we use data from the Dark Energy Survey (DES) to address this problem with photometric redshifts (photo-z) inferred directly from the SN light-curve in combination with Gaussian and full p(z) priors from host-galaxy photo-z estimates. Using the DES 5-year photometrically-classified SN sample, we consider several photo-z algorithms as host-galaxy photo-z priors, including the Self-Organizing Map redshifts (SOMPZ), Bayesian Photometric Redshifts (BPZ), and Directional-Neighbourhood Fitting (DNF) redshift estimates employed in the DES 3x2 point analyses. With detailed catalog-level simulations of the DES 5-year sample, we find that the simulated w can be recovered within $\pm$0.02 when using SN+SOMPZ or DNF prior photo-z, smaller than the average statistical uncertainty for these samples of 0.03. With data, we obtain biases in w consistent with simulations within ~1$\sigma$ for three of the five photo-z variants. We further evaluate how photo-z systematics interplay with photometric classification and find classification introduces a subdominant systematic component. This work lays the foundation for next-generation fully photometric SNe Ia cosmological analyses., Comment: 19 pages, 9 figures. Submitting to MNRAS, comments welcome

Recent findings by Jahn, T. Ullrich, Voigtlaender [10] relate non-linear sampling numbers for the square norm to quantities involving trigonometric best $m-$term approximation errors in the uniform norm. Here we establish new results for sparse trigonometric approximation with respect to the high-dimensional setting, where the influence of the dimension $d$ has to be controlled. In particular, we focus on best $m-$term trigonometric approximation for (unweighted) Wiener classes in $L_q$ and give precise constants. Our main results are approximation guarantees where the number of terms $m$ scales at most quadratic in the inverse accuracy $1/\varepsilon$. Providing a refined version of the classical Nikol'skij inequality we are able to extrapolate the $L_q$-result to $L_\infty$ while limiting the influence of the dimension to a $\sqrt{d}$-factor and an additonal $\log$-term in the size of the (rectangular) spectrum. This has consequences for the tractable sampling recovery via $\ell_1$-minimization of functions belonging to certain Besov classes with bounded mixed smoothness. This complements polynomial tractability results recently given by Krieg [12].

Hot subdwarfs (sdO/B) are the stripped helium cores of red giants formed by binary interactions. Close hot subdwarf binaries with massive white dwarf companions have been proposed as possible progenitors of thermonuclear supernovae type Ia (SN Ia). If the supernova is triggered by stable mass transfer from the helium star, the companion should survive the explosion and should be accelerated to high velocities. The hypervelocity star US 708 is regarded as the prototype for such an ejected companion. To find more of those objects we conducted an extensive spectroscopic survey. Candidates for such fast stars have been selected from the spectroscopic database of the Sloan Digital Sky Survey (SDSS) and several ground-based proper motion surveys. Follow-up spectroscopy has been obtained with several 4m- to 10m-class telescopes. Combining the results from quantitative spectroscopic analyses with space-based astrometry from \textit{Gaia} Early Data Release 3 (EDR3) we determined the atmospheric and kinematic parameters of 53 fast hot subdwarf stars. None of these stars is unbound to the Galaxy, although some have Galactic restframe velocities close to the Galactic escape velocity. 21 stars are apparently single objects, which crossed the Galactic disc within their lifetimes in the sdO/B stage and could be regarded as potential candidates for the SN Ia ejection scenario. However, the properties of the full sample are more consistent with a pure old Galactic halo population. We therefore conclude that the fast sdO/B stars we found are likely to be extreme halo stars., Comment: 22 pages, A&A accepted

Collaborative causal inference (CCI) is a federated learning method for pooling data from multiple, often self-interested, parties, to achieve a common learning goal over causal structures, e.g. estimation and optimization of treatment variables in a medical setting. Since obtaining data can be costly for the participants and sharing unique data poses the risk of losing competitive advantages, motivating the participation of all parties through equitable rewards and incentives is necessary. This paper devises an evaluation scheme to measure the value of each party's data contribution to the common learning task, tailored to causal inference's statistical demands, by comparing completed partially directed acyclic graphs (CPDAGs) inferred from observational data contributed by the participants. The Data Valuation Scheme thus obtained can then be used to introduce mechanisms that incentivize the agents to contribute data. It can be leveraged to reward agents fairly, according to the quality of their data, or to maximize all agents' data contributions.

Noisy intermediate-scale quantum computers (NISQ) are in their childhood, but showing high promise. One main concern for NISQ machines is their inherent noisiness, as the qubit states are subject to disturbances with each algorithmic operation applied. In this study, we conduct experiments on quantum noise. Based on our data, we show that existing noise models fail to properly capture the aggregation of noise effects over an algorithm's runtime. They are underdispersed, meaning that observable frequencies scatter much more between repeated experiments than what the standard assumptions of the binomial distribution allow for. We develop noise model for the readout probabilities as a function of the number of gate operations. The model is based on a continuous random walk on the (Bloch) sphere, where the angular diffusion coefficient characterizes the noisiness of gate operations. We superimpose a second random walk at the scale of multiple readouts to account for overdispersion. The interaction of these two random walks predicts theoretical, runtime-dependent bounds for probabilities. Overall, it is a three-parameter distributional model that fits the data better than the corresponding one-scale model (without overdispersion). We demonstrate the fit and the plausibility of the predicted bounds via Bayesian data-model analysis.

An adverse drug effect (ADE) is any harmful event resulting from medical drug treatment. Despite their importance, ADEs are often under-reported in official channels. Some research has therefore turned to detecting discussions of ADEs in social media. Impressive results have been achieved in various attempts to detect ADEs. In a high-stakes domain such as medicine, however, an in-depth evaluation of a model's abilities is crucial. We address the issue of thorough performance evaluation in English-language ADE detection with hand-crafted templates for four capabilities: Temporal order, negation, sentiment, and beneficial effect. We find that models with similar performance on held-out test sets have varying results on these capabilities., Comment: Accepted at BioNLP 2024 and Shared Tasks (ACL Workshop)

Vine copulas are flexible dependence models using bivariate copulas as building blocks. If the parameters of the bivariate copulas in the vine copula depend on covariates, one obtains a conditional vine copula. We propose an extension for the estimation of continuous conditional vine copulas, where the parameters of continuous conditional bivariate copulas are estimated sequentially and separately via gradient-boosting. For this purpose, we link covariates via generalized linear models (GLMs) to Kendall's $\tau$ correlation coefficient from which the corresponding copula parameter can be obtained. Consequently, the gradient-boosting algorithm estimates the copula parameters providing a natural covariate selection. In a second step, an additional covariate deselection procedure is applied. The performance of the gradient-boosted conditional vine copulas is illustrated in a simulation study. Linear covariate effects in low- and high-dimensional settings are investigated for the conditional bivariate copulas separately and for conditional vine copulas. Moreover, the gradient-boosted conditional vine copulas are applied to the temporal postprocessing of ensemble weather forecasts in a low-dimensional setting. The results show, that our suggested method is able to outperform the benchmark methods and identifies temporal correlations better. Eventually, we provide an R-package called boostCopula for this method.

Deep learning-based approaches for software vulnerability prediction currently mainly rely on the original text of software code as the feature of nodes in the graph of code and thus could learn a representation that is only specific to the code text, rather than the representation that depicts the 'intrinsic' functionality of a program hidden in the text representation. One curse that causes this problem is an infinite number of possibilities to name a variable. In order to lift the curse, in this work we introduce a new type of edge called name dependence, a type of abstract syntax graph based on the name dependence, and an efficient node representation method named 3-property encoding scheme. These techniques will allow us to remove the concrete variable names from code, and facilitate deep learning models to learn the functionality of software hidden in diverse code expressions. The experimental results show that the deep learning models built on these techniques outperform the ones based on existing approaches not only in the prediction of vulnerabilities but also in the memory need. The factor of memory usage reductions of our techniques can be up to the order of 30,000 in comparison to existing approaches.

Conversational explainable artificial intelligence (ConvXAI) systems based on large language models (LLMs) have garnered significant interest from the research community in natural language processing (NLP) and human-computer interaction (HCI). Such systems can provide answers to user questions about explanations in dialogues, have the potential to enhance users' comprehension and offer more information about the decision-making and generation processes of LLMs. Currently available ConvXAI systems are based on intent recognition rather than free chat, as this has been found to be more precise and reliable in identifying users' intentions. However, the recognition of intents still presents a challenge in the case of ConvXAI, since little training data exist and the domain is highly specific, as there is a broad range of XAI methods to map requests onto. In order to bridge this gap, we present CoXQL, the first dataset in the NLP domain for user intent recognition in ConvXAI, covering 31 intents, seven of which require filling multiple slots. Subsequently, we enhance an existing parsing approach by incorporating template validations, and conduct an evaluation of several LLMs on CoXQL using different parsing strategies. We conclude that the improved parsing approach (MP+) surpasses the performance of previous approaches. We also discover that intents with multiple slots remain highly challenging for LLMs., Comment: EMNLP 2024 Findings (short paper); camera-ready version

We report on saturated absorption spectroscopy measurements of the $(4s^2) ^{1}S_0\rightarrow(4s4p) ^{1}P_1$ transition for the four most abundant even-mass isotopes in calcium. By referencing the laser locked to an ultralow expansion cavity and carefully investigating systematic errors, isotope shifts are determined with a precision below 100 kHz, improving previously reported values by a factor of about five. A King plot analysis employing literature values of the 729-nm transition in Ca ions shows excellent linearity. The field and mass shift parameters are determined from King plots with other transitions., Comment: 6 pages, 4 figures

We present $griz$ photometric light curves for the full 5 years of the Dark Energy Survey Supernova program (DES-SN), obtained with both forced Point Spread Function (PSF) photometry on Difference Images (DIFFIMG) performed during survey operations, and Scene Modelling Photometry (SMP) on search images processed after the survey. This release contains $31,636$ DIFFIMG and $19,706$ high-quality SMP light curves, the latter of which contains $1635$ photometrically-classified supernovae that pass cosmology quality cuts. This sample spans the largest redshift ($z$) range ever covered by a single SN survey ($0.1

We report constraints on a variety of non-standard cosmological models using the full 5-year photometrically-classified type Ia supernova sample from the Dark Energy Survey (DES-SN5YR). Both Akaike Information Criterion (AIC) and Suspiciousness calculations find no strong evidence for or against any of the non-standard models we explore. When combined with external probes, the AIC and Suspiciousness agree that 11 of the 15 models are moderately preferred over Flat-$\Lambda$CDM suggesting additional flexibility in our cosmological models may be required beyond the cosmological constant. We also provide a detailed discussion of all cosmological assumptions that appear in the DES supernova cosmology analyses, evaluate their impact, and provide guidance on using the DES Hubble diagram to test non-standard models. An approximate cosmological model, used to perform bias corrections to the data holds the biggest potential for harbouring cosmological assumptions. We show that even if the approximate cosmological model is constructed with a matter density shifted by $\Delta\Omega_m\sim0.2$ from the true matter density of a simulated data set the bias that arises is sub-dominant to statistical uncertainties. Nevertheless, we present and validate a methodology to reduce this bias., Comment: Published to MNRAS on 20 August 2024; v2 updates to the accepted version

Type Ia Supernovae (SNe Ia) are a critical tool in measuring the accelerating expansion of the universe. Recent efforts to improve these standard candles have focused on incorporating the effects of dust on distance measurements with SNe Ia. In this paper, we use the state-of-the-art Dark Energy Survey 5 year sample to evaluate two different families of dust models: empirical extinction models derived from SNe Ia data, and physical attenuation models from the spectra of galaxies. Among the SNe Ia-derived models, we find that a logistic function of the total-to-selective extinction RV best recreates the correlations between supernova distance measurements and host galaxy properties, though an additional 0.02 magnitudes of grey scatter are needed to fully explain the scatter in SNIa brightness in all cases. These empirically-derived extinction distributions are highly incompatible with the physical attenuation models from galactic spectral measurements. From these results, we conclude that SNe Ia must either preferentially select extreme ends of galactic dust distributions, or that the characterisation of dust along the SNe Ia line-of-sight is incompatible with that of galactic dust distributions.

We present a precise measurement of cosmological time dilation using the light curves of 1504 type Ia supernovae from the Dark Energy Survey spanning a redshift range $0.1\lesssim z\lesssim 1.2$. We find that the width of supernova light curves is proportional to $(1+z)$, as expected for time dilation due to the expansion of the Universe. Assuming type Ia supernovae light curves are emitted with a consistent duration $\Delta t_{\rm em}$, and parameterising the observed duration as $\Delta t_{\rm obs}=\Delta t_{\rm em}(1+z)^b$, we fit for the form of time dilation using two methods. Firstly, we find that a power of $b \approx 1$ minimises the flux scatter in stacked subsamples of light curves across different redshifts. Secondly, we fit each target supernova to a stacked light curve (stacking all supernovae with observed bandpasses matching that of the target light curve) and find $b=1.003\pm0.005$ (stat) $\pm\,0.010$ (sys). Thanks to the large number of supernovae and large redshift-range of the sample, this analysis gives the most precise measurement of cosmological time dilation to date, ruling out any non-time-dilating cosmological models at very high significance., Comment: 14 pages, 13 figures. Updated in response to reviewer feedback. Accepted for publication in the Monthly Notices of the Royal Astronomical Society (MNRAS)

Benchmarking quantum computers helps to quantify them and bringing the technology to the market. Various application-level metrics exist to benchmark a quantum device at an application level. This paper presents a revised holistic scoring method called the Quantum Application Score (QuAS) incorporating strong points of previous metrics, such as QPack and the Q-score. We discuss how to integrate both and thereby obtain an application-level metric that better quantifies the practical utility of quantum computers. We evaluate the new metric on different hardware platforms such as D-Wave and IBM as well as quantum simulators of Quantum Inspire and Rigetti., Comment: 9 pages, 5 figures