Search

The third author introduced the $g$-polynomial $g_M(t)$ of a matroid, a covaluative matroid statistic which is unchanged under series and parallel extension. The $g$-polynomial of a rank $r$ matroid $M$ has the form $g_1 t + g_2 t^2 + \cdots + g_r t^r$. The coefficient $g_1$ is Crapo's classical $\beta$-invariant. In this paper, we study the coefficient $g_r$, which we term the $\omega$-invariant of $M$. We show that, if $\omega(N)$ is nonnegative for every minor $N$ of $M$, then all the coefficients of $g_M(t)$ are nonnegative. We give several simplified versions of Ferroni's formula for $\omega(M)$, and compute $\omega(M)$ when $r$ or $|E(M)|-2r$ is small., Comment: 35 pages

Guarded Kleene Algebra with Tests (GKAT) provides a sound and complete framework to reason about trace equivalence between simple imperative programs. However, there are still several notable limitations. First, GKAT is completely agnostic with respect to the meaning of primitives, to keep equivalence decidable. Second, GKAT excludes non-local control flow such as goto, break, and return. To overcome these limitations, we introduce Control-Flow GKAT (CF-GKAT), a system that allows reasoning about programs that include non-local control flow as well as hardcoded values. CF-GKAT is able to soundly and completely verify trace equivalence of a larger class of programs, while preserving the nearly-linear efficiency of GKAT. This makes CF-GKAT suitable for the verification of control-flow manipulating procedures, such as decompilation and goto-elimination. To demonstrate CF-GKAT's abilities, we validated the output of several highly non-trivial program transformations, such as Erosa and Hendren's goto-elimination procedure and the output of Ghidra decompiler. CF-GKAT opens up the application of Kleene Algebra to a wider set of challenges, and provides an important verification tool that can be applied to the field of decompilation and control-flow transformation., Comment: Published at POPL 2025

There are strong arguments that quantum mechanics may be nonlinear in its dynamics. A discovery of nonlinearity would hint at a novel understanding of the interplay between gravity and quantum field theory, for example. As such, experiments searching for potential nonlinear effects in the electromagnetic sector are important. Here we outline such an experiment, consisting of a stream of random bits (which were generated using Rigetti's Aspen-M-3 chip) as input to an RF signal generator coupled to a cryogenic detector. Projective measurements of the qubit state, which is originally prepared in an equal superposition, serve as the random binary output of a signal generator. Thereafter, spectral analysis of the RF detector would yield a detectable excess signal predicted to arise from such a nonlinear effect. A comparison between the projective measurements of the quantum bits vs the classical baseline showed no power excess. This sets a new limit on the electromagnetic nonlinearity parameter $|\epsilon| \lessapprox 1.15 \times 10^{-12}$, at a 90.0% confidence level. This is the most stringent limit on nonlinear quantum mechanics thus far and an improvement by nearly a factor of 50 over the previous experimental limit.

Einstein's General Theory of Relativity predicts that accelerating mass distributions produce gravitational radiation, analogous to electromagnetic radiation from accelerating charges. These gravitational waves have not been directly detected to date, but are expected to open a new window to the Universe in the near future. Suitable telescopes are kilometre-scale laser interferometers measuring the distance between quasi free-falling mirrors. Recent advances in quantum metrology may now provide the required sensitivity boost. So-called squeezed light is able to quantum entangle the high-power laser fields in the interferometer arms, and could play a key role in the realization of gravitational wave astronomy., Comment: Review article about the development of squeezed light for gravitational wave detectors

Portable, low-field Magnetic Resonance Imaging (MRI) scanners are increasingly being deployed in clinical settings. However, critical barriers to their widespread use include low signal-to-noise ratio (SNR), generally low image quality, and long scan duration. As these systems can operate in unusual environments, the level and spectral characteristics of the environmental electromagnetic inference (EMI) noise can change substantially across sites and scans, further reducing image quality. Methods for accelerating acquisition and boosting image quality are of critical importance to enable clinically actionable high-quality imaging in these systems. Despite the role that compressed sensing (CS) and artificial intelligence (AI)-based methods have had in improving image quality for high-field MRI, their adoption for low-field imaging is in its infancy, and it is unclear how robust these methods are in low SNR regimes. Here, we investigate and compare leading CS and AI-based methods for image reconstruction from subsampled data and perform a thorough analysis of their performance across a range of SNR values. We compare classical L1-wavelet CS with leading data-driven and model-driven AI methods. Experiments are performed using publicly available datasets and our own low-field and high-field experimental data. Specifically, we apply an unrolled AI network to low-field MRI, and find it outperforms competing reconstruction methods. We prospectively deploy our undersampling methods to accelerate imaging on a 6.5 mT MRI scanner. This work highlights the potential and pitfalls of advanced reconstruction techniques in low-field MRI, paving the way for broader clinical applications.

Recently, breakthroughs in video modeling have allowed for controllable camera trajectories in generated videos. However, these methods cannot be directly applied to user-provided videos that are not generated by a video model. In this paper, we present ReCapture, a method for generating new videos with novel camera trajectories from a single user-provided video. Our method allows us to re-generate the reference video, with all its existing scene motion, from vastly different angles and with cinematic camera motion. Notably, using our method we can also plausibly hallucinate parts of the scene that were not observable in the reference video. Our method works by (1) generating a noisy anchor video with a new camera trajectory using multiview diffusion models or depth-based point cloud rendering and then (2) regenerating the anchor video into a clean and temporally consistent reangled video using our proposed masked video fine-tuning technique., Comment: project page: https://generative-video-camera-controls.github.io/

Astrophysical observations suggest that most of the matter in the cosmos consists of a new form that has not been observed on Earth. The nature and origin of this mysterious dark matter are among the most pressing questions in fundamental science. In this review we summarize the current state of dark matter research from two perspectives. First, we provide an overview of the leading theoretical proposals for dark matter. And second, we describe how these proposals have driven a broad and diverse global search program for dark matter involving direct laboratory searches and astrophysical observations. This review is based on a Green Paper on dark matter prepared as part of the 2020 Astroparticle Community Planning initiative undertaken by the Canadian Subatomic Physics community but has been significantly updated to reflect recent advances., Comment: 40 pages, 15 figures, invited review article accepted for publication in the Canadian Journal of Physics for a special issue on "Particle Astrophysics in Canada," figures from other works reproduced with permission

We present a novel approach for accelerating AI performance by leveraging Anderson extrapolation, a vector-to-vector mapping technique based on a window of historical iterations. By identifying the crossover point where a mixing penalty is incurred, the method focuses on reducing iterations to convergence, with fewer more compute-intensive but generally cacheable iterations, balancing speed and memory usage with accuracy and algorithmic stability, respectively. We demonstrate significant improvements, in both training and inference, motivated by scalability and efficiency extensions to the realm of high-performance computing (HPC)., Comment: 6 pages, 6 figures, 1 table, Accepted by NeurIPS 2024 Workshop MLNCP https://openreview.net/forum?id=wkP2ZFRn9e

We introduce the concept of a generative infinite game, a video game that transcends the traditional boundaries of finite, hard-coded systems by using generative models. Inspired by James P. Carse's distinction between finite and infinite games, we leverage recent advances in generative AI to create Unbounded: a game of character life simulation that is fully encapsulated in generative models. Specifically, Unbounded draws inspiration from sandbox life simulations and allows you to interact with your autonomous virtual character in a virtual world by feeding, playing with and guiding it - with open-ended mechanics generated by an LLM, some of which can be emergent. In order to develop Unbounded, we propose technical innovations in both the LLM and visual generation domains. Specifically, we present: (1) a specialized, distilled large language model (LLM) that dynamically generates game mechanics, narratives, and character interactions in real-time, and (2) a new dynamic regional image prompt Adapter (IP-Adapter) for vision models that ensures consistent yet flexible visual generation of a character across multiple environments. We evaluate our system through both qualitative and quantitative analysis, showing significant improvements in character life simulation, user instruction following, narrative coherence, and visual consistency for both characters and the environments compared to traditional related approaches., Comment: Project page: https://generative-infinite-game.github.io/

This paper explores the performance optimization of out-of-core (OOC) Cholesky factorization on shared-memory systems equipped with multiple GPUs. We employ fine-grained computational tasks to expose concurrency while creating opportunities to overlap data movement asynchronously with computations, especially when dealing with matrices that cannot fit on the GPU memory. We leverage the directed acyclic graph of the task-based Cholesky factorization and map it onto a static scheduler that promotes data reuse while supporting strategies for reducing data movement with the CPU host when the GPU memory is exhausted. The CPU-GPU interconnect may become the main performance bottleneck as the gap between the GPU execution rate and the traditional PCIe bandwidth continues to widen. While the surface-to-volume effect of compute-bound kernels partially mitigates the overhead of data motion, deploying mixed-precision (MxP) computations exacerbates the throughput discrepancy. Using static task scheduling, we evaluate the performance capabilities of the new ultra-fast NVIDIA chip interconnect technology, codenamed NVLink-C2C, that constitutes the backbone of the NVIDIA Grace Hopper Superchip (GH200), against a new four-precision (FP64/FP32/FP16/FP8) left-looking Cholesky factorization. We report the performance results of a benchmarking campaign on various NVIDIA GPU generations and interconnects. We highlight 20% performance superiority against cuSOLVER on a single GH200 with FP64 while hiding the cost of OOC task-based Cholesky factorization, and we scale almost linearly on four GH200 superships. With MxP enabled, our statically scheduled four-precision tile-based Cholesky factorization scores a 3X performance speedup against its FP64-only counterpart, delivering application-worthy FP64 accuracy when modeling a large-scale geospatial statistical application.

Superfast rotators (SFRs) are small solar system objects that rotate faster than generally possible for a cohesionless rubble pile. Their rotational characteristics allow us to make inferences about their interior structure and composition. Here, we present the methods and results from a preliminary search for SFRs in the DECam Ecliptic Exploration Project (DEEP) data set. We find three SFRs from a sample of 686 main-belt asteroids, implying an occurrence rate of 0.4 -0.3/+0.1 percent - a higher incidence rate than has been measured by previous studies. We suggest that this high occurrence rate is due to the small sub-kilometer size regime to which DEEP has access: the objects searched here were as small as 500 m. We compute the minimum required cohesive strength for each of these SFRs and discuss the implications of these strengths in the context of likely evolution mechanisms. We find that all three of these SFRs require strengths that are more than that of weak regolith but consistent with many cohesive asteroid strengths reported in the literature. Across the full DEEP data set, we have identified ~70,000 Main-Belt Asteroids and expect ~300 SFRs - a result that will be assessed in a future paper.

Immunohistochemical (IHC) stains play a vital role in a pathologist's analysis of medical images, providing crucial diagnostic information for various diseases. Virtual staining from hematoxylin and eosin (H&E)-stained whole slide images (WSIs) allows the automatic production of other useful IHC stains without the expensive physical staining process. However, current virtual WSI generation methods based on tile-wise processing often suffer from inconsistencies in content, texture, and color at tile boundaries. These inconsistencies lead to artifacts that compromise image quality and potentially hinder accurate clinical assessment and diagnoses. To address this limitation, we propose a novel consistent WSI synthesis network, CC-WSI-Net, that extends GAN models to produce seamless synthetic whole slide images. Our CC-WSI-Net integrates a content- and color-consistency supervisor, ensuring consistency across tiles and facilitating the generation of seamless synthetic WSIs while ensuring Sox10 immunohistochemistry accuracy in melanocyte detection. We validate our method through extensive image-quality analyses, objective detection assessments, and a subjective survey with pathologists. By generating high-quality synthetic WSIs, our method opens doors for advanced virtual staining techniques with broader applications in research and clinical care.

Discontinuous reception (DRX) is a key technology for reducing the energy consumption of industrial Internet of Things (IIoT) devices. Specifically, DRX allows the devices to operate in a low-power mode when no data reception is scheduled, and its effectiveness depends on the proper configuration of the DRX parameters. In this paper, we characterize the DRX process departing from a semi-Markov chain modeling. We detail two ways to set DRX parameters to minimize the device power consumption while meeting a mean delay constraint. The first method exhaustively searches for the optimal configuration. In contrast, the second method uses a low-complexity metaheuristic to find a sub-optimal configuration, thus considering ideal and practical DRX configurations. Notably, within the DRX parameters, the inactivity timer (IT) is a caution time that specifies how long a device remains active after the last information exchange. Traditionally, a device implementing DRX will restart the IT after each data reception as a precedent to a low-power mode. The usual approach lies in restarting the IT whenever new data is received during this cautious period, which might sometimes needlessly extend the active time. Herein, we propose a more efficient method in which the transmit base station (BS) explicitly indicates restarting the timer through the control channel only when appropriate. The decision is taken based on the BS's knowledge about its buffer status. We consider Poisson and bursty traffic models, which are typical in IIoT setups, and verify the suitability of our proposal for reducing the energy consumption of the devices without significantly compromising the communication latency through extensive numerical simulations. Specifically, energy-saving gains of up to 30% can be obtained regardless of the arrival rate and delay constraints., Comment: IEEE Transactions on Industrial Informatics (2024)

Evaluating the capabilities of Large Language Models (LLMs) to assist teachers and students in educational tasks is receiving increasing attention. In this paper, we assess ChatGPT's capacities to solve and grade real programming exams, from an accredited BSc degree in Computer Science, written in Spanish. Our findings suggest that this AI model is only effective for solving simple coding tasks. Its proficiency in tackling complex problems or evaluating solutions authored by others are far from effective. As part of this research, we also release a new corpus of programming tasks and the corresponding prompts for solving the problems or grading the solutions. This resource can be further exploited by other research teams.

Light, weakly coupled bosonic particles such as axions can mediate long range monopole-dipole interactions between matter and spins. We propose a new experimental method using atom interferometry to detect such a force on a freely falling atom exerted by the spin of electrons. The intrinsic advantages of atom interferometry, such as the freely falling nature of the atom and the well-defined response of the atom to external magnetic fields, should enable the proposed method to overcome systematic effects induced by vibrations, magnetic fields, and gravity. This approach is most suited to probe forces with a range $\gtrsim$~10~cm. With current technology, our proposed setup could potentially extend probes of such forces by an order of magnitude beyond present laboratory limits., Comment: 10 pages, 5 figures

The widespread deployment of products powered by machine learning models is raising concerns around data privacy and information security worldwide. To address this issue, Federated Learning was first proposed as a privacy-preserving alternative to conventional methods that allow multiple learning clients to share model knowledge without disclosing private data. A complementary approach known as Fully Homomorphic Encryption (FHE) is a quantum-safe cryptographic system that enables operations to be performed on encrypted weights. However, implementing mechanisms such as these in practice often comes with significant computational overhead and can expose potential security threats. Novel computing paradigms, such as analog, quantum, and specialized digital hardware, present opportunities for implementing privacy-preserving machine learning systems while enhancing security and mitigating performance loss. This work instantiates these ideas by applying the FHE scheme to a Federated Learning Neural Network architecture that integrates both classical and quantum layers., Comment: 10 pages, 2 figures

Dynamic optimization problems involving discrete decisions have several applications, yet lead to challenging optimization problems that must be addressed efficiently. Combining discrete variables with potentially nonlinear constraints stemming from dynamics within an optimization model results in mathematical programs for which off-the-shelf techniques might be insufficient. This work uses a novel approach, the Logic-based Discrete-Steepest Descent Algorithm (LD-SDA), to solve Discrete Dynamic Optimization problems. The problems are formulated using Boolean variables that enforce differential systems of constraints and encode logic constraints that the optimization problem needs to satisfy. By posing the problem as a generalized disjunctive program with dynamic equations within the disjunctions, the LD-SDA takes advantage of the problem's inherent structure to efficiently explore the combinatorial space of the Boolean variables and selectively include relevant differential equations to mitigate the computational complexity inherent in dynamic optimization scenarios. We rigorously evaluate the LD-SDA with benchmark problems from the literature that include dynamic transitioning modes and find it to outperform traditional methods, i.e., mixed-integer nonlinear and generalized disjunctive programming solvers, in terms of efficiency and capability to handle dynamic scenarios. This work presents a systematic method and provides an open-source software implementation to address these discrete dynamic optimization problems by harnessing the information within its logical-differential structure., Comment: Accepted by 2024 Conference on Decision and Control

Obtaining a controlled invariant set is crucial for safety-critical control with control barrier functions (CBFs) but is non-trivial for complex nonlinear systems and constraints. Backup control barrier functions allow such sets to be constructed online in a computationally tractable manner by examining the evolution (or flow) of the system under a known backup control law. However, for systems with unmodeled disturbances, this flow cannot be directly computed, making the current methods inadequate for assuring safety in these scenarios. To address this gap, we leverage bounds on the nominal and disturbed flow to compute a forward invariant set online by ensuring safety of an expanding norm ball tube centered around the nominal system evolution. We prove that this set results in robust control constraints which guarantee safety of the disturbed system via our Disturbance-Robust Backup Control Barrier Function (DR-BCBF) solution. Additionally, the efficacy of the proposed framework is demonstrated in simulation, applied to a double integrator problem and a rigid body spacecraft rotation problem with rate constraints., Comment: Submitted to IEEE Control Systems Letters (L-CSS) with ACC option. 6 pages, 4 figures

Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a methodology and software framework to evaluate various facets of the performance of gate-based quantum computers on Trotterized quantum Hamiltonian evolution. We propose three distinct modes for benchmarking: (i) comparing simulation on a real device to that on a noiseless classical simulator, (ii) comparing simulation on a real device with exact diagonalization results, and (iii) using scalable mirror circuit techniques to assess hardware performance in scenarios beyond classical simulation methods. We demonstrate this framework on five Hamiltonian models from the HamLib library: the Fermi and Bose-Hubbard models, the transverse field Ising model, the Heisenberg model, and the Max3SAT problem. Experiments were conducted using Qiskit's Aer simulator, BlueQubit's CPU cluster and GPU simulators, and IBM's quantum hardware. Our framework, extendable to other Hamiltonians, provides comprehensive performance profiles that reveal hardware and algorithmic limitations and measure both fidelity and execution times, identifying crossover points where quantum hardware outperforms CPU/GPU simulators., Comment: 24 pages, 17 figures

We describe the new design and current performance of the Mid-InfraRed Spectrometer and Imager (MIRSI) on the NASA Infrared Telescope Facility (IRTF). The system has been converted from a liquid nitrogen/liquid helium cryogen system to one that uses a closed-cycle cooler, which allows it to be kept on the telescope at operating temperature and available for observing on short notice, requiring less effort by the telescope operators and day crew to maintain operating temperature. Several other enhancements have been completed, including new detector readout electronics, an IRTF-style standard instrument user interface, new stepper motor driver electronics, and an optical camera that views the same field as the mid-IR instrument using a cold dichroic mirror, allowing for guiding and/or simultaneous optical imaging. The instrument performance is presented, both with an engineering-grade array used from 2021-2023, and a science-grade array installed in the fall of 2023. Some sample astronomical results are also shown. The upgraded MIRSI is a facility instrument at the IRTF available to all users., Comment: 15 pages, 17 figures, accepted to PASP

The Internet-of-Things (IoT) is rapidly expanding, connecting numerous devices and becoming integral to our daily lives. As this occurs, ensuring efficient traffic management becomes crucial. Effective IoT traffic management requires modeling and predicting intrincate machine-type communication (MTC) dynamics, for which machine-learning (ML) techniques are certainly appealing. However, obtaining comprehensive and high-quality datasets, along with accessible platforms for reproducing ML-based predictions, continues to impede the research progress. In this paper, we aim to fill this gap by characterizing the Smart Campus MTC dataset provided by the University of Oulu. Specifically, we perform a comprehensive statistical analysis of the MTC traffic utilizing goodness-of-fit tests, including well-established tests such as Kolmogorov-Smirnov, Anderson-Darling, chi-squared, and root mean square error. The analysis centers on examining and evaluating three models that accurately represent the two most significant MTC traffic types: periodic updating and event-driven, which are also identified from the dataset. The results demonstrate that the models accurately characterize the traffic patterns. The Poisson point process model exhibits the best fit for event-driven patterns with errors below 11%, while the quasi-periodic model fits accurately the periodic updating traffic with errors below 7%., Comment: SSRN:4655476

We exploit the widening margin in tensor-core performance between [FP64/FP32/FP16/INT8,FP64/FP32/FP16/FP8/INT8] on NVIDIA [Ampere,Hopper] GPUs to boost the performance of output accuracy-preserving mixed-precision computation of Genome-Wide Association Studies (GWAS) of 305K patients from the UK BioBank, the largest-ever GWAS cohort studied for genetic epistasis using a multivariate approach. Tile-centric adaptive-precision linear algebraic techniques motivated by reducing data motion gain enhanced significance with low-precision GPU arithmetic. At the core of Kernel Ridge Regression (KRR) techniques for GWAS lie compute-bound cubic-complexity matrix operations that inhibit scaling to aspirational dimensions of the population, genotypes, and phenotypes. We accelerate KRR matrix generation by redesigning the computation for Euclidean distances to engage INT8 tensor cores while exploiting symmetry.We accelerate solution of the regularized KRR systems by deploying a new four-precision Cholesky-based solver, which, at 1.805 mixed-precision ExaOp/s on a nearly full Alps system, outperforms the state-of-the-art CPU-only REGENIE GWAS software by five orders of magnitude.

The ability to manipulate complex systems, such as the brain, to modify specific outcomes has far-reaching implications, particularly in the treatment of psychiatric disorders. One approach to designing appropriate manipulations is to target key features of predictive models. While generative latent variable models, such as probabilistic principal component analysis (PPCA), is a powerful tool for identifying targets, they struggle incorporating information relevant to low-variance outcomes into the latent space. When stimulation targets are designed on the latent space in such a scenario, the intervention can be suboptimal with minimal efficacy. To address this problem, we develop a novel objective based on supervised variational autoencoders (SVAEs) that enforces such information is represented in the latent space. The novel objective can be used with linear models, such as PPCA, which we refer to as generative principal component regression (gPCR). We show in simulations that gPCR dramatically improves target selection in manipulation as compared to standard PCR and SVAEs. As part of these simulations, we develop a metric for detecting when relevant information is not properly incorporated into the loadings. We then show in two neural datasets related to stress and social behavior in which gPCR dramatically outperforms PCR in predictive performance and that SVAEs exhibit low incorporation of relevant information into the loadings. Overall, this work suggests that our method significantly improves target selection for manipulation using latent variable models over competitor inference schemes.

The Near Infrared Spectrograph (NIRSpec) on the James Webb Space Telescope affords the astronomical community an unprecedented space-based Multi-Object Spectroscopy (MOS) capability through the use of a programmable array of micro-electro-mechanical shutters. Launched in December 2021 and commissioned along with a suite of other observatory instruments throughout the first half of 2022, NIRSpec has been carrying out scientific observations since the completion of commissioning. These observations would not be possible without a rigorous program of engineering operations to actively monitor and maintain NIRSpec's hardware health and safety and enhance instrument efficiency and performance. Although MOS is only one of the observing modes available to users, the complexity and uniqueness of the Micro-Shutter Assembly (MSA) that enables it has presented a variety of engineering challenges, including the appearance of electrical shorts that produce contaminating glow in exposures. Despite these challenges, the NIRSpec Multi-Object Spectrograph continues to perform robustly with no discernible degradation or significant reduction in capability. This paper provides an overview of the NIRSpec micro-shutter subsystem's state of health and operability and presents some of the developments that have taken place in its operation since the completion of instrument commissioning., Comment: SPIE Astronomical Telescopes + Instrumentation: Ground-based and Airborne Instrumentation for Astronomy X (Yokohama 2024), paper number 13092-38

This article reviews recent progress in understanding the physics of many-body localisation (MBL) in disordered and interacting quantum many-body systems, from the perspective of ergodicity breaking on the associated Fock space. This approach to MBL is underpinned by mapping the dynamics of the many-body system onto that of a fictitious single particle on the high-dimensional, correlated and disordered Fock-space graph; yet, as we elaborate, the problem is fundamentally different from that of conventional Anderson localisation on high-dimensional or hierarchical graphs. We discuss in detail the nature of eigenstate correlations on the Fock space, both static and dynamic, and in the ergodic and many-body localised phases as well as in the vicinity of the MBL transition. The latter in turn sheds light on the nature of the transition, and motivates a scaling theory for it in terms of Fock-space based quantities. We also illustrate how these quantities can be concretely connected to real-space observables. An overview is given of several analytical and numerical techniques which have proven important in developing a comprehensive picture. Finally, we comment on some open questions in the field of MBL where the Fock-space approach is likely to prove insightful., Comment: 32 pages, 19 figures, Invited review article for J. Phys.: Condens. Matter

Quantum approximate optimization is one of the promising candidates for useful quantum computation, particularly in the context of finding approximate solutions to Quadratic Unconstrained Binary Optimization (QUBO) problems. However, the existing quantum processing units (QPUs) are relatively small, and canonical mappings of QUBO via the Ising model require one qubit per variable, rendering direct large-scale optimization infeasible. In classical optimization, a general strategy for addressing many large-scale problems is via multilevel/multigrid methods, where the large target problem is iteratively coarsened, and the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentally test how existing QPUs perform as a sub-solver within such a multilevel strategy. We combine and extend (via additional classical processing) the recent Noise-Directed Adaptive Remapping (NDAR) and Quantum Relax $\&$ Round (QRR) algorithms. We first demonstrate the effectiveness of our heuristic extensions on Rigetti's transmon device Ankaa-2. We find approximate solutions to $10$ instances of fully connected $82$-qubit Sherrington-Kirkpatrick graphs with random integer-valued coefficients obtaining normalized approximation ratios (ARs) in the range $\sim 0.98-1.0$, and the same class with real-valued coefficients (ARs $\sim 0.94-1.0$). Then, we implement the extended NDAR and QRR algorithms as subsolvers in the multilevel algorithm for $6$ large-scale graphs with at most $\sim 27,000$ variables. The QPU (with classical post-processing steps) is used to find approximate solutions to dozens of problems, at most $82$-qubit, which are iteratively used to construct the global solution. We observe that quantum optimization results are competitive regarding the quality of solutions compared to classical heuristics used as subsolvers within the multilevel approach., Comment: 7+3 pages; 6+0 figures; 2+0 tables; comments and suggestions are welcome!

We apply the HanleRT Tenerife Inversion Code to the spectro-polarimetric observations obtained by the Chromospheric LAyer SpectroPolarimeter. This suborbital space experiment measured the variation with wavelength of the four Stokes parameters in the near-ultraviolet spectral region of the Mg II h & k lines over a solar disk area containing part of an active region plage and the edge of a sunspot penumbra. We infer the stratification of the temperature, the electron density, the line of-sight velocity, the micro-turbulent velocity, and the longitudinal component of the magnetic field from the observed intensity and circular polarization profiles. The inferred model atmosphere shows larger temperature and electron density in the plage and the superpenumbra regions than in the quiet regions. The shape of the plage region in terms of its brightness is similar to the pattern of the inferred longitudinal component of the magnetic field in the chromosphere, as well as to that of the overlying moss observed by AIA in the 171 A band, which suggests a similar magnetic origin for the heating in both the plage and the moss region. Moreover, this heating is particularly significant in the regions with larger inferred magnetic flux. In contrast, in the superpenumbra, the regions with larger electron density and temperature are usually found in between these regions with larger magnetic flux, suggesting that the details of the heating mechanism in the chromosphere of the superpenumbra may be different to those in the plage, but with the magnetic field still playing a key role., Comment: Accepted for publication in the Astrophysical Journal

We present the design and scalable implementation of an exascale climate emulator for addressing the escalating computational and storage requirements of high-resolution Earth System Model simulations. We utilize the spherical harmonic transform to stochastically model spatio-temporal variations in climate data. This provides tunable spatio-temporal resolution and significantly improves the fidelity and granularity of climate emulation, achieving an ultra-high spatial resolution of 0.034 (approximately 3.5 km) in space. Our emulator, trained on 318 billion hourly temperature data points from a 35-year and 31 billion daily data points from an 83-year global simulation ensemble, generates statistically consistent climate emulations. We extend linear solver software to mixed-precision arithmetic GPUs, applying different precisions within a single solver to adapt to different correlation strengths. The PaRSEC runtime system supports efficient parallel matrix operations by optimizing the dynamic balance between computation, communication, and memory requirements. Our BLAS3-rich code is optimized for systems equipped with four different families and generations of GPUs, scaling well to achieve 0.976 EFlop/s on 9,025 nodes (36,100 AMD MI250X multichip module (MCM) GPUs) of Frontier (nearly full system), 0.739 EFlop/s on 1,936 nodes (7,744 Grace-Hopper Superchips (GH200)) of Alps, 0.243 EFlop/s on 1,024 nodes (4,096 A100 GPUs) of Leonardo, and 0.375 EFlop/s on 3,072 nodes (18,432 V100 GPUs) of Summit.

Traditional one-shot medical image segmentation (MIS) methods use registration networks to propagate labels from a reference atlas or rely on comprehensive sampling strategies to generate synthetic labeled data for training. However, these methods often struggle with registration errors and low-quality synthetic images, leading to poor performance and generalization. To overcome this, we introduce a novel one-shot MIS framework based on knowledge distillation, which allows the network to directly 'see' real images through a distillation process guided by image reconstruction. It focuses on anatomical structures in a single labeled image and a few unlabeled ones. A registration-based data augmentation network creates realistic, labeled samples, while a feature distillation module helps the student network learn segmentation from these samples, guided by the teacher network. During inference, the streamlined student network accurately segments new images. Evaluations on three public datasets (OASIS for T1 brain MRI, BCV for abdomen CT, and VerSe for vertebrae CT) show superior segmentation performance and generalization across different medical image datasets and modalities compared to leading methods. Our code is available at https://github.com/NoviceFodder/OS-MedSeg.

Deriving high quality lightcuves for asteroids and other periodic sources from survey data is challenging due to many factors, including the sparsely sampled observational record and diurnal aliasing which is a signature imparted into the periodic signal of a source that is a function of the observing schedule of ground-based telescopes. In this paper, we examine the utility of combining asteroid observational records from the Zwicky Transient Facility (ZTF) and the Transiting Exoplanet Survey Satellite (TESS) which are the ground- and space-based facilities, respectively, to determine to what degree the data from the space-based facility can suppress diurnal aliases. Furthermore, we examine several optimizations that are used to derive the rotation periods of asteroids which we then compare to the reported rotation periods in the literature. Through this analysis we find that we can reliably derive the rotation periods for ~85% of our sample of 222 objects that are also reported in the literature and that the remaining ~15% are difficult to reliably derive as many are asteroids that are insufficiently elongated which produces a lightcurve with an insufficient amplitude and consequently, an incorrect rotation period. We also investigate a binary classification method that biases against reporting incorrect rotation periods. We conclude the paper by assessing the utility of using other ground- or space-based facilities as companion telescopes to the forthcoming Rubin Observatory., Comment: AJ, in press

We use the Survey of Thermodynamic Processes and First and Second Laws-Long (STPFaSL-Long), a research-based survey instrument with 78 items at the level of introductory physics, to investigate introductory and advanced students' difficulties with entropy and the second law of thermodynamics. We present analysis of data from 12 different introductory and advanced physics classes at four different higher education public institutions in the US in which the survey was administered in-person to more than 1000 students. We find that a widespread unproductive tendency for introductory students to associate the properties of entropy with those of energy leads to many errors based on an idea of "conservation of entropy," in which entropy increases are always balanced by equal entropy decreases. For many of the more advanced students (calculus-based and upper level), we detect a tendency to expect entropy increases even in processes in which the entropy does not change. We observed a widespread failure to correctly apply the relationship {\Delta}S = {\delta}Qreversible/T, either by using it for irreversible processes to which it does not apply, or by applying it incorrectly or completely neglecting it in reversible processes to which it does apply. We also noted that many introductory students are simply not aware that total entropy must increase in any "spontaneous" heat transfer process. Students at all levels were very frequently found to be confused that while net entropy (system + reservoir) in reversible isothermal processes does not change, the entropy of the working substance itself does indeed increase or decrease depending on whether the process is an expansion or compression. Our findings are broadly consistent with prior research findings in this area, expanding upon them and revealing previously unreported aspects of students' thinking., Comment: 21 pages, 4 figures

The advancement of domain reduction techniques has significantly enhanced the performance of solvers in mathematical programming. This paper delves into the impact of integrating convexification and domain reduction techniques within the Outer- Approximation method. We propose a refined convexification-based Outer-Approximation method alongside a Branch-and-Bound method for both convex and nonconvex Mixed-Integer Nonlinear Programming problems. These methods have been developed and incorporated into the open-source Mixed-Integer Nonlinear Decomposition Toolbox for Pyomo-MindtPy. Comprehensive benchmark tests were conducted, validating the effectiveness and reliability of our proposed algorithms. These tests highlight the improvements achieved by incorporating convexification and domain reduction techniques into the Outer-Approximation and Branch-and-Bound methods.

We study plasmonic time crystals, which constitute an extension of the dielectric-based photonic time crystals to plasmonic media. A salient feature of plasmonic time crystals is their ability to support amplification of both longitudinal and transverse modes. In particular, we show that such systems support collective resonances of longitudinal modes, independently of the wave vector $k$. These resonances originate from the interaction between the positive and negative frequency branches of the plasmonic dispersion relation of the unmodulated system, and from the divergence of the density of states near the plasma frequency $\omega_p$. The strongest resonance occurs at a modulation frequency of $\Omega = 2 \omega_p$, associated with a direct inter-band transition. Higher-order resonances are associated with related mechanisms but at lower modulation frequencies. We demonstrate these resonances for various periodic modulation profiles, and also provide a generic perturbative formula for resonance widths in the limit of weak modulation amplitude, in the absence of losses. Our findings offer insights into using time-modulated plasmonic media to enhance optical gain., Comment: main text (7pp, 2 figures) + supplementary material (7pp + 4 figures)

Generalized disjunctive programming (GDP) models with bilinear and concave constraints, often seen in water network design, are challenging optimization problems. This work proposes quadratic and piecewise linear approximations for nonlinear terms to reformulate GDP models into quadratic GDP (QGDP) models that suitable solvers may solve more efficiently. We illustrate the benefits of the quadratic reformulation with a water treatment network design problem in which nonconvexities arise from bilinear terms in the mixers' mass balances and concave investment cost functions of treatment units. Given the similarities with water network design problems, we suggest quadratic approximation for the GDP model for the optimal design of a large-scale reverse electrodialysis (RED) process. This power technology can recover energy from salinity differences between by-product streams of the water sector, such as desalination brine mixed with regenerated wastewater effluents. The solver Gurobi excels in handling QGDP problems, but weighing the problem's precision and tractability balance is crucial. The piecewise linear approximation yields more accurate, yet larger QGDP models that may require longer optimization times in large-scale process synthesis problems., Comment: 7 pages, Proceedings of the 34th European Symposium on Computer Aided Process Engineering / 15th International Symposium on Process Systems Engineering (ESCAPE34/PSE24), June 2-6, 2024, Florence, Italy

The UKIRT Hemisphere Survey covers the northern sky in the infrared from 0-60 degrees declination. Current data releases include both J and K bands, with H-band data forthcoming. Here we present a novel pipeline to recover asteroids from this survey data. We recover 26,138 reliable observations, corresponding to 23,399 unique asteroids, from these public data. We measure J-K colors for 601 asteroids. Our survey extends about two magnitudes deeper than 2MASS. We find that our small inner main belt objects are less red than larger inner belt objects, perhaps because smaller asteroids are collisionally younger, with surfaces that have been less affected by space weathering. In the middle and outer main belt, we find our small asteroids to be redder than larger objects in their same orbits, possibly due to observational bias or a disproportionate population of very red objects among these smaller asteroids. Future work on this project includes extracting moving object measurements from H and Y band data when it becomes available., Comment: 15 pages, 10 figures

Search engines have traditionally served as primary tools for information seeking. However, the new Large Language Models (LLMs) have recently demonstrated remarkable capabilities in multiple tasks and, specifically, their adoption as question answering systems is becoming increasingly prevalent. It is expected that LLM-based conversational systems and traditional web engines will continue to coexist in the future, supporting end users in various ways. But there is a need for more scientific research on the effectiveness of both types of systems in facilitating accurate information seeking. In this study, we focus on their merits in answering health questions. We conducted an extensive study comparing different web search engines, LLMs and retrieval-augmented (RAG) approaches. Our research reveals intriguing conclusions. For example, we observed that the quality of webpages potentially responding to a health question does not decline as we navigate further down the ranked lists. However, according to our evaluation, web engines are less accurate than LLMs in finding correct answers to health questions. On the other hand, LLMs are quite sensitive to the input prompts, and we also found out that RAG leads to highly effective information seeking methods.

Dual pairs of interior and exterior Hardy spaces associated to a simple closed Lipschitz planar curve are considered, leading to a M\"obius invariant function bounding the norm of the Cauchy transform $\bf{C}$ from below. This function is shown to satisfy strong rigidity properties and is closely connected via the Berezin transform to the square of the Kerzman-Stein operator. Explicit example calculations are presented. For ellipses, a new asymptotically sharp lower bound on the norm of $\bf{C}$ is produced., Comment: 28 pages, 3 figures

Man\v{c}inska and Roberson~[FOCS'20] showed that two graphs are quantum isomorphic if and only if they are homomorphism indistinguishable over the class of planar graphs. Atserias et al.~[JCTB'19] proved that quantum isomorphism is undecidable in general. The NPA hierarchy gives a sequence of semidefinite programming relaxations of quantum isomorphism. Recently, Roberson and Seppelt~[ICALP'23] obtained a homomorphism indistinguishability characterization of the feasibility of each level of the Lasserre hierarchy of semidefinite programming relaxations of graph isomorphism. We prove a quantum analogue of this result by showing that each level of the NPA hierarchy of SDP relaxations for quantum isomorphism of graphs is equivalent to homomorphism indistinguishability over an appropriate class of planar graphs. By combining the convergence of the NPA hierarchy with the fact that the union of these graph classes is the set of all planar graphs, we are able to give a new proof of the result of Man\v{c}inska and Roberson~[FOCS'20] that avoids the use of the theory of quantum groups. This homomorphism indistinguishability characterization also allows us to give a randomized polynomial-time algorithm deciding exact feasibility of each fixed level of the NPA hierarchy of SDP relaxations for quantum isomorphism., Comment: 34 Pages, 5 Figures

Variational Quantum Eigensolvers (VQEs) represent a promising approach to computing molecular ground states and energies on modern quantum computers. These approaches use a classical computer to optimize the parameters of a trial wave function, while the quantum computer simulates the energy by preparing and measuring a set of bitstring observations, referred to as shots, over which an expected value is computed. Although more shots improve the accuracy of the expected ground state, it also increases the simulation cost. Hence, we propose modifications to the standard Bayesian optimization algorithm to leverage few-shot circuit observations to solve VQEs with fewer quantum resources. We demonstrate the effectiveness of our proposed approach, Bayesian optimization with priors on surface topology (BOPT), by comparing optimizers for molecular systems and demonstrate how current quantum hardware can aid in finding ground state energies., Comment: 28 pages, 9 figures

Dark matter may exist today in the form of ultraheavy composite bound states. Collisions between such dark matter states can release intense bursts of radiation that includes gamma-rays among the final products. Thus, indirect-detection signals of dark matter may include unconventional gamma-ray bursts. Such bursts may have been missed not necessarily because of their low arriving gamma-ray fluxes, but rather their briefness and rareness. We point out that intense bursts whose non-detection thus far are due to the latter can be detected in the near future with existing and planned facilities. In particular, we propose that, with slight experimental adjustments and suitable data analyses, imaging atmospheric Cherenkov telescopes (IACTs) and Pulsed All-sky Near-infrared and Optical Search for Extra-Terrestrial Intelligence (PANOSETI) are promising tools for detecting such rare, brief, but intense bursts. We also show that if we assume these bursts originate from collisions of dark matter states, IACTs and PANOSETI can probe a large dark matter parameter space beyond existing limits. Additionally, we present a concrete model of dark matter that produces bursts potentially detectable in these instruments.

Industrial Internet of Things (IIoT) applications involve real-time monitoring, detection, and data analysis. This is challenged by the intermittent activity of IIoT devices (IIoTDs) and their limited battery capacity. Indeed, the former issue makes resource scheduling and random access difficult, while the latter constrains IIoTDs' lifetime and efficient operation. In this paper, we address interconnected aspects of these issues. Specifically, we focus on extending the battery life of IIoTDs sensing events/alarms by minimizing the number of unnecessary transmissions. Note that when multiple devices access the channel simultaneously, there are collisions, potentially leading to retransmissions, thus reducing energy efficiency. We propose a threshold-based transmission-decision policy based on the sensing quality and the network spatial deployment. We optimize the transmission thresholds using several approaches such as successive convex approximation, block coordinate descent methods, Voronoi diagrams, explainable machine learning, and algorithms based on natural selection and social behavior. Besides, we propose a new approach that reformulates the optimization problem as a $Q$-learning solution to promote adaptability to system dynamics. Through numerical evaluation, we demonstrate significant performance enhancements in complex IIoT environments, thus validating the practicality and effectiveness of the proposed solutions. We show that Q-learning performs the best, while the block coordinate descending method incurs the worst performance. Additionally, we compare the proposed methods with a benchmark assigning the same threshold to all the devices for transmission decision. Compared to the benchmark, up to 94\% and 60\% reduction in power consumption are achieved in low-density and high-density scenarios, respectively.

We present Magic Insert, a method for dragging-and-dropping subjects from a user-provided image into a target image of a different style in a physically plausible manner while matching the style of the target image. This work formalizes the problem of style-aware drag-and-drop and presents a method for tackling it by addressing two sub-problems: style-aware personalization and realistic object insertion in stylized images. For style-aware personalization, our method first fine-tunes a pretrained text-to-image diffusion model using LoRA and learned text tokens on the subject image, and then infuses it with a CLIP representation of the target style. For object insertion, we use Bootstrapped Domain Adaption to adapt a domain-specific photorealistic object insertion model to the domain of diverse artistic styles. Overall, the method significantly outperforms traditional approaches such as inpainting. Finally, we present a dataset, SubjectPlop, to facilitate evaluation and future progress in this area. Project page: https://magicinsert.github.io/, Comment: Project page: https://magicinsert.github.io/