Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Probability distribution”

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 667 records · Page 37

Mean-field control for efficient mixing of energy loads

In this work, we pose an engineering challenge of controlling an ensemble of energy devices via coordinated, implementation-light, and randomized on/off switching as a problem in nonequilibrium statistical mechanics. We show that mean-field control with nonlinear feedback on the cumulative consumption, assumed available to the aggregator via direct physical measurements of the energy flow, allows the ensemble to recover from its use in the demand response regime, i.e., transition to a statistical steady state, significantly faster than in the case of the fixed feedback. Moreover when the nonlinearity is sufficiently strong, one observes the phenomenon of “super-relaxation,” where the total instantaneous energy consumption of the ensemble transitions to the steady state much faster than the underlying probability distribution of the devices over their state space, while also leaving almost no devices outside of the comfort zone.

25 ENERGY STORAGE↗

Weak scaling of the contact distance between two fluctuating interfaces with system size

A pair of flat parallel surfaces, each freely diffusing along the direction of their separation, will eventually come into contact. If the shapes of these surfaces also fluctuate, then contact will occur when their centers-of-mass remain separated by a nonzero distance ℓ. An example of such a situation is the motion of interfaces between two phases at conditions of thermodynamic coexistence, and in particular the annihilation of domain wall pairs under periodic boundary conditions. Here we present a general approach to calculate the probability distribution of the contact distance ℓ and determine how its most likely value ℓ* depends on the surfaces' lateral size L. Using the Edward-Wilkinson equation as a model for interfaces, we demonstrate that ℓ* scales weakly with system size, i.e., the dependence of ℓ* on L for both (1+1)- and (2+1)-dimensional interfaces is such that lim L→∞ (ℓ*/L) = 0. In particular, for (2+1)-dimensional interfaces ℓ* is an algebraic function of logL, a result that is confirmed by computer simulations of slab-shaped domains formed under periodic boundary conditions. Overall, this weak scaling implies that such domains remain topologically intact until ℓ becomes very small compared to the lateral size of the interface, contradicting expectations from equilibrium thermodynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using kernel-based statistical distance to study the dynamics of charged particle beams in particle-based simulation codes

Measures of discrepancy between probability distributions (statistical distance) are widely used in the fields of artificial intelligence and machine learning. We describe how certain measures of statistical distance can be implemented as numerical diagnostics for simulations involving charged-particle beams. Related measures of statistical dependence are also described. The resulting diagnostics provide sensitive measures of dynamical processes important for beams in nonlinear or high-intensity systems, which are otherwise difficult to characterize. Here, the focus is on kernel-based methods such as maximum mean discrepancy, which have a well-developed mathematical foundation and reasonable computational complexity. Several benchmark problems and examples involving intense beams are discussed. While the focus is on charged-particle beams, these methods may also be applied to other many-body systems such as plasmas or gravitational systems.

47 OTHER INSTRUMENTATION↗

Universal energy-speed-accuracy trade-offs in driven nonequilibrium systems

The connection between measure theoretic optimal transport and dissipative nonequilibrium dynamics provides a language for quantifying nonequilibrium control costs, leading to a collection of thermodynamic speed limits, which rely on the assumption that the target probability distribution is perfectly realized. This is almost never the case in experiments or numerical simulations, so here we address the situation in which the external controller is imperfect. We obtain a lower bound for the dissipated work in generic nonequilibrium control problems that (1) is asymptotically tight and (2) matches the thermodynamic speed limit in the case of optimal driving. Along with analytically solvable examples, we refine this imperfect driving notion to systems in which the controlled degrees of freedom are slow relative to the nonequilibrium relaxation rate, and identify independent energy contributions from fast and slow degrees of freedom. Furthermore, we develop a strategy for optimizing minimally dissipative protocols based on optimal transport flow matching, a generative machine learning technique. Furthermore, this latter approach ensures the scalability of both the theoretical and computational framework we put forth. Crucially, we demonstrate that we can compute the terms in our bound numerically using efficient algorithms from the computational optimal transport literature and that the protocols we learn saturate the bound.

59 BASIC BIOLOGICAL SCIENCES↗

Koopman–von Neumann approach to quantum simulation of nonlinear classical dynamics

Quantum computers can be used to simulate nonlinear non-Hamiltonian classical dynamics on phase space by using the generalized Koopman–von Neumann formulation of classical mechanics. The Koopman–von Neumann formulation implies that the conservation of the probability distribution function on phase space, as expressed by the Liouville equation, can be recast as an equivalent Schrödinger equation on Hilbert space with a Hermitian Hamiltonian operator and a unitary propagator. This Schrödinger equation is linear in the momenta because it derives from a constrained Hamiltonian system with twice the classical phase-space dimension. A quantum computer with finite resources can be used to simulate a finite-dimensional approximation of this unitary evolution operator. Quantum simulation of classical dynamics is exponentially more efficient than a deterministic Eulerian discretization of the Liouville equation if the Koopman–von Neumann Hamiltonian is sparse. Utilizing quantum walk techniques for state preparation and amplitude estimation for the calculation of observables leads to a quadratic improvement over classical probabilistic Monte Carlo algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable measurement error mitigation via iterative bayesian unfolding

Measurement errors are a significant obstacle to achieving scalable quantum computation. To counteract systematic readout errors, researchers have developed postprocessing techniques known as measurement error mitigation methods. However, these methods face a tradeoff between scalability and returning nonnegative probabilities. In this paper, we present a solution to overcome this challenge. Our approach focuses on iterative Bayesian unfolding, a standard mitigation technique used in high-energy physics experiments, and implements it in a scalable way. We demonstrate our method on experimental Greenberger-Horne-Zeilinger state preparation on up to 127 qubits and on the Bernstein-Vazirani algorithm on up to 26 qubits. Compared to state-of-the-art methods (such as M3), our implementation guarantees valid probability distributions, returns comparable or better-mitigated results, and does so without a noticeable time and memory overhead. Published by the American Physical Society 2024

Pokharel, Bibek (ORCID:0000000342841353)↗

Detecting Anomalies in Time Series Using Kernel Density Approaches

This paper introduces a novel anomaly detection approach tailored for time series data with exclusive reliance on normal events during training. Our key innovation lies in the application of kernel-density estimation (KDE) to scrutinize reconstruction errors, providing an empirically derived probability distribution for normal events post-reconstruction. This non-parametric density estimation technique offers a nuanced understanding of anomaly detection, differentiating it from prevalent threshold-based mechanisms in existing methodologies. In post-training, events are encoded, decoded, and evaluated against the estimated density, providing a comprehensive notion of normality. In addition, we propose a data augmentation strategy involving variational autoencoder-generated events and a smoothing step for enhanced model robustness. The significance of our autoencoder-based approach is evident in its capacity to learn normal representation without prior anomaly knowledge. Through the KDE step on reconstruction errors, our method addresses the versatility of anomalies, departing from assumptions tied to larger reconstruction errors for anomalous events. Our proposed likelihood measure then distinguishes normal from anomalous events, providing a concise yet comprehensive anomaly detection solution. The extensive experimental results support the feasibility of our proposed method, yielding significantly improved classification performance by nearly 10% on the UCR benchmark data.

Frehner, Robin↗

An Active Learning-Based Streaming Pipeline for Reduced Data Training of Structure Finding Models in Neutron Diffractometry

Structure determination workloads in neutron diffractometry are computationally expensive and routinely require several hours to many days to determine the structure of a material from its neutron diffraction patterns. The potential for machine learning models trained on simulated neutron scattering patterns to significantly speed up these tasks have been reported recently. However, the amount of simulated data needed to train these models grows exponentially with the number of structural parameters to be predicted and poses a significant computational challenge. To overcome this challenge, we introduce a novel batch-mode active learning (AL) policy that uses uncertainty sampling to simulate training data drawn from a probability distribution that prefers labelled examples about which the model is least certain. We confirm its efficacy in training the same models with ∼ 75% less training data while improving the accuracy. We then discuss the design of an efficient stream-based training workflow that uses this AL policy and present a performance study on two heterogeneous platforms to demonstrate that, compared with a conventional training workflow, the streaming workflow delivers ∼ 20% shorter training time without any loss of accuracy.

Wang, Tianle [Brookhaven National Laboratory (BNL)↗

Optimal Eco-Driving Control of Connected and Autonomous Vehicles Through Signalized Intersections

This article focuses on the speed planning problem for connected and automated vehicles (CAVs) communicating to traffic lights. The uncertainty of traffic signal timing for signalized intersections on the road is considered. The eco-driving problem is formulated as a data-driven chance-constrained robust optimization problem. Effective red-light duration (ERD) is defined as a random variable, and describes the feasible passing time through the signalized intersections. Usually, the true probability distribution for ERD is unknown. Consequently, a data-driven approach is adopted to formulate chance constraints based on empirical sample data. This incorporates robustness into the eco-driving control problem with respect to uncertain signal timing. Dynamic programming (DP) is employed to solve the optimization problem. The simulation results demonstrate that the proposed method can generate optimal speed reference trajectories with 40% less vehicle fuel consumption, while maintaining the arrival time at a similar level compared to a modified intelligent driver model (IDM). The proposed control approach significantly improves the controller's robustness in the face of uncertain signal timing, without requiring to know the distribution of the random variable a priori.

33 ADVANCED PROPULSION SYSTEMS↗

Probabilistic Power Consumption Modeling for Commercial Buildings Using Logistic Regression Markov Chain

The total energy consumed by buildings takes up to 40% of U.S. energy use, in which a large portion is contributed by commercial buildings. Building performance optimization is desirable but requires accurate building models with uncertainties taken into account. This paper proposes a novel probabilistic modeling method using Logistic Regression Markov Chain (LRMC). The LRMC model enhances the performance of traditional Markov Chain (MC) models by adopting time-variant transition matrices calibrated using logistic regression with exogenous inputs. Compared with existing building models, the proposed model produces accurate multi-step modeling results with full probability distribution. The proposed probabilistic building model is tested using actual commercial building measurements and modeling performance is evaluated with two probabilisitc metrics. The results show that the LRMC model has higher accuracy than traditional MC model and Logistic Regression (LR) model in that it yields lower error scores under both evaluation metrics.

Building modeling↗

Training a Quantum Annealing Based Restricted Boltzmann Machine on Cybersecurity Data

A restricted Boltzmann machine (RBM) is a generative model that could be used in effectively balancing a cybersecurity dataset because the synthetic data a RBM generates follows the probability distribution of the training data. RBM training can be performed using contrastive divergence (CD) and quantum annealing (QA). QA-based RBM training is fundamentally different from CD and requires samples from a quantum computer. We present a real-world application that uses a quantum computer. Specifically, we train a RBM using QA for cybersecurity applications. The D-Wave 2000Q has been used to implement QA. RBMs are trained on the ISCX data, which is a benchmark dataset for cybersecurity. For comparison, RBMs are also trained using CD. CD is a commonly used method for RBM training. Our analysis of the ISCX data shows that the dataset is imbalanced. We present two different schemes to balance the training dataset before feeding it to a classifier. The first scheme is based on the undersampling of benign instances. The imbalanced training dataset is divided into five sub-datasets that are trained separately. A majority voting is then performed to get the result. Our results show the majority vote increases the classification accuracy up from 90.24% to 95.68%, in the case of CD. For the case of QA, the classification accuracy increases from 74.14% to 80.04%. In the second scheme, a RBM is used to generate synthetic data to balance the training dataset. We show that both QA and CD-trained RBM can be used to generate useful synthetic data. Balanced training data is used to evaluate several classifiers. Among the classifiers investigated, K-Nearest Neighbor (KNN) and Neural Network (NN) perform better than other classifiers. They both show an accuracy of 93%. Our results show a proof-of-concept that a QA-based RBM can be trained on a 64-bit binary dataset. The illustrative example suggests the possibility to migrate many practical classification problems to QA-based techniques. Further, we show that synthetic data generated from a RBM can be used to balance the original dataset.

97 MATHEMATICS AND COMPUTING↗

Probabilistic Zonal Reserve Requirements for Improved Energy Deliverability with Wind Power

In power systems with high penetration of renewable energy resources, uncertainty and variability of these stochastic resources introduce additional challenges for the operation of power systems. To improve the power system's reliability in the face of uncertainty, reserves are required as additional generation capacity to rebalance the power system following random disturbances. However, reserve deliverability is not guaranteed, because it may encounter potential transmission line congestion. Zonal reserve requirements can address this issue, but operators lack efficient ways to allocate reserves to zones while accounting for wind power forecast uncertainty. Herein we propose a methodology for probabilistic zonal reserve requirements to address wind power forecast uncertainties. This method estimates the probability distribution of line flows based on the system generation margin and injection shift factor. This estimate is then used to construct pre-defined and post-zonal reserve requirements. Case studies demonstrate that the proposed method efficiently schedules energy and reserves to balance energy and manage deliverability with wind power forecast uncertainty.We also discuss operational implications of the proposed method.

17 WIND ENERGY↗

A Machine Learning-based Reliability Evaluation Model for Integrated Power-Gas Systems

This article proposes a hybrid machine learning method for the reliability evaluation of integrated power-gas systems (IPGS) under the uncertain component failure probability distributions. The Random Forest (RF) method is designed to select important features to solve the insufficient quantity of data and the curse of dimensionality problems. The Extreme Gradient Boosting (XGBoost) regression algorithm is developed to quantify the relationship between the uncertain parameters and reliability metrics. Moreover, a ten-fold cross-validation method is employed to further improve the accuracy of the regression model. Simulation results on three test systems show that the proposed method can achieve high accuracy for the reliability evaluation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Thermophysical modeling of raw glaze liquidus temperature and viscosity

Raw glazes, which do not contain pre-melted glass frits, are widely used due to their low cost. The natural variability of the mineral compositions used in raw glazes affects their viscosity during firing. Molten glaze viscosity plays an important role in determining the final surface quality; therefore, it is important to determine how raw glaze composition and firing conditions affect viscosity. Thermophysical modeling provides a way to evaluate the liquidus temperature and viscosity of molten glazes as a function of composition and oxygen activity. Equilibrium phase volume fraction and composition of 242 raw glaze recipes were evaluated under oxidizing and reducing conditions. Undissolved or precipitation of solid phases explain the secondary flux transition from anti-fluxing to fluxing near the liquidus temperature. The liquidus temperature and viscosity of iron glazes decrease as a function of increasing iron content under a reducing atmosphere. The empirical probability distribution of molten glaze viscosity follows a lognormal distribution, with lead glazes having significantly lower viscosity compared with glazes without lead. Here, the peak firing temperature viscosity of lead-free glazes is near the working point of glass. Multiple linear regression analysis shows that the peak firing temperature viscosity and liquidus temperature significantly predict the viscosity factor.

36 MATERIALS SCIENCE↗

A Bayesian nonparametric analysis for zero-inflated multivariate count data with application to microbiome study

High-throughput sequencing technology has enabled researchers to profile microbial communities from a variety of environments, but analysis of multivariate taxon count data remains challenging. Here, we develop a Bayesian nonparametric (BNP) regression model with zero inflation to analyse multivariate count data from microbiome studies. A BNP approach flexibly models microbial associations with covariates, such as environmental factors and clinical characteristics. The model produces estimates for probability distributions which relate microbial diversity and differential abundance to covariates, and facilitates community comparisons beyond those provided by simple statistical tests. We compare the model to simpler models and popular alternatives in simulation studies, showing, in addition to these additional community-level insights, it yields superior parameter estimates and model fit in various settings. The model's utility is demonstrated by applying it to a chronic wound microbiome data set and a Human Microbiome Project data set, where it is used to compare microbial communities present in different environments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dynamics of magnetization at infinite temperature in a Heisenberg spin chain

Understanding universal aspects of quantum dynamics is an unresolved problem in statistical mechanics. In particular, the spin dynamics of the one-dimensional Heisenberg model were conjectured as to belong to the Kardar-Parisi-Zhang (KPZ) universality class based on the scaling of the infinite-temperature spin-spin correlation function. In a chain of 46 superconducting qubits, we studied the probability distribution of the magnetization transferred across the chain’s center, P M . The first two moments of P M show superdiffusive behavior, a hallmark of KPZ universality. However, the third and fourth moments ruled out the KPZ conjecture and allow for evaluating other theories. Our results highlight the importance of studying higher moments in determining dynamic universality classes and provide insights into universal behavior in quantum systems.

Science & Technology - Other Topics↗

ResStock™ v3.2.0 [SWR-19-15 and SWR-20-07]

The ResStock™ analysis tool was built on NREL's OpenStudio® platform, and is a project geared at modeling existing residential building stocks at national, regional, or local scales with a high-degree of granularity (e.g., one physics-based simulation model for every 200 dwelling units), using the EnergyPlus® simulation engine. Information about ComStock™, a sister tool for modeling the commercial building stock, can be found here: https://www.nrel.gov/buildings/comstock.html This repository contains: Housing characteristics of the U.S. residential building stock, in the form of conditional probability distributions stored as tab-separated value (.tsv) files. Comments at the bottom of each file document data sources and assumptions for each. A library of housing characteristic "options" that translate high-level characteristic parameters into arguments for OpenStudio measures, and which are referenced by the housing characteristic .tsv files and building energy upgrades defined in project definition files Project definition files: v2.3.0 and later: buildstockbatch YML files openable in any text editor v2.2.5 and prior: Project folder openable in PAT Unit-level OpenStudio Measures for automatically constructing OpenStudio Models of each representative dwelling unit model: v3.0.0 and later: OpenStudio-HPXML Measures v2.5.0 and prior: OpenStudio Measures Higher-level OpenStudio Measures for controlling simulation inputs and outputs This repository does not contain software for running ResStock simulations, which can be found as follows: Versions 2.3.0 and later only support the use of buildstockbatch for deploying simulations on high-performance or cloud computing. Version 2.3.0 also removed separate projects for single-family detached and multifamily buildings, in lieu of a combined project_national representing the U.S. residential building stock. See the changelog for more details. Versions 2.2.5 and prior support the use of the publicly available OpenStudio-PAT software as an interface for deploying simulations on cloud computing. Read the documentation for v2.2.5.

Horowitz, Scott↗

Bug fixes / enhancements to Parallel tempering Markov chain Monte Carlo sampler (PTMCMCSampler) v3

Markov chain Monte Carlo sampler useful for a variety of problems for optimization, numerical integration, and generating draws from a probability distribution. They are often used in physical and mathematical problems, especially when it is difficult or impossible to use other approaches. This disclosure is for new bug fixes and enhancements to an existing open source library that is already in the public domain under the MIT license. https://github.com/jellis18/PTMCMCSampler

Forrer, Mark↗