Search

This paper introduces the hypothetical track-length fitting algorithm, a novel method for measuring the kinetic energies of ionizing particles in liquid argon time projection chambers (LArTPCs). The algorithm finds the most probable offset in track length for a track-like object by comparing the measured ionization density as a function of position with a theoretical prediction of the energy loss as a function of the energy, including models of electron recombination and detector response. The algorithm can be used to measure the energies of particles that interact before they stop, such as charged pions that are absorbed by argon nuclei. The algorithm's energy measurement resolutions and fractional biases are presented as functions of particle kinetic energy and number of track hits using samples of stopping secondary charged pions in data collected by the ProtoDUNE-SP detector, and also in a detailed simulation. Additional studies describe impact of the dE/dx model on energy measurement performance. The method described in this paper to characterize the energy measurement performance can be repeated in any LArTPC experiment using stopping secondary charged pions.

We present measurements of $B \to K{}^{*}(892)\gamma$ decays using $365\,{\rm fb}^{-1}$ of data collected from 2019 to 2022 by the Belle~II experiment at the SuperKEKB asymmetric-energy $e^+e^-$ collider. The data sample contains $(387 \pm 6) \times 10^6$ $B\overline{B}$ events. We measure branching fractions ($\mathcal{B}$) and $C\!P$ asymmetries ($\mathcal{A}_{C\!P}$) for both $B^{0}\to K{}^{*0}\gamma$ and $B^{+}\to K{}^{*+}\gamma$ decays. The difference in $C\!P$ asymmetries ($\Delta \mathcal{A}_{C\!P}$) and the isospin asymmetry ($\Delta_{0+}$) between these neutral and charged channels are also measured. We obtain the following branching fractions and $C\!P$ asymmetries: $\mathcal{B} (B^{0} \to K{}^{*0}\gamma) = (4.14 \pm 0.10 \pm 0.11 ) \times 10^{-5}$, $\mathcal{B} (B^{+} \to K{}^{*+}\gamma) = (4.02 \pm 0.13 \pm 0.13 )\times 10^{-5}$, $\mathcal{A}_{C\!P} (B^{0} \to K{}^{*0}\gamma) = (-3.3 \pm 2.3 \pm 0.4 )\%$, and $\mathcal{A}_{C\!P} (B^{+} \to K{}^{*+}\gamma) = (-0.7 \pm 2.9 \pm 0.6 )\%$. The measured difference in $C\!P$ asymmetries is $\Delta \mathcal{A}_{C\!P} = (+2.6 \pm 3.8 \pm 0.7 )\%$, and the measured isospin asymmetry is $\Delta_{0+} = (+5.0 \pm 2.0 \pm 1.5 )\%$. The first uncertainties listed are statistical and the second are systematic. These results are consistent with world-average values and theory predictions.

We study functions $f : [0, 1]^d \rightarrow [0, 1]^d$ that are both monotone and contracting, and we consider the problem of finding an $\varepsilon$-approximate fixed point of $f$. We show that the problem lies in the complexity class UEOPL. We give an algorithm that finds an $\varepsilon$-approximate fixed point of a three-dimensional monotone contraction using $O(\log (1/\varepsilon))$ queries to $f$. We also give a decomposition theorem that allows us to use this result to obtain an algorithm that finds an $\varepsilon$-approximate fixed point of a $d$-dimensional monotone contraction using $O((c \cdot \log (1/\varepsilon))^{\lceil d / 3 \rceil})$ queries to $f$ for some constant $c$. Moreover, each step of both of our algorithms takes time that is polynomial in the representation of $f$. These results are strictly better than the best-known results for functions that are only monotone, or only contracting. All of our results also apply to Shapley stochastic games, which are known to be reducible to the monotone contraction problem. Thus we put Shapley games in UEOPL, and we give a faster algorithm for approximating the value of a Shapley game.

This chapter contains a self-contained introduction to the significance of Bayes' formula in the context of nonlinear filtering problems. Both discrete-time and continuous-time settings of the problem are considered in a unified manner. In control theory, the focus on optimization-based solution approaches is stressed together with a discussion of historical developments in this area (from 1960s onwards). The heart of this chapter contains a presentation of a novel optimal transportation formulation for the Bayes formula (developed recently by the first author) and its relationship to some of the prior joint work (feedback particle filter) from the authors. The presentation highlights how optimal transportation theory is leveraged to overcome some of the numerical challenges of implementing Bayes' law by enabling the use of machine learning (ML) tools.

Hexagonal boron nitride (hBN) has been experimentally shown to exhibit room-temperature single-photon emission. This emission is attributed to defect states in the wide band-gap of hBN, which allow new optical transitions between these dispersion-less defect levels. In this work, we study the new spectral features introduced by interacting atomic defects in consecutive layers of bilayer hBN. Density Functional theory simulations have been carried out to calculate the energy band structure, frequency-dependent complex dielectric functions, and Kohn-Sham states to demonstrate and understand the cause of the emission enhancements. We found that placing colour centres in the vicinity of each other in bilayer hBN introduces new polarization dependent spectral features, with strong dependence on the distance and relative orientation between atomic defects. Our results provide a pathway to engineering single photon emission in hBN via inter-defect interaction.

Laser cooling is fundamental to quantum computation and metrology with trapped ions, and can occupy a majority of runtime in current systems. A key limitation to cooling arises from unwanted carrier excitation, which in typically used running wave (RW) fields invariably accompanies the sideband transitions effecting cooling. We consider laser cooling in structured light profiles enabling selective sideband excitation with nulled carrier drive; motivated by integrated photonic approaches' passive phase and amplitude stability, we propose simple configurations realizable with waveguide addressing using either standing wave (SW) or first-order Hermite-Gauss (HG) modes. We quantify performance of Doppler cooling from beyond the Lamb-Dicke regime (LDR), and ground-state (GS) cooling using electromagnetically induced transparency (EIT) leveraging these field profiles. Carrier-free EIT offers significant benefits simultaneously in cooling rate, motional frequency bandwidth, and final phonon number. Carrier-free Doppler cooling's advantage is significantly compromised beyond the LDR but continues to hold, indicating such configurations are applicable for highly excited ions. Our simulations focus on level structure relevant to $^{40}$Ca$^+$, though the carrier-free configurations can be generally applied to other species. We also quantify performance limitations due to polarization and modal impurities relevant to experimental implementation. Our results indicate potential for simple structured light profiles to alleviate bottlenecks in laser cooling, and for scalable photonic devices to improve basic operation quality in trapped-ion systems.

The Fermi-Hubbard model (FHM) is a simple yet rich model of strongly interacting electrons with complex dynamics and a variety of emerging quantum phases. These properties make it a compelling target for digital quantum simulation. Trotterization-based quantum simulations have shown promise, but implementations on current hardware are limited by noise, necessitating error mitigation techniques like circuit optimization and post-selection. A mapping of the FHM to a Z2 LGT was recently proposed that restricts the dynamics to a subspace protected by additional symmetries, and its ability for post-selection error mitigation was verified through noisy classical simulations. In this work, we propose and demonstrate a suite of algorithm-hardware co-design strategies on a trapped-ion quantum computer, targeting two key aspects of NISQ-era quantum simulation: circuit compilation and error mitigation. In particular, a novel combination of iteratively preconditioned gradient descent (IPG) and subsystem von Neumann Entropy compression reduces the 2-qubit gate count of FHM quantum simulation by 35%, consequently doubling the number of simulatable Trotter steps when used in tandem with error mitigation based on conserved symmetries, debiasing and sharpening techniques. Our work demonstrates the value of algorithm-hardware co-design to operate digital quantum simulators at the threshold of maximum circuit depths allowed by current hardware, and is broadly generalizable to strongly correlated systems in quantum chemistry and materials science.

Recently, general fractional calculus was introduced by Kochubei (2011) and Luchko (2021) as a further generalisation of fractional calculus, where the derivative and integral operator admits arbitrary kernel. Such a formalism will have many applications in physics and engineering, since the kernel is no longer restricted. We first extend the work of Al-Refai and Luchko (2023) on finite interval to arbitrary orders. Followed by, developing an efficient Petrov-Galerkin scheme by introducing Jacobi convolution polynomials as basis functions. A notable property of this basis function, the general fractional derivative of Jacobi convolution polynomial is a shifted Jacobi polynomial. Thus, with a suitable test function it results in diagonal stiffness matrix, hence, the efficiency in implementation. Furthermore, our method is constructed for any arbitrary kernel including that of fractional operator, since, its a special case of general fractional operator.

Shifts in data distribution can substantially harm the performance of clinical AI models. Hence, various methods have been developed to detect the presence of such shifts at deployment time. However, root causes of dataset shifts are varied, and the choice of shift mitigation strategies is highly dependent on the precise type of shift encountered at test time. As such, detecting test-time dataset shift is not sufficient: precisely identifying which type of shift has occurred is critical. In this work, we propose the first unsupervised dataset shift identification framework, effectively distinguishing between prevalence shift (caused by a change in the label distribution), covariate shift (caused by a change in input characteristics) and mixed shifts (simultaneous prevalence and covariate shifts). We discuss the importance of self-supervised encoders for detecting subtle covariate shifts and propose a novel shift detector leveraging both self-supervised encoders and task model outputs for improved shift detection. We report promising results for the proposed shift identification framework across three different imaging modalities (chest radiography, digital mammography, and retinal fundus images) on five types of real-world dataset shifts, using four large publicly available datasets., Comment: Code available at https://github.com/biomedia-mira/shift_identification

Satellite clock bias prediction plays a crucial role in enhancing the accuracy of satellite navigation systems. In this paper, we propose an approach utilizing Long Short-Term Memory (LSTM) networks to predict satellite clock bias. We gather data from the PRN 8 satellite of the Galileo and preprocess it to obtain a single difference sequence, crucial for normalizing the data. Normalization allows resampling of the data, ensuring that the predictions are equidistant and complete. Our methodology involves training the LSTM model on varying lengths of datasets, ranging from 7 days to 31 days. We employ a training set consisting of two days' worth of data in each case. Our LSTM model exhibits exceptional accuracy, with a Root Mean Square Error (RMSE) of 2.11 $\times$ 10$^{-11}$. Notably, our approach outperforms traditional methods used for similar time-series forecasting projects, being 170 times more accurate than RNN, 2.3 $\times$ 10$^7$ times more accurate than MLP, and 1.9 $\times$ 10$^4$ times more accurate than ARIMA. This study holds significant potential in enhancing the accuracy and efficiency of low-power receivers used in various devices, particularly those requiring power conservation. By providing more accurate predictions of satellite clock bias, the findings of this research can be integrated into the algorithms of such devices, enabling them to function with heightened precision while conserving power. Improved accuracy in clock bias predictions ensures that low-power receivers can maintain optimal performance levels, thereby enhancing the overall reliability and effectiveness of satellite navigation systems. Consequently, this advancement holds promise for a wide range of applications, including remote areas, IoT devices, wearable technology, and other devices where power efficiency and navigation accuracy are paramount., Comment: 6 Pages, 6 figures (8 sub-figures), 5 Tables Index Terms-LSTM, Satellite Navigation, Deep Learning, Clock Bias

This paper examines potential biases and inconsistencies in emotional evocation of images produced by generative artificial intelligence (AI) models and their potential bias toward negative emotions. In particular, we assess this bias by comparing the emotions evoked by an AI-produced image to the emotions evoked by prompts used to create those images. As a first step, the study evaluates three approaches for identifying emotions in images -- traditional supervised learning, zero-shot learning with vision-language models, and cross-modal auto-captioning -- using EmoSet, a large dataset of image-emotion annotations that categorizes images across eight emotional types. Results show fine-tuned models, particularly Google's Vision Transformer (ViT), significantly outperform zero-shot and caption-based methods in recognizing emotions in images. For a cross-modality comparison, we then analyze the differences between emotions in text prompts -- via existing text-based emotion-recognition models -- and the emotions evoked in the resulting images. Findings indicate that AI-generated images frequently lean toward negative emotional content, regardless of the original prompt. This emotional skew in generative models could amplify negative affective content in digital spaces, perpetuating its prevalence and impact. The study advocates for a multidisciplinary approach to better align AI emotion recognition with psychological insights and address potential biases in generative AI outputs across digital media.

In recent years, mass-broadcast messaging platforms like Telegram have gained prominence for both, serving as a harbor for private communication and enabling large-scale disinformation campaigns. The encrypted and networked nature of these platforms makes it challenging to identify intervention targets since most channels that promote misleading information are not originators of the message. In this work, we examine the structural mechanisms that facilitate the propagation of debunked misinformation on Telegram, focusing on the role of cross-community hubs-nodes that bridge otherwise isolated groups in amplifying misinformation. We introduce a multi-dimensional 'bridging' metric to quantify the influence of nodal Telegram channels, exploring their role in reshaping network topology during key geopolitical events. By analyzing over 1740 Telegram channels and applying network analysis we uncover the small subset of nodes, and identify patterns that are emblematic of information 'flows' on this platform. Our findings provide insights into the structural vulnerabilities of distributed platforms, offering practical suggestions for interventions to mitigate networked disinformation flows., Comment: *Both Authors contributed equally to this work. 22 pages, 11 figures, 3 tables

We present supernova (SN) 2023ufx, a unique Type IIP SN with the shortest known plateau duration ($t_\mathrm{PT}$ $\sim$47 days), a luminous V-band peak ($M_{V}$ = $-$18.42 $\pm$ 0.08 mag), and a rapid early decline rate ($s1$ = 3.47 $\pm$ 0.09 mag (50 days)$^{-1}$). By comparing observed photometry to a hydrodynamic MESA+STELLA model grid, we constrain the progenitor to be a massive red supergiant with M$_\mathrm{ZAMS}$ $\simeq$19 - 25 M$_{\odot}$. Independent comparisons with nebular spectral models also suggest an initial He-core mass of $\sim$6 M$_{\odot}$, and thus a massive progenitor. For a Type IIP, SN 2023ufx produced an unusually high amount of nickel ($^{56}$Ni) $\sim$0.14 $\pm$ 0.02 M$_{\odot}$, during the explosion. We find that the short plateau duration in SN 2023ufx can be explained with the presence of a small hydrogen envelope (M$_\mathrm{H_\mathrm{env}}$ $\simeq$1.2 M$_{\odot}$), suggesting partial stripping of the progenitor. About $\simeq$0.09 M$_{\odot}$ of CSM through mass loss from late-time stellar evolution of the progenitor is needed to fit the early time ($\lesssim$10 days) pseudo-bolometric light curve. Nebular line diagnostics of broad and multi-peak components of [O I] $\lambda\lambda$6300, 6364, H$\alpha$, and [Ca II] $\lambda \lambda$7291, 7323 suggest that the explosion of SN 2023ufx could be inherently asymmetric, preferentially ejecting material along our line-of-sight., Comment: Submitted to ApJ, 30 pages, 19 figures

In this paper we generalize a result of Ye, Pang and Yang[12] on the normality of a family of holomorphic curves in $P^N(\mathbb{C})$. Further we obtain a normality criterion for family of meromorphic functions that partially share wandering holomorphic functions with their derivatives. We also devise a tractable representation of complex valued holomorphic functions from D as functions from D to $P^2(\mathbb{C})$ obtain a normality criterion that leads to a counterexample to the converse of Bloch's principle., Comment: 17 pages

We measure the time-integrated CP asymmetry in $D^{0} \rightarrow K^{0}_{S}K^{0}_{S}$ decays reconstructed in $e^{+}e^{-} \rightarrow c\overline{c}$ events collected by the Belle and Belle II experiments. The corresponding data samples have integrated luminosities of 980 fb$^{-1}$ and 428 fb$^{-1}$, respectively. The $D^{0}$ decays are required to originate from the $D^{*+} \rightarrow D^{0}\pi^{+}$ decay, which determines the charm flavor at production time. A control sample of $D^{0} \rightarrow K^{+}K^{-}$ decays is used to correct for production and detection asymmetries. The result, $(-1.4\pm1.3{\rm(stat)}\pm0.1{\rm (syst)})\%$, is consistent with previous determinations and with CP symmetry., Comment: 10 pages, 3 figures. arXiv admin note: text overlap with arXiv:2410.22961

Artificial intelligence may assist healthcare systems in meeting increasing demand for pathology services while maintaining diagnostic quality and reducing turnaround time and costs. We aimed to investigate the performance of an institutionally developed system for prostate cancer detection, grading, and workflow optimization and to contrast this with commercial alternatives. From August 2021 to March 2023, we scanned 21,396 slides from 1,147 patients with positive biopsies. We developed models for cancer detection, grading, and screening of equivocal cases for IHC ordering. We compared a task-specific model trained using the PANDA dataset of prostate cancer biopsies with one built using features extracted by the general-purpose histology foundation model, UNI and compare their performance in an unfiltered prospectively collected dataset that reflects our patient population (1737 slides,95 patients). We evaluated the contributions of a bespoke model designed to improve sensitivity in detecting small cancer foci and scoring of broader patterns observed at lower resolution. We found high concordance between the developed systems and pathologist reference in detection (AUC 98.5, sensitivity 95.0, and specificity 97.8), ISUP grading (quadratic Cohen's kappa 0.869), grade group 3 or higher (AUC 97.5, sensitivity 94.9, specificity 96.6) and comparable to published data from commercial systems. Screening could reduce IHC ordering for equivocal cases by 44.5% with an overall error rate of 1.8% (1.4% false positive, 0.4% false negative rates). Institutions like academic medical centers that have high scanning volumes and report abstraction capabilities can develop accurate computational pathology models for internal use. These models have the potential to aid in quality control role and to improve workflow in the pathology lab to help meet future challenges in prostate cancer diagnosis.

Resting-state EEG data in neuroscience research serve as reliable markers for user identification and reveal individual-specific traits. Despite this, the use of resting-state data in EEG classification models is limited. In this work, we propose a feature concatenation approach to enhance decoding models' generalization by integrating resting-state EEG, aiming to improve motor imagery BCI performance and develop a user-generalized model. Using feature concatenation, we combine the EEGNet model, a standard convolutional neural network for EEG signal classification, with functional connectivity measures derived from resting-state EEG data. The findings suggest that although grounded in neuroscience with data-driven learning, the concatenation approach has limited benefits for generalizing models in within-user and across-user scenarios. While an improvement in mean accuracy for within-user scenarios is observed on two datasets, concatenation doesn't benefit across-user scenarios when compared with random data concatenation. The findings indicate the necessity of further investigation on the model interpretability and the effect of random data concatenation on model robustness.

It is well-known that within the standard three flavor neutrino oscillation formalism, the Majorana phases appearing in the neutrino mixing matrix cannot have any effect on neutrino oscillation probabilities thereby evading testability at neutrino oscillation experiments. We consider an effective non-Hermitian Hamiltonian describing three flavor neutrino oscillations with the possibility of neutrino decay and demonstrate that the two Majorana phases can entangle with the off-diagonal decay terms and appear at the level of oscillation probabilities. Using the Cayley-Hamilton theorem, we derive approximate analytical expressions for three flavor neutrino oscillation probabilities in the presence of neutrino decay, taking into account matter effects. In the context of a long baseline neutrino experiment, we then analyse the impact of Majorana phases on the oscillation probabilities for different channels as well as on observables related to CP violation effects in neutrino oscillations. Finally, we discuss the effect of Majorana phases on the parameter degeneracies in the neutrino oscillation framework., Comment: 27 pages, 8 figures. Comments Welcome

The molecular biology revolution of the last seventy five years has transformed our view of living systems. Scientific explanations of biological phenomena are now synonymous with the identification of the genes, proteins, and signaling molecules involved. The hegemony of the molecular paradigm has only become more pronounced as new technologies allow us to make measurements at scale. Combining this wealth of data with new ``artificial intelligence'' techniques is viewed as the future of biology. Here, we challenge this emerging ``common sense'', laying out a roadmap for developing a theoretical understanding of life. We argue that a twenty-first century theoretical biology must be founded on a new type of statistical physics suited to the living world. Rather than merely constructing statistical models, a statistical theory requires developing ``quantitative abstractions'' for understanding the gene-organism-environment triad. This necessitates overcoming four major challenges that distinguish living matter: (1) living systems are composed of a large number of heterogeneous parts rather than a large number of identical objects; (2) living systems control and manipulate the physical world in a manner that is extremely different from the ways considered in traditional statistical physics; (3) living systems necessarily operate out of equilibrium; (4) living systems are evolved objects with a function, resulting in new types of constraints that must be imposed on probabilistic ensembles. We conclude by discussing a few key themes that we view as promising directions for developing a statistical physics of life: typicality, localized biological control, a linear response of complex systems with non-reciprocal interactions, biological resource allocation, and learning and adaptation in overparameterized systems., Comment: 13 pages; Essay written for Chan Zuckerberg Theory in Biology Initiative

Parkinson's disease (PD) is a progressive neurological disorder that impacts the quality of life significantly, making in-home monitoring of motor symptoms such as Freezing of Gait (FoG) critical. However, existing symptom monitoring technologies are power-hungry, rely on extensive amounts of labeled data, and operate in controlled settings. These shortcomings limit real-world deployment of the technology. This work presents LIFT-PD, a computationally-efficient self-supervised learning framework for real-time FoG detection. Our method combines self-supervised pre-training on unlabeled data with a novel differential hopping windowing technique to learn from limited labeled instances. An opportunistic model activation module further minimizes power consumption by selectively activating the deep learning module only during active periods. Extensive experimental results show that LIFT-PD achieves a 7.25% increase in precision and 4.4% improvement in accuracy compared to supervised models while using as low as 40% of the labeled training data used for supervised learning. Additionally, the model activation module reduces inference time by up to 67% compared to continuous inference. LIFT-PD paves the way for practical, energy-efficient, and unobtrusive in-home monitoring of PD patients with minimal labeling requirements., Comment: 11 pages

Despite growing efforts to halt distasteful content on social media, multilingualism has added a new dimension to this problem. The scarcity of resources makes the challenge even greater when it comes to low-resource languages. This work focuses on providing a novel method for abusive content detection in multiple low-resource Indic languages. Our observation indicates that a post's tendency to attract abusive comments, as well as features such as user history and social context, significantly aid in the detection of abusive content. The proposed method first learns social and text context features in two separate modules. The integrated representation from these modules is learned and used for the final prediction. To evaluate the performance of our method against different classical and state-of-the-art methods, we have performed extensive experiments on SCIDN and MACI datasets consisting of 1.5M and 665K multilingual comments, respectively. Our proposed method outperforms state-of-the-art baseline methods with an average increase of 4.08% and 9.52% in F1-scores on SCIDN and MACI datasets, respectively.

Violation of the Bell-type inequalities is very necessary to confirm the existence of the nonlocality in the nonclassical (entangled) states. We have designed a customized operator which is made of the sum of the identity and Pauli matrices ($I$, $\sigma_x$, $\sigma_y$, and $\sigma_z$). We theoretically evaluate the Bell-type violation for the two-qubit Bell state and a four-qubit Dicke state, which gives the Bell-CHSH parameter values $2\sqrt{2}$ and $3.05$, respectively for our customized operator. For experimental implementation, IBM's 127-qubitQuantum Processing Units (QPU) were utilized, where we have applied our customized operator to evaluate Bell-type inequalities for two-qubit Bell state ($\vert\Phi^+\rangle$) and four-qubit Dicke state ($|D^{(2)}_4\rangle$). We observed, for the two-qubit Bell state, the experimental Bell violation was $2.7507\pm 0.0197$. For Dicke state, we found the violation be to $2.1239\pm0.0457$ and $2.2175\pm0.0352$ respectively for two distinct methods of state preparation. All our results show clear violation of the local realism; however, we find that the experimental violation of the Bell state ($2.75$) is close to the theoretical ($2.82$) results due to lower circuit depth in state-preparation as well as fewer measurements, while the Dicke state shows greater errors ($2.12$ and $2.21$ vs. $3.05$) from higher depth and more measurements.

We present a model of speech perception which takes into account effects of correlations between sounds. Words in this model correspond to the attractors of a suitably chosen descent dynamics. The resulting lexicon is rich in short words, and much less so in longer ones, as befits a reasonable word length distribution. We separately examine the decryption of short and long words in the presence of mishearings. In the regime of short words, the algorithm either quickly retrieves a word, or proposes another valid word. In the regime of longer words, the behaviour is markedly different. While the successful decryption of words continues to be relatively fast, there is a finite probability of getting lost permanently, as the algorithm wanders round the landscape of suitable words without ever settling on one., Comment: 22 pages, 19 figures, 1 table

This paper presents a deep learning framework for the multi-class classification of gastrointestinal abnormalities in Video Capsule Endoscopy (VCE) frames. The aim is to automate the identification of ten GI abnormality classes, including angioectasia, bleeding, and ulcers, thereby reducing the diagnostic burden on gastroenterologists. Utilizing an ensemble of DenseNet and ResNet architectures, the proposed model achieves an overall accuracy of 94\% across a well-structured dataset. Precision scores range from 0.56 for erythema to 1.00 for worms, with recall rates peaking at 98% for normal findings. This study emphasizes the importance of robust data preprocessing techniques, including normalization and augmentation, in enhancing model performance. The contributions of this work lie in developing an effective AI-driven tool that streamlines the diagnostic process in gastroenterology, ultimately improving patient care and clinical outcomes., Comment: 10 pages, 5 figures, CVIP challenge report including the validation results

We introduce a modified Weighted Cascade model that integrates asymmetric budgets and product scores, providing new insights into the Generalized Asymmetric Influence Maximization problem, which we establish as NP-hard. Our simulations demonstrate that players with higher budgets possess a distinct advantage in networks characterized by larger diameters, whereas players with superior product scores exhibit a significant advantage in networks with smaller diameters. Moreover, we identify a robust linear relationship between graph size and the magnitude of influenced nodes. In densely connected networks we derive bounds for the probabilities of influence that are independent of network size. Our examination of Nash equilibria in this domain underscores the absence of a guaranteed pure Nash equilibrium, suggesting that the strategic enhancement of budgets or product scores may yield more substantial benefits than the pursuit of an optimal strategy in this context.

Barocalorics (BCs) are emerging as promising alternatives to vapour-phase refrigerants, which are problematic as they exacerbate climate change when they inevitably leak into the atmosphere. However, the commercialisation of BC refrigerants is significantly hindered by hysteresis in the solid-solid phase transition that would be exploited in a refrigeration cycle. Here, we provide new insight into the hysteresis that is a critical step towards the rational design of viable BCs. By studying the archetypal BC plastic crystal, neopentyl glycol (NPG), we observe for the first time the liberation of the hydroxyl rotational modes that unlock the hydrogen bonding network. We use high-resolution inelastic fixed-window neutron scattering studies in combination with quasielastic neutron scattering (QENS) measurements to build a comprehensive microscopic understanding of the NPG phase transition. Hysteresis previously observed in calorimetric studies of NPG is now observed directly as hysteresis in molecular rotational modes, and hence in the formation and disruption of hydrogen bonding. Furthermore, by tracking the thermal activation of three main reorientation modes, we suggest that their fractional excitations may resolve an outstanding discrepancy between measured and calculated entropy change. These results allow for direct study of the molecular dynamics that govern the thermal hysteresis of small molecule energy materials. They will be broadly applicable, as many promising BC material families possess first-order transitions involving molecular reorientations.

In limbed robotics, end-effectors must serve dual functions, such as both feet for locomotion and grippers for grasping, which presents design challenges. This paper introduces a multi-modal end-effector capable of transitioning between flat and line foot configurations while providing grasping capabilities. MAGPIE integrates 8-axis force sensing using proposed mechanisms with hall effect sensors, enabling both contact and tactile force measurements. We present a computational design framework for our sensing mechanism that accounts for noise and interference, allowing for desired sensitivity and force ranges and generating ideal inverse models. The hardware implementation of MAGPIE is validated through experiments, demonstrating its capability as a foot and verifying the performance of the sensing mechanisms, ideal models, and gated network-based models.

Recent progress in large language models (LLMs) offers promising new approaches for recommendation system (RecSys) tasks. While the current state-of-the-art methods rely on fine-tuning LLMs to achieve optimal results, this process is costly and introduces significant engineering complexities. Conversely, methods that bypass fine-tuning and use LLMs directly are less resource-intensive but often fail to fully capture both semantic and collaborative information, resulting in sub-optimal performance compared to their fine-tuned counterparts. In this paper, we propose a Simple Training-free Approach for Recommendation (STAR), a framework that utilizes LLMs and can be applied to various recommendation tasks without the need for fine-tuning. Our approach involves a retrieval stage that uses semantic embeddings from LLMs combined with collaborative user information to retrieve candidate items. We then apply an LLM for pairwise ranking to enhance next-item prediction. Experimental results on the Amazon Review dataset show competitive performance for next item prediction, even with our retrieval stage alone. Our full method achieves Hits@10 performance of +23.8% on Beauty, +37.5% on Toys and Games, and -1.8% on Sports and Outdoors relative to the best supervised models. This framework offers an effective alternative to traditional supervised models, highlighting the potential of LLMs in recommendation systems without extensive training or custom architectures.

The UltraViolet imaging of the Cosmic Assembly Near-infrared Deep Extragalactic Legacy Survey Fields (UVCANDELS) program provides deep HST F275W and F435W imaging over four CANDELS fields (GOODS-N, GOODS-S, COSMOS, and EGS). We combine this newly acquired UV imaging with existing HST imaging from CANDELS as well as existing ancillary data to obtain robust photometric redshifts and reliable estimates for galaxy physical properties for over 150,000 galaxies in the $\sim$430 arcmin$^2$ UVCANDELS area. Here, we leverage the power of the new UV photometry to not only improve the photometric redshift measurements in these fields, but also constrain the full redshift probability distribution combining multiple redshift fitting tools. Furthermore, using the full UV-to-IR photometric dataset, we measure the galaxy physical properties by fitting templates from population synthesis models with two different parameterizations (flexible and fixed-form) of the star-formation histories (SFHs). Compared to the flexible SFH parametrization, we find that the fixed-form SFHs systematically underestimate the galaxy stellar masses, both at the low- ($\lesssim10^9 M_\odot$) and high- ($\gtrsim10^{10} M_\odot$) mass end, by as much as $\sim0.5$ dex. This underestimation is primarily due the limited ability of fixed-form SFH parameterization to simultaneously capture the chaotic nature of star-formation in these galaxies., Comment: 22 pages, 6 figures; accepted to ApJS; catalogs available via MAST

Free-induction-decay (FID) magnetometers have evolved as simple magnetic sensors for sensitive detection of unknown magnetic fields. However, these magnetometers suffer from a fundamental problem known as a "dead zone," making them insensitive to certain magnetic field directions. Here, we demonstrate a simple experimental scheme for the dead-zone-free operation of a FID atomic magnetometer. Using a single laser beam containing equal strength of linear- and circular-polarization components and amplitude-modulation at a low-duty cycle, we have synchronously pumped the rubidium-87 atoms with both first- and second-order frequency harmonics. Such a novel pumping scheme has enabled us to observe the free Larmor precession of atomic spins at a frequency of $\Omega_L$ (orientation) and/or 2$\Omega_L$ (alignment) in a single FID signal, depending on the direction of the external magnetic field. We observed that the amplitude of the FID signal does not go to zero for any magnetic field direction, proving the absence of dead zones in the magnetometer. The magnetometer has a sensitivity in the range of 3.5 - 7.8 pT/$\sqrt{Hz}$ in all directions. Such a generic experimental scheme can play a crucial role in developing miniaturized atomic magnetometers for various practical applications, including geomagnetic applications., Comment: 5 pages, 4 figures

The most common method to auto-grade a student's submission in a CS1 or a CS2 course is to run it against a pre-defined test suite and compare the results against reference results. However, this technique cannot be used if the correctness of the solution goes beyond simple output, such as the algorithm used to obtain the result. There is no convenient method for the graders to identify the kind of algorithm used in solving a problem. They must read the source code and understand the algorithm implemented and its features, which makes the process tedious. We propose CASET(Complexity Analysis using Simple Execution Traces), a novel tool to analyze the time complexity of algorithms using dynamic traces and unsupervised machine learning. CASET makes it convenient for tutors to classify the submissions for a program into time complexity baskets. Thus, tutors can identify the algorithms used by the submissions without necessarily going through the code written by the students. CASET's analysis can be used to improve grading and provide detailed feedback for submissions that try to match the results without a proper algorithm, for example, hard-coding a binary result, pattern-matching the visible or common inputs. We show the effectiveness of CASET by computing the time complexity of many classes of algorithms like sorting, searching and those using dynamic programming paradigm., Comment: 5 pages

Information-Seeking Dialogue (ISD) agents aim to provide accurate responses to user queries. While proficient in directly addressing user queries, these agents, as well as LLMs in general, predominantly exhibit reactive behavior, lacking the ability to generate proactive responses that actively engage users in sustained conversations. However, existing definitions of proactive dialogue in this context do not focus on how each response actively engages the user and sustains the conversation. Hence, we present a new definition of proactivity that focuses on enhancing the `proactiveness' of each generated response via the introduction of new information related to the initial query. To this end, we construct a proactive dialogue dataset comprising 2,000 single-turn conversations, and introduce several automatic metrics to evaluate response `proactiveness' which achieved high correlation with human annotation. Additionally, we introduce two innovative Chain-of-Thought (CoT) prompts, the 3-step CoT and the 3-in-1 CoT prompts, which consistently outperform standard prompts by up to 90% in the zero-shot setting.

The study of phonon coupling in doped semiconductors via electrical transport measurements is challenging due to unwanted temperature-induced effects such as dopant ionisation and parallel conduction. Here, we study phonon scattering in 2D electrons and holes in the $1.6-92.5$K range without the use of extrinsic doping, where both acoustic and longitudinal optic (LO) phonons come into effect. We use undoped GaAs/$\mathrm{Al_{x} Ga_{1-x} As}$ heterostructures and examine the temperature dependence of the sample resistivity, extracting phonon coupling constants and the LO activation energy. Our results are consistent with results obtained through approaches other than transport measurements, and highlight the benefit of this approach for studying electron-phonon and hole-phonon coupling., Comment: The following article has been submitted to Applied Physics Letters

Recent advancements in vision-language models (VLMs) have expanded their potential for real-world applications, enabling these models to perform complex reasoning on images. In the widely used fully autoregressive transformer-based models like LLaVA, projected visual tokens are prepended to textual tokens. Oftentimes, visual tokens are significantly more than prompt tokens, resulting in increased computational overhead during both training and inference. In this paper, we propose Visual Compact Token Registers (Victor), a method that reduces the number of visual tokens by summarizing them into a smaller set of register tokens. Victor adds a few learnable register tokens after the visual tokens and summarizes the visual information into these registers using the first few layers in the language tower of VLMs. After these few layers, all visual tokens are discarded, significantly improving computational efficiency for both training and inference. Notably, our method is easy to implement and requires a small number of new trainable parameters with minimal impact on model performance. In our experiment, with merely 8 visual registers--about 1% of the original tokens--Victor shows less than a 4% accuracy drop while reducing the total training time by 43% and boosting the inference throughput by 3.3X.

We introduce DynaCLR, a self-supervised framework for modeling cell dynamics via contrastive learning of representations of time-lapse datasets. Live cell imaging of cells and organelles is widely used to analyze cellular responses to perturbations. Human annotation of dynamic cell states captured by time-lapse perturbation datasets is laborious and prone to bias. DynaCLR integrates single-cell tracking with time-aware contrastive learning to map images of cells at neighboring time points to neighboring embeddings. Mapping the morphological dynamics of cells to a temporally regularized embedding space makes the annotation, classification, clustering, or interpretation of the cell states more quantitative and efficient. We illustrate the features and applications of DynaCLR with the following experiments: analyzing the kinetics of viral infection in human cells, detecting transient changes in cell morphology due to cell division, and mapping the dynamics of organelles due to viral infection. Models trained with DynaCLR consistently achieve $>95\%$ accuracy for infection state classification, enable the detection of transient cell states and reliably embed unseen experiments. DynaCLR provides a flexible framework for comparative analysis of cell state dynamics due to perturbations, such as infection, gene knockouts, and drugs. We provide PyTorch-based implementations of the model training and inference pipeline (https://github.com/mehta-lab/viscy) and a user interface (https://github.com/czbiohub-sf/napari-iohub) for the visualization and annotation of trajectories of cells in the real space and the embedding space., Comment: 20 pages, 6 figures, 3 appendix figures, 4 videos (ancillary files)

Pretraining robust vision or multimodal foundation models (e.g., CLIP) relies on large-scale datasets that may be noisy, potentially misaligned, and have long-tail distributions. Previous works have shown promising results in augmenting datasets by generating synthetic samples. However, they only support domain-specific ad hoc use cases (e.g., either image or text only, but not both), and are limited in data diversity due to a lack of fine-grained control over the synthesis process. In this paper, we design a \emph{controllable} image-text synthesis pipeline, CtrlSynth, for data-efficient and robust multimodal learning. The key idea is to decompose the visual semantics of an image into basic elements, apply user-specified control policies (e.g., remove, add, or replace operations), and recompose them to synthesize images or texts. The decompose and recompose feature in CtrlSynth allows users to control data synthesis in a fine-grained manner by defining customized control policies to manipulate the basic elements. CtrlSynth leverages the capabilities of pretrained foundation models such as large language models or diffusion models to reason and recompose basic elements such that synthetic samples are natural and composed in diverse ways. CtrlSynth is a closed-loop, training-free, and modular framework, making it easy to support different pretrained models. With extensive experiments on 31 datasets spanning different vision and vision-language tasks, we show that CtrlSynth substantially improves zero-shot classification, image-text retrieval, and compositional reasoning performance of CLIP models.

The NOvA collaboration reports cross-section measurements for $\nu_{\mu}$ charged-current interactions with low hadronic energy (maximum kinetic energy of 250 MeV for protons and 175 MeV for pions) in the NOvA Near Detector. The results are presented as a double-differential cross section as a function of the direct observables of the final-state muon kinematics. Results are also presented as a single-differential cross section as a function of the derived square of the four-momentum transfer, $Q^{2}$, and as a function of the derived neutrino energy. The data correspond to an accumulated 8.09$\times10^{20}$ protons-on-target (POT) in the neutrino mode of the NuMI beam, with a narrow band of neutrino energies peaked at 1.8 GeV. The analysis provides a sample of neutrino-nucleus interactions with an enhanced fraction of quasi-elastic and two-particle-two-hole (2p2h) interactions. This enhancement allows quantitative comparisons with various nuclear models. We find strong disagreement between data and theory-based models in various regions of the muon kinematic phase space, especially in the forward muon direction., Comment: 20 pages, 12 figures. The second version includes an additional citation and adds four previously missing authors

GJ1214b is the archetype sub-Neptune for which thick aerosols have prevented us from constraining its atmospheric properties for over a decade. In this study, we leverage the panchromatic transmission spectrum of GJ1214b established by HST and JWST to investigate its atmospheric properties using a suite of atmospheric radiative transfer, photochemistry, and aerosol microphysical models. We find that the combined HST, JWST/NIRSpec and JWST/MIRI spectrum can be well-explained by atmospheric models with an extremely high metallicity of [M/H]$\sim$3.5 and an extremely high haze production rate of $F_{\rm haze}{\sim}10^{-8}$--$10^{-7}$ g cm$^{-2}$ s$^{-1}$. Such high atmospheric metallicity is suggested by the relatively strong CO2 feature compared to the haze absorption feature or the CH4 feature in the NIRSpec-G395H bandpass of 2.5--5 $\mu$m. The flat 5--12 $\mu$m MIRI spectrum also suggests a small scale height with a high atmospheric metallicity that is needed to suppress a prominent 6 $\mu$m haze feature. We tested the sensitivity of our interpretation to various assumptions for uncertain haze properties, such as optical constants and production rate, and all models tested here consistently suggest extremely high metallicity. Thus, we conclude that GJ1214b likely has a metal-dominated atmosphere where hydrogen is no longer the main atmospheric constituent. We also find that different assumptions for the haze production rate lead to distinct inferences for the atmospheric C/O ratio. We stress the importance of high precision follow-up observations to confirm the metal-dominated atmosphere and to constrain the C/O ratio, which provides further insights on the planet formation process. The confirmation of the metal-dominated atmosphere is particularly crucial, as it challenges the conventional understanding of interior structure and evolution of sub-Neptunes., Comment: 21 pages, 9 figures, Submitted to AAS Journals, Please also see a companion paper Schlawin et al. (2024)

Sub-Neptune planets with radii smaller than Neptune (3.9 Re) are the most common type of planet known to exist in The Milky Way, even though they are absent in the Solar System. These planets can potentially have a large diversity of compositions as a result of different mixtures of rocky material, icy material and gas accreted from a protoplanetary disk. However, the bulk density of a sub-Neptune, informed by its mass and radius alone, cannot uniquely constrain its composition; atmospheric spectroscopy is necessary. GJ 1214 b, which hosts an atmosphere that is potentially the most favorable for spectroscopic detection of any sub-Neptune, is instead enshrouded in aerosols (thus showing no spectroscopic features), hiding its composition from view at previously observed wavelengths in its terminator. Here, we present a JWST NIRSpec transmission spectrum from 2.8 to 5.1 um that shows signatures of carbon dioxide and methane, expected at high metallicity. A model containing both these molecules is preferred by 3.3 and 3.6 sigma as compared to a featureless spectrum for two different data analysis pipelines, respectively. Given the low signal-to-noise of the features compared to the continuum, however, more observations are needed to confirm the carbon dioxide and methane signatures and better constrain other diagnostic features in the near-infrared. Further modeling of the planet's atmosphere, interior structure and origins will provide valuable insights about how sub-Neptunes like GJ 1214 b form and evolve., Comment: 22 pages, 11 figures, Accepted in ApJL, Please also see a companion paper Ohno et al. (2024)

Large Language Models (LLMs) have transformed natural language processing, but face significant challenges in widespread deployment due to their high runtime cost. In this paper, we introduce SeedLM, a novel post-training compression method that uses seeds of pseudo-random generators to encode and compress model weights. Specifically, for each block of weights, we find a seed that is fed into a Linear Feedback Shift Register (LFSR) during inference to efficiently generate a random matrix. This matrix is then linearly combined with compressed coefficients to reconstruct the weight block. SeedLM reduces memory access and leverages idle compute cycles during inference, effectively speeding up memory-bound tasks by trading compute for fewer memory accesses. Unlike state-of-the-art compression methods that rely on calibration data, our approach is data-free and generalizes well across diverse tasks. Our experiments with Llama 3 70B, which is particularly challenging to compress, show that SeedLM achieves significantly better zero-shot accuracy retention at 4- and 3-bit than state-of-the-art techniques, while maintaining performance comparable to FP16 baselines. Additionally, FPGA-based tests demonstrate that 4-bit SeedLM, as model size increases to 70B, approaches a 4x speed-up over an FP16 Llama 2/3 baseline.

We present a measurement of the branching fraction and time-dependent charge-parity ($CP$) decay-rate asymmetries in $B^0 \to J/\psi \pi^0$ decays. The data sample was collected with the Belle~II detector at the SuperKEKB asymmetric $e^+e^-$ collider in 2019-2022 and contains $(387\pm 6)\times 10^6$ $B\overline{B}$ meson pairs from $\Upsilon(4S)$ decays. We reconstruct $392\pm 24$ signal decays and fit the $CP$ parameters from the distribution of the proper-decay-time difference of the two $B$ mesons. We measure the branching fraction to be $B(B^0 \to J/\psi \pi^0)=(2.02 \pm 0.12 \pm 0.10)\times 10^{-5}$ and the direct and mixing-induced $CP$ asymmetries to be $C_{CP}=0.13 \pm 0.12 \pm 0.03$ and $S_{CP}=-0.88 \pm 0.17 \pm 0.03$, respectively, where the first uncertainties are statistical and the second are systematic. We observe mixing-induced $CP$ violation with a significance of $5.0$ standard deviations for the first time in this mode.

Inference with transformer-based language models begins with a prompt processing step. In this step, the model generates the first output token and stores the KV cache needed for future generation steps. This prompt processing step can be computationally expensive, taking 10s of seconds or more for billion-parameter models on edge devices when prompt lengths or batch sizes rise. This degrades user experience by introducing significant latency into the model's outputs. To reduce the time spent producing the first output (known as the ``time to first token'', or TTFT) of a pretrained model, we introduce a novel method called KV Prediction. In our method, a small auxiliary model is used to process the prompt and produce an approximation of the KV cache used by a base model. This approximated KV cache is then used with the base model for autoregressive generation without the need to query the auxiliary model again. We demonstrate that our method produces a pareto-optimal efficiency-accuracy trade-off when compared to baselines. On TriviaQA, we demonstrate relative accuracy improvements in the range of $15\%-50\%$ across a range of TTFT FLOPs budgets. We also demonstrate accuracy improvements of up to $30\%$ on HumanEval python code completion at fixed TTFT FLOPs budgets. Additionally, we benchmark models on an Apple M2 Pro CPU and demonstrate that our improvement in FLOPs translates to a TTFT speedup on hardware. We release our code at https://github.com/apple/corenet/tree/main/projects/kv-prediction .

We present multi-epoch optical spectropolarimetric and imaging polarimetric observations of the nearby Type II supernova (SN) 2023ixf discovered in M101 at a distance of 6.85 Mpc. The first imaging polarimetric observations were taken +2.33 days (60085.08 MJD) after the explosion, while the last imaging polarimetric data points (+73.19 and +76.19 days) were acquired after the fall from the light curve plateau. At +2.33 days there is strong evidence of circumstellar material (CSM) interaction in the spectra and the light curve. A significant level of polarization $P_r = 0.88\pm 0.06 \% $ seen during this phase indicates that this CSM is aspherical. We find that the polarization evolves with time toward the interstellar polarization level ($0.35\%$) during the photospheric phase, which suggests that the recombination photosphere is spherically symmetric. There is a jump in polarization ($P_r =0.65 \pm 0.08 \% $) at +73.19 days when the light curve falls from the plateau. This is a phase where polarimetric data is sensitive to non-spherical inner ejecta or a decrease in optical depth into the single scattering regime. We also present spectropolarimetric data that reveal line (de)polarization during most of the observed epochs. In addition, at +14.50 days we see an "inverse P Cygn" profile in the H and He line polarization, which clearly indicates the presence of asymmetrically distributed material overlying the photosphere. The overall temporal evolution of polarization is typical for Type II SNe, but the high level of polarization during the rising phase has only been observed in SN 2023ixf., Comment: 14 pages, 7 figures, submitted to ApJL, comments welcome

In-hand manipulation of tools using dexterous hands in real-world is an underexplored problem in the literature. In addition to more complex geometry and larger size of the tools compared to more commonly used objects like cubes or cylinders, task oriented in-hand tool manipulation involves many sub-tasks to be performed sequentially. This may involve reaching to the tool, picking it up, reorienting it in hand with or without regrasping to reach to a desired final grasp appropriate for the tool usage, and carrying the tool to the desired pose. Research on long-horizon manipulation using dexterous hands is rather limited and the existing work focus on learning the individual sub-tasks using a method like reinforcement learning (RL) and combine the policies for different subtasks to perform a long horizon task. However, in general a single method may not be the best for all the sub-tasks, and this can be more pronounced when dealing with multi-fingered hands manipulating objects with complex geometry like tools. In this paper, we investigate the use of a mixed-method approach to solve for the long-horizon task of tool usage and we use imitation learning, reinforcement learning and model based control. We also discuss a new RL-based teacher-student framework that combines real world data into offline training. We show that our proposed approach for each subtask outperforms the commonly adopted reinforcement learning approach across different subtasks and in performing the long horizon task in simulation. Finally we show the successful transferability to real world.

Instruction following is a key capability for LLMs. However, recent studies have shown that LLMs often struggle with instructions containing multiple constraints (e.g. a request to create a social media post "in a funny tone" with "no hashtag"). Despite this, most evaluations focus solely on synthetic data. To address this, we introduce RealInstruct, the first benchmark designed to evaluate LLMs' ability to follow real-world multi-constrained instructions by leveraging queries real users asked AI assistants. We also investigate model-based evaluation as a cost-effective alternative to human annotation for this task. Our findings reveal that even the proprietary GPT-4 model fails to meet at least one constraint on over 21% of instructions, highlighting the limitations of state-of-the-art models. To address the performance gap between open-source and proprietary models, we propose the Decompose, Critique and Refine (DeCRIM) self-correction pipeline, which enhances LLMs' ability to follow constraints. DeCRIM works by decomposing the original instruction into a list of constraints and using a Critic model to decide when and where the LLM's response needs refinement. Our results show that DeCRIM improves Mistral's performance by 7.3% on RealInstruct and 8.0% on IFEval even with weak feedback. Moreover, we demonstrate that with strong feedback, open-source LLMs with DeCRIM can outperform GPT-4 on both benchmarks., Comment: To appear at EMNLP 2024

Release engineering has traditionally focused on continuously delivering features and bug fixes to users, but at a certain scale, it becomes impossible for a release engineering team to determine what should be released. At Meta's scale, the responsibility appropriately and necessarily falls back on the engineer writing and reviewing the code. To address this challenge, we developed models of diff risk scores (DRS) to determine how likely a diff is to cause a SEV, i.e., a severe fault that impacts end-users. Assuming that SEVs are only caused by diffs, a naive model could randomly gate X% of diffs from landing, which would automatically catch X% of SEVs on average. However, we aimed to build a model that can capture Y% of SEVs by gating X% of diffs, where Y >> X. By training the model on historical data on diffs that have caused SEVs in the past, we can predict the riskiness of an outgoing diff to cause a SEV. Diffs that are beyond a particular threshold of risk can then be gated. We have four types of gating: no gating (green), weekend gating (weekend), medium impact on end-users (yellow), and high impact on end-users (red). The input parameter for our models is the level of gating, and the outcome measure is the number of captured SEVs. Our research approaches include a logistic regression model, a BERT-based model, and generative LLMs. Our baseline regression model captures 18.7%, 27.9%, and 84.6% of SEVs while respectively gating the top 5% (weekend), 10% (yellow), and 50% (red) of risky diffs. The BERT-based model, StarBERT, only captures 0.61x, 0.85x, and 0.81x as many SEVs as the logistic regression for the weekend, yellow, and red gating zones, respectively. The generative LLMs, iCodeLlama-34B and iDiffLlama-13B, when risk-aligned, capture more SEVs than the logistic regression model in production: 1.40x, 1.52x, 1.05x, respectively.

In a functional encryption (FE) scheme, a user that holds a ciphertext and a function-key can learn the result of applying the function to the plaintext message. Security requires that the user does not learn anything beyond the function evaluation. On the other hand, unclonable encryption (UE) is a uniquely quantum primitive, which ensures that an adversary cannot duplicate a ciphertext to decrypt the same message multiple times. In this work we introduce unclonable quantum functional encryption (UFE), which both extends the notion of FE to the quantum setting and also possesses the unclonable security of UE. We give a construction for UFE that supports arbitrary quantum messages and polynomialy-sized circuit, and achieves unclonable-indistinguishable security for independently sampled function keys. In particular, our UFE guarantees that two parties cannot simultaneously recover the correct function outputs using two independently sampled function keys. Our construction combines quantum garbled circuits [BY22], and quantum-key unclonable encryption [AKY24], and leverages techniques from the plaintext expansion arguments in [Hir+23]. As an application we give the first construction for public-key UE with variable decryption keys. Lastly, we establish a connection between quantum indistinguishability obfuscation (qiO) and quantum functional encryption (QFE); Showing that any multi-input indistinguishability-secure quantum functional encryption scheme unconditionally implies the existence of qiO.

LIFT-PD is an innovative self-supervised learning framework developed for real-time detection of Freezing of Gait (FoG) in Parkinson's Disease (PD) patients, using a single triaxial accelerometer. It minimizes the reliance on large labeled datasets by applying a Differential Hopping Windowing Technique (DHWT) to address imbalanced data during training. Additionally, an Opportunistic Inference Module is used to reduce energy consumption by activating the model only during active movement periods. Extensive testing on publicly available datasets showed that LIFT-PD improved precision by 7.25% and accuracy by 4.4% compared to supervised models, while using 40% fewer labeled samples and reducing inference time by 67%. These findings make LIFT-PD a highly practical and energy-efficient solution for continuous, in-home monitoring of PD patients., Comment: 2pages, 2 figures, submitted in BHI'24

Double- and single-differential cross sections for inclusive charged-current neutrino-nucleus scattering are reported for the kinematic domain 0 to 2 GeV/c in three-momentum transfer and 0 to 2 GeV in available energy, at a mean muon-neutrino energy of 1.86 GeV. The measurements are based on an estimated 995,760 muon-neutrino CC interactions in the scintillator medium of the NOvA Near Detector. The subdomain populated by 2-particle-2-hole reactions is identified by the cross-section excess relative to predictions for neutrino-nucleus scattering that are constrained by a data control sample. Models for 2-particle-2- hole processes are rated by chi-square comparisons of the predicted-versus-measured muon-neutrino CC inclusive cross section over the full phase space and in the restricted subdomain. Shortfalls are observed in neutrino generator predictions obtained using the theory-based Val`encia and SuSAv2 2p2h models., Comment: 20 pages, 14 figures

When training transformers on graph-structured data, incorporating information about the underlying topology is crucial for good performance. Topological masking, a type of relative position encoding, achieves this by upweighting or downweighting attention depending on the relationship between the query and keys in a graph. In this paper, we propose to parameterise topological masks as a learnable function of a weighted adjacency matrix -- a novel, flexible approach which incorporates a strong structural inductive bias. By approximating this mask with graph random features (for which we prove the first known concentration bounds), we show how this can be made fully compatible with linear attention, preserving $\mathcal{O}(N)$ time and space complexity with respect to the number of input tokens. The fastest previous alternative was $\mathcal{O}(N \log N)$ and only suitable for specific graphs. Our efficient masking algorithms provide strong performance gains for tasks on image and point cloud data, including with $>30$k nodes.