Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm complexity analysis”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

A New Approach to Parallel Interference Cancellation for CDMA

This paper introduces an improved nonlinear parallel interference cancellation scheme that significantly reduces the degrading effect of user interference with implementation complexity linear in the number of users. The scheme operates on the fact that parallel processing simultaneously removes from each user a part of the interference produced by the remaining users accessing the channel the amount being proportional to their reliability. The parallel processing can be done in multiple stages. Simulation results are given for a multitude of different situations, in particular those cases for which the analysis is too complex.

interference cancellation multiuser communication ↗
NASA NTRS1981

Large modal survey testing using the Ibrahim time domain /ITD/ identification technique

The ability of the ITD identification algorithm in identifying a complete set of structural modal parameters using a large number of free-response time histories simultaneously in one analysis, assuming a math model with a high number of degrees-of-freedom, has been studied. Identification results using simulated free responses of a uniform rectangular plate, with 225 measurement stations, and experimental responses from a ground vibration test of the Long Duration Exposure Facility (LDEF) Space Shuttle payload, with 142 measurement stations, are presented. As many as 300 degrees-of-freedom were allowed in analyzing these data. In general, the use of a significantly oversized math model in the identification process was found to maintain or increase identification accuracy and to identify modes of low response level that are not identified with smaller math model sizes. The concept of a Mode Shape Correlation Constant is introduced for use when more than one identification analysis of the same structure are conducted. This constant quantifies the degree of correlation between any two sets of complex mode shapes identified using different excitation conditions, different user-selectable algorithm constants, or overlapping sets of measurements.

Ibrahim, S. R.↗
NASA NTRS1985

Large Modal Survey Testing Using the Ibrahim Time Domain Identification Technique

The ability of the ITD identification algorithm in identifying a complete set of structural modal parameters using a large number of free-response time histories simultaneously in one analysis, assuming a math model with a high number of degrees-of-freedom, has been studied. Identification results using simulated free responses of a uniform rectangular plate, with 225 measurement stations, and experimental responses from a ground vibration test of the Long Duration Exposure Facility (LDEF) Space Shuttle payload, with 142 measurement stations, are presented. As many as 300 degrees-of-freedom were allowed in analyzing these data. In general, the use of a significantly oversized math model in the identification process was found to maintain or increase identification accuracy and to identify modes of low response level that are not identified with smaller math model sizes. The concept of a Mode Shape Correlation Constant is introduced for use when more than one identification analysis of the same structure are conducted. This constant quantifies the degree of correlation between any two sets of complex mode shapes identified using different excitation conditions, different user-selectable algorithm constants, or overlapping sets of measurements.

Ibrahim, S. R.↗
NASA NTRSDate not supplied

Digital Assistance for System Requirement Discovery and Analysis using Machine Learning Natural Language Processing Algorithm

NASA’s Air Traffic Management-Exploration (ATM-X) Urban Air Mobility (UAM) Airspace Subproject is conducting research that evolves UAM airspace towards a highly automated and operationally flexible system of the future (see https://www.nasa.gov/uam-overview/ for more information). The complexity of UAM airspace, and its evolution through a series of transformative epochs, requires a planning tool to effectively organize, integrate, and communicate the research that will guide the evolution of UAM operations in the National Airspace System (NAS). The planning tool, called the UAM airspace research roadmap (or just roadmap), is being developed as a new system engineering methodology leveraging model based system engineering (MBSE) and machine learning natural language processing (ML NLP, or just NLP) capabilities. This presentation gives an overview of the NLP application within this system engineering methodology and will describe how it is being used to meet the ATM-X UAM Airspace Subproject’s overarching research goals.

ATM↗
NASA NTRS1995

The detector response matrices of the burst and transient source experiment (BATSE) on the Compton Gamma Ray Observatory

The detector response matrices for the Burst And Transient Source Experiment (BATSE) on board the Compton Gamma Ray Observatory (CGRO) are described, including their creation and operation in data analysis. These response matrices are a detailed abstract representation of the gamma-ray detectors' operating characteristics that are needed for data analysis. They are constructed from an extensive set of calibration data coupled with a complex geometry electromagnetic cascade Monte Carlo simulation code. The calibration tests and simulation algorithm optimization are described. The characteristics of the BATSE detectors in the spacecraft environment are also described.

Pendleton, Geoffrey N.↗
NASA NTRS2000

Wavelet-Based Interpolation and Representation of Non-Uniformly Sampled Spacecraft Mission Data

A well-documented problem in the analysis of data collected by spacecraft instruments is the need for an accurate, efficient representation of the data set. The data may suffer from several problems, including additive noise, data dropouts, an irregularly-spaced sampling grid, and time-delayed sampling. These data irregularities render most traditional signal processing techniques unusable, and thus the data must be interpolated onto an even grid before scientific analysis techniques can be applied. In addition, the extremely large volume of data collected by scientific instrumentation presents many challenging problems in the area of compression, visualization, and analysis. Therefore, a representation of the data is needed which provides a structure which is conducive to these applications. Wavelet representations of data have already been shown to possess excellent characteristics for compression, data analysis, and imaging. The main goal of this project is to develop a new adaptive filtering algorithm for image restoration and compression. The algorithm should have low computational complexity and a fast convergence rate. This will make the algorithm suitable for real-time applications. The algorithm should be able to remove additive noise and reconstruct lost data samples from images.

Bose, Tamal↗
NASA NTRS2005

High Resolution Aerospace Applications using the NASA Columbia Supercomputer

This paper focuses on the parallel performance of two high-performance aerodynamic simulation packages on the newly installed NASA Columbia supercomputer. These packages include both a high-fidelity, unstructured, Reynolds-averaged Navier-Stokes solver, and a fully-automated inviscid flow package for cut-cell Cartesian grids. The complementary combination of these two simulation codes enables high-fidelity characterization of aerospace vehicle design performance over the entire flight envelope through extensive parametric analysis and detailed simulation of critical regions of the flight envelope. Both packages. are industrial-level codes designed for complex geometry and incorpor.ats. CuStomized multigrid solution algorithms. The performance of these codes on Columbia is examined using both MPI and OpenMP and using both the NUMAlink and InfiniBand interconnect fabrics. Numerical results demonstrate good scalability on up to 2016 CPUs using the NUMAIink4 interconnect, with measured computational rates in the vicinity of 3 TFLOP/s, while InfiniBand showed some performance degradation at high CPU counts, particularly with multigrid. Nonetheless, the results are encouraging enough to indicate that larger test cases using combined MPI/OpenMP communication should scale well on even more processors.

Mavriplis, Dimitri J.↗
NASA NTRS2009

Computing Bounds on Resource Levels for Flexible Plans

A new algorithm efficiently computes the tightest exact bound on the levels of resources induced by a flexible activity plan (see figure). Tightness of bounds is extremely important for computations involved in planning because tight bounds can save potentially exponential amounts of search (through early backtracking and detection of solutions), relative to looser bounds. The bound computed by the new algorithm, denoted the resource-level envelope, constitutes the measure of maximum and minimum consumption of resources at any time for all fixed-time schedules in the flexible plan. At each time, the envelope guarantees that there are two fixed-time instantiations one that produces the minimum level and one that produces the maximum level. Therefore, the resource-level envelope is the tightest possible resource-level bound for a flexible plan because any tighter bound would exclude the contribution of at least one fixed-time schedule. If the resource- level envelope can be computed efficiently, one could substitute looser bounds that are currently used in the inner cores of constraint-posting scheduling algorithms, with the potential for great improvements in performance. What is needed to reduce the cost of computation is an algorithm, the measure of complexity of which is no greater than a low-degree polynomial in N (where N is the number of activities). The new algorithm satisfies this need. In this algorithm, the computation of resource-level envelopes is based on a novel combination of (1) the theory of shortest paths in the temporal-constraint network for the flexible plan and (2) the theory of maximum flows for a flow network derived from the temporal and resource constraints. The measure of asymptotic complexity of the algorithm is O(N O(maxflow(N)), where O(x) denotes an amount of computing time or a number of arithmetic operations proportional to a number of the order of x and O(maxflow(N)) is the measure of complexity (and thus of cost) of a maximumflow algorithm applied to an auxiliary flow network of 2N nodes. The algorithm is believed to be efficient in practice; experimental analysis shows the practical cost of maxflow to be as low as O(N1.5). The algorithm could be enhanced following at least two approaches. In the first approach, incremental subalgorithms for the computation of the envelope could be developed. By use of temporal scanning of the events in the temporal network, it may be possible to significantly reduce the size of the networks on which it is necessary to run the maximum-flow subalgorithm, thereby significantly reducing the time required for envelope calculation. In the second approach, the practical effectiveness of resource envelopes in the inner loops of search algorithms could be tested for multi-capacity resource scheduling. This testing would include inner-loop backtracking and termination tests and variable and value-ordering heuristics that exploit the properties of resource envelopes more directly.

Muscvettola, Nicola↗
NASA NTRSDate not supplied

Toward Adjoint-Based Aeroacoustic Optimization for Propeller and Rotorcraft Applications

The goal of the present project is to build a multidisciplinary, rapid, robust, and accurate computational tool to optimize wing-mounted propeller designs. The full Farassat’s formulation F1Afor aeroacoustic analysis is implemented in the open-source software SU2.This extension enables the prediction of far-field noise generated by moving sources. The formulation is verified, for a stationary and rotating sphere in a wind tunnel and for a tiltrotor in forward flight, by comparing the acoustic predictions ofSU2 with the predictions computed by NASA’s aeroacoustics code ANOPP2. The algorithmic differentiation capability of SU2 provides discretely consistent, adjoint-based sensitivity analysis for this formulation. The adjoint-based sensitivities are verified through comparison with complex-step sensitivities

R Omur Icke↗
NASA NTRS1996

Development of Collaborative Research Initiatives to Advance the Aerospace Sciences-via the Communications, Electronics, Information Systems Focus Group

The primary goal of the Adaptive Vision Laboratory Research project was to develop advanced computer vision systems for automatic target recognition. The approach used in this effort combined several machine learning paradigms including evolutionary learning algorithms, neural networks, and adaptive clustering techniques to develop the E-MOR.PH system. This system is capable of generating pattern recognition systems to solve a wide variety of complex recognition tasks. A series of simulation experiments were conducted using E-MORPH to solve problems in OCR, military target recognition, industrial inspection, and medical image analysis. The bulk of the funds provided through this grant were used to purchase computer hardware and software to support these computationally intensive simulations. The payoff from this effort is the reduced need for human involvement in the design and implementation of recognition systems. We have shown that the techniques used in E-MORPH are generic and readily transition to other problem domains. Specifically, E-MORPH is multi-phase evolutionary leaming system that evolves cooperative sets of features detectors and combines their response using an adaptive classifier to form a complete pattern recognition system. The system can operate on binary or grayscale images. In our most recent experiments, we used multi-resolution images that are formed by applying a Gabor wavelet transform to a set of grayscale input images. To begin the leaming process, candidate chips are extracted from the multi-resolution images to form a training set and a test set. A population of detector sets is randomly initialized to start the evolutionary process. Using a combination of evolutionary programming and genetic algorithms, the feature detectors are enhanced to solve a recognition problem. The design of E-MORPH and recognition results for a complex problem in medical image analysis are described at the end of this report. The specific task involves the identification of vertebrae in x-ray images of human spinal columns. This problem is extremely challenging because the individual vertebra exhibit variation in shape, scale, orientation, and contrast. E-MORPH generated several accurate recognition systems to solve this task. This dual use of this ATR technology clearly demonstrates the flexibility and power of our approach.

Knasel, T. Michael↗
NASA NTRSDate not supplied

System-Theoretic Analysis of Unsafe Collaborative Control in Teaming Systems

The interactions that occur in human-teaming are inspiring novel aerospace designs aimed at improving how humans and machines, or multiple machines, work together. Unfortunately, current Systems Engineering processes are ill-equipped to handle these complex relationships and are unable to design and assure the safety for these systems. To close part of this gap, this paper introduces a novel system-theoretic analytical process to identify unsafe collaborative control actions. It is part of a broader set of techniques that extend the state-of-the-art in hazard analysis, System Theoretic Process Analysis (STPA), to systematically address collaboration. The method rigorously expresses the different ways multiple commands may be unsafe together. Using Systems Theory, it employs abstraction to manage the combinatorial complexity in enumerating control contributions from multiple collaborating components. An algorithm integrates these concepts into an end-to-end process and is supported by automation to enumerate, refine, prune, and prioritize unsafe combinations of control actions. The output of the method feeds the specification of system requirements to implement safety-guided design starting early in concept development. The process is demonstrated on a manned-unmanned aircraft teaming case study and finds new causal factors that were not previously found in a past hazard analysis of the same system.

System Safety↗
NASA NTRS1986

Free vibration and dynamic response analysis of spinning structures

The proposed effort involved development of numerical procedures for efficient solution of free vibration problems of spinning structures. An eigenproblem solution procedure, based on a Lanczos method employing complex arithmetic, was successfully developed. This task involved formulation of the numerical procedure, FORTRAN coding of the algorithm, checking and debugging of software, and implementation of the routine in the STARS program. A graphics package for the E/S PS 300 as well as for the Tektronix terminals was successfully generated and consists of the following special capabilities: (1) a dynamic response plot for the stresses and displacements as functions of time; and (2) a menu driven command module enabling input of data on an interactive basis. Finally, the STARS analysis capability was further improved by implementing the dynamic response analysis package that provides information on nodal deformations and element stresses as a function of time. A number of test cases were run utilizing the currently developed algorithm implemented in the STARS program and such results indicate that the newly generated solution technique is significantly more efficient than other existing similar procedures.

Source record↗
NASA NTRS1991

An X-ray image of the violent interstellar medium in 30 Doradus

A detailed analysis of the X-ray emission from the largest H II region complex in the Local Group, 30 Dor, is presented. Applying a new maximum entropy deconvolution algorithm to the Einstein Observatory data, reveals striking correlations among the X-ray, radio, and optical morphologies of the region, with X-ray-emitting bubbles filling cavities surrounded by H-alpha shells and coextensive diffuse X-ray and radio continuum emission from throughout the region. The total X-ray luminosity in the 0.16-3.5 keV band from an area within 160 pc of the central cluster R136 is about 2 x 10 to the 37th ergs/sec.

Wang, Q.↗
NASA NTRS1993

Analysis of hyper-spectral AVIRIS image data over a mixed-conifer forest in Maine

An introduction to some of the potential uses of hyperspectral data for ecosystem analysis is presented. The examples given are derived from a digital dataset acquired over a sub-boreal forest in central Maine in 1990 by the NASA-JPL Airborne Visible and Infrared Imaging Spectrometer (AVIRIS) instrument gathers data from 400 to 2500 nm in 224 channels at bandwidths of approximately 10 nm. As a preview to the uses of the hyperspectral data, several products from this dataset were extracted. They range from the traditional false color composite made from simulated Thematic Mapper bands and the well known normalized difference vegetation index to much more exotic products such as fractions of vegetation, soil and shade based on linear spectral mixing models and estimates of the leaf water content at the landscape level derived using spectrum-matching techniques. Our research and that of many others indicates that the hyperspectral datasets carry much important information which is only beginning to be understood. This analysis gives an initial indication of the utility of hyperspectral data. Much work still remains to be done in algorithm development and in understanding the physics behind the complex information signal carried in the hyperspectral datasets. This work must be carried out to provide the fullest science support for high spectral resolution data to be acquired by many of the instruments to be launched as part of the Earth Observing System program in the mid-1990's.

Lawrence, William T.↗
NASA NTRS2009

Sequential Principal Component Analysis -An Optimal and Hardware-Implementable Transform for Image Compression

This paper presents the JPL-developed Sequential Principal Component Analysis (SPCA) algorithm for feature extraction / image compression, based on "dominant-term selection" unsupervised learning technique that requires an order-of-magnitude lesser computation and has simpler architecture compared to the state of the art gradient-descent techniques. This algorithm is inherently amenable to a compact, low power and high speed VLSI hardware embodiment. The paper compares the lossless image compression performance of the JPL's SPCA algorithm with the state of the art JPEG2000, widely used due to its simplified hardware implementability. JPEG2000 is not an optimal data compression technique because of its fixed transform characteristics, regardless of its data structure. On the other hand, conventional Principal Component Analysis based transform (PCA-transform) is a data-dependent-structure transform. However, it is not easy to implement the PCA in compact VLSI hardware, due to its highly computational and architectural complexity. In contrast, the JPL's "dominant-term selection" SPCA algorithm allows, for the first time, a compact, low-power hardware implementation of the powerful PCA algorithm. This paper presents a direct comparison of the JPL's SPCA versus JPEG2000, incorporating the Huffman and arithmetic coding for completeness of the data compression operation. The simulation results show that JPL's SPCA algorithm is superior as an optimal data-dependent-transform over the state of the art JPEG2000. When implemented in hardware, this technique is projected to be ideally suited to future NASA missions for autonomous on-board image data processing to improve the bandwidth of communication.

Duong, Tuan A.↗
NASA NTRS1978

Sorting on STAR

Timing comparisons are given for three sorting algorithms written for the CDC STAR computer. One algorithm is Hoare's (1962) Quicksort, which is the fastest or nearly the fastest sorting algorithm for most computers. A second algorithm is a vector version of Quicksort that takes advantage of the STAR's vector operations. The third algorithm is an adaptation of Batcher's (1968) sorting algorithm, which makes especially good use of vector operations but has a complexity of N(log N)-squared as compared with a complexity of N log N for the Quicksort algorithms. In spite of its worse complexity, Batcher's sorting algorithm is competitive with the serial version of Quicksort for vectors up to the largest that can be treated by STAR. Vector Quicksort outperforms the other two algorithms and is generally preferred. These results indicate that unusual instruction sets can introduce biases in program execution time that counter results predicted by worst-case asymptotic complexity analysis.

Stone, H. S.↗
NASA NTRS2007

POD Model Reconstruction for Gray-Box Fault Detection

Proper orthogonal decomposition (POD) is the mathematical basis of a method of constructing low-order mathematical models for the "gray-box" fault-detection algorithm that is a component of a diagnostic system known as beacon-based exception analysis for multi-missions (BEAM). POD has been successfully applied in reducing computational complexity by generating simple models that can be used for control and simulation for complex systems such as fluid flows. In the present application to BEAM, POD brings the same benefits to automated diagnosis. BEAM is a method of real-time or offline, automated diagnosis of a complex dynamic system.The gray-box approach makes it possible to utilize incomplete or approximate knowledge of the dynamics of the system that one seeks to diagnose. In the gray-box approach, a deterministic model of the system is used to filter a time series of system sensor data to remove the deterministic components of the time series from further examination. What is left after the filtering operation is a time series of residual quantities that represent the unknown (or at least unmodeled) aspects of the behavior of the system. Stochastic modeling techniques are then applied to the residual time series. The procedure for detecting abnormal behavior of the system then becomes one of looking for statistical differences between the residual time series and the predictions of the stochastic model.

Park, Han↗