Search NASA⌕ Search

SEARCH · Search NASA

Results for “Formal analysis”

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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Stability of superconducting strings

We investigate the stability of superconducting strings as bound states of strings and fermion zero modes at both the classical and quantum levels. The dynamics of these superconducting strings can result in a stable configuration, known as a vorton . We mainly focus on global strings, but the majority of the discussion can be applied to local strings. Using lattice simulations, we study the classical dynamics of superconducting strings and confirm that they relax to the vorton configuration through Nambu-Goldstone boson radiation, with no evidence of over-shooting that would destabilize the vorton. We explore the tunneling of fermion zero modes out of the strings. Both our classical analysis and quantum calculations yield consistent results: the maximum energy of the zero mode significantly exceeds the fermion mass, in contrast to previous literature. Additionally, we introduce a world-sheet formalism to evaluate the decay rate of zero modes into other particles, which constitute the dominant decay channel. We also identify additional processes that trigger zero-mode decay due to non-adiabatic changes of the string configuration. In these decay processes, the rates are suppressed by the curvature of string loops, with exponential suppression for large masses of the final states. We further study the scattering with light charged particles surrounding the string core produced by the zero-mode current and find that a wide zero-mode wavefunction can enhance vorton stability.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Exploring temporal community evolution: algorithmic approaches and parallel optimization for dynamic community detection

Abstract Dynamic (temporal) graphs are a convenient mathematical abstraction for many practical complex systems including social contacts, business transactions, and computer communications. Community discovery is an extensively used graph analysis kernel with rich literature for static graphs. However, community discovery in a dynamic setting is challenging for two specific reasons. Firstly, the notion of temporal community lacks a widely accepted formalization, and only limited work exists on understanding how communities emerge over time. Secondly, the added temporal dimension along with the sheer size of modern graph data necessitates new scalable algorithms. In this paper, we investigate how communities evolve over time based on several graph metrics under a temporal formalization. We compare six different algorithmic approaches for dynamic community detection for their quality and runtime. We identify that a vertex-centric (local) optimization method works as efficiently as the classical modularity-based methods. To its advantage, such local computation allows for the efficient design of parallel algorithms without incurring a significant parallel overhead. Based on this insight, we design a shared-memory parallel algorithm DyComPar , which demonstrates between 4 and 18 fold speed-up on a multi-core machine with 20 threads, for several real-world and synthetic graphs from different domains.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

Photoelectric observations of asteroids 3, 24, 60, 261, and 863

Observations of the five asteroids designated 3 Juno, 24 Themis, 60 Echo, 261 Prymo, and 863 Benkoela over the 1978-1984 period have been subjected to Fourier analysis to obtain composite lightcurves. The method yields a rotation-period value, mean absolute magnitudes for each night of observation, and Fourier coefficients that define composite-lightcurve shape, with formal error estimates for all quantities. The first three of the asteroids listed exhibit significant variation in surface albedo.

Harris, A. W.↗
NASA NTRS2005

Investigations into Gravitational Wave Emission from Compact Body Inspiral into Massive Black Holes

In contrast to year 1 (when much of the activity associated with this grant focused upon developing our group at MIT), year 2 was a period of very focused attention on research problems. We made significant progress developing relativistic waveforms for the extreme mass ratio inspiral problem; we have pushed forward a formalism our group developed for mapping the spacetimes of massive compact objects; and, in collaboration with the Caltech group, we began to develop a framework for addressing issues in LISA data analysis for extreme mass ratio systems.

Hughes, Scott A.↗
NASA NTRS2011

Impact of Mergers on USA Parameter Estimation for Nonspinning Black Hole Binaries

We investigate the precision with which the parameters describing the characteristics and location of nonspinning black hole binaries can be measured with the Laser Interferometer Space Antenna (LISA). By using complete waveforms including the inspiral, merger and ringdown portions of the signals, we find that LISA will have far greater precision than previous estimates for nonspinning mergers that ignored the merger and ringdown. Our analysis covers nonspinning waveforms with moderate mass ratios, q > or = 1/10, and total masses 10(exp 5) < M/M_{Sun} < 10(exp 7). We compare the parameter uncertainties using the Fisher matrix formalism, and establish the significance of mass asymmetry and higher-order content to the predicted parameter uncertainties resulting from inclusion of the merger. In real-time observations, the later parts of the signal lead to significant improvements in sky-position precision in the last hours and even the final minutes of observation. For comparable mass systems with total mass M/M_{Sun} = approx. 10(exp 6), we find that the increased precision resulting from including the merger is comparable to the increase in signal-to-noise ratio. For the most precise systems under investigation, half can be localized to within O(10 arcmin), and 18% can be localized to within O(1 arcmin).

McWilliams, Sean T.↗
DOE OSTI2022

Effective field theory analysis of 3 He–α scattering data

We treat low-energy 3 He–α elastic scattering in an effective field theory (EFT) that exploits the separation of scales in this reaction. We compute the amplitude up to next-to-next-to-leading order, developing a hierarchy of the effective-range parameters (ERPs) that contribute at various orders. We use the resulting formalism to analyse data for recent measurements at center-of-mass energies of 0.38–3.12 MeV using the scattering of nuclei in inverse kinematics (SONIK) gas target at TRIUMF as well as older data in this energy regime. We employ a likelihood function that incorporates the theoretical uncertainty due to truncation of the EFT and use Markov chain Monte Carlo sampling to obtain the resulting posterior probability distribution. We find that the inclusion of a small amount of data on the analysing power A y is crucial to determine the sign of the p-wave splitting in such an analysis. Here, the combination of A y and SONIK data constrains all ERPs up to O(p 4 ) in both s- and p-waves quite well. The asymptotic normalisation coefficients and s-wave scattering length are consistent with a recent EFT analysis of the capture reaction 3 He(α, γ) 7 Be.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2000

Session on High Speed Civil Transport Design Capability Using MDO and High Performance Computing

Since the inception of CAS in 1992, NASA Langley has been conducting research into applying multidisciplinary optimization (MDO) and high performance computing toward reducing aircraft design cycle time. The focus of this research has been the development of a series of computational frameworks and associated applications that increased in capability, complexity, and performance over time. The culmination of this effort is an automated high-fidelity analysis capability for a high speed civil transport (HSCT) vehicle installed on a network of heterogeneous computers with a computational framework built using Common Object Request Broker Architecture (CORBA) and Java. The main focus of the research in the early years was the development of the Framework for Interdisciplinary Design Optimization (FIDO) and associated HSCT applications. While the FIDO effort was eventually halted, work continued on HSCT applications of ever increasing complexity. The current application, HSCT4.0, employs high fidelity CFD and FEM analysis codes. For each analysis cycle, the vehicle geometry and computational grids are updated using new values for design variables. Processes for aeroelastic trim, loads convergence, displacement transfer, stress and buckling, and performance have been developed. In all, a total of 70 processes are integrated in the analysis framework. Many of the key processes include automatic differentiation capabilities to provide sensitivity information that can be used in optimization. A software engineering process was developed to manage this large project. Defining the interactions among 70 processes turned out to be an enormous, but essential, task. A formal requirements document was prepared that defined data flow among processes and subprocesses. A design document was then developed that translated the requirements into actual software design. A validation program was defined and implemented to ensure that codes integrated into the framework produced the same results as their standalone counterparts. Finally, a Commercial Off the Shelf (COTS) configuration management system was used to organize the software development. A computational environment, CJOPT, based on the Common Object Request Broker Architecture, CORBA, and the Java programming language has been developed as a framework for multidisciplinary analysis and Optimization. The environment exploits the parallelisms inherent in the application and distributes the constituent disciplines on machines best suited to their needs. In CJOpt, a discipline code is "wrapped" as an object. An interface to the object identifies the functionality (services) provided by the discipline, defined in Interface Definition Language (IDL) and implemented using Java. The results of using the HSCT4.0 capability are described. A summary of lessons learned is also presented. The use of some of the processes, codes, and techniques by industry are highlighted. The application of the methodology developed in this research to other aircraft are described. Finally, we show how the experience gained is being applied to entirely new vehicles, such as the Reusable Space Transportation System. Additional information is contained in the original.

Rehder, Joe↗
DOE OSTI2020

Pufferscale: Rescaling HPC Data Services for High Energy Physics Applications

User-space HPC data services are emerging as an appealing alternative to traditional parallel file systems, because of their ability to be tailored to application needs while eliminating unnecessary overheads incurred by POSIX compliance. The High Energy Physics (HEP) community is progressively turning towards such services to enable high-throughput accesses under heavy concurrency to billions of event data produced by instruments and consumed by subsequent analysis workflows. Such services would benefit from the possibility to be rescaled up and down to adapt to changing workloads, as experimental campaigns progress, in order to optimize resource usage. This paper formalizes rescaling a distributed storage system as a multi objective optimization problem considering three criteria: load balance, data balance, and duration of the rescaling operation. We propose a heuristic for rapidly finding a good approximate solution, while allowing users to weight the criteria as needed. The heuristic is evaluated with Pufferscale, a new rescaling manager for microservice-based distributed storage systems. To validate our approach in a real-world ecosystem, we showcase the use of Pufferscale as a means to enable storage malleability in the HEPnOS storage system for HEP applications.

Distributed Storage System↗
NASA NTRS1989

On the generation of a bubbly universe - A quantitative assessment of the CfA slice

A first attempt is made to calculate the properties of the matter distribution in a universe filled with overlapping bubbles produced by multiple explosions. Each spherical shell follows the cosmological Sedov-Taylor solution until it encounters another shell. Thereafter, mergers are allowed to occur in pairs on the basis of N-body results. At the final epoch, the matrix of overlapping shells is populated with 'galaxies' and the properties of slices through the numerically constructed cube compare well with CfA survey results for specified initial conditions. A statistic is found which measures the distance distribution from uniformly distributed points to the nearest galaxies on the projected plane which appears to provide a good measure of the bubbly character of the galaxy distribution. In a quantitative analysis of the CfA 'slice of the universe', a very good match is found between simulation and the real data for final average bubble radii of (13.5 + or - 1.5)/h Mpc with formal filling factor 1.0-1.5 or actual filling factor of 65-80 percent.

Ostriker, J. P.↗
NASA NTRS1992

Modeling the performance of the human (pilot) interaction in a synthetic flight domain: Information theoretic approach

Current advances in computing technology are devoid of formal methods that describe the theories of how information is shared between humans and machines. Specifically, in the domain of human-machine interaction, a common mathematical foundation is lacking. The aim of this paper is to propose a formal method of human-machine (H-M) interaction paradigm from the information view point. The methods presented are interpretation- and context-free and can be used both in experimental analysis as well as in modeling problems.

Ntuen, Celestine A.↗
NASA NTRS1991

Formal and heuristic system decomposition methods in multidisciplinary synthesis

The multidisciplinary interactions which exist in large scale engineering design problems provide a unique set of difficulties. These difficulties are associated primarily with unwieldy numbers of design variables and constraints, and with the interdependencies of the discipline analysis modules. Such obstacles require design techniques which account for the inherent disciplinary couplings in the analyses and optimizations. The objective of this work was to develop an efficient holistic design synthesis methodology that takes advantage of the synergistic nature of integrated design. A general decomposition approach for optimization of large engineering systems is presented. The method is particularly applicable for multidisciplinary design problems which are characterized by closely coupled interactions among discipline analyses. The advantage of subsystem modularity allows for implementation of specialized methods for analysis and optimization, computational efficiency, and the ability to incorporate human intervention and decision making in the form of an expert systems capability. The resulting approach is not a method applicable to only a specific situation, but rather, a methodology which can be used for a large class of engineering design problems in which the system is non-hierarchic in nature.

Bloebaum, Christina L.↗
NASA NTRS2008

Assessing Requirements Quality through Requirements Coverage

In model-based development, the development effort is centered around a formal description of the proposed software system the model. This model is derived from some high-level requirements describing the expected behavior of the software. For validation and verification purposes, this model can then be subjected to various types of analysis, for example, completeness and consistency analysis [6], model checking [3], theorem proving [1], and test-case generation [4, 7]. This development paradigm is making rapid inroads in certain industries, e.g., automotive, avionics, space applications, and medical technology. This shift towards model-based development naturally leads to changes in the verification and validation (V&V) process. The model validation problem determining that the model accurately captures the customer's high-level requirements has received little attention and the sufficiency of the validation activities has been largely determined through ad-hoc methods. Since the model serves as the central artifact, its correctness with respect to the users needs is absolutely crucial. In our investigation, we attempt to answer the following two questions with respect to validation (1) Are the requirements sufficiently defined for the system? and (2) How well does the model implement the behaviors specified by the requirements? The second question can be addressed using formal verification. Nevertheless, the size and complexity of many industrial systems make formal verification infeasible even if we have a formal model and formalized requirements. Thus, presently, there is no objective way of answering these two questions. To this end, we propose an approach based on testing that, when given a set of formal requirements, explores the relationship between requirements-based structural test-adequacy coverage and model-based structural test-adequacy coverage. The proposed technique uses requirements coverage metrics defined in [9] on formal high-level software requirements and existing model coverage metrics such as the Modified Condition and Decision Coverage (MC/DC) used when testing highly critical software in the avionics industry [8]. Our work is related to Chockler et al. [2], but we base our work on traditional testing techniques as opposed to verification techniques.

Rajan, Ajitha↗
DOE OSTI2020

Topological Analysis of The SPOKE Graph

The SPOKE graph [2, 6] is a sparse decorated semantic graph representing a collection of knowledge collected in many scientific databases from the fields of healthcare, biochemistry, chemistry, biology, et cetera. This knowledge graph is stored as a relational dataset decorated with metadata on each constituent vertex and edge. Formally, the graph is G(V, E, D), where V is a set of n vertices V := {1, ..., n} and edges of the form (i, j) ϵ E for i, j ϵ V, and table D that for any item in V υ E stores unstructured data such as vertex/edge type, nature of a relationship, et cetera. D(i) = {data involving vertex i ϵ V}, and D(i, j) = {data involving edge (i, j) ϵ E}. Here, we treat the graph as undirected in the sense that a direct relationship for (i, j) causes a (possibly opposite) reverse direct relationship for (j, i). The SPOKE graph G(V, E, D) is formed by processing a collection of relational datasets from medicine, chemistry, and biology, connecting many entities. Here, we analyze an instance from 2019, Spoke-20190707, where a graph file contains 6.16M edges and associated metadata and a vertex file contains 2.15M vertices and the associated metadata. There are 12 different types of vertex entities; all edge types used are implicit (see §2). There is other metadata in D on edges and vertices, but we just use the topology and the vertex labels in this report. SPOKE is growing as more knowledge is gained and more datasets are added. SPOKE is likely to grow 10x during the next phase of this project, and we therefore would like to consider topoligical analysis techniques that are scalable to several orders of magnitude larger than the current dataset (say >1B edges).

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Interactions between U.S. biofuels policy and the Endangered Species Act

The Renewable Fuel Standard (RFS) is the primary policy governing the use of biofuels in the United States. Following the 2007 enactment of the RFS, there has been substantial expansion in the use of cropland to produce biofuel feedstocks, including corn and soybeans. Both the conversion of land and the ongoing cultivation of these crops can, depending on management practices, lead to negative environmental outcomes including degraded water quality, increased water use, increased greenhouse gas emissions, and loss or degradation of wildlife habitat. These outcomes have the potential to affect threatened and endangered species protected under the U.S. Endangered Species Act (ESA). The ESA requires federal agencies to consult with the U.S. Fish and Wildlife Service or the National Marine Fisheries Service to ensure that an agency's actions are not likely to jeopardize the existence of imperiled species, nor result in the destruction or adverse modification of their habitat. However, formal consultation has not yet been completed between the U.S. Environmental Protection Agency—the agency charged with implementing the RFS—and the wildlife services, thereby hindering mitigation or remediation of potential impacts. This analysis explores the likely effects of the RFS on land use changes and critical habitat, illustrates example pathways by which threatened and endangered species may be affected, and proposes solutions to help redress this harm. The findings suggest a need for further consultation and assessment of the interactions between the RFS and ESA as well as additional research to support the species-conservation and policymaking processes.

09 BIOMASS FUELS↗
DOE OSTI2026

Integration of Silica in G4CMP for Phonon Simulations: Framework and Tools for Material Integration

Superconducting detectors with sub-eV energy resolution have demonstrated success setting limits on Beyond the Standard Model (BSM) physics due to their unique sensitivity to low-energy events. G4CMP, a Geant4-based extension for condensed matter physics, provides a comprehensive toolkit for modeling phonon and charge dynamics in cryogenic materials. This paper introduces a technical formalism to support the superconducting qubit and low-threshold detector community in implementing phonon simulations in custom materials into the G4CMP. As a case study, we present the results of a detailed analysis of silica phonon transport properties relevant for simulating substrate backgrounds in Beryllium Electron capture in Superconducting Tunnel junctions (BeEST)-style experiments using G4CMP. Additionally, Python-based tools were developed to aid users in implementing their own materials and are available on the G4CMP repository.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1980

Shield topology in lightning transient control

A formalism in which the interaction of a system with an electromagnetic source is described by sets of scattering, penetrations, and propagation functions is reviewed and interpreted in the context of the lightning interaction problem. In this formalism, the system is decomposed into simple volumes separated by closed shield surfaces. These surfaces are nested and interconnected to produce higher levels of shielding and subvolumes within a given level. The interaction analysis uses scattering theory to define current and charge densities on the shield surface in conjunction with the diffusion, apertures, and transmission line analysis to define penetration through shield imperfections and propagation within the protected volume.

Vance, E. F.↗
NASA NTRS1992

Mechanically verified hardware implementing an 8-bit parallel IO Byzantine agreement processor

Consider a network of four processors that use the Oral Messages (Byzantine Generals) Algorithm of Pease, Shostak, and Lamport to achieve agreement in the presence of faults. Bevier and Young have published a functional description of a single processor that, when interconnected appropriately with three identical others, implements this network under the assumption that the four processors step in synchrony. By formalizing the original Pease, et al work, Bevier and Young mechanically proved that such a network achieves fault tolerance. We develop, formalize, and discuss a hardware design that has been mechanically proven to implement their processor. In particular, we formally define mapping functions from the abstract state space of the Bevier-Young processor to a concrete state space of a hardware module and state a theorem that expresses the claim that the hardware correctly implements the processor. We briefly discuss the Brock-Hunt Formal Hardware Description Language which permits designs both to be proved correct with the Boyer-Moore theorem prover and to be expressed in a commercially supported hardware description language for additional electrical analysis and layout. We briefly describe our implementation.

Moore, J. Strother↗