Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithms.”

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 1,279 records · Page 71

Expectation-maximization algorithm for amplitude estimation of saturated optical transient signals

This paper addresses parameter estimation for an optical transient signal when the received data has been right-censored. We develop an expectation-maximization (EM) algorithm to estimate the amplitude of a Poisson intensity with a known shape in the presence of additive background counts, where the measurements are subject to saturation effects. We then compare the results of our algorithm with those of an EM algorithm that is unaware of the censoring.

47 OTHER INSTRUMENTATION↗

Super-resolution demodulation for fiber sensor arrays based on the MUSIC algorithm

This paper studies the use of MUltiple SIgnal Classification (MUSIC) as a super-resolution algorithm to improve demodulation results for intrinsic Fabry–Perot interferometer (IFPI) sensor arrays. Through distinction between noise and signal subspaces in an observation matrix, this paper shows that a 38-fold improvement in the full width at half maximum (FWHM) estimation of IFPI optical path differences (OPD) can be achieved using this algorithm. Based on this improved method, this paper demonstrates that a tunable laser with a 1.3-nm tuning range can achieve the same sensor demodulation performance as a tunable laser with a 50-nm tuning range if a conventional Fourier transform-based algorithm is used. This paper presents a new approach to analyzing optical signals produced by multiple multiplexed interferometers with similar OPDs with potential applications for both single-mode and multiple-mode devices.

Li, Yuqi (ORCID:0000000291643663)↗

General algorithm for characterization of donor-acceptor pair recombination processes in solid-state materials

Radiative recombination processes can occur in solid-state systems through the pairing of donor and acceptor defects of the lattice. Recently, donor-acceptor pairs (DAP) have been proposed as promising candidates for quantum applications, and their signature has been observed in emerging low-dimensional materials. Therefore, the identification of such processes is gaining interest and requires methods to efficiently and reliably characterize them. Here, we introduce a general algorithm to identify DAP processes starting from the experimental photoluminescence (PL) emission spectrum and basic material parameters, including the lattice structure and dielectric constant. The algorithm recognizes possible DAP transitions from the emission pattern in the spectrum and returns the characteristic energy of the DAP transition and the separation between the donor and acceptor sites. By testing the algorithm on the photoluminescence spectrum of hexagonal boron nitride (hBN), we show that our method is robust against experimental errors and adds new capabilities to the investigation toolbox of semiconductors and their optical properties.

36 MATERIALS SCIENCE↗

Automated Algorithm for J-Tpeak and Tpeak-Tend Assessment of Drug-Induced Proarrhythmia Risk

Prolongation of the heart rate corrected QT (QTc) interval is a sensitive marker of torsade de pointes risk; however it is not specific as QTc prolonging drugs that block inward currents are often not associated with torsade. Recent work demonstrated that separate analysis of the heart rate corrected J-T peak c (J-T peak c) and T peak -T end intervals can identify QTc prolonging drugs with inward current block and is being proposed as a part of a new cardiac safety paradigm for new drugs (the “CiPA” initiative). In this work, we describe an automated measurement methodology for assessment of the J-T peak c and T peak -T end intervals using the vector magnitude lead. The automated measurement methodology was developed using data from one clinical trial and was evaluated using independent data from a second clinical trial. Comparison between the automated and the prior semi-automated measurements shows that the automated algorithm reproduces the semi-automated measurements with a mean difference of single-deltas <1 ms and no difference in intra-time point variability (p for all > 0.39). In addition, the time-profile of the baseline and placebo-adjusted changes are within 1 ms for 63% of the time-points (86% within 2 ms). Importantly, the automated results lead to the same conclusions about the electrophysiological mechanisms of the studied drugs. We have developed an automated algorithm for assessment of J-T peak c and T peak -T end intervals that can be applied in clinical drug trials. Under the CiPA initiative this ECG assessment would determine if there are unexpected ion channel effects in humans compared to preclinical studies. In conclusion, the algorithm is being released as open-source software.

60 APPLIED LIFE SCIENCES↗

QTG-Finder2: A Generalized Machine-Learning Algorithm for Prioritizing QTL Causal Genes in Plants

Linkage mapping has been widely used to identify quantitative trait loci (QTL) in many plants and usually requires a time-consuming and labor-intensive fine mapping process to find the causal gene underlying the QTL. Previously, we described QTG-Finder, a machine-learning algorithm to rationally prioritize candidate causal genes in QTLs. Although it showed good performance, QTG-Finder could only be used in Arabidopsis and rice because of the limited number of known causal genes in other species. Here we tested the feasibility of enabling QTG-Finder to work on species that have few or no known causal genes by using orthologs of known causal genes as training set. The model trained with orthologs could recall about 64% of Arabidopsis and 83% of rice causal genes when the top 20% ranked genes were considered, which is similar to the performance of models trained with known causal genes. The average precision was 0.027 for Arabidopsis and 0.029 for rice. We further extended the algorithm to include polymorphisms in conserved non-coding sequences and gene presence/absence variation as additional features. Using this algorithm, QTG-Finder2, we trained and cross-validated Sorghum bicolor and Setaria viridis models. The S. bicolor model was validated by causal genes curated from the literature and could recall 70% of causal genes when the top 20% ranked genes were considered. Furthermore, we applied the S. viridis model and public transcriptome data to prioritize a plant height QTL and identified 13 candidate genes. QTL-Finder2 can accelerate the discovery of causal genes in any plant species and facilitate agricultural trait improvement.

59 BASIC BIOLOGICAL SCIENCES↗

A Robust Statistical Algorithm for Boundary Detection in Liquid Sprays

This work presents a statistical algorithm to detect phase boundaries in liquid sprays. Experimental data were obtained in a nonevaporating acetone spray at atmospheric conditions to minimize the refractive index gradients and associated beam steering. Mie scattering and diffuse background illumination (DBI) diagnostics are implemented to demonstrate the robustness of the approach. The analysis shows that the present algorithm yields similar results for the two different diagnostics, unlike existing threshold-based methodologies providing inconsistent results. The algorithm can be used to identify partial liquid boundaries between single-phase liquid and vapor boundaries. Thus, for each case, liquid boundaries were defined in terms of liquid probability of 100% or less than 100%. Sprays from two different injectors were analyzed to demonstrate the versatility of the methodology. Finally, a parametric study was conducted to demonstrate that motion blur can affect an accurate detection of the phase boundaries, and hence, the exposure time in the experiment must be sufficiently small.

42 ENGINEERING↗

A Wrapper to Use a Machine-Learning-Based Algorithm for Earthquake Monitoring

Seismology is one of the main sciences used to monitor volcanic activity worldwide. Fast, efficient, and accurate seismicity detectors are crucial to assess the activity level of a volcano in near–real time and to issue timely warnings. Traditional real–time seismic processing software uses phase onset pickers followed by a phase association algorithm to declare an event and estimate its location. The pickers typically do not identify whether the detected phase is a P or S arrival, which can have a negative impact on hypocentral location quality and complicates phase association. We implemented the deep–neural–network–based method PhaseNet to identify in real time P and S seismic waves on data from one– and three–component seismometers. We tuned the Earthworm binder_ew associator module to use the phase identification from PhaseNet to detect and locate the events, which we archive in a SeisComP3 database. We assessed the performance of the algorithm by comparing the results with existing catalogs built to monitor seismic and volcanic activity in Mayotte and the Lesser Antilles region. Our algorithm, which we refer to as PhaseWorm, showed promising results in both contexts and clearly outperformed the previous automatic method implemented in Mayotte. As a result, this innovative real–time processing system is now operational for seismicity monitoring in Mayotte and Martinique.

58 GEOSCIENCES↗

A Linac Simulation Code for Macro-particles Tracking and Steering Algorithm Implementation

n this paper, a linac simulation code written in Fortran90 is presented and several simu lation examples are given. This code is optimized to implement linac alignment and steering algorithms, and evaluate the accelerator errors such as RF phase and acceleration gradient, quadrupole and BPM misalignment. It can track a single particle or a bunch of particles through normal linear accelerator elements such as quadrupole, RF cavity, dipole corrector and drift space. One-to-one steering algorithm and a global alignment (steering) algorithm are implemented in this code.

Accelerators↗

Polar Format Algorithm: Survey of Assumptions and Approximations

Since the Polar Format Algorithm (PFA) was first introduced by Jack Walker 30 years ago, digital processing and Moore’s law have provided the means by which to process an increasing amount of data, at finer resolutions, over a larger area, and in real-time. Inherent in the polar format algorithm are assumptions that limit the focused scene size. This report presents a development of PFA for a linear frequency modulated chirp pulsed radar utilizing stretch processing to illustrate how PFA approximations are used to form an image. Also techniques to mitigate the errors resulting from the approximations are presented from a survey of literature sources. There are many techniques that are successful at increasing the focused scene size, these include image corrections made after image formation, subaperture processing, and careful selection of processing coordinates. This report only considers methods that use the polar format algorithm.

97 MATHEMATICS AND COMPUTING↗

Benchmark Imagery for Assessing Geospatial Semantic Content Extraction Algorithms -- Annual Report for FY2012

The primary objective of this project is to create a set of benchmark imagery for validating algorithms designed to extract semantic content from geospatial images of industrial facilities. The goal is not to develop algorithms but to provide images that can be used to do so. The secondary objective is to demonstrate how this imagery could be used for algorithm validation. The project is a collaborative effort between Los Alamos National Laboratory (LANL) and the Lawrence Livermore National Laboratory (LLNL).

42 ENGINEERING↗

MREG V1.1 : a multi-scale image registration algorithm for SAR applications.

MREG V1.1 is the sixth generation SAR image registration algorithm developed by the Signal Processing&Technology Department for Synthetic Aperture Radar applications. Like its predecessor algorithm REGI, it employs a powerful iterative multi-scale paradigm to achieve the competing goals of sub-pixel registration accuracy and the ability to handle large initial offsets. Since it is not model based, it allows for high fidelity tracking of spatially varying terrain-induced misregistration. Since it does not rely on image domain phase, it is equally adept at coherent and noncoherent image registration. This document provides a brief history of the registration processors developed by Dept. 5962 leading up to MREG V1.1, a full description of the signal processing steps involved in the algorithm, and a user's manual with application specific recommendations for CCD, TwoColor MultiView, and SAR stereoscopy.

Eichel, Paul H.↗

Preliminary ILAW Formulation Algorithm Description (Rev. 1)

The U.S. Department of Energy (DOE), Office of River Protection (ORP), has contracted with Bechtel National, Inc. (BNI) to design, construct, and commission the Hanford Tank Waste Treatment and Immobilization Plant (WTP) at the Hanford Site (DOE 2000). This plant is designed to operate for 40 years and treat roughly 50 million gallons of mixed hazardous high-level waste (HLW) stored in 177 underground tanks at the Hanford Site. The process involves separating the high-level and low-activity waste (LAW) fractions through filtration, leaching, Cs ion exchange, and precipitation. Each fraction will be separately vitrified into borosilicate waste glass. This report documents the initial algorithm for use by Hanford WTP in batching LAW and glass-forming chemicals (GFCs) in the LAW melter feed preparation vessel (MFPV). Algorithm inputs include the chemical analyses of the pretreated LAW in the concentrate receipt vessel (CRV), the volume of the MFPV heel, and the compositions of individual GFCs. In addition to these inputs, uncertainties in the LAW composition and processing parameters are included in the algorithm.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Efficient Algorithm for Locating and Sizing Series Compensation Devices in Large Transmission Grids: Solutions and Applications (PART II)

In a companion manuscript, we developed a novel optimization method for placement, sizing, and operation of Flexible Alternating Current Transmission System (FACTS) devices to relieve transmission network congestion. Specifically, we addressed FACTS that provide Series Compensation (SC) via modification of line inductance. In this manuscript, this heuristic algorithm and its solutions are explored on a number of test cases: a 30-bus test network and a realistically-sized model of the Polish grid (~2700 nodes and ~3300 lines). The results on the 30-bus network are used to study the general properties of the solutions including non-locality and sparsity. The Polish grid is used as a demonstration of the computational efficiency of the heuristics that leverages sequential linearization of power flow constraints and cutting plane methods that take advantage of the sparse nature of the SC placement solutions. Using these approaches, the algorithm is able to solve an instance of Polish grid in tens of seconds. We explore the utility of the algorithm by analyzing transmission networks congested by (a) uniform load growth, (b) multiple overloaded configurations, and (c) sequential generator retirements

25 ENERGY STORAGE↗

Algorithms Performance Investigation of a Generalized Spreader-Bar Detection System

A “generic” gantry-crane-mounted spreader bar detector has been simulated in the Monte-Carlo radiation transport code MCNP [1]. This model is intended to represent the largest realistically feasible number of detector crystals in a single gantry-crane model intended to sit atop an InterModal Cargo Container (IMCC). Detectors were chosen from among large commonly-available sodium iodide (NaI) crystal scintillators and spaced as evenly as is thought possible with a detector apparatus attached to a gantry crane. Several scenarios were simulated with this model, based on a single IMCC being moved between a ship’s deck or cargo hold and the dock. During measurement, the gantry crane will carry that IMCC through the air and lower it onto a receiving vehicle (e.g. a chassis or a bomb cart). The case of an IMCC being moved through the air from an unknown radiological environment to the ground is somewhat complex; for this initial study a single location was picked at which to simulate background. An HEU source based on earlier validated models was used, and placed at varying depths in a wood cargo. Many statistical realizations of these scenarios are constructed from simulations of the component spectra, simulated to have high statistics. The resultant data are analyzed with several different algorithms. The simulated data were evaluated by each algorithm, with a threshold set to a statistical-only false alarm probability of 0.001 and the resultant Minimum Detectable Amounts were generated for each Cargo depth possible within the IMCC. Using GADRAS as an anomaly detector provided the greatest detection sensitivity, and it is expected that an algorithm similar to this will be of great use to the detection of highly shielded sources.

97 MATHEMATICS AND COMPUTING↗

Modeling and Algorithmic Approaches to Constitutively-Complex, Micro-structured Fluids

The team for this Project made significant progress on modeling and algorithmic approaches to hydrodynamics of fluids with complex microstructure. Our advances are broken down into modeling and algorithmic approaches. In experiments a driven magnetic bead in a complex fluid accelerates out of the Stokes regime and settles into another apparent linear response regime. The modeling explains the take-off as a deformation of entanglements, and the longtime behavior is a nonlinear, far-from-equilibrium property. Furthermore, the model has predictive value, as we can tune microstructural properties relative to the magnetic force applied to the bead to exhibit all possible behaviors. Wave-theoretic probes of complex fluids have been extended in two significant directions, to small volumes and the nonlinear regime. Heterogeneous stress and strain features that lie beyond experimental capability were studied. It was shown that nonlinear penetration of boundary stress in confined viscoelastic fluids is not monotone, indicating the possibility of interlacing layers of linear and nonlinear behavior, and thus layers of variable viscosity. Models, algorithms, and codes were developed and simulations performed leading to phase diagrams of nanorod dispersion hydrodynamics in parallel shear cells and confined cavities representative of film and membrane processing conditions. Hydrodynamic codes for polymeric fluids are extended to include coupling between microscopic and macroscopic models, and to the strongly nonlinear regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Combinatorial Algorithms to Enable Computational Science and Engineering: Work from the CSCAPES Institute

This final progress report summarizes the work accomplished at the Combinatorial Scientific Computing and Petascale Simulations Institute. We developed Zoltan, a parallel mesh partitioning library that made use of accurate hypergraph models to provide load balancing in mesh-based computations. We developed several graph coloring algorithms for computing Jacobian and Hessian matrices and organized them into a software package called ColPack. We developed parallel algorithms for graph coloring and graph matching problems, and also designed multi-scale graph algorithms. Three PhD students graduated, six more are continuing their PhD studies, and four postdoctoral scholars were advised. Six of these students and Fellows have joined DOE Labs (Sandia, Berkeley), as staff scientists or as postdoctoral scientists. We also organized the SIAM Workshop on Combinatorial Scientific Computing (CSC) in 2007, 2009, and 2011 to continue to foster the CSC community.

97 MATHEMATICS AND COMPUTING↗

Next Generation Suspension Dynamics Algorithms

This research project has the objective to extend the range of application, improve the efficiency and conduct simulations with the Fast Lubrication Dynamics (FLD) algorithm for concentrated particle suspensions in a Newtonian fluid solvent. The research involves a combination of mathematical development, new computational algorithms, and application to processing flows of relevance in materials processing. The mathematical developments clarify the underlying theory, facilitate verification against classic monographs in the field and provide the framework for a novel parallel implementation optimized for an OpenMP shared memory environment. The project considered application to consolidation flows of major interest in high throughput materials processing and identified hitherto unforeseen challenges in the use of FLD in these applications. Extensions to the algorithm have been developed to improve its accuracy in these applications.

97 MATHEMATICS AND COMPUTING↗

Large scale tracking algorithms

Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.

97 MATHEMATICS AND COMPUTING↗