Search NASA⌕ Search

SEARCH · Search NASA

Results for “data mining knowledge discovery data search”

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.

3 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

CMI Report on Project 2.3.2 Activities – 09/2013 to 03/2014

The objective of this project is to develop and apply a Materials-Design Simulator (MDS) for predicting thermodynamic phase stability, structural and magnetic properties, and performance of complex REE-based materials. We seek to create a knowledge base for identifying alloys with desirable properties. The aim of this project is to develop an efficient infrastructure for creating a knowledge base for identifying new alloys with enhance performance and reduced REE-content, and for managing material data acquired within the Focus Area 2 and with input from Focus Area 4. This project integrates two approaches to alloy process modeling that so far have been developed largely independently: (1) electronic structure theory of alloys and (2) semi-empirical methods of computational thermodynamics and kinetics (such as CALPHAD). This project will greatly benefit from experimental data on phase characterization, heat of formation (from differential scanning calorimetry), and magnetism as a function of pressure to support the search for REE substitutes without compromising on target properties for applications. The MDS will be also greatly enhanced through the use of state-of-the-art methods of materials informatics and data mining. The MDS will facilitate examination of research results, discovery of trends, identification of knowledge gaps, and even possibly underlying scientific principles, MDS will be developed and assembled for gathering, accessing, and analyzing available material data generated externally and within CMI projects by experimentalists and modelers. The data in our knowledge base will be accessible to all hub participants via a web interface and underlying engine that will allow targeted searches through heterogeneous data on composition, property and structure spaces encompassing all contributed data.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Machine Learning and Social Media to Mine and Disseminate Big Scientific Data

One of the challenges in supplying the communities with wider access to scientific databases is the need for knowledge of database languages like Structured Query Language (SQL). Although the SQL language has been published in many forms, not everybody is able to write SQL queries. Another challenge is that it might not be practical to make the public aware of the structure of databases. There is a need for novice users to query relational databases using their natural language. To solve this problem, many natural language interfaces to structured databases have been developed. The goal is to provide a more intuitive method for generating database queries and delivering responses. Through social media, which makes it possible to interact with a wide section of the population, and with the help of natural language processing, researchers at the Atmospheric Radiation Measurement (ARM) Data Center at Oak Ridge National Laboratory (ORNL) have developed a concept to enable easy search and retrieval of data from several environmental data centers for the scientific community through social media.Using a machine learning framework that maps natural language text to thousands of datasets, instruments, variables, and data streams, the prototype system would allow users to request data through Twitter and receive a link (via tweet) to applicable data results on the project's search catalog tailored to their key words. This automated identification of relevant data from various petascale archives at ORNL could increase convenience, access, and use of the project's data by the broader community. In this paper we discuss how some data-intensive projects at ORNL are using innovative ways to help in data discovery.

Devarakonda, Ranjeet↗
DOE OSTI2014

An Adaptive Memory Interface Controller for Improving Bandwidth Utilization of Hybrid and Reconfigurable Systems

Emerging applications such as data mining, bioinformatics, knowledge discovery, social network analysis are irregular. They use data structures based on pointers or linked lists, such as graphs, unbalanced trees or unstructures grids, which generates unpredictable memory accesses. These data structures usually are large, but difficult to partition. These applications mostly are memory bandwidth bounded and have high synchronization intensity. However, they also have large amounts of inherent dynamic parallelism, because they potentially perform a task for each one of the element they are exploring. Several efforts are looking at accelerating these applications on hybrid architectures, which integrate general purpose processors with reconfigurable devices. Some solutions, which demonstrated significant speedups, include custom-hand tuned accelerators or even full processor architectures on the reconfigurable logic. In this paper we present an approach for the automatic synthesis of accelerators from C, targeted at irregular applications. In contrast to typical High Level Synthesis paradigms, which construct a centralized Finite State Machine, our approach generates dynamically scheduled hardware components. While parallelism exploitation in typical HLS-generated accelerators is usually bound within a single execution flow, our solution allows concurrently running multiple execution flow, thus also exploiting the coarser grain task parallelism of irregular applications. Our approach supports multiple, multi-ported and distributed memories, and atomic memory operations. Its main objective is parallelizing as many memory operations as possible, independently from their execution time, to maximize the memory bandwidth utilization. This significantly differs from current HLS flows, which usually consider a single memory port and require precise scheduling of memory operations. A key innovation of our approach is the generation of a memory interface controller, which dynamically maps concurrent memory accesses to multiple ports. We present a case study on a typical irregular kernel, Graph Breadth First search (BFS), exploring different tradeoffs in terms of parallelism and number of memories.

BFS↗