SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
This research enhances SAR image classifiers of military fighting vehicles by enabling out-of-distribution (OOD) recognition using Relative Mahalanobis Distance (RMD)
Graph neural networks have been shown to achieve excellent performance for several crucial tasks in particle physics, such as charged particle tracking, jet tagging, and clustering. An important domain for the application of these networks is the FGPA-based first layer of real-time data filtering at the CERN Large Hadron Collider, which has strict latency and resource constraints. We discuss how to design distance-weighted graph networks that can be executed with a latency of less than one μs on an FPGA. To do so, we consider a representative task associated to particle reconstruction and identification in a next-generation calorimeter operating at a particle collider. We use a graph network architecture developed for such purposes, and apply additional simplifications to match the computing constraints of Level-1 trigger systems, including weight quantization. Using the hls4ml library, we convert the compressed models into firmware to be implemented on an FPGA. Performance of the synthesized models is presented both in terms of inference accuracy and resource usage.
With the advent of surveys containing millions to billions of galaxies, it is imperative to develop analysis techniques that utilize the available statistical power. In galaxy clustering, even small sample contamination arising from distance uncertainties can lead to large artifacts, which the standard estimator for two-point correlation functions does not account for. We first introduce a formalism, termed decontamination, that corrects for sample contamination by utilizing the observed cross-correlations in the contaminated samples; this corrects any correlation function estimator for contamination. Using this formalism, we present a new estimator that uses the standard estimator to measure correlation functions in the contaminated samples but then corrects for contamination. We also introduce a weighted estimator that assigns each galaxy a weight in each redshift bin based on its probability of being in that bin. We demonstrate that these estimators effectively recover the true correlation functions and their covariance matrices. Our estimators can correct for sample contamination caused by misclassification between object types as well as photometric redshifts; they should be particularly helpful for studies of galaxy evolution and baryonic acoustic oscillations, where forward modeling the clustering signal using the contaminated redshift distribution is undesirable.
In the next decade, transient searches from the Vera C. Rubin Observatory and the Nancy Grace Roman Space Telescope will increase the sample of known Type Ia supernovae (SNe Ia) from ~10 3 to 10 5 . With this reduction of statistical uncertainties on cosmological measurements, new methods are needed to reduce systematic uncertainties. Here, characterizing the underlying spectroscopic evolution of SN Ia remains a major systematic uncertainty in current cosmological analyses, motivating a new simulation tool for the next era of SN Ia cosmology: Build Your Own Spectral Energy Distribution (byosed). byosed is used within the SNANA framework to simulate light curves by applying spectral variations to model SEDs, enabling flexible testing of possible systematic shifts in SN Ia distance measurements. We test the framework by comparing a nominal Roman SN Ia survey simulation using a baseline SED model to simulations using SEDs perturbed with byosed, and investigating the impact of ignoring specific SED features in the analysis. These features include semiempirical models of two possible, predicted relationships: between SN ejecta velocity and light-curve observables, and a redshift-dependent relationship between SN Hubble residuals and host-galaxy mass. We analyze each byosed simulation using the SALT2 and BEAMS with Bias Corrections framework, and estimate changes in the measured value of the dark-energy equation-of-state parameter, w. We find a difference of Δw = –0.023 for SN velocity and Δw = 0.021 for redshift-evolving host mass when compared to simulations without these features. By using byosed for SN Ia cosmology simulations, future analyses (e.g., the Rubin and Roman SN Ia samples) will have greater flexibility to constrain or reduce such SN Ia modeling uncertainties.
We present optical and near-infrared (NIR, Y-, J-, H-band) observations of 42 Type Ia supernovae (SNe Ia) discovered by the untargeted intermediate Palomar Transient Factory survey. This new data set covers a broad range of redshifts and host galaxy stellar masses, compared to previous SN Ia efforts in the NIR. We construct a sample, using also literature data at optical and NIR wavelengths, to examine claimed correlations between the host stellar masses and the Hubble diagram residuals. The SN magnitudes are corrected for host galaxy extinction using either a global total-to-selective extinction ratio, R V = 2.0, for all SNe, or a best-fit R V for each SN individually. Unlike previous studies that were based on a narrower range in host stellar mass, we do not find evidence for a "mass step," between the color- and stretch-corrected peak J and H magnitudes for galaxies below and above $\mathrm{log}({M}_{* }/{M}_{\odot })=10$. However, the mass step remains significant (3σ) at optical wavelengths (g, r, i) when using a global R V , but vanishes when each SN is corrected using their individual best-fit R V . Our study confirms the benefits of the NIR SN Ia distance estimates, as these are largely exempted from the empirical corrections dominating the systematic uncertainties in the optical.
The subgraph matching problem is a fundamental problem in graph theory that is known to be NP-complete. In this study, performers were asked to develop algorithms to search for semantic property graphs that were subgraphs of a large knowledge graph. The templates provided contained structural information about the subgraphs and some attributes for each node and edge. There also exists a similarity measure between a set of attribute values that occurs on every node and edge. Algorithms performed well in the case where an exact match existed, but performers were also provided templates that had noise added such that there existed no match in the knowledge graph. Performers were asked to find the closest matches to those noisy subgraphs. To evaluate performance on this task, we developed a version of the graph edit distance algorithm to measure the cost of editing the template graph so that it is isomorphic in structure and attributes to the performer submission.
An improved long-range facial recognition system is provided. The facial recognition system includes an integrated, rifle-like mounting platform with modular and interchangeable components, including a machine-vision camera, a facial recognition module, and an aiming scope. The mounting platform includes an elongated frame, a hand grip, a shoulder stock, and an underbody support attachment for an optional bipod. The mounting platform provides an intuitive, shoulder-operated support structure for stabilizing the machine-vision camera and reducing vibrations that otherwise inhibit long distance imaging.
Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes. In this paper, we present a linear time decoder for the recent quantum Tanner codes construction of asymptotically good qLDPC codes, which can correct all errors of weight up to a constant fraction of the blocklength. Our decoder is an iterative algorithm which searches for corrections within constant-sized regions. At each step, the corrections are found by reducing a locally defined and efficiently computable cost function which serves as a proxy for the weight of the remaining error.
Our goal is to teach a robot to walk in an energy efficient way. Inspired by nature [1], we create a reinforcement learning method that balances distance traveled and energy consumption, which we call “utility.” Further, each step is symmetric to ensure equal strides while walking straight. We achieve our goal by rewarding decisions that lead to the best utility over several training iterations.
We calibrate the Tully-Fisher relation (TFR) using observations of spiral galaxies taken during the first year (DR1) of the DESI galaxy redshift survey. The rotational velocities of 10,262 galaxies are measured at 0.4 R26 by comparing the redshifts at 0.4 R26 with those at the galaxy centers of spatially-resolved galaxies targeted as part of the DESI Peculiar Velocity Survey. The DESI DR1 TFR slope is calibrated by separating the spiral galaxies into redshift bins of width dz = 0.005 from 0.03 < z < 0.1 and jointly fitting the TFR across all bins. We find a slope of -7.22+/-0.01 AB mag in the r-band for the TFR, with an intrinsic scatter of 0.466+/-0.001 AB mag. We present a catalog of the distances and peculiar velocities to these 10,262 galaxies using our calibrated TFR. For cosmological analyses, we also present a clustering catalog and associated random catalogs using a subset of 6807 of the DESI DR1 TF galaxies.
The Biometric Recognition and Identification at Altitude and Range (BRIAR) program aims to extend biometric capabilities into severe operational environments characterized by long ranges, atmospheric turbulence, and elevated viewpoints. This paper introduces the program’s two final government collections expanding activities, environments, viewpoints, distances, and modalities, and adding appearance and environmental stressors. We refine curation/evaluation and include sequestered subsets to support controlled assessments. These updates strengthen BRIAR as a comprehensive resource for whole-body, face, and gait recognition at altitude and range, while maintaining privacy-first practices.
A progress report is provided.
We present part 2 of the sixth and final Data Release (DR6) of the Radial Velocity Experiment (Rave), a magnitude-limited (9<I<12) spectroscopic survey of Galactic stars randomly selected in Earth’s southern hemisphere. The Rave medium-resolution spectra (R ∼ 7500) cover the Ca triplet region (8410–8795 Å) and span the complete time frame from the start of Rave observations on 2003 April 12 to their completion on 2013 April 4. In the second of two publications, we present the data products derived from 518,387 observations of 451,783 unique stars using a suite of advanced reduction pipelines focusing on stellar atmospheric parameters, in particular purely spectroscopically derived stellar atmospheric parameters (T{sub eff}, logg, and the overall metallicity), enhanced stellar atmospheric parameters inferred via a Bayesian pipeline using Gaia DR2 astrometric priors, and asteroseismically calibrated stellar atmospheric parameters for giant stars based on asteroseismic observations for 699 K2 stars. In addition, we provide abundances of the elements Fe, Al, and Ni, as well as an overall [α/Fe] ratio obtained using a new pipeline based on the GAUGUIN optimization method that is able to deal with variable signal-to-noise ratios. The Rave DR6 catalogs are cross-matched with relevant astrometric and photometric catalogs, and are complemented by orbital parameters and effective temperatures based on the infrared flux method. The data can be accessed via the Rave website (http://rave-survey.org) or the Vizier database.
We formulate the basic points of the pseudo-PDF approach to the lattice calculation of polarized gluon PDFs. We present the results of our calculations of the one-loop corrections for the bilocal G μα (z)G~ λβ (0) correlator of gluonic fields. Expressions are given for a general situation when all four indices are arbitrary, and also for specific combinations of indices corresponding to three matrix elements that contain the twist-2 invariant amplitude related to the polarized PDF. We study the evolution properties of these matrix elements, and derive matching relations between Euclidean and light-cone Ioffe-time distributions. These relations are necessary for extraction of the polarized gluon distributions from the lattice data.
Lattice QCD offers the possibility of computing parton distributions from first principles, although not in the usual $\overline{MS}$ factorization scheme. Calculations are therefore matched to $\overline{MS}$ using a perturbative procedure which is the source of significant uncertainty within the currently accessible kinematics. We present the possibility of computing the z 2 evolution of non-singlet pseudo-parton distribution functions within the short factorization scheme in a numerically improvable way. The goal is to have tools to evolve a calculation to a scale where perturbative uncertainties are less pronounced. We compare a numerical extraction of the evolution operator from lattice data to the computation of z 2 dependence in perturbation theory. Finally, we discuss how this numerical work may be extended to address the two-scale problem that arises when the Ioffe time range must be made large to extend the reach of the calculation of the pseudo-PDF to smaller values of the momentum fraction.
How can one fully harness the power of physics encoded in relativistic N-body phase space? Topologically, phase space is isomorphic to the product space of a simplex and a hypersphere and can be equipped with explicit coordinates and a Riemannian metric. This natural structure that scaffolds the space on which all collider physics events live opens up new directions for machine learning applications and implementation. Here we present a detailed construction of the phase space manifold and its differential line element, identifying particle ordering prescriptions that ensure that the metric satisfies necessary properties. We apply the phase space metric to several binary classification tasks, including discrimination of high-multiplicity resonance decays or boosted hadronic decays of electroweak bosons from QCD processes, and demonstrate powerful performance on simulated data. Our work demonstrates the many benefits of promoting phase space from merely a background on which calculations take place to being geometrically entwined with a theory’s dynamics.
Not provided.