Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sampling algorithm”

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,783 records · Page 99

Census cities experiment in urban change detection

The author has identified the following significant results. Computer compatible tapes for an early ERTS-1 multispectral scanner image over the San Francisco Bay area are being used to classify and analyze land use in this metropolitan region. NASA aircraft underflight data and land use maps from the Census Cities ERTS-1 experiment are providing training samples. The tape record has been reformatted for use with the LARSYSSA pattern recognition and classification algorithms developed at the Purdue University Laboratory for Applications of Remote Sensing. Trial land use classification systems are being compared with color infrared photography and ground truth data for San Jose and vicinity.

Wray, J. R.↗

Computer programs for pressurization (RAMP) and pressurized expulsion from a cryogenic liquid propellant tank

An analysis to predict the pressurant gas requirements for the discharge of cryogenic liquid propellants from storage tanks is presented, along with an algorithm and two computer programs. One program deals with the pressurization (ramp) phase of bringing the propellant tank up to its operating pressure. The method of analysis involves a numerical solution of the temperature and velocity functions for the tank ullage at a discrete set of points in time and space. The input requirements of the program are the initial ullage conditions, the initial temperature and pressure of the pressurant gas, and the time for the expulsion or the ramp. Computations are performed which determine the heat transfer between the ullage gas and the tank wall. Heat transfer to the liquid interface and to the hardware components may be included in the analysis. The program output includes predictions of mass of pressurant required, total energy transfer, and wall and ullage temperatures. The analysis, the algorithm, a complete description of input and output, and the FORTRAN 4 program listings are presented. Sample cases are included to illustrate use of the programs.

Masters, P. A.↗

Time Series Analysis in Flight Flutter Testing at the Air Force Flight Test Center: Concepts and Results

The Air Force Flight Test Center (AFFTC) flight flutter facility is described. Concepts of using a minicomputer-based time series analyzer and a modal analysis software package for flight flutter testing are examined. The results of several evaluations of the software package are given. The reasons for employing a minimum phase concept in analyzing response only signals are discussed. The use of a Laplace algorithm is shown to be effective for the modal analysis of time histories in flutter testing. Sample results from models and flight tests are provided. The limitations inherent in time series analysis methods are discussed, and the need for effective noise reduction techniques is noted. The use of digital time series analysis techniques in flutter testing is shown to be fast, accurate, and cost effective.

Lenz, R. W.↗

Analysis Of Lock Detection In Costas Loops

Report presents analysis of detection of phase lock in Costas loops, used in coherent binary-phase-shift-keying communication systems to track both subcarrier and suppressed carrier signals. Detection of phase lock important part of operation and monitoring of operation of Costas or other tracking loop, provides insight into behavior of loop in real time. Focuses on effects of phase jitter and correlation between samples of phase error in all-digital Costas loop, in which lock detection implemented via algorithm. Applicable to both sinusoidal and square-law carrier signals, incorporates new mathematical models of square-law and absolute-value detectors.

Mileant, Alexander↗

Applications of fuzzy logic to control and decision making

Long range space missions will require high operational efficiency as well as autonomy to enhance the effectivity of performance. Fuzzy logic technology has been shown to be powerful and robust in interpreting imprecise measurements and generating appropriate control decisions for many space operations. Several applications are underway, studying the fuzzy logic approach to solving control and decision making problems. Fuzzy logic algorithms for relative motion and attitude control have been developed and demonstrated for proximity operations. Based on this experience, motion control algorithms that include obstacle avoidance were developed for a Mars Rover prototype for maneuvering during the sample collection process. A concept of an intelligent sensor system that can identify objects and track them continuously and learn from its environment is under development to support traffic management and proximity operations around the Space Station Freedom. For safe and reliable operation of Lunar/Mars based crew quarters, high speed controllers with ability to combine imprecise measurements from several sensors is required. A fuzzy logic approach that uses high speed fuzzy hardware chips is being studied.

Lea, Robert N.↗

A 3-D upwind Euler solver for unstructured meshes

A three-dimensional finite-volume upwind Euler solver is developed for unstructured meshes. The finite-volume scheme solves for solution variables at vertices of the mesh and satisfies the integral conservation law on nonoverlapping polyhedral control volumes surrounding vertices of the mesh. The schene achieves improved solution accuracy by assuming a piecewise linear variation of the solution in each control volume. This improved spatial accuracy hinges heavily upon the calculation of the solution gradient in each control volume given pointwise values of the solution at vertices of the mesh. Several algorithms are discussed for obtaining these gradients. Details concerning implementation procedures and data structures are discussed. Sample calculations for inviscid Euler flow about isolated aircraft wings at subsonic and transonic speeds are compared with established Euler solvers as well as experiment.

Barth, Timothy J.↗

Technical Report Series on Global Modeling and Data Assimilation: Comparison of Satellite Global Rainfall Algorithms - Volume 12

Seventeen months of rainfall data (August 1987-December 1988) from nine satellite rainfall algorithms (Adler, Chang, Kummerow, Prabhakara, Huffman, Spencer, Susskind, and Wu) were analyzed to examine the uncertainty of satellite-derived rainfall estimates. The variability among algorithms, measured as the standard deviation computed from the ensemble of algorithms, shows regions of high algorithm variability tend to coincide with regions of high rain rates. Histograms of pattern correlation (PC) between algorithms suggest a bimodal distribution, with separation at a PC-value of about 0.85. Applying this threshold as a criteria for similarity, our analyses show that algorithms using the same sensor or satellite input tend to be similar, suggesting the dominance of sampling errors in these satellite estimates.

Suarez, Max J.↗

Chirp Scaling Algorithms for SAR Processing

The chirp scaling SAR processing algorithm is both accurate and efficient. Successful implementation requires proper selection of the interval of output samples, which is a function of the chirp interval, signal sampling rate, and signal bandwidth. Analysis indicates that for both airborne and spaceborne SAR applications in the slant range domain a linear chirp scaling is sufficient. To perform nonlinear interpolation process such as to output ground range SAR images, one can use a nonlinear chirp scaling interpolator presented in this paper.

nonlinear chirp scaling.↗

Modifications to Axially Symmetric Simulations Using New DSMC (2007) Algorithms

Several modifications aimed at improving physical accuracy are proposed for solving axially symmetric problems building on the DSMC (2007) algorithms introduced by Bird. Originally developed to solve nonequilibrium, rarefied flows, the DSMC method is now regularly used to solve complex problems over a wide range of Knudsen numbers. These new algorithms include features such as nearest neighbor collisions excluding the previous collision partners, separate collision and sampling cells, automatically adaptive variable time steps, a modified no-time counter procedure for collisions, and discontinuous and event-driven physical processes. Axially symmetric solutions require radial weighting for the simulated molecules since the molecules near the axis represent fewer real molecules than those farther away from the axis due to the difference in volume of the cells. In the present methodology, these radial weighting factors are continuous, linear functions that vary with the radial position of each simulated molecule. It is shown that how one defines the number of tentative collisions greatly influences the mean collision time near the axis. The method by which the grid is treated for axially symmetric problems also plays an important role near the axis, especially for scalar pressure. A new method to treat how the molecules are traced through the grid is proposed to alleviate the decrease in scalar pressure at the axis near the surface. Also, a modification to the duplication buffer is proposed to vary the duplicated molecular velocities while retaining the molecular kinetic energy and axially symmetric nature of the problem.

Liechty, Derek S.↗

A-Train Data Depot - Bringing Atmospheric Measurements Together

This paper describes the satellite data processing and services that constitute current functionalities of the A-Train Data Depot. We first provide a brief introduction to the original geometrical intricacies of the platforms and instruments of the A-Train constellation, and then proceed with description of our ATrain collocation processing algorithm that provides subsets that facilitate synergistic use of the various instruments. Finally, we present some sample image products from our web-based Giovanni tool which allows users to display, compare and download coregistered A-Train related data.

Savtchenko, Andrey↗

High Resolution Observations of Drop Size Distribution for GPM Ground Validation

During the Mid-latitude Convective Cloud Experiment (MC3E), NASA's GPM GV Disdrometer and Radar Observations of Precipitation (DROP) Facility deployed an array of disdrometers and rain gauges in northern Oklahoma to sample, with high resolution, the drop size distribution (DSD) for use in development of precipitation retrieval algorithms for the GPM core satellite. The DROP Facility instruments deployed during MC3E consisted of 16 autonomous Parsivel units, 5 two-dimensional video disdrometers (2DVD), a vertical pointing K-band radar and 32 tipping bucket rain gauges. There were several rainfall events during MC3E in which rain drops exceeding 5 mm in diameter were recorded. During a convective rainfall event one of the 2DVDs measured a large rain drop of 8 mm in diameter falling from a convective cell under which several other disdrometers revealed a broad DSD spectrum across this cell and median drop diameter of 3.1 mm. The NPOL radar, which was scanning over the disdrometer array in high resolution RHI mode (every 40 sec), during a stratiform rainfall event revealed a 1 km thick bright band with locally thicker segments that produced rainfall rates of 6-10 mm/hr and indications of DSD modulations as enhanced concentrations of mid-sized rain drops (1.5-3.0 mm) descended below cloud base. These observations are key in characterizing the DSD variability within the 4 km footprint of the GPM Dual-wavelength Precipitation Radar that will provide a global map of precipitation as well as DSD.

Gatlin, Patrick N.↗

Apparatus and methods for manipulation and optimization of biological systems

The invention provides systems and methods for manipulating, e.g., optimizing and controlling, biological systems, e.g., for eliciting a more desired biological response of biological sample, such as a tissue, organ, and/or a cell. In one aspect, systems and methods of the invention operate by efficiently searching through a large parametric space of stimuli and system parameters to manipulate, control, and optimize the response of biological samples sustained in the system, e.g., a bioreactor. In alternative aspects, systems include a device for sustaining cells or tissue samples, one or more actuators for stimulating the samples via biochemical, electromagnetic, thermal, mechanical, and/or optical stimulation, one or more sensors for measuring a biological response signal of the samples resulting from the stimulation of the sample. In one aspect, the systems and methods of the invention use at least one optimization algorithm to modify the actuator's control inputs for stimulation, responsive to the sensor's output of response signals. The compositions and methods of the invention can be used, e.g., to for systems optimization of any biological manufacturing or experimental system, e.g., bioreactors for proteins, e.g., therapeutic proteins, polypeptides or peptides for vaccines, and the like, small molecules (e.g., antibiotics), polysaccharides, lipids, and the like. Another use of the apparatus and methods includes combination drug therapy, e.g. optimal drug cocktail, directed cell proliferations and differentiations, e.g. in tissue engineering, e.g. neural progenitor cells differentiation, and discovery of key parameters in complex biological systems.

Ho, Chih-Ming↗

Biases in the In Situ Measurement of Particulate Organic Carbon and Its Effect on the Calibration and Validation of Ocean Color Sensors

Particulate organic carbon (POC) plays an oversize role, relative to its standing stock in the global carbon (C) cycle. Accurate measurement of POC is central to understanding the ocean C flux and its sensitivity to climate forcing. POC is a standard NASA ocean color data product, which lacks a consensus, quality-assured measurement protocol for satellite validation. Thus, algorithms based on field measurements lacking verified uncertainties have limited applicability towards climate data records. Different sampling and filtration protocols, and blank corrections, introduce biases in the magnitude of POC measured from the field. A significant filter blank attributable to dissolved organic C (DOC) adsorption that, until recently has been seldom corrected for, likely has introduced biases in POC global datasets.

Chaves, Joaquín E.↗

An Efficient GPU-Accelerated Multi-Source Global Fit Pipeline for LISA Data Analysis

The large-scale analysis task of deciphering gravitational wave signals in the LISA data stream will be difficult, requiring a large amount of computational resources and extensive development of computational methods. Its high dimensionality, multiple model types, and complicated noise profile require a global fit to all parameters and input models simultaneously. In this work, we detail our global fit algorithm, called “Erebor,” designed to accomplish this challenging task. It is capable of analysing current state-of-the-art datasets and then growing into the future as more pieces of the pipeline are completed and added. We describe our pipeline strategy, the algorithmic setup, and the results from our analysis of the LDC2A Sangria dataset, which contains Massive Black Hole Binaries, compact Galactic Binaries, and a parameterized noise spectrum whose parameters are unknown to the user. The Erebor algorithm includes three unique and very useful contributions: GPU acceleration for enhanced computational efficiency; ensemble MCMC sampling with multiple MCMC walkers per temperature for better mixing and parallelized sample creation; and special online updates to reversible-jump (or trans-dimensional) sampling distributions to ensure sampler mixing and accurate initial estimates for detectable sources in the data. We recover posterior distributions for all 15 (6) of the injected MBHBs in the LDC2A training (hidden) dataset. We catalog ∼12000 Galactic Binaries (∼8000 as high confidence detections) for both the training and hidden datasets. All of the sources and their posterior distributions are provided in publicly available catalogs.

LISA global fit↗

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗

Performance Study of an aSi Flat Panel Detector for Fast Neutron Imaging of Nuclear Waste

Radioactive waste must be characterized to check its conformance for intermediate storage and final disposal according to national regulations. For the determination of radio-toxic and chemo-toxic contents of radioactive waste packages non-destructive analytical techniques are preferentially used. Fast neutron imaging is a promising technique to assay large and dense items providing, in complementarity to photon imaging, additional information on the presence of structures in radioactive waste packages. Therefore the feasibility of a compact Neutron Imaging System for Radioactive waste Analysis (NISRA) using 14 MeV neutrons is studied in a cooperation framework of Forschungszentrum Juelich GmbH, RWTH Aachen University and Siemens AG. However due to the low neutron emission of neutron generators in comparison to research reactors the challenging task resides in the development of an imaging detector with a high efficiency, a low sensitivity to gamma radiation and a resolution sufficient for the purpose. The setup is composed of a commercial D-T neutron generator (Genie16GT, Sodern) with a surrounding shielding made of polyethylene, which acts as a collimator and an amorphous silicon flat panel detector (aSi, 40 x 40 cm{sup 2}, XRD-1642, Perkin Elmer). Neutron detection is achieved using a general propose plastic scintillator (EJ-260, Eljen Technology) linked to the detector. The thermal noise of the photodiodes is reduced by employing an entrance window made of aluminium. Optimal gain and integration time for data acquisition are set by measuring the response of the detector to the radiation of a 500 MBq {sup 241}Am-source. Detector performance was studied by recording neutron radiography images of materials with various, but well known, chemical compositions, densities and dimensions (Al, C, Fe, Pb, W, concrete, polyethylene, 5 x 8 x 10 cm{sup 3}). To simulate gamma-ray emitting waste radiographs in presence of a gamma-ray sources ({sup 60}Co, {sup 137}Cs, {sup 241}Am) were performed. A homemade algorithm was developed to determine a value which is related to the neutron absorption of the sample with the analysis of the raw detector data. The detector was placed 42 cm away from the neutron source. Distance between detector and the samples was 0.5 cm. At the sample position the fast neutron flux was estimated to 9x10{sup 3} n cm{sup -2} s{sup -1} for a neutron emission of 10{sup 8} n s{sup -1}. The acquisition time was 15 minutes. First neutron radiographs were successfully recorded despite the low detector efficiency and low neutron emission. Analysis of the data shows a correlation between the measured signal and determined neutron absorption. Thus discrimination between different materials of same thicknesses may be achieved. The measurements and results will be presented and discussed in details.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Unpaired image translation to mitigate domain shift in liquid argon time projection chamber detector responses

Deep learning algorithms often are developed and trained on a training dataset and deployed on test datasets. Any systematic difference between the training and a test dataset may severely degrade the final algorithm performance on the test dataset—what is known as the domain shift problem . This issue is prevalent in many scientific domains where algorithms are trained on simulated data but applied to real-world datasets. Typically, the domain shift problem is solved through various domain adaptation (DA) methods. However, these methods are often tailored for a specific downstream task, such as classification or semantic segmentation, and may not easily generalize to different tasks. This work explores the feasibility of using an alternative way to solve the domain shift problem that is not specific to any downstream algorithm. The proposed approach relies on modern Unpaired Image-to-Image (UI2I) translation techniques, designed to find translations between different image domains in a fully unsupervised fashion. In this study, the approach is applied to a domain shift problem commonly encountered in Liquid Argon Time Projection Chamber (LArTPC) detector research when seeking a way to translate samples between two differently distributed LArTPC detector datasets deterministically. This translation allows for mapping real-world data into the simulated data domain where the downstream algorithms can be run with much less domain-shift-related performance degradation. Conversely, using the translation from the simulated data to a real-world domain can increase the realism of the simulated dataset and reduce the magnitude of any systematic uncertainties. To evaluate the quality of the translations, we use both pixel-wise metrics and a downstream task to measure the effectiveness of UI2I methods for mitigating the domain shift problem. We adapted several popular UI2I translation algorithms to work on scientific data and demonstrated the viability of these techniques for solving the domain shift problem with LArTPC detector data. To facilitate further development of DA techniques for scientific datasets, the ‘Simple Liquid-Argon Track Samples’ dataset used in this study is also published.

97 MATHEMATICS AND COMPUTING↗

Simulating lossy Gaussian boson sampling with matrix-product operators

Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful supercomputers today. However, whether the current approach limited by photon loss and noise in such experiments prescribes a scalable path to quantum advantage is an open question. Here, to understand the effect of photon loss on the scalability of Gaussian boson sampling, we analytically derive the asymptotic operator entanglement entropy scaling, which relates to the simulation complexity. As a result, we observe that efficient tensor network simulations are likely possible under the N out ∝ √N scaling of the number of surviving photons N out in the number of input photons N. We numerically verify this result using a tensor network algorithm with U⁡(1) symmetry, and we overcome previous challenges due to the large local Hilbert-space dimensions in Gaussian boson sampling with hardware acceleration. Additionally, we observe that increasing the photon number through larger squeezing does not increase the entanglement entropy significantly. Finally, we numerically find the bond dimension necessary for fixed accuracy simulations, providing more direct evidence for the complexity of tensor networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗