Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit”

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

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

At least 1,567 records · Page 87

Towards Smart Grids Enhanced Situation Awareness: A Bi-Level Quasi-Static State Estimation Model

Smart Grid situational awareness is provided by Energy Management Systems. A core process of these systems is State Estimation. The great majority of state estimators model the Smart Grid through a set of nonlinear algebraic equations, named the measurement model. Problem formulation considers the Gauss solution. Several model improvements have been presented regarding the Gauss solution, aiming between others to provide measurement noise robustness to the state estimation process. While considerable effort has been focused on such developments, state estimation is still constrained by the implicit modelling error, and thus inevitably vulnerable to cyber-threats. In this work, a state estimation bi-level formal model is presented towards Smart Grids enhanced situational awareness considering the concepts of synthetic measurements and innovation. Comparative test results with the state-of-the-art on the IEEE 14-bus system are presented highlighting improved situational awareness to bad data. Easy-to-implement model, without hard-to-derive parameters, built-on the classic weighted least squares solution, highlight potential aspects for real-life implementation.

cyber security↗

Updating Technical Screens for PV Interconnection: Preprint

Solar photovoltaics (PV) is the dominant type of distributed generation (DG) technology interconnected to electric distribution systems in the United States, and deployment of PV systems continues to increase rapidly. Considering the rapid growth and widespread deployment of PV systems in United States electric distribution grids, it is important that interconnection procedures be as streamlinedas possible to avoid unnecessary interconnection studies, costs, and delays. Because many PV interconnection applications involve high penetration scenarios, the process needs to allow for a sufficiently rigorous technical evaluation to identify and address possible system impacts. Existing interconnection procedures are designed to balance the need for efficiency and technical rigor for all DG.However, there is an implicit expectation that those procedures will be updated over time in order to remain relevant with respect to evolving standards, technology, and practical experience. Modifications to interconnection screens and procedures must focus on maintaining or improving safety and reliability, as well as accurately allocating costs and improving expediency of the interconnectionprocess. This paper evaluates the origins and usefulness of the capacity penetration screen, offers potential short-term solutions which could effectively allow fast-track interconnection to many PV system applications, and considers longer-term solutions for increasing PV deployment levels in a safe and reliable manner while reducing or eliminating the emphasis on the penetration screen.

14 SOLAR ENERGY↗

LCOE*: Re-Thinking LCOE for Photovoltaic Systems

Solar industry is working towards reducing the levelized cost of energy (LCOE). The LCOE formulation includes various implicitly connected cost and physical design parameters. This entails complex cost analyses by economists, and electrical analysis and energy yield calculations of solar farms by device physicists/technologists. The standard formulation requires a constant exchange of information to optimize the design of a specific farm. In this paper, we present a fundamental reformulation of LCOE (in terms of LCOE*) to deconvolve the cost vs. energy yield analysis so that economists and technologists can work independently towards minimizing LCOE. We validate our LCOE* formulation by comparing LCOE calculated by the traditional vs. new method. We further provide a global analysis of LCOE* as an illustrative example. This LCOE* will accelerate new technology development (e.g. bifacial PV) by allowing a rapid and transparent analysis of its cost-performance trade-off.

14 SOLAR ENERGY↗

Accelerating Noisy VQE Optimization with Gaussian Processes

Hybrid variational quantum algorithms, which combine a classical optimizer with evaluations on a quantum chip, are the most promising candidates to show quantum advantage on current noisy, intermediate-scale quantum (NISQ) devices. The classical optimizer is required to perform well in the presence of noise in the objective function evaluations, or else it becomes the weakest link in the algorithm. We introduce the use of Gaussian Processes (GP) as surrogate models to reduce the impact of noise and to provide high quality seeds to escape local minima, whether real or noise-induced. We build this as a framework on top of local optimizations, for which we choose Implicit Filtering (ImFil) in this study. ImFil is a state-of-the-art, gradient-free method, which in comparative studies has been shown to outperform on noisy VQE problems. The result is a new method: "GP+ImFil". We show that when noise is present, the GP+ImFil approach finds results closer to the true global minimum in fewer evaluations than standalone ImFil, and that it works particularly well for larger dimensional problems. Using GP to seed local searches in a multi-modal landscape shows mixed results: although it is capable of improving on ImFil standalone, it does not do so consistently and would only be preferred over other, more exhaustive, multistart methods if resources are constrained.

Muller, Juliane↗

A Scalable Parallel Wideband MLFMA for Efficient Electromagnetic Simulations on Large Scale Clusters

The development of the multilevel fast multipole algorithm (MLFMA) and its multiscale variants have enabled the use of integral equation (IE) based solvers to compute scattering from complicated structures. Development of scalable parallel algorithms, to extend the reach of these solvers, has been a topic of intense research for about a decade. In this paper, we present a new algorithm for parallel implementation of IE solver that is augmented with a wideband MLFMA and scalable on large number of processors. The wideband MLFMA employed here, to handle multiscale problems, is a hybrid combination of the accelerated Cartesian expansion (ACE) and the classical MLFMA. The salient feature of the presented parallel algorithm is that it is implicitly load balanced and exhibits higher performance. This is achieved by developing a strategy to partition the MLFMA tree, and hence the associated computations, in a self-similar fashion among the parallel processors. As detailed in the paper, the algorithm employs both spatial and direction partitioning approaches in a flexible manner to ensure scalable performance. Plethora of results are presented here to exhibit the scalability of this algorithm on 512 and more processors.

99 GENERAL AND MISCELLANEOUS↗

Distributed Stochastic Optimization of a Neural Representation Network for Time-Space Tomography Reconstruction

4D time-space reconstruction of dynamic events or deforming objects using X-ray computed tomography (CT) is an important inverse problem in non-destructive evaluation. Conventional back-projection based reconstruction methods assume that the object remains static for the duration of several tens or hundreds of X-ray projection measurement images (reconstruction of consecutive limited-angle CT scans). However, this is an unrealistic assumption for many in-situ experiments that causes spurious artifacts and inaccurate morphological reconstructions of the object. To solve this problem, we propose to perform a 4D time-space reconstruction using a distributed implicit neural representation (DINR) network that is trained using a novel distributed stochastic training algorithm. Our DINR network learns to reconstruct the object at its output by iterative optimization of its network parameters such that the measured projection images best match the output of the CT forward measurement model. Here, we use a forward measurement model that is a function of the DINR outputs at a sparsely sampled set of continuous valued 4D object coordinates. Unlike previous neural representation architectures that forward and back propagate through dense voxel grids that sample the object's entire time-space coordinates, we only propagate through the DINR at a small subset of object coordinates in each iteration resulting in an order-of-magnitude reduction in memory and compute for training. DINR leverages distributed computation across several compute nodes and GPUs to produce high-fidelity 4D time-space reconstructions. We use both simulated parallel-beam and experimental cone-beam X-ray CT datasets to demonstrate the superior performance of our approach.

36 MATERIALS SCIENCE↗

Assessing the Impact of Corneal Refraction and Iris Tissue Non-planarity on Iris Recognition

Assumptions regarding eye morphology are implicit in iris recognition algorithms. The cornea is assumed to have little to no effect on the view of the iris texture when the eye gaze is non-frontal, the iris is assumed flat, and the eye is assumed to be imaged via an orthographic projection. If these assumptions hold, affine transformations may be used to rectify non-frontally posed images to a frontal view and the rubber sheet model may be accurately used to normalize the iris annulus to a rectangular image. This work examines how iris recognition performance degrades when the first two assumptions are violated. Using a computer renderable eye model, a data set is created varying the presence of the cornea and a parameterized non-planarity of the iris shape across a large range of eye gaze angles. Matching scores are created using a commercial matcher. Thus, when comparing the relative impact of each assumption violation, it is observed that iris non-planarity presents a more significant problem than corneal refractive distortion with regard to iris recognition accuracy in non-frontal images.

59 BASIC BIOLOGICAL SCIENCES↗

Effects of Channel Implant Variation on Radiation-Induced Edge Leakage Currents in n-Channel MOSFETs

The effects of radiation-induced defects and statistical variation in the dose and energy of MOSFET channel implants in a modern bulk CMOS technology are modeled using a process simulator in combination with analytical computations. The model integrates doping profiles obtained from process simulations and experimentally determined defect potentials into implicit surface potential equations. Solutions to these equations are then used to model radiation-induced edge leakage currents in 90-nm bulk CMOS n-channel MOSFETs. The results indicate that slight variations in the channel implant parameters can have a significant impact on the doping profile along the shallow trench isolation sidewall and thus the radiation-induced edge leakage currents.

42 ENGINEERING↗

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting path is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.

97 MATHEMATICS AND COMPUTING↗

Stacked Low-Inertia Converter or Solid-State Transformer: Modeling and Model Predictive Priority-Shifting Control for Voltage Balance

This paper presents control challenges of stacked low-inertia converter (SLIC) or cascaded reduced dc-link solid-state transformer (SST) and proposes a novel model predictive priority-shifting (MPPS) control with implicit modulator and a discrete-time large-signal model for voltage balancing and dc-link regulation. Low-inertia converters, featuring small electrolytic capacitor-less dc links, dramatically reduce cost, size, and weight compared to conventional solutions. However, without a large dc-link buffer, the input and output are tightly coupled, leading to significant control challenges. The control becomes even more challenging with these converters stacked input-series output-parallel (ISOP) for medium-voltage (MV) grid, which causes coupling between the modules besides the coupling within each module. This paper analyzes the multi-objective, multi-degree of freedom control problem, using the modular soft-switching solid-state transformer (M-S4T) as an example of the SLIC. First, distribution of control efforts under controller saturation is critical because multiple control objectives can be conflicting, especially when the module voltages are unbalanced and are being restored. The MPPS can shift the priorities to address this issue. Second, due to the low inertia and high dc-link ripple, classic space vector pulse-width modulation (SVPWM), average model with small-ripple assumption, and control design based on small-signal model cannot accurately modulate, model, and control the nonlinear reduced dc link. Therefore, a discrete-time large-signal model of the M-S4T is established to derive the predictive control in the MPPS. The MPPS and the PI control are compared in MV simulations to show the issue of applying the PI to the SLIC and the effectiveness of the MPPS for voltage balancing and dc-link regulation in a deadbeat manner. Finally, the proposed control is tested on a 5 kV ISOP SiC SST prototype to verify priority shifting to address controller saturation issue and fast and robust voltage balancing.

14 SOLAR ENERGY↗

Correlation-Aided Robust Decentralized Dynamic State Estimation of Power Systems with Unknown Control Inputs

This paper proposes a correlation-aided robust adaptive unscented Kalman filter for power system decentralized dynamic state estimation with unknown inputs, termed as robust AUKF-UI. The temporal and spatial correlations among the unknown inputs are used to derive a vector auto-regressive (VAR) model in an adaptive manner. This VAR model is further integrated together with state transition and measurement models for joint state and unknown inputs estimation. This allows taking into account the implicit cross-correlations between the states and the unknown inputs. As a result, the rank requirement for unknown input vector estimation is relaxed and the local generator frequency measurement is not required. The temporal correlations of time series innovation vectors, predicted state and input vectors are also leveraged by the robust AUKFUI to detect, identify and process bad data. Without these correlations, it is very challenging to address bad data with unknown inputs. Simulation results carried out on the IEEE 39-bus system demonstrate that the proposed robust AUKF-UI achieves much better results than other methods in the presence of low measurement redundancy, strong nonlinearity, and bad data.

Zhao, Junbo↗

Small-Signal Angle Stability-Oriented False Data Injection Cyber-Attacks on Power Systems

The small-signal angle stability (SSAS) of a power system is determined by the property of operation points. The widely applied false data injection (FDI) cyber-attack, however, is able to stealthily mislead the optimal power flow (OPF) and thus compromise operation points, leading to damages to the SSAS margin. Here, to provide insights for cyber defenders, this paper proposes and investigates a stealthy SSAS-oriented FDI cyber-attack focusing on two attacking purposes, i.e., the SSAS margin and operation cost, with higher priority on the former one. First, this paper establishes a novel bi-level model with an implicit SSAS constraint based on a structure preserving model to compromise operation points. Then, for the SSAS interarea mode in a typical two-area system, this paper formulates closed-form expressions of how the SSAS margin and operation cost behave with respect to stealthy injections. By comparison, for the SSAS local mode in general power systems, this paper proposes a moving target cyber-attack-based hierarchical solution algorithm. Simulation results on a two-area system, a Kundur 11 bus system, and a modified IEEE 14 bus system demonstrate the significant damaging effects of the proposed SSAS-oriented FDI cyber-attack and the conflict between the two attacking purposes.

Benders decomposition↗

Learning Constrained Parametric Differentiable Predictive Control Policies With Guarantees

We present differentiable predictive control (DPC), a method for offline learning of constrained neural control policies for nonlinear dynamical systems with performance guarantees. We show that the sensitivities of the parametric optimal control problem can be used to obtain direct policy gradients. Specifically, we employ automatic differentiation (AD) to efficiently compute the sensitivities of the model predictive control (MPC) objective function and constraints penalties. To guarantee safety upon deployment, we derive probabilistic guarantees on closed-loop stability and constraint satisfaction based on indicator functions and Hoeffding’s inequality. We empirically demonstrate that the proposed method can learn neural control policies for various parametric optimal control tasks. In particular, we show that the proposed DPC method can stabilize systems with unstable dynamics, track time-varying references, and satisfy nonlinear state and input constraints. Our DPC method has practical time savings compared to alternative approaches for fast and memory-efficient controller design. Specifically, DPC does not depend on a supervisory controller as opposed to approximate MPC based on imitation learning. We demonstrate that, without losing performance, DPC is scalable with greatly reduced demands on memory and computation compared to implicit and explicit MPC while being more sample efficient than model-free reinforcement learning (RL) algorithms.

97 MATHEMATICS AND COMPUTING↗

CPU Isosurface Ray Tracing of Adaptive Mesh Refinement Data

Adaptive mesh refinement (AMR) is a key technology for large-scale simulations that allows for adaptively changing the simulation mesh resolution, resulting in significant computational and storage savings. However, visualizing such AMR data poses a significant challenge due to the difficulties introduced by the hierarchical representation when reconstructing continuous field values. Here, we detail a comprehensive solution for interactive isosurface rendering of block-structured AMR data. We contribute a novel reconstruction strategy—the octant method—which is continuous, adaptive and simple to implement. Furthermore, we present a generally applicable hybrid implicit isosurface ray-tracing method, which provides better rendering quality and performance than the built-in sampling-based approach in OSPRay. Finally, we integrate our octant method and hybrid isosurface geometry into OSPRay as a module, providing the ability to create high-quality interactive visualizations combining volume and isosurface representations of BS-AMR data. Lastly, we evaluate the rendering performance, memory consumption and quality of our method on two gigascale block-structured AMR datasets.

97 MATHEMATICS AND COMPUTING↗

Distributed Neural Representation for Reactive In Situ Visualization

Implicit neural representations (INRs) have emerged as a powerful tool for compressing large-scale volume data. This opens up new possibilities for in situ visualization. However, the efficient application of INRs to distributed data remains an underexplored area. Here, in this work, we develop a distributed volumetric neural representation and optimize it for in situ visualization. Our technique eliminates data exchanges between processes, achieving state-of-the-art compression speed, quality and ratios. Our technique also enables the implementation of an efficient strategy for caching large-scale simulation data in high temporal frequencies, further facilitating the use of reactive in situ visualization in a wider range of scientific problems. We integrate this system with the Ascent infrastructure and evaluate its performance and usability using real-world simulations.

Wu, Qi↗

F-Hash: Feature-Based Hash Design for Time-Varying Volume Visualization via Multi-Resolution Tesseract Encoding

Interactive time-varying volume visualization is challenging due to its complex spatiotemporal features and sheer size of the dataset. Recent works transform the original discrete time-varying volumetric data into continuous Implicit Neural Representations (INR) to address the issues of compression, rendering, and super-resolution in both spatial and temporal domains. However, training the INR takes a long time to converge, especially when handling large-scale time-varying volumetric datasets. In this work, we proposed F-Hash, a novel feature-based multi-resolution Tesseract encoding architecture to greatly enhance the convergence speed compared with existing input encoding methods for modeling time-varying volumetric data. The proposed design incorporates multi-level collision-free hash functions that map dynamic 4D multi-resolution embedding grids without bucket waste, achieving high encoding capacity with compact encoding parameters. Our encoding method is agnostic to time-varying feature detection methods, making it a unified encoding solution for feature tracking and evolution visualization. Experiments show the F-Hash achieves state-of-the-art convergence speed in training various time-varying volumetric datasets for diverse features. We also proposed an adaptive ray marching algorithm to optimize the sample streaming for faster rendering of the time-varying neural representation.

deep learning↗

A Numerical Study of Hypoxia in Chesapeake Bay Using an Unstructured Grid Model: Validation and Sensitivity to Bathymetry Representation

A three-dimensional unstructured-grid hydrodynamic and water quality model (Semi-implicit Cross-scale Hydroscience Intergrated System Model-Integrated Compartment Model) is applied successfully for Chesapeake Bay. The model is validated with observations of salinity, chlorophyll-a, dissolved oxygen, nutrients, and phytoplankton productions from the year 1991 to 1995 for the mainstem and some major tributaries, based on multiple model skill scores. Model experiments are conducted to test the importance of having (1) an accurate representation of bathymetry to correctly predict hypoxia and other processes and (2) a high-resolution model grid for tributaries to correctly simulate water quality variables. Further, comparison with the model experiment results with bathymetry smoothing indicates that bathymetry smoothing, as commonly used for many systems, changes the stratification and lateral circulation pattern, resulting in more salt intrusion into shallow water regions, and an increase in the freshwater age. Consequently, a model with bathymetry smoothing can lead to an unrealistic prediction of the distribution of hypoxia and phytoplankton production. Local grid refinement shows significant improvement of model simulations on local stratification and water quality variables. Overall, the use of high-resolution unstructured grid model leads to a faithful representation of the complex geometry, and thus a seamless cross-scale capability for simulating water quality processes in the Bay including tributaries and tidal creeks.

54 ENVIRONMENTAL SCIENCES↗