Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sampling algorithm”

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 919 records · Page 51

PowerNet: Multi-agent Deep Reinforcement Learning for Scalable Powergrid Control

This paper develops an efficient multi-agent deep reinforcement learning algorithm for cooperative controls in powergrids. Specifically, we consider the decentralized inverter-based secondary voltage control problem in distributed generators (DGs), which is first formulated as a cooperative multi-agent reinforcement learning (MARL) problem. We then propose a novel on-policy MARL algorithm, PowerNet, in which each agent (DG) learns a control policy based on (sub-)global reward but local states and encoded communication messages from its neighbors. Motivated by the fact that a local control from one agent has limited impact on agents distant from it, we exploit a novel spatial discount factor to reduce the effect from remote agents, to expedite the training process and improve scalability. Furthermore, a differentiable, learning-based communication protocol is employed to foster the collaborations among neighboring agents. In addition, to mitigate the effects of system uncertainty and random noise introduced during on-policy learning, we utilize an action smoothing factor to stabilize the policy execution. To facilitate training and evaluation, we develop PGSim, an efficient, high-fidelity powergrid simulation platform. Here, experimental results in two microgrid setups show that the developed PowerNet outperforms the conventional model-based control method, as well as several state-of-the-art MARL algorithms. The decentralized learning scheme and high sample efficiency also make it viable to large-scale power grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

TU-EF-304-07: Monte Carlo-Based Inverse Treatment Plan Optimization for Intensity Modulated Proton Therapy

Purpose: Intensity-modulated proton therapy (IMPT) is increasingly used in proton therapy. For IMPT optimization, Monte Carlo (MC) is desired for spots dose calculations because of its high accuracy, especially in cases with a high level of heterogeneity. It is also preferred in biological optimization problems due to the capability of computing quantities related to biological effects. However, MC simulation is typically too slow to be used for this purpose. Although GPU-based MC engines have become available, the achieved efficiency is still not ideal. The purpose of this work is to develop a new optimization scheme to include GPU-based MC into IMPT. Methods: A conventional approach using MC in IMPT simply calls the MC dose engine repeatedly for each spot dose calculations. However, this is not the optimal approach, because of the unnecessary computations on some spots that turned out to have very small weights after solving the optimization problem. GPU-memory writing conflict occurring at a small beam size also reduces computational efficiency. To solve these problems, we developed a new framework that iteratively performs MC dose calculations and plan optimizations. At each dose calculation step, the particles were sampled from different spots altogether with Metropolis algorithm, such that the particle number is proportional to the latest optimized spot intensity. Simultaneously transporting particles from multiple spots also mitigated the memory writing conflict problem. Results: We have validated the proposed MC-based optimization schemes in one prostate case. The total computation time of our method was ∼5–6 min on one NVIDIA GPU card, including both spot dose calculation and plan optimization, whereas a conventional method naively using the same GPU-based MC engine were ∼3 times slower. Conclusion: A fast GPU-based MC dose calculation method along with a novel optimization workflow is developed. The high efficiency makes it attractive for clinical usages.

60 APPLIED LIFE SCIENCES↗

Streaming Compression of Scientific Data via Weak-SINDy

Here, in this paper, a streaming weak-SINDy algorithm is developed specifically for compressing streaming scientific data. The production of scientific data, either via simulation or experiments, is undergoing a stage of exponential growth, which makes data compression important and often necessary for storing and utilizing large scientific data sets. As opposed to classical “offline” compression algorithms that perform compression on a readily available data set, streaming compression algorithms compress data “online” while the data generated from simulation or experiments is still flowing through the system. This feature makes streaming compression algorithms well suited for scientific data compression, where storing the full data set offline is often infeasible. This work proposes a new streaming compression algorithm, streaming weak-SINDy, which takes advantage of the underlying data characteristics during compression. The streaming weak-SINDy algorithm constructs feature matrices and target vectors in the online stage via a streaming integration method in a memory efficient manner. The feature matrices and target vectors are then used in the offline stage to build a model through a regression process that aims to recover equations that govern the evolution of the data. For compressing high-dimensional streaming data, we adopt a streaming proper orthogonal decomposition (POD) process to reduce the data dimension and then use the streaming weak-SINDy algorithm to compress the temporal data of the POD expansion. We propose modifications to the streaming weak-SINDy algorithm to accommodate the dynamically updated POD basis. By combining the built model from the streaming weak-SINDy algorithm and a small amount of data samples, the full data flow could be reconstructed accurately at a low memory cost, as shown in the numerical tests.

97 MATHEMATICS AND COMPUTING↗

Accelerating Advanced Light Source Science Through Multi-Facility HPC Workflows

Synchrotron light sources support a wide array of techniques to investigate materials, often producing complex, high-volume data that challenge traditional workflows. At the Advanced Light Source (ALS), we developed infrastructure to move microtomography data over ESnet to ALCF and NERSC, where CPU- and GPU-based algorithms generate 3D reconstructed volumes of experimental samples. We employ two data movement and reconstruction models: real-time processing as data streams directly to NERSC compute nodes, and automated file transfer to NERSC and ALCF file systems. The streaming pipeline provides users with feedback in under ten seconds, while the file-based workflow produces high-quality reconstructions suitable for deeper analysis in 20-30 minutes. This infrastructure enables users to utilize HPC resources without direct access to backend systems. We plan to extend this architecture to more endstations, supporting our beamline scientists and users.

Abramov, David↗

Automated Characterization of Spent Fuel through the Multi-Isotope Process (MIP) Monitor

This research developed an algorithm for characterizing spent nuclear fuel (SNF) samples based on simulated gamma spectra. The gamma spectra for a variety of light water reactor fuels typical of those found in the United States were simulated. Fuel nuclide concentrations were simulated in ORIGEN-ARP for 1296 fuel samples with a variety of reactor designs, initial enrichments, burn ups, and cooling times. The results of the ORIGEN-ARP simulation were then input to SYNTH to simulate the gamma spectrum for each sample. These spectra were evaluated with partial least squares (PLS)-based multivariate analysis methods to characterize the fuel according to reactor type (pressurized or boiling water reactor), enrichment, burn up, and cooling time. Characterizing some of the features in series by using previously estimated features in the prediction greatly improves the performance. By first classifying the spent fuel reactor type and then using type-specific models, the prediction error for enrichment, burn up, and cooling time improved by a factor of two to four. For some features, the prediction was further improved by including additional information, such as including the predicted burn up in the estimation of cooling time. The optimal prediction flow was determined based on the simulated data. A PLS discriminate analysis model was developed which perfectly classified SNF reactor type. Burn up was predicted within 0.1% root mean squared percent error (RMSPE) and both cooling time and initial enrichment within approximately 2% RMSPE.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

UPR/Mayaguez High Energy Physics

This year the University of Puerto Rico at Mayaguez (UPRM) High Energy Physics (HEP) group continued with the ongoing research program outlined in the grant proposal. The program is centered on the Compact Muon Solenoid (CMS) experiment at the proton-proton (pp) collisions at the Large Hadron Collider (LHC) at CERN in Geneva, Switzerland. The main research focus is on data analysis and on the preparation for the High Luminosity (HL) LHC or experiment detector upgrade. The physics data analysis included Higgs Doublet Search and measurement of the (1) Λ 0 b branching fraction, (2) B meson mass, and (3) hyperon θ - b lifetime. The detector upgrade included work on the preparations for the Forward Pixel (FPIX) detector Silicon Sensor Testing in a production run at Fermilab. In addition, the group has taken responsibilities on the Software Release through our former research associate Dr. Eric Brownson who acted until last December as a Level Two Offline Manager for the CMS Upgrade. In support of the CMS data analysis activities carried out locally, the UPRM group has built and maintains an excellent Tier3 analysis center in Mayaguez. This allowed us to analyze large data samples and to continue the development of algorithms for the upgrade tracking robustness we started several years ago, and we plan to resume in the near future. This project involves computer simulation of the radiation damage to be suffered at the higher luminosities of the upgraded LHC. This year we continued to serve as a source of outstanding students for the field of high energy physics. Three of our graduate students finished their MS work in May, 2014, Their theses research were on data analysis of heavy quark b-physics. All of them are currently enrolled at Ph.D. physics program across the nation. One of them (Hector Moreno) at New Mexico University (Hector Moreno), one at University of New Hampshire (Sandra Santiesteban) and one at University of Puerto Rico-Rio Piedras (Carlos Malca). The students H. Moreno and C. Malca has been directly supervised by Dr. Mendez and S. Santiesteban supervised by Dr. Ramirez. During the last 13 years, our group have graduated 23 MS students on experimental High Energy Physics data analysis and applied hardware techniques. Most of the students have been supported by DOE grants, included this grant. Since 2001, Dr. Mendez have directly supervised eleven students, Dr. Ramirez three students and the former PI (Dr. Lopez) nine students. These theses work are fully documented in the group web page (http://charma.uprm.edu). The High Energy Physics group at Mayaguez is small and presently consists of three Physics faculty members, the Senior Investigators Dr. Hector Mendez (Professor) and Dr. Juan Eduardo Ramirez (Professor), and Dr. Sudhir Malik who was just hired in July 2014. Dr. Ramirez is in charge of the UPRM Tier-3 computing and will be building the network bandwidth infrastructure for the campus, while Dr. Mendez will continues his effort in finishing the heavy quark physics data analysis and moving to work on SUSY analysis for the 2015 data. Our last grant application in 2012 was awarded only for 2013-2014. As a result our postdoc position was lost last month of March. Since then, we have hired Dr. Malik as a new faculty in order to reinforce the group and to continue our efforts with the CMS experiment. Our plan is to hire another junior faculty in the next two years to strengthen the HEP group even further. Dr. Mendez continues with QuarkNet activities involving an ever larger group of high school physics teachers from all around Puerto Rico.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Posterior Regularized Bayesian Neural Network

Traditional NNs often lack the ability for uncertainty quantification. Bayesian NNs(BNNs) could help measure the confidence level by using distributions in NNs modeling. Besides, knowledge is commonly available and could improve the performance of BNNs if it can be properly incorporated. In this work, we propose a novel Posterior-Regularized BNN(PR-BNN) model by incorporating soft and hard constraints as a posterior regularization term. We also propose an augmented Lagrangian method and stochastic optimization algorithm for efficient updating via Monte Carlo sampling. The simulations and case studies for solar PV plants have shown the performance improvement of the proposed model over traditional BNNs.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Derivative-based Method for Function Approximation

To alleviate the high computational cost of large-scale multi-physics simulations to study the relationships between the model parameters and the outputs of interest, response surfaces are often used in place of the exact functional relationships. This report explores a method for response surface construction using adaptive sampling guided by derivative information at each selected sample point. This method is especially suitable for applications that can readily provide added information such as gradients and Hessian with respect to the input parameters under study. When higher order terms (third and above) in the Taylor series are negligible, the approximation error for this method can be controlled. We present details of the adaptive algorithm and numerical results on a few test problems.

99 GENERAL AND MISCELLANEOUS↗

Bottomonium suppression in pNRQCD and open quantum system approach

By employing the potential non-relativistic quantum chromodynamics (pNRQCD) effective field theory within an open quantum system framework, we derive a Lindblad equation governing the evolution of the heavy-quarkonium reduced density matrix, accurate to next-to-leading order (NLO) in the ratio of the state's binding energy to the medium's temperature [1]. The derived NLO Lindblad equation provides a more reliable description of heavy-quarkonium evolution in the quark-gluon plasma at low temperatures compared to the leading-order truncation. For phenomenological applications, we numerically solve this equation using the quantum trajectories algorithm. By averaging over Monte Carlo-sampled quantum jumps, we obtain solutions without truncation in the angular momentum quantum number of the considered states. Our analysis highlights the importance of quantum jumps in the nonequilibrium evolution of bottomonium states within the quark-gluon plasma [2]. Additionally, we demonstrate that the quantum regeneration of singlet states from octet configurations is essential to explain experimental observations of bottomonium suppression. The heavy-quarkonium transport coefficients used in our study align with recent lattice QCD determinations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Set covering algorithm, a subprogram of the scheduling algorithm for mission planning and logistic evaluation

A computer program using Lemke, Salkin and Spielberg's Set Covering Algorithm (SCA) to optimize a traffic model problem in the Scheduling Algorithm for Mission Planning and Logistics Evaluation (SAMPLE) was documented. SCA forms a submodule of SAMPLE and provides for input and output, subroutines, and an interactive feature for performing the optimization and arranging the results in a readily understandable form for output.

Chang, H.↗

Mission payloads subsystem description, revision 2

The Mission Payloads Subsystem (MPLS) which utilizes a simplified trajectory model to generate a list of missions for the Scheduling Algorithm for Mission Planning and Logistics Evaluation (SAMPLE) program is described. The MPLS is the mechanism that forms the basis of input for the other subsystems of SAMPLE and various post processors.

Williams, J. M.↗

Scheduling algorithm for mission planning and logistics evaluation users' guide

The scheduling algorithm for mission planning and logistics evaluation (SAMPLE) program is a mission planning tool composed of three subsystems; the mission payloads subsystem (MPLS), which generates a list of feasible combinations from a payload model for a given calendar year; GREEDY, which is a heuristic model used to find the best traffic model; and the operations simulation and resources scheduling subsystem (OSARS), which determines traffic model feasibility for available resources. The SAMPLE provides the user with options to allow the execution of MPLS, GREEDY, GREEDY-OSARS, or MPLS-GREEDY-OSARS.

Chang, H.↗

A satellite digital controller or 'play that PID tune again, Sam'

The problem discussed is to design a digital controller for a typical satellite. The controlled plant is considered to be a rigid body acting in a plane. The controller is assumed to be a digital computer which, when combined with the proposed control algorithm, can be represented as a sampled-data system. The objective is to present a design strategy and technique for selecting numerical values for the control gains (assuming position, integral, and derivative feedback) and the sample rate. The technique is based on the parameter plane method and requires that the system be amenable to z-transform analysis.

Seltzer, S. M.↗

First Scientific Working Group Meeting of Airborne Doppler Lidar Wind Velocity Measurement Program, appendix C

The problem is to operate on two scalar fields to produce a vector field, to produce user products from the vector field, and to establish reliability of results. Data problems encountered include sparse measurements, irregular distribution, varying quality, imperfect orthogonality, aliasing due to sampling volume, and measurements not simultaneous. Desired algorithm characteristics, solution elements, and characteristics of the model are listed. The seven simulation elements, eight algorithm steps and the required user inputs are given.

Lee, R. W.↗

Performances Of Fixed-Lag Phase-Smoothing Algorithms

Report discusses performances of fixed-lag nonlinear smoothing algorithms applied to estimation of phase and frequency of sinusoidal carrier signal with process phase noise and additive observation phase noise. Algorithm of type considered functions as suboptimal filter operating on received signal. Algorithm developed for system in which signal sampled at discrete times. Process noise assumed to be Gaussian with zero mean and independent of observation noise. Nonlinear smoothing equations derived in customary matrix-and-vector forms.

Kumar, Rajendra↗

Spectral Analysis Of Linear, Shift-Invariant Interpolants

Method of analysis provides quantitative measure of reconstruction and interpolation performances of linear, shift-invariant interpolants. Criterion of performance based upon mean-square error of difference between sampled and reconstructed functions. Applicable to reconstruction algorithms used in processing of signals and images and to types of interpolants used in numerical analysis, computer-aided design, and computer graphics.

Lansing, Donald L.↗