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 1,567 records · Page 87

RadTrac : A system for detecting, localizing, and tracking radioactive sources in real time.

Within the homeland security and emergency response communities, there is a need for a low-profile system to detect and locate radioactive sources. RadTrac has been developed at Argonne National Laboratory as an integrated system for the detection, localization, identification, and tracking of radioactive sources in real time. The system is based on a network of radiation detectors and advanced signal-processing algorithms. Features include video surveillance, automated tracking, easy setup, and logging of all data and images. This paper describes the advanced algorithms that were developed and implemented for source detection, localization, and tracking in real time. In the physio-spatial integration approach to source localization, counts from multiple detectors are processed according to the underlying physics linking these counts to obtain the probability that a source is present at any point in space. This information is depicted in a probability density function map. This type of depiction allows the results to be presented in a simple, easy-to-understand manner. It also allows for many different complicated factors to be accounted for in a single image as each factor is computed as a probability density in space. These factors include spatial limitations, variable shielding, directional detectors, moving detectors, and different detector sizes and orientations. The utility and versatility of this approach is described in further detail. Advanced signal-processing algorithms have also been incorporated to improve real-time tracking and to increase signal-to-noise ratios including temporal linking and energy binning. Measurements aimed at demonstrating the sensitivity improvements through the use of advanced signal-processing techniques were performed and are presented. Results of tracking weak sources (<100 {micro}Ci {sup 137}Cs) using four fixed-position detectors are presented.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Mining data in a dynamic PRA framework

Computational (also known as Dynamic) Probabilistic Risk Assessment (PRA) methods employs system simulation codes coupled with stochastic analysis tools in order to determine probabilities of certain outcomes such as system failure. In contrast to classical PRA methods (i.e., Event-Tree and Fault-Tree) in which timing and sequencing of events is set by the analyst, accident progression is dictated by the system control logic and its interaction with system temporal evolution. Due to the nature of the problem, Simulation-Based PRA methods require large amount of computationally expensive simulation runs. In addition, these methods usually generate a large number of simulation runs (database storage may be on the order of gigabytes or higher). In this paper we investigate and apply several methods and algorithms to analyze these large amounts of time-dependent data. Furthermore, the scope of this article is to present a broad overview of methods and algorithms that can be used to improve data quality and to analyze and extract information from large data sets containing time dependent data. In this context, “extracting information” means constructing input-output correlations, finding commonalities, and identifying outliers.

97 MATHEMATICS AND COMPUTING↗

Real-time Simulation Framework for Hardware-in-the-Loop Testing of Multi-port Autonomous Reconfigurable Solar Power Plant (MARS)

Multiport autonomous reconfigurable solar power plant (MARS) has been proposed for integrated development of photovoltaic (PV) and energy storage system (ESS) that can connect to high-voltage direct current (HVdc) and alternating current (ac) transmission grid. To de-risk the development of this complex integrated system that consists of hundreds to thousands of power electronics modules, a controller hardware-in-the-loop (cHIL) test setup will be extremely beneficial. The cHIL testing can be used for evaluation of modules as well as the hierarchical control system in MARS. With the unique configuration of power electronics modules in MARS, it becomes necessary to develop custom-designed real-time simulation models in the cHIL setup in absence of off-the-shelf models. In this paper, high-fidelity dynamic model of MARS, control algorithms at the lower level, and required communication algorithms are developed and optimized for real-time performance in the cHIL setup. Real-time experimental results from the cHIL are provided.

Dong, Zerui↗

WE-DE-BRA-09: Fast Megavoltage CT Imaging with Rapid Scan Time and Low Imaging Dose in Helical Tomotherapy

Purpose: Megavoltage computed tomography (MVCT) imaging has been widely used for daily patient setup with helical tomotherapy (HT). One drawback of MVCT is its very long imaging time, owing to slow couch speed. The purpose of this study was to develop an MVCT imaging method allowing faster couch speeds, and to assess its accuracy for image guidance for HT. Methods: Three cadavers (mimicking closest physiological and physical system of patients) were scanned four times with couch speeds of 1, 2, 3, and 4 mm/s. The resulting MVCT images were reconstructed using an iterative reconstruction (IR) algorithm. The MVCT images were registered with kilovoltage CT images, and the registration errors were compared with the errors with conventional filtered back projection (FBP) algorithm. Moreover, the fast MVCT imaging was tested in three cases of total marrow irradiation as a clinical trial. Results: Three-dimensional registration errors of the MVCT images reconstructed with the IR algorithm were significantly smaller (p < 0.05) than the errors of images reconstructed with the FBP algorithm at fast couch speeds (3, 4 mm/s). The scan time and imaging dose at a speed of 4 mm/s were reduced to 30% of those from a conventional coarse mode scan. For the patient imaging, a limited number of conventional MVCT (1.2 mm/s) and fast MVCT (3 mm/s) reveals acceptable reduced imaging time and dose able to use for anatomical registration. Conclusion: Fast MVCT with IR algorithm maybe clinically feasible alternative for rapid 3D patient localization. This technique may also be useful for calculating daily dose distributions or organ motion analyses in HT treatment over a wide area.

60 APPLIED LIFE SCIENCES↗

Solving Inverse Stochastic Problems from Discrete Particle Observations Using the Fokker--Planck Equation and Physics-Informed Neural Networks

The Fokker--Planck (FP) equation governing the evolution of the probability density function (PDF) is applicable to many disciplines, but it requires specification of the coefficients for each case, which can be functions of space-time and not just constants and hence require the development of a data-driven modeling approach. When the data available is directly on the PDF, there exist methods for inverse problems that can be employed to infer the coefficients and thus determine the FP equation and subsequently obtain its solution. Herein, we address a more realistic scenario, where only sparse data are given on the particles' positions at a few time instants, which are not sufficient to accurately construct directly the PDF even at those times from existing methods, e.g., kernel estimation algorithms. To this end, we develop a general framework based on physics-informed neural networks (PINNs) that introduces a new loss function using the Kullback--Leibler divergence to connect the stochastic samples with the FP equation to simultaneously learn the equation and infer the multidimensional PDF at all times. In particular, we consider two types of inverse problems, type I, where the FP equation is known but the initial PDF is unknown, and type II, in which, in addition to the unknown initial PDF, the drift and diffusion terms are also unknown. In both cases, we investigate problems with either Brownian or Lévy noise or a combination of both. Here, we demonstrate the new PINN framework in detail in the one-dimensional (1D) case, but we also provide results for up to five dimensions demonstrating that we can infer both the FP equation and dynamics simultaneously at all times with high accuracy using only very few discrete observations of the particles.

97 MATHEMATICS AND COMPUTING↗

Fragmentation analysis of a bar with the Lip-field approach

The Lip-field approach was introduced in Moës and Chevaugeon (2021) as a new way to regularize softening material models. It was tested in 1D quasistatic in Moës and Chevaugeon (2021) and 2D quasistatic in Chevaugeon and Moës (2021): this paper extends it to 1D dynamics, on the challenging problem of dynamic fragmentation. The Lip-field approach formulates the mechanical problem to be solved as an optimization problem, where the incremental potential to be minimized is the non-regularized one. Spurious localization is prevented by imposing a Lipschitz constraint on the damage field. Here, the displacement and damage field at each time step are obtained by a staggered algorithm, that is the displacement field is computed for a fixed damage field, then the damage field is computed for a fixed displacement field. Indeed, these two problems are convex, which is not the case of the global problem where the displacement and damage fields are sought at the same time. The incremental potential is obtained by equivalence with a cohesive zone model, which makes material parameters calibration simple. A non-regularized local damage equivalent to a cohesive zone model is also proposed. It is used as a reference for the Lip-field approach, without the need to implement displacement jumps. These approaches are applied to the brittle fragmentation of a 1D bar with randomly perturbed material properties to accelerate spatial convergence. Both explicit and implicit dynamic implementations are compared. Favorable comparison to several analytical, numerical and experimental references serves to validate the modeling approach.

36 MATERIALS SCIENCE↗

Industrial Compositional Streamline Simulation for Efficient and Accurate Prediction of Gas Injection and WAG Processes

Gas-injection processes are widely and increasingly used for enhanced oil recovery (EOR). In the United States, for example, EOR production by gas injection accounts for approximately 45% of total EOR production and has tripled since 1986. The understanding of the multiphase, multicomponent flow taking place in any displacement process is essential for successful design of gas-injection projects. Due to complex reservoir geometry, reservoir fluid properties and phase behavior, the design of accurate and efficient numerical simulations for the multiphase, multicomponent flow governing these processes is nontrivial. In this work, we developed, implemented and tested a streamline based solver for gas injection processes that is computationally very attractive: as compared to traditional Eulerian solvers in use by industry it computes solutions with a computational speed orders of magnitude higher and a comparable accuracy provided that cross-flow effects do not dominate. We contributed to the development of compositional streamline solvers in three significant ways: improvement of the overall framework allowing improved streamline coverage and partial streamline tracing, amongst others; parallelization of the streamline code, which significantly improves wall clock time; and development of new compositional solvers that can be implemented along streamlines as well as in existing Eulerian codes used by industry. We designed several novel ideas in the streamline framework. First, we developed an adaptive streamline coverage algorithm. Adding streamlines locally can reduce computational costs by concentrating computational efforts where needed, and reduce mapping errors. Adapting streamline coverage effectively controls mass balance errors that mostly result from the mapping from streamlines to pressure grid. We also introduced the concept of partial streamlines: streamlines that do not necessarily start and/or end at wells. This allows more efficient coverage and avoids the redundant work generally done in the near-well regions. We improved the accuracy of the streamline simulator with a higher order mapping from pressure grid to streamlines that significantly reduces smoothing errors, and a Kriging algorithm is used to map from the streamlines to the background grid. The higher accuracy of the Kriging mapping means that it is not essential for grid blocks to be crossed by one or more streamlines. The higher accuracy comes at the price of increased computational costs, but allows coarser coverage and so does not generally increase the overall costs of the computations. To reduce errors associated with fixing the pressure field between pressure updates, we developed a higher order global time-stepping method that allows the use of larger global time steps. Third-order ENO schemes are suggested to propagate components along streamlines. Both in the two-phase and three-phase experiments these ENO schemes outperform other (higher order) upwind schemes. Application of the third order ENO scheme leads to overall computational savings because the computational grid used can be coarsened. Grid adaptivity along streamlines is implemented to allow sharp but efficient resolution of solution fronts at reduced computational costs when displacement fronts are sufficiently separated. A correction for Volume Change On Mixing (VCOM) is implemented that is very effective at handling this effect. Finally, a specialized gravity operator splitting method is proposed for use in compositional streamline methods that gives an effective correction of gravity segregation. A significant part of our effort went into the development of a parallelization strategy for streamline solvers on the next generation shared memory machines. We found in this work that the built-in dynamic scheduling strategies of OpenMP lead to parallel efficiencies that are comparable to optimal schedules obtained with customized explicit load balancing strategies as long as the ratio of number of streamlines to number of threads is sufficiently high, which is the case in real-field applications. This is an important result, as it eases the transition of serial to parallel streamline codes. The parallel speedup itself depends on the relative contribution of the tracing and mapping stages as compared to the solution of the transport equations along streamlines. As the physical complexity of the simulated 1D transport process increases, the contribution of the less efficient tracing and mapping stages is reduced and near-linear scalabilities can be obtained. Our work clearly shows that the owner approach, in which threads are assigned whole streamlines, is more attractive than a distributed model, in which streamline segments are assigned to threads, because it allows re-use of existing sequential code for the 1D streamline solves, also for implicit time-stepping algorithms.

02 PETROLEUM↗

Preliminary results of teleseismic double-difference relocation of earthquakes around Indonesian archipelago region

Indonesian archipelago region is located in active tectonic setting and high seismicity zone. During the last decade, Indonesian was experienced with destructive major earthquakes causing damage and victims. The information of precise earthquake location parameters are very important in partular for earthquake early warning to the society and for advance seismic studies. In this study, we attempted to improve hypocenter location compiled by BMKG for time periods of April, 2009 up to June, 2014 for about 22,000 earthquake events around Indonesian region. For the firts time, we applied teleseismic double-difference relocation algorithm (teletomoDD) to improve hypocenter region in Indonesia region combining regional and teleseismic stations. Hypocenter relocation was performed utilizing local, regional, and teleseismic P-wave arrival time data. Our relocation result show that travel-time RMS errors were greatly reduced compared to the BMKG catalog. Seismicity at shallower depth (less than 50 km) shows significantly improvement especially in depth, and refined shallow geological structures, e.g. trench and major strike slip faults. Clustered seismicity is also detected beneath volcanic region, and probably related volcano activities and also major faults nearby. In the Sunda arc region, seismicity at shallower depth centered at two major distributions parallel to the trench strike direction, i.e. around fore-arc and in mainland that related to major fault, e.g. the Sumatran fault, and volcanic fronts. Below Central Java region, relocated hypocenter result showed double seismic zone pattern. A seismic gap is detected around the Sunda-Banda transition zone where transition between oceanic subduction to continental crust collision of Australian plate occurs. In Eastern Indonesia region, shallow earthquakes are observed related to major strike slip faults, e.g. Sorong and Palu-Koro fault, volcanism, and shallow part of subduction and collision zones. We also compare our result in the Sunda Arc region with slab1.0 model and our relocated seismicity shows good agreement with the previous slab geometry. Horizontal position shift of relocated events are mostly perpendicular to the trench directions.

58 GEOSCIENCES↗

Visualization System for Evolutionary Neural Networks for Deep Learning

Deep learning is actively used in a wide range of fields for scientific discovery. To effectively apply deep learning to a particular problem, it is important to select an appropriate network architecture and other hyper-parameters (at each layer). Evolving architectures and hyper-parameters using a genetic algorithm is one current approach to search the huge space of all possible configurations to find those more optimal for the problem. However, examining an evolutionary process and tuning the genetic algorithm are challenging, pushing most users to treat the process as a black box. To address this challenge, we propose a visualization system for evolutionary neural networks for deep learning. The key feature of our visualization system is to provide a visual analytics environment for evaluating a genetic algorithm in order to improve the underlying operations to reduce time to find good solutions. Our system is able to not only visualize how a genetic algorithm traverses its search space but also allows users to examine evolving networks in-depth to get insights to improve performance through interactive visualization components.

Chae, Junghoon↗

Conservative algorithms for non-Maxwellian plasma kinetics

Here, we present a numerical model and a set of conservative algorithms for Non-Maxwellian plasma kinetics with inelastic collisions. These algorithms self-consistently solve for the time evolution of an isotropic electron energy distribution function interacting with an atomic state distribution function of an arbitrary number of levels through collisional excitation, deexcitation, as well as ionization and recombination. Electron-electron collisions, responsible for thermalization of the electron distribution, are also included in the model. The proposed algorithms guarantee mass/charge and energy conservation in a single step, and is applied to the case of non-uniform gridding of the energy axis in the phase space of the electron distribution function. Numerical test cases are shown to demonstrate the accuracy of the method and its conservation properties.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

TU-F-CAMPUS-I-02: Contrast Enhanced Cone Beam CT Imaging with Dual- Gantry Image Acquisition and Constrained Iterative Reconstruction-a Simulation Study for Liver Imaging Application

Purpose: Contrast time-density curves may help differentiate malignant tumors from normal tissues or benign tumors. Repetitive scans using conventional CT or cone beam CT techniques, which Result in unacceptably high dose, may not achieve the desired temporal resolution. In this study we describe and demonstrate a 4D imaging technique for imaging and quantifying contrast flows requiring only one or two 360° scans. Methods: A dual-gantry system is used to simultaneously acquire two projection images at orthogonal orientations. Following the scan, each or both of the two 360° projection sets are used to reconstruct an average contrast enhanced image set which is then segmented to form a 3D contrast map. Alternatively, a pre-injection scan may be made and used to reconstruct a pre-injection image set which is subtracted from the post-injection image set to form the 3D contrast map. Each of the two 360° projection sets is divided into 12 subsets, thus creating 12 pairs of 30° limited angle projection sets, each corresponding to a time spanning over 1/12 of the scanning time. Each pair of the projection sets are reconstructed as a time specific 3D image set with the maximum likelihood estimation iterative algorithm using the contrast map as the constraint. As a demonstration, a 4D abdominal phantom was constructed from clinical CT images with blood flow through the normal tissue and a tumor modeled and imaging process simulated. Results: We have successfully generated a 4D image phantom, and calculated the projection images. The time density curves derived from the reconstructed image set matched well with the flow model used to generate the phantom. Conclusion: Dual-gantry image acquisition and constrained iterative reconstruction algorithm may help to obtain time-density curves of contrast agents in blood flows, which may help differentiate malignant tumors from normal tissues or benign tumors.

60 APPLIED LIFE SCIENCES↗

Listing triangles in expected linear time on a class of power law graphs.

Enumerating triangles (3-cycles) in graphs is a kernel operation for social network analysis. For example, many community detection methods depend upon finding common neighbors of two related entities. We consider Cohen's simple and elegant solution for listing triangles: give each node a 'bucket.' Place each edge into the bucket of its endpoint of lowest degree, breaking ties consistently. Each node then checks each pair of edges in its bucket, testing for the adjacency that would complete that triangle. Cohen presents an informal argument that his algorithm should run well on real graphs. We formalize this argument by providing an analysis for the expected running time on a class of random graphs, including power law graphs. We consider a rigorously defined method for generating a random simple graph, the erased configuration model (ECM). In the ECM each node draws a degree independently from a marginal degree distribution, endpoints pair randomly, and we erase self loops and multiedges. If the marginal degree distribution has a finite second moment, it follows immediately that Cohen's algorithm runs in expected linear time. Furthermore, it can still run in expected linear time even when the degree distribution has such a heavy tail that the second moment is not finite. We prove that Cohen's algorithm runs in expected linear time when the marginal degree distribution has finite 4/3 moment and no vertex has degree larger than {radical}n. In fact we give the precise asymptotic value of the expected number of edge pairs per bucket. A finite 4/3 moment is required; if it is unbounded, then so is the number of pairs. The marginal degree distribution of a power law graph has bounded 4/3 moment when its exponent {alpha} is more than 7/3. Thus for this class of power law graphs, with degree at most {radical}n, Cohen's algorithm runs in expected linear time. This is precisely the value of {alpha} for which the clustering coefficient tends to zero asymptotically, and it is in the range that is relevant for the degree distribution of the World-Wide Web.

99 GENERAL AND MISCELLANEOUS↗

STUDIES IN ASTRONOMICAL TIME SERIES ANALYSIS. VI. BAYESIAN BLOCK REPRESENTATIONS

This paper addresses the problem of detecting and characterizing local variability in time series and other forms of sequential data. The goal is to identify and characterize statistically significant variations, at the same time suppressing the inevitable corrupting observational errors. We present a simple nonparametric modeling technique and an algorithm implementing it-an improved and generalized version of Bayesian Blocks-that finds the optimal segmentation of the data in the observation interval. The structure of the algorithm allows it to be used in either a real-time trigger mode, or a retrospective mode. Maximum likelihood or marginal posterior functions to measure model fitness are presented for events, binned counts, and measurements at arbitrary times with known error distributions. Problems addressed include those connected with data gaps, variable exposure, extension to piecewise linear and piecewise exponential representations, multivariate time series data, analysis of variance, data on the circle, other data modes, and dispersed data. Simulations provide evidence that the detection efficiency for weak signals is close to a theoretical asymptotic limit derived by Arias-Castro et al. In the spirit of Reproducible Research all of the code and data necessary to reproduce all of the figures in this paper are included as supplementary material.

79 ASTRONOMY AND ASTROPHYSICS↗

A scalable, fully implicit algorithm for the reduced two-field low-β extended MHD model

Here, we demonstrate a scalable fully implicit algorithm for the two-field low-β extended MHD model. This reduced model describes plasma behavior in the presence of strong guide fields, and is of significant practical impact both in nature and in laboratory plasmas. The model displays strong hyperbolic behavior, as manifested by the presence of fast dispersive waves, which make a fully implicit treatment very challenging. In this study, we employ a Jacobian-free Newton–Krylov nonlinear solver, for which we propose a physics-based preconditioner that renders the linearized set of equations suitable for inversion with multigrid methods. As a result, the algorithm is shown to scale both algorithmically (i.e., the iteration count is insensitive to grid refinement and timestep size) and in parallel in a weak-scaling sense, with the wall-clock time scaling weakly with the number of cores for up to 4096 cores. For a 4096 × 4096 mesh, we demonstrate a wall-clock-time speedup of ~6700 with respect to explicit algorithms. The model is validated linearly (against linear theory predictions) and nonlinearly (against fully kinetic simulations), demonstrating excellent agreement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Relationship Between Dose Rate and Decay Heat for Spent Nuclear Fuel Casks

Decay heat and dose rate are two important limits used for determining the allowable contents of spent fuel (SNF) in dry storage systems and transportation packages. While the decay heat limit is used to maintain fuel cladding integrity and ensure retrievability, dose rates are used to demonstrate compliance with regulatory requirements on radiation protection. Because both dose rate and decay heat result from decay of radioisotopes in SNF, this study is an attempt to examine the relationship between dose rate and decay heat for a given cask design. Dose rates were evaluated for 198 cask configurations, that include various SNF system designs (e.g., storage, transfer, transport), SNF characteristics (e.g., fuel types, burnup, cooling time), and loading maps (e.g., uniform loading, zone loading), while a constant decay heat was maintained. The decay heat was calculated using US Nuclear Regulatory Commission (NRC) Regulatory Guide (RG) 3.54, Revision 2, and verified using ORIGEN sequence within SCALE code system. The ORIGEN outputs were used as source terms in the dose analysis using 198 different configurations. A computer script was developed to calculate the cooling time necessary to achieve a given decay heat for a given enrichment, assembly average burnup, assembly mass, and in-core history using a rootfinder algorithm. Initially the computer script was developed to provide cooling time and burnup calculations directly to the analysis of dose rates and decay heats, so a comparison between Used Nuclear Fuel-Storage Transportation and Disposal Analysis Resource Data System (UNF-ST&DARDS) results and RG3.54 data was made; results are included in the appendix to this document. However, an iterative approach was used to compute cooling time, and its accuracy did not depend on the results of the RG3.54r2 algorithm, although the algorithm was still used. The results of the evaluation presented herein clearly demonstrate that a given decay heat does not correspond to a unique dose rate for a variety of cask and package designs. There is no clear pattern to develop a correlation between decay heat and the source terms. Depending on burnup, enrichment, cask type, and loading pattern, dose rates varied for the exact same decay heat—in some cases by 400% for a given cask. For cases in which decay heat was held constant through selection of the appropriate cooling time, dose rates would decrease with increasing burnup, and in other cases, dose rates would increase. The large variation in dose rates for a constant decay heat indicates that casks loaded based on decay heat—that is allowing any burnup, cooling time, and enrichment combinations that yield the qualified decay heat limit(s) —cannot ensure that an Independent Spent Fuel Storage Installation or a spent fuel transportation package will meet the regulatory limits set forth by the respective regulations, i.e., 10 CFR 72 or 10 CFR 71.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Detectability limitations with 3-D point reconstruction algorithms using digital radiography

The estimated impact of pores in clusters on component fatigue will be highly conservative when based on 2-D rather than 3-D pore positions. To 3-D position and size defects using digital radiography and 3-D point reconstruction algorithms in general require a lower inspection time and in some cases work better with planar geometries than X-ray computed tomography. However, the increase in prior assumptions about the object and the defects will increase the intrinsic uncertainty in the resulting nondestructive evaluation output. In this paper this uncertainty arising when detecting pore defect clusters with point reconstruction algorithms is quantified using simulations. The simulation model is compared to and mapped to experimental data. The main issue with the uncertainty is the possible masking (detectability zero) of smaller defects around some other slightly larger defect. In addition, the uncertainty is explored in connection to the expected effects on the component fatigue life and for different amount of prior object-defect assumptions made.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic Price Vector Formation Model-Based Automatic Demand Response Strategy for PV-Assisted EV Charging Stations

A real-time price (RTP)-based automatic demand response (ADR) strategy for PV-assisted electric vehicle (EV) Charging Station (PVCS) without vehicle to grid is proposed. The charging process is modeled as a dynamic linear program instead of the normal day-ahead and real-time regulation strategy, to capture the advantages of both global and real-time optimization. Different from conventional price forecasting algorithms, a dynamic price vector formation model is proposed based on a clustering algorithm to form an RTP vector for a particular day. A dynamic feasible energy demand region (DFEDR) model considering grid voltage profiles is designed to calculate the lower and upper bounds. A deduction method is proposed to deal with the unknown information of future intervals, such as the actual stochastic arrival and departure times of EVs, which make the DFEDR model suitable for global optimization. Finally, both the comparative cases articulate the advantages of the developed methods and the validity in reducing electricity costs, mitigating peak charging demand, and improving PV self-consumption of the proposed strategy are verified through simulation scenarios.

14 SOLAR ENERGY↗

Data for Training and Testing Radiation Detection Algorithms in an Urban Environment

The US government routinely performs radiological response deployments to search for the presence of illicit nuclear materials (e.g., highly enriched uranium and weapons-grade plutonium) in a specified area. The deployments can be intelligence driven, in support of law enforcement, and for planned events such as WrestleMania, presidential inaugurations, or political conventions. In a typical deployment, radiation detection systems carried by human operators or mounted on vehicles move in a clearing pattern through the search area. Search teams rely on radiation detection algorithms running on these systems in real time to alert them to the presence of an illicit threat source. The detection and identification of sources is complicated by large variation of natural radiation background throughout a search area and the potential presence of localized non-threat sources such as patients undergoing treatment with medical isotopes. As a result, detection algorithms must be carefully balanced between missing real sources (false negatives) and reporting too many false alarms (false positives).The purpose of this data set is to spur innovations in detecting, identifying, and localizing nuclear materials inurban search missions.

07 ISOTOPE AND RADIATION SOURCES↗