Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics & 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,567 records · Page 87

Hard Disk/Solid State Drive Synergy in Support of Data-Intensive Computing [Slides]

Data-intensive applications are becoming increasingly common in high-performance computing. Examples include combustion simulation, human genome analysis, and satellite image processing. Efficient access of data sets is critical to the performance of these applications. Because of the size of the data today's economically feasible approach is to store the data files on an array of hard disks or data servers equipped with hard disks and managed by a parallel file system such as PVFS or Lustre wherein the data is striped over a (large) number of disks for high aggregate I/O throughout. With file striping, a request for a segment of logically contiguous file space is decomposed into multiple sub-requests, each to a different server. While the data unit for this striping is usually reasonably large to benefit disk efficiency, the first and/or last sub-requests can be much smaller than the striping unit if the request does not align with the striping pattern, severely compromising hard disk efficiency and thus application performance. We propose to exploit solid state drives (SSD), whose efficiency is much less sensitive to small random accesses, to enable the alignment of requests to disk with the data striping pattern. In this scheme hard disks mainly serve large, aligned, sequential requests, with SSDs serving small or unaligned requests, thus respecting the relative cost, performance, and durability characteristics of the two media, and thereby achieving synergy in performance/cost. We will describe the design of the proposed scheme, its implementation on CCS-7's Darwin cluster, and performance results.

97 MATHEMATICS AND COMPUTING↗

A Computational Framework for Proteome-Wide Pursuit and Prediction of Metalloproteins using ICP-MS and MS/MS Data

Background: Metal-containing proteins comprise a diverse and sizable category within the proteomes of organisms, ranging from proteins that use metals to catalyze reactions to proteins in which metals play key structural roles. Unfortunately, reliably predicting that a protein will contain a specific metal from its amino acid sequence is not currently possible. We recently developed a generally-applicable experimental technique for finding metalloproteins on a genome-wide scale. Applying this metal-directed protein purification approach (ICPMS and MS/MS based) to the prototypical microbe Pyrococcus furiosus conclusively demonstrated the extent and diversity of the uncharacterized portion of microbial metalloproteomes since a majority of the observed metal peaks could not be assigned to known or predicted metalloproteins. However, even using this technique, it is not technically feasible to purify to homogeneity all metalloproteins in an organism. In order to address these limitations and complement the metal-directed protein purification, we developed a computational infrastructure and statistical methodology to aid in the pursuit and identification of novel metalloproteins. Results: We demonstrate that our methodology enables predictions of metal-protein interactions using an experimental data set derived from a chromatography fractionation experiment in which 870 proteins and 10 metals were measured over 2,589 fractions. For each of the 10 metals, cobalt, iron, manganese, molybdenum, nickel, lead, tungsten, uranium, vanadium, and zinc, clusters of proteins frequently occurring in metal peaks (of a specific metal) within the fractionation space were defined. This resulted in predictions that there are from 5 undiscovered vanadium- to 13 undiscovered cobalt-containing proteins in Pyrococcus furiosus. Molybdenum and nickel were chosen for additional assessment producing lists of genes predicted to encode metalloproteins or metalloprotein subunits, 22 for nickel including seven from known nickel-proteins, and 20 for molybdenum including two from known molybdo-proteins. The uncharacterized proteins are prime candidates for metal-based purification or recombinant approaches to validate these predictions. Conclusions: We conclude that the largely uncharacterized extent of native metalloproteomes can be revealed through analysis of the co-occurrence of metals and proteins across a fractionation space. This can significantly impact our understanding of metallobiochemistry, disease mechanisms, and metal toxicity, with implications for bioremediation, medicine and other fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Semantic role labeling for protein transport predicates

Background: Automatic semantic role labeling (SRL) is a natural language processing (NLP) technique that maps sentences to semantic representations. This technique has been widely studied in the recent years, but mostly with data in newswire domains. Here, we report on a SRL model for identifying the semantic roles of biomedical predicates describing protein transport in GeneRIFs – manually curated sentences focusing on gene functions. To avoid the computational cost of syntactic parsing, and because the boundaries of our protein transport roles often did not match up with syntactic phrase boundaries, we approached this problem with a word-chunking paradigm and trained support vector machine classifiers to classify words as being at the beginning, inside or outside of a protein transport role. Results: We collected a set of 837 GeneRIFs describing movements of proteins between cellular components, whose predicates were annotated for the semantic roles AGENT, PATIENT, ORIGIN and DESTINATION. We trained these models with the features of previous wordchunking models, features adapted from phrase-chunking models, and features derived from an analysis of our data. Our models were able to label protein transport semantic roles with 87.6% precision and 79.0% recall when using manually annotated protein boundaries, and 87.0% precision and 74.5% recall when using automatically identified ones. Conclusion: We successfully adapted the word-chunking classification paradigm to semantic role labeling, applying it to a new domain with predicates completely absent from any previous studies. By combining the traditional word and phrasal role labeling features with biomedical features like protein boundaries and MEDPOST part of speech tags, we were able to address the challenges posed by the new domain data and subsequently build robust models that achieved F-measures as high as 83.1. This system for extracting protein transport information from GeneRIFs performs well even with proteins identified automatically, and is therefore more robust than the rule-based methods previously used to extract protein transport roles.

59 BASIC BIOLOGICAL SCIENCES↗

A Specification for a Godunov-type Eulerian 2-D Hydrocode, Revision 0

The purpose of this code specification is to describe an algorithm for solving the Euler equations of hydrodynamics in a 2D rectangular region in sufficient detail to allow a software developer to produce an implementation on their target platform using their programming language of choice without requiring detailed knowledge and experience in the field of computational fluid dynamics. It should be possible for a software developer who is proficient in the programming language of choice and is knowledgable of the target hardware to produce an efficient implementation of this specification if they also possess a thorough working knowledge of parallel programming and have some experience in scientific programming using fields and meshes. On modern architectures, it will be important to focus on issues related to the exploitation of the fine grain parallelism and data locality present in this algorithm. This specification aims to make that task easier by presenting the essential details of the algorithm in a systematic and language neutral manner while also avoiding the inclusion of implementation details that would likely be specific to a particular type of programming paradigm or platform architecture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

RuleMonkey: software for stochastic simulation of rule-based models

Background: The system-level dynamics of many molecular interactions, particularly protein-protein interactions, can be conveniently represented using reaction rules, which can be specified using model-specification languages, such as the BioNetGen language (BNGL). A set of rules implicitly defines a (bio)chemical reaction network. The reaction network implied by a set of rules is often very large, and as a result, generation of the network implied by rules tends to be computationally expensive. Moreover, the cost of many commonly used methods for simulating network dynamics is a function of network size. Together these factors have limited application of the rule-based modeling approach. Recently, several methods for simulating rule-based models have been developed that avoid the expensive step of network generation. The cost of these “network-free” simulation methods is independent of the number of reactions implied by rules. Software implementing such methods is now needed for the simulation and analysis of rule-based models of biochemical systems. Results: Here, we present a software tool called RuleMonkey, which implements a network-free method for simulation of rule-based models that is similar to Gillespie’s method. The method is suitable for rule-based models that can be encoded in BNGL, including models with rules that have global application conditions, such as rules for intramolecular association reactions. In addition, the method is rejection free, unlike other network-free methods that introduce null events, i.e., steps in the simulation procedure that do not change the state of the reaction system being simulated. We verify that RuleMonkey produces correct simulation results, and we compare its performance against DYNSTOC, another BNGL-compliant tool for network-free simulation of rule-based models. We also compare RuleMonkey against problem-specific codes implementing network-free simulation methods. Conclusions: RuleMonkey enables the simulation of rule-based models for which the underlying reaction networks are large. It is typically faster than DYNSTOC for benchmark problems that we have examined. RuleMonkey is freely available as a stand-alone application http://public.tgen.org/rulemonkey. It is also available as a simulation engine within GetBonNie, a web-based environment for building, analyzing and sharing rule-based models.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Bioinformatics resource manager v2.3: an integrated software environment for systems biology with microRNA and cross-species analysis tools

Background: MicroRNAs (miRNAs) are noncoding RNAs that direct post-transcriptional regulation of protein coding genes. Recent studies have shown miRNAs are important for controlling many biological processes, including nervous system development, and are highly conserved across species. Given their importance, computational tools are necessary for analysis, interpretation and integration of high-throughput (HTP) miRNA data in an increasing number of model species. The Bioinformatics Resource Manager (BRM) v2.3 is a software environment for data management, mining, integration and functional annotation of HTP biological data. In this study, we report recent updates to BRM for miRNA data analysis and cross-species comparisons across datasets. Results: BRM v2.3 has the capability to query predicted miRNA targets from multiple databases, retrieve potential regulatory miRNAs for known genes, integrate experimentally derived miRNA and mRNA datasets, perform ortholog mapping across species, and retrieve annotation and cross-reference identifiers for an expanded number of species. Here we use BRM to show that developmental exposure of zebrafish to 30 uM nicotine from 6–48 hours post fertilization (hpf) results in behavioral hyperactivity in larval zebrafish and alteration of putative miRNA gene targets in whole embryos at developmental stages that encompass early neurogenesis. We show typical workflows for using BRM to integrate experimental zebrafish miRNA and mRNA microarray datasets with example retrievals for zebrafish, including pathway annotation and mapping to human ortholog. Functional analysis of differentially regulated (p<0.05) gene targets in BRM indicates that nicotine exposure disrupts genes involved in neurogenesis, possibly through misregulation of nicotine-sensitive miRNAs. Conclusions: BRM provides the ability to mine complex data for identification of candidate miRNAs or pathways that drive phenotypic outcome and, therefore, is a useful hypothesis generation tool for systems biology. The miRNA workflow in BRM allows for efficient processing of multiple miRNA and mRNA datasets in a single software environment with the added capability to interact with public data sources and visual analytic tools for HTP data analysis at a systems level. BRM is developed using Java™ and other open-source technologies for free distribution (http://www.sysbio.org/dataresources/brm.stm).

59 BASIC BIOLOGICAL SCIENCES↗

MCNP6 Results for the Phase III Sensitivity Benchmark of the OCED/NEA Expert Group on Uncertainty Analysis for Criticality Safety Assessment

Within the last decade, there has been increasing interest in the calculation of cross section sensitivity coefficients of k eff for integral experiment design and uncertainty analysis. The OECD/NEA has an Expert Group devoted to Sensitivity and Uncertainty Analysis within the Working Party for Nuclear Criticality Safety. This expert group has developed benchmarks to assess code capabilities and performance for doing sensitivity and uncertainty analysis. Phase III of a set of sensitivity benchmarks evaluates capabilities for computing sensitivity coefficients. MCNP6 has the capability to compute cross section sensitivities for k eff using continuous-energy physics. To help verify this capability, results for the Phase III benchmark cases are generated and submitted to the Expert Group for comparison. The Phase III benchmark has three cases: III.1, an array of MOX fuel pins, III.2, a series of infinite lattices of MOX fuel pins with varying pitches, and III.3 two spheres with homogeneous mixtures of UF 4 and polyethylene with different enrichments.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Optimal structure and parameter learning of Ising models

Reconstruction of the structure and parameters of an Ising model from binary samples is a problem of practical importance in a variety of disciplines, ranging from statistical physics and computational biology to image processing and machine learning. The focus of the research community shifted toward developing universal reconstruction algorithms that are both computationally efficient and require the minimal amount of expensive data. Here, we introduce a new method, interaction screening, which accurately estimates model parameters using local optimization problems. The algorithm provably achieves perfect graph structure recovery with an information-theoretically optimal number of samples, notably in the low-temperature regime, which is known to be the hardest for learning. Here, the efficacy of interaction screening is assessed through extensive numerical tests on synthetic Ising models of various topologies with different types of interactions, as well as on real data produced by a D-Wave quantum computer. Finally, this study shows that the interaction screening method is an exact, tractable, and optimal technique that universally solves the inverse Ising problem.

97 MATHEMATICS AND COMPUTING↗

Notes on the Lumped Backward Master Equation for the Neutron Extinction/Survival Probability

The expected or mean neutron number (or density) provides an adequate characterization of the neutron population and its dynamical excursions in most neutronic applications, in particular power reactors. Fluctuations in the neutron number, originating from the inherent randomness of neutron interactions and fission neutron multiplicities, are relatively small and ignorable for operational purposes, although measurements of the variance and time correlations provide valuable diagnostic information on fundamental reactor physics parameters. However, it is well known that there exist situations of great interest and importance in which a strictly deterministic description, or even one supplemented with a knowledge of low order statistical averages (variance, correlation), provides an incomplete and very unsatisfactory description of the state of the neutron population. These situations are marked by persistent large fluctuations in the neutron number where the emergence of a deterministic phase is suppressed. Such situations are strongly stochastic and therefore unpredictable (i.e., the mean is not representative of the actual population), and can arise either by design or by accident. Examples where the stochastic behavior of neutron populations must be taken into account include: nuclear weapon single-point safety assessment; criticality excursions in spent fuel storage and in the handling of fissile solutions in fuel fabrication and reprocessing; approach to critical under suboptimal reactor start-up conditions; preinitiation in fast burst research reactors; and weak nuclear signatures in the passive detection of nuclear materials. What distinguishes strongly stochastic neutronic systems from strongly deterministic systems is that, in the former, neutron multiplication occurs in the presence of weak neutron sources, such as spontaneous fission and background (cosmic) radiation. Weak sources (in a sense that can be made quite precise) lead to well separated fission chains (a fission chain is defined as the initial source neutron and all its subsequent progeny) in which some chains are short lived while others propagate for unusually long times. Under these conditions, fission chains do not overlap strongly and this precludes the cancellation of neutron number fluctuations necessary for the mean to become established as the dominant measure of the neutron population. The fate of individual chains then plays a defining role in the evolution of the neutron population in strongly stochastic systems, and of particular interest and importance in supercritical systems is the extinction probability, defined as the probability that the neutron chain (initiating neutron and its progeny) will be extinguished at a particular time, or its complement, the time-dependent survival probability. The time-asymptotic limit of the latter, the probability of divergence, gives the probability that the neutron population will grow without bound, and is more commonly known as the probability of initiation or just POI. The ability to numerically compute these probabilities, with high accuracy and without overly restricting the underlying physics (e.g., fission neutron multiplicity, reactivity variation) is clearly essential in developing an understanding of the behavior of strongly stochastic systems.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Idaho National Laboratory CY 2024 National Emission Standards for Hazardous Air Pollutants Analysis, Methodology, and Results for Radionuclides

This report documents the methodology and results for calculating the effective dose equivalent (EDE) to the maximally exposed individual (MEI) from atmospheric radionuclide emissions from Idaho National Laboratory (INL) sources in Calendar Year (CY) 2024. The calculations were performed in accordance with requirements in Code of Federal Regulations (CFR), Title 40, “Protection of the Environment,” Part 61, “National Emission Standards for Hazardous Air Pollutants (NESHAPs),” Subpart H, “National Emission Standards for Emissions of Radionuclides Other than Radon from Department of Energy Facilities” (40 CFR 61, Subpart H). UDFs were calculated using the computer model CAP88-PC for unit (1 Ci/yr) emission rates at INL Site facilities and INL in-town (Idaho Falls) facilities and stored in Microsoft Access databases. The UDFs—in this case, mrem/Ci—were then combined with radionuclide-specific release (emission) rates for each facility-specific source to compute doses at predetermined public receptor locations, including the MEI locations. This report contains the dose results and a description of the methodology and tools used to compute the doses.

07 - ISOTOPES AND RADIATION SOURCES↗

DAKOTA : a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis. Version 5.0, developers manual.

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic finite element methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a developers manual for the DAKOTA software and describes the DAKOTA class hierarchies and their interrelationships. It derives directly from annotation of the actual source code and provides detailed class documentation, including all member functions and attributes.

97 MATHEMATICS AND COMPUTING↗

Language model-accelerated deep symbolic optimization

Symbolic optimization methods have been used to solve varied challenging and relevant problems such as symbolic regression and neural architecture search. However, the current state of the art typically learns each problem from scratch and is unable to leverage pre-existing knowledge and datasets that are available for many applications. Here, inspired by the similarity between sequence representations learned in natural language processing and the formulation of symbolic optimization as a discrete sequence optimization problem, we propose language model-accelerated deep symbolic optimization (LA-DSO), a method that leverages language models to learn symbolic optimization solutions more efficiently. We demonstrate LA-DSO in two tasks: symbolic regression, which allows us to perform extensive experimentation due to its low computation requirements, and computational antibody optimization, which shows that our proposal accelerates learning in challenging real-world problems.

97 MATHEMATICS AND COMPUTING↗

Towards Use of Mixed Precision in ECP Math Libraries [Exascale Computing Project]

The use of multiple types of precision in mathematical software has the potential to increase its performance on new heterogeneous architectures. The xSDK project focuses both on the investigation and development of multiprecision algorithms as well as their inclusion into xSDK member libraries. This report summarizes current efforts on including and/or using mixed precision capabilities in the math libraries Ginkgo, heFFTe, hypre, MAGMA, PETSc/TAO, SLATE, SuperLU, and Trilinos, including KokkosKernels. It contains both numerical results from libraries that already provide mixed precision capabilities, as well as descriptions of the strategies to incorporate multiprecision into established libraries.

97 MATHEMATICS AND COMPUTING↗

Intrusive Uncertainty Quantification and Optimal Experiment Design in the Open-Source Pyomo Ecosystem

This contribution describes ParmEst and Pyomo.DoE, two pillars of the open-source Python-based Pyomo ecosystem for computational optimization with (partial differential) algebraic equation mathematical models. Specifically, ParmEst facilitates intrusive frequentist parameter estimation (PE) and uncertainty quantification (UQ) through built-in features, such as covariance matrix estimation, bootstrapping, and likelihood ratio tests. Complementary, Pyomo.DoE enables optimal experiment design by maximizing various metrics of the Fisher information matrix, such as A-optimality (trace), D-optimality (determinant), E-optimality (minimum eigenvalue), and ME-optimality (condition number). ParmEst and Pyomo.DoE can solve high-dimensional optimization problems by leveraging the model structure and exact derivative information. Finally, we will discuss future opportunities to integrate PE and UQ capabilities with optimization under uncertainty, including robust optimization with non-convex models via PyROS.

97 MATHEMATICS AND COMPUTING↗

Numerical analysis of a thermal contact problem with adhesion

In this paper, we study a class of dynamic thermal problems involving a frictional normal compliance adhesive contact model and a non-clamped condition for visco-elastic materials. The variational formulation of the problem leads to a general system defined by a second-order quasi-variational evolution inequality on the displacement field coupled with the two first-order evolution equations describing the evolution of the temperature and adhesion. We establish an existence and uniqueness result of the solution on displacement, temperature and adhesion. Then we provide a fully discrete numerical scheme of approximation and derive an error estimate. Finally, various numerical computations are included.

97 MATHEMATICS AND COMPUTING↗

Exploring adverse drug events at the class level

Background: While the association between a drug and an adverse event (ADE) is generally detected at the level of individual drugs, ADEs are often discussed at the class level, i.e., at the level of pharmacologic classes (e.g., in drug labels). We propose two approaches, one visual and one computational, to exploring the contribution of individual drugs to the class signal. Methods: Having established a dataset of ADEs from MEDLINE, we aggregate drugs into ATC classes and ADEs into high-level MeSH terms. We compute statistical associations between drugs and ADEs at the drug level and at the class level. Finally, we visualize the signals at increasing levels of resolution using heat maps. We also automate the exploration of drug-ADE associations at the class level using clustering techniques. Results: Using our visual approach, we were able to uncover known associations, e.g., between fluoroquinolones and tendon injuries, and between statins and rhabdomyolysis. Using our computational approach, we systematically analyzed 488 associations between a drug class and an ADE. Conclusions: The findings gained from our exploratory techniques should be of interest to the curators of ADE repositories and drug safety professionals. Our approach can be applied to different drug-ADE datasets, using different drug classification systems and different signal detection algorithms.

59 BASIC BIOLOGICAL SCIENCES↗

FY12 Quarter 3 Computing Utilization Report – LANL

DSW continues to dominate the capacity workload, with a focus in Q3 on common model baselining runs in preparation for the Annual Assessment Review (AAR) of the weapon systems. There remains unmet demand for higher fidelity simulations, and for increased throughput of simulations. Common model baselining activities would benefit from doubling the resolution of the models and running twice as many simulations. Capacity systems were also utilized during the quarter to prepare for upcoming Level 2 milestones. Other notable DSW activities include validation of new physics models and safety studies. The safety team used the capacity resources extensively for projects involving 3D computer simulations for the Furrow series of experiments at DARHT (a Level 2 milestone), fragment impact, surety theme, PANTEX assessments, and the 120-day study. With the more than tripling of classified capacity computing resources with the addition of the Luna system and the safety team's imminent access to the Cielo system, demand has been met for current needs. The safety team has performed successful scaling studies on Luna up to 16K PE size-jobs with linear scaling, running the large 3D simulations required for the analysis of Furrow. They will be investigating scaling studies on the Cielo system with the Lustre file system in Q4. Overall average capacity utilization was impacted by negative effects of the LANL Voluntary Separation Program (VSP) at the beginning of Q3, in which programmatic staffing was reduced by 6%, with further losses due to management backfills and attrition, resulting in about 10% fewer users. All classified systems were impacted in April by a planned 2 day red network outage. ASC capacity workload continues to focus on code development, regression testing, and verification and validation (V&V) studies. Significant capacity cycles were used in preparation for a JOWOG in May and several upcoming L2 milestones due in Q4. A network transition has been underway on the unclassified networks to increase access of all ASC users to the unclassified systems through the Yellow Turquoise Integration (YeTI) project. This will help to alleviate the longstanding shortage of resources for ASC unclassified code development and regression testing, and also make a broader palette of machines available to unclassified ASC users, including PSAAP Alliance users. The Moonlight system will be the first capacity resource to be made available through the YETI project, and will make available a significant increase in cycles, as well as GPGPU accelerator technology. The Turing and Lobo machines will be decommissioned in the next quarter. ASC projects running on Cielo as part of the CCC-3 include turbulence, hydrodynamics, burn, asteroids, polycrystals, capability and runtime performance improvements, and materials including carbon and silicone.

43 PARTICLE ACCELERATORS↗