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 181 records · Page 10

Polynomial-time preparation of low-temperature Gibbs states for two-dimensional toric code

In this work, we propose a polynomial-time algorithm for preparing the Gibbs state of the two-dimensional toric code Hamiltonian at any temperature, starting from any initial state, significantly improving upon prior estimates that suggested exponential scaling with inverse temperature. We prove that fast mixing at low temperature for the two-dimensional toric code can be achieved by augmenting local jump operators with simple global jump operators, which enable efficient transitions between logical sectors. To establish tight lower bounds on the spectral gap, we introduce a new reduction method that eventually maps the problem to estimating the spectral gap of a perturbed graph Laplacian on a stair graph. Our proof also shows that the Lindblad dynamics with a digitally implemented low-temperature local Davies generator is able to efficiently drive the quantum state toward the ground state manifold.

97 MATHEMATICS AND COMPUTING↗

Tractable minor-free generalization of planar zero-field Ising models

In this work, we present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive 'gluing' of planar and O(1)-sized components and subsets of at most three vertices into a tree. The polynomial time algorithm of the dynamic programming type for solving exact inference (computing partition function) and exact sampling (generating i.i.d. samples) consists of sequential application of an efficient (for planar) or brute-force (for O(1)-sized) inference and sampling to the components as a black box. To illustrate the utility of the new family of tractable graphical models, we first build a polynomial algorithm for inference and sampling of zero-field Ising models over K 33 -minor-free topologies and over K 5 -minor-free topologies—both of which are extensions of the planar zero-field Ising models—which are neither genus- nor treewidth-bounded. Second, we empirically demonstrate an improvement in the approximation quality of the NP-hard problem of inference over the square-grid Ising model in a node-dependent nonzero 'magnetic' field.

97 MATHEMATICS AND COMPUTING↗

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗

Robust Structural Analysis and Design of Distributed Control Systems to Prevent Zero Dynamics Attacks

We consider the design and analysis of robust distributed control systems (DCSs) to ensure the detection of integrity attacks. DCSs are often managed by independent agents and are implemented using a diverse set of sensors and controllers. However, the heterogeneous nature of DCSs along with their scale leave such systems vulnerable to adversarial behavior. To mitigate this reality, we provide tools that allow operators to prevent zero dynamics attacks when as many as p agents and sensors are corrupted. Such a design ensures attack detectability in deterministic systems while removing the threat of a class of stealthy attacks in stochastic systems. To achieve this goal, we use graph theory to obtain necessary and sufficient conditions for the presence of zero dynamics attacks in terms of the structural interactions between agents and sensors. We then formulate and solve optimization problems which minimize communication networks while also ensuring a resource limited adversary cannot perform a zero dynamics attacks. Polynomial time algorithms for design and analysis are provided.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Real-Time Optimal Power Flow

Future power networks are expected to incorporate a large number of distributed energy resources, which introduce randomness and fluctuations as well as fast control capabilities. But traditional optimal power flow methods are only appropriate for applications that operate on a slow timescale. In this paper, we build on recent work to develop a real-time algorithm for AC optimal power flow, based on quasi-Newton methods. The algorithm uses second-order information to provide suboptimal solutions on a fast timescale, and can be shown to track the optimal power flow solution when the estimated second-order information is sufficiently accurate. We also give a specific implementation based on L-BFGS-B method, and show by simulation that the proposed algorithm has good performance and is computationally efficient.

Tang, Yujie↗

Development of the Active Correlation Method: Theoretical-Methodological Aspect

The Dubna Gas-Filled Recoil Separator (DGFRS) of the Flerov Laboratory of Nuclear Reactions (FLNR), JINR, is the most advanced facility for the synthesis and study of new superheavy nuclei. In the recent years, new elements with Z = 114 to 118 (Fl, Mc, Lv, Ts, Og) have been successfully synthesized. The DGFRS detection system and a unique method of active correlations for background suppression have played a significant role in these discoveries. Theoretical-methodological aspects of further development of the active correlation method are considered, especially in view of the upcoming commissioning of the new FLNR high-intensity DC-280 cyclotron for acceleration of heavy ions and the new gas-filled recoil separator. A numerical model of the edge effects between the neighboring strips on the p – n junction side of the DSSSD detector is presented. The corresponding empirical examples are given. A more flexible real-time algorithm is considered as a possible substitute for the current version with the rigidly set parameters. Since stability of the calibration parameters is strongly required for applying the method, the radiation stability factor is also briefly considered.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Compiler-Assisted Detection of Transient Memory Errors

The probability of bit flips in hardware memory systems is projected to increase significantly as memory systems continue to scale in size and complexity. Effective hardware-based error detection and correction requires that the complete data path, involving all parts of the memory system, be protected with sufficient redundancy. First, this may be costly to employ on commodity computing platforms and second, even on high-end systems, protection against multi-bit errors may be lacking. Therefore, augmenting hardware error detection schemes with software techniques is of consider- able interest. In this paper, we consider software-level mechanisms to comprehensively detect transient memory faults. We develop novel compile-time algorithms to instrument application programs with checksum computation codes so as to detect memory errors. Unlike prior approaches that employ checksums on computational and architectural state, our scheme verifies every data access and works by tracking variables as they are produced and consumed. Experimental evaluation demonstrates that the proposed comprehensive error detection solution is viable as a completely software-only scheme. We also demonstrate that with limited hardware support, overheads of error detection can be further reduced.

def-use analysis↗

LaplaceInterpolation.jl: A Julia package for fast interpolation on a grid

We implement a linear-time algorithm for interpolation on a regular multidimensional grid in the Julia language. The algorithm is an approximate Laplace interpolation (Press, 1992) when no parameters are given; and when parameters m ∈ Z and ϵ > 0 are set, the interpolant approximates a Matérn kernel, of which radial basis functions and polyharmonic splines are a special case. We implement, in addition, Neumann, Dirichlet (trivial), and average boundary conditions with potentially different aspect ratios in the different dimensions. The interpolant functions in arbitrary dimensions.

97 MATHEMATICS AND COMPUTING↗

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↗

Special Perturbations Using Back-Correction Methods of Numerical Integration

A new class of linear multistep methods for numerical integration of differential equations is reported that permits satellite computation solutions to be corrected at certain points in the past as the integration advances in time. Algorithms have been developed for the solution of both first- and second-order differential equations. The back correction method appears to be more efficient than classical methods when dominant and perturbing forces can be separated.

Feagin, T.↗

Design considerations for a real-time ocular counterroll instrument

A real-time algorithm for measuring three-dimensional movement of the human eye, especially torsional movement, is presented. As its input, the system uses images of the eyeball taken at video rate. The amount of horizontal and vertical movement is extracted using a pupil tracking technique. The torsional movement is then measured by computing the discrete cross-correlation function between the circular samples of successive images of the iris patterns and searching for the position of the peak of the function. A local least square interpolation around the peak of the cross-correlation function is used to produce nearly unbiased estimates of torsion angle with accuracy of about 3-4 arcmin. Accuracies of better than 0.03 deg are achievable in torsional measurement with SNR higher than 36 dB. Horizontal and vertical rotations of up to + or - 13 deg can occur simultaneously with torsion without introducing any appreciable error in the counterrolling measurement process.

Hatamian, M.↗

Theoretical and experimental analysis of laser altimeters for barometric measurements over the ocean

The statistical characteristics and the waveforms of ocean-reflected laser pulses are studied. The received signal is found to be corrupted by shot noise and time-resolved speckle. The statistics of time-resolved speckle and its effects on the timing accuracy of the receiver are studied in the general context of laser altimetry. For estimating the differential propagation time, various receiver timing algorithms are proposed and their performances evaluated. The results indicate that, with the parameters of a realistic altimeter, a pressure measurement accuracy of a few millibars is feasible. The data obtained from the first airborne two-color laser altimeter experiment are processed and analyzed. The results are used to verify the pressure measurement concept.

Tsai, B. M.↗