Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 109 records · Page 6

Structure Learning and Statistical Estimation in Distribution Networks - Part II

Limited placement of real-time monitoring devices in the distribution grid, recent trends notwithstanding, has prevented the easy implementation of demand-response and other smart grid applications. Part I of this paper discusses the problem of learning the operational structure of the grid from nodal voltage measurements. In this work (Part II), the learning of the operational radial structure is coupled with the problem of estimating nodal consumption statistics and inferring the line parameters in the grid. Based on a Linear-Coupled(LC) approximation of AC power flows equations, polynomial time algorithms are designed to identify the structure and estimate nodal load characteristics and/or line parameters in the grid using the available nodal voltage measurements. Then the structure learning algorithm is extended to cases with missing data, where available observations are limited to a fraction of the grid nodes. The efficacy of the presented algorithms are demonstrated through simulations on several distribution test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Parallel-in-Time Multigrid Approach to Constrained Optimization

Valuable computer simulations such as weather prediction, traffic flow, and resource allocation are time dependent problems. One such example is the viscous Burgers’ equation which can model various systems such as fluids and traffic flow. Further, many of these models require optimization routines to meet the needs of many businesses. Unfortunately, traditional sequential-in-time algorithms have become bottlenecks in solution model generation. This is because computer architectures have begun to rely more and more on concurrency (parallel processing) as opposed to processor power to provide greater performance. To avoid this bottleneck, many researchers use parallelization methods to take advantage of the increasing number of processors in computers. This approach allows for variables in a problem to be solved for simultaneously. As such, parallelization is a crucial requirement to achieve high-performance computing.

97 MATHEMATICS AND COMPUTING↗

Strategy to Develop a Control Scheme for Core Thermal Performance Optimization

This report outlines a three-year research plan for optimizing reactor core thermal performance through use of a Digital Twin (DT) model and a set of neutron detectors to correspondingly adapt the reactor control strategy. It identifies reactor features and achievable neutron measurements that factor into this optimization task. It considers spatial effects that are important and how they can be managed by a real-time algorithm that controls reactivity actuators. The report presents a set of tasks, along with corresponding methods, for accomplishing this objective. The final task in this set is to validate the combined optimization procedure in the Purdue University’s PUR-1 reactor, for which we have an agreement of understanding. Additionally, we describe an alternative approach for overcoming some of the limitations inherent in the above approach, which includes the computational costs of high-fidelity simulations and achievable integration of neutron measurements into the DT. The proposed algorithms lower the technology readiness level (TRL) of the overall approach as some additional analysis and the development of a new neutron detector concept are necessary. In particular, a sensor measuring the gradient of the neutron flux is required, and the prototype is expected to be validated in the PUR-1 reactor. The potential benefits and the opportunity to significantly push forward the state-of-the-art make this approach worthy of further exploration in the upcoming years.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Exploring AI/ML-based Real-time Anomaly Detection in DUNE for Supernova Burst Neutrinos

The Deep Underground Neutrino Experiment (DUNE) is currently under construction with far detectors consisting of 4 liquid argon time projection chamber (LArTPC) modules at SURF (South Dakota Underground Research Facility) and a near detector complex with neutrino beam production at Fermilab to unambiguously determine neutrino mass ordering, to discover and precisely measure Charge-Parity (CP) violation phase in leptonic sector, to search for Beyond Stand Model (BSM) physics, and to study solar and supernova burst neutrinos. Anomalies in this project are classified in three categories: new physics signals, supernova burst neutrinos, and detector malfunction. We report here on promising early studies toward an Artificial Intelligence/Machine Learning-based real-time anomaly detection system, using a prototype autoencoder model currently under development. Additionally, the current status of an improved model and its performance will be presented. The model will be evaluated not only for its sensitivity to supernova neutrinos, but also to BSM physics signals and detector malfunctions. We will also consider how such a real-time algorithm might be used in DUNE.

de Jonge, Anselm [Kirchhoff Inst. Phys.] (ORCID:00↗

Ripple-Type Voltage Control for Extreme-Event Contingencies: Preprint

Frequent and intense extreme events make grid operation unprecedentedly challenging. Disruptive events could lead to dangerous voltage drops and even voltage collapse if corrective actions are not quickly taken. In this paper, we present a real-time algorithm for voltage control suitable for mitigating electric grid damage scenarios. In our strategy, when agents (generators, substations) experience a dangerous undervoltage, they first respond locally. When the local control resources are depleted, agents seek assistance from peer nodes over a communication network. The algorithm is simulated on a realistic test transmission system. Using fragility curve methodology, we simulate hurricane damages to the components of the synthetic 2000-bus grid representing the ERCOT system. Although being tested over a damaged grid after a hurricane event, our algorithm can be equally successfully applied to any other emergency low-voltage situation.

extreme weather events↗

Multiresolution GPC-Structured Control of a Single-Loop Cold-Flow Chemical Looping Testbed

Chemical looping is a near-zero emission process for generating power from coal. It is based on a multi-phase gas-solid flow and has extremely challenging nonlinear, multi-scale dynamics with jumps, producing large dynamic model uncertainty, which renders traditional robust control techniques, such as linear parameter varying H ∞ design, largely inapplicable. This process complexity is addressed in the present work through the temporal and the spatiotemporal multiresolution modeling along with the corresponding model-based control laws. Namely, the nonlinear autoregressive with exogenous input model structure, nonlinear in the wavelet basis, but linear in parameters, is used to identify the dominant temporal chemical looping process dynamics. The control inputs and the wavelet model parameters are calculated by optimizing a quadratic cost function using a gradient descent method. The respective identification and tracking error convergence of the proposed self-tuning identification and control schemes, the latter using the unconstrained generalized predictive control structure, is separately ascertained through the Lyapunov stability theorem. The rate constraint on the control signal in the temporal control law is then imposed and the control topology is augmented by an additional control loop with self-tuning deadbeat controller which uses the spatiotemporal wavelet riser dynamics representation. The novelty of this work is three-fold: (1) developing the self-tuning controller design methodology that consists in embedding the real-time tunable temporal highly nonlinear, but linearly parametrizable, multiresolution system representations into the classical rate-constrained generalized predictive quadratic optimal control structure, (2) augmenting the temporal multiresolution loop by a more complex spatiotemporal multiresolution self-tuning deadbeat control loop, and (3) demonstrating the effectiveness of the proposed methodology in producing fast recursive real-time algorithms for controlling highly uncertain nonlinear multiscale processes. The latter is shown through the data from the implemented temporal and augmented spatiotemporal solutions of a difficult chemical looping cold flow tracking control problem.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Implementation of Dynamic Extensible Adaptive Locally Exchangeable Measures (IDEALEM) v 0.1

Handling large streaming data is essential for various applications such as network traffic analysis, social networks, energy cost trends, and environment modeling. However, it is in general intractable to store, compute, search, and retrieve large streaming data. This software addresses a fundamental issue, which is to reduce the size of large streaming data and still obtain accurate statistical analysis. As an example, when a high-speed network such as 100 Gbps network is monitored, the collected measurement data rapidly grows so that polynomial time algorithms (e.g., Gaussian processes) become intractable. One possible solution to reduce the storage of vast amounts of measured data is to store a random sample, such as one out of 1000 network packets. However, such static sampling methods (linear sampling) have drawbacks: (1) it is not scalable for high-rate streaming data, and (2) there is no guarantee of reflecting the underlying distribution. In this software, we implemented a dynamic sampling algorithm, based on the recent technology from the relational dynamic bayesian online locally exchangeable measures, that reduces the storage of data records in a large scale, and still provides accurate analysis of large streaming data. The software can be used for both online and offline data records.

Sim, Alex↗

Distributed Parareal in Time with Adaptive Coarse Solver for Large Scale Power System Simulations

This paper describes a distributed Parareal in time algorithm with the adaptive coarse solver. In the distributed algorithm, the propagation of a coarse solution is distributed among processors in addition to the fine solution propagation. In the adaptive coarse solver the complexity of the model is changed based on the size of generator rotor angle deviation. In addition, non-iterative approach to model a ZIP load is presented. The proposed method is tested on the large-scale 5617-machine 70285-bus Eastern Interconnection system.

Osipov, Denis↗

A First-order Prediction-Correction Algorithm for Time-varying (Constrained) Optimization: Preprint

This paper focuses on the design of online algorithms based on prediction-correction steps to track the optimal solution of a time-varying constrained problem. Existing prediction-correction methods have been shown to work well for unconstrained convex problems and for settings where obtaining the inverse of the Hessian of the cost function can be computationally affordable. The prediction-correction algorithm proposed in this paper addresses the limitations of existing methods by tackling constrained problems and by designing a first-order prediction step that relies on the Hessian of the cost function (and do not require the computation of its inverse). Analytical results are established to quantify the tracking error. Numerical simulations corroborate the analytical results and showcase performance and benefits of the algorithms.

97 MATHEMATICS AND COMPUTING↗

Algorithm for precision subsample timing between Gaussian-like pulses

Moderately priced oscilloscopes available for the NIF power sensors and target diagnostics have 6 GHz bandwidths at 20-25 Gsamples/s (40 ps sample spacing). Some NIF experiments require cross timing between instruments be determined with accuracy better than 30 ps. A simple analysis algorithm for Gaussian-like pulses such as the 100-ps-wide NIF timing fiducial can achieve single-event cross-timing precision of 1 ps (1/50 of the sample spacing). The midpoint-timing algorithm is presented along with simulations that show why the technique produces good timing results. Optimum pulse width is found to be {approx}2.5 times the sample spacing. Experimental measurements demonstrate use of the technique and highlight the conditions needed to obtain optimum timing performance.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Comparison of Real-Time Pressure Rail Selection Algorithms for the Hybrid Hydraulic Electric Architecture: Case Study on a Track Loader

Abstract The hybrid hydraulic electric architecture (HHEA) seeks to combine the high power/torque/force density of hydraulics with the efficiency of electric machines. A set of common pressure rails is used to provide a majority of the power and this power is modulated by small electric machines to provide precise control for the operator. The HHEA has been studied in previous work using off-line dynamic programming optimization to determine energy efficient pressure rail selections, but this approach requires drive cycle information apriori. A Lagrange multiplier method has also been investigated where a set of gains (Lagrange multipliers) are optimized off-line with the idea the these gains, once determined, could be used for real-time operation. In this work, three new real-time pressure rail selection algorithms that do not require future drive cycle information are investigated; greedy, torque minimizing, and thresholding. The greedy control is found to only use 1% more energy than the globally optimal dynamic programming solution; but a model of energy loss is required.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. Here, we establish communication lower bounds that determine how much data movement is required (under mild conditions) to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that, with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations when the input and output tensors vary greatly in size.

HBL-inequalities↗

Convex Decreasing Algorithms: Distributed Synthesis and Finite-Time Termination in Higher Dimension

Here we establish finite time termination algorithms for consensus algorithms based on geometric properties that yield finite-time guarantees, suited for use in high dimension and in the absence of a central authority. These pursuits motivate a new peer to peer convex hull algorithm which is utilized for one stopping algorithm. Further an alternative lightweight norm based stopping criteria is also developed. The practical utility of the algorithm is illustrated through MATLAB simulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An exponential time 2-approximation algorithm for bandwidth

The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by at most b. In this paper, we present a 2-approximation algorithm for the Bandwidth problem that takes worst-case {Omicron}(1.9797{sup n}) = {Omicron}(3{sup 0.6217n}) time and uses polynomial space. This improves both the previous best 2- and 3-approximation algorithms of Cygan et al. which have an {Omicron}*(3{sup n}) and {Omicron}*(2{sup n}) worst-case time bounds, respectively. Our algorithm is based on constructing bucket decompositions of the input graph. A bucket decomposition partitions the vertex set of a graph into ordered sets (called buckets) of (almost) equal sizes such that all edges are either incident on vertices in the same bucket or on vertices in two consecutive buckets. The idea is to find the smallest bucket size for which there exists a bucket decomposition. The algorithm uses a simple divide-and-conquer strategy along with dynamic programming to achieve this improved time bound.

97 MATHEMATICS AND COMPUTING↗

Note: Ultrasonic gas flowmeter based on optimized time-of-flight algorithms

A new digital signal processor based single path ultrasonic gas flowmeter is designed, constructed, and experimentally tested. To achieve high accuracy measurements, an optimized ultrasound driven method of incorporation of the amplitude modulation and the phase modulation of the transmit-receive technique is used to stimulate the transmitter. Based on the regularities among the received envelope zero-crossings, different received signal's signal-to-noise ratio situations are discriminated and optional time-of-flight algorithms are applied to take flow rate calculations. Experimental results from the dry calibration indicate that the designed flowmeter prototype can meet the zero-flow verification test requirements of the American Gas Association Report No. 9. Furthermore, the results derived from the flow calibration prove that the proposed flowmeter prototype can measure flow rate accurately in the practical experiments, and the nominal accuracies after FWME adjustment are lower than 0.8% throughout the calibration range.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

TIME-SPECTRAL ANALYSIS ALGORITHMS FOR LEAD SLOWING-DOWN SPECTROSCOPY OF SPENT FUEL

Nondestructively determining the plutonium content in spent fuel assemblies continues to be a considerable challenge in the safeguarding of nuclear fuel cycles. Motivating needs for such measurements include quantifying material input at a reprocessing facility, determining the shipper-receiver difference, and recovering continuity of knowledge. A nondestructive assay (NDA) technology that could provide timely (tens of minutes), independent (no operator-declared information), and direct measurement of Pu mass that improves upon the uncertainty of today’s confirmatory methods would be a major step forward for spent fuel materials accountability. Lead slowing-down spectroscopy (LSDS) is one potential fuel assay technique; previous work has indicated promise of the method for specific fuel types and assay assumptions. In this work, the focus is the assay of pressurized water reactor assemblies over a wide burnup range, under the following assumptions: a) No a priori information (e.g. initial loading or burnup) is available about the assembly, and b) No pre-existing calibration generated from the measurement of many similar assemblies is available. The technical emphasis of this paper is the development of time-spectral analysis algorithms for LSDS that can extract as much isotopic information as possible from the complex, but content-rich assay signal. The key advancement described here is a mathematical relationship to account for self-shielding created by the fissile isotopes and the effects of neutron-absorbing fission and activation products. This formulation utilizes the known energy-dependent cross-sections from key isotopes, but leaves their mass as free variables. Multi-parameter regression analysis is used to directly calculate not only the mass of fissile isotopes in the fuel assembly (e.g. Pu-239, U-235 and Pu-241), but also the mass of key absorbing isotopes such as Pu-240 and U-238. Preliminary results, using a first-order self-shielding relationship, indicate that LSDS has the potential to directly measure total Pu with less than 5% average relative error, over a burnup range from 0 to 60 GWd/MTU. Assay of U-235 and U-238 is also possible, though with higher uncertainties. Deficiencies in the self-shielding model and methods to improve that formulation are described, along with application of the method to a wider range of fuel types and burnups.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

An Adaptive Timestepping Algorithm for Particle Time Integration in Coupled CFD-DEM Simulations

Coupled Computational Fluid Dynamics(CFD) - Discrete Element Method (DEM) models provide an accurate description of multiphase physical systems where a granular phase exists in an underlying continuous medium. The time integration of the granular phase in these simulations are typically handled using an explicit time integration scheme with a global time step that is much smaller than fluid time scales, in order to resolve inter-particle collisions. An adapative time integration technique that avoids this global constraint for the granular phase is presented in this work. The algorithm involves the use of a local time stepping approach to resolve collisional time scales for only a subset of particles that are in close proximity to potential collision partners, thereby resulting in substantial reduction of computational cost. This approach is observed to be 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

97 MATHEMATICS AND COMPUTING↗

Polynomial time blackbox identity testers for depth-3 circuits : the field doesn't matter.

Let C be a depth-3 circuit with n variables, degree d and top fanin k (called {Sigma}{Pi}{Sigma}(k, d, n) circuits) over base field F. It is a major open problem to design a deterministic polynomial time blackbox algorithm that tests if C is identically zero. Klivans & Spielman (STOC 2001) observed that the problem is open even when k is a constant. This case has been subjected to a serious study over the past few years, starting from the work of Dvir & Shpilka (STOC 2005). We give the first polynomial time blackbox algorithm for this problem. Our algorithm runs in time poly(n)d{sup k}, regardless of the base field. The only field for which polynomial time algorithms were previously known is F = Q (Kayal & Saraf, FOCS 2009, and Saxena & Seshadhri, FOCS 2010). This is the first blackbox algorithm for depth-3 circuits that does not use the rank based approaches of Karnin & Shpilka (CCC 2008). We prove an important tool for the study of depth-3 identities. We design a blackbox polynomial time transformation that reduces the number of variables in a {Sigma}{Pi}{Sigma}(k, d, n) circuit to k variables, but preserves the identity structure. Polynomial identity testing (PIT) is a major open problem in theoretical computer science. The input is an arithmetic circuit that computes a polynomial p(x{sub 1}, x{sub 2},..., x{sub n}) over a base field F. We wish to check if p is the zero polynomial, or in other words, is identically zero. We may be provided with an explicit circuit, or may only have blackbox access. In the latter case, we can only evaluate the polynomial p at various domain points. The main goal is to devise a deterministic blackbox polynomial time algorithm for PIT.

99 GENERAL AND MISCELLANEOUS↗