Search NASA⌕ Search

SEARCH · Search NASA

Results for “sequential updates”

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 73 records · Page 4

Improving the real-time probabilistic channel flood forecasting by incorporating the uncertainty of inflow using the particle filter

An accurate and reliable real-time flood forecast is crucial for mitigating flood disasters. The errors associated with the inflow boundary forcing data are considered as an important source of uncertainties in hydraulic model. In this paper, a real-time probabilistic channel flood forecasting model is developed with a novel function to incorporate the uncertainty of the forcing inflow. This new approach couples a hydraulic model with the particle filter (PF) data assimilation algorithm, a sequential Bayesian Monte Carlo method. The stage observations at hydrological stations are assimilated at each time step to update the model states in order to improve the next time step’s forecasting. This new approach is tested against a real flood event occurred in the upper Yangtze River. As compared with the open loop simulations, the evaluations of model performance with several deterministic and probabilistic metrics indicate that the accuracy of the ensemble mean prediction and the reliability of the uncertainty quantification are improved pronouncedly as a result of the PF assimilation. Further assessment of the prediction results at different lead times shows that the improvement of model performance deteriorates with the increase of the lead time due to the gradual diminishing of the updating effect for the initial conditions. Based on the analyses of the number of particles and the assimilation frequency, we find that the optimal number of particles can be determined by balancing the model performance and the computation cost, while a high assimilation frequency is preferred to incorporate the emerging observations to update the model states to match the real conditions.

Channel flood forecasting, probabilistic forecast,↗

Tracking Object Existence From an Autonomous Patrol Vehicle

An autonomous vehicle patrols a large region, during which an algorithm receives measurements of detected potential objects within its sensor range. The goal of the algorithm is to track all objects in the region over time. This problem differs from traditional multi-target tracking scenarios because the region of interest is much larger than the sensor range and relies on the movement of the sensor through this region for coverage. The goal is to know whether anything has changed between visits to the same location. In particular, two kinds of alert conditions must be detected: (1) a previously detected object has disappeared and (2) a new object has appeared in a location already checked. For the time an object is within sensor range, the object can be assumed to remain stationary, changing position only between visits. The problem is difficult because the upstream object detection processing is likely to make many errors, resulting in heavy clutter (false positives) and missed detections (false negatives), and because only noisy, bearings-only measurements are available. This work has three main goals: (1) Associate incoming measurements with known objects or mark them as new objects or false positives, as appropriate. For this, a multiple hypothesis tracker was adapted to this scenario. (2) Localize the objects using multiple bearings-only measurements to provide estimates of global position (e.g., latitude and longitude). A nonlinear Kalman filter extension provides these 2D position estimates using the 1D measurements. (3) Calculate the probability that a suspected object truly exists (in the estimated position), and determine whether alert conditions have been triggered (for new objects or disappeared objects). The concept of a probability of existence was created, and a new Bayesian method for updating this probability at each time step was developed. A probabilistic multiple hypothesis approach is chosen because of its superiority in handling the uncertainty arising from errors in sensors and upstream processes. However, traditional target tracking methods typically assume a stationary detection volume of interest, whereas in this case, one must make adjustments for being able to see only a small portion of the region of interest and understand when an alert situation has occurred. To track object existence inside and outside the vehicle's sensor range, a probability of existence was defined for each hypothesized object, and this value was updated at every time step in a Bayesian manner based on expected characteristics of the sensor and object and whether that object has been detected in the most recent time step. Then, this value feeds into a sequential probability ratio test (SPRT) to determine the status of the object (suspected, confirmed, or deleted). Alerts are sent upon selected status transitions. Additionally, in order to track objects that move in and out of sensor range and update the probability of existence appropriately a variable probability detection has been defined and the hypothesis probability equations have been re-derived to accommodate this change. Unsupervised object tracking is a pervasive issue in automated perception systems. This work could apply to any mobile platform (ground vehicle, sea vessel, air vehicle, or orbiter) that intermittently revisits regions of interest and needs to determine whether anything interesting has changed.

Wolf, Michael↗

Direct nonparametric multimessenger constraints on the equation of state of cold dense nuclear matter

We utilize the now substantial amount of astrophysical observations of neutron stars (NSs), along with perturbative quantum chromodynamics (pQCD) calculations at high density, to directly constrain the NS equation of state (EOS). To this end, we construct nonparametric EOS priors by using Gaussian processes trained on 75 EOSs, which include models with either hadrons, hyperons, or quarks at high densities. We create a prior using the full EOS sample (model agnostic), and one prior for each EOS family to test model discrimination. We introduce a novel inference approach, which allows the simultaneous sampling of intrinsic and extrinsic parameters of binary NS mergers, as well as a nonparametric equation of state. We showcase this method in a Bayesian updating scheme by first performing a complete analysis of the binary NS merger event GW170817 with minimal assumptions, and sequentially adding information from x-ray and radio NS observations, along with pQCD calculations. Besides providing standard constraints, such as the pressure at twice nuclear saturation density 𝑝⁡(2⁢𝜌 sat ) = 4.3$^{+0.6}_{−0.6}$ × 10 34 dyne/cm 2 , at 95% confidence level, for the model agnostic prior, our methodology shows how the choice of EOS families used in conditioning changes the inferred astrophysical properties of the EOS, namely tidal deformability and maximum supported NS mass. We find hyperonic priors predicting higher tidal deformabilities for a 1.4⁢𝑀 ⊙ NS, and hadronic priors being preferred by the considered astrophysical data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

SU-E-T-295: Simultaneous Beam Sampling and Aperture Shape Optimization for Station Parameter Optimized Radiation Therapy (SPORT)

Purpose: Station Parameter Optimized Radiation Therapy (SPORT) was recently proposed to fully utilize the technical capability of emerging digital LINACs, in which the station parameters of a delivery system, (such as aperture shape and weight, couch position/angle, gantry/collimator angle) are optimized altogether. SPORT promises to deliver unprecedented radiation dose distributions efficiently, yet there does not exist any optimization algorithm to implement it. The purpose of this work is to propose an optimization algorithm to simultaneously optimize the beam sampling and aperture shapes. Methods: We build a mathematical model whose variables are beam angles (including non-coplanar and/or even nonisocentric beams) and aperture shapes. To solve the resulting large scale optimization problem, we devise an exact, convergent and fast optimization algorithm by integrating three advanced optimization techniques named column generation, gradient method, and pattern search. Column generation is used to find a good set of aperture shapes as an initial solution by adding apertures sequentially. Then we apply the gradient method to iteratively improve the current solution by reshaping the aperture shapes and updating the beam angles toward the gradient. Algorithm continues by pattern search method to explore the part of the search space that cannot be reached by the gradient method. Results: The proposed technique is applied to a series of patient cases and significantly improves the plan quality. In a head-and-neck case, for example, the left parotid gland mean-dose, brainstem max-dose, spinal cord max-dose, and mandible mean-dose are reduced by 10%, 7%, 24% and 12% respectively, compared to the conventional VMAT plan while maintaining the same PTV coverage. Conclusion: Combined use of column generation, gradient search and pattern search algorithms provide an effective way to optimize simultaneously the large collection of station parameters and significantly improves quality of resultant treatment plans as compared with conventional VMAT or IMRT treatments.

07 ISOTOPE AND RADIATION SOURCES↗

A Bayesian approach to tracking patients having changing pharmacokinetic parameters

This paper considers the updating of Bayesian posterior densities for pharmacokinetic models associated with patients having changing parameter values. For estimation purposes it is proposed to use the Interacting Multiple Model (IMM) estimation algorithm, which is currently a popular algorithm in the aerospace community for tracking maneuvering targets. The IMM algorithm is described, and compared to the multiple model (MM) and Maximum A-Posteriori (MAP) Bayesian estimation methods, which are presently used for posterior updating when pharmacokinetic parameters do not change. Both the MM and MAP Bayesian estimation methods are used in their sequential forms, to facilitate tracking of changing parameters. Results indicate that the IMM algorithm is well suited for tracking time-varying pharmacokinetic parameters in acutely ill and unstable patients, incurring only about half of the integrated error compared to the sequential MM and MAP methods on the same example.

Bayes Theorem↗

Productions of heavy charged leptons via gluon fusion at the LHC: A revisit

Heavy charged lepton productions via gluon fusion at the LHC are revisited. Full loop calculations are adopted with an updated parton distribution function and electroweak data. Including contribution from new generation quarks in the loop, pair production of the sequential heavy lepton via gluon fusion at the LHC dominates over that via the Drell-Yan mechanism in some heavy lepton mass range. Exotic lepton single production of vectorlike lepton extended models is also calculated. In the later case, the gluon fusion mechanism via the Higgs exchange is emphasized. Our numerical results for both pair and single production of heavy leptons are smaller than previous studies especially for a large heavy lepton mass as a result of full loop calculation and due to the mixing angles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

When ancient numerical demons meet physics-informed machine learning: adjoint-based gradients for implicit differentiable modeling

Recent advances in differentiable modeling, a genre of physics-informed machine learning that trains neural networks (NNs) together with process-based equations, have shown promise in enhancing hydrological models' accuracy, interpretability, and knowledge-discovery potential. Current differentiable models are efficient for NN-based parameter regionalization, but the simple explicit numerical schemes paired with sequential calculations (operator splitting) can incur numerical errors whose impacts on models' representation power and learned parameters are not clear. Implicit schemes, however, cannot rely on automatic differentiation to calculate gradients due to potential issues of gradient vanishing and memory demand. Here we propose a “discretize-then-optimize” adjoint method to enable differentiable implicit numerical schemes for the first time for large-scale hydrological modeling. The adjoint model demonstrates comprehensively improved performance, with Kling–Gupta efficiency coefficients, peak-flow and low-flow metrics, and evapotranspiration that moderately surpass the already-competitive explicit model. Therefore, the previous sequential-calculation approach had a detrimental impact on the model's ability to represent hydrological dynamics. Furthermore, with a structural update that describes capillary rise, the adjoint model can better describe baseflow in arid regions and also produce low flows that outperform even pure machine learning methods such as long short-term memory networks. The adjoint model rectified some parameter distortions but did not alter spatial parameter distributions, demonstrating the robustness of regionalized parameterization. Despite higher computational expenses and modest improvements, the adjoint model's success removes the barrier for complex implicit schemes to enrich differentiable modeling in hydrology.

58 GEOSCIENCES↗

Biochemical Conversion of Lignocellulosic Biomass to Hydrocarbon Fuels and Products (2021 State of Technology and Future Research)

The annual State of Technology (SOT) assessment is an essential activity for biochemical platform research. It allows the impact of research progress to be quantified in terms of economic improvements in the overall cellulosic biofuel production process for a particular conversion pathway. As such, initial benchmarks can be established for currently demonstrated performance and progress can be tracked towards out-year goals to ultimately demonstrate cost-competitive cellulosic biofuel technology. The purpose of this report is to benchmark the latest experimental developments across a number of potential bioconversion pathways as quantified by modeled minimum fuel selling prices (MFSPs), as a measure of current status relative to those final targets. For this state of technology, TEA models were run for two separate biological conversion pathways to fuels, based on available data for integrated biomass deconstruction and hydrolysate processing; namely carboxylic acids (primarily butyric acid) and diols (2,3-butanediol [BDO]), reflecting NREL's recently-published 2018 biochemical design report focused on those two pathways. The models were run across three scenarios for lignin utilization, namely combustion, conversion to coproducts based on "base case" performance with biomass hydrolysate, and conversion to coproducts based on "high" performance demonstrated with model lignin monomer components. A key improvement reflected in the 2021 SOT is centered around making use of the latest lignin conversion data, which over the past year focused primarily on production of ß-ketoadipate (BKA) as a more optimal molecule compared to the closely-related adipic acid coproduct of prior recent focus, both in terms of superior product properties and biology, as well as reduced processing complexity (reducing two steps for sequential production of muconate followed by hydrogenation to adipic acid down to a single step for direct production of BKA). This update translated to a roughly 17% increase in mass yield of final coproduct output at a nearly four-fold increase in fermentation productivity on lignin monomers relative to prior 2020 SOT benchmarks for muconic/adipic acid production.

09 BIOMASS FUELS↗

Learning to Trigger: Reinforcement Learning at the Large Hadron Collider

High-throughput scientific facilities such as the Large Hadron Collider depend on real-time event filtering (\textit{triggering}) under tight constraints on bandwidth, latency, and storage. In practice, trigger menus are largely static and hand-tuned and can become suboptimal as detector conditions, pileup, and background composition drift over time. We cast online threshold tuning as a sequential decision-making problem: a reinforcement learning agent ingests streaming summaries of recent rates and signal-sensitive features and updates trigger thresholds to maximize signal efficiency while tracking a target background rate within a tolerance band. We adapt Group-Filtered Policy Optimization (GFPO) to streaming control and introduce two variants (GFPO-F, GFPO-FR) that enforce background rate feasibility during training. On a benchmark that emulates realistic collider operation, we study two representative triggers: a total transverse energy ($H_{T}$) trigger sensitive to pileup variation, and an anomaly-detection (AD) trigger based on reconstruction loss for rare or non-standard signatures. On Monte Carlo streams, our agent increases the fraction of in-tolerance time intervals by 48% ($H_T$) and 28% (AD), with a cumulative gain of up to 2% in signal efficiency on those in-tolerance intervals. Transferring from simulation to \emph{real} collision data (CMS Run 283408), the same agent, without fine-tuning, achieves a 56% ($H_T$) and 28% (AD) in-tolerance improvement over baselines, with further signal-efficiency gain on both triggers. To our knowledge, this is the \emph{first} demonstration of RL-based trigger control on real Large Hadron Collider collision data. Code is available at https://github.com/Zixind/GFPO_LHC (see repo for details).

Ding, Zixin [Chicago U.]↗

Galileo spacecraft autonomous attitude determination using a V-slit star scanner

The autonomous attitude determination system of Galileo spacecraft, consisting of a radiation hardened star scanner and a processing algorithm is presented. The algorithm applying to this system are the sequential star identification and attitude estimation. The star scanner model is reviewed in detail and the flight software parameters that must be updated frequently during flight, due to degradation of the scanner response and the star background change are identified.

Mobasser, Sohrab↗

A 20 MHz CMOS reorder buffer for a superscalar microprocessor

Superscalar processors can achieve increased performance by issuing instructions out-of-order from the original sequential instruction stream. Implementing an out-of-order instruction issue policy requires a hardware mechanism to prevent incorrectly executed instructions from updating register values. A reorder buffer can be used to allow a superscalar processor to issue instructions out-of-order and maintain program correctness. This paper describes the design and implementation of a 20MHz CMOS reorder buffer for superscalar processors. The reorder buffer is designed to accept and retire two instructions per cycle. A full-custom layout in 1.2 micron has been implemented, measuring 1.1058 mm by 1.3542 mm.

Lenell, John↗

Robust determination of the chemical potential in the pole expansion and selected inversion method for solving Kohn-Sham density functional theory

Fermi operator expansion (FOE) methods are powerful alternatives to diagonalization type methods for solving Kohn-Sham density functional theory (KSDFT). One example is the pole expansion and selected inversion (PEXSI) method, which approximates the Fermi operator by rational matrix functions and reduces the computational complexity to at most quadratic scaling for solving KSDFT. Unlike diagonalization type methods, the chemical potential often cannot be directly read off from the result of a single step of evaluation of the Fermi operator. Hence multiple evaluations are needed to be sequentially performed to compute the chemical potential to ensure the correct number of electrons within a given tolerance. This hinders the performance of FOE methods in practice. In this paper, we develop an efficient and robust strategy to determine the chemical potential in the context of the PEXSI method. The main idea of the new method is not to find the exact chemical potential at each self-consistent-field (SCF) iteration but to dynamically and rigorously update the upper and lower bounds for the true chemical potential, so that the chemical potential reaches its convergence along the SCF iteration. Instead of evaluating the Fermi operator for multiple times sequentially, our method uses a two-level strategy that evaluates the Fermi operators in parallel. In the regime of full parallelization, the wall clock time of each SCF iteration is always close to the time for one single evaluation of the Fermi operator, even when the initial guess is far away from the converged solution. We demonstrate the effectiveness of the new method using examples with metallic and insulating characters, as well as results from ab initio molecular dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

CMOS VLSI Active-Pixel Sensor for Tracking

An architecture for a proposed active-pixel sensor (APS) and a design to implement the architecture in a complementary metal oxide semiconductor (CMOS) very-large-scale integrated (VLSI) circuit provide for some advanced features that are expected to be especially desirable for tracking pointlike features of stars. The architecture would also make this APS suitable for robotic- vision and general pointing and tracking applications. CMOS imagers in general are well suited for pointing and tracking because they can be configured for random access to selected pixels and to provide readout from windows of interest within their fields of view. However, until now, the architectures of CMOS imagers have not supported multiwindow operation or low-noise data collection. Moreover, smearing and motion artifacts in collected images have made prior CMOS imagers unsuitable for tracking applications. The proposed CMOS imager (see figure) would include an array of 1,024 by 1,024 pixels containing high-performance photodiode-based APS circuitry. The pixel pitch would be 9 m. The operations of the pixel circuits would be sequenced and otherwise controlled by an on-chip timing and control block, which would enable the collection of image data, during a single frame period, from either the full frame (that is, all 1,024 ~ 1,024 pixels) or from within as many as 8 different arbitrarily placed windows as large as 8 by 8 pixels each. A typical prior CMOS APS operates in a row-at-a-time ( grolling-shutter h) readout mode, which gives rise to exposure skew. In contrast, the proposed APS would operate in a sample-first/readlater mode, suppressing rolling-shutter effects. In this mode, the analog readout signals from the pixels corresponding to the windows of the interest (which windows, in the star-tracking application, would presumably contain guide stars) would be sampled rapidly by routing them through a programmable diagonal switch array to an on-chip parallel analog memory array. The diagonal-switch and memory addresses would be generated by the on-chip controller. The memory array would be large enough to hold differential signals acquired from all 8 windows during a frame period. Following the rapid sampling from all the windows, the contents of the memory array would be read out sequentially by use of a capacitive transimpedance amplifier (CTIA) at a maximum data rate of 10 MHz. This data rate is compatible with an update rate of almost 10 Hz, even in full-frame operation

Pain, Bedabrata↗

ADAPTIVE GROUP TESTING WITH MISMATCHED MODELS

Accurate detection of infected individuals is one of the critical steps in stopping any pandemic. When the underlying infection rate of the disease is low, testing people in groups, instead of testing each individual in the population, can be more efficient. In this work, we consider noisy adaptive group testing design with specific test sensitivity and specificity that select the optimal group given previous test results based on pre-selected utility function. As in prior studies on group testing, we model this problem as a sequential Bayesian Optimal Experimental Design (BOED) to adaptively design the groups for each test. We analyze the required number of group tests when using the updated posterior on the infection status and the corresponding Mutual Information (MI) as our utility function for selecting new groups. More importantly, we study how the potential bias on the ground-truth noise of group tests may affect the group testing sample complexity.

97 MATHEMATICS AND COMPUTING↗

More About Architecture For Intelligent Robotic Control

Boolean neural networks proposed to implement part of intermediate level of hierarchical architecture of control system for artificially intelligent control of robot hand. Concept described in "Architecture for Intelligent Control of Robotic Tasks" (NPO-17871). Rule level of architecture implemented in two Boolean neural networks operated and updated in alternation. No explicit programming of network. Internal configuration not unique but, depends on initial state and history of previous adaptations. Accepts new rules sequentially presented by external controller.

Fiorini, Paolo↗

Documentation for a Structural Optimization Procedure Developed Using the Engineering Analysis Language (EAL)

This report describes a structural optimization procedure developed for use with the Engineering Analysis Language (EAL) finite element analysis system. The procedure is written primarily in the EAL command language. Three external processors which are written in FORTRAN generate equivalent stiffnesses and evaluate stress and local buckling constraints for the sections. Several built-up structural sections were coded into the design procedures. These structural sections were selected for use in aircraft design, but are suitable for other applications. Sensitivity calculations use the semi-analytic method, and an extensive effort has been made to increase the execution speed and reduce the storage requirements. There is also an approximate sensitivity update method included which can significantly reduce computational time. The optimization is performed by an implementation of the MINOS V5.4 linear programming routine in a sequential liner programming procedure.

Martin, Carl J., Jr.↗

Analysis and Synthesis of Load Forecasting Data for Renewable Integration Studies: Preprint

As renewable energy constitutes greater portions of the generation fleet, the importance of modeling uncertainty as part of integration studies also increases. In pursuit of optimal system operations, it is important to capture not only the definitive behavior of power plants, but also the risks associated with systemwide interactions. This research examines the dependence of load forecast errors on external predictor variables such as temperature, day type, and time of day. The analysis was utilized to create statistically relevant instances of sequential load forecasts with only a time series of historic, measured load available. The creation of such load forecasts relies on Bayesian techniques for informing and updating the model, thus providing a basis for networked and adaptive load forecast models in future operational applications.

17 WIND ENERGY↗

Toward Well-Provenanced Computer System Benchmarking: An Update

This report provides an update on the current design, implementation, and usage of bueno, a Python framework enabled by container technology that supports gradations of reproducibility for wellprovenanced benchmarking of sequential and parallel programs. The ultimate goal of the bueno project is to provide convenient access to mechanisms that aid in the automated generation, collection, and dissemination of data relevant for experimental reproducibility in computer system benchmarking.

97 MATHEMATICS AND COMPUTING↗