Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “variational algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

A new method of presentation the large-scale magnetic field structure on the Sun and solar corona

The large-scale photospheric magnetic field, measured at Stanford, has been analyzed in terms of surface harmonics. Changes of the photospheric field which occur within whole solar rotation period can be resolved by this analysis. For this reason we used daily magnetograms of the line-of-sight magnetic field component observed from Earth over solar disc. We have estimated the period during which day-to-day full disc magnetograms must be collected. An original algorithm was applied to resolve time variations of spherical harmonics that reflect time evolution of large-scale magnetic field within solar rotation period. This method of magnetic field presentation can be useful enough in lack of direct magnetograph observations due to sometimes bad weather conditions. We have used the calculated surface harmonics to reconstruct the large-scale magnetic field structure on the source surface near the sun - the origin of heliospheric current sheet and solar wind streams. The obtained results have been compared with spacecraft in situ observations and geomagnetic activity. We tried to show that proposed technique can trace shon-time variations of heliospheric current sheet and short-lived solar wind streams. We have compared also our results with those obtained traditionally from potential field approximation and extrapolation using synoptic charts as initial boundary conditions.

Ponyavin, D. I.↗
NASA NTRS2014

Carbon Monitoring System Flux Estimation and Attribution: Impact of ACOS-GOSAT X(CO2) Sampling on the Inference of Terrestrial Biospheric Sources and Sinks

Using an Observing System Simulation Experiment (OSSE), we investigate the impact of JAXA Greenhouse gases Observing SATellite 'IBUKI' (GOSAT) sampling on the estimation of terrestrial biospheric flux with the NASA Carbon Monitoring System Flux (CMS-Flux) estimation and attribution strategy. The simulated observations in the OSSE use the actual column carbon dioxide (X(CO2)) b2.9 retrieval sensitivity and quality control for the year 2010 processed through the Atmospheric CO2 Observations from Space algorithm. CMS-Flux is a variational inversion system that uses the GEOS-Chem forward and adjoint model forced by a suite of observationally constrained fluxes from ocean, land and anthropogenic models. We investigate the impact of GOSAT sampling on flux estimation in two aspects: 1) random error uncertainty reduction and 2) the global and regional bias in posterior flux resulted from the spatiotemporally biased GOSAT sampling. Based on Monte Carlo calculations, we find that global average flux uncertainty reduction ranges from 25% in September to 60% in July. When aggregated to the 11 land regions designated by the phase 3 of the Atmospheric Tracer Transport Model Intercomparison Project, the annual mean uncertainty reduction ranges from 10% over North American boreal to 38% over South American temperate, which is driven by observational coverage and the magnitude of prior flux uncertainty. The uncertainty reduction over the South American tropical region is 30%, even with sparse observation coverage. We show that this reduction results from the large prior flux uncertainty and the impact of non-local observations. Given the assumed prior error statistics, the degree of freedom for signal is approx.1132 for 1-yr of the 74 055 GOSAT X(CO2) observations, which indicates that GOSAT provides approx.1132 independent pieces of information about surface fluxes. We quantify the impact of GOSAT's spatiotemporally sampling on the posterior flux, and find that a 0.7 gigatons of carbon bias in the global annual posterior flux resulted from the seasonally and diurnally biased sampling when using a diagonal prior flux error covariance.

biased sampling↗
NASA NTRS2018

An Algorithm for Trajectory Generation in Redundant Manipulators with Joint Transmission Accommodation

Trajectory generation for manipulators involves generating incremental updates of joint variables to achieve a desired end–effector motion. The Jacobian matrix maps incremental joint motion to incremental end–effector motion in a linear fashion and is typically used in manipulator trajectory generation algorithms. In the case of a redundant manipulator, the Jacobian matrix is not square or invertible and therefore algorithms based on pseudoinverses and their variations are commonly used for trajectory generation. These methods either are computationally not efficient or do not utilize all the joints in motion generation and therefore do not completely exploit the redundancy of the manipulator. The method presented in this paper is a simple method that maximizes transmission of all joint variables onto a desired end–effector motion trajectory. The method is based on aligning the null–space of an augmented Jacobian matrix with the path of the desired end–effector motion, from which a linear combination of joints that projects fully onto the desired end–effector trajectory is obtained. In this manner, all joints of the redundant manipulator are used to generate the end–effector trajectory accommodating the ability of each joint in terms of its motion transmission.

Ravani, Bahram↗
NASA NTRSDate not supplied

Quantifying Effects of Departure and Flight Time Uncertainty on Urban Air Mobility Operations

Demand capacity balancing is a key mechanism for maintaining safe and efficient Urban Air Mobility (UAM) operations. However, uncertainties such as departure delays and flight time variation may reduce the effectiveness of algorithms used for balancing and detrimentally impact the safety and efficiency of UAM operations. In this paper, the effects of these uncertainties on UAM operations are quantified by modeling a distribution of departure and flight time errors. A route network in the Dallas/Fort Worth metropolitan area was used to simulate traffic demand with and without uncertainty. Simulations were conducted with three main models of uncertainty – first uncertainty in departure time delay resulting in late takeoffs, second with uncertainty in flight times in addition to departure delays, and finally, uncertainty in departure times that cause either late or early takeoffs. Each of these simulations were performed using varied standard deviations to fully understand the effects of uncertainties. Results from these simulations were compared to a baseline simulation using the same parameters, but without any uncertainty. The results suggest that both safety and efficiency are significantly impacted by uncertainty even with relatively low uncertainty introduced. These results work towards quantifying the effects of uncertainty in flight scheduling for UAM. They will also aid in the further development of the demand capacity balancing algorithms for UAM operations and associated air traffic management.

Urban Air Mobility↗
NASA NTRSDate not supplied

Quantifying the Effects of Departure and Flight Time Uncertainty on Urban Air Mobility Operations

Demand capacity balancing is a key mechanism for maintaining safe and efficient Urban Air Mobility (UAM) operations. However, uncertainties such as departure delays and flight time variation may reduce the effectiveness of algorithms used for balancing and detrimentally impact the safety and efficiency of UAM operations. In this paper, the effects of these uncertainties on UAM operations are quantified by modeling a distribution of departure and flight time errors. A route network in the Dallas/Fort Worth metropolitan area was used to simulate traffic demand with and without uncertainty. Simulations were conducted with three main models of uncertainty – first uncertainty in departure time delay resulting in late takeoffs, second with uncertainty in flight times in addition to departure delays, and finally, uncertainty in departure times that cause either late or early takeoffs. Each of these simulations were performed using varied standard deviations to fully understand the effects of uncertainties. Results from these simulations were compared to a baseline simulation using the same parameters, but without any uncertainty. The results suggest that both safety and efficiency are significantly impacted by uncertainty even with relatively low uncertainty introduced. These results work towards quantifying the effects of uncertainty in flight scheduling for UAM. They will also aid in the further development of the demand capacity balancing algorithms for UAM operations and associated air traffic management.

Urban Air Mobility↗
DOE OSTI2023

Fast and efficient identification of anomalous galaxy spectra with neural density estimation

ABSTRACT Current large-scale astrophysical experiments produce unprecedented amounts of rich and diverse data. This creates a growing need for fast and flexible automated data inspection methods. Deep learning algorithms can capture and pick up subtle variations in rich data sets and are fast to apply once trained. Here, we study the applicability of an unsupervised and probabilistic deep learning framework, the probabilistic auto-encoder, to the detection of peculiar objects in galaxy spectra from the SDSS survey. Different to supervised algorithms, this algorithm is not trained to detect a specific feature or type of anomaly, instead it learns the complex and diverse distribution of galaxy spectra from training data and identifies outliers with respect to the learned distribution. We find that the algorithm assigns consistently lower probabilities (higher anomaly score) to spectra that exhibit unusual features. For example, the majority of outliers among quiescent galaxies are E+A galaxies, whose spectra combine features from old and young stellar population. Other identified outliers include LINERs, supernovae, and overlapping objects. Conditional modelling further allows us to incorporate additional information. Namely, we evaluate the probability of an object being anomalous given a certain spectral class, but other information such as metrics of data quality or estimated redshift could be incorporated as well. We make our code publicly available.

Böhm, Vanessa↗
NASA NTRS1997

Ultrasound Algorithm Derivation for Soil Moisture Content Estimation

Soil moisture content can be estimated by evaluating the velocity at which sound waves travel through a known volume of solid material. This research involved the development of three soil algorithms relating the moisture content to the velocity at which sound waves moved through dry and moist media. Pressure and shear wave propagation equations were used in conjunction with soil property descriptions to derive algorithms appropriate for describing the effects of moisture content variation on the velocity of sound waves in soils with and without complete soil pore water volumes, An elementary algorithm was used to estimate soil moisture contents ranging from 0.08 g/g to 0.5 g/g from sound wave velocities ranging from 526 m/s to 664 m/s. Secondary algorithms were also used to estimate soil moisture content from sound wave velocities through soils with pores that were filled predominantly with air or water.

Belisle, W.R.↗
NASA NTRS1992

Robust control algorithms for Mars aerobraking

Four atmospheric guidance concepts have been adapted to control an interplanetary vehicle aerobraking in the Martian atmosphere. The first two offer improvements to the Analytic Predictor Corrector (APC) to increase its robustness to density variations. The second two are variations of a new Liapunov tracking exit phase algorithm, developed to guide the vehicle along a reference trajectory. These four new controllers are tested using a six degree of freedom computer simulation to evaluate their robustness. MARSGRAM is used to develop realistic atmospheres for the study. When square wave density pulses perturb the atmosphere all four controllers are successful. The algorithms are tested against atmospheres where the inbound and outbound density functions are different. Square wave density pulses are again used, but only for the outbound leg of the trajectory. Additionally, sine waves are used to perturb the density function. The new algorithms are found to be more robust than any previously tested and a Liapunov controller is selected as the most robust control algorithm overall examined.

Shipley, Buford W., Jr.↗
DOE OSTI2022

An Information Theoretic Approach to Identify Dominant Voltage Influencers for Unbalanced Distribution Systems

Smart distribution grid with multiple renewable energy sources can experience random voltage fluctuations due to variable generation, which may result in voltage violations. Traditional voltage control algorithms are inadequate to handle fast voltage variations. Therefore, new dynamic control methods are being developed that can significantly benefit from the knowledge of dominant voltage influencer (DVI) nodes. DVI nodes for a particular node of interest refer to nodes that have a relatively high impact on the voltage fluctuations at that node. Conventional power flow-based algorithms to identify DVI nodes are computationally complex, which limits their use in real-time applications. This paper proposes a novel information theoretic voltage influencing score (VIS) that quantifies the voltage influencing capacity of nodes with DERs/active loads in a three phase unbalanced distribution system. VIS is then employed to rank the nodes and identify the DVI set. VIS is derived analytically in a computationally efficient manner and its efficacy to identify DVI nodes is validated using the IEEE 37-node test system. It is shown through experiments that KL divergence and Bhattacharyya distance are effective indicators of DVI nodes with an identifying accuracy of more than 90%. Additionally, the computation burden is also reduced by an order of 5, thus providing the foundation for efficient voltage control.

42 ENGINEERING↗
NASA NTRS2006

When is Constrained Clustering Beneficial, and Why?

Several researchers have shown that constraints can improve the results of a variety of clustering algorithms. However, there can be a large variation in this improvement, even for a fixed number of constraints for a given data set. We present the first attempt to provide insight into this phenomenon by characterizing two constraint set properties: informativeness and coherence. We show that these measures can help explain why some constraint sets are more beneficial to clustering algorithms than others. Since they can be computed prior to clustering, these measures can aid in deciding which constraints to use in practice.

clustering algorithms↗
NASA NTRS1990

Rocket engine failure detection using system identification techiques

The theoretical foundation and application of two univariate failure detection algorithms to Space Shuttle Main Engine (SSME) test firing data is presented. Both algorithms were applied to data collected during steady state operation of the engine. One algorithm, the time series algorithm, is based on time series techniques and involves the computation of autoregressive models. Times series techniques have been previously applied to SSME data. The second algorithm is based on standard signal processing techniques. It consists of tracking the variations in the average signal power with time. The average signal power algorithm is a newly proposed SSME failure detection algorithm. Seven nominal test firings were used to develop failure indication thresholds for each algorithm. These thresholds were tested using four anomalous firings and one additional nominal firing. Both algorithms provided significantly earlier failure indication times than did the current redline limit system. Neither algorithm gave false failure indications for the nominal firing. The strengths and weaknesses of the two algorithms are discussed and compared. The average signal algorithm was found to have several advantages over the time series algorithm.

Meyer, Claudia M.↗
NASA NTRS1990

Rocket engine failure detection using system identification techniques

The theoretical foundation and application of two univariate failure detection algorithms to Space Shuttle Main Engine (SSME) test firing data is presented. Both algorithms were applied to data collected during steady state operation of the engine. One algorithm, the time series algorithm, is based on time series techniques and involves the computation of autoregressive models. Time series techniques have been previously applied to SSME data. The second algorithm is based on standard signal processing techniques. It consists of tracking the variations in the average signal power with time. The average signal power algorithm is a newly proposed SSME failure detection algorithm. Seven nominal test firings were used to develop failure indication thresholds for each algorithm. These thresholds were tested using four anomalous firings and one additional nominal firing. Both algorithms provided significantly earlier failure indication times than did the current redline limit system. Neither algorithm gave false failure indications for the nominal firing. The strengths and weaknesses of the two algorithms are discussed and compared. The average signal algorithm was found to have several advantages over the time series algorithm.

Meyer, Claudia M.↗
DOE OSTI2026

Quantum Solver Using Singular Value Decomposition for Computational Fluid Dynamics

Numerical solutions for fluid flow problems are challenging and have been focus of Computational Fluid Dynamics (CFD) research for past several decades. The advent of quantum computing promises exponential speedup in comparison to existing classical methods and alleviate computational constraints posed by CFD problems. Although solutions for most problems of interest in fluid dynamics using quantum computing are distant, recent advances in algorithms, software and hardware provide a path towards realizing this goal. Quantum linear solver algorithms (QLSA) such as Harrow–Hassidim–Lloyd (HHL) and Variational Quantum Linear Solver (VQLS) have been successfully implemented to solve for canonical problems such as Hele-Shaw flow. However, these algorithms still suffer to scale and address problems with ill-conditioned Jacobians. In the current paper, we alleviate these restrictions with a new quantum solver based on Singular Value Decomposition (SVD) and simulate flow past a 2D cylinder. The fidelity of the SVD based quantum solver in predicting the flow past 2D cylinder is computed along with an assessment of errors. Classical and quantum solutions for the flow are compared for different resolutions. Finally, we discuss variation in the solutions based on number of shots used.

Gottiparthi, Kalyan [ORNL] (ORCID:0000000213540255↗
DOE OSTI2024

Red-QAOA: Efficient Variational Optimization through Circuit Reduction

The Quantum Approximate Optimization Algorithm (QAOA) provides a quantum solution for combinatorial optimization problems. However, the optimal parameter searching process of QAOA is greatly affected by noise, leading to non-optimal solutions. This paper introduces a novel approach to optimize QAOA by exploiting the energy landscape concentration of similar instances via graph reduction, thus addressing the effect of noise. We formalize the notion of similar instances in QAOA and develop a Simulated Annealing-based graph reduction algorithm, called Red-QAOA, to identify the most similar subgraph for efficient parameter optimization. Red-QAOA outperforms state-of-the-art Graph Neural Network (GNN) based graph pooling techniques in performance and demonstrates effectiveness on a diverse set of real-world optimization problems encompassing 3200 graphs. Red-QAOA reduced the node counts and edge counts by 28% and 37%, respectively, while maintaining a low mean square error of 2%. These enable the identification of an optimal parameter set that is closer to the ideal true optimal solution in the presence of noise. By substantially streamlining the search for QAOA parameters, our approach sets the stage for the practical application of quantum algorithms in solving complex optimization problems.

Wang, Meng↗
DOE OSTI2024

Cy-Phy ADS: Cyber Physical Anomaly Detection Framework for EV Charging Systems

Today’s large-scale Electric Vehicle (EV) infrastructures are heavily dependent on information communication technologies to maintain their operation and to support communication within sub-system components as well as the outside world. These technologies are vulnerable to various cyber and physical threats. Timely identification and mitigation of these threats are critical for improving human safety, avoiding economic losses, and preventing catastrophic system failures. By addressing this, our work presents a ResNet Autoencoder (AE) based Cyber-Physical Anomaly Detection System (Cy-Phy ADS) for detecting anomalies in EV Controller Area Network (CAN) protocol communication. It consists of four main components: Cyber-Physical Feature Extractor, ResNet AE-based Anomaly Detection Framework, Cyber-Physical Health Metric (CPHM), and Visualization Dashboard. The presented framework was trained and tested using CAN data collected from the EV charging system testbed at the Idaho National Laboratory. The presented Cy-Phy ADS compared against six widely used unsupervised anomaly detection algorithms: One Class Support Vector Machine (OCSVM), Variational Autoencoder (VAE), LSTM Autoencoder (LSTM AE), Isolation Forest (IForest), Principle Component Analysis (PCA) and Local Outlier Factor (LOF). Here the presented approach showed the highest accuracy among the compared methods. Further, the proposed approach showed comparable performance in terms of precision, F1, and False positive rate. It also showed the lowest training and inference time compared to the neural network-based baseline algorithms compared against with. Additionally, the Cy-Phy ADS has advantages such as unsupervised training, the ability to provide a holistic metric for system health characterization, and non-linear feature extraction.

99 GENERAL AND MISCELLANEOUS↗
NASA NTRS1991

A Lagrange multiplier based divide and conquer finite element algorithm

A novel domain decomposition method based on a hybrid variational principle is presented. Prior to any computation, a given finite element mesh is torn into a set of totally disconnected submeshes. First, an incomplete solution is computed in each subdomain. Next, the compatibility of the displacement field at the interface nodes is enforced via discrete, polynomial and/or piecewise polynomial Lagrange multipliers. In the static case, each floating subdomain induces a local singularity that is resolved very efficiently. The interface problem associated with this domain decomposition method is, in general, indefinite and of variable size. A dedicated conjugate projected gradient algorithm is developed for solving the latter problem when it is not feasible to explicitly assemble the interface operator. When implemented on local memory multiprocessors, the proposed methodology requires less interprocessor communication than the classical method of substructuring. It is also suitable for parallel/vector computers with shared memory and compares favorably with factorization based parallel direct methods.

Farhat, C.↗
NASA NTRS2000

Neocortical malformation as consequence of nonadaptive regulation of neuronogenetic sequence

Variations in the structure of the neocortex induced by single gene mutations may be extreme or subtle. They differ from variations in neocortical structure encountered across and within species in that these "normal" structural variations are adaptive (both structurally and behaviorally), whereas those associated with disorders of development are not. Here we propose that they also differ in principle in that they represent disruptions of molecular mechanisms that are not normally regulatory to variations in the histogenetic sequence. We propose an algorithm for the operation of the neuronogenetic sequence in relation to the overall neocortical histogenetic sequence and highlight the restriction point of the G1 phase of the cell cycle as the master regulatory control point for normal coordinate structural variation across species and importantly within species. From considerations based on the anatomic evidence from neocortical malformation in humans, we illustrate in principle how this overall sequence appears to be disrupted by molecular biological linkages operating principally outside the control mechanisms responsible for the normal structural variation of the neocortex. MRDD Research Reviews 6:22-33, 2000. Copyright 2000 Wiley-Liss, Inc.

Review↗
NASA NTRS2007

Real-Time Application of Multi-Satellite Precipitation Analysis for Floods and Landslides

Satellite data acquired and processed in real time now have the potential to provide the spacetime information on rainfall needed to monitor flood and landslide events around the world. This can be achieved by integrating the satellite-derived forcing data with hydrological models and landslide algorithms. Progress in using the TRMM Multi-satellite Precipitation Analysis (TMPA) as input to flood and landslide forecasts is outlined, with a focus on understanding limitations of the rainfall data and impacts of those limitations on flood/landslide analyses. Case studies of both successes and failures will be shown, as well as comparison with ground comparison data sets-- both in terms of rainfall and in terms of flood/landslide events. In addition to potential uses in real-time, the nearly ten years of TMPA data allow retrospective running of the models to examine variations in extreme events. The flood determination algorithm consists of four major components: 1) multi-satellite precipitation estimation; 2) characterization of land surface including digital elevation from NASA SRTM (Shuttle Radar Terrain Mission), topography-derived hydrologic parameters such as flow direction, flow accumulation, basin, and river network etc.; 3) a hydrological model to infiltrate rainfall and route overland runoff; and 4) an implementation interface to relay the input data to the models and display the flood inundation results to potential users and decision-makers, In terms of landslides, the satellite rainfall information is combined with a global landslide susceptibility map, derived from a combination of global surface characteristics (digital elevation topography, slope, soil types, soil texture, and land cover classification etc.) using a weighted linear combination approach. In those areas identified as "susceptible" (based on the surface characteristics), landslides are forecast where and when a rainfall intensity/duration threshold is exceeded. Results are described indicating general agreement with landslide occurrences.

Adler, Robert↗