Search NASA⌕ Search

SEARCH · Search NASA

Results for “false data”

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 181 records · Page 10

Using Multiple Signatures to Improve Accuracy of Substorm Identification

Abstract We have developed a new procedure for combining lists of substorm onset times from multiple sources. We apply this procedure to observational data and to magnetohydrodynamic (MHD) model output from 1–31 January 2005. We show that this procedure is capable of rejecting false positive identifications and filling data gaps that appear in individual lists. The resulting combined onset lists produce a waiting time distribution that is comparable to previously published results, and superposed epoch analyses of the solar wind driving conditions and magnetospheric response during the resulting onset times are also comparable to previous results. Comparison of the substorm onset list from the MHD model to that obtained from observational data reveals that the MHD model reproduces many of the characteristic features of the observed substorms, in terms of solar wind driving, magnetospheric response, and waiting time distribution. Heidke skill scores show that the MHD model has statistically significant skill in predicting substorm onset times.

Haiducek, John D.↗

Molecular Assemblies, Genes and Genomics Integrated Efficiently (MAGGIE)

Final report on MAGGIE. We set ambitious goals to model the functions of individual organisms and their community from molecular to systems scale. These scientific goals are driving the development of sophisticated algorithms to analyze large amounts of experimental measurements made using high throughput technologies to explain and predict how the environment influences biological function at multiple scales and how the microbial systems in turn modify the environment. By experimentally evaluating predictions made using these models we will test the degree to which our quantitative multiscale understanding wilt help to rationally steer individual microbes and their communities towards specific tasks. Towards this end we have made substantial progress towards understanding evolution of gene families, transcriptional structures, detailed structures of keystone molecular assemblies (proteins and complexes), protein interactions, biological networks, microbial interactions, and community structure. Using comparative analysis we have tracked the evolutionary history of gene functions to understand how novel functions evolve. One level up, we have used proteomics data, high-resolution genome tiling microarrays, and 5' RNA sequencing to revise genome annotations, discover new genes including ncRNAs, and map dynamically changing operon structures of five model organisms: For Desulfovibrio vulgaris Hildenborough, Pyrococcus furiosis, Sulfolobus solfataricus, Methanococcus maripaludis and Haiobacterium salinarum NROL We have developed machine learning algorithms to accurately identify protein interactions at a near-zero false positive rate from noisy data generated using tagfess complex purification, TAP purification, and analysis of membrane complexes. Combining other genome-scale datasets produced by ENIGMA (in particular, microarray data) and available from literature we have been able to achieve a true positive rate as high as 65% at almost zero false positives when applied to the manually curated training set. Applying this method to the data representing around a quarter of the fraction space for water soluble proteins in D. vulgaris, we obtained 854 reliable pair wise interactions. Further, we have developed algorithms to analyze and assign significance to protein interaction data from bait pull-down experiments and integrate these data with other systems biology data through associative biclustering in a parallel computing environment. We will 'fill-in' missing information in these interaction data using a 'Transitive Closure' algorithm and subsequently use 'Between Commonality Decomposition' algorithm to discover complexes within these large graphs of protein interactions. To characterize the metabolic activities of proteins and their complexes we are developing algorithms to deconvolute pure mass spectra, estimate chemical formula for m/z values, and fit isotopic fine structure to metabolomics data. We have discovered that in comparison to isotopic pattern fitting methods restricting the chemical formula by these two dimensions actually facilitates unique solutions for chemical formula generators. To understand how microbial functions are regulated we have developed complementary algorithms for reconstructing gene regulatory networks (GRNs). Whereas the network inference algorithms cMonkey and Inferelator developed enable de novo reconstruction of predictive models for GRNs from diverse systems biology data, the RegPrecise and RegPredict framework developed uses evolutionary comparisons of genomes from closely related organisms to reconstruct conserved regulons. We have integrated the two complementary algorithms to rapidly generate comprehensive models for gene regulation of understudied organisms. Our preliminary analyses of these reconstructed GRNs have revealed novel regulatory mechanisms and cis-regulatory motifs, as well asothers that are conserved across species. Finally, we are supporting scientific efforts in ENIGMA with data management solutions and by integrating all of the algorithms, software and data into a Knowledgebase. For instance, we have developed the RegPrecise database (http://regprecise.lbl.gov) which represents manually curated sets of regulons laying the basis for automatic annotation of regulatory interactions in closely related species. We are also in the midst of scaling up MicrobesOnline to handle the growing volume of sequence and functional genomics data. Over the last year our efforts have been focused on providing support for additional genomic and functional genomic data types. Similarly, we have developed several visualization tools to help with the exploration of complex systems biology datasets. A case in point is the Gaggle Genome Browser (GGB), which was enhanced with visualizations for plotting peptide detections and protein-DNA binding alongside transcriptome structure, plus the ability to interactively filter by signal intensity or p-value.

54 ENVIRONMENTAL SCIENCES↗

Addressing the Challenges of Anomaly Detection for Cyber Physical Energy Grid Systems

The consolidation of cyber communications networks and physical control systems within the energy smart grid introduces a number of new risks. Unfortunately, these risks are largely unknown and poorly understood, yet include very high impact losses from attack and component failures. One important aspect of risk management is the detection of anomalies and changes. However, anomaly detection within cyber security remains a difficult, open problem, with special challenges in dealing with false alert rates and heterogeneous data. Furthermore, the integration of cyber and physical dynamics is often intractable. And, because of their broad scope, energy grid cyber-physical systems must be analyzed at multiple scales, from individual components, up to network level dynamics. We describe an improved approach to anomaly detection that combines three important aspects. First, system dynamics are modeled using a reduced order model for greater computational tractability. Second, a probabilistic and principled approach to anomaly detection is adopted that allows for regulation of false alerts and comparison of anomalies across heterogeneous data sources. Third, a hierarchy of aggregations are constructed to support interactive and automated analyses of anomalies at multiple scales.

Anomaly Detection↗

Data-Conforming Data-Driven Control: Avoiding Premature Generalizations Beyond Data

Data-driven and adaptive control approaches face the problem of introducing sudden distributional shifts beyond the distribution of data encountered during learning. Therefore, they are prone to invalidating the very assumptions used in their own construction. This is due to the linearity of the underlying system, inherently assumed and formulated in most data-driven control approaches, which may falsely generalize the behavior of the system beyond the behavior experienced in the data. This article seeks to mitigate these problems by enforcing consistency of the newly designed closed-loop systems with data and slowing down any distributional shifts in the joint state-input space. This is achieved through incorporating affine regularization terms and linear matrix inequality constraints to data-driven approaches, resulting in convex semi-definite programs that can be efficiently solved by standard software packages. We discuss the optimality conditions of these programs and then conclude this article with a numerical example that further highlights the problem of premature generalization beyond data and shows the effectiveness of our proposed approaches in enhancing the safety of data-driven control methods.

97 MATHEMATICS AND COMPUTING↗

Methods for automatic trigger threshold adjustment

Methods are presented for adjusting trigger threshold values to compensate for drift in the quiescent level of a signal monitored for initiating a data recording event, thereby avoiding false triggering conditions. Initial threshold values are periodically adjusted by re-measuring the quiescent signal level, and adjusting the threshold values by an offset computation based upon the measured quiescent signal level drift. Re-computation of the trigger threshold values can be implemented on time based or counter based criteria. Additionally, a qualification width counter can be utilized to implement a requirement that a trigger threshold criterion be met a given number of times prior to initiating a data recording event, further reducing the possibility of a false triggering situation.

47 OTHER INSTRUMENTATION↗

Hybrid data-driven and model-informed online tool wear detection in milling machines

Precision machining tool wear is responsible for low product throughput and quality. Monitoring the tool wear online is vital to prevent degradation in machining quality. However, direct real-time tool wear measurement is not practical. This paper presents residual-based anomaly detection models, combining a hybrid model comprised of a physics-based model and a data-driven model (a decision tree or a neural network) to predict signals of interest (e.g., power or forces) under nominal conditions, followed by Page’s cumulative sum test for detecting tool wear on-line using the computer numerical control machine measurements. The most informative features are ranked using dynamic programming and its approximation variants from real-time measurements and machine settings, such as the width of cut, depth of cut, feed rate and spindle speed, that serve as inputs to the predictive models. The baseline nominal model is incrementally updated with experimental data via a gradient boosted adaptation model to generate the residuals that account for discrepancies between the actual machine data under normal conditions and the baseline nominal model predictions. The hybrid model is validated against 20 Mazak milling machine experimental tests and one Haas run-to-failure experiment. The proposed anomaly detector is applied to synthetic data from simulations of the physics-based model at different operating conditions, measurement noise levels, and tool wear levels, and the methods were able to achieve an overall 92% accuracy in data with 1% noise. The anomaly detection methods based on hybrid model reduced the false alarms of either the data-driven or physical-based models alone, and are found to be capable of good online detection of tool wear.

42 ENGINEERING↗

Analysis of Automated Fault Detection and Diagnosis Records as an Indicator of HVAC Fault Prevalence: Methodology and Preliminary Results

Faults in commercial buildings can cause energy waste and other performance problems such as reduced occupant comfort, reduced equipment longevity, and increased noise. However, it is currently unknown how commonly faults occur in different equipment types. A method has been developed to estimate the prevalence of faults in air handling units, air terminal units, and rooftop units. This method includes two types of data. The first is data from several automated fault detection and diagnostics (AFDD) software technologies. This type of data provides a large sample that represents a wide range of building types, geographical locations, and equipment types. It includes fault diagnoses from thousands of buildings around the United States, as well as anonymized metadata describing the building and equipment characteristics. The number of fault records is in the order of 107. However, despite the size and richness of the data sample, this data contains some degree of inaccuracy, i.e., false positive and false negative findings. Therefore, the study includes a second type of data, coming from manual inspection of buildings that have had the same AFDD methods applied to them (from the commercial AFDD offerings). Since the field tests are conducted in buildings with AFDD-generated fault prevalence data, they can be combined with the larger sample size to provide insight into the potential biases or lower sensitivity of the AFDD data. Once a library of fault prevalence data is built, it will be studied to provide further insight into the drivers of fault prevalence, for example, whether prevalence is correlated with building type, geographical location (which is tied to climate and to utility rates), building size, etc. This paper describes the methods developed for this study and illustrates them with preliminary data. It discusses some of the challenges of harmonizing disparate outputs from multiple AFDD vendors, application of a unifying fault taxonomy, and fault prevalence metrics.

Ebrahimi Fakhar, Amir↗

Fast Semi-automated Filtration Method for Non-targeted LC-QTOF Data of Aged Nitroplasticizer Samples

A full dataset of aged nitroplasticizer (NP) is composed of more than 2000 unique mass-to-charges (m/z) when combining the non-targeted data obtained from both positive and negative electrospray ionization modes in time-of-flight mass spectrometry. Therefore, manual processing of these data often takes days, weeks, or even months to scrutinize for mechanistic insights. To effectively extract meaningful signals that represent vital degradation intermediates in the early NP degradation mechanism, a semi-automated postprocessing workflow for data filtering, tailored to the aging experiment of NP, has been developed. The automated portion of this workflow is written in a Python code (using pandas, numpy, and matplotlib libraries), which removes more than 65% of potential false signals within seconds via four threshold-based adjustable filters: signal sensitivity, coefficient of variation, number of measurements, and retention time variability. As for the manual portion, a pattern-based inspection method is employed to reduce another 23% or more false positives, which greatly simplifies data visualization and results in less than 3% of potential candidate m/z needing in-depth data interpretation. As a positive control, known compounds are verified. Using this semi-automated data reduction method, the amount of time required is reduced to a matter of hours for data filtering in the non-targeted datasets of aged NP, which saves more time and effort for compound identification.

36 MATERIALS SCIENCE↗

Assessing the Dynamics and Complexity of Disease Pathogenicity Using 4-Dimensional Immunological Data

Investigating disease pathogenesis and personalized prognostics are major biomedical needs. Because patients sharing the same diagnosis can experience different outcomes, such as survival or death, physicians need new personalized tools, including those that rapidly differentiate several inflammatory phases. To address these topics, a pattern recognition-based method (PRM) that follows an inverse problem approach was designed to assess, in <10 min, eight concepts: synergy , pleiotropy , complexity , dynamics , ambiguity , circularity , personalized outcomes , and explanatory prognostics (pathogenesis). By creating thousands of secondary combinations derived from blood leukocyte data, the PRM measures synergic, pleiotropic, complex and dynamic data interactions, which provide personalized prognostics while some undesirable features—such as false results and the ambiguity associated with data circularity-are prevented. Here, this method is compared to Principal Component Analysis (PCA) and evaluated with data collected from hantavirus-infected humans and birds that appeared to be healthy. When human data were examined, the PRM predicted 96.9 % of all surviving patients while PCA did not distinguish outcomes. Demonstrating applications in personalized prognosis, eight PRM data structures sufficed to identify all but one of the survivors. Dynamic data patterns also distinguished survivors from non-survivors, as well as one subset of non-survivors, which exhibited chronic inflammation. When the PRM explored avian data, it differentiated immune profiles consistent with no, early, or late inflammation. Yet, PCA did not recognize patterns in avian data. Findings support the notion that immune responses, while variable, are rather deterministic: a low number of complex and dynamic data combinations may be enough to, rapidly, unmask conditions that are neither directly observable nor reliably forecasted.

60 APPLIED LIFE SCIENCES↗

Builtin vs. auxiliary detection of extrapolation risk.

A key assumption in supervised machine learning is that future data will be similar to historical data. This assumption is often false in real world applications, and as a result, prediction models often return predictions that are extrapolations. We compare four approaches to estimating extrapolation risk for machine learning predictions. Two builtin methods use information available from the classification model to decide if the model would be extrapolating for an input data point. The other two build auxiliary models to supplement the classification model and explicitly model extrapolation risk. Experiments with synthetic and real data sets show that the auxiliary models are more reliable risk detectors. To best safeguard against extrapolating predictions, however, we recommend combining builtin and auxiliary diagnostics.

Munson, Miles Arthur↗

COMPARISON OF RADIO-FREQUENCY INTERFERENCE MITIGATION STRATEGIES FOR DISPERSED PULSE DETECTION

Impulsive radio-frequency signals from astronomical sources are dispersed by the frequency-dependent index of refraction of the interstellar media and so appear as chirped signals when they reach Earth. Searches for dispersed impulses have been limited by false detections due to radio-frequency interference (RFI) and, in some cases, artifacts of the instrumentation. Many authors have discussed techniques to excise or mitigate RFI in searches for fast transients, but comparisons between different approaches are lacking. This work develops RFI mitigation techniques for use in searches for dispersed pulses, employing data recorded in a 'Fly's Eye' mode of the Allen Telescope Array as a test case. We gauge the performance of several RFI mitigation techniques by adding dispersed signals to data containing RFI and comparing false alarm rates at the observed signal-to-noise ratios of the added signals. We find that Huber filtering is most effective at removing broadband interferers, while frequency centering is most effective at removing narrow frequency interferers. Neither of these methods is effective over a broad range of interferers. A method that combines Huber filtering and adaptive interference cancelation provides the lowest number of false positives over the interferers considered here. The methods developed here have application to other searches for dispersed pulses in incoherent spectra, especially those involving multiple beam systems.

79 ASTRONOMY AND ASTROPHYSICS↗

Towards Feature-Preserving 2D and 3D Vector Field Compression

The objective of this work is to develop error-bounded lossy compression methods to preserve topological features in 2D and 3D vector fields. Specifically, we explore the preservation of critical points in piecewise linear vector fields. We define the preservation of critical points as, without any false positive, false negative, or false type change in the decompressed data, (1) keeping each critical point in its original cell and (2) retaining the type of each critical point (e.g., saddle and attracting node). The key to our method is to adapt a vertex-wise error bound for each grid point and to compress input data together with the error bound field using a modified lossy compressor. Our compression algorithm can be also embarrassingly parallelized for large data handling and in situ processing. We benchmark our method by comparing it with existing lossy compressors in terms of false positive/negative/type rates, compression ratio, and various vector field visualizations with several scientific applications.

critical points↗

D-Guaranteed Discrimination of Statistical Hypotheses: a Review of Results and Unsolved Problems

We compare two sequential d-guaranteed tests and an optimal d-guaranteed test based on a fixed number of observations with respect to the average number of observations within the most accepted practical applications of Bayesian probabilistic models. We consider the sequential “first skipping” test, the sequential locally efficient test based on the score statistic, and the test based on a fixed number of observations that minimizes the necessary sample size. We study various characteristics of these tests connected with the number of observations within three probabilistic models, namely, the normal (ϑ, σ{sup 2}) distribution of the observed random variable and the normal a priori distribution of ϑ with fixed σ{sup 2}; the exponential distribution with the intensity parameter ϑ and the a priori gamma distribution of ϑ; and the Bernoulli sampling with the success probability ϑ and the a priori beta distribution of ϑ. We discuss the connection of the d-posterior approach with the compound decision problem as applied to the analysis of data provided by microchips (when the false discovery rate, or FDR, for short, is treated as the d-risk of the first kind). We present the vast data on characteristics of the mentioned tests obtained by the method of mathematical modeling in several tables. We discuss unsolved problems of the d-guaranteed discrimination of hypotheses with the minimal number of observations and approaches to their solution.

97 MATHEMATICS AND COMPUTING↗

Estimating coccidioidomycosis endemicity while accounting for imperfect detection using spatio - temporal occupancy modeling

Coccidioidomycosis, or Valley fever, is an infectious disease caused by inhaling Coccidioides fungal spores. Incidence has risen in recent years, and it is believed the endemic region for Coccidioides is expanding in response to climate change. While Valley fever case data can help us understand trends in disease risk, using case data as a proxy for Coccidioides endemicity is not ideal because case data suffers from imperfect detection, including false positives (e.g., travel-related cases reported outside of endemic area) and false negatives (e.g., misdiagnosis or underreporting). Here we proposed a Bayesian, spatio-temporal occupancy model to relate monthly, county-level presence/absence data on Valley fever cases to latent endemicity of Coccidioides, accounting for imperfect detection. We used our model to estimate endemicity in the western United States. We estimated high probability of endemicity in southern California, Arizona, and New Mexico, but also in regions without mandated reporting, including western Texas, eastern Colorado, and southeastern Washington. We also quantified spatio-temporal variability in detectability of Valley fever, given an area is endemic to Coccidioides. We estimated an inverse relationship between lagged 3- and 9-month precipitation and case detection, and a positive association with agriculture. This work can help inform public health surveillance needs and identify areas that would benefit from mandatory case reporting.

60 APPLIED LIFE SCIENCES↗

Lightning strike prediction at the Savannah River Site

At the Savannah River Site, employees receive warnings about lightning only after three strikes have already occurred near the site. In order to increase employee safety, it is preferential to warn employees of a lightning threat much sooner. We used data from an on-site Electric Field Mill to measure values of the atmospheric electric charge. We also used lightning detection data from the National Lightning Detection Network and the Geostationary Lightning Mapper. By comparing the data of each, we can determine how long before or after a lightning strike did the Electric Field Mill first measure within our lightning detection threshold. If the detection threshold occurs before the strike does, this provides a lead time for knowing about lightning risks before they happen. Our findings conclude that 95% of lightning strikes have a lead time in the electric field where we can predict the lightning before it occurs and warn employees of the potential lightning threat. However, our lightning detection threshold can occur even without lightning or precipitation. Finding how these false lightning alarms affect our data is necessary to improving the lightning warning system.

54 ENVIRONMENTAL SCIENCES↗

SU-E-T-363: Error Detection Comparison of EPID and MLC Log File Based IMRT QA Systems

Purpose: In this study we will compare the ability of three QA methods (Delta4, MU-EPID, Dynalog QA) to detect specific errors. Methods: A Varian Novalis Tx with a HD120 MLC and aS1000 Electronic Portal Imaging Device (EPID) was used in our study. Multi-leaf collimator (MLC) errors, gantry angle and dose errors were introduced into 5 volumetric arc therapy (VMAT) plans. 3D dose distributions calculated with data from the EPID and Dynalog QA methods were compared with the planned dose distribution. The gamma passing percentages as well as percentage error of planning target volume (PTV) dose were used for passing determination. Baselines for gamma passing percentages and PTV dose were established by measuring the original plan 5 times consecutively. Standard passing thresholds as well as thresholds derived from receiver operator characteristic (ROC) analysis and 2 standard deviation (SD) criteria were used. Results: When applying the standard 95% pass rate at 3%/3mm gamma analysis 14, 21 and 8 of 30 errors were detected by the Delta4, MU-EPID and Dynalog QA methods respectively. Thresholds set at 2 SD from our base line measurements resulted in the detection of 18, 9 and 14 of 30 errors for the Delta4, MU-EPID and Dynalog QA methods respectively. When using D2 of the PTV as a metric the Dynalog QA detected 20 of 30 errors while the EPID method detected 14 of 30 errors. Using D98 of the PTV, Dynalog QA detected 13 of 30 while the EPID detected 3 of 30 errors. Conclusion: Although MU-EPID detected the most errors at the standard 95% cutoff it also produced the most false detections in the baseline data. The Dynalog QA was the most effective when the ROC adjusted passing threshold was used. D2 was more effective as a metric for detecting errors than D98.

60 APPLIED LIFE SCIENCES↗

NEW SPATIALLY RESOLVED OBSERVATIONS OF THE T Cha TRANSITION DISK AND CONSTRAINTS ON THE PREVIOUSLY CLAIMED SUBSTELLAR COMPANION

We present multi-epoch non-redundant masking observations of the T Cha transition disk, taken at the Very Large Telescope and Magellan in the H, Ks, and L' bands. T Cha is one of a small number of transition disks that host companion candidates discovered by high-resolution imaging techniques, with a putative companion at a position angle of 78°, separation of 62 mas, and contrast of ΔL' = 5.1 mag. We find comparable binary parameters in our re-reduction of the initial detection images, and similar parameters in the 2011 L', 2013 NaCo L', and 2013 NaCo Ks data sets. We find a close-in companion signal in the 2012 NaCo L' data set that cannot be explained by orbital motion, and a non-detection in the 2013 MagAO/Clio2 L' data. However, Monte Carlo simulations show that the best fits to the 2012 NaCo and 2013 MagAO/Clio2 followup data may be consistent with noise. There is also a significant probability of false non-detections in both of these data sets. We discuss physical scenarios that could cause the best fits, and argue that previous companion and scattering explanations are inconsistent with the results of the much larger data set presented here.

79 ASTRONOMY AND ASTROPHYSICS↗

Secure mmWave Spectrum Sharing with Autonomous Beam Scheduling for 5G and Beyond

Spectrum Sharing (SS) has seen a renewed set of initiatives in 5G with the availability of shared and unlicensed spectrum bands that can be used by multiple cellular service providers and private cellular networks. Beam based transmission, instead of the traditional sector based transmission in conjunction with the spectrum agility of the 5G New Radio (NR) has brought new opportunities to optimized sharing of spectrum. Currently in the U.S., a centralized Spectrum Access Server (SAS) is used to co-ordinate spectrum sharing among networks sharing the same spectrum band. However, SAS becomes a focal point for security attacks and a performance bottleneck. In addition, SAS relies on an Environmental Sensor Network (ESN), separate from the 5G network. Without trusted spectral occupancy information, false reporting of spectrum sensing data can create sub-optimal and unfair spectrum usage. This paper summarizes our recent research findings in using a decentralized scheme for multiple networks to securely share spectrum with autonomous beam scheduling : 1) A new stochastic network framework based on Lyapunov Optimization approach is developed to optimize scheduling at the base stations; 2) Game theoretic (GT) approach is used to formulate the distributed scheduler; 3) Another distributed scheduler with Q-learning is presented that utilizes the Reinforcement Learning (RL) approach; 4) The performance and convergence rate of these distributed solutions to use shared and unlicensed spectrum are compared with existing solutions. Conditions under which the performance of these schedulers approach the theoretical upper bound, which is the performance possible with no interference among the operators sharing the spectrum, are presented; 5) The ability of a base station to use its own user equipment as sensors, for optimal spectrum sharing with base stations in other operator networks, is demonstrated to be an effective approach.

5G↗