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 109 records · Page 6

Simultaneous calibration of spectro-photometric distances and the Gaia DR2 parallax zero-point offset with deep learning

ABSTRACT Gaia measures the five astrometric parameters for stars in the Milky Way, but only four of them (positions and proper motion, but not distance) are well measured beyond a few kpc from the Sun. Modern spectroscopic surveys such as APOGEE cover a large area of the Milky Way disc and we can use the relation between spectra and luminosity to determine distances to stars beyond Gaia’s parallax reach. Here, we design a deep neural network trained on stars in common between Gaia and APOGEE that determines spectro-photometric distances to APOGEE stars, while including a flexible model to calibrate parallax zero-point biases in Gaia DR2. We determine the zero-point offset to be $-52.3 \pm 2.0\, \mu \mathrm{as}$ when modelling it as a global constant, but also train a multivariate zero-point offset model that depends on G, GBP − GRP colour, and Teff and that can be applied to all ≈58 million stars in Gaia DR2 within APOGEE’s colour–magnitude range and within APOGEE’s sky footprint. Our spectro-photometric distances are more precise than Gaia at distances ${\gtrsim} 2\, \mathrm{kpc}$ from the Sun. We release a catalogue of spectro-photometric distances for the entire APOGEE DR14 data set which covers Galactocentric radii $2\, \mathrm{kpc} \lesssim R \lesssim 19\, \mathrm{kpc}$; ${\approx} 150\, 000$ stars have ${\lt} 10{{\ \rm per\ cent}}$ uncertainty, making this a powerful sample to study the chemo-dynamical structure of the disc. We use this sample to map the mean [Fe/H] and 15 abundance ratios [X/Fe] from the Galactic Centre to the edge of the disc. Among many interesting trends, we find that the bulge and bar region at $R \lesssim 5\, \mathrm{kpc}$ clearly stands out in [Fe/H] and most abundance ratios.

Leung, Henry W.↗

Uncertainty-Aware, Structure-Preserving Machine Learning Approach for Domain Shift Detection From Nonlinear Dynamic Responses of Structural Systems

Complex structural systems deployed for aerospace, civil, or mechanical applications must operate reliably under varying operational conditions. Structural health monitoring (SHM) systems help ensure the reliability of these systems by providing continuous monitoring of the state of the structure. SHM relies on synthesizing measured data with a predictive model to make informed decisions about structural states. However, these models—which may be thought of as a form of a digital twin—need to be updated continuously as structural changes (e.g., due to damage) arise. We propose an uncertainty-aware machine learning model that enforces distance preservation of the original input state space and then encodes a distance-aware mechanism via a Gaussian process (GP) kernel. The proposed approach leverages the spectral-normalized neural GP algorithm to combine the flexibility of neural networks with the advantages of GP, subjected to structure-preserving constraints, to produce an uncertainty-aware model. This model is used to detect domain shift due to structural changes that cannot be observed directly because they may be spatially isolated (e.g., inside a joint or localized damage). This work leverages detection theory to detect domain shift systematically given statistical features of the prediction variance produced by the model. The proposed approach is demonstrated on a nonlinear structure being subjected to damage conditions. In conclusion, it is shown that the proposed approach is able to rely on distances of the transformed input state space to predict increased variance in shifted domains while being robust to normative changes.

Algorithms↗

A Probabilistic Reasoner Based on Bayes Risk for Damage Detection in Structural Systems

Structural health monitoring (SHM) systems are used to inform operation of structural systems subject to loads and environments that may affect their integrity. SHM systems rely on continuous monitoring of the structure to determine its health state. These systems are often coupled with a model of the deployed structure to determine the consequences of changes in the system by forecasting the response to future states. These models, which may be thought of as digital twins, need to be updated to reflect the latest state of the structural system. This work makes use of an uncertainty-aware machine learning model that enforces distance preservation of the original input space to determine deviations from the training data input space distributions. This workflow enables domain shift detection to determine whether damage is present in the structure. The uncertainty metrics generated by this network are then used in a Bayes risk framework to design an optimal damage detector given cost and risk considerations. The approach is demonstrated on a computational example with simulated damage.

Najera-Flores, David [ATA Engineering, Inc.]↗

Automating cell detection and classification in human brain fluorescent microscopy images using dictionary learning and sparse coding

Background Immunofluorescence (IF) plays a major role in quantifying protein expression in situ and understanding cell function. It is widely applied in assessing disease mechanisms and in drug discovery research. Automation of IF analysis can transform studies using experimental cell models. However, IF analysis of postmortem human tissue relies mostly on manual interaction, often subjected to low-throughput and prone to error, leading to low inter and intra-observer reproducibility. Human postmortem brain samples challenges neuroscientists because of the high level of autofluorescence caused by accumulation of lipofuscin pigment during aging, hindering systematic analyses. We propose a method for automating cell counting and classification in IF microscopy of human postmortem brains. Our algorithm speeds up the quantification task while improving reproducibility. New method Dictionary learning and sparse coding allow for constructing improved cell representations using IF images. These models are input for detection and segmentation methods. Classification occurs by means of color distances between cells and a learned set. Results Our method successfully detected and classified cells in 49 human brain images. We evaluated our results regarding true positive, false positive, false negative, precision, recall, false positive rate and F1 score metrics. We also measured user-experience and time saved compared to manual countings. Comparison with existing methods We compared our results to four open-access IF-based cell-counting tools available in the literature. Lastly, our method showed improved accuracy for all data samples. Conclusion The proposed method satisfactorily detects and classifies cells from human postmortem brain IF images, with potential to be generalized for applications in other counting tasks.

59 BASIC BIOLOGICAL SCIENCES↗

Relative Hausdorff distance for network analysis

Similarity measures are used extensively in machine learning and data science algorithms. The newly proposed graph Relative Hausdorff (RH) distance is a lightweight yet nuanced similarity measure for quantifying the closeness of two graphs. In this work we study the effectiveness of RH distance as a tool for detecting anomalies in time-evolving graph sequences. We apply RH to cyber data with given red team events, as well to synthetically generated sequences of graphs with planted attacks. In our experiments, the performance of RH distance is at times comparable, and sometimes superior, to graph edit distance in detecting anomalous phenomena. Furthermore, our results suggest that in appropriate contexts, RH distance has advantages over more computationally intensive similarity measures.

97 MATHEMATICS AND COMPUTING↗

Fault location in High Voltage Multi-terminal dc Networks Using Ensemble Learning

Precise location of faults for large distance power transmission networks is essential for faster repair and restoration process. High Voltage direct current (HVdc) networks using modular multi-level converter (MMC) technology has found its prominence for interconnected multi-terminal networks. This allows for large distance bulk power transmission at lower costs. However, they cope with the challenge of dc faults. Fast and efficient methods to isolate the network under dc faults have been widely studied and investigated. After successful isolation, it is essential to precisely locate the fault. The post-fault voltage and current signatures are a function of multiple factors and thus accurately locating faults on a multi-terminal network is challenging. In this paper, we discuss a novel data-driven ensemble learning based approach for accurate fault location. Here we utilize the eXtreme Gradient Boosting (XGB) method for accurate fault location. The sensitivity of the proposed algorithm to measurement noise, fault location, resistance and current limiting inductance are performed on a radial three-terminal MTdc network designed in Power System Computer Aided Design (PSCAD)/Electromagnetic Transients including dc (EMTdc).

24 POWER TRANSMISSION AND DISTRIBUTION↗

Prediction of inter-chain distance maps of protein complexes with 2D attention-based deep neural networks

Residue-residue distance information is useful for predicting tertiary structures of protein monomers or quaternary structures of protein complexes. Many deep learning methods have been developed to predict intra-chain residue-residue distances of monomers accurately, but few methods can accurately predict inter-chain residue-residue distances of complexes. We develop a deep learning method CDPred (i.e., Complex Distance Prediction) based on the 2D attention-powered residual network to address the gap. Tested on two homodimer datasets, CDPred achieves the precision of 60.94% and 42.93% for top L/5 inter-chain contact predictions (L: length of the monomer in homodimer), respectively, substantially higher than DeepHomo’s 37.40% and 23.08% and GLINTER’s 48.09% and 36.74%. Tested on the two heterodimer datasets, the top Ls/5 inter-chain contact prediction precision (Ls: length of the shorter monomer in heterodimer) of CDPred is 47.59% and 22.87% respectively, surpassing GLINTER’s 23.24% and 13.49%. Moreover, the prediction of CDPred is complementary with that of AlphaFold2-multimer.

59 BASIC BIOLOGICAL SCIENCES↗

The Deeper, Wider, Faster programme: exploring stellar flare activity with deep, fast cadenced DECam imaging via machine learning

ABSTRACT We present our 500 pc distance-limited study of stellar flares using the Dark Energy Camera as part of the Deeper, Wider, Faster programme. The data were collected via continuous 20-s cadence g-band imaging and we identify 19 914 sources with precise distances from Gaia DR2 within 12, ∼3 deg2, fields over a range of Galactic latitudes. An average of ∼74 min is spent on each field per visit. All light curves were accessed through a novel unsupervised machine learning techniques designed for anomaly detection. We identify 96 flare events occurring across 80 stars, the majority of which are M dwarfs. Integrated flare energies range from ∼1031–1037 erg, with a proportional relationship existing between increased flare energy with increased distance from the Galactic plane, representative of stellar age leading to declining yet more energetic flare events. In agreement with previous studies we observe an increase in flaring fraction from M0 to M6 spectral types. Furthermore, we find a decrease in the flaring fraction of stars as vertical distance from the galactic plane is increased, with a steep decline present around ∼100 pc. We find that $\sim 70{{\ \rm per\ cent}}$ of identified flares occur on short time-scales of <8 min. Finally, we present our associated flare rates, finding a volumetric rate of 2.9 ± 0.3 × 10−6 flares pc−3 h−1.

Webb, S.↗

Using kernel-based statistical distance to study the dynamics of charged particle beams in particle-based simulation codes

Measures of discrepancy between probability distributions (statistical distance) are widely used in the fields of artificial intelligence and machine learning. We describe how certain measures of statistical distance can be implemented as numerical diagnostics for simulations involving charged-particle beams. Related measures of statistical dependence are also described. The resulting diagnostics provide sensitive measures of dynamical processes important for beams in nonlinear or high-intensity systems, which are otherwise difficult to characterize. Here, the focus is on kernel-based methods such as maximum mean discrepancy, which have a well-developed mathematical foundation and reasonable computational complexity. Several benchmark problems and examples involving intense beams are discussed. While the focus is on charged-particle beams, these methods may also be applied to other many-body systems such as plasmas or gravitational systems.

47 OTHER INSTRUMENTATION↗

Twisty-puzzle-inspired approach to Clifford synthesis

The problem of decomposing an arbitrary Clifford element into a sequence of Clifford gates is known as Clifford synthesis. Drawing inspiration from similarities between this and the famous Rubik's cube twisty puzzle, here we develop a machine learning approach for Clifford synthesis based on learning an approximation to the distance to the identity. This approach is probabilistic and computationally intensive. However, when a decomposition is successfully found, it often involves fewer gates than the decomposition methods used in the Qiskit decomposition protocol, which uses a combination of several well-known Clifford decomposition schemes. Additionally, our approach is much more flexible than existing algorithms in that arbitrary gate sets, device topologies, and gate fidelities may be incorporated, thus allowing for the approach to be tailored to a specific device.

97 MATHEMATICS AND COMPUTING↗

Preparing Students to Work in Diverse Settings and Across Distance: Inter-University, Interdisciplinary Capstone Teams

NASA's Psyche Mission is engaged with a growing number of capstone teams pursuing topics relevant to the mission, including partnering with four universities to trial cross-university teaming. Creating interdisciplinary capstone teams with students from different universities provides an opportunity to prepare students to engage with a diversity of disciplines and collaborate in remote teams in the workplace. Additionally, through such capstones, universities may gain access to non-local, specialized technical mentors and to disciplines not offered at their institutions. An added benefit is providing greater fidelity to NASA space missions, which involve teams working together at a distance. We discuss early lessons learned from the first three inter-university, interdisciplinary capstone teams participating with the Psyche mission and discuss plans for improvement and future expansion.

Bowman, C. D. D.↗

Lunar Surface Position Determination using Perceived Signal Strength

The purpose of this project is to evaluate the feasibility of transmitters and receivers on the lunar surface for Position Determination (PD) without any form of lunar Global Positioning System (GPS). The early Artemis program may lack GPS satellites orbiting the Moon, and it is critical that activities with the lander, rover, and crew EVA identify their position on the lunar surface at all times. This project creates a prototype system that trilaterates user position based upon the perceived signal from at least 3 nearby transmission towers, called “Lunar Access Points”. The application of perceived signal strength for surface PD has historically been used in terrestrial systems such as Long Range Navigation (LORAN), which was popular with the maritime industry prior to the Global Positioning System (GPS). The ease of installing such a local system for early Artemis missions provides a critical resource until satellite-based position determination systems are deployed. A surface-based PD can also be used in GPS-denied environments such as deep craters or lava tubes where satellite visibility is compromised. By demonstrating the basic capability of surface PD, this student team has learned about issues with power, distance, thermal, dust, radiation, data processing, and communication problems applicable to the lunar surface. This knowledge can feed into future NASA requirements to improve the capability of a LunaNET implementation for the Artemis program. This project follows 10 years of successful collaboration between NASA JSC/ARES, Texas Space, Technology, Applications and Research (T STAR) and Texas A&M University in a Public, Private, Academic (PPA) Partnership. NASA funds T STAR to mentor undergraduate Capstone teams in the College of Engineering Department to design, built, and test prototypes meeting NASA requirements. TAMU faculty lead the student teams in their academic class, and NASA Subject Matter Experts (SMEs) provide T STAR and students insight on requirements evolution, prior design projects, and future development goals.

Position Determination↗

Using Mesh Networking for A Dynamic Lunar Internet of Things (Liot)

The purpose of this project is to evaluate the feasibility of an IEEE 802.11 mesh protocol for lunar surface computing. This standard for wireless networking boosts speed, dependability and range of wireless transmissions. The concept is to integrate sensors (such as deployed science instruments) or Astronaut tools (such as a handheld spectrometer) that communicate with a node on a common cell. The nodes can extend the range of the cell and can dynamically reconfigure the data routing in case of another node failure. All of the data in a cell pass through a modem that communicates with a distant base station across a 4G link. The application of mesh networking to a potential lunar surface network increases robustness and fault tolerance over a traditional single-point modem system. By demonstrating the basic capability of a mesh network, the student team has learned about issues with power, distance, thermal, dust, radiation, data processing, and communication problems applicable to the lunar surface. This knowledge can feed into future NASA requirements to improve the capability of a LunaNET implementation for the Artemis program. This project follows 10 years of successful collaboration between NASA ARES, Texas Space, Technology, Applications and Research (T STAR) and Texas A&M University in a Public, Private, Academic (PPA) Partnership. NASA funds T STAR to mentor undergraduate Capstone teams in the College of Engineering Department to design, built, and test prototypes meeting NASA requirements. TAMU faculty lead the student teams in their academic class, and NASA Subject Matter Experts (SMEs) provide T STAR and students insight on requirements evolution, prior design projects, and future development goals.

Lunar Mesh Networking↗

Any Two Learning Algorithms Are (Almost) Exactly Identical

This paper shows that if one is provided with a loss function, it can be used in a natural way to specify a distance measure quantifying the similarity of any two supervised learning algorithms, even non-parametric algorithms. Intuitively, this measure gives the fraction of targets and training sets for which the expected performance of the two algorithms differs significantly. Bounds on the value of this distance are calculated for the case of binary outputs and 0-1 loss, indicating that any two learning algorithms are almost exactly identical for such scenarios. As an example, for any two algorithms A and B, even for small input spaces and training sets, for less than 2e(-50) of all targets will the difference between A's and B's generalization performance of exceed 1%. In particular, this is true if B is bagging applied to A, or boosting applied to A. These bounds can be viewed alternatively as telling us, for example, that the simple English phrase 'I expect that algorithm A will generalize from the training set with an accuracy of at least 75% on the rest of the target' conveys 20,000 bytes of information concerning the target. The paper ends by discussing some of the subtleties of extending the distance measure to give a full (non-parametric) differential geometry of the manifold of learning algorithms.

Wolpert, David H.↗

Helping IT and OT Defenders Collaborate

Cyber-physical systems, especially in critical infrastructures, have become primary hacking targets in international conflicts and diplomacy. However, cyber-physical systems present unique challenges to defenders, starting with an inability to communicate. This paper outlines the results of our interviews with information technology (IT) defenders and operational technology (OT) operators and seeks to address lessons learned from them in the structure of our notional solutions. We pre-sent two problems in this paper: (1) the difficulty of coordinat-ing detection and response between defenders who work on the cyber/IT and physical/OT sides of cyber-physical infrastruc-tures, and (2) the difficulty of estimating the safety state of a cyber-physical system while an intrusion is underway but be-fore damage can be effected by the attacker. To meet these chal-lenges, we propose two solutions: (1) a visualization that will enable communication between IT defenders and OT operators, and (2) a machine-learning approach that will estimate the distance from normal the physical system is operating and send information to the visualization.

Cyber Physical Systems, internet of things, visual↗

ZeoNet: 3D convolutional neural networks for predicting adsorption in nanoporous zeolites

Zeolites are one of the most widely used materials in the chemical industry due to their nanometer-sized pores that can adsorb and react upon molecules selectively. With hundreds of known framework topologies and hundreds of thousands of computationally predicted structures, the ability to rapidly predict zeolite performance allows researchers to prioritize their efforts on the most promising structures for a given application. Although the accuracy of forcefield-based atomistic simulations has advanced significantly in the past two decades, these simulations can be computationally expensive, especially for long-chain, complex molecules. Here, we present ZeoNet, a representation learning framework using convolutional neural networks (ConvNets) and 3D volumetric representations for predicting adsorption in zeolites. ZeoNet was trained on the task of predicting Henry's constants for adsorption, k H , of n-octadecane in more than 330 000 known and predicted zeolite materials. Employing a 3D grid based on the distances to solvent-accessible surfaces, a volumetric representation that can be generated efficiently, the best-performing ZeoNet achieved a correlation coefficient r 2 = 0.977 and a mean-squared error MSE = 3.8 in ln k H , which corresponds to an error of 9.3 kJ mol -1 in adsorption free energy. In comparison, a model based on hand-designed geometric features has values of r 2 = 0.783 and MSE = 35.7. ZeoNet is also relatively efficient and can process ≈8 structures per second on an Nvidia RTX 2080TI GPU, orders of magnitude faster than forcefield-based simulations. A systematic analysis was conducted to investigate how the choice of ConvNet architectures, the linear dimension (L) and spatial resolution (Δd) of the distance grids, batch size, optimizer, and learning rate impact the model performance. We found that ConvNets based on the ResNet architecture offer the best tradeoff between expressiveness and efficiency. The performance for all models reaches a plateau at L = 30–45 Å and depends less sensitively on grid resolution, with a small benefit around Δd = 0.30–0.45 Å. Finally, saliency maps were visualized to identify which regions of the materials contributed the most to model predictions. It was found, interestingly, that the predictions are driven primarily by the accessible pore volume rather than the region occupied by the framework atoms.

36 MATERIALS SCIENCE↗

A novel methodology for gamma-ray spectra dataset procurement over varying standoff distances and source activities

The adoption of machine learning approaches for gamma-ray spectroscopy has received considerable attention in the literature. Many studies have investigated the deployment of various algorithm architectures to a specific task. However, little attention has been afforded to the development of the datasets leveraged to train the models. Such training datasets typically span a set of environmental or detector parameters to encompass a problem space of interest to a user. Variations in these measurement parameters will also induce fluctuations in the detector response, including expected pile-up and ground scatter effects. Fundamental to this work is the understanding that 1) the underlying spectral shape varies as the measurement parameters change and 2) the statistical uncertainties associated with two spectra impact their level of similarity. While previous studies attribute some arbitrary discretization to the measurement parameters for the generation of their synthetic training data, this work introduces a principled methodology for efficient spectral-based discretization of a problem space. A signal-to-noise ratio (SNR) respective spectral comparison measure and a Gaussian Process Regression (GPR) model are used to predict the spectral similarity across a range of measurement parameters. This innovative approach effectively showcased its capability by dividing a problem space, ranging from 5 cm to 100 cm standoff distances and 5 μCi–100 μCi of 137 Cs, into three unique combinations of measurement parameters. The findings from this work will aid in creating more robust datasets, which incorporate many possible measurement scenarios, reduce the number of required experimental test set measurements, and possibly enable experimental training data collection for gamma-ray spectroscopy.

data science↗

Machine learning approach to trapped many-fermion systems

For this work, we apply a variational ansatz based on neural networks to the problem of spin-$^1_2$ fermions in a harmonic trap interacting through a short distance potential. We showed that standard machine learning techniques lead to a quick convergence to the ground state, especially in weakly coupled cases. Higher couplings can be handled efficiently by increasing the strength of interactions during “training”.

1-dimensional systems↗