Search

Spectral densities encode non-perturbative information crucial in computing physical observables in strongly coupled field theories. Using lattice gauge theory data, we perform a systematic study to demonstrate the potential of recent technological advances in the reconstruction of spectral densities. We develop, maintain and make publicly available dedicated analysis code that can be used for broad classes of lattice theories. As a test case, we analyse the Sp(4) gauge theory coupled to an admixture of fermions transforming in the fundamental and two-index antisymmetric representations. We measure the masses of mesons in energy-smeared spectral densities, after optimising the smearing parameters for available lattice ensembles. We present a summary of the mesons mass spectrum in all the twelve (flavored) channels available, including also several excited states., Comment: 9 pages, 5 figures, contribution for the 41th International Symposium on Lattice Field Theory (Lattice 2024), 28 July - 3 August 2024, Liverpool, UK, presenting the results of the paper: arXiv:2405.01388

Kinetic plasma simulations solve the Vlasov-Poisson or Vlasov-Maxwell equations to evolve scalar-variable distribution functions in position-velocity phase space and vector-variable electromagnetic fields in physical space. The computational cost of evolving high-dimensional variables often limits the utility of continuum kinetic simulations and presents a challenge when it comes to accurately simulating real-world physical phenomena. To address this challenge, we developed techniques that accelerate and minimize the computational work required for a scalable Vlasov-Poisson solver. We present theoretical hardware compute and communication bounds required for solving a fourth-order finite-volume Vlasov-Poisson system. These bounds are then used to inform and evaluate the design of performance portable algorithms for a multiple graphics processing unit (GPU) accelerated version of the Vlasov-Poisson solver VCK-CPU. We demonstrate that the multi-GPU Vlasov solver implementation VCK-GPU simultaneously minimizes required inter-process data transfer while also being bounded by the machine network performance limits, leaving minimal room for theoretical performance improvements. This resulted in an overall strong scaling speedup per timestep of up to 40x in three-dimensional phase space (one position, two velocity coordinates) and 54x in four dimensional phase space (two position, two velocity coordinates) and a 341x increase in simulation throughput of the GPU accelerated code over the existing CPU code. The GPU code is also able to weak scale up to 256 compute nodes and 1024 GPUs. We then demonstrate how the improved compute performance can be used to explore configurations which were previously computationally infeasible such as resolving fine-scale distribution function filamentation and multi-species dynamics with realistic electron-proton mass ratios., Comment: 25 pages, 18 figures

This paper aims to offer AI & Law researchers and practitioners a more detailed understanding of whether and how continued pre-training and instruction fine-tuning (IFT) of large language models (LLMs) on legal corpora increases their utilization of human-defined legal concepts when developing global contextual representations of input sequences. We compared three models: Mistral 7B, SaulLM-7B-Base (Mistral 7B with continued pre-training on legal corpora), and SaulLM-7B-Instruct (with further IFT). This preliminary assessment examined 7 distinct text sequences from recent AI & Law literature, each containing a human-defined legal concept. We first compared the proportions of total attention the models allocated to subsets of tokens representing the legal concepts. We then visualized patterns of raw attention score alterations, evaluating whether legal training introduced novel attention patterns corresponding to structures of human legal knowledge. This inquiry revealed that (1) the impact of legal training was unevenly distributed across the various human-defined legal concepts, and (2) the contextual representations of legal knowledge learned during legal training did not coincide with structures of human-defined legal concepts. We conclude with suggestions for further investigation into the dynamics of legal LLM training.

Mixture of Experts (MoE) models are highly effective in scaling model capacity while preserving computational efficiency, with the gating network, or router, playing a central role by directing inputs to the appropriate experts. In this paper, we establish a novel connection between MoE frameworks and attention mechanisms, demonstrating how quadratic gating can serve as a more expressive and efficient alternative. Motivated by this insight, we explore the implementation of quadratic gating within MoE models, identifying a connection between the self-attention mechanism and the quadratic gating. We conduct a comprehensive theoretical analysis of the quadratic softmax gating MoE framework, showing improved sample efficiency in expert and parameter estimation. Our analysis provides key insights into optimal designs for quadratic gating and expert functions, further elucidating the principles behind widely used attention mechanisms. Through extensive evaluations, we demonstrate that the quadratic gating MoE outperforms the traditional linear gating MoE. Moreover, our theoretical insights have guided the development of a novel attention mechanism, which we validated through extensive experiments. The results demonstrate its favorable performance over conventional models across various tasks., Comment: Pedram Akbarian, Huy Nguyen, and Xing Han made equal contributions to this work

For over 25 years, the origin of long-duration gamma-ray bursts (lGRBs) has been linked to the collapse of rotating massive stars. However, we have yet to pinpoint the stellar progenitor powering these transients. Moreover, the dominant engine powering the explosions remains open to debate. Observations of both lGRBs, supernovae associated with these GRBs, such as broad-line (BL) stripped-envelope (type Ic) supernovae (hereafter, Ic-BL) supernovae (SNe) and perhaps superluminous SNe, fast blue optical transients, and fast x-ray transients, may provide clues to both engines and progenitors. In this paper, we conduct a detailed study of the tight-binary formation scenario for lGRBs, comparing this scenario to other leading progenitor models. Combining this progenitor scenario with different lGRB engines, we can compare to existing data and make predictions for future observational tests. We find that the combination of the tight-binary progenitor scenario with the black hole accretion disk (BHAD) engine can explain lGRBs, low-luminosity GRBs, ultra-long GRBs, and Ic-BL. We discuss the various progenitor properties required for these different subclasses and note such systems would be future gravitational wave merger sources. We show that the current literature on other progenitor-engine scenarios cannot explain all of these transient classes with a single origin, motivating additional work. We find that the tight-binary progenitor with a magnetar engine is excluded by existing observations. The observations can be used to constrain the properties of stellar evolution, the nature of the GRB and the associated SN engines in lGRBs and Ic-BL. We discuss the future observations needed to constrain our understanding of these rare, but powerful, explosions., Comment: 20 pages, 10 figures, submitted to ApJ

The quantum Josephson voltage standard is well established across the metrology community for many years. It relies on the synchronisation of the flux tunneling in the S/I/S Josepson junctions (JJ) with the microwave radiation (MW). The phenomenon is called the Shapiro steps. Together with the Quantum Hall resistance standard, the voltage standard forms the foundation of electrostatic metrology. The current is then defined as the ratio of the voltage and resistance. Realisation of the quantum current standard, would close the electrostatic metrological triangle of voltage-resistance-current. The current quantisation, the inverse Shapiro steps, was recently shown using the superconducting nanowires and small JJ. The effect is a synchronization of the MW with the Cooper pair tunnelling. This paves the way to combine the JJ voltage and current standards on the same chip and demonstrate feasibility of the multi-standard operation. We show the voltage and current quantization on the same chip up to frequency of 10 GHz, corresponding to the amplitudes 0.021 mV and 3.23 nA respectively. The accuracy of the voltage and current quantisation, however, is relatively low, 35 ppk and 100 ppk respectively. We discuss measures to optimise the JJs, circuit and environment to boost the amplitude and accuracy of the standards., Comment: 5 figures, 5 pages, published in APL

In this paper, we propose an asymptotic expansion conjecture for the partition functions in Teichm\"uller TQFT; we then prove this conjecture for all FAMED geometric triangulations of hyperbolic knot complements, where FAMED means that the triangulation satisfies certain combinatorial properties. Our conjecture predicts that (1) the invariant decays exponentially with decrease rate the hyperbolic volume of a cone structure determined by the prescribed angle structure and (2) the 1-loop invariant, which conjecturally is the same as the adjoint twisted Reidemeister torsion, shows up as the 1-loop term in the asymptotic expansion formula. Based on this, we connect our volume conjecture with the Casson conjecture on angle structures by relating the exponential decay rate of the invariant to the volume functional defined on certain subspace of angle structures of ideal triangulations. Furthermore, for FAMED triangulations, we prove the existence of the Jones functions in Teichm\"uller TQFT, which is expected to be an analogue of the Kashaev invariant of the knot when the manifold is a knot complement in $S^3$. Then, for FAMED geometric triangulations, we obtain an asymptotic expansion formula for the Jones function, which generalizes the Andersen-Kashaev volume conjecture in \cite{AK}. We also provide a simple argument to relate the asymptotic expansion formula of the Jones function with a weaker version of the AJ conjecture for the Teichm\"uller TQFT. Finally, we prove that the geometric ideal triangulations of hyperbolic twist knot complements constructed in \cite{BAGPN} are FAMED, which implies that these triangulations of twist knot complements satisfy all the previously mentioned results., Comment: 45 pages, 5 figures, comments welcome!

We construct a Grassmann tensor network representing the partition function of (1+1)-dimensional two-color QCD with staggered fermions. The Grassmann path integral is rewritten as the trace of a Grassmann tensor network by introducing two-component auxiliary Grassmann fields on every edge of the lattice. We introduce an efficient initial tensor compression scheme to reduce the size of initial tensors. The Grassmann bond-weighted tensor renormalization group approach is adopted to evaluate the quark number density, fermion condensate, and diquark condensate at different gauge couplings as a function of the chemical potential. Different transition behavior is observed as the quark mass is varied. We discuss the efficiency of our initial tensor compression scheme and the future application toward the corresponding higher-dimensional models.

Energy-efficient software helps improve mobile device experiences and reduce the carbon footprint of data centers. However, energy goals are often de-prioritized in order to meet other requirements. We take inspiration from recent work exploring the use of large language models (LLMs) for different software engineering activities. We propose a novel application of LLMs: as code optimizers for energy efficiency. We describe and evaluate a prototype, finding that over 6 small programs our system can improve energy efficiency in 3 of them, up to 2x better than compiler optimizations alone. From our experience, we identify some of the challenges of energy-efficient LLM code optimization and propose a research agenda.

The magnetar SGR 1935+2154 is the only known Galactic source of fast radio bursts (FRBs). FRBs from SGR 1935+2154 were first detected by CHIME/FRB and STARE2 in 2020 April, after the conclusion of the LIGO, Virgo, and KAGRA Collaborations' O3 observing run. Here we analyze four periods of gravitational wave (GW) data from the GEO600 detector coincident with four periods of FRB activity detected by CHIME/FRB, as well as X-ray glitches and X-ray bursts detected by NICER and NuSTAR close to the time of one of the FRBs. We do not detect any significant GW emission from any of the events. Instead, using a short-duration GW search (for bursts $\leq$ 1 s) we derive 50\% (90\%) upper limits of $10^{48}$ ($10^{49}$) erg for GWs at 300 Hz and $10^{49}$ ($10^{50}$) erg at 2 kHz, and constrain the GW-to-radio energy ratio to $\leq 10^{14} - 10^{16}$. We also derive upper limits from a long-duration search for bursts with durations between 1 and 10 s. These represent the strictest upper limits on concurrent GW emission from FRBs., Comment: 15 pages of text including references, 4 figures, 5 tables

Hallucinations in Large Language Models (LLMs) remain a major obstacle, particularly in high-stakes applications where factual accuracy is critical. While representation editing and reading methods have made strides in reducing hallucinations, their heavy reliance on specialised tools and training on in-domain samples, makes them difficult to scale and prone to overfitting. This limits their accuracy gains and generalizability to diverse datasets. This paper presents a lightweight method, Norm Voting (NoVo), which harnesses the untapped potential of attention head norms to dramatically enhance factual accuracy in zero-shot multiple-choice questions (MCQs). NoVo begins by automatically selecting truth-correlated head norms with an efficient, inference-only algorithm using only 30 random samples, allowing NoVo to effortlessly scale to diverse datasets. Afterwards, selected head norms are employed in a simple voting algorithm, which yields significant gains in prediction accuracy. On TruthfulQA MC1, NoVo surpasses the current state-of-the-art and all previous methods by an astounding margin -- at least 19 accuracy points. NoVo demonstrates exceptional generalization to 20 diverse datasets, with significant gains in over 90\% of them, far exceeding all current representation editing and reading methods. NoVo also reveals promising gains to finetuning strategies and building textual adversarial defence. NoVo's effectiveness with head norms opens new frontiers in LLM interpretability, robustness and reliability.

Missing values are a common problem that poses significant challenges to data analysis and machine learning. This problem necessitates the development of an effective imputation method to fill in the missing values accurately, thereby enhancing the overall quality and utility of the datasets. Existing imputation methods, however, fall short of explicitly considering the `missingness' information in the data during the embedding initialization stage and modeling the entangled feature and sample correlations during the learning process, thus leading to inferior performance. We propose M$^3$-Impute, which aims to explicitly leverage the missingness information and such correlations with novel masking schemes. M$^3$-Impute first models the data as a bipartite graph and uses a graph neural network to learn node embeddings, where the refined embedding initialization process directly incorporates the missingness information. They are then optimized through M$^3$-Impute's novel feature correlation unit (FRU) and sample correlation unit (SRU) that effectively captures feature and sample correlations for imputation. Experiment results on 25 benchmark datasets under three different missingness settings show the effectiveness of M$^3$-Impute by achieving 20 best and 4 second-best MAE scores on average.

In the Taiwanese judicial system, Cause of Actions (COAs) are essential for identifying relevant legal judgments. However, the lack of standardized COA labeling creates challenges in filtering cases using basic methods. This research addresses this issue by leveraging embedding and clustering techniques to analyze the similarity between COAs based on cited legal articles. The study implements various similarity measures, including Dice coefficient and Pearson's correlation coefficient. An ensemble model combines rankings, and social network analysis identifies clusters of related COAs. This approach enhances legal analysis by revealing inconspicuous connections between COAs, offering potential applications in legal research beyond civil law., Comment: 10 pages, 4 figures, 3 tables(including appendix)

We investigate the physical properties and redshift evolution of simulated galaxies residing in protoclusters at cosmic noon, to understand the influence of the environment on galaxy formation. This work is to build clear expectations for the ongoing ODIN survey, devoted to mapping large-scale structures at z=2.4, 3.1, and 4.5 using Ly$\alpha$-emitting galaxies (LAEs) as tracers. From the IllustrisTNG simulations, we define subregions centered on the most massive clusters ranked by total stellar mass at z=0 and study the properties of galaxies within, including LAEs. To model the LAE population, we take a semi-analytical approach that assigns Ly$\alpha$ luminosity and equivalent width based on the UV luminosities to galaxies in a probabilistic manner. We investigate stellar mass, star formation rate, major mergers, and specific star formation rate of the population of star-forming galaxies and LAEs in the field and protocluster environment and trace their evolution. We find that the overall shape of the UV luminosity function (LF) in simulated protocluster environments is characterized by a shallower faint-end slope and an excess on the bright end, signaling different formation histories for galaxies therein. The difference is milder for the Ly$\alpha$ LF. While protocluster galaxies follow the same SFR-$M_{\odot}$ scaling relation as average field galaxies, a larger fraction appears to have experienced major mergers in the last 200 Myr and as a result shows enhanced star formation at a ~60% level, leading to a flatter distribution in both SFR and $M_{\odot}$ relative to galaxies in the average field. We find that protocluster galaxies, including LAEs, begin to quench much earlier (z~0.8-1.6) than field galaxies (z~0.5-0.9); our result is in agreement with recent observational results and highlights the importance of large-scale environment on the overall formation history of galaxies., Comment: 18 pages, 13 figures, to be submitted to Astronomy & Astrophysics, the abstract was reduced to meet character requirements; edits include: updating coauthor list and affiliations, updating citations in Sec 2.1

Discoveries of fundamental limits for the rates of physical processes, from the speed of light to the Lieb-Robinson bound for information propagation, are conceptual breakthroughs that often challenge our understanding of the underlying physics. Here we observe such a limit for a paradigmatic many-body phenomenon, the spreading of coherence during formation of a weakly interacting Bose-Einstein condensate. We study condensate formation in an isolated homogeneous atomic gas that is initially far from equilibrium, in an incoherent low-energy state, and condenses as it relaxes towards equilibrium. Tuning the inter-atomic interactions that drive condensation, we show that the spreading of coherence through the system is initially slower for weaker interactions, and faster for stronger ones, but always eventually reaches the same limit, where the square of the coherence length grows at a universal rate given by the ratio of Planck's constant and the particle mass. These observations are robust to changes in the initial state, the gas density, and the system size. Our results provide benchmarks for theories of universality far from equilibrium, are relevant for quantum technologies that rely on large-scale coherence, and invite similar measurements in other quantum systems., Comment: Main text: 5 pages, 4 figures. Methods: 3 pages, 5 figures

We explore a robust version of the barycenter problem among $n$ centered Gaussian probability measures, termed Semi-Unbalanced Optimal Transport (SUOT)-based Barycenter, wherein the barycenter remains fixed while the others are relaxed using Kullback-Leibler divergence. We develop optimization algorithms on Bures-Wasserstein manifold, named the Exact Geodesic Gradient Descent and Hybrid Gradient Descent algorithms. While the Exact Geodesic Gradient Descent method is based on computing the exact closed form of the first-order derivative of the objective function of the barycenter along a geodesic on the Bures manifold, the Hybrid Gradient Descent method utilizes optimizer components when solving the SUOT problem to replace outlier measures before applying the Riemannian Gradient Descent. We establish the theoretical convergence guarantees for both methods and demonstrate that the Exact Geodesic Gradient Descent algorithm attains a dimension-free convergence rate. Finally, we conduct experiments to compare the normal Wasserstein Barycenter with ours and perform an ablation study., Comment: Ngoc-Hai Nguyen and Dung Le contributed equally to this work. 44 pages, 5 figures

Lean Methodology for Garment Modernization. This article presents the lean methodology for modernizing garment manufacturing, focusing on lean thinking, lean practices, automation development, VSM, and CRP, and how to integrate them effectively. While isolated automation of specific operations can improve efficiency and reduce cycle time, it does not necessarily enhance overall garment output and efficiency. To achieve these broader improvements, it is essential to consider the entire production line and process using VSM and CRP to optimize production and center balance. This approach can increase efficiency, and reduce manufacturing costs, labor time, and lead time, ultimately adding value to the company and factory., Comment: 11 pages,7 Figures

This paper proposes a safety modulator actor-critic (SMAC) method to address safety constraint and overestimation mitigation in model-free safe reinforcement learning (RL). A safety modulator is developed to satisfy safety constraints by modulating actions, allowing the policy to ignore safety constraint and focus on maximizing reward. Additionally, a distributional critic with a theoretical update rule for SMAC is proposed to mitigate the overestimation of Q-values with safety constraints. Both simulation and real-world scenarios experiments on Unmanned Aerial Vehicles (UAVs) hovering confirm that the SMAC can effectively maintain safety constraints and outperform mainstream baseline algorithms.

Type-C quasi-periodic oscillations (QPOs) in black hole X-ray transients typically manifest in the low-hard and hard-intermediate states. This study presents a detailed spectral and temporal analysis of the black hole candidate Swift J1727.8-1613 using NICER observations from August and September 2023, with a focus on the first flare period. The time-averaged spectra, along with the rms and phase-lag spectra of the QPOs, were jointly fitted using the time-dependent Comptonization model \text{vkompthdk} to examine the geometry of the corona during this flare. The results provide a comprehensive view of the QPO, where we detected type-C QPOs with a centroid frequency increasing from 0.32 Hz to 2.63 Hz, while it elevated when it entered the flare state, and its energy spectral properties as they evolved during the first flare period. Correlations between spectral and temporal properties suggest that type-C QPOs are primarily modulated by Lense-Thirring precession. Based on simultaneous radio observations indicating discrete jet ejections, we propose, for the first time, a scenario where the temporarily extended corona contracts vertically from approximately 2714 km to less than 900 km, overlying the inner accretion disc, with a transient jet seemingly being launched. The corona then recovers to nearly 2000 km by the end of the first flare period of Swift J1727.8-1613, rather than undergoing horizontal changes. A phenomenological analysis of the corona scenario during this flare period was also conducted., Comment: 16 pages, 6 figures, 3 tables, Submitted to ApJ

In this work, we present MedImageInsight, an open-source medical imaging embedding model. MedImageInsight is trained on medical images with associated text and labels across a diverse collection of domains, including X-Ray, CT, MRI, dermoscopy, OCT, fundus photography, ultrasound, histopathology, and mammography. Rigorous evaluations demonstrate MedImageInsight's ability to achieve state-of-the-art (SOTA) or human expert level performance across classification, image-image search, and fine-tuning tasks. Specifically, on public datasets, MedImageInsight achieves SOTA in CT 3D medical image retrieval, as well as SOTA in disease classification and search for chest X-ray, dermatology, and OCT imaging. Furthermore, MedImageInsight achieves human expert performance in bone age estimation (on both public and partner data), as well as AUC above 0.9 in most other domains. When paired with a text decoder, MedImageInsight achieves near SOTA level single image report findings generation with less than 10\% the parameters of other models. Compared to fine-tuning GPT-4o with only MIMIC-CXR data for the same task, MedImageInsight outperforms in clinical metrics, but underperforms on lexical metrics where GPT-4o sets a new SOTA. Importantly for regulatory purposes, MedImageInsight can generate ROC curves, adjust sensitivity and specificity based on clinical need, and provide evidence-based decision support through image-image search (which can also enable retrieval augmented generation). In an independent clinical evaluation of image-image search in chest X-ray, MedImageInsight outperformed every other publicly available foundation model evaluated by large margins (over 6 points AUC), and significantly outperformed other models in terms of AI fairness (across age and gender). We hope releasing MedImageInsight will help enhance collective progress in medical imaging AI research and development.

ThMn12-type (Sm,Zr)1(Fe,Co,Ti)12 compounds show great potential for permanent magnets. Magnetically hard anisotropic powders prepared via reduction-diffusion exhibit a significant increase in coercivity from 0.45 T to 1.26 T as the processing temperature is raised from 990{\deg}C to 1220{\deg}C. Structural and microchemical analyses at high-resolution reveal that high-temperature processing annihilates grain boundaries (GBs) and reduces the density of twin boundaries (TBs), which are defects acting as weak links limiting the coercivity in the 1:12 system. Ostwald ripening is proposed as the mechanism behind the reduction of GB and TB densities at higher temperature, driven by the reduction in interfacial energy and enhancing atomic structural uniformity.

Autonomous vehicles have been rapidly developed as demand that provides safety and efficiency in transportation systems. As autonomous vehicles are designed based on open-source operating and computing systems, there are numerous resources aimed at building an operating platform composed of Ubuntu, Autoware, and Robot Operating System (ROS). However, no explicit guidelines exist to help scholars perform trouble-shooting due to incompatibility between the Autoware platform and Ubuntu operating systems installed in autonomous driving systems-equipped vehicles (i.e., Chrysler Pacifica). The paper presents an overview of integrating the Autoware platform into the autonomous vehicle's interface based on lessons learned from trouble-shooting processes for resolving incompatible issues. The trouble-shooting processes are presented based on resolving the incompatibility and integration issues of Ubuntu 20.04, Autoware.AI, and ROS Noetic software installed in an autonomous driving systems-equipped vehicle. Specifically, the paper focused on common incompatibility issues and code-solving protocols involving Python compatibility, Compute Unified Device Architecture (CUDA) installation, Autoware installation, and simulation in Autoware.AI. The objective of the paper is to provide an explicit and detail-oriented presentation to showcase how to address incompatibility issues among an autonomous vehicle's operating interference. The lessons and experience presented in the paper will be useful for researchers who encountered similar issues and could follow up by performing trouble-shooting activities and implementing ADS-related projects in the Ubuntu, Autoware, and ROS operating systems.

In this paper, we showed that for suitable $(\beta,p, s,\ell)$ the $\beta$-order fractional derivative with respect to the last coordinate of the Fourier transform of an $L^p(\mathbb{R}^n)$ function is in $H^{-s}$ after restricting to a graph of a function with non-vanishing Gaussian curvature provided that the restriction of the Fourier transform of such function to the surface is in $H^{\ell}$. This is a generalization of the result in \cite{GoldStol}*{Theorem 1.12}., Comment: Fixed the description of Figure 3 and 4

This research exploits the applications of reconfigurable intelligent surface (RIS)-assisted multiple input multiple output (MIMO) systems, specifically addressing the enhancement of communication reliability with modulated signals. Specifically, we first derive the analytical downlink symbol error rate (SER) of each user as a multivariate function of both the phase-shift and beamforming vectors. The analytical SER enables us to obtain insights into the synergistic dynamics between the RIS and MIMO communication. We then introduce a novel average SER minimization problem subject to the practical constraints of the transmitted power budget and phase shift coefficients, which is NP-hard. By incorporating the differential evolution (DE) algorithm as a pivotal tool for optimizing the intricate active and passive beamforming variables in RIS-assisted communication systems, the non-convexity of the considered SER optimization problem can be effectively handled. Furthermore, an efficient local search is incorporated into the DE algorithm to overcome the local optimum, and hence offer low SER and high communication reliability. Monte Carlo simulations validate the analytical results and the proposed optimization framework, indicating that the joint active and passive beamforming design is superior to the other benchmarks., Comment: 16 pages, 13 figures, and 1 table . Accepted by TWC

In the context of Monte Carlo sampling for lattice models, the complexity of the energy landscape often leads to Markov chains being trapped in local optima, thereby increasing the correlation between samples and reducing sampling efficiency. This study proposes a Monte Carlo algorithm that effectively addresses the irregularities of the energy landscape through the introduction of the estimated density of states. This algorithm enhances the accuracy in the study of phase transitions and is not model-specific. Although our algorithm is primarily demonstrated on the two-dimensional square lattice model, the method is also applicable to a broader range of lattice and higher-dimensional models. Furthermore, the study develops a method for estimating the density of states of large systems based on that of smaller systems, enabling high-precision density of states estimation within specific energy intervals in large systems without sampling. For regions of lower precision, a re-weighting strategy is employed to adjust the density of states to enhance the precision further. This algorithm is not only significant within the field of lattice model sampling but may also inspire applications of the Monte Carlo method in other domains., Comment: 14 pages, 9 figures

In the early 1970s, Andrew Ogg made several conjectures about the rational torsion points of elliptic curves over $\mathbb{Q}$ and the Jacobians of modular curves. These conjectures were proved shortly after by Barry Mazur as a consequence of his fundamental study of the arithmetic properties of modular curves and Hecke algebras. In this paper, we review the function field analogues of Ogg's conjectures, their current status, and the methods that have been applied to prove some of these conjectures. The methods are based on the ideas of Mazur and Ogg, but there are interesting differences and technical complications that arise in the function field setting, as well as intriguing possible new directions for generalizations., Comment: Expository article, 40 pages

Recently, large language and vision models (LLVMs) have received significant attention and development efforts due to their remarkable generalization performance across a wide range of tasks requiring perception and cognitive abilities. A key factor behind their success is their simple architecture, which consists of a vision encoder, a projector, and a large language model (LLM). Despite their achievements in advanced reasoning tasks, their performance on fundamental perception-related tasks (e.g., MMVP) remains surprisingly low. This discrepancy raises the question of how LLVMs truly perceive images and exploit the advantages of the vision encoder. To address this, we systematically investigate this question regarding several aspects: permutation invariance, robustness, math reasoning, alignment preserving and importance, by evaluating the most common LLVM's families (i.e., LLaVA) across 10 evaluation benchmarks. Our extensive experiments reveal several intriguing properties of current LLVMs: (1) they internally process the image in a global manner, even when the order of visual patch sequences is randomly permuted; (2) they are sometimes able to solve math problems without fully perceiving detailed numerical information; (3) the cross-modal alignment is overfitted to complex reasoning tasks, thereby, causing them to lose some of the original perceptual capabilities of their vision encoder; (4) the representation space in the lower layers (<25%) plays a crucial role in determining performance and enhancing visual understanding. Lastly, based on the above observations, we suggest potential future directions for building better LLVMs and constructing more challenging evaluation benchmarks., Comment: Code is available in https://github.com/passing2961/IP-LLVM

We present a catalog of clouds identified from the $^{12}$CO (1--0) data of M83, which was observed using Atacama Large Millimeter/submillimeter Array (ALMA) with a spatial resolution of $\sim$46 pc and a mass sensitivity of $\sim$10$^4$ $M_{\odot}$ (3 $\sigma$). The almost full-disk coverage and high sensitivity of the data allowed us to sample 5724 molecular clouds with a median mass of $\sim1.9$ $\times$ $10^5$ $M_{\odot}$, which is comparable to the most frequently sampled mass of Giant Molecular Clouds by surveys in the Milky Way. About 60 percent of the total CO luminosity in M83's disk arises from clouds more massive than 10$^6$ $M_{\odot}$. Such massive clouds comprise 16 percent of the total clouds in number and tend to concentrate toward the arm, bar, and center, while smaller clouds are more prevalent in inter-arm regions. Most $>10^6$ $M_{\odot}$ clouds have peak brightness temperatures $T_{\mathrm{peak}}$ above 2 K with the current resolution. Comparing the observed cloud properties with the scaling relations determined by Solomon et al. 1987 (S87), $T_{\mathrm{peak}}$$>2$ K clouds follow the relations, but $T_{\mathrm{peak}}$$<2$ K clouds, which are dominant in number, deviate significantly. Without considering the effect of beam dilution, the deviations would suggest modestly high virial parameters and low surface mass densities for the entire cloud samples, which are similar to values found for the Milky Way clouds by Rice et al. (2016) and Miville-Desch{\^e}nes et al. (2017). However, once beam dilution is taken into account, the observed $\alpha_{\mathrm{vir}}$ and $\Sigma$ for a majority of the clouds (mostly $T_{\mathrm{peak}}$ $<2$ K) can be potentially explained with intrinsic $\Sigma$ of $\sim$100 $M_{\mathrm{\odot}}\ \mathrm{pc}^{-2}$ and $\alpha_{\mathrm{vir}}$ of $\sim$1, which are similar to the clouds of S87., Comment: Accepted for publication in ApJ

The mechanisms of electrostatic interactions between two charged dielectric spheres inside a polarizable medium have been investigated, in terms of hypothetical effective dipoles that depict how the positive and negative charge in each particle are separated. Our findings, which revealed that it is possible for polarization-induced opposite-charge repulsion to occur at short interparticle separations if the dielectric constant of the medium is greater than the dielectric constants of both spheres, provide insights into the physics of charge separation behind such counterintuitive behaviour., Comment: 13 pages, 8 figures

Electric guitar tone modeling typically focuses on the non-linear transformation from clean to amplifier-rendered audio. Traditional methods rely on one-to-one mappings, incorporating device parameters into neural models to replicate specific amplifiers. However, these methods are limited by the need for specific training data. In this paper, we adapt a model based on the previous work, which leverages a tone embedding encoder and a feature wise linear modulation (FiLM) condition method. In this work, we altered conditioning method using a hypernetwork-based gated convolutional network (GCN) to generate audio that blends clean input with the tone characteristics of reference audio. By extending the training data to cover a wider variety of amplifier tones, our model is able to capture a broader range of tones. Additionally, we developed a real-time plugin to demonstrate the system's practical application, allowing users to experience its performance interactively. Our results indicate that the proposed system achieves superior tone modeling versatility compared to traditional methods., Comment: demo of the ISMIR paper

Drawing inspiration from human learning behaviors, this work proposes a novel approach to mitigate catastrophic forgetting in Prompt-based Continual Learning models by exploiting the relationships between continuously emerging class data. We find that applying human habits of organizing and connecting information can serve as an efficient strategy when training deep learning models. Specifically, by building a hierarchical tree structure based on the expanding set of labels, we gain fresh insights into the data, identifying groups of similar classes could easily cause confusion. Additionally, we delve deeper into the hidden connections between classes by exploring the original pretrained model's behavior through an optimal transport-based approach. From these insights, we propose a novel regularization loss function that encourages models to focus more on challenging knowledge areas, thereby enhancing overall performance. Experimentally, our method demonstrated significant superiority over the most robust state-of-the-art models on various benchmarks.

Incorporating a priori physics knowledge into machine learning leads to more robust and interpretable algorithms. In this work, we combine deep learning techniques and classic numerical methods for differential equations to solve two challenging problems in dynamical systems theory: dynamics discovery and parameter estimation. Results demonstrate the effectiveness of the proposed approaches on a suite of test problems exhibiting oscillatory and chaotic dynamics. When comparing the performance of various numerical schemes, such as the Runge-Kutta and linear multistep families of methods, we observe promising results in predicting the system dynamics and estimating physical parameters, given appropriate choices of spatial and temporal discretization schemes and numerical method orders., Comment: 30 pages, 11 figures

We introduce Flat Hilbert Bayesian Inference (FHBI), an algorithm designed to enhance generalization in Bayesian inference. Our approach involves an iterative two-step procedure with an adversarial functional perturbation step and a functional descent step within the reproducing kernel Hilbert spaces. This methodology is supported by a theoretical analysis that extends previous findings on generalization ability from finite-dimensional Euclidean spaces to infinite-dimensional functional spaces. To evaluate the effectiveness of FHBI, we conduct comprehensive comparisons against seven baseline methods on the VTAB-1K benchmark, which encompasses 19 diverse datasets across various domains with diverse semantics. Empirical results demonstrate that FHBI consistently outperforms the baselines by notable margins, highlighting its practical efficacy.

We consider the cyclic presentation of $PG(3,q)$ whose points are in the finite field $\mathbb{F}_{q^4}$ and describe the known ovoids therein. We revisit the set $\mathcal{O}$, consisting of $(q^2+1)$-th roots of unity in $\mathbb{F}_{q^4}$, and prove that it forms an elliptic quadric within the cyclic presentation of $PG(3,q)$. Additionally, following the work of Glauberman on Suzuki groups, we offer a new description of Suzuki-Tits ovoids in the cyclic presentation of $PG(3,q)$, characterizing them as the zeroes of a polynomial over $\mathbb{F}_{q^4}$.

Hydrogen, while a promising sustainable energy carrier, presents challenges such as the embrittlement of materials due to its ability to penetrate and weaken their crystal structures. Here we investigate Fe4N nitride layers, formed on iron through a cost-effective gas nitriding process, as an effective hydrogen permeation barrier. A combination of screening using advanced characterization, density functional theory calculations, and hydrogen permeation analysis reveals that a nitride layer reduces hydrogen diffusion by a factor of 20 at room temperature. This reduction is achieved by creating energetically unfavorable states due to stronger H-binding at the surface and high energy barriers for diffusion. The findings demonstrate the potential of Fe4N as a cost-efficient and easy-to-process solution to protecting metallic materials exposed to hydrogen, with great advantages for large-scale applications.

This paper presents a solution to the problem of optimal ground station selection for low-Earth orbiting (LEO) space missions that enables mission operators to precisely design their ground segment performance and costs. Space mission operators are increasingly turning to Ground-Station-as-a-Service (GSaaS) providers to supply the terrestrial communications segment to reduce costs and increase network size. However, this approach leads to a new challenge of selecting the optimal service providers and station locations for a given mission. We consider the problem of ground station selection as an optimization problem and present a general solution framework that allows mission designers to set their overall optimization objective and constrain key mission performance variables such as total data downlink, total mission cost, recurring operational cost, and maximum communications time-gap. We solve the problem using integer programming (IP). To address computational scaling challenges, we introduce a surrogate optimization approach where the optimal station selection is determined based on solving the problem over a reduced time domain. Two different IP formulations are evaluated using randomized selections of LEO satellites of varying constellation sizes. We consider the networks of the commercial GSaaS providers Atlas Space Operations, Amazon Web Services (AWS) Ground Station, Azure Orbital Ground Station, Kongsberg Satellite Services (KSAT), Leaf Space, and Viasat Real-Time Earth. We compare our results against standard operational practices of integrating with one or two primary ground station providers., Comment: 13 pages, 3 tables, 4 figures, submitted to IEEE Aeroconf 2025

We search for the galaxies associated with the intervening MgII absorbers over a redshift range of $0.4 \le z \le 1.0$ using imaging data from DESI Legacy Imaging Surveys and measure the redshift based on direct detection of nebular emission in the background quasar spectra from SDSS survey. We find 270 MgII absorbers associated with strong [O II] nebular emissions, at $2.5\sigma$ level. Among them, for 213 MgII absorbers, we detect an absorber host galaxy at impact parameters of $4 \le \rho \le 16$ kpc, including a galaxy pair associated with three absorbers, with best-fit galaxy SED model based on multi-passband photometric data from DESI Legacy Imaging surveys, supplemented with the infrared VISTA and unWISE imaging surveys. The detection rate of MgII absorber host with strong [O II] nebular emission in the finite SDSS fiber of 2--3 arcsec diameter increases from 0.2% to $\sim$3% with increasing equivalent width from $0.3$\r{A} to $\sim$ 3.5\r{A}, which remains near-constant across the probed redshift range. The associated MgII host galaxies exhibit a wide range of stellar mass from 7.94 $\le \rm log(M_{\star}/M_{\odot}) \le $ 11.11, with an average star-formation rate (SFR) of $ 5.81 \rm M_{\odot}\ yr^{-1}$. The MgII absorber hosts selected based on [O II] nebular emission mostly exhibit active star-forming systems including 13.4% starburst systems, but 10.2% with suppressed SFR. The near-constant absorption strength at low-impact parameters suggests a high gas covering fraction. We find that the MgII equivalent width ($W_{2796}$) positively correlates with SFR and specific-SFR, likely indicate their wind origin. The average velocity offset between the host and absorber suggests that the MgII gas is bound within the dark matter halo., Comment: 9 Pages, 8 Figures, submitted to A&A

This paper aims to delve into the rate-distortion-complexity trade-offs of modern neural video coding. Recent years have witnessed much research effort being focused on exploring the full potential of neural video coding. Conditional autoencoders have emerged as the mainstream approach to efficient neural video coding. The central theme of conditional autoencoders is to leverage both spatial and temporal information for better conditional coding. However, a recent study indicates that conditional coding may suffer from information bottlenecks, potentially performing worse than traditional residual coding. To address this issue, recent conditional coding methods incorporate a large number of high-resolution features as the condition signal, leading to a considerable increase in the number of multiply-accumulate operations, memory footprint, and model size. Taking DCVC as the common code base, we investigate how the newly proposed conditional residual coding, an emerging new school of thought, and its variants may strike a better balance among rate, distortion, and complexity., Comment: Accepted to MMSP 2024

This work explores a collaborative method for ensuring safety in multi-agent formation control problems. We formulate a control barrier function (CBF) based safety filter control law for a generic distributed formation controller and extend our previously developed collaborative safety framework to an obstacle avoidance problem for agents with acceleration control inputs. We then incorporate multi-obstacle collision avoidance into the collaborative safety framework. This framework includes a method for computing the maximum capability of agents to satisfy their individual safety requirements. We analyze the convergence rate of our collaborative safety algorithm, and prove the linear-time convergence of cooperating agents to a jointly feasible safe action for all agents under the special case of a tree-structured communication network with a single obstacle for each agent. We illustrate the analytical results via simulation on a mass-spring kinematics-based formation controller and demonstrate the finite-time convergence of the collaborative safety algorithm in the simple proven case, the more general case of a fully-connected system with multiple static obstacles, and with dynamic obstacles., Comment: This work is under review for publication in Automatica. arXiv admin note: text overlap with arXiv:2311.11156

With the growing prominence of the Mixture of Experts (MoE) architecture in developing large-scale foundation models, we investigate the Hierarchical Mixture of Experts (HMoE), a specialized variant of MoE that excels in handling complex inputs and improving performance on targeted tasks. Our investigation highlights the advantages of using varied gating functions, moving beyond softmax gating within HMoE frameworks. We theoretically demonstrate that applying tailored gating functions to each expert group allows HMoE to achieve robust results, even when optimal gating functions are applied only at select hierarchical levels. Empirical validation across diverse scenarios supports these theoretical claims. This includes large-scale multimodal tasks, image classification, and latent domain discovery and prediction tasks, where our modified HMoE models show great performance improvements., Comment: 58 pages

We present a novel approach to reconstruct gas and dark matter projected density maps of galaxy clusters using score-based generative modeling. Our diffusion model takes in mock SZ and X-ray images as conditional observations, and generates realizations of corresponding gas and dark matter maps by sampling from a learned data posterior. We train and validate the performance of our model by using mock data from a hydrodynamical cosmological simulation. The model accurately reconstructs both the mean and spread of the radial density profiles in the spatial domain to within 5\%, indicating that the model is able to distinguish between clusters of different sizes. In the spectral domain, the model achieves close-to-unity values for the bias and cross-correlation coefficients, indicating that the model can accurately probe cluster structures on both large and small scales. Our experiments demonstrate the ability of score models to learn a strong, nonlinear, and unbiased mapping between input observables and fundamental density distributions of galaxy clusters. These diffusion models can be further fine-tuned and generalized to not only take in additional observables as inputs, but also real observations and predict unknown density distributions of galaxy clusters., Comment: 15 pages, 9 figures, submitted to The Open Journal of Astrophysics

State-of-the-art medical multi-modal large language models (med-MLLM), like LLaVA-Med or BioMedGPT, leverage instruction-following data in pre-training. However, those models primarily focus on scaling the model size and data volume to boost performance while mainly relying on the autoregressive learning objectives. Surprisingly, we reveal that such learning schemes might result in a weak alignment between vision and language modalities, making these models highly reliant on extensive pre-training datasets - a significant challenge in medical domains due to the expensive and time-consuming nature of curating high-quality instruction-following instances. We address this with LoGra-Med, a new multi-graph alignment algorithm that enforces triplet correlations across image modalities, conversation-based descriptions, and extended captions. This helps the model capture contextual meaning, handle linguistic variability, and build cross-modal associations between visuals and text. To scale our approach, we designed an efficient end-to-end learning scheme using black-box gradient estimation, enabling faster LLaMa 7B training. Our results show LoGra-Med matches LLAVA-Med performance on 600K image-text pairs for Medical VQA and significantly outperforms it when trained on 10% of the data. For example, on VQA-RAD, we exceed LLAVA-Med by 20.13% and nearly match the 100% pre-training score (72.52% vs. 72.64%). We also surpass SOTA methods like BiomedGPT on visual chatbots and RadFM on zero-shot image classification with VQA, highlighting the effectiveness of multi-graph alignment., Comment: First version, fixed typo

While fine-tuning pretrained models has become common practice, these models often underperform outside their specific domains. Recently developed model merging techniques enable the direct integration of multiple models, each fine-tuned for distinct tasks, into a single model. This strategy promotes multitasking capabilities without requiring retraining on the original datasets. However, existing methods fall short in addressing potential conflicts and complex correlations between tasks, especially in parameter-level adjustments, posing a challenge in effectively balancing parameter competition across various tasks. This paper introduces an innovative technique named PCB-Merging (Parameter Competition Balancing), a lightweight and training-free technique that adjusts the coefficients of each parameter for effective model merging. PCB-Merging employs intra-balancing to gauge parameter significance within individual tasks and inter-balancing to assess parameter similarities across different tasks. Parameters with low importance scores are dropped, and the remaining ones are rescaled to form the final merged model. We assessed our approach in diverse merging scenarios, including cross-task, cross-domain, and cross-training configurations, as well as out-of-domain generalization. The experimental results reveal that our approach achieves substantial performance enhancements across multiple modalities, domains, model sizes, number of tasks, fine-tuning forms, and large language models, outperforming existing model merging methods. The code is publicly available at: \url{https://github.com/duguodong7/pcb-merging}., Comment: Accepted by NeurIPS2024

Capacitive touch sensors capture the two-dimensional spatial profile (referred to as a touch heatmap) of a finger's contact with a mobile touchscreen. However, the research and design of touchscreen mobile keyboards -- one of the most speed and accuracy demanding touch interfaces -- has focused on the location of the touch centroid derived from the touch image heatmap as the input, discarding the rest of the raw spatial signals. In this paper, we investigate whether touch heatmaps can be leveraged to further improve the tap decoding accuracy for mobile touchscreen keyboards. Specifically, we developed and evaluated machine-learning models that interpret user taps by using the centroids and/or the heatmaps as their input and studied the contribution of the heatmaps to model performance. The results show that adding the heatmap into the input feature set led to 21.4% relative reduction of character error rates on average, compared to using the centroid alone. Furthermore, we conducted a live user study with the centroid-based and heatmap-based decoders built into Pixel 6 Pro devices and observed lower error rate, faster typing speed, and higher self-reported satisfaction score based on the heatmap-based decoder than the centroid-based decoder. These findings underline the promise of utilizing touch heatmaps for improving typing experience in mobile keyboards., Comment: Accepted to UIST 2024

Prompt-based techniques, such as prompt-tuning and prefix-tuning, have gained prominence for their efficiency in fine-tuning large pre-trained models. Despite their widespread adoption, the theoretical foundations of these methods remain limited. For instance, in prefix-tuning, we observe that a key factor in achieving performance parity with full fine-tuning lies in the reparameterization strategy. However, the theoretical principles underpinning the effectiveness of this approach have yet to be thoroughly examined. Our study demonstrates that reparameterization is not merely an engineering trick but is grounded in deep theoretical foundations. Specifically, we show that the reparameterization strategy implicitly encodes a shared structure between prefix key and value vectors. Building on recent insights into the connection between prefix-tuning and mixture of experts models, we further illustrate that this shared structure significantly improves sample efficiency in parameter estimation compared to non-shared alternatives. The effectiveness of prefix-tuning across diverse tasks is empirically confirmed to be enhanced by the shared structure, through extensive experiments in both visual and language domains. Additionally, we uncover similar structural benefits in prompt-tuning, offering new perspectives on its success. Our findings provide theoretical and empirical contributions, advancing the understanding of prompt-based methods and their underlying mechanisms., Comment: Minh Le, Chau Nguyen, Huy Nguyen contributed equally to this work. 50 pages, 8 tables, 2 figures

On 2022 March 10, a coronal mass ejection (CME) erupted from the Sun, resulting in Solar Orbiter observations at 0.45 au of both dispersive solar energetic particles arriving prior to the interplanetary CME (ICME) and locally accelerated particles near the ICME-associated shock structure as it passed the spacecraft on 2022 March 11. This shock was later detected on 2022 March 14 by the Advanced Composition Explorer (ACE), which was radially aligned with Solar Orbiter, at 1 au. Ion composition data from both spacecraft -- via the Solar Orbiter Energetic Particle Detector/ Suprathermal Ion Spectrograph (EPD/SIS) and the Ultra Low Energy Isotope Spectrometer (ULEIS) on ACE -- allows for in-depth analysis of the radial evolution of species-dependent ICME shock-associated acceleration processes for this event. We present a study of the ion spectra observed at 0.45 and 1 au during both the gradual solar energetic particle (SEP) and energetic storm particle (ESP) phases of the event. We find that the shapes of the spectra seen at each spacecraft have significant differences that were likely caused by varying shock geometry: Solar Orbiter spectra tend to lack spectral breaks, and the higher energy portions of the ACE spectra have comparable average flux to the Solar Orbiter spectra. Through an analysis of rigidity effects on the spectral breaks observed by ACE, we conclude that the 1 au observations were largely influenced by a suprathermal pool of $\mathrm{He}^{+}$ ions that were enhanced due to propagation along a stream interaction region (SIR) that was interacting with the ICME at times of observation., Comment: 15 pages, 7 figures, submitted to A&A

Fast radio bursts (FRBs) are millisecond-duration radio waves from the Universe. Even though more than 50 physical models have been proposed, the origin and physical mechanism of FRB emissions are still unknown. The classification of FRBs is one of the primary approaches to understanding their mechanisms, but previous studies classified conventionally using only a few observational parameters, such as fluence and duration, which might be incomplete. To overcome this problem, we use an unsupervised machine-learning model, the Uniform Manifold Approximation and Projection (UMAP) to handle seven parameters simultaneously, including amplitude, linear temporal drift, time duration, central frequency, bandwidth, scaled energy, and fluence. We test the method for homogeneous 977 sub-bursts of FRB 20121102A detected by the Arecibo telescope. Our machine-learning analysis identified five distinct clusters, suggesting the possible existence of multiple different physical mechanisms responsible for the observed FRBs from the FRB 20121102A source. The geometry of the emission region and the propagation effect of FRB signals could also make such distinct clusters. This research will be a benchmark for future FRB classifications when dedicated radio telescopes such as the Square Kilometer Array (SKA) or Bustling Universe Radio Survey Telescope in Taiwan (BURSTT) discover more FRBs than before., Comment: Accepted for publication for PASA

Pnueli first noticed that certain simple 'counting' properties appear to be inexpressible in popular timed temporal logics such as Metric Interval Temporal Logic (MITL). This interesting observation has since been studied extensively, culminating in strong timed logics that are capable of expressing such properties yet remain decidable. A slightly more general case, namely where one asserts the existence of a sequence of events in an arbitrary interval of the form (instead of an upper-bound interval of the form [0, b>, which starts from the current point in time), has however not been addressed satisfactorily in the existing literature. We show that counting in [0, b> is in fact as powerful as counting in ; moreover, the general property 'there exist x', x'' in I such that x' <= x'' and phi(x', x'') holds' can be expressed in Extended Metric Interval Temporal Logic (EMITL) with only [0, b>., Comment: In Proceedings DCM 2023, arXiv:2409.19298

Making successful use of cloud computing for deploying scalable web applications requires nuanced approaches to both system design and deployment methodology, involving reasoning about the elasticity, cost, and security models of cloud services. Students commonly interact with cloud abstractions early in their technical careers, including during internships and academic research. Building cloud-native applications without a firm understanding of the fundamentals of cloud engineering can leave students susceptible to cost and security pitfalls common to cloud platforms. Yet, cloud computing is not commonly taught at the undergraduate level, because the technology and practices behind modern cloud deployment, such as containerization and infrastructure-as-code (IaC), have only recently matured into a set of general principles independent from specific providers' offerings. To address this gap, we designed an undergraduate-level course around these principles that framed cloud infrastructure deployment as a software engineering practice in support of scalable web applications, emphasizing the value of both cloud deployment and application design skills in building robust cloud-native systems. Our course featured a number of hands-on assignments that gave students experience with modern, best-practice concepts and tools such as IaC, containerization, observability, serverless computing, and continuous integration and deployment. We describe the design of the course, our experience teaching its initial offering in Winter 2024, and provide our reflections on what worked well and potential areas for improvement. Our course material is publicly available at https://infracourse.cloud., Comment: Accepted to SIGCSE TS 2025

Quantum networks will provide unconditional security for communication, computation and distributed sensing tasks. We report on an experimental demonstration of private parameter estimation, which allows a global phase to be evaluated without revealing the constituent local phase values. This is achieved by sharing a Greenberger-Horne-Zeilinger (GHZ) state among three users who first verify the shared state before performing the sensing task. We implement the verification protocol, based on stabilizer measurements, and measure an average failure rate of 0.038(5) which we use to establish the security and privacy parameters. We validate the privacy conditions established by the protocol by evaluating the quantum Fisher information of the experimentally prepared GHZ states., Comment: 14 pages, 8 figures. Updated