Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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,351 records · Page 75

QuaSiMo: A composable library to program hybrid workflows for quantum simulation

Abstract A composable design scheme is presented for the development of hybrid quantum/classical algorithms and workflows for applications of quantum simulation. The proposed object‐oriented approach is based on constructing an expressive set of common data structures and methods that enables programming of a broad variety of complex hybrid quantum simulation applications. The abstract core of the scheme is distilled from the analysis of the current quantum simulation algorithms. Subsequently, it allows synthesis of new hybrid algorithms and workflows via the extension, specialisation, and dynamic customisation of the abstract core classes defined by the proposed design. The design scheme is implemented using the hardware‐agnostic programming language QCOR into the QuaSiMo library. To validate the implementation, the authors test and show its utility on commercial quantum processors from IBM and Rigetti, running some prototypical quantum simulations.

97 MATHEMATICS AND COMPUTING↗

Survey of Current State of the Art Entity-Relation Extraction Tools

In the area of information extraction from text data, there exists a number of tools with the capability of extracting entities, topics, and their relationships with one another from both structured and unstructured text sources. Such information has endless uses in a number of domains, however, the solutions to getting this information are still in early stages and has room for improvement. The topic has been explored from a research perspective by academic institutions, as well as formal tool creation from corporations but has not made much advancement since the early 2000's. Overall, entity extraction, and the related topic of entity linking, is common among these tools, though with varying degrees of accuracy, while relationship extraction is more difficult to find and seems limited to same sentence analysis. In this report, we take a look at the top state of the art tools currently available and identify their capabilities, strengths, and weaknesses. We explore the common algorithms in the successful approaches to entity extraction and their ability to efficiently handle both structured and unstructured text data. Finally, we highlight some of the common issues among these tools and summarize the current ability to extract relationship information.

97 MATHEMATICS AND COMPUTING↗

Algorithms and algebraic solutions of decay chain differential equations for stable and unstable nuclide fractionation

Radioactive decay processes, such as alpha decay, produce decay chains where the mass numbers of nuclides decrease as larger nuclides expel energetic particles to form smaller nuclides. Under these conditions, the coefficient matrix that describes the differential rate expressions for radioactive decay can be made lower triangular. With this special structure, formulating an algebraic solution to the decay chains can be done by first formulating the eigenvectors that make up the coefficient matrix, which can then be solved using forward substitution for a lower triangular matrix. This work details the derivation of algebraic solutions for decay chains of any number of stable and unstable nuclides with any number of branching based on this eigenvector analysis. A prototype computational code was developed to validate and compare this methodology against a number of other methods for solving similar systems. A two-phase sorting algorithm yielding the lower triangular matrix structure was established to apply the developed algebraic solutions for decay chains involving beta-emitting radionuclides transformed into daughter nuclides without change in their mass number. In conclusion, the methodologies produced in this work provide an efficient way to estimate nuclide fractions from natural decay processes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

RLMolLM: Reinforcement Learning-Enhanced Language Model Framework for Inverse Molecular Design

Inverse molecular design faces significant challenges due to vast chemical space and complex property requirements. While language models show promise for molecular generation, they struggle with validity, multi-property optimization, and structural constraints. This work presents RLMolLM, a reinforcement learning framework combining Proximal Policy Optimization (PPO) with genetic algorithms to address these limitations. Our approach optimizes multiple user-specified properties including quantitative estimates of drug-likeness (QED), synthetic accessibility (SA), and ADMET (absorption, distribution, metabolism, excretion, and toxicity) endpoints without requiring complete model retraining, while maintaining capability for scaffold-constrained generation where specific substructures must be preserved. We outperform state-of-the-art methods for molecular optimization, achieving best QED scores across GDB13, Moses, and Zinc datasets with up to 31% improvement over previous methods while maintaining excellent validity, uniqueness, and novelty metrics. For simultaneous multi-property optimization, our framework achieves substantial improvements in ADMET properties including 4.5-fold reduction in hERG toxicity and enhanced Caco-2 permeability compared to Moses dataset. Under structural constraints, the framework significantly improves molecular validity while preserving scaffolds and effectively optimizing properties. In conclusion, this versatile solution advances pharmaceutical and materials molecular design through effective integration of reinforcement learning and genetic algorithms with multi-property optimization and scaffold preservation.

Genetic algorithms↗

SU-F-J-98: Improvement and Evaluation Of Deformation Image Registration On Parotid Glands During Radiation Therapy for Nasopharyngeal Cancer

Purpose: To quantitatively evaluate the strategic innovation and accuracy variation of deformation registration algorithm for parotid glands using the similarity Dice coefficient during the course of radiation therapy (RT) for nasopharyngeal cancer (NPC). Methods: Daily MVCT data for 10 patients with pathologically proven nasopharyngeal cancers were analyzed. The data were acquired using tomotherapy (TomoTherapy, Accuray) at the PLA General Hospital. The prescription dose to the primary target was 70Gy in 33 fractions. Two kinds of contours for parotid glands on daily MVCTs were obtained by populating these contours from planning CTs to the daily CTs via rigid-body registration with or without the rotation shifts using the in-house tools and the Adaptive plan software (Adaptive Plan, TomoTherapy), and were edited manually if necessary. The diffeomorphic Demons algorithm developed in the in-house tool was used to propagate the parotid structures from the daily CTs to planning CTs. The differences of the mapped parotid contours in two methods were evaluated using Dice similarity index (DSI). Two-tailed t-test analysis was carried out to compare the DSI changes during the course of RT. Results: For 10 patient plans, the accuracy of deformation image registration (DIR) with the rotation shift was obviously better than those without the rotation shift. The Dice scores of the ipsi- and contra-lateral parotids for with and without the rotation shifts were found to be correlated with each other [0.904±0.031 vs 0.919±0.030 (p<0.001); 0.900±0.031 vs 0.910±0.032 (p<0.001)]. The Dice scores for the parotids have shown the reduction with the changes of parotid volumes during RT. The DSI values between the first and last fraction were 0.932±0.020 vs 0.899±0.030 in 10 patient plans. Conclusion: DIR was successfully improved using the strategic innovation for ART. And the decrease of DIR accuracy has also been found during the delivery of fractionated radiotherapy. This work was supported in part by the grant from Chinese Natural Science Foundation (Grant No. 11105225).

60 APPLIED LIFE SCIENCES↗

PTM‐Psi : A python package to facilitate the computational investigation of p ost‐ t ranslational m odification on p rotein s tructures and their i mpacts on dynamics and functions

Abstract Post‐translational modification (PTM) of a protein occurs after it has been synthesized from its genetic template, and involves chemical modifications of the protein's specific amino acid residues. Despite of the central role played by PTM in regulating molecular interactions, particularly those driven by reversible redox reactions, it remains challenging to interpret PTMs in terms of protein dynamics and function because there are numerous combinatorially enormous means for modifying amino acids in response to changes in the protein environment. In this study, we provide a workflow that allows users to interpret how perturbations caused by PTMs affect a protein's properties, dynamics, and interactions with its binding partners based on inferred or experimentally determined protein structure. This Python‐based workflow, called PTM‐Psi , integrates several established open‐source software packages, thereby enabling the user to infer protein structure from sequence, develop force fields for non‐standard amino acids using quantum mechanics, calculate free energy perturbations through molecular dynamics simulations, and score the bound complexes via docking algorithms. Using the S ‐nitrosylation of several cysteines on the GAP2 protein as an example, we demonstrated the utility of PTM‐Psi for interpreting sequence–structure–function relationships derived from thiol redox proteomics data. We demonstrate that the S ‐nitrosylated cysteine that is exposed to the solvent indirectly affects the catalytic reaction of another buried cysteine over a distance in GAP2 protein through the movement of the two ligands. Our workflow tracks the PTMs on residues that are responsive to changes in the redox environment and lays the foundation for the automation of molecular and systems biology modeling.

59 BASIC BIOLOGICAL SCIENCES↗

Inversion of dynamical Bragg intensities to complex structure factors by iterated projections. For Ultramic. 2020. ("Pico" Festschrift, May 2021)

We discuss a method for recovering complex structure factors from many simultaneously excited Bragg beam intensities is described. The method is applied to simulated transmission electron diffraction data over a wide range of crystal thickness and beam energies. The method is based on iterated projections between structure and scattering matrices, which are related by a matrix unitary transformation, exponential, which we invert. The algorithm removes multiple-scattering perturbations from diffraction data and might be extended to other fields, including X-ray and neutron diffraction and cryo-electron microscopy. Because coherent multiple scattering involves interference between Bragg beams, the method also solves the phase problem. Unlike dynamical inversion from electron microscope images or ptychography data, the method, which starts with Bragg beam intensities, provides complex structure factors unaffected by focusing errors or resolution limitations imposed by lenses. We provide inversions from simulated data with 441 simultaneously excited Bragg beams over a range of thickness and beam energy. We discuss the retrieval of chirality information from enantiomorphs, the efficient incorporation of symmetry information using the irreducible representation of the group of structure matrices, and the effect of HOLZ lines to provide three-dimensional information.

97 MATHEMATICS AND COMPUTING↗

Functional Classification of Immune Regulatory Proteins

Members of the immunoglobulin superfamily (IgSF) control innate and adaptive immunity and are prime targets for the treatment of autoimmune diseases, infectious diseases, and malignancies. We describe a computational method, termed the Brotherhood algorithm, which utilizes intermediate sequence information to classify proteins into functionally related families. This approach identifies functional relationships within the IgSF and predicts additional receptor-ligand interactions. As a specific example, we examine the nectin/nectin-like family of cell adhesion and signaling proteins and propose receptor-ligand interactions within this family. We were guided by the Brotherhood approach and present the high-resolution structural characterization of a homophilic interaction involving the class-I MHC-restricted T-cell-associated molecule, which we now classify as a nectin-like family member. The Brotherhood algorithm is likely to have a significant impact on structural immunology by identifying those proteins and complexes for which structural characterization will be particularly informative.

59 BASIC BIOLOGICAL SCIENCES↗

NAPAbench 2: A network synthesis algorithm for generating realistic protein-protein interaction (PPI) network families

Comparative network analysis provides effective computational means for gaining novel insights into the structural and functional compositions of biological networks. In recent years, various methods have been developed for biological network alignment, whose main goal is to identify important similarities and critical differences between networks in terms of their topology and composition. A major impediment to advancing network alignment techniques has been the lack of gold-standard benchmarks that can be used for accurate and comprehensive performance assessment of such algorithms. The original NAPAbench (network alignment performance assessment benchmark) was developed to address this problem, and it has been widely utilized by many researchers for the development, evaluation, and comparison of novel network alignment techniques. In this work, we introduce NAPAbench 2—a major update of the original NAPAbench that was introduced in 2012. NAPAbench 2 includes a completely redesigned network synthesis algorithm that can generate protein-protein interaction (PPI) network families whose characteristics closely match those of the latest real PPI networks. Furthermore, the network synthesis algorithm comes with an intuitive GUI that allows users to easily generate PPI network families with an arbitrary number of networks of any size, according to a flexible user-defined phylogeny. In addition, NAPAbench 2 provides updated benchmark datasets—created using the redesigned network synthesis algorithm—which can be used for comprehensive performance assessment of network alignment algorithms and their scalability.

42 ENGINEERING↗

Adjoint-based optimization of mechanical performance in polycrystalline materials and structures through texture control

The texture of a polycrystalline material refers to the preferred orientation of the grains within the material. In metallic materials, texture can significantly affect the mechanical properties such as elastic moduli, yield stress, strain hardening, and fracture toughness. Recent advances in additive manufacturing of metallic materials offer the possibility in the not too distant future of controlling the spatial variation of texture. In this work, we investigate the advantages, in terms of mechanical performance, of allowing the texture to vary spatially. We use an adjoint-based gradient optimization algorithm within a finite element solver (COMSOL) to optimize several engineering quantities of interest in a simple structure (hole in a plate) and loading (uniaxial tension) condition. As a first step to general texture optimization, we consider the idealized case of a pure fiber texture in which the homogenized properties are transversely isotropic. In this special case, the only spatially varying design variables are the three Euler angles that prescribe the orientation of the homogenized material at each point within the structure. This work paves a new way to design metallic materials for tunable mechanical properties at the microstructure level.

36 MATERIALS SCIENCE↗

Quantifying model-structure- and parameter-driven uncertainties in spring wheat phenology prediction with Bayesian analysis

Recent international efforts have brought renewed emphasis on the comparison of different agricultural systems models. Thus far, analysis of model-ensemble simulated results has not clearly differentiated between ensemble prediction uncertainties due to model structural differences per se and those due to parameter value uncertainties. Additionally, despite increasing use of Bayesian parameter estimation approaches with field-scale crop models, inadequate attention has been given to the full posterior distributions for estimated parameters. The objectives of this study were to quantify the impact of parameter value uncertainty on prediction uncertainty for modeling spring wheat phenology using Bayesian analysis and to assess the relative contributions of model-structure-driven and parameter-value-driven uncertainty to overall prediction uncertainty. This study used a random walk Metropolis algorithm to estimate parameters for 30 spring wheat genotypes using nine phenology models based on multi-location trial data for days to heading and days to maturity. Across all cases, parameter-driven uncertainty accounted for between 19 and 52% of predictive uncertainty, while model-structure-driven uncertainty accounted for between 12 and 64%. Here, this study demonstrated the importance of quantifying both model-structure- and parameter-value-driven uncertainty when assessing overall prediction uncertainty in modeling spring wheat phenology. More generally, Bayesian parameter estimation provided a useful framework for quantifying and analyzing sources of prediction uncertainty.

60 APPLIED LIFE SCIENCES↗

Scanning holographic optical tweezers

The aim of this Letter is to introduce a new optical tweezers approach, called scanning holographic optical tweezers (SHOT), which drastically increases the working area (WA) of the holographic-optical tweezers (HOT) approach, while maintaining tightly focused laser traps. A 12-fold increase in the WA is demonstrated. The SHOT approach achieves its utility by combining the large WA of the scanning optical tweezers (SOT) approach with the flexibility of the HOT approach for simultaneously moving differently structured optical traps in and out of the focal plane. This Letter also demonstrates a new heuristic control algorithm for combining the functionality of the SOT and HOT approaches to efficiently allocate the available laser power among a large number of traps. The proposed approach shows promise for substantially increasing the number of particles that can be handled simultaneously, which would enable optical tweezers additive fabrication technologies to rapidly assemble microgranular materials and structures in reasonable build times.

42 ENGINEERING↗

P finder: genomic and metagenomic annotation of RNase P RNA gene (rnpB)

Abstract Background The rnpB gene encodes for an essential catalytic RNA (RNase P). Like other essential RNAs, RNase P’s sequence is highly variable. However, unlike other essential RNAs (i.e. tRNA, 16 S, 6 S,...) its structure is also variable with at least 5 distinct structure types observed in prokaryotes. This structural variability makes it labor intensive and challenging to create and maintain covariance models for the detection of RNase P RNA in genomic and metagenomic sequences. The lack of a facile and rapid annotation algorithm has led to the rnpB gene being the most grossly under annotated essential gene in completed prokaryotic genomes with only a 24% annotation rate. Here we describe the coupling of the largest RNase P RNA database with the local alignment scoring algorithm to create the most sensitive and rapid prokaryote rnpB gene identification and annotation algorithm to date. Results Of the 2772 completed microbial genomes downloaded from GenBank only 665 genomes had an annotated rnpB gene. We applied P Finder to these genomes and were able to identify 2733 or nearly 99% of the 2772 microbial genomes examined. From these results four new rnpB genes that encode the minimal T-type P RNase P RNAs were identified computationally for the first time. In addition, only the second C-type RNase P RNA was identified in Sphaerobacter thermophilus . Of special note, no RNase P RNAs were detected in several obligate endosymbionts of sap sucking insects suggesting a novel evolutionary adaptation. Conclusions The coupling of the largest RNase P RNA database and associated structure class identification with the P Finder algorithm is both sensitive and rapid, yielding high quality results to aid researchers annotating either genomic or metagenomic data. It is the only algorithm to date that can identify challenging RNAse P classes such as C-type and the minimal T-type RNase P RNAs. P Finder is written in C# and has a user-friendly GUI that can run on multiple 64-bit windows platforms (Windows Vista/7/8/10). P Finder is free available for download at https://github.com/JChristopherEllis/P-Finder as well as a small sample RNase P RNA file for testing.

59 BASIC BIOLOGICAL SCIENCES↗

The role of information structures in game-theoretic multi-agent learning

Multi-agent learning (MAL) studies how agents learn to behave optimally and adaptively from their experience when interacting with other agents in dynamic environments. The outcome of a MAL process is jointly determined by all agents’ decision-making. Hence, each agent needs to think strategically about others’ sequential moves, when planning future actions. The strategic interactions among agents makes MAL go beyond the direct extension of single-agent learning to multiple agents. With the strategic thinking, each agent aims to build a subjective model of others decision-making using its observations. Such modeling is directly influenced by agents’ perception during the learning process, which is called the information structure of the agent’s learning. As it determines the input to MAL processes, information structures play a significant role in the learning mechanisms of the agents. This review creates a taxonomy of MAL and establishes a unified and systematic way to understand MAL from the perspective of information structures. Here we define three fundamental components of MAL: the information structure (i.e., what the agent can observe), the belief generation (i.e., how the agent forms a belief about others based on the observations), as well as the policy generation (i.e., how the agent generates its policy based on its belief). In addition, this taxonomy enables the classification of a wide range of state-of-the-art algorithms into four categories based on the belief-generation mechanisms of the opponents, including stationary, conjectured, calibrated, and sophisticated opponents. We introduce Value of Information (VoI) as a metric to quantify the impact of different information structures on MAL. Finally, we discuss the strengths and limitations of algorithms from different categories and point to promising avenues of future research.

97 MATHEMATICS AND COMPUTING↗

A generalized Poisson solver for first-principles device simulations

Electronic structure calculations of atomistic systems based on density functional theory involve solving the Poisson equation. In this paper, we present a plane-wave based algorithm for solving the generalized Poisson equation subject to periodic or homogeneous Neumann conditions on the boundaries of the simulation cell and Dirichlet type conditions imposed at arbitrary subdomains. In this way, source, drain, and gate voltages can be imposed across atomistic models of electronic devices. Dirichlet conditions are enforced as constraints in a variational framework giving rise to a saddle point problem. The resulting system of equations is then solved using a stationary iterative method in which the generalized Poisson operator is preconditioned with the standard Laplace operator. The solver can make use of any sufficiently smooth function modelling the dielectric constant, including density dependent dielectric continuum models. For all the boundary conditions, consistent derivatives are available and molecular dynamics simulations can be performed. The convergence behaviour of the scheme is investigated and its capabilities are demonstrated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Complete Performance Comparison Between the Optimized Image Construction Algorithm (U-MBIR) and the Existing Reconstruction Algorithm for Detecting Defects and Damage in Concrete

Reinforced concrete (RC) is a composite material subjected to mechanical, thermal, and chemical loads throughout its service life. Because of these external stressors and the susceptibility of RC structural members to shrinkage and microcracking, the material degrades throughout its life cycle. This deterioration can lead to a decrease in member capacity and, ultimately, poses a threat to the structural integrity. Thus, it is crucial that the damage caused by aging and degradation be monitored and assessed at regular intervals throughout the material’s service life. Since coring of the material is typically not feasible for in-service structural systems, non-destructive evaluation (NDE) methodologies are used to assess remaining structural capacity. NDE methods enable surface and subsurface examination without damaging or degrading the medium. Moreover, RC is a critical component of nuclear power plants; thus, its safety and reliability must be thoroughly examined throughout the life cycle of the structural system. Ultrasonic measurements have been an industry standard for both surface and subsurface inspections. To this end, Oak Ridge National Laboratory (ORNL) has researched and developed advanced image reconstruction algorithms to capture internal damage. The results and discussion presented herein summarize the current state of the ultrasonic model–based iterative reconstruction (U-MBIR) algorithm developed at ORNL. More specifically, this report presents a comparison between reconstruction images produced via a widely employed ultrasonic NDE technique—the synthetic aperture focusing technique (SAFT)—and the ORNL-developed U-MBIR algorithm. These NDE methodologies are demonstrated using ultrasonic data collected from four concrete specimens. Overall, the U-MBIR algorithm eliminates artifacts and noise that are typically present within the SAFT reconstructions, and it shows defects and anomalies more clearly than the SAFT images. In conclusion, this algorithm is suitable for identifying concrete defects, although more improvements and optimization could be done to better define internal defects.

36 MATERIALS SCIENCE↗

System and method for microwave volumetric additive manufacturing

The present disclosure relates to a volumetric additive manufacturing system for forming a structure from a volume of resin using microwave energy. The system makes use of an electronic controller and at least one beam forming algorithm accessible by the electronic controller for generating information relating to an amplitude and a time delay for forming a microwave signal, where the microwave signal will be used in irradiating a build volume, and where the build volume is formed by the volume of resin. A microwave signal generating subsystem is included which is responsive to the information generated by the beam forming algorithm, and which generates a microwave signal using the amplitude and the time delay determined by the beam forming algorithm. An antenna is used to receive the microwave signal and project the microwave signal as a microwave beam, in accordance with the amplitude and time delay, into the build volume to form the structure.

Mukherjee, Saptarshi↗

Graph Identification of Proteins in Tomograms (GRIP-Tomo) 2.0: Topologically aware classification for proteins

Cryo-electron tomography (cryo-ET) enables structural characterization of biomolecules under near-native conditions. Existing approaches for interpreting the resulting three-dimensional volumes are computationally expensive and have difficulty interpreting density associated with small proteins/complexes. To explore alternate approaches for identifying proteins in cryo-ET data we pursued a Graph Network and topologically invariant approach. Here, we report on a fast algorithm that classifies particles by searching for nuances of evolutionarily conversed motifs and the geometrical characteristics of protein structure. GRIP-Tomo 2.0 is a machine-learning pipeline that extracts interpretable topological features of protein structures within noisy experimental backgrounds. Compared to version 1.0, the new pipeline includes three upgrades that significantly improve performance including synthetic tomogram generation simulating realistic noise, graph-based persistent feature extraction as protein fingerprints, and high-performance computing acceleration. GRIP-Tomo 2.0 achieves over 90% accuracy in classifying between proteins and noise using both real and synthetic datasets which represents a foundational step toward advancing cryo-ET workflows and empowering automated visual proteomics.

Li, Chengxuan↗