Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic development”

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 595 records · Page 33

White-light Interferometry using a Channeled Spectrum: II. Calibration Methods, Numerical and Experimental Results

In the companion paper, [Appl. Opt. 46, 5853 (2007)] a highly accurate white light interference model was developed from just a few key parameters characterized in terms of various moments of the source and instrument transmission function. We develop and implement the end-to-end process of calibrating these moment parameters together with the differential dispersion of the instrument and applying them to the algorithms developed in the companion paper. The calibration procedure developed herein is based on first obtaining the standard monochromatic parameters at the pixel level: wavenumber, phase, intensity, and visibility parameters via a nonlinear least-squares procedure that exploits the structure of the model. The pixel level parameters are then combined to obtain the required 'global' moment and dispersion parameters. The process is applied to both simulated scenarios of astrometric observations and to data from the microarcsecond metrology testbed (MAM), an interferometer testbed that has played a prominent role in the development of this technology.

phase correction↗

Crossing the mesoscale no-man s land via parallel kinetic Monte Carlo.

The kinetic Monte Carlo method and its variants are powerful tools for modeling materials at the mesoscale, meaning at length and time scales in between the atomic and continuum. We have completed a 3 year LDRD project with the goal of developing a parallel kinetic Monte Carlo capability and applying it to materials modeling problems of interest to Sandia. In this report we give an overview of the methods and algorithms developed, and describe our new open-source code called SPPARKS, for Stochastic Parallel PARticle Kinetic Simulator. We also highlight the development of several Monte Carlo models in SPPARKS for specific materials modeling applications, including grain growth, bubble formation, diffusion in nanoporous materials, defect formation in erbium hydrides, and surface growth and evolution.

97 MATHEMATICS AND COMPUTING↗

Natural Gas Fugitive Leak Detection Using an Unmanned Aerial Vehicle: Measurement System Description and Mass Balance Approach

Natural gas is an abundant resource across the United States, of which methane (CH4) is the main component. About 2% of extracted CH4 is lost through leaks. The Remote Methane Leak Detector (RMLD)-Unmanned Aerial Vehicle (UAV) system was developed to investigate natural gas fugitive leaks in this study. The system is composed of three major technologies: miniaturized RMLD (mini-RMLD) based on Backscatter Tunable Diode Laser Absorption Spectroscopy (TDLAS), an autonomous quadrotor UAV and simplified quantification and localization algorithms. With a miniaturized, downward-facing RMLD on a small UAV, the system measures the column-integrated CH4 mixing ratio and can semi-autonomously monitor CH4 leakage from sites associated with natural gas production, providing an advanced capability in detecting leaks at hard-to-access sites compared to traditional manual methods. Automated leak characterization algorithms combined with a wireless data link implement real-time leak quantification and reporting. This study placed particular emphasis on the RMLD-UAV system description and the quantification algorithm development based on a mass balance approach. Early data were gathered to test the prototype system and to evaluate the algorithm performance. The quantification algorithm derived in this study tended to underestimate the gas leak rates and yielded unreliable estimations in detecting leaks under 7 × 10 − 6 m3/s (~1 Standard Cubic Feet per Hour (SCFH)). Zero-leak cases can be ascertained via a skewness indicator, which is unique and promising. The influence of the systematic error was investigated by introducing simulated noises, of which Global Positioning System (GPS) noise presented the greatest impact on leak rate errors. The correlation between estimated leak rates and wind conditions were investigated, and steady winds with higher wind speeds were preferred to get better leak rate estimations, which was accurate to approximately 50% during several field trials. High precision coordinate information from the GPS, accurate wind measurements and preferred wind conditions, appropriate flight strategy and the relative steady survey height of the system are the crucial factors to optimize the leak rate estimations.

03 NATURAL GAS↗

DTK C/Fortran Interface Development for NEAMS FSI Simulations

This report documents the development of DataTransferKit (DTK) C and Fortran interfaces for fluid-structure-interaction (FSI) simulations in NEAMS. In these simulations, the codes Nek5000 and Diablo are being coupled within the SHARP framework to study flow-induced vibration (FIV) in reactor steam generators. We will review the current Nek5000/Diablo coupling algorithm in SHARP and the current state of the solution transfer scheme used in this implementation. We will then present existing DTK algorithms which may be used instead to provide an improvement in both flexibility and scalability of the current SHARP implementation. We will show how these can be used within the current FSI scheme using a new set of interfaces to the algorithms developed by this work. These new interfaces currently expose the mesh-free solution transfer algorithms in DTK, a C++ library, and are written in C and Fortran to enable coupling of both Nek5000 and Diablo in their native Fortran language. They have been compiled and tested on Cooley, the test-bed machine for Mira at ALCF.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Universal Decoder for PPM of any Order

A recently developed algorithm for demodulation and decoding of a pulse-position- modulation (PPM) signal is suitable as a basis for designing a single hardware decoding apparatus to be capable of handling any PPM order. Hence, this algorithm offers advantages of greater flexibility and lower cost, in comparison with prior such algorithms, which necessitate the use of a distinct hardware implementation for each PPM order. In addition, in comparison with the prior algorithms, the present algorithm entails less complexity in decoding at large orders. An unavoidably lengthy presentation of background information, including definitions of terms, is prerequisite to a meaningful summary of this development. As an aid to understanding, the figure illustrates the relevant processes of coding, modulation, propagation, demodulation, and decoding. An M-ary PPM signal has M time slots per symbol period. A pulse (signifying 1) is transmitted during one of the time slots; no pulse (signifying 0) is transmitted during the other time slots. The information intended to be conveyed from the transmitting end to the receiving end of a radio or optical communication channel is a K-bit vector u. This vector is encoded by an (N,K) binary error-correcting code, producing an N-bit vector a. In turn, the vector a is subdivided into blocks of m = log2(M) bits and each such block is mapped to an M-ary PPM symbol. The resultant coding/modulation scheme can be regarded as equivalent to a nonlinear binary code. The binary vector of PPM symbols, x is transmitted over a Poisson channel, such that there is obtained, at the receiver, a Poisson-distributed photon count characterized by a mean background count nb during no-pulse time slots and a mean signal-plus-background count of ns+nb during a pulse time slot. In the receiver, demodulation of the signal is effected in an iterative soft decoding process that involves consideration of relationships among photon counts and conditional likelihoods of m-bit vectors of coded bits. Inasmuch as the likelihoods of all the m-bit vectors of coded bits mapping to the same PPM symbol are correlated, the best performance is obtained when the joint mbit conditional likelihoods are utilized. Unfortunately, the complexity of decoding, measured in the number of operations per bit, grows exponentially with m, and can thus become prohibitively expensive for large PPM orders. For a system required to handle multiple PPM orders, the cost is even higher because it is necessary to have separate decoding hardware for each order. This concludes the prerequisite background information. In the present algorithm, the decoding process as described above is modified by, among other things, introduction of an lbit marginalizer sub-algorithm. The term "l-bit marginalizer" signifies that instead of m-bit conditional likelihoods, the decoder computes l-bit conditional likelihoods, where l is fixed. Fixing l, regardless of the value of m, makes it possible to use a single hardware implementation for any PPM order. One could minimize the decoding complexity and obtain an especially simple design by fixing l at 1, but this would entail some loss of performance. An intermediate solution is to fix l at some value, greater than 1, that may be less than or greater than m. This solution makes it possible to obtain the desired flexibility to handle any PPM order while compromising between complexity and loss of performance.

Moision, Bruce E.↗

Shortening treatment time in robotic radiosurgery using a novel node reduction technique

Purpose: The fraction duration of robotic radiosurgery treatments can be reduced by generating more time-efficient treatment plans with a reduced number of node positions, beams, and monitor units (MUs). Node positions are preprogramed locations where the robot can position the focal spot of the x-ray beam. As the time needed for the robot to travel between node positions takes up a large part of the treatment time, the aim of this study was to develop and evaluate a node reduction technique in order to reduce the treatment time per fraction for robotic radiosurgery. Methods: Node reduction was integrated into the inverse planning algorithm, developed in-house for the robotic radiosurgery modality. It involved repeated inverse optimization, each iteration excluding low-contribution node positions from the planning and resampling new candidate beams from the remaining node positions. Node reduction was performed until the exclusion of a single node position caused a constraint violation, after which the shortest treatment plan was selected retrospectively. Treatment plans were generated with and without node reduction for two lung cases of different complexity, one oropharyngeal case and one prostate case. Plan quality was assessed using the number of node positions, beams and MUs, and the estimated treatment time per fraction. All treatment plans had to fulfill all clinical dose constraints. Extra constraints were added to maintain the low-dose conformality and restrict skin doses during node reduction. Results: Node reduction resulted in 12 residual node positions, on average (reduction by 77%), at the cost of an increase in the number of beams and total MUs of 28% and 9%, respectively. Overall fraction durations (excluding patient setup) were shortened by 25% (range of 18%-40%), on average. Dose distributions changed only little and dose in low-dose regions was effectively restricted by the additional constraints. Conclusions: The fraction duration of robotic radiosurgery treatments can be reduced considerably by node reduction with minimal changes in dosimetrical plan quality. Additional constraints are required to guarantee low-dose conformality and to avoid unacceptable skin dose.

60 APPLIED LIFE SCIENCES↗

Determination of phytoplankton chlorophyll concentrations in the Chesapeake Bay with aircraft remote sensing

Remote sensing measurements of the distribution of phytoplankton chlorophyll concentrations in Chesapeake Bay during 1989 are described. It is shown that remote sensing from light aircraft can complement and extend measurements made from traditional platforms and provide data of improved temporal and spatial resolution, leading to a better understanding of phytoplankton dynamics in the estuary. The developments of the winter-spring diatom bloom in the polyhaline to mesohaline regions of the estuary and of the late-spring and summer dinoflagellate blooms in oligohaline and mesohaline regions are traced. The study presents the local chlorophyll algorithm developed using the NASA Ocean Data Acquisition System data and in situ chlorophyll data, interpolated maps of chlorophyll concentration generated by applying the algorithm to aircraft radiance data, ancillary in situ data on nutrients, turbidity, streamflow, and light availability, and an interpretation of phytoplankton dynamics in terms of the chlorophyll distribution in Chesapeake Bay during 1989.

Harding, Lawrence W., Jr.↗

Large-Scale, GPU-Enhanced DFTB Approaches for Probing Multi-Component Alloys

The major goals of the project are to develop and apply GPU-enhanced density functional theory tight binding (DFTB) calculations for efficient simulations of structural materials of alloy systems. The figure below depicts the GPU algorithmic developments on the left that will be carried out, and the solid-state structures on the right are representative of the complex alloys that can be computed with the GPU-enhanced DFTB approach. The methodology and tools developed in this project encompass accurate intermolecular potentials and GPU enhancements to the density functional tight binding (DFTB) approach for high-throughput ab initio molecular dynamics calculations of multi-component alloys at elevated temperatures. While classical molecular dynamics can handle hundreds of thousands of atoms, it cannot provide a first-principles based description of large, multi-component alloys at the predictive quantum level. At the other extreme, conventional Kohn-Sham DFT methods can probe the true quantum nature of chemical systems; however, these methods cannot tackle the large sizes relevant to these multi-component systems. The DFTB-based ab initio molecular dynamics approach (coupled with our in-house GPU capabilities for enhanced speed) used in this project provides a viable approach for probing these large systems at a quantum level of detail that is significantly faster than current first-principle methods Collectively, the capabilities developed in this project directly respond to DOE HBCU-OMI, AOI 2-1 initiatives by (1) enabling accurate and efficient predictions and (2) bringing a fundamental understanding of structural interactions in these complex systems at elevated temperatures.

20 FOSSIL-FUELED POWER PLANTS↗

Maximum likelihood classification of synthetic aperture radar imagery

Classification of synthetic aperture radar (SAR) images has important applications in geology, agriculture, and the military. A statistical model for SAR images is reviewed and a maximum likelihood classification algorithm developed for the classification of agricultural fields based on the model. It is first assumed that the target feature information is known a priori. The performance of the algorithm is then evaluated in terms of the probability of incorrect classification. A technique is also presented to extract the needed feature information from a SAR image; then both the feature extraction and the maximum likelihood classification algorithms are tested on a SEASAT-A SAR image.

Frost, V. S.↗

Numerical pole assignment by eigenvalue Jacobian inversion

A numerical procedure for solving the linear pole placement problem is developed which operates by the inversion of an analytically determined eigenvalue Jacobian matrix. Attention is given to convergence characteristics and pathological situations. It is not concluded that the algorithm developed is suitable for computer-aided control system design with particular reference to the scan platform pointing control system for the Galileo spacecraft.

Sevaston, George E.↗

Portability and Cross-Platform Performance of an MPI-Based Parallel Polygon Renderer

Visualizing the results of computations performed on large-scale parallel computers is a challenging problem, due to the size of the datasets involved. One approach is to perform the visualization and graphics operations in place, exploiting the available parallelism to obtain the necessary rendering performance. Over the past several years, we have been developing algorithms and software to support visualization applications on NASA's parallel supercomputers. Our results have been incorporated into a parallel polygon rendering system called PGL. PGL was initially developed on tightly-coupled distributed-memory message-passing systems, including Intel's iPSC/860 and Paragon, and IBM's SP2. Over the past year, we have ported it to a variety of additional platforms, including the HP Exemplar, SGI Origin2OOO, Cray T3E, and clusters of Sun workstations. In implementing PGL, we have had two primary goals: cross-platform portability and high performance. Portability is important because (1) our manpower resources are limited, making it difficult to develop and maintain multiple versions of the code, and (2) NASA's complement of parallel computing platforms is diverse and subject to frequent change. Performance is important in delivering adequate rendering rates for complex scenes and ensuring that parallel computing resources are used effectively. Unfortunately, these two goals are often at odds. In this paper we report on our experiences with portability and performance of the PGL polygon renderer across a range of parallel computing platforms.

Crockett, Thomas W.↗

Flight Deck Surface Trajectory-based Operations (STBO): Results of Piloted Simulations and Implications for Concepts of Operation (ConOps)

The results offour piloted medium-fidelity simulations investigating flight deck surface trajectory-based operations (STBO) will be reviewed. In these flight deck STBO simulations, commercial transport pilots were given taxi clearances with time and/or speed components and required to taxi to the departing runway or an intermediate traffic intersection. Under a variety of concept of operations (ConOps) and flight deck information conditions, pilots' ability to taxi in compliance with the required time of arrival (RTA) at the designated airport location was measured. ConOps and flight deck information conditions explored included: Availability of taxi clearance speed and elapsed time information; Intermediate RTAs at intermediate time constraint points (e.g., intersection traffic flow points); STBO taxi clearances via ATC voice speed commands or datal ink; and, Availability of flight deck display algorithms to reduce STBO RTA error. Flight Deck Implications. Pilot RTA conformance for STBO clearances, in the form of ATC taxi clearances with associated speed requirements, was found to be relatively poor, unless the pilot is required to follow a precise speed and acceleration/deceleration profile. However, following such a precise speed profile results in inordinate head-down tracking of current ground speed, leading to potentially unsafe operations. Mitigating these results, and providing good taxi RTA performance without the associated safety issues, is a flight deck avionics or electronic flight bag (EFB) solution. Such a solution enables pilots to meet the taxi route RTA without moment-by-moment tracking of ground speed. An avionics or EFB "error-nulling" algorithm allows the pilot to view the STBO information when the pilot determines it is necessary and when workload alloys, thus enabling the pilot to spread his/her attention appropriately and strategically on aircraft separation airport navigation, and the many other flight deck tasks concurrently required. Surface Traffic Management (STM) System Implications. The data indicate a number of implications regarding specific parameters for ATC/STM algorithm development. Pilots have a tendency to arrive at RTA points early with slow required speeds, on time for moderate speeds, and late with faster required speeds. This implies that ATC/STM algorithms should operate with middle-range speeds, similar to that of non-STBO taxi performance. Route length has a related effect: Long taxi routes increase the earliness with slow speeds and the lateness with faster speeds. This is likely due to the" open-loop" nature of the task in which the speed error compounds over a longer time with longer routes. Results showed that this may be mitigated by imposing a small number oftime constraint points each with their own RTAs effectively tuming a long route into a series of shorter routes - and thus improving RTA performance. STBO ConOps Implications. Most important is the impact that these data have for NextGen STM system ConOps development. The results of these experiments imply that it is not reasonable to expect pilots to taxi under a "Full STBO" ConOps in which pilots are expected to be at a predictable (x,y) airport location for every time (t). An STBO ConOps with a small number of intermediate time constraint points and the departing runway, however, is feasible, but only with flight deck equipage enabling the use of a display similar to the "error-nulling algorithm/display" tested.

Foyle, David C.↗

Investigation of Models and Estimation Techniques for GPS Attitude Determination

Much work has been done in the Flight Dynamics Analysis Branch (FDAB) in developing algorithms to met the new and growing field of attitude determination using the Global Positioning SYstem (GPS) constellation of satellites. Flight Dynamics has the responsibility to investigate any new technology and incorporate the innovations in the attitude ground support systems developed to support future missions. The work presented here is an investigative analysis that will produce the needed adaptation to allow the Flight Dynamics Support System (FDSS) to incorporate GPS phase measurements and produce observation measurements compatible with the FDSS. A simulator was developed to produce the necessary measurement data to test the models developed for the different estimation techniques used by FDAB. This paper gives an overview of the current modeling capabilities of the simulator models and algorithms for the adaptation of GPS measurement data and results from each of the estimation techniques. Future analysis efforts to evaluate the simulator and models against inflight GPS measurement data are also outlined.

Garrick, J.↗

Calculation of a simulated 3-D high speed inlet using the Navier-Stokes equations

A hybrid numerical algorithm, developed to solve the full three-dimensional Navier-Stokes equations, is applied to the computation of the flowfield in a simulated three-dimensional high speed aircraft inlet at a Mach number of 2.5 and Reynolds number of 1.4 x 10 to the 7th based on inlet length. The numerical algorithm incorporates a coordinate transformation in order to handle general flow geometries, and utilizes the algebraic turbulent eddy viscosity model of Baldwin and Lomax. The hybrid algorithm has been vectorized on the CDC CYBER 203 computer using the SL/1 vector programming language developed at NASA Langley. The computed results are compared with experimental measurements of the ramp and cowl static pressures, and boundary layer pitot profiles. The results are also compared with a previous two-dimensional Navier-Stokes computation of the same configuration. The agreement with the experimental data is generally good; however, additional improvements in turbulence modeling are needed.

Knight, D. D.↗

Multi-target camera tracking, hand-off and display LDRD 158819 final report

Modern security control rooms gather video and sensor feeds from tens to hundreds of cameras. Advanced camera analytics can detect motion from individual video streams and convert unexpected motion into alarms, but the interpretation of these alarms depends heavily upon human operators. Unfortunately, these operators can be overwhelmed when a large number of events happen simultaneously, or lulled into complacency due to frequent false alarms. This LDRD project has focused on improving video surveillance-based security systems by changing the fundamental focus from the cameras to the targets being tracked. If properly integrated, more cameras shouldn't lead to more alarms, more monitors, more operators, and increased response latency but instead should lead to better information and more rapid response times. For the course of the LDRD we have been developing algorithms that take live video imagery from multiple video cameras, identifies individual moving targets from the background imagery, and then displays the results in a single 3D interactive video. In this document we summarize the work in developing this multi-camera, multi-target system, including lessons learned, tools developed, technologies explored, and a description of current capability.

47 OTHER INSTRUMENTATION↗

Multi-Target Camera Tracking, Hand-off and Display LDRD 158819 Final Report

Modern security control rooms gather video and sensor feeds from tens to hundreds of cameras. Advanced camera analytics can detect motion from individual video streams and convert unexpected motion into alarms, but the interpretation of these alarms depends heavily upon human operators. Unfortunately, these operators can be overwhelmed when a large number of events happen simultaneously, or lulled into complacency due to frequent false alarms. This LDRD project has focused on improving video surveillance-based security systems by changing the fundamental focus from the cameras to the targets being tracked. If properly integrated, more cameras shouldn’t lead to more alarms, more monitors, more operators, and increased response latency but instead should lead to better information and more rapid response times. For the course of the LDRD we have been developing algorithms that take live video imagery from multiple video cameras, identify individual moving targets from the background imagery, and then display the results in a single 3D interactive video. In this document we summarize the work in developing this multi-camera, multi-target system, including lessons learned, tools developed, technologies explored, and a description of current capability.

47 OTHER INSTRUMENTATION↗

Theoretical and Experimental Study of Optical Coherence Tomography (OCT) Signals Using an Analytical Transport Model

Optical coherence tomography (OCT) is a non-invasive low coherent interferometric technique that provides cross-sectional images of turbid media. OCT is based on the classical Michelson interferometer where the mirror of the reference arm is oscillating and the signal arm contains a biological sample. In this work, we analyzed theoretically the heterodyne optical signal adopting the so called extended Huygens-Fresnel principle (EHFP). We use simulated OCT images with known optical properties to test an algorithm developed by ourselves to recover the scattering coefficient and we recovered the scattering coefficient with a relative error less than 5% for noisy signals. In addition, we applied this algorithm to OCT images from phantoms of known optical properties; in this case curves were indistinguishable. A revision of the validity of the analytical model applied to our system should be done.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Stochastic approximation methods-Powerful tools for simulation and optimization: A survey of some recent work on multi-agent systems and cyber-physical systems

Stochastic approximation methods have found extensive and diversified applications. Recent emergence of networked systems and cyber-physical systems has generated renewed interest in advancing stochastic approximation into a general framework to support algorithm development for information processing and decisions in such systems. This paper presents a survey on some recent developments in stochastic approximation methods and their applications. Using connected vehicles in platoon formation and coordination as a platform, we highlight some traditional and new methodologies of stochastic approximation algorithms and explain how they can be used to capture essential features in networked systems. Distinct features of networked systems with randomly switching topologies, dynamically evolving parameters, and unknown delays are presented, and control strategies are provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗