Search NASA⌕ Search

SEARCH · Search NASA

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 631 records · Page 35

Supervised Learning Applied to Air Traffic Trajectory Classification

Given the recent increase of interest in introducing new vehicle types and missions into the National Airspace System, a transition towards a more autonomous air traffic control system is required in order to enable and handle increased density and complexity. This paper presents an exploratory effort of the needed autonomous capabilities by exploring supervised learning techniques in the context of aircraft trajectories. In particular, it focuses on the application of machine learning algorithms and neural network models to a runway recognition trajectory-classification study. It investigates the applicability and effectiveness of various classifiers using datasets containing trajectory records for a month of air traffic. A feature importance and sensitivity analysis are conducted to challenge the chosen time-based datasets and the ten selected features. The study demonstrates that classification accuracy levels of 90% and above can be reached in less than 40 seconds of training for most machine learning classifiers when one track data point, described by the ten selected features at a particular time step, per trajectory is used as input. It also shows that neural network models can achieve similar accuracy levels but at higher training time costs.

Bosson, Christabelle S.↗

Supervised Learning Applied to Air Traffic Trajectory Classification

Given the recent increase of interest in introducing new vehicle types and missions into the National Airspace System, a transition towards a more autonomous air traffic control system is required in order to enable and handle increased density and complexity. This paper presents an exploratory effort of the needed autonomous capabilities by exploring supervised learning techniques in the context of aircraft trajectories. In particular, it focuses on the application of machine learning algorithms and neural network models to a runway recognition trajectory-classification study. It investigates the applicability and effectiveness of various classifiers using datasets containing trajectory records for a month of air traffic. A feature importance and sensitivity analysis are conducted to challenge the chosen time-based datasets and the ten selected features. The study demonstrates that classification accuracy levels of 90% and above can be reached in less than 40 seconds of training for most machine learning classifiers when one track data point, described by the ten selected features at a particular time step, per trajectory is used as input. It also shows that neural network models can achieve similar accuracy levels but at higher training time costs.

Bosson, Christabelle↗

Hybrid Lyot Coronagraph for WFIRST: High Contrast Testbed Demonstration in Flight-like Low Flux Environment

In order to validate required operation of the proposed Wide-Field InfraRed Survey Telescope (WFIRST) coronagraph instrument, we have built a testbed in Jet Propulsion Laboratory (JPL), which is analogous to the baseline WFIRST coronagraph instrument architecture. Since its birth in 2016, this testbed, named as Occulting Mask Coronagraph (OMC) testbed, has demonstrated several crucial technological milestones: Broadband high contrast demonstration in both Hybrid Lyot Coronagraph (HLC) and Shape Pupil Coronagraph (SPC) modes while the Low Order Wavefront Sensing and Control (LOWFS/C) subsystem senses and corrects the dynamic flight-like wavefront disturbances. In this paper, we present up-to-date progress of HLC mode demonstration in the OMC testbed. While injecting the flight-like low photon flux starlight with expected Line of Sight (LoS) and Wavefront Error (WFE) perturbation to the OMC testbed, we demonstrate generating high contrast dark hole images. We first study the expected photon flux in actual flight environment, and estimate detection noise and estimation accuracy of the complex electric field if the wavefront sensing algorithm is used based on the pair-wise difference imaging. Then, we introduce our improved scheme to mitigate this photon-starved flight-like low flux environment. As a result, we generate a dark hole that meets the WFIRST raw contrast requirements using the 2nd magnitude star light. We establish the key ideas, describe test setups, and demonstrate test results with data analysis.

Wilson, Daniel↗

A Vehicle Management End-to-End Testing and Analysis Platform for Validation of Mission and Fault Management Algorithms to Reduce Risk for NASAs Space Launch System

The engineering development of the National Aeronautics and Space Administration's (NASA) new Space Launch System (SLS) requires cross discipline teams with extensive knowledge of launch vehicle subsystems, information theory, and autonomous algorithms dealing with all operations from pre-launch through on orbit operations. The nominal and off-nominal characteristics of SLS's elements and subsystems must be understood and matched with the autonomous algorithm monitoring and mitigation capabilities for accurate control and response to abnormal conditions throughout all vehicle mission flight phases, including precipitating safing actions and crew aborts. This presents a large and complex systems engineering challenge, which is being addressed in part by focusing on the specific subsystems involved in the handling of off-nominal mission and fault tolerance with response management. Using traditional model-based system and software engineering design principles from the Unified Modeling Language (UML) and Systems Modeling Language (SysML), the Mission and Fault Management (M&FM) algorithms for the vehicle are crafted and vetted in Integrated Development Teams (IDTs) composed of multiple development disciplines such as Systems Engineering (SE), Flight Software (FSW), Safety and Mission Assurance (S&MA) and the major subsystems and vehicle elements such as Main Propulsion Systems (MPS), boosters, avionics, Guidance, Navigation, and Control (GNC), Thrust Vector Control (TVC), and liquid engines. These model-based algorithms and their development lifecycle from inception through FSW certification are an important focus of SLS's development effort to further ensure reliable detection and response to off-nominal vehicle states during all phases of vehicle operation from pre-launch through end of flight. To test and validate these M&FM algorithms a dedicated test-bed was developed for full Vehicle Management End-to-End Testing (VMET). For addressing fault management (FM) early in the development lifecycle for the SLS program, NASA formed the M&FM team as part of the Integrated Systems Health Management and Automation Branch under the Spacecraft Vehicle Systems Department at the Marshall Space Flight Center (MSFC). To support the development of the FM algorithms, the VMET developed by the M&FM team provides the ability to integrate the algorithms, perform test cases, and integrate vendor-supplied physics-based launch vehicle (LV) subsystem models. Additionally, the team has developed processes for implementing and validating the M&FM algorithms for concept validation and risk reduction. The flexibility of the VMET capabilities enables thorough testing of the M&FM algorithms by providing configurable suites of both nominal and off-nominal test cases to validate the developed algorithms utilizing actual subsystem models such as MPS, GNC, and others. One of the principal functions of VMET is to validate the M&FM algorithms and substantiate them with performance baselines for each of the target vehicle subsystems in an independent platform exterior to the flight software test and validation processes. In any software development process there is inherent risk in the interpretation and implementation of concepts from requirements and test cases into flight software compounded with potential human errors throughout the development and regression testing lifecycle. Risk reduction is addressed by the M&FM group but in particular by the Analysis Team working with other organizations such as S&MA, Structures and Environments, GNC, Orion, Crew Office, Flight Operations, and Ground Operations by assessing performance of the M&FM algorithms in terms of their ability to reduce Loss of Mission (LOM) and Loss of Crew (LOC) probabilities. In addition, through state machine and diagnostic modeling, analysis efforts investigate a broader suite of failure effects and associated detection and responses to be tested in VMET to ensure reliable failure detection, and confirm responses do not create additional risks or cause undesired states through interactive dynamic effects with other algorithms and systems. VMET further contributes to risk reduction by prototyping and exercising the M&FM algorithms early in their implementation and without any inherent hindrances such as meeting FSW processor scheduling constraints due to their target platform - the ARINC 6535-partitioned Operating System, resource limitations, and other factors related to integration with other subsystems not directly involved with M&FM such as telemetry packing and processing. The baseline plan for use of VMET encompasses testing the original M&FM algorithms coded in the same C++ language and state machine architectural concepts as that used by FSW. This enables the development of performance standards and test cases to characterize the M&FM algorithms and sets a benchmark from which to measure their effectiveness and performance in the exterior FSW development and test processes. This paper is outlined in a systematic fashion analogous to a lifecycle process flow for engineering development of algorithms into software and testing. Section I describes the NASA SLS M&FM context, presenting the current infrastructure, leading principles, methods, and participants. Section II defines the testing philosophy of the M&FM algorithms as related to VMET followed by section III, which presents the modeling methods of the algorithms to be tested and validated in VMET. Its details are then further presented in section IV followed by Section V presenting integration, test status, and state analysis. Finally, section VI addresses the summary and forward directions followed by the appendices presenting relevant information on terminology and documentation.

Trevino, Luis↗

Carbon Capture Multidisciplinary Simulation CenterTrilab Support Team Fall Meeting 2018 Report

The TST continues to be very impressed with the quality of work presented and the rapid progress made by the CCMSC on a highly complex multiphysics problem domain. The Center is gathering increasing expertise and experience in multiple areas likely to be of broad interest to DOE and the greater HPC community, particularly in the areas of programming models and DSLs, I/O, V&V/UQ, and visualization/data analytics. This year in particular saw very impressive results in their task graph algorithms, strong and weak scaling of their overall code, and sophistication of their physics models and V/UQ analysis and approach. The team was particularly impressed with the depth of engagement and quality of discussion at the V/UQ deep dive. There are very few organizations outside of NNSA doing multiphysics simulation at this level of accuracy, efficiency, scale and sophistication and DOE would be well-advised to actively work to maintain a close collaborative relationship with this team after the completion of the PSAAP II program if at all possible.

20 FOSSIL-FUELED POWER PLANTS↗

Measuring the Energy Consumption and Efficiency of Deep Neural Networks: An Empirical Analysis and Design Recommendations

Addressing the "Red-AI" trend of rising energy consumption by large-scale neural networks, this study investigates the measured energy consumption of training various fully connected neural network architectures. We introduce the BUTTER-E dataset, an augmentation to the BUTTER Empirical Deep Learning dataset, containing energy consumption and performance data from 41,129 individual experimental runs spanning 30,582 distinct configurations: 13 datasets, 20 sizes (trainable parameters), 8 "shapes", and 14 depths on both CPUs and GPUs using node-level watt-meters. This dataset reveals the complex relationship between dataset size, network structure, and energy use. Our analysis uncovers a surprising, hardware-mediated non-linear relationship between energy efficiency and network design, challenging the assumption that reducing the number of parameters or FLOPs is the best way to achieve greater energy efficiency. We propose a straightforward and effective energy model that accounts for network size, computing, and memory hierarchy. Highlighting the need for cache-considerate algorithm development, we suggest a codesign approach to energy efficient network, algorithm, and hardware design. This work contributes to the fields of sustainable computing and Green AI, offering practical guidance for creating more energy-efficient neural networks and promoting sustainable AI.

97 MATHEMATICS AND COMPUTING↗

Application of optimality criteria in structural synthesis

The rational use of optimality criteria was investigated for a class of structural synthesis problems where materials, configuration and applied load conditions are specified, and the minimum weight design is to be determined. The potential of hybrid methods of structural optimization for dealing with relatively large design problems involving practical complexity was explored. The reduced basis concept in design space was used to decrease the number of generalized design variables dealt with by the mathematical programming algorithm. Optimality criteria methods for obtaining design vectors associated with displacement, system buckling and natural frequency constraints are presented. A stress ratio method was used to generate a basis design vector representing the stress constraints. The finite element displacement method was used as the basic structural analysis tool. Results for several examples of truss systems subject to stress, displacement and minimum size constraints are presented. An assessment of these results indicates the effectiveness of the hybrid method developed.

Terai, K.↗

Single-tone parameter estimation from discrete-time observations

Estimation of the parameters of a single-frequency complex tone from a finite number of noisy discrete-time observations is discussed. The appropriate Cramer-Rao bounds and maximum-likelihood (ML) estimation algorithms are derived. Some properties of the ML estimators are proved. The relationship of ML estimation to the discrete Fourier transform is exploited to obtain practial algorithms. The threshold effect of one algorithm is analyzed and compared to simulation results. Other simulation results verify other aspects of the analysis.

Rife, D. C.↗

Structured codebook design in CELP

Codebook Excited Linear Protection (CELP) is a popular analysis by synthesis technique for quantizing speech at bit rates from 4 to 6 kbps. Codebook design techniques to date have been largely based on either random (often Gaussian) codebooks, or on known binary or ternary codes which efficiently map the space of (assumed white) excitation codevectors. It has been shown that by introducing symmetries into the codebook, good complexity reduction can be realized with only marginal decrease in performance. Codebook design algorithms are considered for a wide range of structured codebooks.

Leblanc, W. P.↗

Parallel Finite Element Domain Decomposition for Structural/Acoustic Analysis

A domain decomposition (DD) formulation for solving sparse linear systems of equations resulting from finite element analysis is presented. The formulation incorporates mixed direct and iterative equation solving strategics and other novel algorithmic ideas that are optimized to take advantage of sparsity and exploit modern computer architecture, such as memory and parallel computing. The most time consuming part of the formulation is identified and the critical roles of direct sparse and iterative solvers within the framework of the formulation are discussed. Experiments on several computer platforms using several complex test matrices are conducted using software based on the formulation. Small-scale structural examples are used to validate thc steps in the formulation and large-scale (l,000,000+ unknowns) duct acoustic examples are used to evaluate the ORIGIN 2000 processors, and a duster of 6 PCs (running under the Windows environment). Statistics show that the formulation is efficient in both sequential and parallel computing environmental and that the formulation is significantly faster and consumes less memory than that based on one of the best available commercialized parallel sparse solvers.

Nguyen, Duc T.↗

Model-Checking with Edge-Valued Decision Diagrams

We describe an algebra of Edge-Valued Decision Diagrams (EVMDDs) to encode arithmetic functions and its implementation in a model checking library along with state-of-the-art algorithms for building the transition relation and the state space of discrete state systems. We provide efficient algorithms for manipulating EVMDDs and give upper bounds of the theoretical time complexity of these algorithms for all basic arithmetic and relational operators. We also demonstrate that the time complexity of the generic recursive algorithm for applying a binary operator on EVMDDs is no worse than that of Multi-Terminal Decision Diagrams. We have implemented a new symbolic model checker with the intention to represent in one formalism the best techniques available at the moment across a spectrum of existing tools: EVMDDs for encoding arithmetic expressions, identity-reduced MDDs for representing the transition relation, and the saturation algorithm for reachability analysis. We compare our new symbolic model checking EVMDD library with the widely used CUDD package and show that, in many cases, our tool is several orders of magnitude faster than CUDD.

Roux, Pierre↗

A model of asynchronous iterative algorithms for solving large, sparse, linear systems

Solving large, sparse, linear systems of equations is one of the fundamental problems in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. This model is then analyzed to determine the expected intertask data transfer and task computational complexity as functions of the number of tasks. Based on the analysis, recommendations for task partitioning are made. These recommendations are a function of the sparseness of the linear system, its structure (i.e., randomly sparse or banded), and dimension.

Reed, D. A.↗

The picasso map-making code: application to a simulation of the QUIJOTE northern sky survey

ABSTRACT Map-making is an important step for the data analysis of cosmic microwave background (CMB) experiments. It consists of converting the data, which are typically a long, complex, and noisy collection of measurements, into a map, which is an image of the observed sky. We present in this paper a new map-making code named picasso (Polarization and Intensity CArtographer for Scanned Sky Observations), which was implemented to construct intensity and polarization maps from the Multi Frequency Instrument (MFI) of the QUIJOTE (Q-U-I Joint TEnerife) CMB polarization experiment. picasso is based on the destriping algorithm, and is suited to address specific issues of ground-based microwave observations, with a technique that allows the fit of a template function in the time domain, during the map-making step. This paper describes the picasso code, validating it with simulations and assessing its performance. For this purpose, we produced realistic simulations of the QUIJOTE-MFI survey of the northern sky (approximately ∼20 000 deg2), and analysed the reconstructed maps with picasso, using real and harmonic space statistics. We show that, for this sky area, picasso is able to reconstruct, with high fidelity, the injected signal, recovering all the scales with ℓ > 10 in TT, EE, and BB. The signal error is better than 0.001 per cent at 20 < ℓ < 200. Finally, we validated some of the methods that will be applied to the real wide-survey data, like the detection of the CMB anisotropies via cross-correlation analyses. Despite that the implementation of picasso is specific for QUIJOTE-MFI data, it could be adapted to other experiments.

79 ASTRONOMY AND ASTROPHYSICS↗

Rietveld Refinement for Macromolecular Powder Diffraction

Powder X-ray diffraction (PXRD) has been employed extensively for the structural characterization of materials, quantitative analysis of multicomponent mixtures, phase identification, texture, and microstructural analysis. At the heart of all those lies the Rietveld method, which has revolutionized the use of powder diffraction for materials studies. Initially applied to minerals and inorganics, the Rietveld method has progressively been used for more complex materials, for instance, zeolites and pharmaceuticals. A major advance of the method came some 20 years ago, when the first protein structure was successfully refined. Because of the sheer complexity of macromolecules, several new approaches and algorithms had to be pioneered or adapted from macromolecular single-crystal diffraction experiments, thus constituting macromolecular PXRD a quite unique field of study. This review aims to provide necessary elements of theory and application of structure solution and refinement via the Rietveld method for macromolecular PXRD data. Here, practical explanations and highlighted case studies are also presented.

36 MATERIALS SCIENCE↗

Overlapping grids for flow field calculations

Many problems in computational fluid dynamics (CFD) involve the calculation of flow fields within or around complex geometric configurations. The flow solution is computed on a computational grid. The construction of the grid is one of the major difficulties in the application of CFD to the analysis of flow about actual aircraft configurations. Due to geometric complexity, the grid has to be constructed in simple subregions and then all of these subgrids have to be pieced together to form a complete grid for the entire flow field. The entire grid, which is called a composite grid because it is formed from many parts, may have common regions. In either case, the computation of the flow field, using any numerical algorithm, will require the transfer of information between individual subgrids. The transfer of information is more difficult with overlapping grids. Algorithms have been developed and tested for automating the transfer of information between two overlapping grids.

Mastin, Charles Wayne↗

Spatial/Spectral Identification of Endmembers from AVIRIS Data using Mathematical Morphology

During the last several years, a number of airborne and satellite hyperspectral sensors have been developed or improved for remote sensing applications. Imaging spectrometry allows the detection of materials, objects and regions in a particular scene with a high degree of accuracy. Hyperspectral data typically consist of hundreds of thousands of spectra, so the analysis of this information is a key issue. Mathematical morphology theory is a widely used nonlinear technique for image analysis and pattern recognition. Although it is especially well suited to segment binary or grayscale images with irregular and complex shapes, its application in the classification/segmentation of multispectral or hyperspectral images has been quite rare. In this paper, we discuss a new completely automated methodology to find endmembers in the hyperspectral data cube using mathematical morphology. The extension of classic morphology to the hyperspectral domain allows us to integrate spectral and spatial information in the analysis process. In Section 3, some basic concepts about mathematical morphology and the technical details of our algorithm are provided. In Section 4, the accuracy of the proposed method is tested by its application to real hyperspectral data obtained from the Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) imaging spectrometer. Some details about these data and reference results, obtained by well-known endmember extraction techniques, are provided in Section 2. Finally, in Section 5 we expose the main conclusions at which we have arrived.

Plaza, Antonio↗

Remote Sensing of Coronal Forces During a Solar Prominence Eruption

We present a new methodology—the Keplerian Optical Dynamics Analysis (KODA)—for quantifying the dynamics of erupting magnetic structures in the solar corona. The technique involves adaptive spatiotemporal tracking of propagating intensity gradients and their characterization in terms of time-evolving Keplerian areas swept out by the position vectors of moving plasma blobs. Whereas gravity induces purely ballistic motions consistent with Kepler's second law, noncentral forces such as the Lorentz force introduce nonzero torques resulting in more complex motions. KODA algorithms enable direct evaluation of the line-of-sight component of the net torque density from the image-plane projection of the areal acceleration. The method is applied to the prominence eruption of 2011 June 7, observed by the Solar Dynamics Observatory's Atmospheric Imaging Assembly. Results obtained include quantitative estimates of the magnetic forces, field intensities, and blob masses and energies across a vast region impacted by the postreconnection redistribution of the prominence material. The magnetic pressure and energy are strongly dominant during the early, rising phase of the eruption, while the dynamic pressure and kinetic energy become significant contributors during the subsequent falling phases. Measured intensive properties of the prominence blobs are consistent with those of typical active-region prominences; measured extensive properties are compared with those of the whole pre-eruption prominence and the post-eruption coronal mass ejection of 2011 June 7, all derived by other investigators and techniques. We show that KODA provides valuable information on spatially and temporally dependent characteristics of coronal eruptions that is not readily available via alternative means, thereby shedding new light on the environment and evolution of these solar events.

V M Uritskiy↗

Cryogenic energy storage: Standalone design, rigorous optimization and techno-economic analysis

Energy storage allows flexible use and management of excess electricity and intermittently available renewable energy. Cryogenic energy storage (CES) is a promising storage alternative with a high technology readiness level and maturity, but the round-trip efficiency is often moderate and the Levelized Cost of Storage (LCOS) remains high. The complex flowsheets with intricate thermodynamics at cryogenic temperatures as well as the presence of multiple loops and refrigeration cycles pose considerable challenges for rigorous model-based design and optimization of CES systems. We present an optimization strategy that couples rigorous process simulation and Bayesian optimization with flowsheet decomposition and identification of hidden coupling constraints to optimally design standalone CES systems. Further refinement is done via a local search using the limited-memory Broyden–Fletcher–Goldfarb–Shanno algorithm. Here our results indicate that it is possible to achieve more than 52% round-trip efficiency and an LCOS of $153/MWh for a standalone 100 MW/400 MWh CES system limited to short-term storage with daily charging–discharging. However, a detailed techno-economic assessment reveals that the LCOS considering total capital investment may exceed $267/MWh when all direct and indirect costs of installation and operation are considered.

25 ENERGY STORAGE↗