Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distance Learning”

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.

At least 163 records · Page 9

Vehicular Re-Identification from Uncontrolled Multiple Views

Vehicle re-identification (re-ID) across disparate sensing modalities remains a fundamental challenge for transportation research. In this work, we introduce a deep multi-view vehicle re-ID framework that leverages Siamese networks to compare pairs of vehicle images and produce matching scores, enabling robust association across drastically different viewpoints such as those from UAVs, surveillance cameras, and ground sensors. The model exploits convolutional neural networks to learn features that remain discriminative under changes in angle, distance, and illumination, supporting more generalizable re-ID performance. As part of this effort, we also developed an automated pipeline to synchronize roadside and UAV video streams, producing a multi-perspective dataset that complements preexisting real collections and a synthetic dataset generated in this study. Together, these contributions advance the capability to re-identify vehicles across wide viewing baselines; establish a foundation for scalable, reproducible research in vehicle re-ID; and open pathways for future applications, such as inferring routine behaviors, movement patterns, and daily habits of the individual associated with the vehicle.

convolutional neural networks↗

Multi-Centrality Graph Spectral Decompositions and Their Application to Cyber Intrusion Detection

Many modern datasets can be represented as graphs and hence spectral decompositions such as graph principal component analysis (PCA) can be useful. Distinct from previous graph decomposition approaches based on subspace projection of a single topological feature, e.g., the centered graph adjacency matrix (graph Laplacian), we propose spectral decomposition approaches to graph PCA and graph dictionary learning that integrate multiple features, including graph walk statistics, centrality measures and graph distances to reference nodes. In this paper we propose a new PCA method for single graph analysis, called multi-centrality graph PCA (MC-GPCA), and a new dictionary learning method for ensembles of graphs, called multi-centrality graph dictionary learning (MC-GDL), both based on spectral decomposition of multi-centrality matrices. As an application to cyber intrusion detection, MC-GPCA can be an effective indicator of anomalous connectivity pattern and MC-GDL can provide discriminative basis for attack classification.

cybersecurity↗

JANNAF Lessons Learned Panel Discussion

The difference between the AS-510 observed and predicted separation distance is attributed to a greater F-1 engine "tail off" impulse than that used in the separation distance prediction. . The F-1 thrust decay was normal and not appreciably different from previous (AS-505 through 509) flights. . Analysis indicates that with an S-IC stage having only four retro motors, failure of one retro motor to ignite would result in marginal separation distances and, in the 3-sigma case, re-contact of the two stages. . S-IC-11 and subsequent flight stages were equipped with eight retro motors rather than the planned four.

Richards, Steve↗

Advanced Concept Studies for Supersonic Commercial Transports Entering Service in the 2018-2020 Period Phase 2

Lockheed Martin Aeronautics Company (LM), working in conjunction with General Electric Global Research (GE GR) and Stanford University, executed a 19 month program responsive to the NASA sponsored "N+2 Supersonic Validation: Advanced Concept Studies for Supersonic Commercial Transports Entering Service in the 2018-2020 Period" contract. The key technical objective of this effort was to validate integrated airframe and propulsion technologies and design methodologies necessary to realize a supersonic vehicle capable of meeting the N+2 environmental and performance goals. The N+2 program is aligned with NASA's Supersonic Project and is focused on providing system level solutions capable of overcoming the efficiency, environmental, and performance barriers to practical supersonic flight. The N+2 environmental and performance goals are outlined in the technical paper, AIAA-2014-2138 (Ref. 1) along with the validated N+2 Phase 2 results. Our Phase 2 efforts built upon our Phase 1 studies (Ref. 2) and successfully demonstrated the ability to design and test realistic configurations capable of shaped sonic booms over the width of the sonic boom carpet. Developing a shaped boom configuration capable of meeting the N+2 shaped boom targets is a key goal for the N+2 program. During the LM Phase 1 effort, LM successfully designed and tested a shaped boom trijet configuration (1021) capable of achieving 85 PLdB under track (forward and aft shock) and up to 28 deg off-track at Mach 1.6. In Phase 2 we developed a refined configuration (1044-2) that extended the under 85 PLdB sonic boom level over the entire carpet of 52 deg off-track at a cruise Mach number of 1.7. Further, the loudness level of the configuration throughout operational conditions calculates to an average of 79 PLdB. These calculations rely on propagation employing Burger's (sBOOM) rounding methodology, and there are indications that the configuration average loudness would actually be 75 PLdB. We also added significant fidelity to the design of the configuration in this phase by performing a low speed wind tunnel test at our LTWT facility in Palmdale, by more complete modelling of propulsion effects in our sonic boom analysis, and by refining our configuration packaging and performance assessments. Working with General Electric, LM performed an assessment of the impact of inlet and nozzle effects on the sonic boom signature of the LM N+2 configurations. Our results indicate that inlet/exhaust streamtube boundary conditions are adequate for conceptual design studies, but realistic propulsion modeling at similar stream-tube conditions does have a small but measurable impact on the sonic boom signature. Previous supersonic transport studies have identified aeroelastic effects as one of the major challenges associated with the long, slender vehicles particularly common with shaped boom aircraft (Ref. 3). Under the Phase 2 effort, we have developed a detailed structural analysis model to evaluate the impact of flexibility and structural considerations on the feasibility of future quiet supersonic transports. We looked in particular at dynamic structural modes and flutter as a failure that must be avoided. We found that for our N+2 design in particular, adequate flutter margin existed. Our flutter margin is large enough to cover uncertainties like large increases in engine weight and the margin is relatively easy to increase with additional stiffening mass. The lack of major aeroelastic problems probably derives somewhat from an early design bias. While shaped boom aircraft require long length, they are not required to be thin. We intentionally developed our structural depths to avoid major flexibility problems. So at the end of Phase 2, we have validated that aeroelastic problems are not necessarily endemic to shaped boom designs. Experimental validation of sonic boom design and analysis techniques was the primary objective of the N+2 Supersonic Validations contract; and in this Phase, LM participated in four high speed wind tunnel tests. The first so-called Parametric Test in the Ames 9x7 tunnel did an exhaustive look at variation effects of the parameters: humidity, total pressure, sample time, spatial averaging distance and number of measurement locations, and more. From the results we learned to obtain data faster and more accurately, and made test condition tolerances easy to meet (eliminating earlier 60 percent wasted time when condition tolerances could not be held). The next two tests used different tunnels. The Ames 11 ft tunnel was used to test lower Mach numbers of 1.2 and 1.4. There were several difficulties using this tunnel for the first time for sonic boom including having to shift the measurement Mach numbers to 1.15 and 1.3 to avoid flow problems. It is believed that the 11 ft could be used successfully to measure sonic boom but there are likely to be a number of test condition restrictions. The Glenn 8x6 ft tunnel was used next and the tunnel has a number of desirable features for sonic boom measurement. While the Ames 9x7 can only test Mach 1.55 to 2.55 and the 11 ft can only test Mach 1.3 and lower, the Glenn 8x6 can test continuously from Mach 0.3 to 2.0. Unfortunately test measurement accuracy was compromised by a reference pressure drift. Post-test analysis revealed that the drift occurred when Mach number drifted slightly. Test measurements indicated that if Mach number drift is eliminated, results from the 8x6 would be more accurate, especially at longer distances, than results from the 9x7. The fourth test in the 9x7, called LM4, used everything we learned to comprehensively and accurately measure our new 1044-02 configuration with a full-carpet shaped signature design. Productivity was 8 times greater than our Phase 1 LM3 test. Measurement accuracy and repeatability was excellent out to 42 in. However, measurements at greater distances require the rail in the aft position and become substantially less accurate. Further signature processing or measurement improvements are needed for beyond near-field signature validation.

Morgenstern, John↗

Learning Quantum States and Unitaries of Bounded Gate Complexity

While quantum state tomography is notoriously hard, most states hold little interest to practically minded tomographers. Given that states and unitaries appearing in nature are of bounded gate complexity, it is natural to ask if efficient learning becomes possible. In this work, we prove that to learn a state generated by a quantum circuit with G two-qubit gates to a small trace distance, a sample complexity scaling linearly in G is necessary and sufficient. We also prove that the optimal query complexity to learn a unitary generated by G gates to a small average-case error scales linearly in G . While sample-efficient learning can be achieved, we show that under reasonable cryptographic conjectures, the computational complexity for learning states and unitaries of gate complexity G must scale exponentially in G . We illustrate how these results establish fundamental limitations on the expressivity of quantum machine-learning models and provide new perspectives on no-free-lunch theorems in unitary learning. Together, our results answer how the complexity of learning quantum states and unitaries relate to the complexity of creating these states and unitaries. Published by the American Physical Society 2024

Zhao, Haimeng (ORCID:0000000166751489)↗

Spatial arrangement of dynamic surface species from solid-state NMR and machine learning-accelerated MD simulations

Here, the surface arrangement of motional organic functionalities is explored by experimental dipolar coupling measurements and the prediction of motionally-averaged coupling constant from molecular dynamics simulations. The use of machine learning potentials was key to reaching the timescale required. The distance between dynamic surface species are important in cooperative heterogeneous catalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Residuals-based distributionally robust optimization with covariate information

We consider data-driven approaches that integrate a machine learning prediction model within distributionally robust optimization (DRO) given limited joint observations of uncertain parameters and covariates. Our framework is flexible in the sense that it can accommodate a variety of regression setups and DRO ambiguity sets. We investigate asymptotic and finite sample properties of solutions obtained using Wasserstein, sample robust optimization, and phi-divergence-based ambiguity sets within our DRO formulations, and explore cross-validation approaches for sizing these ambiguity sets. Through numerical experiments, we validate our theoretical results, study the effectiveness of our approaches for sizing ambiguity sets, and illustrate the benefits of our DRO formulations in the limited data regime even when the prediction model is misspecified.

97 MATHEMATICS AND COMPUTING↗

Parallax-corrected VISST-derived pixel-level products from satellite GOES-16

The NASA Langley group led by William Smith produced GOES-16 satellite cloud retrievals over an approximate 10 by 10 degree region over the CACTI field campaign location. These retrievals are described here: https://www.arm.gov/capabilities/vaps/visst and are available for download here . They use algorithms historically called VISST that are now referred to as SatCORPS. More information can be found in Trepte et al. (2019), Minnis et al. (2021), and Yost et al. (2021). If using this dataset, please cite these references, the CACTI VISST dataset DOI found at the download link above, and this dataset’s DOI. The CACTI VISST pixel-level retrievals are on a 2 km spatial grid and available every 15 minutes (every 10 minutes late in the campaign), producing 21,765 files for the entire field campaign between October 2018 and April 2019. They are not corrected for parallax error, which is an offset in the actual geographical location of a cloud above the surface due to the satellite viewing the cloud partly from the side off nadir. This dataset applies a correction for parallax using the location relative to the satellite and the retrieved cloud top height above the surface, which allows the dataset to be geo-located with surface-based observations. The parallax correction for each location depends on the longitude, latitude and cloud top height above ground level (AGL) for that longitude and latitude in the original VISST files. The cloud top height AGL requires first computing the surface elevation at each VISST grid point. Data from the Advanced Spaceborne Thermal Emission and Reflection (ASTER) Global Digital Elevation Map Version 3 at 30-m resolution is projected onto the VISST grid using conservative coarsening (conserving surface elevation) in the xESMF Python package. The surface elevation is then subtracted from the VISST-retrieved cloud top height above mean sea level. These cloud top heights AGL are then combined with longitude and latitude to estimate the latitude and longitude corrections. Due to variability in cloud top height, the parallax shifts produce an irregular grid of values since higher cloud tops are shifted further than lower cloud tops. A ball tree-based neighbor search with Haversine distance is performed using the Python-based scikit-learn library to find the nearest VISST grid point to each parallax correction-shifted point. The data value of the shifted point is then assigned to that VISST grid point. In this manner, the irregular geographical shifts to correct for parallax are projected back to the rectilinear VISST grid. Because relatively higher clouds should obscure lower clouds, the variable values for the highest cloud top are preferentially chosen if two or more values are assigned to a grid point. The parallax correction should be viewed as an improved but still imperfect estimation of the cloud top locations, largely because the cloud top height is an imperfect retrieval. Please see the attached README document for further information. Users are encouraged to contact the authors with any additional questions.

54 ENVIRONMENTAL SCIENCES↗

CO/H2 in Translucent Clouds

A thorough examination of techniques to improve the resolution of the FUSE spectrograph was undertaken. These involved co-adding time tagged data very carefully so as to remove any blurs caused by drift. In addition, data was binned by detector pulse height bin (to eliminate any positional vs. gain variations, e.g. "walk"). These techniques only resulted in an extremely modest increase in the spectral resolution, insufficient to allow the CO/H2 studies to be performed. The only remaining potential source of blur was defocus - implying the instrument was never properly focused on orbit. Private discussions with B.G. Anderson of the FUSE team resulted in my learning that this was in fact the case - the slidgrating distance was never optimized on orbit - resulting in a degradation of the peak performance of the instrument. Unfortunately, this was never publicized, even to myself, a member of the instrument tem and the spectrograph designer.

Green, James↗

Comparing storm resolving models and climates via unsupervised machine learning

Global storm-resolving models (GSRMs) have gained widespread interest because of the unprecedented detail with which they resolve the global climate. However, it remains difficult to quantify objective differences in how GSRMs resolve complex atmospheric formations. This lack of comprehensive tools for comparing model similarities is a problem in many disparate fields that involve simulation tools for complex data. To address this challenge we develop methods to estimate distributional distances based on both nonlinear dimensionality reduction and vector quantization. Our approach automatically learns physically meaningful notions of similarity from low-dimensional latent data representations that the different models produce. This enables an intercomparison of nine GSRMs based on their high-dimensional simulation data (2D vertical velocity snapshots) and reveals that only six are similar in their representation of atmospheric dynamics. Furthermore, we uncover signatures of the convective response to global warming in a fully unsupervised way. Our study provides a path toward evaluating future high-resolution simulation data more objectively.

54 ENVIRONMENTAL SCIENCES↗

A mathematical discussion concerning the performance of multilayer perceptron-type artificial neural networks through use of orthogonal bipolar vectors

This work proposes the use of orthogonal bipolar vectors (OBV) as targets for multilayer perceptron (MLP) Artificial neural networks pertaining to the pattern recognition field. Implications involving this proposal are supported by a proper mathematical discussion. This study shows that the use of OBV as targets improves the class identification performance of MLP networks for pattern recognition with more than two classes when compared to the widely used conventional target bipolar vector (CBV). In addition to the overall performance improvement, it is possible to obtain high recognition rates with fewer training epochs, while keeping a feasible generalization with other data. This behavior is related to the Euclidean distance of the points in the output space, which is much higher in the case of OBVs. Therefore, with a greater distance between the points in the output space, the MLP network becomes less prone to associate trained outputs with incorrect targets. The mathematical discussion in this study is based on the backpropagation training algorithm. In addition to the mathematical discussion, results from experiments with real data are presented. These results follow those obtained by mathematical derivations. Real data sets used in the experiments are available from: (a) the Semeion Handwritten Digit of Machine Learning Repository, international repository; (b) Iris Image Database from the Chinese Academy of Sciences—CASIA; (c) Australian Sign Language, signs of Machine Learning Repository, international repository. Experiments were conducted to measure the mean Euclidean distance between the MLP network output subjected to a given input pattern and outputs related to other pattern classifications. Experimental results show that MLP networks trained with OBVs were able to ensure a Euclidean distance between the output and incorrect targets greater than MLP networks trained with CBVs (by up to 4 times for handwritten, by up to 12 times for iris images and by up to 10 times for Auslan signs language). As such, the adoption of OBVs as target vectors for MLPs reduces the computational effort for training the network.

97 MATHEMATICS AND COMPUTING↗

A Census of Young Stellar Objects in Two Line-of-Sight Star-Forming Regions Toward IRAS 22147+5948 in the Outer Galaxy

Context. Star formation in the outer Galaxy, namely, outside of the Solar circle, has not been extensively studied in part due to the low CO brightness of the molecular clouds linked with the negative metallicity gradient. Recent infrared surveys provide an overview of dust emission in large sections of the Galaxy, but they suffer from cloud confusion and poor spatial resolution at far-infrared wavelengths. Aims. We aim to develop a methodology to identify and classify young stellar objects (YSOs) in star-forming regions in the outer Galaxy and use it to resolve a long-standing disparity in terms of the distance and evolutionary status of IRAS 22147+5948. Methods. We used a support vector machine learning algorithm to complement standard color–color and color–magnitude diagrams in our search for YSOs in the IRAS 22147 region, based on publicly available data from the Spitzer Mapping of the Outer Galaxy survey. The agglomerative hierarchical clustering algorithm was used to identify clusters. Then the physical properties of individual YSOs were calculated. The distances were determined using CO 1–0 from the Five College Radio Astronomy Observatory survey. Results. We identified 13 Class I and 13 Class II YSO candidates using the color–color diagrams, along with an additional 2 and 21 sources, respectively, using the applied machine learning techniques. The spectral energy distributions of 23 sources were modeled with a star and a passive disk, corresponding to Class II objects. The models of three sources include envelopes that are typical for Class I objects. The objects were grouped into two clusters located at a distance of 2:2 kpc and 5 clusters at 5:6 kpc. The spatial extent of CO, radio continuum, and dust emission confirms the origin of YSOs in two distinct star-forming regions along a similar line of sight. Conclusions. The outer Galaxy may serve as a unique laboratory for exploring star formation across environments, on the condition that complementary methods and ancillary data are used to properly account for cloud confusion and distance uncertainties.

Agata Karska↗

Predicting U.S. federal fleet electric vehicle charging patterns using internal combustion engine vehicle fueling transaction statistics

Utilizing fueling transactions from internal combustion engine vehicles (ICEVs), the authors estimated how frequently midday public charging would be required for U.S. federal fleet battery electric vehicles (BEVs). Fueling transaction summary statistics are more widely available than trip-level telematics data, making this methodology more accessible and transferable to other researchers and fleet managers considering BEV replacements. For example, readers can easily apply a linear model using only the count of back-to-back fueling events at gas stations over 57 straight-line miles apart to predict days exceeding range. This linear regression predicted binned days exceeding 250 miles at 80% accuracy on a hold-out test set from the same fleet as the training data and 66 % accuracy on a new fleet displaying different driving behaviors. The authors additionally provide linear equations for days exceeding 200 and 300 miles as alternative range estimates to account for differences in BEV range and temperature impacts. Beyond the single-feature linear models which readers can apply, the authors tuned and trained other machine learning models on a variety of fueling transaction statistics including consecutive transaction distances, transaction distance from garage, estimated miles traveled from fuel economy and fuel quantity, and transaction periodicity. Utilizing a subset of 1678 light-duty federal fleet vehicles which contained daily vehicle miles traveled (VMT) in addition to fueling statistics, the authors determined which fueling transaction statistics were most relevant in predicting driving days exceeding 250 miles (an approximation of BEV rated driving range). In support of the U.S. federal fleet transition to zero-emission vehicles (ZEVs), the authors used these statistics and machine learning models to predict the frequency of BEV midday charging. After training models on the subset with VMT, the authors predicted days exceeding rated range for 112,902 light-duty vehicles operating in similar circumstances in the federal fleet using a Support Vector Regressor (SVR). In conclusion, they then used the projections as part of the ZEV Planning and Charging (ZPAC) tool to identify optimal candidates for BEVs for the federal fleet. An anonymized version of ZPAC is included in the supplementary materials.

25 ENERGY STORAGE↗

Using Deep Learning to Develop a High Resolution Planetary Boundary Layer Model for Infrasound Propagation

Infrasound, with frequencies less than 20 Hz, is generated by both natural and anthropogenic sources. When one of these sources exerts a force on the atmosphere, infrasonic waves are generated. The propagation of these waves largely depends on temperature, wind speed, and wind direction. Previous work has used deep learning to accurately predict atmospheric specifications to altitudes of ~40 km. However, this model breaks down for local distances because it is too low resolution. Here we use a high-resolution meteorological dataset collected in Las Vegas, Nevada, USA to develop a deep learning model that can predict temperature, wind speed, and wind direction. Predictions are compared to ground truth observations to show that the model performs well at predicting temperature and wind direction but struggles with prediction wind speed. Model limitations and improvements are also discussed.

54 ENVIRONMENTAL SCIENCES↗

Machine Learning Methods for Connection RTT and Loss Rate Estimation Using MPI Measurements Under Random Losses

Scientific computations are expected to be increasingly distributed across wide-area networks, and Message Passing Interface (MPI) has been shown to scale to support their communications over long distances. Application-level measurements of MPI operations reflect the connection Round-Trip Time (RTT) and loss rate, and machine learning methods have been previously developed to estimate them under deterministic periodic losses. In this paper, we consider more complex, random losses with unform, Poisson and Gaussian distributions. We study five disparate machine leaning methods, with linear and non-linear, and smooth and non-smooth properties, to estimate RTT and loss rate over 10Gbps connections with 0-366ms RTT. The diversity and complexity of these estimators combined with the randomness of losses and TCP’s non-linear response together rule out the selection of a single best among them; instead, we fuse them to retain their design diversity. Overall, the results show that accurate estimates can be generated at low loss rates but become inaccurate at loss rates 10% and higher, thereby illustrating both their strengths and limitations.

Generalization Bounds↗

Learning and Prediction of Slip from Visual Information

This paper presents an approach for slip prediction from a distance for wheeled ground robots using visual information as input. Large amounts of slippage which can occur on certain surfaces, such as sandy slopes, will negatively affect rover mobility. Therefore, obtaining information about slip before entering such terrain can be very useful for better planning and avoiding these areas. To address this problem, terrain appearance and geometry information about map cells are correlated to the slip measured by the rover while traversing each cell. This relationship is learned from previous experience, so slip can be predicted remotely from visual information only. The proposed method consists of terrain type recognition and nonlinear regression modeling. The method has been implemented and tested offline on several off-road terrains including: soil, sand, gravel, and woodchips. The final slip prediction error is about 20%. The system is intended for improved navigation on steep slopes and rough terrain for Mars rovers.

rover↗

Classification of AB O 3 perovskite solids: a machine learning study

Here we explored the use of machine learning methods for classifying whether a particular AB O 3 chemistry forms a perovskite or non-perovskite structured solid. Starting with three sets of feature pairs (the tolerance and octahedral factors, the A and B ionic radii relative to the radius of O, and the bond valence distances between the A and B ions from the O atoms), we used machine learning to create a hyper-dimensional partial dependency structure plot using all three feature pairs or any two of them. Doing so increased the accuracy of our predictions by 2–3 percentage points over using any one pair. We also included the Mendeleev numbers of the A and B atoms to this set of feature pairs. Moreover, doing this and using the capabilities of our machine learning algorithm, the gradient tree boosting classifier, enabled us to generate a new type of structure plot that has the simplicity of one based on using just the Mendeleev numbers, but with the added advantages of having a higher accuracy and providing a measure of likelihood of the predicted structure.

36 MATERIALS SCIENCE↗

DeepAdversaries: examining the robustness of deep learning models for galaxy morphology classification

With increased adoption of supervised deep learning methods for work with cosmological survey data, the assessment of data perturbation effects (that can naturally occur in the data processing and analysis pipelines) and the development of methods that increase model robustness are increasingly important. In the context of morphological classification of galaxies, we study the effects of perturbations in imaging data. In particular, we examine the consequences of using neural networks when training on baseline data and testing on perturbed data. We consider perturbations associated with two primary sources: (a) increased observational noise as represented by higher levels of Poisson noise and (b) data processing noise incurred by steps such as image compression or telescope errors as represented by one-pixel adversarial attacks. We also test the efficacy of domain adaptation techniques in mitigating the perturbation-driven errors. We use classification accuracy, latent space visualizations, and latent space distance to assess model robustness in the face of these perturbations. For deep learning models without domain adaptation, we find that processing pixel-level errors easily flip the classification into an incorrect class and that higher observational noise makes the model trained on low-noise data unable to classify galaxy morphologies. On the other hand, we show that training with domain adaptation improves model robustness and mitigates the effects of these perturbations, improving the classification accuracy up to 23% on data with higher observational noise. Domain adaptation also increases up to a factor of ${\approx}2.3$ the latent space distance between the baseline and the incorrectly classified one-pixel perturbed image, making the model more robust to inadvertent perturbations. Successful development and implementation of methods that increase model robustness in astronomical survey pipelines will help pave the way for many more uses of deep learning for astronomy.

79 ASTRONOMY AND ASTROPHYSICS↗