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 469 records · Page 26

SU-E-T-95: Delivery Time Estimator

Purpose: The development and testing of a tool for the inclusion of delivery time as a parameter in plan optimization. Methods: We developed an algorithm that estimates the time required for the machine and personnel movements required to deliver a treatment plan on a linear accelerator. We included dose rate, leaf motion, collimator motion, gantry motion, and couch motions (including time to enter the room to rotate the couch safely). Vault-specific parameters to account for time to enter and perform couch angle adjustments were also included. This algorithm works for static, step and shoot IMRT, and VMAT beams photon beams and for fixed electron beams. This was implemented as a script in our treatment planning system. We validated the estimator against actual recorded delivery time from our R and V system as well as recorded times from our IMRT QA delivery. Results: Data was collected (Figure 1) for 12 treatment plans by examining the R and V beam start times, and by manually timing the QA treatment for a reference, but the QA measurements were only significant to the nearest minute. The average difference between the estimated and R and V times was 15%, and 11% when excluding the major outliers. Outliers arose due to respiratory aides and gating techniques which could not be accounted for in the estimator. Conclusion: Non-mechanical factors such as the time a therapist needs to walk in and out of the room to adjust the couch needed to be fine-tuned and cycled back into the algorithm to improve the estimate. The algorithm has been demonstrated to provide reasonable and useful estimates for delivery time. This estimate has provided a useful additional input for clinical decision-making when comparing several potential radiation treatment options.

07 ISOTOPE AND RADIATION SOURCES↗

MANCINTAP: Time and space dependent neutron activation tool algorithm improvement and analysis of a PWR nozzle gallery

MANCINTAP [1], a fully automated tool for determining the activation patterns in complex 4D scenarios and evaluating the distribution of the ensuing radiation fields, has been improved. The constraint of forcing the user to define a single global mesh in order to approximate the whole problem, a limitation which prevented an accurate description of detail-rich geometries, has been overcome. The algorithm was improved and many limitations were relaxed. MANCINTAP is now capable of handling many different geometry elements in a given area at once, even if they have very different geometries and characteristic dimensions, thus allowing a vastly more complete and detailed analysis. Different meshes can be superimposed to the 3D geometry, allowing for an appropriate, dedicated treatment of all the relevant features of the problem, and the results are automatically combined in order to provide a global perspective. These new capabilities were accurately tested by applying the tool to the study of time-dependent radiation levels during shutdown in the upper reactor cavity and nozzle gallery regions of a 2-loop PWR reactor. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A fourth-order adaptive mesh refinement algorithm for the multicomponent, reacting compressible Navier–Stokes equations

In this study, we present a fourth-order in space and time block-structured adaptive mesh refinement algorithm for the compressible multicomponent reacting Navier–Stokes equations. The algorithm uses a finite-volume approach that incorporates a fourth-order discretisation of the convective terms. The time-stepping algorithm is based on a multi-level spectral deferred corrections method that enables explicit treatment of advection and diffusion coupled with an implicit treatment of reactions. The temporal scheme is embedded in a block-structured adaptive mesh refinement algorithm that includes subcycling in time with spectral deferred correction sweeps applied on levels. Here we present the details of the multi-level scheme paying particular attention to the treatment of coarse–fine boundaries required to maintain fourth-order accuracy in time. We then demonstrate the convergence properties of the algorithm on several test cases including both non-reacting and reacting flows. Finally we present simulations of a vitiated dimethyl ether jet in 2D and a turbulent hydrogen jet in 3D, both with detailed kinetics and transport.

97 MATHEMATICS AND COMPUTING↗

Reactive burn models and ignition & growth concept

Plastic-bonded explosives are heterogeneous materials. Experimentally, shock initiation is sensitive to small amounts of porosity, due to the formation of hot spots (small localized regions of high temperature). This leads to the Ignition and Growth concept, introduced by Lee and Tarver in 1980, as the basis for reactive burn models. A homogeneized burn rate needs to account for three mesoscale physical effects (i) the density of burnt hot spots, which depends on the lead shock strength; (ii) the growth of the burn fronts triggered by hot spots, which depends on the local deflagration speed; (iii) a geometric factor that accounts for the overlap of deflagration wavelets from adjacent hot spots. These effects can be combined and the burn model defined by specifying the reaction progress variable {lambda}(t) as a function of a dimensionless reaction length {tau}{sub hs}(t)/{ell}{sub hs}, rather than by xpecifying an explicit burn rate. The length scale {ell}{sub hs} is the average distance between hot spots, which is proportional to [N{sub hs}(P{sub s})]{sup -1/3}, where N{sub hs} is the number density of hot spots activated by the lead shock. The reaction length {tau}{sub hs}(t) = {line_integral}{sub 0}{sup t} D(P(t'))dt' is the distance the burn front propagates from a single hot spot, where D is the deflagration speed and t is the time since the shock arrival. A key implementation issue is how to determine the lead shock strength in conjunction with a shock capturing scheme. They have developed a robust algorithm for this purpose based on the Hugoniot jump condition for the energy. The algorithm utilizes the time dependence of density, pressure and energy within each cell. The method is independent of the numerical dissipation used for shock capturing. It is local and can be used in one or more space dimensions. The burn model has a small number of parameters which can be calibrated to fit velocity gauge data from shock initiation experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Identification of periods of clear sky irradiance in time series of GHI measurements

In this study, we present a simple algorithm for identifying periods of time with broadband global horizontal irradiance (GHI) similar to that occurring during clear sky conditions from a time series of GHI measurements. Other available methods to identify these periods do so by identifying periods with clear sky conditions using additional measurements, such as direct or diffuse irradiance. Our algorithm compares characteristics of the time series of measured GHI with the output of a clear sky model without requiring additional measurements. We validate our algorithm using data from several locations by comparing our results with those obtained from a clear sky detection algorithm, and with satellite and ground-based sky imagery.

14 SOLAR ENERGY↗

A compact digital time differential perturbed angular correlation-spectrometer using field programmable gate arrays and various timestamp algorithms

A user-friendly fully digital time differential perturbed angular correlation (TDPAC)-spectrometer with six detectors and fast digitizers using field programmable gate arrays (FPGA) is described and performance data are given. The new spectrometer has an online data analysis feature, a compact size, and a time resolution such as conventional analog spectrometers. Its calculation intensive part was implemented inside the digitizer. This gives the possibility to change parameters (energy windows, constant fraction trigger delay) and see their influence immediately in the {gamma}-{gamma} correlation diagrams. Tests were performed which showed that the time resolution using a {sup 60}Co source with energy window set at 1.17 MeV and 1.33 MeV is 265 ps with LaBr{sub 3}(Ce) scintillators and 254 ps with BaF{sub 2} scintillators. A true constant fraction algorithm turned out to be slightly better than the constant fraction of amplitude method. The spectrometer performance was tested with a TDPAC measurement using a {sup 44}Ti in rutile source and a positron lifetime measurement using {sup 22}Na. The maximum possible data rate of the spectrometer is 1.1 x 10{sup 6} {gamma} quanta per detector and second.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SU-E-T-629: Prediction of the ViewRay Radiotherapy Treatment Time for Clinical Logistics

Purpose: An algorithm is developed in our clinic, given a new treatment plan, to predict treatment delivery time for radiation therapy (RT) treatments of patients on ViewRay magnetic resonance-image guided radiation therapy (MR-IGRT) delivery system. This algorithm is necessary for managing patient treatment appointments, and is useful as an indicator to assess the treatment plan complexity. Methods: A patient’s total treatment delivery time, not including time required for localization, may be described as the sum of four components: (1) the treatment initialization time; (2) the total beam-on time; (3) the gantry rotation time; and (4) the multileaf collimator (MLC) motion time. Each of the four components is predicted separately. The total beam-on time can be calculated using both the planned beam-on time and the decay-corrected delivery dose rate. To predict the remaining components, we quantitatively analyze the patient treatment delivery record files. The initialization time is demonstrated to be random since it depends on the final gantry angle and MLC leaf positions of the previous treatment. Based on modeling the relationships between the gantry rotation angles and the corresponding rotation time, and between the furthest MLC leaf moving distance and the corresponding MLC motion time, the total delivery time is predicted using linear regression. Results: The proposed algorithm has demonstrated the feasibility of predicting the ViewRay treatment delivery time for any treatment plan of any patient. The average prediction error is 0.89 minutes or 5.34%, and the maximal prediction error is 2.09 minutes or 13.87%. Conclusion: We have developed a treatment delivery time prediction algorithm based on the analysis of previous patients’ treatment delivery records. The accuracy of our prediction is sufficient for guiding and arranging patient treatment appointments on a daily basis. The predicted delivery time could also be used as an indicator to assess the treatment plan complexity. This work was supported by a research grant from Viewray Inc.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Application of machine learning approaches in the analysis of mass absorption cross-section of black carbon aerosols: Aerosol composition dependencies and sensitivity analyses

Physics-based models typically require an in-depth understanding of a phenomenon and assumptions of the underlying process(es), which are often hard to obtain in practice, whereas data-driven machine learning models learn the structure and patterns in the training data without any prior theoretical assumptions and then use inference to develop useful predictions. A novel machine learning-based algorithm has been previously developed for the prediction of black carbon mass absorption cross-section (MAC BC ) and applied to a variety of different atmospheric environments. In contrast to light scattering theories which require assumptions about the underlying physics, this algorithm uses time-series data of aerosol properties to estimate the temporally-varying MAC BC at 870 nm. Here, we analyze our algorithm and discuss the influence of aerosol optical properties (such as Ångström exponents and single scattering albedo) and chemical composition on the model outputs and the associated accuracy. Additionally, we conduct sensitivity analyses on our models to understand how the predictions change in response to different sets of input variables. Our support vector machine (SVM) for regression model is the least sensitive to variations in the input variables, although all models tend to exhibit a degradation to their accuracy when scattering Ångström exponents are less than one.

54 ENVIRONMENTAL SCIENCES↗

Complex network approach to fractional time series

In order to extract correlation information inherited in stochastic time series, the visibility graph algorithm has been recently proposed, by which a time series can be mapped onto a complex network. We demonstrate that the visibility algorithm is not an appropriate one to study the correlation aspects of a time series. We then employ the horizontal visibility algorithm, as a much simpler one, to map fractional processes onto complex networks. The degree distributions are shown to have parabolic exponential forms with Hurst dependent fitting parameter. Further, we take into account other topological properties such as maximum eigenvalue of the adjacency matrix and the degree assortativity, and show that such topological quantities can also be used to predict the Hurst exponent, with an exception for anti-persistent fractional Gaussian noises. To solve this problem, we take into account the Spearman correlation coefficient between nodes' degrees and their corresponding data values in the original time series.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Pulsar-Inspired Timing Framework for Power System: Optimization and Performance Evaluation

Due to their excellent stability, neutron pulsar stars are considered promising candidate timing sources for power system applications. However, the complexity of pulsar signals necessitates advanced processing algorithms to provide accurate timing references. This paper presents the foundational framework for pulsar signal processing, serving as the basis for further optimization. To enhance the timing accuracy and computation efficiency in pulsar period searches, three algorithms are proposed as the initial optimization step: wavelet de-noising, fast folding, and cross-correlation for profile evaluation. Wavelet de-noising improves signal-to-noise ratio (SNR) by 36%–70%. Fast folding reduces computation time from hundreds of seconds to mere milliseconds. Cross-correlation works better than traditional SNR-based methods by effectively identifying the optimal period. The performance of the proposed algorithms is evaluated using observation data from telescopes. Together, these algorithms significantly improve pulsar timing performance, reducing the error of the Pulse Per Second (PPS) signal from hundreds to tens of microseconds.

Wu, Ori [ORNL] (ORCID:0000000326723410)↗

Exact and heuristic algorithms for minimizing Tardy/Lost penalties on a single-machine scheduling problem

This paper addresses minimizing Tardy/Lost penalties with common due dates on a single machine. According to this penalty criterion, if tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. The problem is formulated as an integer programming model, and a heuristic algorithm is constructed. Then, using the proposed dominance rules and lower bounds, we develop two dynamic programming algorithms as well as a branch and bound. Experimental results show that the heuristic algorithm has an average optimality gap less than 2 % in all problem sizes. Instances up to 250 jobs with low variety of process times are optimally solved and for high process time varieties, the algorithms solved all instances up to 75 jobs.

97 MATHEMATICS AND COMPUTING↗

Small-angle Coulomb collision model for particle-in-cell simulations

We construct and investigate a set of stochastic differential equations that incorporate the physics of velocity-dependent small-angle Coulomb collisions among the plasma particles in a particle-in-cell simulation. Each particle is scattered stochastically from all the other particles in a simulation cell modeled as one or more Maxwellians. Total energy and momentum are conserved by linear transformation of the velocity increments. In two test simulations the proposed 'particle-moment' collision algorithm performs well with time steps as large as 10% of the relaxation time - far larger than a particle-pairing collision algorithm, in which pairs of particles are scattered from one another, requires to achieve the same accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finding Fast Transients in Real Time Using a Novel Light-curve Analysis Algorithm

The current data acquisition rate of astronomical transient surveys and the promise for significantly higher rates in the next decade necessitate the development of novel approaches to analyze astronomical data sets and promptly detect objects of interest. The Deeper, Wider, Faster (DWF) program is a survey focused on the identification of fast-evolving transients, such as fast radio bursts, gamma-ray bursts, and supernova shock breakouts. It employs multifrequency simultaneous coverage of the same part of the sky over several orders of magnitude. Using the Dark Energy Camera mounted on the 4 m Blanco telescope, DWF captures a 20 s g -band exposure every minute, at a typical seeing of ~1'' and an air mass of ~1.5. These optical data are collected simultaneously with observations conducted over the entire electromagnetic spectrum—from radio to γ -rays—as well as cosmic-ray observations. In this paper, we present a novel real-time light-curve analysis algorithm, designed to detect transients in the DWF optical data; this algorithm functions independently from, or in conjunction with, image subtraction. We present a sample of fast transients detected by our algorithm, as well as a false-positive analysis. Our algorithm is customizable and can be tuned to be sensitive to transients evolving over different timescales and flux ranges.

79 ASTRONOMY AND ASTROPHYSICS↗

Performance Evaluation of Distributed Energy Resource Management Algorithm in Large Distribution Networks

This paper presents performance evaluation of hierarchical optimization and control for distributed energy resource management system (DERMS) in large distribution networks via an advanced hardware-in-the-loop (HIL) platform. The HIL platform provides realistic testing in a laboratory envi-ronment, including the accurate modeling of a full-scale dis-tribution system of 11,000 nodes, the DERMS software con-troller, and 90 power hardware photovoltaics (PVs) and bat-tery inverters. The applied DERMS algorithm is designed based on a real-time optimal power flow algorithm and im-plemented with acceleration design that performs fast dis-patch of simulated PVs and real physical hardware DER devices every 4 seconds.

distributed energy management system (DERMS)↗

A Numerical Algorithm for the Solution of a Phase-Field Model of Polycrystalline Materials

We describe an algorithm for the numerical solution of a phase-field model (PFM) of microstructure evolution in polycrystalline materials. The PFM system of equations includes a local order parameter, a quaternion representation of local orientation and a species composition parameter. The algorithm is based on the implicit integration of a semidiscretization of the PFM system using a backward difference formula (BDF) temporal discretization combined with a Newton-Krylov algorithm to solve the nonlinear system at each time step. The BDF algorithm is combined with a coordinate projection method to maintain quaternion unit length, which is related to an important solution invariant. A key element of the Newton-Krylov algorithm is the selection of a preconditioner to accelerate the convergence of the Generalized Minimum Residual algorithm used to solve the Jacobian linear system in each Newton step. Results are presented for the application of the algorithm to 2D and 3D examples.

36 MATERIALS SCIENCE↗

Anomaly Identification of Synchronized Voltage Waveform for Situational Awareness of Low Inertia Systems

Inverter-based resources (IBRs) such as photovoltaics (PVs), wind turbines, and battery energy storage systems (BESSs) are widely deployed in low-carbon power systems. However, these resources typically do not provide the inertia needed for grid stability, resulting in a low-inertia power system. IBRs and lack of inertia have been known to cause anomalies such as waveform distortions and wideband oscillations in power systems due to the limited inertia level, leading to increased generation trips and load shedding. Here, to achieve effective anomaly identification, this paper proposes a synchro-waveform-based algorithm utilizing real-time synchronized voltage waveform measurements from waveform measurement units (WMUs). In the proposed method, different physical characteristics, as well as statistical features, are extracted from synchronized voltage waveform measurements to filter anomalies. Then, the anomaly identification approach based on the random forest is developed and deployed into the FNET/GridEye system considering trade-offs among accuracy, computational burden, and deployment cost. Moreover, four WMUs are specially designed and deployed on Kauai Island to receive instantaneous synchronized voltage waveform measurements. To verify the performance of the proposed algorithm, different experiments are carried out with collected field test data. The result demonstrates that the performance of the proposed synchro-waveform-based anomaly categorization algorithm can accurately identify anomalies 95.35% of the time, which has comparable performance among benchmarking algorithms.

Situational awareness↗

Computationally efficient Bayesian estimation of graphical networks for omics data

Graphical networks are useful, widely-used modeling approaches to represent complex biological processes with biological measurements generated by platforms such as mass spectrometry. Bayesian analyses of graphical networks for omics data have several advantages over their frequentist counterparts, such as the inclusion of prior knowledge in the estimation of models. However, Bayesian approaches to date have only been feasible for data with a couple hundred biomolecules due to prohibitive computational time, but omics data often contains tens of thousands of biomolecules. Here, we present and illustrate a more computationally efficient approach named BPlane (Bayesian PseudoLikelihood-based Algorithm for Network Estimation) to extend Bayesian modeling capabilities for larger-sized datasets, such as most untargeted proteomics data. Via simulation, we demonstrate that BPlane produces substantial computational savings over a current state-of-the-art Bayesian algorithm while maintaining competitive edge detection accuracy. On a SARS-CoV2 proteomics data with 7000 proteins, the competing algorithm takes three times as long to complete the first iteration as BPlane takes to converge after over 100 iterations.

EM algorithm↗

A Novel Multiple-Time Scale Integrator for the Hybrid Monte Carlo Algorithm

Hybrid Monte Carlo simulations that implement the fermion action using multiple terms are commonly used. By the nature of their formulation they involve multiple integration time scales in the evolution of the system through simulation time. These different scales are usually dealt with by the Sexton-Weingarten nested leapfrog integrator. In this scheme the choice of time scales is somewhat restricted as each time step must be an exact multiple of the next smallest scale in the sequence. A novel generalisation of the nested leapfrog integrator is introduced which allows for far greater flexibility in the choice of time scales, as each scale now must only be an exact multiple of the smallest step size.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗