Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data Mining”

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 415 records · Page 23

Automation of Data Collection Methods for Online Monitoring of Nuclear Power Plants

Maintenance activities in the United States nuclear power industry are mainly centered on preventive and corrective maintenance. Predictive maintenance, which is a variable time basis maintenance strategy that is dependent on the condition of the equipment, is less utilized but potentially more effective. In the current maintenance practices, the nuclear power plants rely on manual processes to supply information to a human decision making process. The plants have several processes that generate information that is not typically used beyond the intended target for collecting that information. This information is a source of data that is manually collected by labor intensive tasks. The data is therefore expensive to collect, yet limited in use. The industry has realized the opportunity present in reducing the labor intensive tasks by automating them and increasing the uses of the data collected by either developing advanced predictive maintenance methods using data-driven decision making that could span from trending to machine learning and artificial intelligence. This shift in maintenance strategy may result in high cost saving impact. In addition to reducing labor requirements and frequency of maintenance activities, this shift in strategy will reduce the materials portion of the operations and maintenance cost as well. The aim of this specific effort is to focus on the automation of data collection process. It is part of a series of planned efforts to target multiple elements of migrating the current preventive maintenance approach in nuclear power plants to a data-driven approach. These elements include data collection, management, analysis, visualization, in addition to value analysis and change enabling. The other five elements of migration were not considered because they are planned to be explicitly studied in multiple parallel efforts. Challenges including regulations requirements or limitations are planned in a future effort that focuses on change enabling. The risk and benefit/cost of the approach shift is planned in another effort targeted towards value. The storage, communication, computational power, data architecture, and protection are part of the information infrastructure and are planned in dedicated data management effort. The best means to present the data for assisted human decision making is planned in a data visualization effort. The data interpretation and patterns recognition for machine decision making is planned through multiple efforts in data analytics over the following years. This work identified seventeen data sources collection methods in nuclear power plants that could be automated for an integrated data platform that enables comprehensive and informed decision making. For each of the identified seventeen data sources, the base, modern, and state of the art states were described. The current state of data collection used by most utilities was identified as the "base state". The current achievable state was identified as the "modern state", a state that has either been achieved by at least some US utilities or in other industries. The future state that requires research and development to reach was identified as the "state of the art" state. The described states used an out-of-the-box thinking approach. This effort found that there is a hug potential for task automation and data fidelity improvements by evolving the current industry data collection methods. The majority of the processes analyzed were found to be manual and labor intensive and fell in the base state. As a result, the modern state often targeted reducing the manual logging efforts by using electronic and semi-intelligent means or complementing the work with sensors and mobile or fixed technologies that can reduce the demand of labor activities. The state of the art state involved applications advanced methods of data correlation, data mining, and machine learning along with increasing the spatial distribution and fidelity of data, coupling multiple data sources, and enabling the use of sophisticated mobile devices and machine comprehension methods.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Value, Cost, and Sharing: Open Issues in Constrained Clustering

Clustering is an important tool for data mining, since it can identify major patterns or trends without any supervision (labeled data). Over the past five years, semi-supervised (constrained) clustering methods have become very popular. These methods began with incorporating pairwise constraints and have developed into more general methods that can learn appropriate distance metrics. However, several important open questions have arisen about which constraints are most useful, how they can be actively acquired, and when and how they should be propagated to neighboring points. This position paper describes these open questions and suggests future directions for constrained clustering research.

constraints↗

Aircraft Anomaly Detection Using Performance Models Trained on Fleet Data

This paper describes an application of data mining technology called Distributed Fleet Monitoring (DFM) to Flight Operational Quality Assurance (FOQA) data collected from a fleet of commercial aircraft. DFM transforms the data into aircraft performance models, flight-to-flight trends, and individual flight anomalies by fitting a multi-level regression model to the data. The model represents aircraft flight performance and takes into account fixed effects: flight-to-flight and vehicle-to-vehicle variability. The regression parameters include aerodynamic coefficients and other aircraft performance parameters that are usually identified by aircraft manufacturers in flight tests. Using DFM, the multi-terabyte FOQA data set with half-million flights was processed in a few hours. The anomalies found include wrong values of competed variables, (e.g., aircraft weight), sensor failures and baises, failures, biases, and trends in flight actuators. These anomalies were missed by the existing airline monitoring of FOQA data exceedances.

Gorinevsky, Dimitry↗

Critical review of functionalized silica sorbent strategies for selective extraction of rare earth elements from acid mine drainage

We report the ubiquitous and growing global reliance on rare earth elements (REEs) for modern technology and the need for reliable domestic sources underscore the rising trend in REE-related research. Adsorption-based methods for REE recovery from liquid waste sources are well-positioned to compete with those of solvent extraction, both because of their expected lower negative environmental impact and simpler process operations. Functionalized silica represents a rising category of low cost and stable sorbents for heavy metal and REE recovery. These materials have collectively achieved high capacity and/or high selective removal of REEs from ideal solutions and synthetic or real coal wastewater and other leachate source. These sorbents are competitive with conventional materials, such as ion exchange resins, activated carbon; and novel polymeric materials like ion-imprinted particles and metal organic frameworks (MOFs). This critical review first presents a data mining analysis for rare earth element recovery publications indexed in Web of science, highlighting changes in REE recovery research foci and confirming the sharply growing interest in functionalized silica sorbents. A detailed examination of sorbent formulation and operation strategies to selectively separate heavy (HREE), middle (MREE), and light (LREE) REEs from the aqueous sources is presented. Selectivity values for sorbents were largely calculated from available figure data and gauged the success of the associated strategies, primarily: (1) silane-grafted ligands, (2) impregnated ligands, and (3) bottom-up ligand/silica hybrids. These were often accompanied by successful co-strategies, especially bite angle control, site saturation, and selective REE elution. Recognizing the need to remove competing fouling metals to achieve purified REE “baskets,” we highlight techniques for eliminating these species from acid mine drainage (AMD) and suggest a novel adsorption-based process for purified REE extraction that could be adapted to different water systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization

Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors W and H, for the given input matrix A, such that A≈WH. NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient parallel algorithms to solve the problem for big data sets. The main contribution of this work is a new, high-performance parallel computational framework for a broad class of NMF algorithms that iteratively solves alternating non-negative least squares (NLS) subproblems for W and H. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). The framework is flexible and able to leverage a variety of NMF and NLS algorithms, including Multiplicative Update, Hierarchical Alternating Least Squares, and Block Principal Pivoting. Our implementation allows us to benchmark and compare different algorithms on massive dense and sparse data matrices of size that spans from few hundreds of millions to billions. We demonstrate the scalability of our algorithm and compare it with baseline implementations, showing significant performance improvements. The code and the datasets used for conducting the experiments are available online.

2D↗

A high-performance parallel algorithm for nonnegative matrix factorization

Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors W and H, for the given input matrix A, such that A ≈ WH. NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient distributed algorithms to solve the problem for big data sets. We propose a high-performance distributed-memory parallel algorithm that computes the factorization by iteratively solving alternating non-negative least squares (NLS) subproblems for W and H. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). As opposed to previous implementations, our algorithm is also flexible: (1) it performs well for both dense and sparse matrices, and (2) it allows the user to choose any one of the multiple algorithms for solving the updates to low rank factors W and H within the alternating iterations. We demonstrate the scalability of our algorithm and compare it with baseline implementations, showing significant performance improvements.

Kannan, Ramakrishnan↗

HPC-NMF: A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization

NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient distributed algorithms to solve the problem for big data sets. We propose a high-performance distributed-memory parallel algorithm that computes the factorization by iteratively solving alternating non-negative least squares (NLS) subproblems for $\WW$ and $\HH$. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). As opposed to previous implementation, our algorithm is also flexible: It performs well for both dense and sparse matrices, and allows the user to choose any one of the multiple algorithms for solving the updates to low rank factors $\WW$ and $\HH$ within the alternating iterations.

Kannan, Ramakrishnan↗

Effective and efficient optics inspection approach using machine learning algorithms

The Final Optics Damage Inspection (FODI) system automatically acquires and utilizes the Optics Inspection (OI) system to analyze images of the final optics at the National Ignition Facility (NIF). During each inspection cycle up to 1000 images acquired by FODI are examined by OI to identify and track damage sites on the optics. The process of tracking growing damage sites on the surface of an optic can be made more effective by identifying and removing signals associated with debris or reflections. The manual process to filter these false sites is daunting and time consuming. In this paper we discuss the use of machine learning tools and data mining techniques to help with this task. We describe the process to prepare a data set that can be used for training and identifying hardware reflections in the image data. In order to collect training data, the images are first automatically acquired and analyzed with existing software and then relevant features such as spatial, physical and luminosity measures are extracted for each site. A subset of these sites is 'truthed' or manually assigned a class to create training data. A supervised classification algorithm is used to test if the features can predict the class membership of new sites. A suite of self-configuring machine learning tools called 'Avatar Tools' is applied to classify all sites. To verify, we used 10-fold cross correlation and found the accuracy was above 99%. This substantially reduces the number of false alarms that would otherwise be sent for more extensive investigation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple, Scalable, Script-Based Science Processor (S4P)

The development and deployment of data processing systems to process Earth Observing System (EOS) data has proven to be costly and prone to technical and schedule risk. Integration of science algorithms into a robust operational system has been difficult. The core processing system, based on commercial tools, has demonstrated limitations at the rates needed to produce the several terabytes per day for EOS, primarily due to job management overhead. This has motivated an evolution in the EOS Data Information System toward a more distributed one incorporating Science Investigator-led Processing Systems (SIPS). As part of this evolution, the Goddard Earth Sciences Distributed Active Archive Center (GES DAAC) has developed a simplified processing system to accommodate the increased load expected with the advent of reprocessing and launch of a second satellite. This system, the Simple, Scalable, Script-based Science Processor (S42) may also serve as a resource for future SIPS. The current EOSDIS Core System was designed to be general, resulting in a large, complex mix of commercial and custom software. In contrast, many simpler systems, such as the EROS Data Center AVHRR IKM system, rely on a simple directory structure to drive processing, with directories representing different stages of production. The system passes input data to a directory, and the output data is placed in a "downstream" directory. The GES DAAC's Simple Scalable Script-based Science Processing System is based on the latter concept, but with modifications to allow varied science algorithms and improve portability. It uses a factory assembly-line paradigm: when work orders arrive at a station, an executable is run, and output work orders are sent to downstream stations. The stations are implemented as UNIX directories, while work orders are simple ASCII files. The core S4P infrastructure consists of a Perl program called stationmaster, which detects newly arrived work orders and forks a job to run the appropriate executable (registered in a configuration file for that station). Although S4P is written in Perl, the executables associated with a station can be any program that can be run from the command line, i.e., non-interactively. An S4P instance is typically monitored using a simple Graphical User Interface. However, the reliance of S4P on UNIX files and directories also allows visibility into the state of stations and jobs using standard operating system commands, permitting remote monitor/control over low-bandwidth connections. S4P is being used as the foundation for several small- to medium-size systems for data mining, on-demand subsetting, processing of direct broadcast Moderate Resolution Imaging Spectroradiometer (MODIS) data, and Quick-Response MODIS processing. It has also been used to implement a large-scale system to process MODIS Level 1 and Level 2 Standard Products, which will ultimately process close to 2 TB/day.

Lynnes, Christopher↗

Inductive System Monitors Tasks

The Inductive Monitoring System (IMS) software developed at Ames Research Center uses artificial intelligence and data mining techniques to build system-monitoring knowledge bases from archived or simulated sensor data. This information is then used to detect unusual or anomalous behavior that may indicate an impending system failure. Currently helping analyze data from systems that help fly and maintain the space shuttle and the International Space Station (ISS), the IMS has also been employed by data classes are then used to build a monitoring knowledge base. In real time, IMS performs monitoring functions: determining and displaying the degree of deviation from nominal performance. IMS trend analyses can detect conditions that may indicate a failure or required system maintenance. The development of IMS was motivated by the difficulty of producing detailed diagnostic models of some system components due to complexity or unavailability of design information. Successful applications have ranged from real-time monitoring of aircraft engine and control systems to anomaly detection in space shuttle and ISS data. IMS was used on shuttle missions STS-121, STS-115, and STS-116 to search the Wing Leading Edge Impact Detection System (WLEIDS) data for signs of possible damaging impacts during launch. It independently verified findings of the WLEIDS Mission Evaluation Room (MER) analysts and indicated additional points of interest that were subsequently investigated by the MER team. In support of the Exploration Systems Mission Directorate, IMS is being deployed as an anomaly detection tool on ISS mission control consoles in the Johnson Space Center Mission Operations Directorate. IMS has been trained to detect faults in the ISS Control Moment Gyroscope (CMG) systems. In laboratory tests, it has already detected several minor anomalies in real-time CMG data. When tested on archived data, IMS was able to detect precursors of the CMG1 failure nearly 15 hours in advance of the actual failure event. In the Aeronautics Research Mission Directorate, IMS successfully performed real-time engine health analysis. IMS was able to detect simulated failures and actual engine anomalies in an F/A-18 aircraft during the course of 25 test flights. IMS is also being used in colla

Source record↗

Open Chemistry, JupyterLab, REST, and quantum chemistry

Quantum chemistry must evolve if it wants to fully leverage the benefits of the internet age, where the worldwide web offers a vast tapestry of tools that enable users to communicate and interact with complex data at the speed and convenience of a button press. The Open Chemistry project has developed an open-source framework that offers an end-to-end solution for producing, sharing, and visualizing quantum chemical data interactively on the web using an array of modern tools and approaches. These tools build on some of the best open-source community projects such as Jupyter for interactive online notebooks, coupled with 3D accelerated visualization, state-of-the-art computational chemistry codes including NWChem and Psi4, and emerging machine learning and data mining tools such as ChemML and ANI. They offer flexible formats to import and export data, along with approaches to compare computational and experimental data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

27-Hydroxycholesterol increases Myc protein stability via suppressing PP2A, SCP1 and FBW7 transcription in MCF-7 breast cancer cells

27-hydroxycholesterol (27-HC), the most abundant metabolite of cholesterol, is a risk factor for breast cancer. It can increase the proliferation of breast cancer cells and promote the metastasis of breast tumours in mouse models. Myc is a critical oncoprotein overexpressed in breast cancer. However, whether 27-HC affects Myc expression has not been reported. In the current study, we aimed to investigate the effects of 27-HC on Myc and the underlying mechanisms in MCF-7 breast cancer cells. Our data demonstrated that 27-HC activated Myc via increasing its protein stability. Three key negative modulators of Myc protein stability, PP2A, SCP1 and FBW7, were suppressed by 27-HC at the transcriptional level. We performed a data-mining analysis of the chromatin immunoprecipitation with next-generation DNA sequencing (ChIP-Seq) data in the ChIPBase, and discovered that a number of putative transcription factors (TFs), including Myc itself, were involved in the transcriptional regulation of PP2A, SCP1 and FBW7. Our results provide a novel mechanistic insight into the activation of Myc by 27-HC via transcriptional repression of PP2A, SCP1 and FBW7 to increase Myc protein stability in breast cancer cells. - Highlights: • 27-Hydroxycholesterol (27-HC) activates Myc via increasing its protein stability. • 27-HC inhibits PP2A and SCP1 transcription to block pS62-Myc dephosphorylation. • 27-HC suppresses FBW7 transcription to prevent pT58-Myc degradation.

60 APPLIED LIFE SCIENCES↗

Adaptive Neuron Apoptosis for Accelerating Deep Learning on Large Scale Systems

Machine Learning and Data Mining (MLDM) algorithms are becoming ubiquitous in {\em model learning} from the large volume of data generated using simulations, experiments and handheld devices. Deep Learning algorithms -- a class of MLDM algorithms -- are applied for automatic feature extraction, and learning non-linear models for unsupervised and supervised algorithms. Naturally, several libraries which support large scale Deep Learning -- such as TensorFlow and Caffe -- have become popular. In this paper, we present novel techniques to accelerate the convergence of Deep Learning algorithms by conducting low overhead removal of redundant neurons -- {\em apoptosis} of neurons -- which do not contribute to model learning, during the training phase itself. We provide in-depth theoretical underpinnings of our heuristics (bounding accuracy loss and handling apoptosis of several neuron types), and present the methods to conduct adaptive neuron apoptosis. We implement our proposed heuristics with the recently introduced TensorFlow and using its recently proposed extension with MPI. Our performance evaluation on two difference clusters -- one connected with Intel Haswell multi-core systems, and other with nVIDIA GPUs -- using InfiniBand, indicates the efficacy of the proposed heuristics and implementations. Specifically, we are able to improve the training time for several datasets by 2-3x, while reducing the number of parameters by 30x (4-5x on average) on datasets such as ImageNet classification. For the Higgs Boson dataset, our implementation improves the accuracy (measured by Area Under Curve (AUC)) for classification from 0.88/1 to 0.94/1, while reducing the number of parameters by 3x in comparison to existing literature, while achieving a 2.44x speedup in comparison to the default (no apoptosis) algorithm.

Siegel, Charles M.↗

Exploiting Spatial Signatures of Power ENF Signal for Measurement Source Authentication

Electric Network Frequency (ENF) signals are the signatures of power systems that are either directly recorded from the power outlets or extracted from multimedia recordings near the electrical activities. Variations of ENF signals collected at different locations possess local environmental characteristics, which can be used as a potential fingerprint for authenticating measurements' source information. Within this paper is proposed a computational intelligence-based framework to recognize the source locations of power ENF signals within a distribution network in the US. To be more specific, a set of informative location-sensitive signatures from ENF measurements are initially extract with such measurements representative of local grid characteristics. Then these distinctive location-dependent signatures are further fed into a data mining algorithm yielding the “source-of-origin” of ENF measurements. Experimental results using ENF data at multiple intra-grid locations have validated the proposed methodology.

CUI, YI↗

Machine Learning for Big Data: A Study to Understand Limits at Scale

This report aims to empirically understand the limits of machine learning when applied to Big Data. We observe that recent innovations in being able to collect, access, organize, integrate, and query massive amounts of data from a wide variety of data sources have brought statistical data mining and machine learning under more scrutiny, evaluation and application for gleaning insights from the data than ever before. Much is expected from algorithms without understanding their limitations at scale while dealing with massive datasets. In that context, we pose and address the following questions How does a machine learning algorithm perform on measures such as accuracy and execution time with increasing sample size and feature dimensionality? Does training with more samples guarantee better accuracy? How many features to compute for a given problem? Do more features guarantee better accuracy? Do efforts to derive and calculate more features and train on larger samples worth the effort? As problems become more complex and traditional binary classification algorithms are replaced with multi-task, multi-class categorization algorithms do parallel learners perform better? What happens to the accuracy of the learning algorithm when trained to categorize multiple classes within the same feature space? Towards finding answers to these questions, we describe the design of an empirical study and present the results. We conclude with the following observations (i) accuracy of the learning algorithm increases with increasing sample size but saturates at a point, beyond which more samples do not contribute to better accuracy/learning, (ii) the richness of the feature space dictates performance - both accuracy and training time, (iii) increased dimensionality often reflected in better performance (higher accuracy in spite of longer training times) but the improvements are not commensurate the efforts for feature computation and training and (iv) accuracy of the learning algorithms drop significantly with multi-class learners training on the same feature matrix and (v) learning algorithms perform well when categories in labeled data are independent (i.e., no relationship or hierarchy exists among categories).

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

A data and information system for processing, archival, and distribution of data for global change research

Work on this project was focused on information management techniques for Marshall Space Flight Center's EOSDIS Version 0 Distributed Active Archive Center (DAAC). The centerpiece of this effort has been participation in EOSDIS catalog interoperability research, the result of which is a distributed Information Management System (IMS) allowing the user to query the inventories of all the DAAC's from a single user interface. UAH has provided the MSFC DAAC database server for the distributed IMS, and has contributed to definition and development of the browse image display capabilities in the system's user interface. Another important area of research has been in generating value-based metadata through data mining. In addition, information management applications for local inventory and archive management, and for tracking data orders were provided.

Graves, Sara J.↗

Inductive System Health Monitoring

The Inductive Monitoring System (IMS) software was developed to provide a technique to automatically produce health monitoring knowledge bases for systems that are either difficult to model (simulate) with a computer or which require computer models that are too complex to use for real time monitoring. IMS uses nominal data sets collected either directly from the system or from simulations to build a knowledge base that can be used to detect anomalous behavior in the system. Machine learning and data mining techniques are used to characterize typical system behavior by extracting general classes of nominal data from archived data sets. IMS is able to monitor the system by comparing real time operational data with these classes. We present a description of learning and monitoring method used by IMS and summarize some recent IMS results.

Iverson, David L.↗

INDUCTIVE SYSTEM HEALTH MONITORING WITH STATISTICAL METRICS

Model-based reasoning is a powerful method for performing system monitoring and diagnosis. Building models for model-based reasoning is often a difficult and time consuming process. The Inductive Monitoring System (IMS) software was developed to provide a technique to automatically produce health monitoring knowledge bases for systems that are either difficult to model (simulate) with a computer or which require computer models that are too complex to use for real time monitoring. IMS processes nominal data sets collected either directly from the system or from simulations to build a knowledge base that can be used to detect anomalous behavior in the system. Machine learning and data mining techniques are used to characterize typical system behavior by extracting general classes of nominal data from archived data sets. In particular, a clustering algorithm forms groups of nominal values for sets of related parameters. This establishes constraints on those parameter values that should hold during nominal operation. During monitoring, IMS provides a statistically weighted measure of the deviation of current system behavior from the established normal baseline. If the deviation increases beyond the expected level, an anomaly is suspected, prompting further investigation by an operator or automated system. IMS has shown potential to be an effective, low cost technique to produce system monitoring capability for a variety of applications. We describe the training and system health monitoring techniques of IMS. We also present the application of IMS to a data set from the Space Shuttle Columbia STS-107 flight. IMS was able to detect an anomaly in the launch telemetry shortly after a foam impact damaged Columbia's thermal protection system.

Iverson, David L.↗