Search

We introduce Edify 3D, an advanced solution designed for high-quality 3D asset generation. Our method first synthesizes RGB and surface normal images of the described object at multiple viewpoints using a diffusion model. The multi-view observations are then used to reconstruct the shape, texture, and PBR materials of the object. Our method can generate high-quality 3D assets with detailed geometry, clean shape topologies, high-resolution textures, and materials within 2 minutes of runtime., Comment: Project website: https://research.nvidia.com/labs/dir/edify-3d

We introduce Edify Image, a family of diffusion models capable of generating photorealistic image content with pixel-perfect accuracy. Edify Image utilizes cascaded pixel-space diffusion models trained using a novel Laplacian diffusion process, in which image signals at different frequency bands are attenuated at varying rates. Edify Image supports a wide range of applications, including text-to-image synthesis, 4K upsampling, ControlNets, 360 HDR panorama generation, and finetuning for image customization.

We present results of a comprehensive analysis of the polarization characteristics of GRB 200503A and GRB 201009A observed with the Cadmium Zinc Telluride Imager (CZTI) on board AstroSat. Despite these GRBs being reasonably bright, they were missed by several spacecraft and had thus far not been localized well, hindering polarization analysis. We present positions of these bursts obtained from the Inter-Planetary Network (IPN) and the newly developed CZTI localization pipeline. We then undertook polarization analyses using the standard CZTI pipeline. We cannot constrain the polarization properties for GRB 200503A, but find that GRB 201009A has a high degree of polarization.

Recognition of features in satellite imagery (forests, swimming pools, etc.) depends strongly on the spatial scale of the concept and therefore the resolution of the images. This poses two challenges: Which resolution is best suited for recognizing a given concept, and where and when should the costlier higher-resolution (HR) imagery be acquired? We present a novel scheme to address these challenges by introducing three components: (1) A technique to distill knowledge from models trained on HR imagery to recognition models that operate on imagery of lower resolution (LR), (2) a sampling strategy for HR imagery based on model disagreement, and (3) an LLM-based approach for inferring concept "scale". With these components we present a system to efficiently perform scale-aware recognition in satellite imagery, improving accuracy over single-scale inference while following budget constraints. Our novel approach offers up to a 26.3% improvement over entirely HR baselines, using 76.3% fewer HR images., Comment: 15,4

Clouds in satellite imagery pose a significant challenge for downstream applications. A major challenge in current cloud removal research is the absence of a comprehensive benchmark and a sufficiently large and diverse training dataset. To address this problem, we introduce the largest public dataset -- $\textit{AllClear}$ for cloud removal, featuring 23,742 globally distributed regions of interest (ROIs) with diverse land-use patterns, comprising 4 million images in total. Each ROI includes complete temporal captures from the year 2022, with (1) multi-spectral optical imagery from Sentinel-2 and Landsat 8/9, (2) synthetic aperture radar (SAR) imagery from Sentinel-1, and (3) auxiliary remote sensing products such as cloud masks and land cover maps. We validate the effectiveness of our dataset by benchmarking performance, demonstrating the scaling law -- the PSNR rises from $28.47$ to $33.87$ with $30\times$ more data, and conducting ablation studies on the temporal length and the importance of individual modalities. This dataset aims to provide comprehensive coverage of the Earth's surface and promote better cloud removal results., Comment: Accepted at NeurIPS 2024 Datasets and Benchmarks Track. Code and data available at https://allclear.cs.cornell.edu/

The prompt spectra of gamma-ray bursts are known to follow broadband continuum behavior over decades in energy. GRB 221009A, given the moniker the brightest of all time (BOAT), is the brightest gamma-ray burst identified in half a century of observations, and was first identified by the Fermi Gamma-ray Burst Monitor (GBM). On behalf of the Fermi-GBM Team, Lesage et al. (2023) described the initial GBM analysis. Ravasio et al. (2024) report the identification of a spectral line in part of the prompt emission of this burst, which they describe as evolving over 80 s from $\sim$12 MeV to 6 MeV. We report a GBM Team analysis on the Ravasio Line: 1) We cannot identify an instrumental effect that could have produced this signal, and 2) our method of calculating the statistical significance of the line shows it easily exceeds the 5$\sigma$ discovery threshold. We additionally comment on the claim of the line beginning at earlier time intervals, up to 37 MeV, as reported in Zhang et al. (2024). We find that it is reasonable to utilize these measurements for characterization of the line evolution, with caution. We encourage theoretical studies exploring this newly discovered gamma-ray burst spectral feature, unless any rigorous alternative explanation unrelated to the emission from GRB 221009A is identified.

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.

Aerosol effects on climate, weather, and air quality depend on characteristics of individual particles, which are tremendously diverse and change in time. Particle-resolved models are the only models able to capture this diversity in particle physiochemical properties, and these models are computationally expensive. As a strategy for accelerating particle-resolved microphysics models, we introduce Graph-based Learning of Aerosol Dynamics (GLAD) and use this model to train a surrogate of the particle-resolved model PartMC-MOSAIC. GLAD implements a Graph Network-based Simulator (GNS), a machine learning framework that has been used to simulate particle-based fluid dynamics models. In GLAD, each particle is represented as a node in a graph, and the evolution of the particle population over time is simulated through learned message passing. We demonstrate our GNS approach on a simple aerosol system that includes condensation of sulfuric acid onto particles composed of sulfate, black carbon, organic carbon, and water. A graph with particles as nodes is constructed, and a graph neural network (GNN) is then trained using the model output from PartMC-MOSAIC. The trained GNN can then be used for simulating and predicting aerosol dynamics over time. Results demonstrate the framework's ability to accurately learn chemical dynamics and generalize across different scenarios, achieving efficient training and prediction times. We evaluate the performance across three scenarios, highlighting the framework's robustness and adaptability in modeling aerosol microphysics and chemistry.

Business Process Management (BPM) is mostly centered around finding technical solutions. Nudging is an approach from psychology and behavioral economics to guide people's behavior. In this paper, we show how nudging can be integrated into the different phases of the BPM lifecycle. Further, we outline how nudging can be an alternative strategy for more sustainable business processes. We show how the integration of nudging offers significant opportunities for process mining and business process management in general to be more human-centric. We also discuss challenges that come with the adoption of nudging.

We present a complete analysis of Fermi Large Area Telescope (LAT) data of GRB 221009A, the brightest Gamma-Ray Burst (GRB) ever detected. The burst emission above 30 MeV detected by the LAT preceded by 1 s the low-energy (< 10 MeV) pulse that triggered the Fermi Gamma-Ray Burst Monitor (GBM), as has been observed in other GRBs. The prompt phase of GRB 221009A lasted a few hundred seconds. It was so bright that we identify a Bad Time Interval (BTI) of 64 seconds caused by the extremely high flux of hard X-rays and soft gamma rays, during which the event reconstruction efficiency was poor and the dead time fraction quite high. The late-time emission decayed as a power law, but the extrapolation of the late-time emission during the first 450 seconds suggests that the afterglow started during the prompt emission. We also found that high-energy events observed by the LAT are incompatible with synchrotron origin, and, during the prompt emission, are more likely related to an extra component identified as synchrotron self-Compton (SSC). A remarkable 400 GeV photon, detected by the LAT 33 ks after the GBM trigger and directionally consistent with the location of GRB 221009A, is hard to explain as a product of SSC or TeV electromagnetic cascades, and the process responsible for its origin is uncertain. Because of its proximity and energetic nature, GRB 221009A is an extremely rare event., Comment: 60 pages, 38 figures, 9 tables

Quality of health is greatly impacted by the quality of measurement, hence active monitoring of patient's vitals status greatly affects recovery and improves prognosis. In this paper, we proposed an IoT health based monitoring system which comprises of a wearable wristband mounted on the patient wrist to eliminate the concept of patient's being static. The wearable wristband composed of a digital temperature sensor and a pulse rate sensor can remotely monitor health status and utilizing Thingspeak result viewed via a web app or delivered on a smartphone to a specialist who is in a remote location. In order to achieve high accuracy in readings, the signal measured from the pulse rate sensor was passed through a two stage Hp-Lp circuit to eliminate DC offset and noise. In addition, a scaling factor of 10.41909 was formulated and used to convert the digital output from the pulse rate sensor into a more accurate representation of the patient heat rate readings. The results displayed by the proposed system proved the system to be well suited and reliable for healthcare monitoring., Comment: Online: ISSN 2645-2960

With the ubiquitous use of document corpora for question answering, one important aspect which is especially relevant for technical documents is the ability to extract information from tables which are interspersed with text. The major challenge in this is that unlike free-flow text or isolated set of tables, the representation of a table in terms of what is a relevant chunk is not obvious. We conduct a series of experiments examining various representations of tabular data interspersed with text to understand the relative benefits of different representations. We choose a corpus of $3^{rd}$ Generation Partnership Project (3GPP) documents since they are heavily interspersed with tables. We create expert curated dataset of question answers to evaluate our approach. We conclude that row level representations with corresponding table header information being included in every cell improves the performance of the retrieval, thus leveraging the structural information present in the tabular data., Comment: 10 pages, 4 figures, 2 tables

Let $A$ be an $m\times m$ complex matrix and let $\lambda _1, \lambda _2, \ldots , \lambda _m$ be the eigenvalues of $A$ arranged such that $|\lambda _1|\geq |\lambda _2|\geq \cdots \geq |\lambda _m|$ and for $n\geq 1,$ let $s^{(n)}_1\geq s^{(n)}_2\geq \cdots \geq s^{(n)}_m$ be the singular values of $A^n$. Then a famous theorem of Yamamoto (1967) states that $$\lim _{n\to \infty}(s^{(n)}_j )^{\frac{1}{n}}= |\lambda _j|, ~~\forall \,1\leq j\leq m.$$ Recently S. Nayak strengthened this result very significantly by showing that the sequence of matrices $|A^n|^{\frac{1}{n}}$ itself converges to a positive matrix $B$ whose eigenvalues are $|\lambda _1|,|\lambda _2|,$ $\ldots , |\lambda _m|.$ Here this theorem has been extended to arbitrary compact operators on infinite dimensional complex separable Hilbert spaces. The proof makes use of Nayak's theorem, Stone-Weirstrass theorem, Borel-Caratheodory theorem and some technical results of Anselone and Palmer on collectively compact operators. Simple examples show that the result does not hold for general bounded operators., Comment: 14 Pages

We prove a Hankel-variant commutant lifting theorem. This also uncovers the complete structure of the Beurling-type reducing and invariant subspaces of Hankel operators. Kernel spaces of Hankel operators play a key role in the analysis., Comment: 18 pages. Revised

Electron backscatter diffraction (EBSD) patterns can exhibit Kikuchi bands with inverted contrast due to anomalous absorption. This can be observed, for example, on samples with nanoscale topography, in case of a low tilt backscattering geometry, or for transmission Kikuchi diffraction (TKD) on thicker samples. Three examples are discussed where contrast-inverted physics-based simulated master patterns have been applied to find the correct crystal orientation. As the first EBSD example, self-assembled gold nanostructures made of Au fcc and Au hcp phases on single-crystal germanium were investigated. Gold covered about 12% of the mapped area, with only two-thirds being successfully interpreted using standard Hough-based indexing. The remaining third was solved by brute force indexing using a contrast-inverted master pattern. The second EBSD example deals with maps collected at a non-tilted surface instead of the commonly used 70 degree tilted one. As TKD example, a jet-polished foil made of duplex stainless steel 2205 was examined. The thin part close to the hole edge producing normal-contrast patterns were standard indexed. The areas of the foil that become thicker with increasing distance from the edge of the hole produce contrast-inverted patterns. They covered three times the evaluable area and were successfully processed using the contrast-inverted master pattern. In the last example, inverted patterns collected at a non-tiled sample were mathematically inverted to normal contrast, and Hough/Radon-based indexing was successfully applied.

Graphical models have found widespread applications in many areas of modern statistics and machine learning. Iterative Proportional Fitting (IPF) and its variants have become the default method for undirected graphical model estimation, and are thus ubiquitous in the field. As the IPF is an iterative approach, it is not always readily scalable to modern high-dimensional data regimes. In this paper we propose a novel and fast non-iterative method for positive definite graphical model estimation in high dimensions, one that directly addresses the shortcomings of IPF and its variants. In addition, the proposed method has a number of other attractive properties. First, we show formally that as the dimension p grows, the proportion of graphs for which the proposed method will outperform the state-of-the-art in terms of computational complexity and performance tends to 1, affirming its efficacy in modern settings. Second, the proposed approach can be readily combined with scalable non-iterative thresholding-based methods for high-dimensional sparsity selection. Third, the proposed method has high-dimensional statistical guarantees. Moreover, our numerical experiments also show that the proposed method achieves scalability without compromising on statistical precision. Fourth, unlike the IPF, which depends on the Gaussian likelihood, the proposed method is much more robust.

Advancements in high-computing devices increase the necessity for improved and new understanding and development of smart manufacturing factories. Discrete-event models with simulators have been shown to be critical to architect, designing, building, and operating the manufacturing of semiconductor chips. The diffusion, implantation, and lithography machines have intricate processes due to their feedforward and feedback connectivity. The dataset collected from simulations of the factory models holds the promise of generating valuable machine-learning models. As surrogate data-based models, their executions are highly efficient compared to the physics-based counterpart models. For the development of surrogate models, it is beneficial to have publicly available benchmark simulation models that are grounded in factory models that have concise structures and accurate behaviors. Hence, in this research, a dataset is devised and constructed based on a benchmark model of an Intel semiconductor fabrication factory. The model is formalized using the Parallel Discrete-Event System Specification and executed using the DEVS-Suite simulator. The time series dataset is constructed using discrete-event time trajectories. This dataset is further analyzed and used to develop baseline univariate and multivariate machine learning models. The dataset can also be utilized in the machine learning community for behavioral analysis based on formalized and scalable component-based discrete-event models and simulations.

It is essential to precisely determine the evolving concentrations of radioactive nuclides within transmutation problems. It is also a crucial aspect of nuclear physics with widespread applications in nuclear waste management and energy production. This paper introduces CNUCTRAN, a novel computer program that employs a probabilistic approach to estimate nuclide concentrations in transmutation problems. CNUCTRAN directly simulates nuclei transformations arising from various nuclear reactions, diverging from the traditional deterministic methods that solve the Bateman equation using matrix exponential approximation. This approach effectively addresses numerical challenges associated with solving the Bateman equations, therefore, circumventing the need for matrix exponential approximations that risk producing nonphysical concentrations. Our sample calculations using CNUCTRAN shows that the concentration predictions of CNUCTRAN have a relative error of less than 0.001% compared to the state-of-the-art method, CRAM, in different test cases. This makes CNUCTRAN a valuable alternative tool for transmutation analysis

The safety of Large Language Models (LLMs) remains a critical concern due to a lack of adequate benchmarks for systematically evaluating their ability to resist generating harmful content. Previous efforts towards automated red teaming involve static or templated sets of illicit requests and adversarial prompts which have limited utility given jailbreak attacks' evolving and composable nature. We propose a novel dynamic benchmark of composable jailbreak attacks to move beyond static datasets and taxonomies of attacks and harms. Our approach consists of three components collectively called h4rm3l: (1) a domain-specific language that formally expresses jailbreak attacks as compositions of parameterized prompt transformation primitives, (2) bandit-based few-shot program synthesis algorithms that generate novel attacks optimized to penetrate the safety filters of a target black box LLM, and (3) open-source automated red-teaming software employing the previous two components. We use h4rm3l to generate a dataset of 2656 successful novel jailbreak attacks targeting 6 state-of-the-art (SOTA) open-source and proprietary LLMs. Several of our synthesized attacks are more effective than previously reported ones, with Attack Success Rates exceeding 90% on SOTA closed language models such as claude-3-haiku and GPT4-o. By generating datasets of jailbreak attacks in a unified formal representation, h4rm3l enables reproducible benchmarking and automated red-teaming, contributes to understanding LLM safety limitations, and supports the development of robust defenses in an increasingly LLM-integrated world. Warning: This paper and related research artifacts contain offensive and potentially disturbing prompts and model-generated content.

Teaching Computer Science (CS) by having students write programs by hand on paper has key pedagogical advantages: It allows focused learning and requires careful thinking compared to the use of Integrated Development Environments (IDEs) with intelligent support tools or "just trying things out". The familiar environment of pens and paper also lessens the cognitive load of students with no prior experience with computers, for whom the mere basic usage of computers can be intimidating. Finally, this teaching approach opens learning opportunities to students with limited access to computers. However, a key obstacle is the current lack of teaching methods and support software for working with and running handwritten programs. Optical character recognition (OCR) of handwritten code is challenging: Minor OCR errors, perhaps due to varied handwriting styles, easily make code not run, and recognizing indentation is crucial for languages like Python but is difficult to do due to inconsistent horizontal spacing in handwriting. Our approach integrates two innovative methods. The first combines OCR with an indentation recognition module and a language model designed for post-OCR error correction without introducing hallucinations. This method, to our knowledge, surpasses all existing systems in handwritten code recognition. It reduces error from 30\% in the state of the art to 5\% with minimal hallucination of logical fixes to student programs. The second method leverages a multimodal language model to recognize handwritten programs in an end-to-end fashion. We hope this contribution can stimulate further pedagogical research and contribute to the goal of making CS education universally accessible. We release a dataset of handwritten programs and code to support future research at https://github.com/mdoumbouya/codeocr

Business process management (BPM) has been widely used to discover, model, analyze, and optimize organizational processes. BPM looks at these processes with analysis techniques that assume a clearly defined start and end. However, not all processes adhere to this logic, with the consequence that their behavior cannot be appropriately captured by BPM analysis techniques. This paper addresses this research problem at a conceptual level. More specifically, we introduce the notion of vitalizing business processes that target the lifecycle process of one or more entities. We show the existence of lifecycle processes in many industries and that their appropriate conceptualizations pave the way for the definition of suitable modeling and analysis techniques. This paper provides a set of requirements for their analysis, and a conceptualization of lifecycle and vitalizing processes.

Precise phase control of microwaves and millimeter waves is critical for today's wireless communication and signal processing electronics. For decades, achieving even modest phase-shifting resolution has demanded a complex mix of transistor switches and passive electromagnetic structures. These true-phase delay, true-time-delay or quasi-true-time-delay circuits operate near resonances that heavily attenuate and distort signals, limiting transmission bandwidth. Despite numerous attempts, passive phase shifters have remained lossy and incompatible with high-channel-capacity beamforming, irrespective of the semiconductor fabrication process. In this article, we introduce a mechanism whereby waveguide reflectors based on coupled resonances can be reprogrammed to evade loss. Central to their operation is that loss from internal resonances is confined to low frequencies, while at high frequencies, their reflectivity is maximized and broadband phase variations, induced by those resonances, still persist. Since performance in the low-loss post-resonance spectrum is largely agnostic to the number of switches, ultra-fine digital tuning is possible. This breaks the historical tradeoff between loss and precision to achieve resolution surpassing state-of-the-art integrated circuits by over three orders (bits) of magnitude. The device does not distort the transmitted signal and consumes no power. Moreover, the chip occupies a sub-wavelength footprint in a Complementary Metal Oxide Semiconductor platform. This makes it an optimal candidate for seamless integration in on-chip multi-gigabit data links, radio astronomy transceivers and control hardware for millimeter-wave qubits., Comment: 12 main article pages, 4 main figures, 4 extended figures, 15 Supplementary information pages

Large language models (LLMs) are playing a pivotal role in deploying strategic use cases across a range of organizations, from large pan-continental companies to emerging startups. The issues and challenges involved in the successful utilization of LLMs can vary significantly depending on the size of the organization. It is important to study and discuss these pertinent issues of LLM adaptation with a focus on the scale of the industrial concerns and brainstorm possible solutions and prospective directions. Such a study has not been prominently featured in the current research literature. In this study, we adopt a threefold strategy: first, we conduct a case study with industry practitioners to formulate the key research questions; second, we examine existing industrial publications to address these questions; and finally, we provide a practical guide for industries to utilize LLMs more efficiently., Comment: 17 pages, 3 figures

Retrieval Augmented Generation (RAG) is widely used to enable Large Language Models (LLMs) perform Question Answering (QA) tasks in various domains. However, RAG based on open-source LLM for specialized domains has challenges of evaluating generated responses. A popular framework in the literature is the RAG Assessment (RAGAS), a publicly available library which uses LLMs for evaluation. One disadvantage of RAGAS is the lack of details of derivation of numerical value of the evaluation metrics. One of the outcomes of this work is a modified version of this package for few metrics (faithfulness, context relevance, answer relevance, answer correctness, answer similarity and factual correctness) through which we provide the intermediate outputs of the prompts by using any LLMs. Next, we analyse the expert evaluations of the output of the modified RAGAS package and observe the challenges of using it in the telecom domain. We also study the effect of the metrics under correct vs. wrong retrieval and observe that few of the metrics have higher values for correct retrieval. We also study for differences in metrics between base embeddings and those domain adapted via pre-training and fine-tuning. Finally, we comment on the suitability and challenges of using these metrics for in-the-wild telecom QA task., Comment: Accepted for publication in ICML 2024 Workshop on Foundation Models in the Wild

Magnetic switchbacks are of continuing interest to the scientific community due to the fact that the phenomenon has not been completely understood. Although most of the research into them in the Parker Solar Probe era has largely focused on creating a theoretical framework for causing the field reversal through magnetic interchange reconnection, reconnecting streams of plasma in the solar wind, or shear driven turbulence, it remains unclear to what extent these models may or may not represent the underlying physical reality of magnetic switchbacks. In this paper, we present the results of our study on the energetic ion composition of magnetic switchback events using statistical methods with the aim of obtaining new insights into the underlying physics. In doing so, we find consistent differences in arrival times of the peak flux of different energetic ion species in magnetic switchbacks which are indicative of switchback formed remotely in the solar corona and propagated outwards in the solar wind. We also find that while the data does not directly contradict a linear interchange reconnection model nor the flux rope driven interchange reconnection model, the structure of the plasma within the switchbacks themselves is reminiscent of reconnection produced plasmoids.

Although recent research suggests a link in support of a model of switchback formation in the solar corona via interchange reconnection that is propagated outward with the solar wind and similarities in their ion composition to plasma instability produced plasmoids, these plasma instabilities have yet to be observationally linked to magnetic switchbacks. In this paper we aim to use the theoretical framework of a twin coronal mass ejection event which is known to include interchange reconnection processes and compare this model with experimental observations using Parker Solar Probe FIELDS and $\isis$ instrumentationof an actual event containing two CMEs identified via the associated solar proton event in order to further test and refine the hypothesis of interchange reconnection as a possible physical origin for the magnetic switchback phenomenon. We also intend to introduce a plasma model for the formation of the switchbacks noted within the CME event.

This study modifies the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) algorithm for multi-modal optimization problems. The enhancements focus on addressing the challenges of multiple global minima, improving the algorithm's ability to maintain diversity and explore complex fitness landscapes. We incorporate niching strategies and dynamic adaptation mechanisms to refine the algorithm's performance in identifying and optimizing multiple global optima. The algorithm generates a population of candidate solutions by sampling from a multivariate normal distribution centered around the current mean vector, with the spread determined by the step size and covariance matrix. Each solution's fitness is evaluated as a weighted sum of its contributions to all global minima, maintaining population diversity and preventing premature convergence. We implemented the algorithm on 8 tunable composite functions for the GECCO 2024 Competition on Benchmarking Niching Methods for Multi-Modal Optimization (MMO), adhering to the competition's benchmarking framework. The results are presenting in many ways such as Peak Ratio, F1 score on various dimensions. They demonstrate the algorithm's robustness and effectiveness in handling both global optimization and MMO- specific challenges, providing a comprehensive solution for complex multi-modal optimization problems., Comment: 15 pages, 1 figure, 16 tables. Submitted for GECCO 2024 competition on Benchmarking Niching Methods for Multimodal Optimization

Widespread air source heat pump (ASHP) adoption faces several challenges that on-site thermal energy storage (TES), particularly thermochemical salt hydrate TES, can mitigate. No techno-economic analyses for salt-hydrate-based TES in residential applications exist. We quantify the residential space heating value of four salt hydrate TES materials - MgSO4, MgCl2, K2CO3, and SrBr2 - coupled with ASHPs across 4,800 representative households in 12 U.S. cities by embedding salt-hydrate-specific Ragone plots into a techno-economic model of coupled ASHP-TES operations. In Detroit, salt hydrate TES is projected to reduce household annual electricity costs by up to $\$$241 (8$\%$). Cost savings from TES can differ by over an order of magnitude between households and salt hydrates. We identify the most promising salt in this study, SrBr2, due to its high energy density and low humidification parasitic load. Break-even capital costs of SrBr2-based TES range from $\$$13/kWh to $\$$17/kWh, making it the only salt hydrate studied to reach and exceed the U.S. Department of Energy's $\$$15/kWh TES cost target. Sensitivities highlight the importance of variable TES sizing and efficiency losses in the value of TES.

A plethora of sentence embedding models makes it challenging to choose one, especially for domains such as telecom, rich with specialized vocabulary. We evaluate multiple embeddings obtained from publicly available models and their domain-adapted variants, on both point retrieval accuracies as well as their (95\%) confidence intervals. We establish a systematic method to obtain thresholds for similarity scores for different embeddings. We observe that fine-tuning improves mean bootstrapped accuracies as well as tightens confidence intervals. The pre-training combined with fine-tuning makes confidence intervals even tighter. To understand these variations, we analyse and report significant correlations between the distributional overlap between top-$K$, correct and random sentence similarities with retrieval accuracies and similarity thresholds. Following current literature, we analyze if retrieval accuracy variations can be attributed to isotropy of embeddings. Our conclusions are that isotropy of embeddings (as measured by two independent state-of-the-art isotropy metric definitions) cannot be attributed to better retrieval performance. However, domain adaptation which improves retrieval accuracies also improves isotropy. We establish that domain adaptation moves domain specific embeddings further away from general domain embeddings., Comment: 10 pages, 3 figures, 4 tables

In this article, the molecular permanent electric dipole moments and components of static dipole polarizabilities for the electronic ground state of singly charged aluminum monohalides are reported. The coupled-cluster method by considering single and double excitations (CCSD) together with relativistic Dyall basis sets have been used to carry out these molecular property calculations. The contribution from triple excitations are incorporated through perturbative triples (CCSD(T)). The results from a series of progressively larger basis sets are extrapolated to the complete basis set limit. Further, the role of correlation and relativistic effects, and also the effect of augmentation over the considered basis sets on the valence molecular properties are studied. Our results are compared with those available in the literature., Comment: 13 pages, 8 figures, 6 tables

The quantum-classical hybrid variational quantum eigensolver (VQE) algorithm is among the most actively studied topics in atomic and molecular calculations on quantum computers, yet few studies address properties other than energies or account for relativistic effects. This work presents high-precision 18-qubit relativistic VQE simulations for calculating the permanent electric dipole moments (PDMs) of BeH to RaH molecules on traditional computers, and 6- and 12-qubit PDM computations for SrH on IonQ quantum devices. To achieve high precision on current noisy intermediate scale era quantum hardware, we apply various resource reduction methods, including Reinforcement Learning and causal flow preserving ZX-Calculus routines, along with error mitigation and post-selection techniques. Our approach reduces the two-qubit gate count in our 12-qubit circuit by 99.71%, with only a 2.35% trade-off in precision for PDM when evaluated classically within a suitably chosen active space. On the current generation IonQ Forte-I hardware, the error in PDM is -1.17% relative to classical calculations and only 1.21% compared to the unoptimized circuit.

Adapting electronics to perfectly conform to non-planar and rough surfaces, such as human skin, is a very challenging task which, if solved, could open up new applications in fields of high economic and scientific interest ranging from health to robotics, wearable electronics, human machine interface and Internet of Things. The key to success lies in defining a technology that can lead to the fabrication of ultra-thin devices while exploiting materials that are ultimately thin, with high mechanical flexibility and excellent electrical properties. Here, we report a hybrid approach for the definition of high-performance, ultra-thin and conformable electronic devices and circuits, based on the integration of ultimately thin semiconducting transition metal dichalcogenides (TMDC), i.e., MoS2, with organic gate dielectric material, i.e., polyvinyl formal (PVF) combined with the ink-jet printing of conductive PEDOT:PSS ink for electrodes definition. Through this cost-effective, fully bottom-up and solution-based approach, transistors and simple digital and analogue circuits are fabricated by a sequential stacking of ultrathin (nanometer) layers on a few micron thick polyimide substrate, which guarantees the high flexibility mandatory for the targeted applications.

This article introduces an enhanced particle swarm optimizer (PSO), termed Orthogonal PSO with Mutation (OPSO-m). Initially, it proposes an orthogonal array-based learning approach to cultivate an improved initial swarm for PSO, significantly boosting the adaptability of swarm-based optimization algorithms. The article further presents archive-based self-adaptive learning strategies, dividing the population into regular and elite subgroups. Each subgroup employs distinct learning mechanisms. The regular group utilizes efficient learning schemes derived from three unique archives, which categorize individuals based on their quality levels. Additionally, a mutation strategy is implemented to update the positions of elite individuals. Comparative studies are conducted to assess the effectiveness of these learning strategies in OPSO-m, evaluating its optimization capacity through exploration-exploitation dynamics and population diversity analysis. The proposed OPSO-m model is tested on real-parameter challenges from the CEC 2017 suite in 10, 30, 50, and 100-dimensional search spaces, with its results compared to contemporary state-of-the-art algorithms using a sensitivity metric. OPSO-m exhibits distinguished performance in the precision of solutions, rapidity of convergence, efficiency in search, and robust stability, thus highlighting its superior aptitude for resolving intricate optimization issues.

GW230529 is the first compact binary coalescence detected by the LIGO-Virgo-KAGRA collaboration with at least one component mass confidently in the lower mass-gap, corresponding to the range 3-5$M_{\odot}$. If interpreted as a neutron star-black hole merger, this event has the most symmetric mass ratio detected so far and therefore has a relatively high probability of producing electromagnetic (EM) emission. However, no EM counterpart has been reported. At the merger time $t_0$, Swift-BAT and Fermi-GBM together covered 100$\%$ of the sky. Performing a targeted search in a time window $[t_0-20 \text{s},t_0+20 \text{s}]$, we report no detection by the Swift-BAT and the Fermi-GBM instruments. Combining the position-dependent $\gamma-$ray flux upper limits and the gravitational-wave posterior distribution of luminosity distance, sky localization and inclination angle of the binary, we derive constraints on the characteristic luminosity and structure of the jet possibly launched during the merger. Assuming a top-hat jet structure, we exclude at 90$\%$ credibility the presence of a jet which has at the same time an on-axis isotropic luminosity $\gtrsim 10^{48}$ erg s$^{-1}$, in the bolometric band 1 keV-10 MeV, and a jet opening angle $\gtrsim 15$ deg. Similar constraints are derived testing other assumptions about the jet structure profile. Excluding GRB 170817A, the luminosity upper limits derived here are below the luminosity of any GRB observed so far., Comment: 18 pages, 1 table, 11 figures

Obtaining sufficient information in one's mother tongue is crucial for satisfying the information needs of the users. While high-resource languages have abundant online resources, the situation is less than ideal for very low-resource languages. Moreover, the insufficient reporting of vital national and international events continues to be a worry, especially in languages with scarce resources, like \textbf{Mizo}. In this paper, we conduct a study to investigate the effectiveness of a simple methodology designed to generate a holistic summary for Mizo news articles, which leverages English-language news to supplement and enhance the information related to the corresponding news events. Furthermore, we make available 500 Mizo news articles and corresponding enriched holistic summaries. Human evaluation confirms that our approach significantly enhances the information coverage of Mizo news articles. The mizo dataset and code can be accessed at \url{https://github.com/barvin04/mizo_enrichment, Comment: Accepted at LREC-COLING2024 WILDRE Workshop

Virtual try-on and product personalization have become increasingly important in modern online shopping, highlighting the need for accurate body measurement estimation. Although previous research has advanced in estimating 3D body shapes from RGB images, the task is inherently ambiguous as the observed scale of human subjects in the images depends on two unknown factors: capture distance and body dimensions. This ambiguity is particularly pronounced in partial-view scenarios. To address this challenge, we propose a modular and simple height normalization solution. This solution relocates the subject skeleton to the desired position, thereby normalizing the scale and disentangling the relationship between the two variables. Our experimental results demonstrate that integrating this technique into state-of-the-art human mesh reconstruction models significantly enhances partial body measurement estimation. Additionally, we illustrate the applicability of this approach to multi-view settings, showcasing its versatility., Comment: Accepted to CVPRW 2024 Computer Vision for Fashion, Art, and Design

Uncertainty quantification plays a vital role in facilitating the practical implementation of AI in radiology by addressing growing concerns around trustworthiness. Given the challenges associated with acquiring large, annotated datasets in this field, there is a need for methods that enable uncertainty quantification in small data AI approaches tailored to radiology images. In this study, we focused on uncertainty quantification within the context of the small data evolutionary strategies-based technique of deep neuroevolution (DNE). Specifically, we employed DNE to train a simple Convolutional Neural Network (CNN) with MRI images of the eyes for binary classification. The goal was to distinguish between normal eyes and those with metastatic tumors called choroidal metastases. The training set comprised 18 images with choroidal metastases and 18 without tumors, while the testing set contained a tumor-to-normal ratio of 15:15. We trained CNN model weights via DNE for approximately 40,000 episodes, ultimately reaching a convergence of 100% accuracy on the training set. We saved all models that achieved maximal training set accuracy. Then, by applying these models to the testing set, we established an ensemble method for uncertainty quantification.The saved set of models produced distributions for each testing set image between the two classes of normal and tumor-containing. The relative frequencies permitted uncertainty quantification of model predictions. Intriguingly, we found that subjective features appreciated by human radiologists explained images for which uncertainty was high, highlighting the significance of uncertainty quantification in AI-driven radiological analyses.

We define a new framework that unifies the filtration and mapper approaches from TDA, and present efficient algorithms to compute it. Termed the box filtration of a PCD, we grow boxes (hyperrectangles) that are not necessarily centered at each point (in place of balls centered at points). We grow the boxes non-uniformly and asymmetrically in different dimensions based on the distribution of points. We present two approaches to handle the boxes: a point cover where each point is assigned its own box at start, and a pixel cover that works with a pixelization of the space of the PCD. Any box cover in either setting automatically gives a mapper of the PCD. We show that the persistence diagrams generated by the box filtration using both point and pixel covers satisfy the classical stability based on the Gromov-Hausdorff distance. Using boxes also implies that the box filtration is identical for pairwise or higher order intersections whereas the VR and Cech filtration are not the same. Growth in each dimension is computed by solving a linear program (LP) that optimizes a cost functional balancing the cost of expansion and benefit of including more points in the box. The box filtration algorithm runs in $O(m|U(0)|\log(mn\pi)L(q))$ time, where $m$ is number of steps of increments considered for box growth, $|U(0)|$ is the number of boxes in the initial cover ($\leq$ number of points), $\pi$ is the step length for increasing each box dimension, each LP is solved in $O(L(q))$ time, $n$ is the PCD dimension, and $q = n \times |X|$. We demonstrate through multiple examples that the box filtration can produce more accurate results to summarize the topology of the PCD than VR and distance-to-measure (DTM) filtrations. Software for our implementation is available at https://github.com/pragup/Box-Filteration., Comment: 17 figures

We explore the application of machine learning algorithms specifically to enhance the selection process of Russet potato clones in breeding trials by predicting their suitability for advancement. This study addresses the challenge of efficiently identifying high-yield, disease-resistant, and climate-resilient potato varieties that meet processing industry standards. Leveraging manually collected data from trials in the state of Oregon, we investigate the potential of a wide variety of state-of-the-art binary classification models. The dataset includes 1086 clones, with data on 38 attributes recorded for each clone, focusing on yield, size, appearance, and frying characteristics, with several control varieties planted consistently across four Oregon regions from 2013-2021. We conduct a comprehensive analysis of the dataset that includes preprocessing, feature engineering, and imputation to address missing values. We focus on several key metrics such as accuracy, F1-score, and Matthews correlation coefficient (MCC) for model evaluation. The top-performing models, namely a neural network classifier (Neural Net), histogram-based gradient boosting classifier (HGBC), and a support vector machine classifier (SVM), demonstrate consistent and significant results. To further validate our findings, we conduct a simulation study. By simulating different data-generating scenarios, we assess model robustness and performance through true positive, true negative, false positive, and false negative distributions, area under the receiver operating characteristic curve (AUC-ROC) and MCC. The simulation results highlight that non-linear models like SVM and HGBC consistently show higher AUC-ROC and MCC than logistic regression (LR), thus outperforming the traditional linear model across various distributions, and emphasizing the importance of model selection and tuning in agricultural trials., Comment: Minor revision; to appear in Crop Sciences

The Large Language Models (LLMs) exhibit remarkable ability to generate fluent content across a wide spectrum of user queries. However, this capability has raised concerns regarding misinformation and personal information leakage. In this paper, we present our methods for the SemEval2024 Task8, aiming to detect machine-generated text across various domains in both mono-lingual and multi-lingual contexts. Our study comprehensively analyzes various methods to detect machine-generated text, including statistical, neural, and pre-trained model approaches. We also detail our experimental setup and perform a in-depth error analysis to evaluate the effectiveness of these methods. Our methods obtain an accuracy of 86.9\% on the test set of subtask-A mono and 83.7\% for subtask-B. Furthermore, we also highlight the challenges and essential factors for consideration in future studies., Comment: 8 pages, 1 Figure

Granular flows with solid particles play an important role in energy and catalysis applications. To predict thermal performance, this study develops a comprehensive discrete particle tracking flow model fully coupled with conductive and radiative heat transfer. Leveraging LIGGGHTS, our model uniquely integrates particle-particle and particle-wall thermal radiation for grey radiative surfaces up to nearly 10 times of particle size. Models include: (a) plug flows of particles with a near-constant streamwise velocity and (b) gravity-driven, dense, moving beds of particles to determine wall-to-particle heat-transfer coefficients with isothermal channel walls. The plug flow model is used to interrogate the interdependent effects of flow-regime-dependent solid volume fractions (0.02 -- 0.48), particle size (0.4 -- 1 mm), operating wall temperatures (700 -- 1300 K), and thermophysical particles properties including emissivity (0.1 -- 1) and thermal conductivity (0.16, 33 W/m/K). The overall and conductive heat-transfer coefficients increase with solid volume fraction, while radiation contribution decreases. For a fixed solid volume fraction, heat-transfer coefficients exhibit linear dependence on particle emissivity and cubic dependence on wall temperature, driven by enhanced thermal radiation. For a fixed mass flow rate, the dependence of radiative heat-transfer coefficient on particle size changes with solid volume fraction. To generalize the applicability of our results, heat-transfer coefficients are transformed into a dimensionless Nusselt number, and establish its dependence on solid volume fraction. These results reveal the high sensitivity of the overall Nusselt number to even small changes in solid volume fraction in the dense flow regime, particularly for the high-conductivity alumina particles. In contrast, the radiative Nusselt number asymptotes for large solid volume fractions.

Thermal photons produced in heavy-ion collision experiments are an important observable for understanding quark-gluon plasma (QGP). The thermal photon rate from the QGP at a given temperature can be calculated from the spectral function of the vector current correlator. Extraction of the spectral function from the lattice correlator is known to be an ill-conditioned problem, as there is no unique solution for a spectral function for a given lattice correlator with statistical errors. The vector current correlator, on the other hand, receives a large ultraviolet contribution from the vacuum, which makes the extraction of the thermal photon rate difficult from this channel. We therefore consider the difference between the transverse and longitudinal part of the spectral function, only capturing the thermal contribution to the current correlator, simplifying the reconstruction significantly. The lattice correlator is calculated for light quarks in quenched QCD at $T=470~$MeV ($\sim 1.5\, T_c$), as well as in 2+1 flavor QCD at $T=220~$MeV ($\sim 1.2 \, T_{pc}$) with $m_{\pi}=320$ MeV. In order to quantify the non-perturbative effects, the lattice correlator is compared with the corresponding $\text{NLO}+\text{LPM}^{\text{LO}}$ estimate of correlator. The reconstruction of the spectral function is performed in several different frameworks, ranging from physics-informed models of the spectral function to more general models in the Backus-Gilbert method and Gaussian Process regression. We find that the resulting photon rates agree within errors., Comment: 20 pages, 16 figures

We study the problem of comparing a pair of geometric networks that may not be similarly defined, i.e., when they do not have one-to-one correspondences between their nodes and edges. Our motivating application is to compare power distribution networks of a region. Due to the lack of openly available power network datasets, researchers synthesize realistic networks resembling their actual counterparts. But the synthetic digital twins may vary significantly from one another and from actual networks due to varying underlying assumptions and approaches. Hence the user wants to evaluate the quality of networks in terms of their structural similarity to actual power networks. But the lack of correspondence between the networks renders most standard approaches, e.g., subgraph isomorphism and edit distance, unsuitable. We propose an approach based on the multiscale flat norm, a notion of distance between objects defined in the field of geometric measure theory, to compute the distance between a pair of planar geometric networks. Using a triangulation of the domain containing the input networks, the flat norm distance between two networks at a given scale can be computed by solving a linear program. In addition, this computation automatically identifies the 2D regions (patches) that capture where the two networks are different. We demonstrate through 2D examples that the flat norm distance can capture the variations of inputs more accurately than the commonly used Hausdorff distance. As a notion of stability, we also derive upper bounds on the flat norm distance between a simple 1D curve and its perturbed version as a function of the radius of perturbation for a restricted class of perturbations. We demonstrate our approach on a set of actual power networks from a county in the USA., Comment: A shorter version (with subset of results) appeared in ICCS 2023

We propose a single-shot approach to determining 6-DoF pose of an object with available 3D computer-aided design (CAD) model from a single RGB image. Our method, dubbed MRC-Net, comprises two stages. The first performs pose classification and renders the 3D object in the classified pose. The second stage performs regression to predict fine-grained residual pose within class. Connecting the two stages is a novel multi-scale residual correlation (MRC) layer that captures high-and-low level correspondences between the input image and rendering from first stage. MRC-Net employs a Siamese network with shared weights between both stages to learn embeddings for input and rendered images. To mitigate ambiguity when predicting discrete pose class labels on symmetric objects, we use soft probabilistic labels to define pose class in the first stage. We demonstrate state-of-the-art accuracy, outperforming all competing RGB-based methods on four challenging BOP benchmark datasets: T-LESS, LM-O, YCB-V, and ITODD. Our method is non-iterative and requires no complex post-processing., Comment: Accepted to CVPR 2024

Given a bipartite graph $G(V= (A \cup B),E)$ with $n$ vertices and $m$ edges and a function $b \colon V \to \mathbb{Z}_+$, a $b$-matching is a subset of edges such that every vertex $v \in V$ is incident to at most $b(v)$ edges in the subset. When we are also given edge weights, the Max Weight $b$-Matching problem is to find a $b$-matching of maximum weight, which is a fundamental combinatorial optimization problem with many applications. Extending on the recent work of Zheng and Henzinger (IPCO, 2023) on standard bipartite matching problems, we develop a simple auction algorithm to approximately solve Max Weight $b$-Matching. Specifically, we present a multiplicative auction algorithm that gives a $(1 - \varepsilon)$-approximation in $O(m \varepsilon^{-1} \log \varepsilon^{-1} \log \beta)$ worst case time, where $\beta$ the maximum $b$-value. Although this is a $\log \beta$ factor greater than the current best approximation algorithm by Huang and Pettie (Algorithmica, 2022), it is considerably simpler to present, analyze, and implement., Comment: 14 pages; Accepted as a refereed paper in the 2024 INFORMS Optimization Society conference