Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized algorithm”

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 919 records · Page 51

Langevin simulations of the half-filled cubic Holstein model

Over the past several years, reliable quantum Monte Carlo results for the charge density wave transition temperature T cdw of the half-filled two-dimensional Holstein model in square and honeycomb lattices have become available for the first time. Here, exploiting the further development of numerical methodology, here we present results in three dimensions, which are made possible through the use of Langevin evolution of the quantum phonon degrees of freedom. In addition to determining T cdw from the scaling of the charge correlations, we also examine the nature of charge order at general wave vectors for different temperatures, couplings, and phonon frequencies, and the behavior of the spectral function and specific heat.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A refined methodology for stress inversions of earthquake focal mechanisms: Refined Stress Inversion Methodology

We develop an improved methodology for reliable high-resolution inversions of focal mechanisms to background stress field orientation and stress ratio R in two or three dimensions. The earthquake catalog is declustered to remove events likely affected strongly by local stress interactions rather than reflecting the large-scale background stress field. The declustered data are discretized with the k-means algorithm into groups containing a number of focal mechanisms between a minimum number N min and 2N min . Synthetic tests indicate that N min ≈ 30 provides stable inversion results under different stress regimes and noise conditions when R ≈ 0.5, while N min ≈ 45 is needed for R near 0 or 1. Additional synthetic tests compare the performance of selecting the fault plane of each focal mechanism using (a) the plane with lowest misfit angle between the slip vector from the focal mechanism and shear traction from the stress tensor and (b) the plane with highest instability coefficient representing proximity to the optimally oriented fault for given stress field and friction coefficient. The instability criterion is found to provide more accurate inversion results under all tested stress regimes, stress ratios, and noise conditions. The refined inversion methodology combines selecting fault planes using the instability criterion iteratively with a damped simultaneous inversion of different focal mechanism groups. Results characterizing neighborhoods of discretized domains merged during the damped inversion provide high-resolution information independent of the discretization. Some aspects of the methodology are illustrated with focal mechanism data from the San Jacinto Fault Zone in Southern California.

58 GEOSCIENCES↗

ITeM: Independent temporal motifs to summarize and compare temporal networks

We report networks are a fundamental and flexible way of representing various complex systems. Many domains such as communication, citation, procurement, biology, social media, and transportation can be modeled as a set of entities and their relationships. Temporal networks are a specialization of general networks where every relationship occurs at a discrete time. The temporal evolution of such networks is as important to understand as the structure of the entities and relationships. We present the Independent Temporal Motif (ITeM) to characterize temporal graphs from different domains. ITeMs can be used to model the structure and the evolution of the graph. In contrast to existing work, ITeMs are edge-disjoint directed motifs that measure the temporal evolution of ordered edges within the motif. For a given temporal graph, we produce a feature vector of ITeM frequencies and the time it takes to form the ITeM instances. We apply this distribution to measure the similarity of temporal graphs. We show that ITeM has higher accuracy than other motif frequency-based approaches. We define various ITeM-based metrics that reveal salient properties of a temporal network. We also present importance sampling as a method to efficiently estimate the ITeM counts. We present a distributed implementation of the ITeM discovery algorithm using Apache Spark and GraphFrame. We evaluate our approach on both synthetic and real temporal networks.

97 MATHEMATICS AND COMPUTING↗

Unobtrusive Sensor-Based Occupancy Facing Direction Detection and Tracking Using Advanced Machine Learning Algorithms

Facing direction detection plays a critical role in human-computer interaction and has a wide application in surveillance systems, driving awareness recognition, smart home appliances, computer games, and so on. Current detection methods are mainly focused on extracting specific patterns from user's optical images, which raises concerns on privacy invasion and these detection techniques do not usually work in a dark environment. To address these concerns, here this paper proposes an activity recognition system guided by an unobtrusive sensor (ARGUS). By using a low pixel infrared thermopile array sensor, ARGUS is capable of identifying five facing directions (left 45°/90°, right 45°/90°, and front) through the support vector machine classifier. Also two feature extraction methods are compared. One is manually-defined and the other is based on a pre-trained convolutional neural network (CNN) model. The facing direction detection accuracy resulting from manually-defined features reaches 85.3%, 90.6%, and 85.2% at detection distance of 0.6, 1.2, and 1.8 m, respectively. The level of accuracy resulted from using pre-trained CNN features demonstrates a much more reliable performance (89.1%, 95.3%, and 95.1% at distance of 0.6, 1.2, and 1.8 m, respectively). In addition, ARGUS has been successfully applied for occupancy tracking with a root mean square error of 0.19 m.

42 ENGINEERING↗

Search for non-resonant Higgs boson pair production in the $2b+2\ell +{E}_{\textrm{T}}^{\textrm{miss}}$ final state in pp collisions at $\sqrt{s}$ = 13 TeV with the ATLAS detector

A search for non-resonant Higgs boson pair (HH) production is presented, in which one of the Higgs bosons decays to a b-quark pair ($b\bar{b}$) and the other decays to WW * , ZZ * , or τ + τ – , with in each case a final state with ℓ + ℓ – + neutrinos (ℓ = e, μ). The analysis targets separately the gluon-gluon fusion and vector boson fusion production modes. Data recorded by the ATLAS detector in proton-proton collisions at a centre-of-mass energy of 13 TeV at the Large Hadron Collider, corresponding to an integrated luminosity of 140 fb –1 , are used in this analysis. Events are selected to have exactly two b-tagged jets and two leptons with opposite electric charge and missing transverse momentum in the final state. These events are classified using multivariate analysis algorithms to separate the HH events from other Standard Model processes. No evidence of the signal is found. The observed (expected) upper limit on the cross-section for non-resonant Higgs boson pair production is determined to be 9.7 (16.2) times the Standard Model prediction at 95% confidence level. The Higgs boson self-interaction coupling parameter κ λ and the quadrilinear coupling parameter κ 2V are each separately constrained by this analysis to be within the ranges [–6.2, 13.3] and [–0.17, 2.4], respectively, at 95% confidence level, when all other parameters are fixed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Extending Classification Algorithms to Case-Control Studies

Classification is a common technique applied to ’omics data to build predictive models and identify potential markers of biomedical outcomes. Despite the prevalence of case-control studies, the number of classification methods available to analyze data generated by such studies is extremely limited. Conditional logistic regression is the most commonly used technique, but the associated modeling assumptions limit its ability to identify a large class of sufficiently complicated ’omic signatures. We propose a data preprocessing step which generalizes and makes any linear or nonlinear classification algorithm, even those typically not appropriate for matched design data, available to be used to model case-control data and identify relevant biomarkers in these study designs. We demonstrate on simulated case-control data that both the classification and variable selection accuracy of each method is improved after applying this processing step and that the proposed methods are comparable to or outperform existing variable selection methods. Finally, we demonstrate the impact of conditional classification algorithms on a large cohort study of children with islet autoimmunity.

59 BASIC BIOLOGICAL SCIENCES↗

A QUBO formulation for top-τ eigencentrality nodes

The efficient calculation of the centrality or “hierarchy” of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity. In this work we lay the foundations for solving the eigencentrality problem of ranking the importance of the nodes of a network with scores from the eigenvector of the network, using quantum computational paradigms such as quantum annealing and gate-based quantum computing. The problem is reformulated as a quadratic unconstrained binary optimization (QUBO) that can be solved on both quantum architectures. The results focus on correctly identifying a given number of the most important nodes in numerous networks given by the sparse vector solution of our QUBO formulation of the problem of identifying the top- τ highest eigencentrality nodes in a network on both the D-Wave and IBM quantum computers.

97 MATHEMATICS AND COMPUTING↗

Investigation of Portable Event-Based Monte Carlo Transport Using the NVIDIA Thrust Library

Power consumption considerations are driving future high performance computing platforms toward many-core computing architectures. Los Alamos National Laboratory's Trinity machine, available in 2016, will use both Intel Xeon Haswell processors and Intel Xeon Phi Knights Landing many integrated core (MIC) architecture coprocessors. Lawrence Livermore National Laboratory's Sierra machine, available in 2018, will use an IBM PowerPC architecture along with Nvidia graphics processing unit (GPU) architecture accelerators. These different advanced architectures make the computing landscape in upcoming years complex. Traditional approaches to Monte Carlo transport do not work efficiently on these new computing platforms. MIC architectures require vectorization to operate efficiently, and vectorization is difficult to achieve in Monte Carlo transport. GPU architectures require additional code to explicitly use the hardware, requiring significant code changes or hardware specific branches in the source code. A significant challenge for Monte Carlo transport projects is to simultaneously support within a single source code base efficient simulations for both the current generation of architectures and the different advanced computing architectures. In order to address these challenges, two important changes are typically required: a new algorithmic approach for solving Monte Carlo transport, and explicit use of hardware specific software. In this paper, we describe initial research investigations of an event-based Monte Carlo transport algorithm implemented using the Nvidia Thrust library on a GPU for a Monte Carlo test code. The event-based algorithm targets many-core architectures by increasing SIMD (single instruction multiple data) parallelism, while Thrust potentially provides portable performance by allowing one source code base to compile code targeted for both CPUs and GPUs. We described preliminary investigations of portable event-based Monte Carlo algorithms implemented using the Nvidia Thrust library in a research Monte Carlo test code. We found that an explicit CUDA implementation of an event-based Monte Carlo algorithm performed significantly more efficiently than a Thrust implementation on GPU platforms, most likely as a result of additional flexibility in access to different memory spaces on the GPU. Additionally, we showed that on GPU platforms and at large enough problem sizes the event-based implementations perform more efficiently than the serial history-based implementation running on the host CPU. While investigating this problem, we also discovered that the performance of the event-based algorithm is affected by what tallies are being used. A zonal scalar flux tally requires atomic operations that significantly impacted the performance of the code, in some cases producing slowdowns instead of speedups. We decided to remove the tally in order to focus on the effectiveness of the event-based algorithm. Future work will be required to research more effective ways of handling such tallies. Additionally, we would like to consider new ways for optimizing both the Thrust and CUDA versions, in order to see how much performance we have yet to achieve. The potential trade-off between portability and performance was demonstrated in this investigation. Thrust provides both CPU and GPU versions of the code in one code base, but it does so at a cost. We discovered approximately a factor of 2-5 performance difference between Thrust and CUDA on each GPU platform we tested. Thrust provides a tool to access the GPUs with less effort and specialization, but it does so by giving up fine grained control where extra performance can be found for this application. Future work will be required to determine whether this performance differential between Thrust and CUDA can be reduced for event-based Monte Carlo transport. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Predicting novel substrates for enzymes with minimal experimental effort with active learning

Enzymatic substrate promiscuity is more ubiquitous than previously thought, with significant consequences for understanding metabolism and its application to biocatalysis. This realization has given rise to the need for efficient characterization of enzyme promiscuity. Enzyme promiscuity is currently characterized with a limited number of human-selected compounds that may not be representative of the enzyme's versatility. While testing large numbers of compounds may be impractical, computational approaches can exploit existing data to determine the most informative substrates to test next, thereby more thoroughly exploring an enzyme's versatility. Here, to demonstrate this, we used existing studies and tested compounds for four different enzymes, developed support vector machine (SVM) models using these datasets, and selected additional compounds for experiments using an active learning approach. SVMs trained on a chemically diverse set of compounds were discovered to achieve maximum accuracies of similar to 80% using similar to 33% fewer compounds than datasets based on all compounds tested in existing studies. Active learning-selected compounds for testing resolved apparent conflicts in the existing training data, while adding diversity to the dataset. Finally, the application of these algorithms to wide arrays of metabolic enzymes would result in a library of SVMs that can predict high-probability promiscuous enzymatic reactions and could prove a valuable resource for the design of novel metabolic pathways.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Vehicle Position Detection Based on Machine Learning Algorithms in Dynamic Wireless Charging

Dynamic wireless charging (DWC) has emerged as a viable approach to mitigate range anxiety by ensuring continuous and uninterrupted charging for electric vehicles in motion. DWC systems rely on the length of the transmitter, which can be categorized into long-track transmitters and segmented coil arrays. The segmented coil array, favored for its heightened efficiency and reduced electromagnetic interference, stands out as the preferred option. However, in such DWC systems, the need arises to detect the vehicle’s position, specifically to activate the transmitter coils aligned with the receiver pad and de-energize uncoupled transmitter coils. This paper introduces various machine learning algorithms for precise vehicle position determination, accommodating diverse ground clearances of electric vehicles and various speeds. Through testing eight different machine learning algorithms and comparing the results, the random forest algorithm emerged as superior, displaying the lowest error in predicting the actual position.

47 OTHER INSTRUMENTATION↗

Jet tagging in the Lund plane with graph networks

The identification of boosted heavy particles such as top quarks or vector bosons is one of the key problems arising in experimental studies at the Large Hadron Collider. In this article, we introduce LundNet, a novel jet tagging method which relies on graph neural networks and an efficient description of the radiation patterns within a jet to optimally disentangle signatures of boosted objects from background events. We apply this framework to a number of different benchmarks, showing significantly improved performance for top tagging compared to existing state-of-the-art algorithms. We study the robustness of the LundNet taggers to non-perturbative and detector effects, and show how kinematic cuts in the Lund plane can mitigate overfitting of the neural network to model-dependent contributions. Finally, we consider the computational complexity of this method and its scaling as a function of kinematic Lund plane cuts, showing an order of magnitude improvement in speed over previous graph-based taggers.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Aperture‐Synthesis Radar Imaging With Compressive Sensing for Ionospheric Research

Abstract Inverse methods involving compressive sensing are tested in the application of two‐dimensional aperture‐synthesis imaging of radar backscatter from field‐aligned plasma density irregularities in the ionosphere. We consider basis pursuit denoising, implemented with the fast iterative shrinkage thresholding algorithm, and orthogonal matching pursuit (OMP) with a wavelet basis in the evaluation. These methods are compared with two more conventional optimization methods rooted in entropy maximization (MaxENT) and adaptive beamforming (linearly constrained minimum variance or often “Capon's Method.”) Synthetic data corresponding to an extended ionospheric radar target are considered. We find that MaxENT outperforms the other methods in terms of its ability to recover imagery of an extended target with broad dynamic range. Fast iterative shrinkage thresholding algorithm performs reasonably well but does not reproduce the full dynamic range of the target. It is also the most computationally expensive of the methods tested. OMP is very fast computationally but prone to a high degree of clutter in this application. We also point out that the formulation of MaxENT used here is very similar to OMP in some respects, the difference being that the former reconstructs the logarithm of the image rather than the image itself from basis vectors extracted from the observation matrix. MaxENT could in that regard be considered a form of compressive sensing.

Hysell, D. L.↗

Approximate l-Fold Cross-Validation with Least Squares SVM and Kernel Ridge Regression

Kernel methods have difficulties scaling to large modern data sets. The scalability issues are based on computational and memory requirements for working with a large matrix. These requirements have been addressed over the years by using low-rank kernel approximations or by improving the solvers' scalability. However, Least Squares Support Vector Machines (LS-SVM), a popular SVM variant, and Kernel Ridge Regression still have several scalability issues. In particular, the O(n^3) computational complexity for solving a single model, and the overall computational complexity associated with tuning hyper parameters are still major problems. We address these problems by introducing an O(nlog n) approximate l-fold cross-validation method that uses a multi-level circulant matrix to approximate the kernel. In addition, we prove our algorithm's computational complexity and present empirical runtimes on data sets with approximately one million data points. We also validate our approximate method's effectiveness at selecting hyper parameters on real world and standard benchmark data sets. Lastly, we provide experimental results on using a multi level circulant kernel approximation to solve LS-SVM problems with hyper parameters selected using our method.

Computer Science↗

Assessment of Machine Learning for Ultrasonic Nondestructive Evaluation of Alkali–Silica Reaction in Concrete

Alkali–silica reaction (ASR) is a type of material degradation in concrete structures that leads to concrete cracking and rebar corrosion, thereby reducing the material’s structural integrity and the overall structure’s lifetime and raising safety concerns. Ultrasonic nondestructive evaluation (NDE) has been proven to be a valuable technique for assessing concrete properties and monitoring ASR progression in concrete. However, the deployment and analysis of ultrasonic NDE and its data requires specialized expertise, often relying on the engineer’s subjective interpretation. With the surge in computational power, artificial intelligence (AI) and machine learning (ML) algorithms have become popular in automating NDE data analysis. Various industrial sectors are increasingly adopting ML algorithms for NDE data analysis with a growing emphasis on AI–assisted automation. Regulatory agencies are also preparing for this technological shift, anticipating corresponding revisions in standards. Thus, there is an urgent need to identify the capabilities and limitations of current ML technologies for the evaluation of concrete material properties and damage status. Furthermore, the effects of various factors on ML model performance must be thoroughly investigated. The study summarized herein evaluated the effectiveness of two ML models (i.e., support vector regression (SVR) and deep neural network (DNN)) in predicting concrete material damage induced by ASR based on the long-term ultrasonic monitoring data. Four distinct concrete specimens were cast with artificially induced ASR, and over a period exceeding 500 days, ultrasonic signals and expansion data were continuously collected. For the SVR model, wave velocity and 12 other wave features were extracted from the ultrasonic signals, with 6 out of 13 features selected as input for the model. Different combinations of training and testing datasets were designed to explore factors influencing prediction performance, including the range of data within training and testing sets, in addition to various signal preprocessing methodologies. These findings suggest the importance of using a training dataset with a broader data range compared with testing datasets for improved model performance alongside consistent signal preprocessing across datasets.

36 MATERIALS SCIENCE↗

OrigenArp Primer: How to Perform Isotopic Depletion and Decay Calculations with SCALE/ORIGEN

The SCALE (Standardized Computer Analyses for Licensing Evaluation) computer software system developed at Oak Ridge National Laboratory is widely used and accepted around the world for nuclear analyses. ORIGEN-ARP is a SCALE isotopic depletion and decay analysis sequence used to perform point-depletion calculations with the well-known ORIGEN-S code using problem-dependent cross sections. Problem-dependent cross-section libraries are generated using the ARP (Automatic Rapid Processing) module using an interpolation algorithm that operates on pre-generated libraries created for a range of fuel properties and operating conditions. Methods are provided in SCALE to generate these libraries using one-, two-, and three-dimensional transport codes. The interpolation of cross sections for uranium-based fuels may be performed for the variables burnup, enrichment, and water density. An option is also available to interpolate cross sections for mixed-oxide (MOX) fuels using the variables burnup, plutonium content, plutonium isotopic vector, and water moderator density. This primer is designed to help a new user understand and use ORIGEN-ARP with the OrigenArp Windows graphical user interface in SCALE. It assumes that the user has a college education in a technical field. There is no assumption of familiarity with nuclear depletion codes in general or with SCALE/ORIGEN-ARP in particular. The primer is based on SCALE 6 but should be applicable to earlier or later versions of SCALE. Information is included to help new users, along with several sample problems that walk the user through the different input forms and menus and illustrate the basic features. References to related documentation are provided. The primer provides a starting point for the nuclear analyst who uses SCALE/ORIGEN-ARP. Complete descriptions are provided in the SCALE documentation. Although the primer is self-contained, it is intended as a companion volume to the SCALE documentation. The SCALE Manual is provided on the SCALE installation DVD.

Bowman, Stephen M↗

Analysis of Three Body Decays in Quasi-Real Photoproduction

This thesis presents preliminary measurements of the moments of angular distribution for the K?K+ mesonic final state using a quasi-real, linearly polarised photon. Two of the main points of focus for this analysis were the development of the formalism for photoproduced vector-pseudoscalar decay and the tools by which the analysis was carried out. The formalism described how the moments of angular distribution could be extracted from the angular decay variables, and how they related to resonance decays in terms of partial waves. In extracting the moments, it was found that adapted Markov Chain Monte Carlo (MCMC) methods proved to be more effective in terms of extracting results from the data compared to the sole use of gradient descent based fitting algorithms. These measurements are complementary to other decay channels and production mechanisms, with the global aim of probing the existence of exotic mesons. Data from this analysis was taken by the CLAS collaboration at the Thomas Jefferson National Accelerator Facility (JLab) by scattering from a liquid hydrogen target using a 10.6 GeV electron. This work was done within the MesonEx program at CLAS12 that aims to map the spectrum of mesons, and in doing so, gain a greater understanding of Quantum ChromoDynamics (QCD) and the strong force.

Wishart, Robert↗

Adsorption Hysteresis Under Control: Tuning Host–Guest Interactions via a Genetic Algorithm

Mesoporous adsorbent materials offer a large volumetric capacity; however, cyclic adsorption/desorption processes in these systems often suffer from hysteresis and may require a significant pressure swing to access this capacity. To mitigate hysteresis, a proposed strategy is to include nucleation sites on the walls of the mesoporous material to facilitate droplet and bubble formation, lowering the free energy barriers to the respective phase transitions. It is unclear, however, what combination of adsorbate− adsorbent interactions and spatial patterning would be beneficial for a given application, considering that improvements to some sorption properties may come at the expense of other attributes. To understand these interconnected observables, we examine two model systems, planar-slit and cylindrical pores with tunable interaction sites, using GPU-accelerated transition matrix Monte Carlo simulations. The simulations provide a free energy map of the pressure−adsorption space in a matter of minutes, which we use to track adsorption isotherm characteristics as a function of adsorbent properties. We then leverage the rapid acquisition of simulation data to construct a genetic algorithm to iteratively modify interaction sites of the slit-pore wall to minimize the hysteresis of this system without sacrificing uptake. We find that the adsorption branch of the isotherm is easily modulated via the average host−guest interaction strength, but desorption is only adjustable if there is a suitable bubble nucleation site. Within the context of a slit-pore system, we identify relative interaction strengths and patch sizes required to gain control over both branches of the hysteresis loop.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Evaluation of dose recalculation vs dose deformation in a commercial platform for deformable image registration with a computational phantom

Deformable image registration (DIR) is an important tool for mapping both dose and contours of a new set of planning images when recurrent, that is, adaptive radiotherapy, or further treatment, that is, re-treatment, is required. The aim of this study was to evaluate the need for plan recalculation in deformed anatomies and to develop a reliable workflow for validating the DIR algorithm to be applied to dose warping such as dose accumulation (DA) for adaptive radiation therapy, and dose summation (DS) in the case of re-treatment. A set of 3 computational phantoms was developed to validate the application of B-Spline-based registrations for dose mapping among the various computed tomography image data sets. Two different versions were defined for each phantom to simulate clinical needs: adaptive radiotherapy and re-treatment; a DIR was performed to obtain a displacement vector field (DVF) for dose applications. Comparison of calculated and deformed doses was carried out by means of known markers inside the virtual phantoms. The differences were evaluated using a 3% dose index as acceptance criteria. A paired Wilcoxon signed-rank test was carried out to test the statistical significance of differences within the markers. Significant differences were only observed for the deformed dose in the DA test; no significant differences were observed for recalculated dose values in the DA and DS tests. The dose index is in accordance with these results. The warping dose process obtained by registering various sets of images was validated; a recalculation approach seems to be more accurate for DA purposes and image-guided adaptive radiation therapy (IGART) applications.

62 RADIOLOGY AND NUCLEAR MEDICINE↗