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 343 records · Page 19

Contribution of National near Real Time MODIS Forest Maximum Percentage NDVI Change Products to the U.S. ForWarn System

This presentation reviews the development, integration, and testing of Near Real Time (NRT) MODIS forest % maximum NDVI change products resident to the USDA Forest Service (USFS) ForWarn System. ForWarn is an Early Warning System (EWS) tool for detection and tracking of regionally evident forest change, which includes the U.S. Forest Change Assessment Viewer (FCAV) (a publically available on-line geospatial data viewer for visualizing and assessing the context of this apparent forest change). NASA Stennis Space Center (SSC) is working collaboratively with the USFS, ORNL, and USGS to contribute MODIS forest change products to ForWarn. These change products compare current NDVI derived from expedited eMODIS data, to historical NDVI products derived from MODIS MOD13 data. A new suite of forest change products are computed every 8 days and posted to the ForWarn system; this includes three different forest change products computed using three different historical baselines: 1) previous year; 2) previous three years; and 3) all previous years in the MODIS record going back to 2000. The change product inputs are maximum value NDVI that are composited across a 24 day interval and refreshed every 8 days so that resulting images for the conterminous U.S. are predominantly cloud-free yet still retain temporally relevant fresh information on changes in forest canopy greenness. These forest change products are computed at the native nominal resolution of the input reflectance bands at 231.66 meters, which equates to approx 5.4 hectares or 13.3 acres per pixel. The Time Series Product Tool, a MATLAB-based software package developed at NASA SSC, is used to temporally process, fuse, reduce noise, interpolate data voids, and re-aggregate the historical NDVI into 24 day composites, and then custom MATLAB scripts are used to temporally process the eMODIS NDVIs so that they are in synch with the historical NDVI products. Prior to posting, an in-house snow mask classification product is computed for the current compositing period and integrated into the change images to account for snow related NDVI drops. The supplemental snow classification product was needed because other available QA cloud/snow mask typically underestimates snow cover. MODIS true and false color composites were also computed from eMODIS reflectance data and the true color RGBs are also posted on ForWarn?s FCAV; this data is used for assessing apparent occasional quality issues on the change products due to residual unmasked cloud cover. New forest change products are posted with typical latencies of 1-2 days after the last input eMODIS data collection date for a given 24 day compositing period.

Spruce, Joseph P.↗

Studies of recognition with multitemporal remote sensor data

Characteristics of multitemporal data and their use in recognition processing were investigated. Principal emphasis was on satellite data collected by the LANDSAT multispectral scanner and on temporal changes throughout a growing season. The effects of spatial misregistration on recognition performance with multitemporal data were examined. A capability to compute probabilities of detection and false alarm was developed and used with simulated distributions for misregistered pixels. Wheat detection was found to be degraded and false alarms increased by misregistration effects. Multitemporal signature characteristics and multitemporal recognition processing were studied to gain insights into problems associated with this approach and possible improvements. Recognition performance with one multitemporal data set displayed marked improvements over results from single-time data.

Malila, W. A.↗

Adaptive error detection for HDR/PDR brachytherapy: Guidance for decision making during real-time in vivo point dosimetry

Purpose: This study presents an adaptive error detection algorithm (AEDA) for real-timein vivo point dosimetry during high dose rate (HDR) or pulsed dose rate (PDR) brachytherapy (BT) where the error identification, in contrast to existing approaches, does not depend on an a priori reconstruction of the dosimeter position. Instead, the treatment is judged based on dose rate comparisons between measurements and calculations of the most viable dosimeter position provided by the AEDA in a data driven approach. As a result, the AEDA compensates for false error cases related to systematic effects of the dosimeter position reconstruction. Given its nearly exclusive dependence on stable dosimeter positioning, the AEDA allows for a substantially simplified and time efficient real-time in vivo BT dosimetry implementation. Methods: In the event of a measured potential treatment error, the AEDA proposes the most viable dosimeter position out of alternatives to the original reconstruction by means of a data driven matching procedure between dose rate distributions. If measured dose rates do not differ significantly from the most viable alternative, the initial error indication may be attributed to a mispositioned or misreconstructed dosimeter (false error). However, if the error declaration persists, no viable dosimeter position can be found to explain the error, hence the discrepancy is more likely to originate from a misplaced or misreconstructed source applicator or from erroneously connected source guide tubes (true error). Results: The AEDA applied on twoin vivo dosimetry implementations for pulsed dose rate BT demonstrated that the AEDA correctly described effects responsible for initial error indications. The AEDA was able to correctly identify the major part of all permutations of simulated guide tube swap errors and simulated shifts of individual needles from the original reconstruction. Unidentified errors corresponded to scenarios where the dosimeter position was sufficiently symmetric with respect to error and no-error source position constellations. The AEDA was able to correctly identify all false errors represented by mispositioned dosimeters contrary to an error detection algorithm relying on the original reconstruction. Conclusions: The study demonstrates that the AEDA error identification during HDR/PDR BT relies on a stable dosimeter position rather than on an accurate dosimeter reconstruction, and the AEDA’s capacity to distinguish between true and false error scenarios. The study further shows that the AEDA can offer guidance in decision making in the event of potential errors detected with real-timein vivo point dosimetry.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Inter-Domain Fusion for Enhanced Intrusion Detection in Power Systems: An Evidence Theoretic and Meta-Heuristic Approach

False alerts due to misconfigured or compromised intrusion detection systems (IDS) in industrial control system (ICS) networks can lead to severe economic and operational damage. However, research using deep learning to reduce false alerts often requires the physical and cyber sensor data to be trustworthy. Implicit trust is a major problem for artificial intelligence or machine learning (AI/ML) in cyber-physical system (CPS) security, because when these solutions are most urgently needed is also when they are most at risk (e.g., during an attack). To address this, the Inter-Domain Evidence theoretic Approach for Inference (IDEA-I) is proposed that reframes the detection problem as how to make good decisions given uncertainty. Specifically, an evidence theoretic approach leveraging Dempster–Shafer (DS) combination rules and their variants is proposed for reducing false alerts. A multi-hypothesis mass function model is designed that leverages probability scores obtained from supervised-learning classifiers. Using this model, a location-cum-domain-based fusion framework is proposed to evaluate the detector’s performance using disjunctive, conjunctive, and cautious conjunctive rules. The approach is demonstrated in a cyber-physical power system testbed, and the classifiers are trained with datasets from Man-In-The-Middle attack emulation in a large-scale synthetic electric grid. For evaluating the performance, we consider plausibility, belief, pignistic, and general Bayesian theorem-based metrics as decision functions. To improve the performance, a multi-objective-based genetic algorithm is proposed for feature selection considering the decision metrics as the fitness function. Finally, we present a software application to evaluate the DS fusion approaches with different parameters and architectures.

42 ENGINEERING↗

Tactical Conflict Detection in Terminal Airspace

Air traffic systems have long relied on automated short-term conflict prediction algorithms to warn controllers of impending conflicts (losses of separation). The complexity of terminal airspace has proven difficult for such systems as it often leads to excessive false alerts. Thus, the legacy system, called Conflict Alert, which provides short-term alerts in both en-route and terminal airspace currently, is often inhibited or degraded in areas where frequent false alerts occur, even though the alerts are provided only when an aircraft is in dangerous proximity of other aircraft. This research investigates how a minimal level of flight intent information may be used to improve short-term conflict detection in terminal airspace such that it can be used by the controller to maintain legal aircraft separation. The flight intent information includes a site-specific nominal arrival route and inferred altitude clearances in addition to the flight plan that includes the RNAV (Area Navigation) departure route. A new tactical conflict detection algorithm is proposed, which uses a single analytic trajectory, determined by the flight intent and the current state information of the aircraft, and includes a complex set of current, dynamic separation standards for terminal airspace to define losses of separation. The new algorithm is compared with an algorithm that imitates a known en-route algorithm and another that imitates Conflict Alert by analysis of false-alert rate and alert lead time with recent real-world data of arrival and departure operations and a large set of operational error cases from Dallas/Fort Worth TRACON (Terminal Radar Approach Control). The new algorithm yielded a false-alert rate of two per hour and an average alert lead time of 38 seconds.

Tang, Huabin↗

MINIMUM REQUIREMENTS FOR DETECTING A STOCHASTIC GRAVITATIONAL WAVE BACKGROUND USING PULSARS

We assess the detectability of a nanohertz gravitational wave (GW) background in a pulsar timing array (PTA) program by considering the shape and amplitude of the cross-correlation function summed over pulsar pairs. The distribution of correlation amplitudes is found to be non-Gaussian and highly skewed, which significantly influences detection and false-alarm probabilities. When only white noise combines with GWs in timing data, our detection results are consistent with those found by others. Contamination by red noise from spin variations and from any uncorrected interstellar plasma effects significantly increases the false-alarm probability. The number of arrival times (and thus the observing cadence) is important only as long as the residuals are dominated by white noise. When red noise and GWs dominate, the statistical significance of the correlation estimate can be improved only by increasing the number of pulsars. We characterize plausible detection regimes by evaluating the number of millisecond pulsars (MSPs) that must be monitored in a high-cadence, five-year timing program to detect a GW background spectrum h{sub c} (f) = A(f/f{sub 0}){sup -2/3} with f{sub 0} = 1 yr{sup -1} and A = 10{sup -15}. Our results indicate that a sample of 20 super-stable MSPs-those with rms timing residuals {sigma}{sub r} {approx}< 20 ns(A/10{sup -15}) from red-noise contributions over a five-year span-will allow detection of the GW background and study of its spectrum. However, a timing program on {approx}> 50-100 MSPs is likely needed for a complete PTA program, particularly if red noise is generally present in MSPs.

79 ASTRONOMY AND ASTROPHYSICS↗

Adaptive Impact-Driven Detection of Silent Data Corruption for HPC Applications

For exascale HPC applications, silent data corruption (SDC) is one of the most dangerous problems because there is no indication that there are errors during the execution. We propose an adaptive impact-driven method that can detect SDCs dynamically. The key contributions are threefold. (1) We carefully characterize 18 real-world HPC applications and discuss the runtime data features, as well as the impact of the SDCs on their execution results. (2) We propose an impact-driven detection model that does not blindly improve the prediction accuracy, but instead detects only influential SDCs to guarantee user-acceptable execution results. (3) Our solution can adapt to dynamic prediction errors based on local runtime data and can automatically tune detection ranges for guaranteeing low false alarms. Experiments show that our detector can detect 80-99.99% of SDCs with a false alarm rate less that 1% of iterations for most cases. The memory cost and detection overhead are reduced to 15% and 6.3%, respectively, for a large majority of applications.

Exascale HPC↗

Automated Technique for the Detection of Step-Like Solar Wind Dynamic Pressure Changes: Application to the Response of the Transpolar Potential to Solar Wind Dynamic Pressure Fronts

The input from the solar wind (SW) and the accompanying Interplanetary Magnetic Field (IMF) is the defining feature of the solar wind-magnetosphere interactions. One of the most important SW drivers is the solar wind dynamic pressure, and most significantly its sharp changes known as pressure fronts. Sudden enhancements in solar wind dynamic pressure, SWP, have been shown to lead to intensification of the auroral electrojets (and Region 1 field-aligned currents), increase in auroral emissions, and significant enhancement in ionospheric convection and the transpolar potential. Case studies of the interaction between pressure fronts and the terrestrial space environment shed great light on their importance to the structure and dynamics of the system. However, thorough understanding of the interaction requires fully statistical investigations. These statistical studies require a large number of suitable pressure front events. In the past these have been obtained through laborious manual inspection of solar wind data. We present an automated procedure that identifies sudden step enhancements in SWP that satisfy a desired set of limiting step-like characteristics, such as magnitude of the change, sign of the change (positive/negative), and rate of change. The procedure yields a list of suitable events, along with their step features within minutes. The technique is tested for missed events and false positives by direct comparison to manual inspection of the data. Its utility is illustrated by application to the statistical effect of pressure fronts to the transpolar potential as measured by the Assimilative Mapping of Ionospheric Electrodynamics (AMIE) technique.

A. Boudouridis↗

Obstacle detection by rapid estimation scheme with data scaling

A data scaling technique is proposed to improve the performance of a rapid estimation scheme for analyzing rover rangefinder data in the specific area of obstacle outline characterization. The scaling transformation involves multiplying the measured beam length times a scale factor and taking the logarithm in a certain base. Although analysis shows that introducing the scaling transformation has no primary effect on the detection ability and that there is no apparent signal-to-noise ratio improvement, computer simulations show a reduction in the number of false jumps. In the 40-m range the use of data scaling cleared the foreground of obstacles of noise and obtained definition of the near edge of a crater.

Marynowski, R. C.↗

Global Geochemical Variation on the Lunar Surface: A Three-Element Approach

We present a method for displaying the relative abundances of three important elements (Th, Fe, and Ti) on the same map projection of the lunar surface. Using Th-, Fe-, and Ti-elemental abundances from orbital geochemical data and assigning each element a primary color, a false-color map of the lunar surface was created. This approach is similar to the ternary diagram approach presented by Davis and Spudis with some important differences, discussed later. For the present maps, Th abundances were measured by the Lunar Prospector (LP) Gamma-Ray Spectrometer(GRS).The new LPGRS low-altitude dataset was used in this analysis. Iron and Ti weight percentages were based on Clementine spectral reflectance data smoothed to the LP low altitude footprint. This method of presentation was designed to aid in the location and recognition of three principal lunar compositions: ferroan anorthosite (FAN), mare basalts (MB), and the Mg suite/ KREEP-rich rocks on the lunar surface, with special emphasis on the highlands and specific impact basins. In addition to the recognition of these endmember rock compositions, this method is an attempt to examine the relationship between elemental compositions that do not conform readily to previously accepted or observed endmember rocks in various specific regions of interest, including eastern highlands regions centered on 150 deg longitude, and a northern highlands Th-rich region observed. The LP low-altitude data has full width at half-maximum spatial resolution of about 40 km. The Clementine spectral reflectance datasets were adapted using an equal-area, gaussian smoothing routine to this footprint. In addition, these datasets, reported in weight percent of FeO and of Ti02, were adjusted to Fe and Ti weight percentages. Each dataset was then assigned one of the three primary colors: blue for Th, red for Fe, and green for Ti. For each element, the data range was normalized to represent the ratio of each point to the maximum in the dataset. (To view the color table, go to http://cass.jsc.nasa.gov/meetings/moon99/pdf/8033.pdf.) The full range of lunar longitudes is represented, but due to the lack of coverage of the Clementine data for latitudes > 70 deg and <-70 deg, the data for these regions is excluded. The differences between this approach and the ternary diagram approach of Davis and Spudis eliminate some of the uncertainty and ambiguity of the ternary diagram approach. Rather than using a ratio of Th to Ti normalized to CI chondritic ratios, and a ternary diagram with ternary apexes located at specific endmember compositional values, elemental compositions were used independently, eliminating the errors resulting from dividing numbers that can have high uncertainties, especially at low concentration. The three elements used in this method of presentation were chosen for several reasons. One reason for the inclusion of Th in this study is that it is an accurate indicator of KREEP. Iron and Ti concentrations are both low in highland regolith, causing any small fluctuations in Th to stand out very well. In addition, Fe and Ti are good compositional indicators of different mare basalts. Mixed with red for Fe, the green for Ti produces a yellow signal in high-Ti basalts. While universally high in Fe relative to the surrounding highlands, mare basalts have a diverse range of Ti values, making Ti concentration a valuable asset to the classification and identification of different basalt types. Finally, an important constraint in element selection is the availability of the global data, both from LP and Clementine results. Data for Th, Fe, and Ti are among the highest quality of existing lunar remote-sensing data. In addition, LP data for Fe and Ti will become available, enabling these data to be incorporated into the analysis. Using upper-limit values for end member rock compositions calculated from Korotev et al., attempts were made to locate the different endmember compositions of terranes on this diagram. Most strikingly, ferroan anorthosite (Th < and = 0.37 micro g/g; Fe (wt%)< and =2.29; Ti (wt%) < and = 0.22), which should appear as an almost black, reddish color, does not appear on the diagram at any noticeable frequency. Based on this analysis, the suggestion of extensive FAN regions on the lunar surface is not strong, especially at the presently accepted values for Fe and Th. However, to make sure this effect is not due to systematic errors, a thorough investigation of the precision, accuracy, and uncertainties of the Fe, Ti, and Th abundances needs to be carried out, especially at low concentrations. A particular region of interest is an area of high Th concentrations relative to Fe and Ti content north and east of Humboldtianum Crater. First observed by Lawrence et al., this region does not coincide with any visible impact structure and comprises one of the closest approximations to pure blue (high Th, very low Ti and Fe) on the lunar surface. Such an elemental composition does not lend itself readily to classification, and presents something of an anomaly. More detailed analysis of this region is needed to understand its structure and origin. There seems to be a longitudinal asymmetry in the Th concentrations of the highlands regolith. High-Th, low-Ti, and Fe regions are located between 135 deg and 180 deg longitude and between -30 deg and +30 deg latitude. While the Th levels are not high enough to attract attention in a single elemental display, the variation in the abundance of Th relative to Fe and Ti abundances can be clearly seen. The composition that these data suggest is not well represented in the sample return suite. In addition, these regions were largely missed by the Apollo orbital ground tracks, which only covered the outer edge of the areas of interest. The LP orbital Th data represent the first information about the Th concentrations in these regions of the highlands. Additional information contained in original.

Thomsen, D. R.↗

Verification of the Effectiveness of X-ray Machine Collimation

The Oak Ridge National Laboratory (ORNL) was tasked by the United States National Nuclear Security Administration’s Second Line of Defense (SLD) program with reducing the false alarm rate experienced by radiation portal monitors (RPM) installed near x-ray machines. Although the mechanism for interference between RPMs and x-ray machines is well understood, x-ray machines are often installed too near RPMs due to a variety of facility constraints. The result is underutilized RPMs that are plagued by a high false alarm rate from x-rays that escape the x-ray machine and are detected by the RPM. In this work, the effectiveness of an x-ray machine collimation system designed at ORNL is validated through the analysis of field data collected before and after the installation. The significant reduction in false alarm rate due to the collimation system is explicitly shown, and examples of field installations are provided. Utilization of the results presented here allows RPM systems to operate effectively even when installed near x-ray machines.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Using support vector machines for anomalous change detonation

We cast anomalous change detection as a binary classification problem, and use a support vector machine (SVM) to build a detector that does not depend on assumptions about the underlying data distribution. To speed up the computation, our SVM is implemented, in part, on a graphical processing unit. Results on real and simulated anomalous changes are used to compare performance to algorithms which effectively assume a Gaussian distribution. In this paper, we investigate the use of support vector machines (SVMs) with radial basis kernels for finding anomalous changes. Compared to typical applications of SVMs, we are operating in a regime of very low false alarm rate. This means that even for relatively large training sets, the data are quite meager in the regime of operational interest. This drives us to use larger training sets, which in turn places more of a computational burden on the SVM. We initially considered three different approaches to to address the need to work in the very low false alarm rate regime. The first is a standard SVM which is trained at one threshold (where more reliable estimates of false alarm rates are possible) and then re-thresholded for the low false alarm rate regime. The second uses the same thresholding approach, but employs a so-called least squares SVM; here a quadratic (instead of a hinge-based) loss function is employed, and for this model, there are good theoretical arguments in favor of adjusting the threshold in a straightforward manner. The third approach employs a weighted support vector machine, where the weights for the two types of errors (false alarm and missed detection) are automatically adjusted to achieve the desired false alarm rate. We have found in previous experiments (not shown here) that the first two types can in some cases work well, while in other cases they do not. This renders both approaches unreliable for automated change detection. By contrast, the third approach reliably produces good results, but at the cost of larger computational requirements caused by the need to estimate very small false alarm rates. To address these computational requirements, we employ a recently developed in-house solver for SVMs that is significantly faster than freely available standard solvers. But these computational issues are secondary to the larger question: do kernelized solutions provide better performance, in terms of detection rates and false alarm rates, than more traditional methods for change detection that effectively assume Gaussian data distributions? To this end, we will compare ROC curves obtained from the SVM with those from chronochrome, covariance equalization, and hyperbolic anomalous change detection.

97 MATHEMATICS AND COMPUTING↗

A bi-level data-driven framework for fault-detection and diagnosis of HVAC systems

Long-term operation of heating, ventilation, and air conditioning (HVAC) systems will eventually lead to a range of HVAC system failures, resulting in excessive energy consumption and maintenance costs. Here, to avoid HVAC malfunctioning, fault detection diagnostic (FDD) is utilized as a common practice. Machine learning methods have lately received considerable interest for FDD analysis of HVAC systems due to their high detection accuracy. Meanwhile, HVAC malfunctions are regarded as rare occurrences, hence normal operating data samples are much more accessible than data samples in faulty and malfunctioning conditions. The dominating frequency of normal operation in HVAC datasets has also led to heavily biased classification algorithms within the literature. Moreover, the focus of previous literature has been on increasing the accuracy of the models which leads to a high number of false positives (misleading alarms) in the system. In order to enhance the performance of diagnostic procedures and fill the mentioned gaps, this study proposes a novel data-driven framework. A bi-level machine learning framework is developed for diagnosing faults in air handling units (AHUs) and rooftop units (RTUs) based on principal component analysis (PCA), time series anomaly detection, and random forest (RF). It is shown that PCA can reduce the dataset dimension with one principal component accounting for 95% of data variance. Also, the random forest could classify the faults with 89% precision for single-zone AHU, 85% precision for RTU, and 79% for multi-zone AHU. By proposing this framework, three persistent challenges are addressed: (I) minimizing false positives; (II) accounting for data imbalance; and (III) normal condition monitoring of equipment.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Kepler Certified False Positive Table

This document describes the Kepler Certied False Positive table hosted at the Exoplanet Archive1, herein referred to as the CFP table. This table is the result of detailed examination by the Kepler False Positive Working Group (FPWG) of declared false positives in the Kepler Object of Interest (KOI) tables (see, for example, Batalha et al. (2012); Burke et al.(2014); Rowe et al. (2015); Mullally et al. (2015); Coughlin et al. (2015b)) at the Exoplanet Archive. A KOI is considered a false positive if it is not due to a planet orbiting the KOI's target star. The CFP table contains all KOIs in the Exoplanet Archive cumulative KOI table. The purpose of the CFP table is to provide a list of certified false positive KOIs. A KOI is certified as a false positive when, in the judgement of the FPWG, there is no plausible planetary interpretation of the observational evidence, which we summarize by saying that the evidence for a false positive is compelling. This certification process involves detailed examination using all available data for each KOI, establishing a high-reliability ground truth set. The CFP table can be used to estimate the reliability of, for example, the KOI tables which are created using only Kepler photometric data, so the disposition of individual KOIs may differ in the KOI and CFP tables. Follow-up observers may find the CFP table useful to avoid observing false positives.

Kepler↗

Sensory redundancy management: The development of a design methodology for determining threshold values through a statistical analysis of sensor output data

Sensor redundancy management (SRM) requires a system which will detect failures and reconstruct avionics accordingly. A probability density function to determine false alarm rates, using an algorithmic approach was generated. Microcomputer software was developed which will print out tables of values for the cummulative probability of being in the domain of failure; system reliability; and false alarm probability, given a signal is in the domain of failure. The microcomputer software was applied to the sensor output data for various AFT1 F-16 flights and sensor parameters. Practical recommendations for further research were made.

Scalzo, F.↗

GOTTCHA Database, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions.In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure.During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably.During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.The DATABASE provided is the result of the algorithm described.

Freitas, Tracey↗

GOTTCHA Database, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions.In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure.During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably.During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.The DATABASE provided is the result of the algorithm described.

Freitas, Tracey↗

Change Detection in Constellations of Buried Objects Extracted From Ground-Penetrating Radar Data

Detection of deliberately buried objects in ground-penetrating radar (GPR) data acquired along a path is a clutter-limited problem. Detection-false alarm rate performance can be improved by replacing the detection statistic with a change statistic that incorporates information from previous path traversals. A constellation matching approach is developed for buried-object change detection in GPR data. Network topologies of buried objects detected in GPR data from previous path traversals are maintained in a constellation database. Localized groups of buried objects newly detected on the latest path traversal are matched to the constellation. Buried objects from the latest path traversal whose locations or strengths cannot be reconciled with the constellation are identified as changes. The system has one component that generates constellation databases offline and another component suitable for change detection in real time. It can tolerate paths with significant translational misalignments. The system uses the following: 1) a customized translational relaxation algorithm for point pattern matching that incorporates detection strength and a probabilistic uncertainty model for buried-object location into the objective function and 2) a change statistic that accounts for the magnitude of change relative to predicted detection strength. A constellation database can typically be generated offline from a single path traversal roughly two orders of magnitude faster than the time typically required for a vehicle to travel the extent of the path. Database sizes are typically four to five orders of magnitude smaller than the data sets of GPR signal scans or focused 3-D GPR images that they were generated from. On bumpy dirt roads buried exclusively with nonmetallic objects at various depths, detection-false alarm rate performance is shown to be significantly better for our change statistics than for our detection statistics.

47 OTHER INSTRUMENTATION↗