Search

Eco-driving has been shown to reduce energy consumption for electric vehicles (EVs). Such strategies can also be implemented to both reduce energy consumption and improve battery lifetime. This study considers the eco-driving of a connected electric vehicle equipped with vehicle-to-infrastructure (V2I) communication passing through two signalized intersections. Dynamic programming is employed to construct an eco-driving algorithm that incorporates a battery degradation model in addition to minimizing energy consumption to optimize the vehicle's speed trajectory while transiting the control zone. A parametric study is conducted for various signal timings and distances between the two intersections. It is found that eco-driving can provide up to 49\% in cost benefits over regular driving due to energy savings and improved battery life which could boost consumers' interests on EVs. This study also considered different battery capacity decay rates based on battery chemistry. Although a higher decay rate affects the optimal speed trajectories only slightly, it amplifies the benefits of eco-driving on battery life. Two battery sizes were also studied to show that the larger battery is associated with a drastically increased lifetime, thus creating opportunities for electric vehicles in other applications such as vehicle-to-grid (V2G) integration. Field tests were also conducted using a simplified rule-based version of the eco-driving algorithm implemented as a phone app which issues audio speed recommendations to the driver. The field test results were promising and validated the results from simulations. The phone app implementation is convenient and could facilitate broader adoption and widespread use of eco-driving which helps to improve transportation efficiency and protect the environment., Comment: 14 pages, 12 figures

The growing interest in human-robot collaboration (HRC), where humans and robots cooperate towards shared goals, has seen significant advancements over the past decade. While previous research has addressed various challenges, several key issues remain unresolved. Many domains within HRC involve activities that do not necessarily require human presence throughout the entire task. Existing literature typically models HRC as a closed system, where all agents are present for the entire duration of the task. In contrast, an open model offers flexibility by allowing an agent to enter and exit the collaboration as needed, enabling them to concurrently manage other tasks. In this paper, we introduce a novel multiagent framework called oDec-MDP, designed specifically to model open HRC scenarios where agents can join or leave tasks flexibly during execution. We generalize a recent multiagent inverse reinforcement learning method - Dec-AIRL to learn from open systems modeled using the oDec-MDP. Our method is validated through experiments conducted in both a simplified toy firefighting domain and a realistic dyadic human-robot collaborative assembly. Results show that our framework and learning method improves upon its closed system counterpart.

In August 2021, Liu et al. (IEEE TIFS'21) proposed a privacy-enhanced framework named PEFL to efficiently detect poisoning behaviours in Federated Learning (FL) using homomorphic encryption. In this article, we show that PEFL does not preserve privacy. In particular, we illustrate that PEFL reveals the entire gradient vector of all users in clear to one of the participating entities, thereby violating privacy. Furthermore, we clearly show that an immediate fix for this issue is still insufficient to achieve privacy by pointing out multiple flaws in the proposed system. Note: Although our privacy issues mentioned in Section II have been published in January 2023 (Schneider et. al., IEEE TIFS'23), several subsequent papers continued to reference Liu et al. (IEEE TIFS'21) as a potential solution for private federated learning. While a few works have acknowledged the privacy concerns we raised, several of subsequent works either propagate these errors or adopt the constructions from Liu et al. (IEEE TIFS'21), thereby unintentionally inheriting the same privacy vulnerabilities. We believe this oversight is partly due to the limited visibility of our comments paper at TIFS'23 (Schneider et. al., IEEE TIFS'23). Consequently, to prevent the continued propagation of the flawed algorithms in Liu et al. (IEEE TIFS'21) into future research, we also put this article to an ePrint., Comment: Published at IEEE Transactions on Information Forensics and Security'23

As large language models (LLMs) are applied to more use cases, creating high quality, task-specific datasets for fine-tuning becomes a bottleneck for model improvement. Using high quality human data has been the most common approach to unlock model performance, but is prohibitively expensive in many scenarios. Several alternative methods have also emerged, such as generating synthetic or hybrid data, but the effectiveness of these approaches remain unclear, especially in resource-constrained scenarios and tasks that are not easily verified. To investigate this, we group various synthetic data generation strategies into three representative categories -- Answer Augmentation, Question Rephrase and New Question -- and study the performance of student LLMs trained under various constraints, namely seed instruction set size and query budget. We demonstrate that these strategies are not equally effective across settings. Notably, the optimal data generation strategy depends strongly on the ratio between the available teacher query budget and the size of the seed instruction set. When this ratio is low, generating new answers to existing questions proves most effective, but as this ratio increases, generating new questions becomes optimal. Across all tasks, we find that choice of augmentation method and other design choices matter substantially more in low to mid data regimes than in high data regimes. We provide a practical framework for selecting the appropriate augmentation method across settings, taking into account additional factors such as the scalability of each method, the importance of verifying synthetic data, and the use of different LLMs for synthetic data generation.

Despite significant advancements in large language models (LLMs) that enhance robot agents' understanding and execution of natural language (NL) commands, ensuring the agents adhere to user-specified constraints remains challenging, particularly for complex commands and long-horizon tasks. To address this challenge, we present three key insights, equivalence voting, constrained decoding, and domain-specific fine-tuning, which significantly enhance LLM planners' capability in handling complex tasks. Equivalence voting ensures consistency by generating and sampling multiple Linear Temporal Logic (LTL) formulas from NL commands, grouping equivalent LTL formulas, and selecting the majority group of formulas as the final LTL formula. Constrained decoding then uses the generated LTL formula to enforce the autoregressive inference of plans, ensuring the generated plans conform to the LTL. Domain-specific fine-tuning customizes LLMs to produce safe and efficient plans within specific task domains. Our approach, Safe Efficient LLM Planner (SELP), combines these insights to create LLM planners to generate plans adhering to user commands with high confidence. We demonstrate the effectiveness and generalizability of SELP across different robot agents and tasks, including drone navigation and robot manipulation. For drone navigation tasks, SELP outperforms state-of-the-art planners by 10.8% in safety rate (i.e., finishing tasks conforming to NL commands) and by 19.8% in plan efficiency. For robot manipulation tasks, SELP achieves 20.4% improvement in safety rate. Our datasets for evaluating NL-to-LTL and robot task planning will be released in github.com/lt-asset/selp.

We report on the first measurement of $J/\psi$ photoproduction from nuclei in the photon energy range of $7$ to $10.8$ GeV, extending above and below the photoproduction threshold in the free proton of $\sim8.2$ GeV. The experiment used a tagged photon beam incident on deuterium, helium, and carbon, and the GlueX detector at Jefferson Lab to measure the semi-inclusive $A(\gamma,e^+e^-p)$ reaction with a dilepton invariant mass $M(e^+e^-)\sim m_{J/\psi}=3.1$ GeV. The incoherent $J/\psi$ photoproduction cross sections in the measured nuclei are extracted as a function of the incident photon energy, momentum transfer, and proton reconstructed missing light-cone momentum fraction. Comparisons with theoretical predictions suggest an excess of the measured cross section for sub-threshold production and for interactions with high missing light-cone momentum fraction protons. The measured enhancement can be explained by modified gluon structure for high-virtuality bound-protons.

The scarcity of domain specific dialogue datasets across various domains, from academic topics to everyday conversations, limits the development of dialogue systems for various applications. Existing research is often constrained either by dialogue datasets that are too general or by niche domain dialogue datasets whose scale does not match the required scale for training dialogue systems. To address this gap, we introduce DiaSynth - a synthetic dialogue generation framework capable of generating high quality, contextually rich dialogues across a wide range of domains. Our approach differs from existing frameworks by dynamically generating dialogues that incorporate simulated personas, subtopics, and diverse conversational characteristics, using a Large Language Model (LLM) with Chain of Thought (CoT) reasoning to create contextually rich, domain-specific dialogues that closely mimic natural human interactions. DiaSynth produces tailored dialogues that emulate realistic conversations. We perform our experiments by generating synthetic data using different LLMs and few-shot examples from DialogSum and SAMSum. The pretrained language models fine-tuned on the synthetic data outperform the base models by 16.47%, while the comparison between models fine-tuned on in-domain data and synthetic data shows that the synthetic data is able to capture 90.48% of the distribution of the in-domain data. The quality of the data generated also scales with the size of LLMs. These results validate DiaSynth's potential as a robust alternative to traditional data collection methods., Comment: 13 pages, 1 figure

Reliable prediction of the All India Summer Monsoon Rainfall (AISMR) is pivotal for informed policymaking for the country, impacting the lives of billions of people. However, accurate simulation of AISMR has been a persistent challenge due to the complex interplay of various muti-scale factors and the inherent variability of the monsoon system. This research focuses on adapting and fine-tuning the latest LLM model, PatchTST, to accurately predict AISMR with a lead time of three months. The fine-tuned PatchTST model, trained with historical AISMR data, the Ni\~no3.4 index, and categorical Indian Ocean Dipole values, outperforms several popular neural network models and statistical models. This fine-tuned LLM model exhibits an exceptionally low RMSE percentage of 0.07% and a Spearman correlation of 0.976. This is particularly impressive, since it is nearly 80% more accurate than the best-performing NN models. The model predicts an above-normal monsoon for the year 2024, with an accumulated rainfall of 921.6 mm in the month of June-September for the entire country., Comment: 3 figures

This paper presents a Dynamic Internal Predictive Power Scheduling (DIPPS) approach for optimizing power management in microgrids, particularly focusingon external power exchanges among diverse prosumers. DIPPS utilizes a dynamic objective function with a time-varying binary parameter to control the timing of power transfers to the external grid, facilitated by efficient usage of energy storage for surplus renewable power. The microgrid power scheduling problem is modeled as a mixed-integer nonlinear programmig (MINLP-PS) and subsequently transformed into a mixed-integer linear programming (MILP-PS) optimization through McCormick's relaxation to reduce the computational complexity. A predictive window with 6 data points is solved at an average of 0.92s, a 97.6% improvement over the 38.27s required for the MINLP-PS formulation, implying the numerical feasibility of the DIPPS approach for real-time implementation. Finally, the approach is validated against a static objective using real-world load data across three case studies with different time-varying parameters, demonstrationg the ability of DIPPS to optimize power exchanges and efficiently utilize distributed resources whie shifting the eexternal power transfers to specified time durations.

Large language models (LLMs) have shown remarkable capabilities in various natural language tasks and are increasingly being applied in healthcare domains. This work demonstrates a new LLM-powered disease risk assessment approach via streaming human-AI conversation, eliminating the need for programming required by traditional machine learning approaches. In a COVID-19 severity risk assessment case study, we fine-tune pre-trained generative LLMs (e.g., Llama2-7b and Flan-t5-xl) using a few shots of natural language examples, comparing their performance with traditional classifiers (i.e., Logistic Regression, XGBoost, Random Forest) that are trained de novo using tabular data across various experimental settings. We develop a mobile application that uses these fine-tuned LLMs as its generative AI (GenAI) core to facilitate real-time interaction between clinicians and patients, providing no-code risk assessment through conversational interfaces. This integration not only allows for the use of streaming Questions and Answers (QA) as inputs but also offers personalized feature importance analysis derived from the LLM's attention layers, enhancing the interpretability of risk assessments. By achieving high Area Under the Curve (AUC) scores with a limited number of fine-tuning samples, our results demonstrate the potential of generative LLMs to outperform discriminative classification methods in low-data regimes, highlighting their real-world adaptability and effectiveness. This work aims to fill the existing gap in leveraging generative LLMs for interactive no-code risk assessment and to encourage further research in this emerging field.

Accurate attribute extraction is critical for beauty product recommendations and building trust with customers. This remains an open problem, as existing solutions are often unreliable and incomplete. We present a system to extract beauty-specific attributes using end-to-end supervised learning based on beauty product ingredients. A key insight to our system is a novel energy-based implicit model architecture. We show that this implicit model architecture offers significant benefits in terms of accuracy, explainability, robustness, and flexibility. Furthermore, our implicit model can be easily fine-tuned to incorporate additional attributes as they become available, making it more useful in real-world applications. We validate our model on a major e-commerce skincare product catalog dataset and demonstrate its effectiveness. Finally, we showcase how ingredient-based attribute extraction contributes to enhancing the explainability of beauty recommendations., Comment: 18th ACM Conference on Recommender Systems, Workshop on Strategic and Utility-aware REcommendation

The stochastic formation of defects during Laser Powder Bed Fusion (L-PBF) negatively impacts its adoption for high-precision use cases. Optical monitoring techniques can be used to identify defects based on layer-wise imaging, but these methods are difficult to scale to high resolutions due to cost and memory constraints. Therefore, we implement generative deep learning models to link low-cost, low-resolution images of the build plate to detailed high-resolution optical images of the build plate, enabling cost-efficient process monitoring. To do so, a conditional latent probabilistic diffusion model is trained to produce realistic high-resolution images of the build plate from low-resolution webcam images, recovering the distribution of small-scale features and surface roughness. We first evaluate the performance of the model by analyzing the reconstruction quality of the generated images using peak-signal-to-noise-ratio (PSNR), structural similarity index measure (SSIM) and wavelet covariance metrics that describe the preservation of high-frequency information. Additionally, we design a framework based upon the Segment Anything foundation model to recreate the 3D morphology of the printed part and analyze the surface roughness of the reconstructed samples. Finally, we explore the zero-shot generalization capabilities of the implemented framework to other part geometries by creating synthetic low-resolution data.

The magnetic field strength and its topology play an important role in understanding the formation, evolution, and dynamics of the solar corona. Also, it plays a significant role in addressing long-standing mysteries such as coronal heating problem, origin and propagation of coronal mass ejections, drivers of space weather, origin and acceleration of solar wind, and so on. Despite having photospheric magnetograms for decades, we do not have reliable observations of coronal magnetic field strengths today. To measure the coronal magnetic field precisely, the spectropolarimetry channel of the Visible Emission Line Coronagraph (VELC) on board the Aditya-L1 mission is designed. Using the observations of coronal emission line Fe XIII [10747{\AA~}], it is possible to generate full Stokes maps (I, Q, U, and V) that help in estimating the Line-of-Sight (LOS) magnetic field strength and to derive the magnetic field topology maps of solar corona in the Field of View (FOV) (1.05 -- 1.5~R$_{\odot}$). In this article, we summarize the instrumental details of the spectropolarimetry channel and detailed calibration procedures adopted to derive the modulation and demodulation matrices. Furthermore, we have applied the derived demodulation matrices to the observed data in the laboratory and studied their performance., Comment: 12 pages, 5 Figures, Published in Journal of Experimental Astronomy

The MMT Adaptive optics exoPlanet characterization System (MAPS) is currently in its engineering phase, operating on-sky at the MMT Telescope on Mt. Hopkins in southern Arizona. The MAPS Adaptive Secondary Mirror's actuators are controlled by a closed loop modified PID control law and an open loop feed-forward law, which in combination allows for faster actuator response time. An essential element of achieving the secondary's performance goals involves the process of PID gain tuning. To start, we briefly discuss the design of the MAPS ASM and its actuators. We then describe the actuator positional control system and control law. Next, we discuss a few of the issues that make ASM tuning difficult. We then outline our initial attempts at tuning the actuator controllers and discuss the use of actuator positional power spectra for both tuning and determining the health and failure states of individual actuators. We conclude by presenting the results of our latest round of tuning configuration trials, which have been successful at decreasing mirror latency, increasing operational mirror modes and improving image PSF., Comment: To be published in Proceedings of SPIE, Optics and Photonics 2024. 24 pages, 16 figures, 5 tables. Lead Author, J. Johnson. Second Lead Author, A. Vaz. Project P.I., K. Morzinski. Project Second P.I.s, J. Patience and S. Sivanandam, Project Manager, M. Montoya

Mobile robots should be capable of planning cost-efficient paths for autonomous navigation. Typically, the terrain and robot properties are subject to variations. For instance, properties of the terrain such as friction may vary across different locations. Also, properties of the robot may change such as payloads or wear and tear, e.g., causing changing actuator gains or joint friction. Autonomous navigation approaches should thus be able to adapt to such variations. In this article, we propose a novel approach for learning a probabilistic, terrain- and robot-aware forward dynamics model (TRADYN) which can adapt to such variations and demonstrate its use for navigation. Our learning approach extends recent advances in meta-learning forward dynamics models based on Neural Processes for mobile robot navigation. We evaluate our method in simulation for 2D navigation of a robot with uni-cycle dynamics with varying properties on terrain with spatially varying friction coefficients. In our experiments, we demonstrate that TRADYN has lower prediction error over long time horizons than model ablations which do not adapt to robot or terrain variations. We also evaluate our model for navigation planning in a model-predictive control framework and under various sources of noise. We demonstrate that our approach yields improved performance in planning control-efficient paths by taking robot and terrain properties into account., Comment: Submitted to Robotics and Autonomous Systems. arXiv admin note: substantial text overlap with arXiv:2307.09206

Oysters are a vital keystone species in coastal ecosystems, providing significant economic, environmental, and cultural benefits. As the importance of oysters grows, so does the relevance of autonomous systems for their detection and monitoring. However, current monitoring strategies often rely on destructive methods. While manual identification of oysters from video footage is non-destructive, it is time-consuming, requires expert input, and is further complicated by the challenges of the underwater environment. To address these challenges, we propose a novel pipeline using stable diffusion to augment a collected real dataset with realistic synthetic data. This method enhances the dataset used to train a YOLOv10-based vision model. The model is then deployed and tested on an edge platform in underwater robotics, achieving a state-of-the-art 0.657 mAP@50 for oyster detection on the Aqua2 platform.

Hexagonal boron nitride encapsulation is the method of choice for protecting graphene from environmental doping and impurity scattering. It was previously demonstrated that metal-organic vapor phase epitaxy (MOVPE) grows epitaxially ordered, uniform BN layers on epigraphene (graphene grown on SiC). Due to graphene non-wetting properties, h-BN growth starts preferentially from the graphene ledges. We use this fact here to selectively promote growth of high-quality flat h-BN on epigraphene by patterning epigraphene microstructures prior to BN growth. Thin h-BN films (down to 6 nm) grown by MOVPE show smooth and pleated surface morphology on epigraphene, while crumpled BN is observed on the SiC. Cross-sectional high-resolution transmission electron microscopy images and fluorescence imaging confirm the higher BN quality grown on the epigraphene. Transport measurements reveal p-doping as expected from hydrogen intercalation of epigraphene and regions of high and low mobility. This method can be used to produce structurally uniform high-quality h-BN/epigraphene micro/nano scale heterostructure.

In the realms of the internet of vehicles (IoV) and intelligent transportation systems (ITS), software defined vehicular networks (SDVN) and edge computing (EC) have emerged as promising technologies for enhancing road traffic efficiency. However, the increasing number of connected autonomous vehicles (CAVs) and EC-based applications presents multi-domain challenges such as inefficient traffic flow due to poor CAV coordination and flow-table overflow in SDVN from increased connectivity and limited ternary content addressable memory (TCAM) capacity. To address these, we focus on a data-driven approach using virtualization technologies like digital twin (DT) to leverage real-time data and simulations. We introduce a DT design and propose two data-driven solutions: a centralized decision support framework to improve traffic efficiency by reducing waiting times at roundabouts and an approach to minimize flow-table overflow and flow re-installation by optimizing flow-entry lifespan in SDVN. Simulation results show the decision support framework reduces average waiting times by 22% compared to human-driven vehicles, even with a CAV penetration rate of 40%. Additionally, the proposed optimization of flow-table space usage demonstrates a 50% reduction in flow-table space requirements, even with 100% penetration of connected vehicles., Comment: 7 pages, 9 figures, conference paper

Continual and interactive robot learning is a challenging problem as the robot is present with human users who expect the robot to learn novel skills to solve novel tasks perpetually with sample efficiency. In this work we present a framework for robots to query and learn visuo-motor robot skills and task relevant information via natural language dialog interactions with human users. Previous approaches either focus on improving the performance of instruction following agents, or passively learn novel skills or concepts. Instead, we used dialog combined with a language-skill grounding embedding to query or confirm skills and/or tasks requested by a user. To achieve this goal, we developed and integrated three different components for our agent. Firstly, we propose a novel visual-motor control policy ACT with Low Rank Adaptation (ACT-LoRA), which enables the existing SoTA ACT model to perform few-shot continual learning. Secondly, we develop an alignment model that projects demonstrations across skill embodiments into a shared embedding allowing us to know when to ask questions and/or demonstrations from users. Finally, we integrated an existing LLM to interact with a human user to perform grounded interactive continual skill learning to solve a task. Our ACT-LoRA model learns novel fine-tuned skills with a 100% accuracy when trained with only five demonstrations for a novel skill while still maintaining a 74.75% accuracy on pre-trained skills in the RLBench dataset where other models fall significantly short. We also performed a human-subjects study with 8 subjects to demonstrate the continual learning capabilities of our combined framework. We achieve a success rate of 75% in the task of sandwich making with the real robot learning from participant data demonstrating that robots can learn novel skills or task knowledge from dialogue with non-expert users using our approach.

In many domains, it is difficult to obtain the race data that is required to estimate racial disparity. To address this problem, practitioners have adopted the use of proxy methods which predict race using non-protected covariates. However, these proxies often yield biased estimates, especially for minority groups, limiting their real-world utility. In this paper, we introduce two new contextual proxy models that advance existing methods by incorporating contextual features in order to improve race estimates. We show that these algorithms demonstrate significant performance improvements in estimating disparities on real-world home loan and voter data. We establish that achieving unbiased disparity estimates with contextual proxies relies on mean-consistency, a calibration-like condition.

Feature-mapping methods for topology optimization (FMTO) facilitate direct geometry extraction by leveraging high-level geometric descriptions of the designs. However, FMTO often relies solely on Boolean unions, which can restrict the design space. This work proposes an FMTO framework leveraging an expanded set of Boolean operations, namely, union, intersection, and subtraction. The optimization process entails determining the primitives and the optimal Boolean operation tree. In particular, the framework leverages a recently proposed unified Boolean operation approach. This approach presents a continuous and differentiable function that interpolates the Boolean operations, enabling gradient-based optimization. The proposed methodology is agnostic to the specific primitive parametrization and is showcased through various numerical examples., Comment: Submitted to Structural and Multidisciplinary Optimization

The strong performance of simple neural networks is often attributed to their nonlinear activations. However, a linear view of neural networks makes understanding and controlling networks much more approachable. We draw from a dynamical systems view of neural networks, offering a fresh perspective by using Koopman operator theory and its connections with dynamic mode decomposition (DMD). Together, they offer a framework for linearizing dynamical systems by embedding the system into an appropriate observable space. By reframing a neural network as a dynamical system, we demonstrate that we can replace the nonlinear layer in a pretrained multi-layer perceptron (MLP) with a finite-dimensional linear operator. In addition, we analyze the eigenvalues of DMD and the right singular vectors of SVD, to present evidence that time-delayed coordinates provide a straightforward and highly effective observable space for Koopman theory to linearize a network layer. Consequently, we replace layers of an MLP trained on the Yin-Yang dataset with predictions from a DMD model, achieving a mdoel accuracy of up to 97.3%, compared to the original 98.4%. In addition, we replace layers in an MLP trained on the MNIST dataset, achieving up to 95.8%, compared to the original 97.2% on the test set.

Synthesizing the voices of unseen speakers is a persisting challenge in multi-speaker text-to-speech (TTS). Most multi-speaker TTS models rely on modeling speaker characteristics through speaker conditioning during training. Modeling unseen speaker attributes through this approach has necessitated an increase in model complexity, which makes it challenging to reproduce results and improve upon them. We design a simple alternative to this. We propose SelectTTS, a novel method to select the appropriate frames from the target speaker and decode using frame-level self-supervised learning (SSL) features. We show that this approach can effectively capture speaker characteristics for unseen speakers, and achieves comparable results to other multi-speaker TTS frameworks in both objective and subjective metrics. With SelectTTS, we show that frame selection from the target speaker's speech is a direct way to achieve generalization in unseen speakers with low model complexity. We achieve better speaker similarity performance than SOTA baselines XTTS-v2 and VALL-E with over an 8x reduction in model parameters and a 270x reduction in training data., Comment: Submitted to IEEE Signal Processing Letters

We demonstrate that the spinning LQG black hole can act as a cosmic particle accelerator. The LQG solution is singularity-free and can possess spin greater than that of a Kerr black hole. The additional black hole hair, arising from quantum effects, significantly influences the particle dynamics around the black hole. Under suitable physical conditions, the center-of-mass energy can grow arbitrarily high during the collision of two generic particles in the spacetime of an extremal black hole. In the non-extremal case, there exists a finite upper bound on the center-of-mass energy, the maximum value of which depends on the LQG parameter. These results are particularly interesting from an astrophysical perspective, especially in the context of probing Planck-scale physics., Comment: 19 pages, 6 figures

We prove that for a finite set of points $X$ in the projective $n$-space over any field, the Betti number $\beta_{n,n+1}$ of the coordinate ring of $X$ is non-zero if and only if $X$ lies on the union of two planes whose sum of dimension is less than $n$. Our proof is direct and short, and the inductive step rests on a combinatorial statement that works over matroids.

Many modern astronomical instruments rely on the optimal coupling of starlight into single-mode fibers (SMFs). For ground-based telescopes, this coupling is limited by atmospheric turbulence. We propose an integrated wavefront corrector based on silicon-on-insulator (SOI) photonics, which samples the aberrated wavefront via a microlens array (MLA). The MLA focuses the sampled wavefront onto an array of grating couplers that inject the beamlets into the single-mode waveguides of the corrector. The beams in each waveguide are then shifted in phase using thermo-optic phase shifters before combining the co-phased beams into one single-mode waveguide. In this work, we analyze the external factors that we anticipate will impact the performance of the corrector. Specifically, we study the effects of the telescope pupil function with obscuration, determine whether the corrector requires tip/tilt pre-correction, and analyze the impact of scintillation on the correction quality., Comment: 8 pages, 6 figures, submitted to SPIE Adaptive Optics Systems IX

In recent years, Cosmic Microwave Background (CMB) observations, Weak Lensing surveys, and $f(z)\sigma_8(z)$ measurements from Redshift-Space Distortions (RSD) have revealed a significant ($\sim$3$-$5$\sigma$) discrepancy in the inferred value of the matter clustering parameter $S_8$. In this work, we investigate the implications of RSD for a cosmological framework postulating an interaction between Dark Energy (DE) and Dark Matter (DM). We explore scenarios where DM can transfer energy-momentum to DE or vice versa. The energy-momentum flow is characterized by the strength and the sign of the coupling parameter $\xi$. Our baseline analysis combines RSD measurements with the latest data from Baryon Acoustic Oscillations (BAO) observed by DESI, Type Ia Supernovae from the PantheonPlus sample, and CMB data from Planck. We demonstrate that RSD measurements provide significant additional information. When energy-momentum flows from DM to DE (i.e., $\xi < 0$), these measurements set stringent new bounds on the interaction strength. Conversely, when energy-momentum flows from DE to DM ($\xi > 0$), they favor interactions at more than the $2\sigma$ confidence level. Models with $\xi > 0$ can effectively resolve the tension in $S_8$, presenting them as compelling alternatives., Comment: 13 pages, 6 figures. Comments welcome and appreciated

Adversarial training (AT) incurs significant computational overhead, leading to growing interest in designing inherently robust architectures. We demonstrate that a carefully designed first layer of the neural network can serve as an implicit adversarial noise filter (ANF). This filter is created using a combination of large kernel size, increased convolution filters, and a maxpool operation. We show that integrating this filter as the first layer in architectures such as ResNet, VGG, and EfficientNet results in adversarially robust networks. Our approach achieves higher adversarial accuracies than existing natively robust architectures without AT and is competitive with adversarial-trained architectures across a wide range of datasets. Supporting our findings, we show that (a) the decision regions for our method have better margins, (b) the visualized loss surfaces are smoother, (c) the modified peak signal-to-noise ratio (mPSNR) values at the output of the ANF are higher, (d) high-frequency components are more attenuated, and (e) architectures incorporating ANF exhibit better denoising in Gaussian noise compared to baseline architectures. Code for all our experiments are available at \url{https://github.com/janani-suresh-97/first-line-defence.git}.

The ground state of a one-dimensional spin-1/2 uniform antiferromagnetic Heisenberg chain (AfHc) is a Tomonaga-Luttinger liquid which is quantum-critical with respect to applied magnetic fields upto a saturation field Hs beyond which it transforms to a fully polarised state. Wilson ratio has been predicted to be a good indicator for demarcating these phases [Phys. Rev. B 96, 220401 (2017)]. From detailed temperature and magnetic field dependent magnetisation, magnetic susceptibility and specific heat measurements in a metalorganic complex and comparisons with field theory and quantum transfer matrix method calculations, the complex was found to be a very good realisation of a spin-1/2 AfHc. Wilson ratio obtained from experimentally obtained magnetic susceptibility and magnetic contribution of specific heat values was used to map the magnetic phase diagram of the uniform spin-1/2 AfHc over large regions of phase space demarcating Tomonaga-Luttinger liquid, saturation field quantum critical, and fully polarised states. Luttinger parameter and spinon velocity were found to match very well with the values predicted from conformal field theory., Comment: Accepted for publication in PNAS Nexus

Suppose Alice has a distribution $P$ and Bob has a distribution $Q$. Alice wants to generate a sample $a\sim P$ and Bob a sample $b \sim Q$ such that $a = b$ with has as high of probability as possible. It is well-known that, by sampling from an optimal coupling between the distributions, Alice and Bob can achieve $Pr[a = b] = 1 - D_{TV}(P,Q)$, where $D_{TV}(P,Q)$ is the total variation distance. What if Alice and Bob must solve this same problem without communicating at all? Perhaps surprisingly, with access to public randomness, they can still achieve $Pr[a=b] \geq \frac{1-D_{TV}(P,Q)}{1+D_{TV}(P,Q)} \geq 1-2D_{TV}(P,Q)$. In fact, this bound can be obtained using a simple protocol based on the Weighted MinHash algorithm. In this work, we explore the communication-free coupling problem in greater depth. First, we show that an equally simple protocol based on Gumbel sampling matches the worst-case guarantees of the Weighted MinHash approach, but tends to perform better in practice. Conversely, we prove that both approaches are actually sharp: no communication-free protocol can achieve $Pr[a=b]>\frac{1-D_{TV}(P,Q)}{1+D_{TV}(P,Q)}$ in the worst-case. Finally, we prove that, for distributions over $n$ items, there exists a scheme that uses just $O(\log(n/\epsilon))$ bits of communication to achieve $Pr[a = b] = 1 - D_{TV}(P,Q) - \epsilon$, i.e. to essentially match optimal coupling. Beyond our theoretical results, we demonstrate an application of communication-free coupling to speculative decoding, a recent method for accelerating autoregressive large language models [Leviathan, Kalman, Matias, ICML 2023]. We show that communication-free protocols yield a variant of speculative decoding that we call Drafter-Invariant Speculative Decoding, which has the desirable property that the output of the method is fixed given a fixed random seed, regardless of what drafter is used for speculation., Comment: 16 pages

In ground-based astronomy, the ability to couple light into single-mode fibers (SMFs) is limited by atmospheric turbulence, which prohibits the use of many astrophotonic instruments. We propose a silicon-on-insulator photonic chip capable of coherently coupling the out-of-phase beamlets from the subapertures of a telescope pupil into an SMF. The photonic integrated circuit (PIC) consists of an array of grating couplers that are used to inject light from free space into single-mode waveguides on the chip. Metallic heaters modulate the refractive index of a coiled section of the waveguides, facilitating the co-phasing of the propagating modes. The phased beamlets can then be coherently combined to efficiently deliver the light to an output SMF. In an adaptive optics (AO) system, the phase corrector acts as a deformable mirror (DM) commanded by a controller that takes phase measurements from a wavefront sensor (WFS). We present experimental results for the PIC tested on an AO testbed and compare the performance to simulations., Comment: 13 pages, 11 figures, 2 tables, submitted to SPIE Adaptive Optics Systems IX

With the commissioning of the refurbished adaptive secondary mirror (ASM) for the 6.5-meter MMT Observatory under way, special consideration had to be made to properly calibrate the mirror response functions to generate an interaction matrix (IM). The commissioning of the ASM is part of the MMT Adaptive optics exoPlanet characterization System (MAPS) upgrade the observatory's legacy adaptive optics (AO) system. Unlike most AO systems, MAPS employs a convex ASM which prevents the introduction of a calibration source capable of simultaneously illuminating its ASM and wavefront sensor (WFS). This makes calibration of the AO system a significant hurdle in commissioning. To address this, we have employed a hybrid calibration strategy we call the Efficient Synthesis of Calibrations for Adaptive Optics through Pseudo-synthetic and Empirical methods (ESCAPE). ESCAPE combines the DO-CRIME on-sky calibration method with the SPRINT method for computing pseudo-synthetic calibration matrices. To monitor quasi-static system change, the ESCAPE methodology rapidly and continuously generates pseudo-synthetic calibration matrices using continual empirical feedback in either open or closed-loop. In addition, by measuring the current IM in the background while in close-loop, we are also able to measure the optical gains for pyramid wavefront sensor (PyWFS) systems. In this paper, we will provide the mathematical foundation of the ESCAPE calibration strategy and on-sky results from its application in calibrating the MMT Observatory's ASM. Additionally, we will showcase the validation of our approach from our AO testbed and share preliminary on-sky results from MMT., Comment: 16 pages, 9 figures, Submission to SPIE Adaptive Optics Systems IX

In the limit where partons become collinear to each other, scattering amplitudes factorize into a product of universal, process-independent building blocks and scattering amplitudes involving fewer partons. We compute these universal building blocks -- known as splitting amplitudes -- for two collinear QCD partons up to third loop order in QCD. Our results describe arbitrary time-like splitting processes. Due to the violation of strict collinear factorization in space-like splitting processes, we specifically present space-like splitting amplitudes for three-parton QCD scattering amplitudes at third loop order. To achieve our results, we perform a collinear expansion of three-loop scattering amplitudes using a new expansion-by-subgraph technology, which is based on the method of regions., Comment: 17 pages, 4 figures

This study aims to learn a translation from visible to infrared imagery, bridging the domain gap between the two modalities so as to improve accuracy on downstream tasks including object detection. Previous approaches attempt to perform bi-domain feature fusion through iterative optimization or end-to-end deep convolutional networks. However, we pose the problem as similar to that of image translation, adopting a two-stage training strategy with a Generative Adversarial Network and an object detection model. The translation model learns a conversion that preserves the structural detail of visible images while preserving the texture and other characteristics of infrared images. Images so generated are used to train standard object detection frameworks including Yolov5, Mask and Faster RCNN. We also investigate the usefulness of integrating a super-resolution step into our pipeline to further improve model accuracy, and achieve an improvement of as high as 5.3% mAP.

This paper proposes and evaluates a Multi-Reference Relaxation Enforced Neighborhood Search (MRENS) heuristic within the SCIP solver. This study marks the first integration and evaluation of MRENS in a full-fledged MILP solver, specifically coupled with the recently-introduced Lagromory separator for generating multiple reference solutions. Computational experiments on the MIPLIB 2017 benchmark set show that MRENS, with multiple reference solutions, improves the solver's ability to find higher-quality feasible solutions compared to single-reference approaches. This study highlights the potential of multi-reference heuristics in enhancing primal heuristics in MILP solvers., Comment: six pages, new primal heuristic in SCIP, mixed integer linear optimization

Community resilience refers to the ability to prepare for, absorb, recover from, and adapt to disruptive events, but specific definitions and measures for resilience can vary widely from researcher to researcher or from discipline to discipline. Community resilience is often measured using a set of indicators based on census, socioeconomic, and community organizational data, but these metrics and measures for community resilience provide little guidance for policymakers to determine how best to increase the community resilience. This article proposes to measure community resilience based on value focused thinking. We propose an objectives hierarchy that begins with a community decision makers' fundamental objective for resilience. Six high level objectives for community resilience, including social resilience, economic resilience, infrastructure resilience, environmental resilience, availability of resources, and functionality of critical services, are broken down into measurable attributes that focus on specific outcomes that a decision maker would like to achieve if a disruption occurs. This new way of assessing resilience is applied to measure the resilience of an illustrative community to an improvised explosive device, a cyberattack, a tornado, a flood, and a winter storm. Keywords: Community Resilience, Resiliency, Risk Analysis

Rapid advances in the capabilities of large language models (LLMs) have raised widespread concerns regarding their potential for malicious use. Open-weight LLMs present unique challenges, as existing safeguards lack robustness to tampering attacks that modify model weights. For example, recent works have demonstrated that refusal and unlearning safeguards can be trivially removed with a few steps of fine-tuning. These vulnerabilities necessitate new approaches for enabling the safe release of open-weight LLMs. We develop a method, called TAR, for building tamper-resistant safeguards into open-weight LLMs such that adversaries cannot remove the safeguards even after thousands of steps of fine-tuning. In extensive evaluations and red teaming analyses, we find that our method greatly improves tamper-resistance while preserving benign capabilities. Our results demonstrate that tamper-resistance is a tractable problem, opening up a promising new avenue to improve the safety and security of open-weight LLMs., Comment: Website: https://www.tamper-resistant-safeguards.com

Solving linear systems of equations is an important problem in science and engineering. Many quantum algorithms, such as the Harrow-Hassidim-Lloyd (HHL) algorithm (for quantum-gate computers) and the box algorithm (for quantum-annealing machines), have been proposed for solving such systems. The focus of this paper is on improving the efficiency of the box algorithm. The basic principle behind this algorithm is to transform the linear system into a series of quadratic unconstrained binary optimization (QUBO) problems, which are then solved on annealing machines. The computational efficiency of the box algorithm is entirely determined by the number of iterations, which, in turn, depends on the box contraction ratio, typically set to 0.5. Here, we show through theory that a contraction ratio of 0.5 is sub-optimal and that we can achieve a speed-up with a contraction ratio of 0.2. This is confirmed through numerical experiments where a speed-up between $20 \%$ to $60 \%$ is observed when the optimal contraction ratio is used.

Gallium arsenide optical resonators have been identified as platforms for light-matter interactions ranging from optomechanics to quantum electrodynamics involving nonlinear optics. Here, we present a 5-mm-diameter whispering gallery mode resonator made of undoped gallium arsenide. The fabrication was done using single-point diamond turning followed by polishing with diamond solutions of varying grain size. The resulting resonator was optically characterized to have a quality factor of more than a million.

Due to their inherent capabilities of capturing non-local dependencies, Transformer neural networks have quickly been established as the paradigmatic architecture for large language models and image processing. Next to these traditional applications, machine learning methods have also been demonstrated to be versatile tools in the analysis of image-like data of quantum phases of matter, e.g. given snapshots of many-body wave functions obtained in ultracold atom experiments. While local correlation structures in image-like data of physical systems can reliably be detected, identifying phases of matter characterized by global, non-local structures with interpretable machine learning methods remains a challenge. Here, we introduce the correlator Transformer (CoTra), which classifies different phases of matter while at the same time yielding full interpretability in terms of physical correlation functions. The network's underlying structure is a tailored attention mechanism, which learns efficient ways to weigh local and non-local correlations for a successful classification. We demonstrate the versatility of the CoTra by detecting local order in the Heisenberg antiferromagnet, and show that local gauge constraints in one- and two-dimensional lattice gauge theories can be identified. Furthermore, we establish that the CoTra reliably detects non-local structures in images of correlated fermions in momentum space (Cooper pairs) and that it can distinguish percolating from non-percolating images.

The construction of highly coherent x-ray sources has enabled new research opportunities across the scientific landscape. The maximum raw data rate per beamline now exceeds 40 GB/s, posing unprecedented challenges for the online processing and offline storage of the big data. Such challenge is particularly prominent for x-ray photon correlation spectroscopy (XPCS), where real time analyses require simultaneous calculation on all the previously acquired data in the time series. We present a homomorphic compression scheme to effectively reduce the computational time and memory space required for XPCS analysis. Leveraging similarities in the mathematical expression between a matrix-based compression algorithm and the correlation calculation, our approach allows direct operation on the compressed data without their decompression. The lossy compression reduces the computational time by a factor of 10,000, enabling real time calculation of the correlation functions at kHz framerate. Our demonstration of a homomorphic compression of scientific data provides an effective solution to the big data challenge at coherent light sources. Beyond the example shown in this work, the framework can be extended to facilitate real-time operations directly on a compressed data stream for other techniques.

This paper proposes a Conflict-aware Resource-Efficient Decentralized Sequential planner (CREDS) for early wildfire mitigation using multiple heterogeneous Unmanned Aerial Vehicles (UAVs). Multi-UAV wildfire management scenarios are non-stationary, with spatially clustered dynamically spreading fires, potential pop-up fires, and partial observability due to limited UAV numbers and sensing range. The objective of CREDS is to detect and sequentially mitigate all growing fires as Single-UAV Tasks (SUT), minimizing biodiversity loss through rapid UAV intervention and promoting efficient resource utilization by avoiding complex multi-UAV coordination. CREDS employs a three-phased approach, beginning with fire detection using a search algorithm, followed by local trajectory generation using the auction-based Resource-Efficient Decentralized Sequential planner (REDS), incorporating the novel non-stationary cost function, the Deadline-Prioritized Mitigation Cost (DPMC). Finally, a conflict-aware consensus algorithm resolves conflicts to determine a global trajectory for spatiotemporal mitigation. The performance evaluation of the CREDS for partial and full observability conditions with both heterogeneous and homogeneous UAV teams for different fires-to-UAV ratios demonstrates a $100\%$ success rate for ratios up to $4$ and a high success rate for the critical ratio of $5$, outperforming baselines. Heterogeneous UAV teams outperform homogeneous teams in handling heterogeneous deadlines of SUT mitigation. CREDS exhibits scalability and $100\%$ convergence, demonstrating robustness against potential deadlock assignments, enhancing its success rate compared to the baseline approaches.

This paper addresses early wildfire management using a team of UAVs for the mitigation of fires. The early detection and mitigation systems help in alleviating the destruction with reduced resource utilization. A Genetic Algorithm-based Routing and Scheduling with Time constraints (GARST) is proposed to find the shortest schedule route to mitigate the fires as Single UAV Tasks (SUT). The objective of GARST is to compute the route and schedule of the UAVs so that the UAVS reach the assigned fire locations before the fire becomes a Multi UAV Task (MUT) and completely quench the fire using the extinguisher. The fitness function used for the genetic algorithm is the total quench time for mitigation of total fires. The selection, crossover, mutation operators, and elitist strategies collectively ensure the exploration and exploitation of the solution space, maintaining genetic diversity, preventing premature convergence, and preserving high-performing individuals for the effective optimization of solutions. The GARST effectively addresses the challenges posed by the NP-complete problem of routing and scheduling for growing tasks with time constraints. The GARST is able to handle infeasible scenarios effectively, contributing to the overall optimization of the wildfire management system.

NH$_{3}$(ammonia) plays a critical role in the chemistry of star and planet formation, yet uncertainties in its binding energy (BE) values complicate accurate estimates of its abundances. Recent research suggests a multi-binding energy approach, challenging the previous single-value notion. In this work, we use different values of NH$_{3}$ binding energy to examine its effects on the NH$_{3}$ abundances and, consequently, in the early evolution of protostellar cores. Using a gas-grain chemical network, we systematically vary the values of NH$_{3}$ binding energies in a model Class 0 protostellar core and study the effects of these binding energies on the NH$_{3}$ abundances. Our simulations indicate that abundance profiles of NH$_{3}$ are highly sensitive to the binding energy used, particularly in the warmer inner regions of the core. Higher binding energies lead to lower gas-phase NH$_{3}$ abundances, while lower values of binding energy have the opposite effect. Furthermore, this BE-dependent abundance variation of NH$_{3}$ significantly affects the formation pathways and abundances of key species such as HNC, HCN, and CN. Our tests also reveal that the size variation of the emitting region due to binding energy becomes discernible only with beam sizes of 10 arcsec or less. These findings underscore the importance of considering a range of binding energies in astrochemical models and highlight the need for higher resolution observations to better understand the subtleties of molecular cloud chemistry and star formation processes.

The development of an IT strategy and ensuring that it is the best possible one for business is a key problem many organizations face. This problem is that of linking business architecture to IT architecture in general and application architecture specifically. In our earlier work we proposed Category theory as the formal language to unify the business and IT worlds with the ability to represent the concepts and relations between the two in a unified way. We used rCOS as the underlying model for the specification of interfaces, contracts, and components. The concept of pseudo-category was then utilized to represent the business and application architecture specifications and the relationships contained within. Contracts are used for the specification of both IT and Business architecture components. The linkages between them is now established using the matching of the business component contracts with the application component contracts. Typically, the matching was based on manual process, in this paper we extend the work by considering automated component matching process. In this paper we provide implementation of the matching process using graph matching., Comment: 7 pages, 5 figures. arXiv admin note: substantial text overlap with arXiv:2406.05483

Prompt Tuning has emerged as a prominent research paradigm for adapting vision-language models to various downstream tasks. However, recent research indicates that prompt tuning methods often lead to overfitting due to limited training samples. In this paper, we propose a Cross-modal Aligned Feature Tuning (Craft) method to address this issue. Cross-modal alignment is conducted by first selecting anchors from the alternative domain and deriving relative representations of the embeddings for the selected anchors. Optimizing for a feature alignment loss over anchor-aligned text and image modalities creates a more unified text-image common space. Overfitting in prompt tuning also deteriorates model performance on out-of-distribution samples. To further improve the prompt model's robustness, we propose minimizing Maximum Mean Discrepancy (MMD) over the anchor-aligned feature spaces to mitigate domain shift. The experiment on four different prompt tuning structures consistently shows the improvement of our method, with increases of up to $6.1\%$ in the Base-to-Novel generalization task, $5.8\%$ in the group robustness task, and $2.7\%$ in the out-of-distribution tasks. The code will be available at https://github.com/Jingchensun/Craft, Comment: 15pages

We present new near-ultraviolet (NUV, $\lambda$ = 2479 $-$ 3306 $\r{A}$) transmission spectroscopy of KELT-9b, the hottest known exoplanet, obtained with the Colorado Ultraviolet Transit Experiment ($CUTE$) CubeSat. Two transits were observed on September 28th and September 29th 2022, referred to as Visits 1 and 2 respectively. Using a combined transit and systematics model for each visit, the best-fit broadband NUV light curves are R$_{\text{p}}$/R$_{\star}$ $=$ 0.136$_{0.0146}^{0.0125}$ for Visit 1 and R$_{\text{p}}$/R$_{\star}$ $=$ 0.111$_{0.0190}^{0.0162}$ for Visit 2, appearing an average of 1.54$\times$ larger in the NUV than at optical wavelengths. While the systematics between the two visits vary considerably, the two broadband NUV light curves are consistent with each other. A transmission spectrum with 25 $\r{A}$ bins suggests a general trend of excess absorption in the NUV, consistent with expectations for ultra-hot Jupiters. Although we see an extended atmosphere in the NUV, the reduced data lack the sensitivity to probe individual spectral lines.

Optical beams and starlight distorted by atmospheric turbulence can be corrected with adaptive optics systems to enable efficient coupling into single-mode fibers. Deformable mirrors, used to flatten the wavefront in astronomical telescopes, are costly, sensitive, and complex mechanical components that require careful calibration to enable high-quality imaging in astronomy, microscopy, and vision science. They are also impractical to deploy in large numbers for non-imaging applications like free-space optical communication. Here, we propose a photonic integrated c rcuit capable of spatially sampling the wavefront collected by the telescope and co-phasing the subapertures to maximize the flux delivered to an output single-mode fiber as the integrated photonic implementation of a deformable mirror. We present the results of end-to-end simulations to quantify the performance of the proposed photonic solution under varying atmospheric conditions toward realizing an adaptive optics system without a deformable mirror for free-space optical receivers., Comment: 14 pages, 8 figures, 1 table, to be published in Optics Express. Corresponding author: Momen Diab (momen.diab@utoronto.ca)