Search NASA⌕ Search

SEARCH · Search NASA

Results for “applied computing”

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 1,279 records · Page 71

HIResist: a database of HIV-1 resistance to broadly neutralizing antibodies

Changing the course of the human immunodeficiency virus type I (HIV-1) pandemic is a high public health priority with approximately 39 million people currently living with HIV-1 (PLWH) and about 1.5 million new infections annually worldwide. Broadly neutralizing antibodies (bnAbs) typically target highly conserved sites on the HIV-1 envelope glycoproteins (Envs), which mediate viral entry, and block the infection of diverse HIV-1 strains. But different mechanisms of HIV-1 resistance to bnAbs prevent robust application of bnAbs for therapeutic and preventive interventions. Here we report the development of a new database that provides data and computational tools to aid the discovery of resistant features and may assist in analysis of HIV-1 resistance to bnAbs. Bioinformatic tools allow identification of specific patterns in Env sequences of resistant strains and development of strategies to elucidate the mechanisms of HIV-1 escape; comparison of resistant and sensitive HIV-1 strains for each bnAb; identification of resistance and sensitivity signatures associated with specific bnAbs or groups of bnAbs; and visualization of antibody pairs on cross-sensitivity plots. The database has been designed with a particular focus on user-friendly and interactive interface. Our database is a valuable resource for the scientific community and provides opportunities to investigate patterns of HIV-1 resistance and to develop new approaches aimed to overcome HIV-1 resistance to bnAbs.

60 APPLIED LIFE SCIENCES↗

CSGL: chemical synthesis graph learning for molecule representation

Abstract Motivation Molecule representation learning (MRL) translates molecules into a real vector space, serving as input to downstream tasks in biology, chemistry, and computer science. This article introduces a chemical synthesis graph learning (CSGL) framework, which enhances MRL by considering both the atomic structures of molecules and their roles in chemical reactions through a hierarchical graph representation. Specifically, molecules are first modeled based on their molecular graphs, which capture atomic-level structural information. They are then further refined using a chemical synthesis graph, where nodes represent reactant and product molecule sets, and edges encode chemical transformations between reactants and products (e.g. changes in molecular structures). CSGL optimizes molecular embeddings of reactant and product nodes in a fashion that ensures the embeddings conform to a chemical balance constraint. Results Experimental results show that our method CSGL achieves strong performance on a variety of tasks, including product prediction, reaction classification, and molecular property prediction. Availability and implementation https://github.com/li-2023/CSGL.

Biochemistry & Molecular Biology↗

Algorithm sensitivity analysis and parameter tuning for tissue image segmentation pipelines

Motivation: Sensitivity analysis and parameter tuning are important processes in large-scale image analysis. They are very costly because the image analysis workflows are required to be executed several times to systematically correlate output variations with parameter changes or to tune parameters. An integrated solution with minimum user interaction that uses effective methodologies and high performance computing is required to scale these studies to large imaging datasets and expensive analysis workflows. Results: The experiments with two segmentation workflows show that the proposed approach can (i) quickly identify and prune parameters that are non-influential; (ii) search a small fraction (about 100 points) of the parameter search space with billions to trillions of points and improve the quality of segmentation results (Dice and Jaccard metrics) by as much as 1.42 x compared to the results from the default parameters; (iii) attain good scalability on a high performance cluster with several effective optimizations. Conclusions: Our work demonstrates the feasibility of performing sensitivity analyses, parameter studies and auto-tuning with large datasets. The proposed framework can enable the quantification of error estimations and output variations in image segmentation pipelines.

Biochemistry & Molecular Biology↗

Coarse-grained cosmological perturbation theory

Semi-analytical methods, based on Eulerian perturbation theory, are a promising tool to follow the time evolution of cosmological perturbations at small redshifts and at mildly nonlinear scales. All these schemes are based on two approximations: the existence of a smoothing scale and the single-stream approximation, where velocity dispersion of the dark matter fluid, as well as higher moments of the particle distributions, are neglected. Despite being widely recognized, these two assumptions are, in principle, incompatible, since any finite smoothing scale gives rise to velocity dispersion and higher moments at larger scales. We describe a new approach to perturbation theory, where the Vlasov and fluid equations are derived in presence of a finite coarse-graining scale: this allows a clear separation between long and short distance modes and leads to a hybrid approach where the former are treated perturbatively and the effect of the latter is encoded in external source terms for velocity, velocity dispersion, and all the higher order moments, which can be computed from N-body simulations. We apply the coarse-grained perturbation theory to the computation of the power spectrum and the cross-spectrum between density and velocity dispersion, and compare the results with N-body simulations, finding good agreement.

79 ASTRONOMY AND ASTROPHYSICS↗

Intelligent Component Monitoring for Nuclear Power Plants

Reliability and economy are two major concerns for a nuclear power generation system. Next generation nuclear power reactors are being developed to be more reliable and economic. An effective and efficient surveillance system can generously contribute toward this goal. Recent progress in computer systems and computational tools has made it necessary and possible to upgrade current surveillance/monitoring strategy for better performance. For example, intelligent computing techniques can be applied to develop algorithm that help people better understand the information collected from sensors and thus reduce human error to a new low level. Incidents incurred from human error in nuclear industry are not rare and have been proven costly. The goal of this project is to develop and test an intelligent prognostics methodology for predicting aging effects impacting long-term performance of nuclear components and systems. The approach is particularly suitable for predicting the performance of nuclear reactor systems which have low failure probabilities (e.g., less than 10-6 year-). Such components and systems are often perceived as peripheral to the reactor and are left somewhat unattended. That is, even when inspected, if they are not perceived to be causing some immediate problem, they may not be paid due attention. Attention to such systems normally involves long term monitoring and possibly reasoning with multiple features and evidence, requirements that are not best suited for humans.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization

When a classical barrier method is applied to the solution of a nonlinear programming problem with inequality constraints, the Hessian matrix of the barrier function becomes increasingly ill-conditioned as the solution is approached. As a result, it may be desirable to consider alternative numerical algorithms. We compare the performance of two methods motivated by barrier functions. The first is a stabilized form of the classical barrier method, where a numerically stable approximation to the Newton direction is used when the barrier parameter is small. The second is a modified barrier method where a barrier function is applied to a shifted form of the problem, and the resulting barrier terms are scaled by estimates of the optimal Lagrange multipliers. The condition number of the Hessian matrix of the resulting modified barrier function remains bounded as the solution to the constrained optimization problem is approached. Both of these techniques can be used in the context of a truncated-Newton method, and hence can be applied to large problems, as well as on parallel computers. In this paper, both techniques are applied to problems with bound constraints and we compare their practical behavior.

Nash, Stephen G.↗

Computational Mechanics Research and Support for Aerodynamics and Hydraulics at TFHRC, Year 2 Quarter 4 Progress Report

The computational fluid dynamics (CFD) and computational structural mechanics (CSM) focus areas at Argonne’s Transportation Research and Analysis Computing Center (TRACC) initiated a project to support and compliment the experimental programs at the Turner-Fairbank Highway Research Center (TFHRC) with high performance computing based analysis capabilities in August 2010. The project was established with a new interagency agreement between the Department of Energy and the Department of Transportation to provide collaborative research, development, and benchmarking of advanced three-dimensional computational mechanics analysis methods to the aerodynamics and hydraulics laboratories at TFHRC for a period of five years, beginning in October 2010. The analysis methods employ well benchmarked and supported commercial computational mechanics software. Computational mechanics encompasses the areas of Computational Fluid Dynamics (CFD), Computational Wind Engineering (CWE), Computational Structural Mechanics (CSM), and Computational Multiphysics Mechanics (CMM) applied in Fluid-Structure Interaction (FSI) problems. The major areas of focus of the project are wind and water effects on bridges — superstructure, deck, cables, and substructure (including soil), primarily during storms and flood events — and the risks that these loads pose to structural failure. For flood events at bridges, another major focus of the work is assessment of the risk to bridges caused by scour of stream and riverbed material away from the foundations of a bridge. Other areas of current research include modeling of the salt spray transport into bridge girders to address suitability of using weathering steel in bridges, CFD analysis of the operation of the wind tunnel in the TFHRC wind engineering laboratory, and coupling of CFD and CSM software to solve fluid structure interaction problems, primarily analysis of bridge cables in wind. This quarterly report documents technical progress on the project tasks for the period of July through September 2012.

42 ENGINEERING↗

Tool for Automated Retrieval of Generic Event Tracks (TARGET)

Methods have been developed to identify and track tornado-producing mesoscale convective systems (MCSs) automatically over the continental United States, in order to facilitate systematic studies of these powerful and often destructive events. Several data sources were combined to ensure event identification accuracy. Records of watches and warnings issued by National Weather Service (NWS), and tornado locations and tracks from the Tornado History Project (THP) were used to locate MCSs in high-resolution precipitation observations and GOES infrared (11-micron) Rapid Scan Operation (RSO) imagery. Thresholds are then applied to the latter two data sets to define MCS events and track their developments. MCSs produce a broad range of severe convective weather events that are significantly affecting the living conditions of the populations exposed to them. Understanding how MCSs grow and develop could help scientists improve their weather prediction models, and also provide tools to decision-makers whose goals are to protect populations and their property. Associating storm cells across frames of remotely sensed images poses a difficult problem because storms evolve, split, and merge. Any storm-tracking method should include the following processes: storm identification, storm tracking, and quantification of storm intensity and activity. The spatiotemporal coordinates of the tracks will enable researchers to obtain other coincident observations to conduct more thorough studies of these events. In addition to their tracked locations, their areal extents, precipitation intensities, and accumulations all as functions of their evolutions in time were also obtained and recorded for these events. All parameters so derived can be catalogued into a moving object database (MODB) for custom queries. The purpose of this software is to provide a generalized, cross-platform, pluggable tool for identifying events within a set of scientific data based upon specified criteria with the possibility of storing identified events into a searchable database. The core of the application uses an implementation of the connected component labeling (CCL) algorithm to identify areas of interest, then uses a set of criteria to establish spatial and temporal relationships between identified components. The CCL algorithm is used for identifying objects within images for computer vision. This application applies it to scientific data sets using arbitrary criteria. The most novel concept was applying a generalized CCL implementation to scientific data sets for establishing events both spatially and temporally. The combination of several existing concepts (pluggable components, generalized CCL algorithm, etc.) into one application is also novel. In addition, how the system is designed, i.e., its extensibility with pluggable components, and its configurability with a simple configuration file, is innovative. This allows the system to be applied to new scenarios with ease.

Clune, Thomas↗

EpitopeVec: linear epitope prediction using deep protein sequence embeddings

Motivation: B-cell epitopes (BCEs) play a pivotal role in the development of peptide vaccines, immuno-diagnostic reagents and antibody production, and thus in infectious disease prevention and diagnostics in general. Experimental methods used to determine BCEs are costly and time-consuming. Therefore, it is essential to develop computational methods for the rapid identification of BCEs. Although several computational methods have been developed for this task, generalizability is still a major concern, where cross-testing of the classifiers trained and tested on different datasets has revealed accuracies of 51–53%. Results: We describe a new method called EpitopeVec, which uses a combination of residue properties, modified antigenicity scales, and protein language model-based representations (protein vectors) as features of peptides for linear BCE predictions. Extensive benchmarking of EpitopeVec and other state-of-the-art methods for linear BCE prediction on several large and small datasets, as well as cross-testing, demonstrated an improvement in the performance of EpitopeVec over other methods in terms of accuracy and area under the curve. As the predictive performance depended on the species origin of the respective antigens (viral, bacterial and eukaryotic), we also trained our method on a large viral dataset to create a dedicated linear viral BCE predictor with improved cross-testing performance.

59 BASIC BIOLOGICAL SCIENCES↗

Resolving Anodic Current and Temperature Distributions in a Polymer Electrolyte Membrane Water Electrolysis Cell Using a Pseudo-Two-Phase Computational Fluid Dynamics Model

Expanding upon our prior experimental work, we constructed a three-dimensional model of a polymer electrolyte membrane water electrolyzer using computational fluid dynamics. We applied the assumption of pseudo-two-phase flow, the flow of two phases with equal velocity. Experimental data were used to obtain parameters and to determine the conditions under which this model was valid. Anodic distributions of current density, temperature, liquid saturation, and relative humidity were obtained at various flow rates. The overall current density and temperature difference from inlet to outlet at the anode agreed strongly with experimental measurements under most circumstances. This verification allowed us to further examine the apparent gas coverage calculated from experimental and model temperature data. Results suggested a low liquid saturation and low relative humidity at the anode due to the consumption of liquid water and water vapor. However, we questioned the accuracy of the pseudo-two-phase assumption at low water feed rates. We concluded that the model was applicable to systems with liquid water feed rates greater than 0.6 ml min -1 cm -2 . Therefore, it is a fair screening method that can advise which operating conditions lead to excessive temperatures or drying at the anode, thereby promoting the longevity of the membrane and catalyst.

25 ENERGY STORAGE↗

Combining protein sequences and structures with transformers and equivariant graph neural networks to predict protein function

Abstract Motivation Millions of protein sequences have been generated by numerous genome and transcriptome sequencing projects. However, experimentally determining the function of the proteins is still a time consuming, low-throughput, and expensive process, leading to a large protein sequence-function gap. Therefore, it is important to develop computational methods to accurately predict protein function to fill the gap. Even though many methods have been developed to use protein sequences as input to predict function, much fewer methods leverage protein structures in protein function prediction because there was lack of accurate protein structures for most proteins until recently. Results We developed TransFun—a method using a transformer-based protein language model and 3D-equivariant graph neural networks to distill information from both protein sequences and structures to predict protein function. It extracts feature embeddings from protein sequences using a pre-trained protein language model (ESM) via transfer learning and combines them with 3D structures of proteins predicted by AlphaFold2 through equivariant graph neural networks. Benchmarked on the CAFA3 test dataset and a new test dataset, TransFun outperforms several state-of-the-art methods, indicating that the language model and 3D-equivariant graph neural networks are effective methods to leverage protein sequences and structures to improve protein function prediction. Combining TransFun predictions and sequence similarity-based predictions can further increase prediction accuracy. Availability and implementation The source code of TransFun is available at https://github.com/jianlin-cheng/TransFun.

59 BASIC BIOLOGICAL SCIENCES↗

Integrated profiling of three dimensional cell culture models and 3D microscopy

Motivation: Our goal is to develop a screening platform for quantitative profiling of colony organizations in 3D cell culture models. The 3D cell culture models, which are also imaged in 3D, are functional assays that mimic the in vivo characteristics of the tissue architecture more faithfully than the 2D cultures. However, they also introduce significant computational challenges, with the main barriers being the effects of growth conditions, fixations and inherent complexities in segmentation that need to be resolved in the 3D volume. Results: A segmentation strategy has been developed to delineate each nucleus in a colony that overcomes (i) the effects of growth conditions, (ii) variations in chromatin distribution and (iii) ambiguities formed by perceptual boundaries from adjacent nuclei. The strategy uses a cascade of geometric filters that are insensitive to spatial nonuniformity and partitions a clump of nuclei based on the grouping of points of maximum curvature at the interface of two neighboring nuclei. These points of maximum curvature are clustered together based on their coplanarity and proximity to define dissecting planes that separate the touching nuclei. The proposed curvature-based partitioning method is validated with both synthetic and real data, and is shown to have a superior performance against previous techniques. Validation and sensitivity analysis are coupled with the experimental design that includes a non-transformed cell line and three tumorigenic cell lines, which covers a wide range of phenotypic diversity in breast cancer. Colony profiling, derived from nuclear segmentation, reveals distinct indices for the morphogenesis of each cell line.

59 BASIC BIOLOGICAL SCIENCES↗

Is stochastic thermodynamics the key to understanding the energy costs of computation?

The relationship between the thermodynamic and computational properties of physical systems has been a major theoretical interest since at least the 19th century. It has also become of increasing practical importance over the last half-century as the energetic cost of digital devices has exploded. Importantly, real-world computers obey multiple physical constraints on how they work, which affects their thermodynamic properties. Moreover, many of these constraints apply to both naturally occurring computers, like brains or Eukaryotic cells, and digital systems. Most obviously, all such systems must finish their computation quickly, using as few degrees of freedom as possible. This means that they operate far from thermal equilibrium. Furthermore, many computers, both digital and biological, are modular, hierarchical systems with strong constraints on the connectivity among their subsystems. Yet another example is that to simplify their design, digital computers are required to be periodic processes governed by a global clock. None of these constraints were considered in 20th-century analyses of the thermodynamics of computation. The new field of stochastic thermodynamics provides formal tools for analyzing systems subject to all of these constraints. We argue here that these tools may help us understand at a far deeper level just how the fundamental thermodynamic properties of physical systems are related to the computation they perform.

computation↗

Inflaton oscillations and post-inflationary reheating

We analyze in detail the perturbative decay of the inflaton oscillating about a generic form of its potential V(Φ) = Φ k , taking into account the effects of non-instantaneous reheating. We show that evolution of the temperature as a function of the cosmological scale factor depends on the spin statistics of the final state decay products when k > 2. Here, we also include the inflaton-induced mass of the final states leading to either kinematic suppression or enhancement if the final states are fermionic or bosonic respectively. We compute the maximum temperature reached after inflation, the subsequent evolution of the temperature and the final reheat temperature. We apply our results to the computation of the dark matter abundance through thermal scattering during reheating. We also provide an example based on supersymmetry for the coupling of the inflaton to matter.

supersymmetry and cosmology↗

Space Station UCS antenna pattern computation and measurement

The purpose of this paper is to analyze the interference to the Space Station Ultrahigh Frequency (UHF) Communication Subsystem (UCS) antenna radiation pattern due to its environment - Space Station. A hybrid Computational Electromagnetics (CEM) technique was applied in this study. The antenna was modeled using the Method of Moments (MOM) and the radiation patterns were computed using the Uniform Geometrical Theory of Diffraction (GTD) in which the effects of the reflected and diffracted fields from surfaces, edges, and vertices of the Space Station structures were included. In order to validate the CEM techniques, and to provide confidence in the computer-generated results, a comparison with experimental measurements was made for a 1/15 scale Space Station mockup. Based on the results accomplished, good agreement on experimental and computed results was obtained. The computed results using the CEM techniques for the Space Station UCS antenna pattern predictions have been validated.

Hwu, Shian U.↗

Control Implemented on Quantum Computers: Effects of Noise, Non-Determinism, and Entanglement

Quantum computing has advanced in recent years to the point that there are now some quantum computers and quantum simulators available to the public for use. In addition, quantum computing is beginning to receive attention within the process systems engineering community for directions such as machine learning and optimization. A logical next step for its evaluation within process systems engineering is for control, specifically, for computing control actions to be applied to process systems. In this work, we provide some initial studies regarding the implementation of control on quantum computers, including the implementation of a single-input/single-output proportional control law on a quantum simulator with noise, evaluation of potential impacts of non-determinism on theory for advanced control laws, and discussion of consequences of the way that entanglement works for next-generation manufacturing communication objectives.

Kip Nieman↗

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling

Optimal scheduling of air traffic over the entire National Airspace System is a computationally difficult task. To speed computation, Dantzig-Wolfe decomposition is applied to a known linear integer programming approach for assigning delays to flights. The optimization model is proven to have the block-angular structure necessary for Dantzig-Wolfe decomposition. The subproblems for this decomposition are solved in parallel via independent computation threads. Experimental evidence suggests that as the number of subproblems/threads increases (and their respective sizes decrease), the solution quality, convergence, and runtime improve. A demonstration of this is provided by using one flight per subproblem, which is the finest possible decomposition. This results in thousands of subproblems and associated computation threads. This massively parallel approach is compared to one with few threads and to standard (non-decomposed) approaches in terms of solution quality and runtime. Since this method generally provides a non-integral (relaxed) solution to the original optimization problem, two heuristics are developed to generate an integral solution. Dantzig-Wolfe followed by these heuristics can provide a near-optimal (sometimes optimal) solution to the original problem hundreds of times faster than standard (non-decomposed) approaches. In addition, when massive decomposition is employed, the solution is shown to be more likely integral, which obviates the need for an integerization step. These results indicate that nationwide, real-time, high fidelity, optimal traffic flow scheduling is achievable for (at least) 3 hour planning horizons.

Rios, Joseph Lucio↗