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 631 records · Page 35

Vehicle Radiation Monitoring Systems for Medical Waste Disposal - 12102

Hospitals often declare their waste as being 'non-radioactive'; however this material often has excessive levels of radiation caused either by an accident or lack of control. To ensure the best possible protection against the accidental receipt of radioactive materials and as a safety precaution for their employees, waste-handling companies have installed large-scale radiation portal monitors at their weigh scales or entry gates of the incinerator plant, waste transfer station, and/or landfill. Large-volume plastic scintillator-based systems can be used to monitor radiation levels at entry points to companies handling medical waste. The recent and intensive field tests together with the thousands of accumulated hours of actual real-life vehicle scanning have proven that the plastic scintillation based system is an appropriate radiation control instrument for waste management companies. The Real-Time background compensation algorithm is flexible with automatic adjustable coefficients that will response to rapidly changing environmental and weather conditions maintaining the preset alarm threshold levels. The Dose Rate correction algorithms further enhance the system's ability to meet the stringent requirements of the waste industries need for Dose Rate measurements. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Autonomous Intelligent Charging/Discharging of Electric Vehicles using Distributed Multi-Agent ADMM Framework for Grid Ancillary Services

The increasing popularity of Electric Vehicles (EVs) in the distribution grid along with technological advancement in EV electronics such as vehicle to grid (V2G) technique has enabled them to participate in grid ancillary services. To achieve this, the EVs need to establish a contract with third-party aggregators and connect to a charging unit, either residential or commercial. At any time they are connected, the EVs can decide to take part in the ancillary services program offered to them by the aggregators. If agreed, the aggregators will use the EVs as a power source capable of charging/discharging power according to the input signal, and in return, they will be compensated. This inter-temporal nature of charging/discharging is also transforming the traditional optimal power flow (OPF) problem into a dynamic OPF problem. This chapter aims at developing a multi-layer time-dependent optimization algorithm to utilize EV potential and provide ancillary services while maximizing its utilization function. Specifically, in the upper layer, an autonomous distributed ADMM algorithm is developed to optimize the cost for charging/discharging EVs while using them to regulate the voltage at each bus in the distribution grid. The distributed ADMM algorithm is also expanded to the lower layer where the individual EVs active and reactive power is controlled for voltage regulation while maintaining the desired state of the charge of the vehicle at the end of the charging period. Here, the effectiveness and performance improvement of the proposed multi-layer algorithm is illustrated through analytical analysis and simulation results.

Rahman, Towfiq↗

Autonomous Intelligent Charging/Discharging of Electric Vehicles using Distributed Multi-Agent ADMM Framework for Grid Ancillary Services

The increasing popularity of Electric Vehicles (EVs) in the distribution grid along with technological advancement in EV electronics such as vehicle to grid (V2G) technique has enabled them to participate in grid ancillary services. To achieve this, the EVs need to establish a contract with third-party aggregators and connect to a charging unit, either residential or commercial. At any time they are connected, the EVs can decide to take part in the ancillary services program offered to them by the aggregators. If agreed, the aggregators will use the EVs as a power source capable of charging/discharging power according to the input signal, and in return, they will be compensated. This inter-temporal nature of charging/discharging is also transforming the traditional optimal power flow (OPF) problem into a dynamic OPF problem. This chapter aims at developing a multi-layer time-dependent optimization algorithm to utilize EV potential and provide ancillary services while maximizing its utilization function. Specifically, in the upper layer, an autonomous distributed ADMM algorithm is developed to optimize the cost for charging/discharging EVs while using them to regulate the voltage at each bus in the distribution grid. The distributed ADMM algorithm is also expanded to the lower layer where the individual EVs active and reactive power is controlled for voltage regulation while maintaining the desired state of the charge of the vehicle at the end of the charging period. The effectiveness and performance improvement of the proposed multi-layer algorithm is illustrated through analytical analysis and simulation results.

Rahman, Towfiq↗

Precise Motion Control of Hybrid Hydraulic Electric Architecture (HHEA)

Off-highway heavy-duty vehicles have been long-standing users of hydraulic systems for power transmission and control. However, traditional hydraulic systems suffer from significant energy losses which lead to increased operating costs and a larger carbon footprint due to higher CO2 emissions. Improving the efficiency of these mobile machines is crucial not only for reducing their environmental impact but also for saving billions of dollars in operating costs. Currently, the state-of-the-art Load Sensing Architecture uses throttling valves for control, which significantly reduces its efficiency and does not recuperate energy from over-running loads. Researchers have developed several architectures such as Common Pressure Rail systems, Displacement Control, STEAM, and Electrohydraulic Architecture to improve the efficiency of off-road mobile machines. However, each of these architectures has its drawbacks. To increase system efficiency and take advantage of electrification benefits, our research group has developed a novel Hybrid Hydraulic-Electric Architecture (HHEA). The HHEA can significantly improve efficiency, decrease the size of electrical components, and maintain control performance. This new architecture has the potential to revolutionize the off-highway mobile machine industry and lead to a more sustainable future. The HHEA uses a set of common pressure rails to provide the majority of power to the actuators via power-dense hydraulics and uses electric motors for precise control and power modulation. In the context of off-road mobile machines, energy savings are undoubtedly important but it is equally important to consider the machines’ ability to perform tasks with precision and accuracy according to given commands. Therefore, precise motion control is of utmost importance to maintain the utility of Hybrid Hydraulic-Electric Architecture (HHEA). The HHEA presents a unique challenge to motion control due to the discrete pressure changes that occur when the system switches between selected pressure rails. These changes are made to minimize system inefficiencies or to keep the system within the torque capability of the electric motor. Hence, it is important to solve the motion control challenges for HHEA. This thesis aims at developing an effective motion control strategy for HHEA. The dissertation presents a two-tiered control strategy for HHEA, comprising a high-level and a low-level controller. The primary responsibility of the high- level controller is to optimize energy efficiency by making informed pressure rail selections. On the other hand, the low-level controller is focused on achieving precise motion control of the HHEA, which is crucial for realizing the desired reference trajectories. To achieve this, the low-level controller utilizes a passivity-based backstepping integral controller as the nominal control, which handles the motion control between two pressure rail switches. Additionally, a separate least norm controller is utilized as a transition controller to manage motion control during pressure rail transitions. The effectiveness of the combined control strategy is demonstrated through experiments conducted on two hardware-in-the-loop testbeds. Furthermore, the HHEA is installed on the boom and stick actuators of a backhoe arm to build a Human-in-the-Loop system that a human operator can control. A real-time rail switching algorithm is developed to determine pressure rail switching based on present duty cycle information from the operator. Modifications have been made to the human-machine interface to achieve more intuitive control. Modifications include performing control in the task-oriented coordinates, incorporating pressure feedback to enhance control with physical interaction, and using velocity field control to simplify multi-degree-of-freedom tasks and to enable novice operators to perform them with reduced risk, improved efficiency, and productivity. The research in this dissertation makes significant contributions to the field of off-road mobile machine control, providing a novel and effective control strategy for the HHEA, and demonstrating the potential for simplified machine operation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

ICRF wave propagation and absorption modelling via machine learning

A surrogate model of the wave absorption in the ion cyclotron range of frequencies is presented. The model is trained to capture the physics of 1D electron and ion power absorption profiles for both the high harmonic fast wave scheme in NSTX, and the minority heating scheme in WEST. The surrogate models, based on both the random forest regressor and the multilayer perceptron algorithms, reduce inference time of 1D power absorption profiles from 1-5 minutes required by TORIC to ∼50 µs with high accuracy (i.e. R2 = 0.71−0.96).

Sánchez-Villar↗

From Chaos to Clarity: Autonomous Materials Discovery for Extreme Environments

The pursuit of advanced functional materials for energy applications demands an understanding of their behavior under the most challenging conditions. Extreme environments, characterized by intense radiation, high temperatures, and corrosive chemistries, push materials to their limits, often revealing unexpected behaviors and degradation pathways. Traditional materials research approaches, relying on trial-and-error experimentation, are often slow and resource-intensive, ill-suited to the complexities of extreme environments. This talk will explore the transformative potential of autonomous materials science in revolutionizing our understanding of materials synthesis and degradation in extreme environments. By integrating advanced microscopy techniques, artificial intelligence, and robotic experimentation, we can accelerate the discovery and design of resilient materials for a sustainable future. The presentation will highlight recent breakthroughs in autonomous microscopy, computer vision, and machine learning, showcasing their ability to unravel complex material transformations at the atomic scale. The talk will also delve into the challenges and opportunities associated with deploying autonomous systems to probe extreme environments, emphasizing the importance of robust algorithms, real-time data analysis, and adaptive experimentation. Our ultimate goal is to empower scientists with unprecedented capabilities to explore, understand, and engineer materials that can withstand the harshest conditions, paving the way for innovations in energy, aerospace, and beyond.

artificial intelligence↗

Master State Distributed Estimator (masde)

The MSE technology provides a distributed state estimation scheme for power utilities by making it a real time dynamic system, versus the static snapshot method used today. This will allow utilities to verify power grid readings and identify false data on the communication network. The prevailing method of estimation takes all the data from the system into a single load flow equation at the utilities command center. This becomes a large algorithm that is very time consuming to solve, providing the engineers only snap shots of the system. The MFD distributes an algorithm to devises that are already installed at various locations on the power grid. This allows for much faster computer times because the algorithms contain magnitudes less data. When each distributed estimator completes its calculation, it sends the results back to the master device to check against all other distributed estimators.

Reen, DylanW.↗

Dynamic Resource Scheduling in Mobile Edge Cloud with Cloud Radio Access Network

Nowadays, by integrating the cloud radio access network (C-RAN) with the mobile edge cloud computing (MEC) technology, mobile service provider (MSP) can efficiently handle the increasing mobile traffic and enhance the capabilities of mobile devices. But the power consumption has become skyrocketing for MSP and it gravely affects the profit of MSP. Previous work often studied the power consumption in C-RAN and MEC separately while less work had considered the integration of C-RAN with MEC. In this paper, we present an unifying framework for the power-performance tradeoff of MSP by jointly scheduling network resources in C-RAN and computation resources in MEC to maximize the profit of MSP. To achieve this objective, we formulate the resource scheduling issue as a stochastic problem and design a new optimization framework by using an extended Lyapunov technique. Specially, because the standard Lyapunov technique critically assumes that job requests have fixed lengths and can be finished within each decision making interval, it is not suitable for the dynamic situation where the mobile job requests have variable lengths. To solve this problem, we extend the standard Lyapunov technique and design the VariedLen algorithm to make online decisions in consecutive time for job requests with variable lengths. Furthermore, our proposed algorithm can reach time average profit that is close to the optimum with a diminishing gap (1/V) for the MSP while still maintaining strong system stability and low congestion. With extensive simulations based on a real world trace, we demonstrate the efficacy and optimality of our proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Applying Reduced Generator Models in the Coarse Solver of Parareal in Time Parallel Power System Simulation

The development of high-performance computing techniques and platforms has provided many opportunities for real-time or even faster-than-real-time implementation of power system simulations. One approach uses the Parareal in time framework. The Parareal algorithm has shown promising theoretical simulation speedups by temporal decomposing a simulation run into a coarse simulation on the entire simulation interval and fine simulations on sequential sub-intervals linked through the coarse simulation. However, it has been found that the time cost of the coarse solver needs to be reduced to fully exploit the potentials of the Parareal algorithm. This paper studies a Parareal implementation using reduced generator models for the coarse solver and reports the testing results on the IEEE 39-bus system and a 327-generator 2383-bus Polish system model.

High-performance computing↗

Non-Intrusive Parallel-in-Time Solvers for Partial Differential Equations (Final Report)

Many time-dependent problems and simulations are often modeled using Partial Differential Equations. Traditional modeling approaches that use sequential time-stepping are reaching a bottleneck in optimizing efficiency. The Center of Applied Science and Computing at Lawrence Livermore National Laboratory extensively works on parallelizing these algorithms to leverage the increasing computational power from the growing number of processors in computer hardware. In particular, they aim to design non-intrusive algorithms that can generalize to a variety of problems and sizes without requiring additional information from or modifications on the original problems. Multigrid Reduction in Time (MGRIT) is a parallel-in-time algorithm that is designed to be non-intrusive. This project focuses on increasing the efficiency of MGRIT by approximating the coarse-grid operator using machine learning approaches as a means to find the most non-intrusive, or general, solution.

97 MATHEMATICS AND COMPUTING↗

HF band filter bank multi-carrier spread spectrum

This paper describes modifications to the filter bank multicarrier spread spectrum (FB-MC-SS) system, that was presented in [1] and [2], to enable transmission of this waveform in the HF skywave channel. FB-MC-SS is well suited for the HF channel because it performs well in channels with frequency selective fading and interference. This paper describes new algorithms for packet detection, timing recovery and equalization that are suitable for the HF channel. Also, an algorithm for optimizing the peak to average power ratio (PAPR) of the FBMC- SS waveform is presented. Application of this algorithm results in a waveform with low PAPR. Simulation results using a wide band HF channel model demonstrate the robustness of this system over a wide range of delay and Doppler spreads.

99 GENERAL AND MISCELLANEOUS↗

Elementary wideband timing of radio pulsars

We present an algorithm for the simultaneous measurement of a pulse time-of-arrival (TOA) and dispersion measure (DM) from folded wideband pulsar data. We extend the prescription from Taylor's 1992 work to accommodate a general two-dimensional template 'portrait', the alignment of which can be used to measure a pulse phase and DM. We show that there is a dedispersion reference frequency that removes the covariance between these two quantities and note that the recovered pulse profile scaling amplitudes can provide useful information. We experiment with pulse modeling by using a Gaussian-component scheme that allows for independent component evolution with frequency, a 'fiducial component', and the inclusion of scattering. We showcase the algorithm using our publicly available code on three years of wideband data from the bright millisecond pulsar J1824–2452A (M28A) from the Green Bank Telescope, and a suite of Monte Carlo analyses validates the algorithm. By using a simple model portrait of M28A, we obtain DM trends comparable to those measured by more standard methods, with improved TOA and DM precisions by factors of a few. Measurements from our algorithm will yield precisions at least as good as those from traditional techniques, but is prone to fewer systematic effects and is without ad hoc parameters. A broad application of this new method for dispersion measure tracking with modern large-bandwidth observing systems should improve the timing residuals for pulsar timing array experiments, such as the North American Nanohertz Observatory for Gravitational Waves.

79 ASTRONOMY AND ASTROPHYSICS↗

A stable and accurate partitioned algorithm for conjugate heat transfer

We describe a new partitioned approach for solving conjugate heat transfer (CHT) problems where the governing temperature equations in different material domains are time-stepped in a implicit manner, but where the interface coupling is explicit. The new approach, called the CHAMP scheme (Conjugate Heat transfer Advanced Multi-domain Partitioned), is based on a discretization of the interface coupling conditions using a generalized Robin (mixed) condition. The weights in the Robin condition are determined from the optimization of a condition derived from a local stability analysis of the coupling scheme. The interface treatment combines ideas from optimized-Schwarz methods for domain-decomposition problems together with the interface jump conditions and additional compatibility jump conditions derived from the governing equations. For many problems (i.e. for a wide range of material properties, grid-spacings and time-steps) the CHAMP algorithm is stable and second-order accurate using no sub-time-step iterations (i.e. a single implicit solve of the temperature equation in each domain). In extreme cases (e.g. very fine grids with very large time-steps) it may be necessary to perform one or more sub-iterations. Each sub-iteration generally increases the range of stability substantially and thus one sub-iteration is likely sufficient for the vast majority of practical problems. The CHAMP algorithm is developed first for a model problem and analyzed using normal-mode the- ory. The theory provides a mechanism for choosing optimal parameters in the mixed interface condition. A comparison is made to the classical Dirichlet-Neumann (DN) method and, where applicable, to the optimized- Schwarz (OS) domain-decomposition method. For problems with different thermal conductivities and dif- fusivities, the CHAMP algorithm outperforms the DN scheme. For domain-decomposition problems with uniform conductivities and diffusivities, the CHAMP algorithm performs better than the typical OS scheme with one grid-cell overlap. Lastly, the CHAMP scheme is also developed for general curvilinear grids and CHT ex- amples are presented using composite overset grids that confirm the theory and demonstrate the effectiveness of the approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Acceleration of the particle-in-cell code Osiris with graphics processing units

Fully relativistic particle-in-cell (PIC) simulations are crucial for advancing our knowledge of plasma physics. Modern supercomputers based on graphics processing units (GPUs) offer the potential to perform PIC simulations of unprecedented scale, but require robust and feature-rich codes that can fully leverage their computational resources. In this work, this demand is addressed by adding GPU acceleration to the PIC code Osiris. An overview of the algorithm, which features a CUDA extension to the underlying Fortran architecture, is given. Detailed performance benchmarks for thermal plasmas are presented, which demonstrate excellent weak scaling on NERSC's Perlmutter supercomputer and high levels of absolute performance. The robustness of the code to model a variety of physical systems is demonstrated via simulations of Weibel filamentation and laser-wakefield acceleration run with dynamic load balancing. Finally, measurements and analysis of energy consumption are provided that indicate that the GPU algorithm is up to ~14 times faster and ~7 times more energy efficient than the optimized CPU algorithm on a node-to-node basis. The described development addresses the PIC simulation community's computational demands both by contributing a robust and performant GPU-accelerated PIC code and by providing insight into efficient use of GPU hardware.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Highly Accurate Frequency Calculations of Crab Cavities Using the VORPAL Computational Framework

We have applied the Werner-Cary method [J. Comp. Phys. 227, 5200-5214 (2008)] for extracting modes and mode frequencies from time-domain simulations of crab cavities, as are needed for the ILC and the beam delivery system of the LHC. This method for frequency extraction relies on a small number of simulations, and post-processing using the SVD algorithm with Tikhonov regularization. The time-domain simulations were carried out using the VORPAL computational framework, which is based on the eminently scalable finite-difference time-domain algorithm. A validation study was performed on an aluminum model of the 3.9 GHz RF separators built originally at Fermi National Accelerator Laboratory in the US. Comparisons with measurements of the A15 cavity show that this method can provide accuracy to within 0.01% of experimental results after accounting for manufacturing imperfections. To capture the near degeneracies two simulations, requiring in total a few hours on 600 processors were employed. This method has applications across many areas including obtaining MHD spectra from time-domain simulations.

43 PARTICLE ACCELERATORS↗

Backfilling with guarantees granted upon job submission.

In this paper, we present scheduling algorithms that simultaneously support guaranteed starting times and favor jobs with system desired traits. To achieve the first of these goals, our algorithms keep a profile with potential starting times for every unfinished job and never move these starting times later, just as in Conservative Backfilling. To achieve the second, they exploit previously unrecognized flexibility in the handling of holes opened in this profile when jobs finish early. We find that, with one choice of job selection function, our algorithms can consistently yield a lower average waiting time than Conservative Backfilling while still providing a guaranteed start time to each job as it arrives. In fact, in most cases, the algorithms give a lower average waiting time than the more aggressive EASY backfilling algorithm, which does not provide guaranteed start times. Alternately, with a different choice of job selection function, our algorithms can focus the benefit on the widest submitted jobs, the reason for the existence of parallel systems. In this case, these jobs experience significantly lower waiting time than Conservative Backfilling with minimal impact on other jobs.

99 GENERAL AND MISCELLANEOUS↗

The level-1 trigger for the SuperCDMS experiment at SNOLAB

The SuperCDMS SNOLAB dark matter search experiment aims to be sensitive to energy depositions down to Script O(1 eV). This imposes requirements on the resolution, signal efficiency, and noise rejection of the trigger system. To accomplish this, the SuperCDMS level-1 trigger system is implemented in an FPGA on a custom PCB. A time-domain optimal filter algorithm realized as a finite impulse response filter provides a baseline resolution of 0.38 times the standard deviation of the noise, σn, and a 99.9% trigger efficiency for signal amplitudes of 1.1 σ n in typical noise conditions. Embedded in a modular architecture, flexible trigger logic enables reliable triggering and vetoing in a dead-time-free manner for a variety of purposes and run conditions. The trigger architecture and performance are detailed in this article.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Artifacts in digital coincidence timing

Digital methods are becoming increasingly popular for measuring time differences, and are the de facto standard in PET cameras. These methods usually include a master system clock and a (digital) arrival time estimate for each detector that is obtained by comparing the detector output signal to some reference portion of this clock (such as the rising edge). Time differences between detector signals are then obtained by subtracting the digitized estimates from a detector pair. A number of different methods can be used to generate the digitized arrival time of the detector output, such as sending a discriminator output into a time to digital converter (TDC) or digitizing the waveform and applying a more sophisticated algorithm to extract a timing estimator.All measurement methods are subject to error, and one generally wants to minimize these errors and so optimize the timing resolution. A common method for optimizing timing methods is to measure the coincidence timing resolution between two timing signals whose time difference should be constant (such as detecting gammas from positron annihilation) and selecting the method that minimizes the width of the distribution (i.e. the timing resolution). Unfortunately, a common form of error (a nonlinear transfer function) leads to artifacts that artificially narrow this resolution, which can lead to erroneous selection of the 'optimal' method. In conclusion, the purpose of this note is to demonstrate the origin of this artifact and suggest that caution should be used when optimizing time digitization systems solely on timing resolution minimization.

97 MATHEMATICS AND COMPUTING↗