Search NASA⌕ Search

Engineering topics

Barbosa, Aaron

Publications and source records attributed to Barbosa, Aaron.

A reference-area-free strain mapping method using precession electron diffraction data

Here, in this work, we developed a method using precession electron diffraction data to map the residual elastic strain at the nano-scale. The diffraction pattern of each pixel was first collected and denoised. Template matching was then applied using the center spot as the mask to identify the positions of the diffraction disks. Statistics of distances between the selected diffracted disks enable the user to make an informed decision on the reference and to generate strain maps. Strain mapping on an unstrained single crystal sapphire shows the standard deviation of strain measurement is 0.5%. With this method, we were able to successfully measure and map the residual elastic strain in VO 2 on sapphire and martensite in a Ni 50.3 Ti 29.7 Hf 20 shape memory alloy. This approach does not require the user to select a “strain-free area” as a reference and can work on datasets even with the crystals oriented away from zone axes. This method is expected to provide a robust and more accessible alternative means of studying the residual strain of various material systems that complements the existing algorithms for strain mapping.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Using Machine Learning for Quantum Annealing Accuracy Prediction

Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of very high quality, problem instances are usually not solved to optimality due to imperfections of the current generations quantum annealers. In this contribution, we aim to understand some of the factors contributing to the hardness of a problem instance, and to use machine learning models to predict the accuracy of the D-Wave 2000Q annealer for solving specific problems. We focus on the maximum clique problem, a classic NP-hard problem with important applications in network analysis, bioinformatics, and computational chemistry. By training a machine learning classification model on basic problem characteristics such as the number of edges in the graph, or annealing parameters, such as the D-Wave’s chain strength, we are able to rank certain features in the order of their contribution to the solution hardness, and present a simple decision tree which allows to predict whether a problem will be solvable to optimality with the D-Wave 2000Q. We extend these results by training a machine learning regression model that predicts the clique size found by D-Wave.

97 MATHEMATICS AND COMPUTING↗