Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data Dictionary”

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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Automating cell detection and classification in human brain fluorescent microscopy images using dictionary learning and sparse coding

Background Immunofluorescence (IF) plays a major role in quantifying protein expression in situ and understanding cell function. It is widely applied in assessing disease mechanisms and in drug discovery research. Automation of IF analysis can transform studies using experimental cell models. However, IF analysis of postmortem human tissue relies mostly on manual interaction, often subjected to low-throughput and prone to error, leading to low inter and intra-observer reproducibility. Human postmortem brain samples challenges neuroscientists because of the high level of autofluorescence caused by accumulation of lipofuscin pigment during aging, hindering systematic analyses. We propose a method for automating cell counting and classification in IF microscopy of human postmortem brains. Our algorithm speeds up the quantification task while improving reproducibility. New method Dictionary learning and sparse coding allow for constructing improved cell representations using IF images. These models are input for detection and segmentation methods. Classification occurs by means of color distances between cells and a learned set. Results Our method successfully detected and classified cells in 49 human brain images. We evaluated our results regarding true positive, false positive, false negative, precision, recall, false positive rate and F1 score metrics. We also measured user-experience and time saved compared to manual countings. Comparison with existing methods We compared our results to four open-access IF-based cell-counting tools available in the literature. Lastly, our method showed improved accuracy for all data samples. Conclusion The proposed method satisfactorily detects and classifies cells from human postmortem brain IF images, with potential to be generalized for applications in other counting tasks.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2013

A Framework to Debug Diagnostic Matrices

Diagnostics is an important concept in system health and monitoring of space operations. Many of the existing diagnostic algorithms utilize system knowledge in the form of diagnostic matrix (D-matrix, also popularly known as diagnostic dictionary, fault signature matrix or reachability matrix) gleaned from physical models. But, sometimes, this may not be coherent to obtain high diagnostic performance. In such a case, it is important to modify this D-matrix based on knowledge obtained from other sources such as time-series data stream (simulated or maintenance data) within the context of a framework that includes the diagnostic/inference algorithm. A systematic and sequential update procedure, diagnostic modeling evaluator (DME) is proposed to modify D-matrix and wrapper logic considering least expensive solution first. This iterative procedure includes conditions ranging from modifying 0s and 1s in the matrix, or adding/removing the rows (failure sources) columns (tests). We will experiment this framework on datasets from DX challenge 2009.

Model-based↗
DOE OSTI2020

Frequency Event Categorization in Power Distribution Systems Using Micro PMU Measurements

Frequency is an important metric for power stability. To enhance the situational awareness in power distribution systems, this article proposes a data-driven approach that utilizes the data from micro phasor measurement units (μPMU) to categorize frequency events observed in distribution feeders. The proposed approach has three layers, each of which analyzes if a frequency event is propagated from the transmission system, formed inside a distribution feeder or falsely produced by instantaneous frequency (IF) estimation algorithms, respectively. In the first layer, the Granger causality is utilized to compare the causal relations from measurements across different locations to decide if an event is propagated from the transmission side. In the second layer, a trained sparse coding dictionary is utilized to unmix the physical causes of a frequency event. In the third layer, a moving z-score based event-pair detector is applied to identify if a frequency event is algorithm-induced. The proposed approach is tested using the μPMU measurements collected from Lawrence Berkeley National Laboratory (LBNL) and Riverside Public Utility (RPU).

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1979

The 25 kW power module evolution study. Part 3: Conceptual design for power module evolution. Volume 6: WBS and dictionary

Program elements of the power module (PM) system, are identified, structured, and defined according to the planned work breakdown structure. Efforts required to design, develop, manufacture, test, checkout, launch and operate a protoflight assembled 25 kW, 50 kW and 100 kW PM include the preparation and delivery of related software, government furnished equipment, space support equipment, ground support equipment, launch site verification software, orbital verification software, and all related data items.

Source record↗
DOE OSTI2019

Learning Deep Neural Network Representations for Koopman Operators of Nonlinear Dynamical Systems

The Koopman operator has recently garnered much attention for its value in dynamical systems analysis and data-driven model discovery. However, its application has been hindered by the computational complexity of extended dynamic mode decomposition; this requires a combinatorially large basis set to adequately describe many nonlinear systems of interest, e.g. cyber-physical infrastructure systems, biological networks, social systems, and fluid dynamics. Often the dictionaries generated for these problems are manually curated, requiring domain-specific knowledge and painstaking tuning. In this paper we introduce a deep learning framework for learning Koopman operators of nonlinear dynamical systems. We show that this novel method automatically selects efficient deep dictionaries, outperforming state-of-the-art methods. We benchmark this method on partially observed nonlinear systems, including the glycolytic oscillator and show it is able to predict quantitatively 100 steps into the future, using only a single timepoint, and qualitative oscillatory behavior 400 steps into the future.

koopman operators, machine learning, deep learning↗
NASA NTRS1990

Data Management Standards in Computer-aided Acquisition and Logistic Support (CALS)

Viewgraphs and discussion on data management standards in computer-aided acquisition and logistic support (CALS) are presented. CALS is intended to reduce cost, increase quality, and improve timeliness of weapon system acquisition and support by greatly improving the flow of technical information. The phase 2 standards, industrial environment, are discussed. The information resource dictionary system (IRDS) is described.

Jefferson, David K.↗
NASA NTRS2013

Robot Sequencing and Visualization Program (RSVP)

The Robot Sequencing and Visualization Program (RSVP) is being used in the Mars Science Laboratory (MSL) mission for downlink data visualization and command sequence generation. RSVP reads and writes downlink data products from the operations data server (ODS) and writes uplink data products to the ODS. The primary users of RSVP are members of the Rover Planner team (part of the Integrated Planning and Execution Team (IPE)), who use it to perform traversability/articulation analyses, take activity plan input from the Science and Mission Planning teams, and create a set of rover sequences to be sent to the rover every sol. The primary inputs to RSVP are downlink data products and activity plans in the ODS database. The primary outputs are command sequences to be placed in the ODS for further processing prior to uplink to each rover. RSVP is composed of two main subsystems. The first, called the Robot Sequence Editor (RoSE), understands the MSL activity and command dictionaries and takes care of converting incoming activity level inputs into command sequences. The Rover Planners use the RoSE component of RSVP to put together command sequences and to view and manage command level resources like time, power, temperature, etc. (via a transparent realtime connection to SEQGEN). The second component of RSVP is called HyperDrive, a set of high-fidelity computer graphics displays of the Martian surface in 3D and in stereo. The Rover Planners can explore the environment around the rover, create commands related to motion of all kinds, and see the simulated result of those commands via its underlying tight coupling with flight navigation, motor, and arm software. This software is the evolutionary replacement for the Rover Sequencing and Visualization software used to create command sequences (and visualize the Martian surface) for the Mars Exploration Rover mission.

Cooper, Brian K.↗
NASA NTRSDate not supplied

Modeling Atmospheric Science Knowledge from Research Publications

NASA Earth Science Data Centers contain enormous amounts of remote sensing digital data. It is often a significant challenge for users to find data suitable for their research topic in these vast archives. One of the approaches is the usage-driven dataset discovery, where users seek publications on projects similar to their intended study. For this approach to be effective, users need a clear connection between the underlying data in the publications and the study objectives; this is not often apparent to non-expert users. Tools and methodologies that can help facilitate and organize these connections are therefore valuable for creating improved knowledge mappings, which can be further used by search engines to suggest data or publications best tailored to a user’s specific research goal. As an illustration of these challenges, in this work we focus on the atmospheric chemistry processes related to Earth environmental impacts such as ozone depletion, aerosols, smog formation, acid rain, and radiative forcing. We further limit our study to publications that use data from the Microwave Limb Sounder (MLS) instrument flown on the Aura Earth Observing System. To create knowledge representations of science carried out in these publications, we use existing ontologies such as the Global Change Master Directory (GCMD) and Semantic Web for Earth and Environmental Terminology (SWEET). These ontologies together encompass term dictionaries that include measured variables, names of molecules or radicals, mission and instrument names, locations, action words, among many others. Based on these terms acknowledge graph database was populated with the terms retrieved from scientific publications that study atmospheric chemistry. These databases can be used to further enhance the automation of knowledge discovery and facilitate machine learning and artificial intelligence algorithms or applications. These tools and methods can also be extended to apply to content from other related Earth science domains.

Irina Gerasimov↗
DOE OSTI2020

Distributed Many-to-Many Protein Sequence Alignment using Sparse Matrices

Identifying similar protein sequences is a core step in many computational biology pipelines such as detection of homologous protein sequences, generation of similarity protein graphs for downstream analysis, functional annotation, and gene location. Performance and scalability of protein similarity search have proven to be a bottleneck in many bioinformatics pipelines due to increase in cheap and abundant sequencing data. This work presents a new distributed-memory software PASTIS. PASTIS relies on sparse matrix computations for efficient identification of possibly similar proteins. We use distributed sparse matrices for scalability and show that the sparse matrix infrastructure is a great fit for protein similarity search when coupled with a fully-distributed dictionary of sequences that allow remote sequence requests to be fulfilled. Our algorithm incorporates the unique bias in amino acid sequence substitution in search without altering basic sparse matrix model, and in turn, achieves ideal scaling up to millions of protein sequences.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1981

Aerodynamic preliminary analysis system 2. Part 1: Theory

A subsonic/supersonic/hypersonic aerodynamic analysis was developed by integrating the Aerodynamic Preliminary Analysis System (APAS), and the inviscid force calculation modules of the Hypersonic Arbitrary Body Program. APAS analysis was extended for nonlinear vortex forces using a generalization of the Polhamus analogy. The interactive system provides appropriate aerodynamic models for a single input geometry data base and has a run/output format similar to a wind tunnel test program. The user's manual was organized to cover the principle system activities of a typical application, geometric input/editing, aerodynamic evaluation, and post analysis review/display. Sample sessions are included to illustrate the specific task involved and are followed by a comprehensive command/subcommand dictionary used to operate the system.

Bonner, E.↗
NASA NTRS2008

ATHLETE's Feet: Mu1ti-Resolution Planning for a Hexapod Robot

ATHLETE is a large six-legged tele-operated robot. Each foot is a wheel; travel can be achieved by walking, rolling, or some combination of the two. Operators control ATHLETE by selecting parameterized commands from a command dictionary. While rolling can be done efficiently with a single command, any motion involving steps is cumbersome - walking a few meters through difficult terrain can take hours. Our goal is to improve operator efficiency by automatically generating sequences of motion commands. There is increasing uncertainty regarding ATHLETE s actual configuration over time and decreasing quality of terrain data farther away from the current position. This, combined with the complexity that results from 36 degrees of kinematic freedom, led to an architecture that interleaves planning and execution at multiple levels, ranging from traditional configuration space motion planning algorithms for immediate moves to higher level task and path planning algorithms for overall travel. The modularity of the architecture also simplifies the development process and allows the operator to interact with and control the system at varying levels of autonomy depending on terrain and need.

Smith, Tristan B.↗
DOE OSTI2017

Resolution Versus Error for Computational Electron Microscopy

Images that are collected via scanning transmission electron microscopy (STEM) can be undersampled to avoid damage to the specimen while maintaining resolution [1, 2]. We have used BPFA to impute missing data and reduce noise [3]. The reconstruction is typically evaluated using the peak signal-to-noise ratio (PSNR). This measure is too conservative for STEM images and we propose that the Fourier ring correlation (FRC) is used instead to evaluate the reconstruction. We are not concerned with exact reconstruction of the truth image, and therefore PSNR is a conservative estimation of the quality of the reconstruction. Instead, we are concerned with the visual resolution of the image and whether atoms can be distinguished. We have evaluated the reconstruction of a simulated STEM image using the FRC and compared the results with the PSNR measurements. The FRC captures the resolution of the image and is not affected by a large MSE if the atom peaks are still distinguishable. The noisy and reconstructed images are shown in Figure 1. The simulated STEM image was sampled at 100%, 80%, 40%, and 20% of the original pixels to simulate an undersampled scan. The reconstruction was done using BPFA with a patch size of 10 x 10 and no overlapping patches. Not having overlapping patches produces inferior results but they are still acceptable. The dictionary size is 64 and 30 iterations were completed during each reconstruction. The 100% image was denoised instead of reconstructed. Poisson noise was applied to the simulated image with λ values of 500, 50, and 5 to simulate lower imaging dose. The original simulated STEM image was also included in our calculations and was generated using a dose of 1000. The simulated STEM image is 100 by 100 pixels and has essentially no high frequency components. The image reconstruction tends to smooth the data, also resulting in no high frequency components. This causes the FRC of the two images to be large at higher resolutions and may be misleading. For this reason, the BPFA has no overlap to avoid excessive smoothing. Moreover, the resolution of the simulated image is approximately 9.2 (1/nm), so we only look that far in the frequency domain when performing FRC. If the FRC curve does not crossover the threshold, a resolution value of 9.2 is used. We emphasize that our reported results are conservative. The FRC and PSNR values using the ground truth and the reconstructed images are shown in Tables 1 and 2. The left side show the metrics without using BPFA (missing pixels) and the right side show the metrics after using BPFA. When we did not use BPFA, the Fourier transform was estimated [4]. Some threshold curves have been studied [5], but they are derived for additive noise models. Since we have a Poisson noise model, we have used the more conservative threshold of 0.5 for our calculations. Ten images were used to construct each cell of tables in the form of the mean of the metric plus or minus its standard deviation. As expected, the PSNR dies off much quicker than the FRC values for the same image. For the 100% and 80% sampled versions of the truth image, the resolution only dies off when the dose is 5. However, the PSNR dies off rapidly as the dose is reduced. For the 1000, 500, and 50 dose images, the FRC is the maximum, or close, until we undersample at 20%. The PSNR for these values tapers down as we get into the bottom right hand corner of the table, even though the resolution remains high. Overall, we find that undersampled images can be reconstructed to acceptable resolution even when the dose per pixel is also reduced[6]. References: [1]A Stevens, H Yang, L Carin et al. Microscopy 63(1), (2014), pp. 41. [2]A Stevens, L Kovarik, P Abellan et al. Advanced Structural and Chemical Imaging 1(1), (2015), pp. 1. [3]M Zhou, H Chen, J Paisley et al. Image Processing, IEEE Transactions on 21(1), (2012), pp. 130. [4]V. Y. Liepin’sh. Automatic control and computer sciences 30(3), (1996), pp. 20.

Luzi, Lorenzo↗
DOE OSTI2023

WeakIdent: Weak formulation for identifying differential equation using narrow-fit and trimming

Data-driven identification of differential equations is an interesting but challenging problem, especially when the given data are corrupted by noise. When the governing differential equation is a linear combination of various differential terms, the identification problem can be formulated as solving a linear system, with the feature matrix consisting of linear and nonlinear terms multiplied by a coefficient vector. This product is equal to the time derivative term, and thus generates dynamical behaviors. The goal is to identify the correct terms that form the equation to capture the dynamics of the given data. We propose a general and robust framework to recover differential equations using a weak formulation with two new mechanisms, narrow-fit and trimming, for both ordinary and partial differential equations (ODEs and PDEs). The weak formulation facilitates an efficient and robust way to handle noise, and two new mechanisms, narrow-fit and trimming, improve the coefficient support and value recoveries respectively. For each sparsity level, Subspace Pursuit is utilized to find an initial set of support from the large dictionary. Then, we focus on highly dynamic regions (rows of the feature matrix), and error normalize the feature matrix in the narrow-fit step. The support is further updated via trimming the terms that contribute the least. Finally, the support set of features with the smallest Cross-Validation error is chosen as the result. A comprehensive set of numerical experiments are presented for both systems of ODEs and PDEs with various noise levels. The proposed method gives a robust recovery of the coefficients, and a significant denoising effect which can handle up to 100% noise-to-signal ratio for some equations. We compare the proposed method with several state-of-the-art algorithms for the recovery of differential equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

I Can’t Read All That! Improving the Usability of Semantic Models Using Concise, Ontology-Agnostic, Building-Specific Schemas

Semantic ontologies have enabled the creation of formalized, machine-readable descriptions of heterogenous building systems by providing dictionaries of well defined concepts that can be applied to model them. Within a semantic model of a particular building, a subset of an ontology's concepts may be applied in different ways to represent a particular perspective of the building's systems. How the concepts were applied can only be understood by examining the large amount of instance data within a semantic model, which leads to usability challenges. We propose a concise, ontology-agnostic method for defining building-specific schema (b-schema) graphs that summarize the structure and content of a semantic model. This approach provides a queryable and concise representation of the model's contents, separate from the instance data within a model, that can mitigate the challenges posed by the size and complexity of semantic models in processes such as visualization, querying, validation, and the use of large language models (LLMs). We validate our approach on semantic models based on the Brick and ASHRAE S223 ontologies. Results demonstrate that b-schemas significantly reduce the complexity of visual interpretation, accelerate SPARQL queries and SHACL validation, and improve LLM-based knowledge graph question answering.

Paul, Lazlo [Lawrence Berkeley National Laboratory↗
DOE OSTI2020

Event Definition for the Automated Detection of Nuclear Proliferation Activities

In FY2020, Savannah River National Laboratory (SRNL) in collaboration with the Discovery Analytics Center (DAC) at Virginia Polytechnic Institute and State University (VT) began developing a demonstration prototype system that uses multiple machine learning and data analytic methods on largescale open data sources to identify new, developing, or undeclared nuclear programs. One of the most challenging aspects of applying machine learning techniques to such a problem is the high likelihood of extremely sparse data from disparate sources. To overcome this challenge, the current work will use a strategic combination of supervised, semi-supervised, and unsupervised learning techniques to ingest and fuse data streams to make a forecast of nuclear activities in a targeted geospatial location. Identifying potential data sources and training supervised learning algorithms is dependent upon the development of a robust foundation of targeted event domains that fundamentally define the nuclear activities of interest. This report documents the definition of a hierarchical structure for both nuclear activity and event domains that will be used to guide the research team in development or use of existing semantic dictionaries that are instrumental to searching, parsing, and categorizing events for the forecasting system’s use.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Unsupervised learning about 4D features of microparticle motion

Material clusters of different sizes are known to exist in high-temperature plasmas due to plasma-wall interactions. The facts that these clusters, ranging from sub-microns to above mm in size, can move from one location to another quickly and that there are a lot of them make high-speed imaging and tracking one of the best, effective, and sometimes only diagnostic. An unsupervised machine learning technique based on deconvolutional neural networks is developed to analyze two-camera videos of high-temperature microparticles generated from exploding wires. The neural network utilizes a locally competitive algorithm to infer representations and optimize a dictionary composed of kernels, or basis vectors, for image analysis. Our primary goal is to use this method for feature recognition and prediction of the time-dependent three-dimensional (or “4D”) microparticle motion. Features equivalent to local velocity vectors have been identified as the dictionary kernels or “building blocks” of the scene. The dictionary elements from the left and right camera views are found to be strongly correlated and satisfy the projection geometrical constraints. The results show that unsupervised machine learning techniques are promising approaches to process large sets of images for high-temperature plasmas and other scientific experiments. In conclusion, machine learning techniques can be useful to handle the large amount of data and therefore aid the understanding of plasma-wall interaction.

47 OTHER INSTRUMENTATION↗
NASA NTRS1976

The NASTRAN User's Manual Level 16.0 and Supplement

The user's manual is restricted to those items related to the use of NASTRAN that are independent of the computing system being used. The features of NASTRAN described include: (1) procedures for defining and loading a structural model and a functional reference for every card that is used for structural modeling; (2) the NASTRAN data deck, including the details for each of the data cards; (3) the NASTRAN control cards that are associated with the use of the program; (4) rigid format procedures, along with specific instructions for the use of each rigid format: (5) procedures for using instructions for the use of each rigid format; (5) procedures for using the NASTRAN plotting capability; (6) procedures governing the creation of DMAP programs; and (7) the NASTRAN diagnostic messages. The NASTRAN dictionary of mnemonics, acronyms, phrases, and other commonly used NASTRAN terms is included along with a limited number of sample problems.

Source record↗