Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed memory”

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,801 records · Page 100

The Child's Tantrum: El Nino. The Origin of the El Nino-Southern Oscillation

In 1997, a child's tantrums caught the world's attention. These tantrums took the form not of crying and foot stamping, but of droughts and floods. Obviously, this was no ordinary child. It was, in fact, The Child, or El Nino, as it was, named in the late 1800s by South American observers, who noted that its timing coincided with the Christmas holiday. El Nino is a reversal in sea surface temperature (SST) distributions that occurs once every few years in the tropical Pacific. When it coincides with a cyclical shift in air pressure, known as the Southern Oscillation, normal weather patterns are drastically altered. The combined phenomenon is known as El Nino-Southern Oscillation (ENSO). Although ENSO is a regular phenomenon, it was unusually strong in 1997. It produced heavy rainfall and floods in California and bestowed spring-like temperatures on the Midwest during the winter. These drastic changes in normal weather patterns captured the public imagination, from news reports to jokes on late-night talk shows. Naturally, people wanted to. know as much, about El Nino as possible. Fortunately, scientists had at their disposal new satellites and ocean sensors that provided an unprecedented level of information. Consequently, not only was the 1997 ENSO the strongest in recent memory, but it was also the most thoroughly studied. Prominent groups such as the NASA Seasonalto-Interannual Prediction Project (NSIPP) combined numerous aspects of climate modeling into a single, predictive endeavor.

Picault, Joel↗

Streaming Data Reorganization at Scale with DeltaFS Indexed Massive Directories

We report complex storage stacks providing data compression, indexing, and analytics help leverage the massive amounts of data generated today to derive insights. It is challenging to perform this computation, however, while fully utilizing the underlying storage media. This is because, while storage servers with large core counts are widely available, single-core performance and memory bandwidth per core grow slower than the core count per die. Computational storage offers a promising solution to this problem by utilizing dedicated compute resources along the storage processing path. We present DeltaFS Indexed Massive Directories (IMDs), a new approach to computational storage. DeltaFS IMDs harvest available (i.e., not dedicated) compute, memory, and network resources on the compute nodes of an application to perform computation on data. We demonstrate the efficiency of DeltaFS IMDs by using them to dynamically reorganize the output of a real-world simulation application across 131,072 CPU cores. DeltaFS IMDs speed up reads by 1,740x while only slightly slowing down the writing of data during simulation I/O for in situ data processing.

97 MATHEMATICS AND COMPUTING↗

MINING NUCLEAR TRANSIENT DATA THROUGH SYMBOLIC CONVERSION

Dynamic Probabilistic Risk Assessment (DPRA) methodologies generate enormous amounts of data for a very large number of simulations. The data contain temporal information of both the state variables of the simulator and the temporal status of specific systems/components. In order to measure system performances, limitations and resilience, such data need to be carefully analyzed with the objective of discovering the correlations between sequence/timing of events and system dynamics. A first approach toward discovering these correlations from data generated by DPRA methodologies has been performed by organizing scenarios into groups using classification or clustering based algorithms. The identification of the correlations between system dynamics and timing/sequencing of events is performed by observing the temporal distribution of these events in each group of scenarios. Instead of performing “a posteriori” analysis of these correlations, this paper shows how it is possible to identify the correlations implicitly by performing a symbolic conversion of both continuous (temporal profiles of simulator state variables) and discrete (status of systems and components) data. Symbolic conversion is performed for each simulation by properly quantizing both continuous and discrete data and then converting them as a series of symbols. After merging both series together, a temporal phrase is obtained. This phrase preserves duration, coincidence and sequence of both continuous and discrete data in a uniform and consistent manner. In this paper it is also shown that by using specific distance measures, it is still possible to post-process such symbolic data using clustering and classification techniques but in considerably less time since the memory needed to store the data is greatly reduced by the symbolic conversion.

97 MATHEMATICS AND COMPUTING↗

Security Enhancement of Network Constraint Grid-Edge Energy Management System

Network constrained grid edge energy management system (EMS) provides economic solution for active and reactive power dispatch of distributed energy resources (DERs) at the grid edge level. Grid edge EMS ensures secure interconnection of a circuit segment to the distribution system by maintaining grid code requirements (e.g. IEEE 1547–2018). Grid edge EMS is dependent on communication to receive load measurement, which brings a risk of unobservable false data injection attacks (FDIAs). To mitigate the risk, this paper proposes a framework to enhance resilient operation of grid edge EMS by detecting the unobservable FDIAs on loads and replacing them with forecasted values. In this work, a two-step detection algorithm is proposed. In first step, conventional residual based algorithm is deployed. Autoencoder (AE) based data driven mechanism is included in second step to detect the presence of unobservable FDIAs. After ensuring the presence of FDIA, its specific location is detected by checking the maximum residue values till the predefined threshold value is reached. Detected false data injected loads are then replaced with forecasted load values following long-short term memory (LSTM) based forecast to ensure resilient performance of grid edge EMS in the presence of attacks. This proposed security enhancement framework for grid edge EMS is evaluated in IEEE 13 bus system with three integrated DERs. Numerical simulation shows the validation of the proposed framework by reducing voltage violation in real operation of grid edge EMS.

cyber attack detection↗

GPU acceleration of all-electron electronic structure theory using localized numeric atom-centered basis functions

We present an implementation of all-electron density-functional theory for massively parallel GPU-based platforms, using localized atom-centered basis functions and real-space integration grids. Special attention is paid to domain decomposition of the problem on non-uniform grids, which enables compute- and memory-parallel execution across thousands of nodes for real-space operations, e.g. the update of the electron density, the integration of the real-space Hamiltonian matrix, and calculation of Pulay forces. To assess the performance of our GPU implementation, we performed benchmarks on three different architectures using a 103-material test set. We find that operations which rely on dense serial linear algebra show dramatic speedups from GPU acceleration: in particular, SCF iterations including force and stress calculations exhibit speedups ranging from 4.5 to 6.6. For the architectures and problem types investigated here, this translates to an expected overall speedup between 3–4 for the entire calculation (including non-GPU accelerated parts), for problems featuring several tens to hundreds of atoms. Additional calculations for a 375-atom Bi2Se3 bilayer show that the present GPU strategy scales for large-scale distributed-parallel simulations.

42 ENGINEERING↗

Using simple PID-inspired controllers for online resilient resource management of distributed scientific workflows

Scientific workflows have become mainstream for conducting large-scale scientific research. As a result, many workflow applications and Workflow Management Systems (WMSs) have been developed as part of the cyberinfrastructure to allow scientists to execute their applications seamlessly on a range of distributed platforms. Although the scientific community has addressed this challenge from both theoretical and practical approaches, failure prediction, detection, and recovery still raise many research questions. In this paper, we propose an approach inspired by the control theory developed as part of autonomic computing to predict failures before they happen, and mitigated them when possible. The proposed approach is inspired on the proportional–integral–derivative controller (PID controller) control loop mechanism, which is widely used in industrial control systems, where the controller will react to adjust its output to mitigate faults. PID controllers aim to detect the possibility of a non-steady state far enough in advance so that an action can be performed to prevent it from happening. To demonstrate the feasibility of the approach, we tackle two common execution faults of large scale data-intensive workflows—data storage overload and memory overflow. We developed a simulator, which implements and evaluates simple standalone PID-inspired controllers to autonomously manage data and memory usage of a data-intensive bioinformatics workflow that consumes/produces over 4.4 TB of data, and requires over 24 TB of memory to run all tasks concurrently. Experimental results obtained via simulation indicate that workflow executions may significantly benefit from the controller-inspired approach, in particular under online and unknown conditions. Simulation results show that nearly-optimal executions (slowdown of 1.01) can be attained when utilizing our proposed method, and faults are detected and mitigated far in advance of their occurrence.

97 MATHEMATICS AND COMPUTING↗

Searching for Grid-Forming Technologies That Do Not Impact Protection Systems: A promising technology

The design of legacy-line protection elements has been guided by the behavior of synchronous machines during faults. Because of the significant field-winding inductance and rotating mass, the magnitude, angular frequency, and phase angle of the back-electromotive force (EMF) voltage waveforms of synchronous machines remain practically constant for several hundreds of milliseconds after a fault occurs. Furthermore this has facilitated the engineering of the memory-polarization technique in mho distance elements, which has been effective for machine-dominant power grids. However, this assumption is no longer held for inverter-based resources (IBRs) because of the lack of field winding and moment of inertia in power electronics devices. Notably, the negative-sequence directional overcurrent protection and the quadrilateral distance elements have been impacted by early IBRs with grid-following (GFL) controls because they did not inject negative-sequence currents during asymmetrical faults.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Diffusion maps, clustering and fuzzy Markov modeling in peptide folding transitions

Using the helix-coil transitions of alanine pentapeptide as an illustrative example, we demonstrate the use of diffusion maps in the analysis of molecular dynamics simulation trajectories. Diffusion maps and other nonlinear data-mining techniques provide powerful tools to visualize the distribution of structures in conformation space. The resulting low-dimensional representations help in partitioning conformation space, and in constructing Markov state models that capture the conformational dynamics. In an initial step, we use diffusion maps to reduce the dimensionality of the conformational dynamics of Ala5. The resulting pretreated data are then used in a clustering step. The identified clusters show excellent overlap with clusters obtained previously by using the backbone dihedral angles as input, with small—but nontrivial—differences reflecting torsional degrees of freedom ignored in the earlier approach. We then construct a Markov state model describing the conformational dynamics in terms of a discrete-time random walk between the clusters. We show that by combining fuzzy C-means clustering with a transition-based assignment of states, we can construct robust Markov state models. This state-assignment procedure suppresses short-time memory effects that result from the non-Markovianity of the dynamics projected onto the space of clusters. In a comparison with previous work, we demonstrate how manifold learning techniques may complement and enhance informed intuition commonly used to construct reduced descriptions of the dynamics in molecular conformation space.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Boost of the Bio-memristor Performance for Artificial Electronic Synapses by Surface Reconstruction

Biomaterial-based memristors (bio-memristors) are often adopted to emulate biological synapse functions and applied to construct neural computing networks in brain-inspired chip systems. However, the randomness of conductive filament formation in bio-memristors inhibits their switching performance by causing the dispersion of the device-switching parameters. In this case, a facile porous silk fibroin (p-SF) memristor was obtained through a protein surface reconstruction strategy, in which the size of the hole can be adjusted by the density of hybrid nanoseeds. Here, the porous SF memristors exhibit greatly enhanced electrical characteristics, including uniform I-V cycles, centralized distribution of the switching voltages, and both high and low resistances, compared to devices without pores. The results of three-dimensional (3D) simulations based on classical density functional theory (cDFT) suggest that the reconstructed pores in the SF layers guide the formation and fracture of Ag filaments under an electric field and enhance the overall conductivity by separating Ag + ion and electron diffusion pathways. Ag + ions are predicted to preferentially diffuse through pores, whereas electrons diffuse through the SF network. Interestingly, the device conductance can be bidirectionally modulated gradually by positive and negative voltages, can faithfully simulate short-term and long-term plasticity, and can even realize the triplet-spike-timing-dependent plasticity (triplet-STDP) rule, which can be used for pattern recognition in biological systems. The simulation results reveal that a memristor network of this type has an accuracy of ~95.78% in memory learning and the capability of pattern learning. This work provides a facile technology route to improve the performance of bionic-material memristors.

36 MATERIALS SCIENCE↗

Data-driven based coordinated smart inverter control for distributed energy resources

Smart inverters (SI) for distributed energy resources (DER) are becoming popular since they have the ability to stabilize as well as restore the voltage and frequency of power systems. Aiming at establishing the mathematical models combined with SI control methods, multiple optimization methods are developed. However, the computational complexity of solving such a mathematical model with various uncertainties limits the real-time application of the SI control. To conquer this challenge, a data-driven-based SI control approach is developed to achieve coordinated control in the high penetration DER system. First, an optimization problem for maximizing the active power generation and minimizing the power loss is designed using the Volt/VAR control. To reduce the time consumption, the recurrent neural network (RNN) is proposed to model the relationship between the uncertainties and control actions during the offline site. The RNN with different sub-structures such as the long short-term memory cell and gated recurrent unit cell are included to enrich the diversity of features. In the last stage, different experiment comparisons, including multiple uncertainties maps and stateof- art machine learning methods, are conducted to verify the effectiveness of the proposed method based on the IEEE 123 bus power system. The results demonstrate that the proposed method can effectively achieve a rapid and coordinated control with a lower error rate.

Qiu, Wei↗

Miniature Latching Valve

A miniature latching valve has been invented to satisfy a need for an electrically controllable on/off pneumatic valve that is lightweight and compact and remains in the most recently commanded open or closed state when power is not supplied. The valve includes a poppet that is moved into or out of contact with a seat to effect closure or opening, respectively, of the flow path. Motion of the poppet is initiated by electrical heating of one of two opposing pairs of nickel/titanium shape-memory alloy (SMA) wires above their transition temperature: heated wires contract to their remembered length, applying tension to pull the poppet toward or away from the seat. A latch consisting mainly of a bistable Belleville washer (a conical spring) made of a hardened stainless steel operates between two stable positions corresponding to the fully closed or fully open state, holding the poppet in one of these positions when power is not applied to either pair of SMA wires. To obtain maximum actuation force and displacement, the SMA wires must be kept in tension. The mounting fixtures at the ends of the wires must support large tensile stresses without creating stress concentrations that would limit the fatigue lives of the wires. An earlier design provided for each wire to be crimped in a conical opening with a conical steel ferrule that was swaged into the opening to produce a large, uniformly distributed holding force. In a subsequent design, the conical ferrule was replaced with a larger crimped cylindrical ferrule depicted in the figure. A major problem in designing the valve was to protect the SMA wires from a bake-out temperature of 300 C. The problem was solved by incorporating the SMA wires into an actuator module that is inserted into a barrel of the valve body and is held in place by miniature clip rings.

Johnson, A. David↗

SU-E-J-115: Using Markov Chain Modeling to Elucidate Patterns in Breast Cancer Metastasis Over Time and Space

Purpose: Traditionally, breast cancer metastasis is described as a process wherein cancer cells spread from the breast to multiple organ systems via hematogenous and lymphatic routes. Mapping organ specific patterns of cancer spread over time is essential to understanding metastatic progression. In order to better predict sites of metastases, here we demonstrate modeling of the patterned migration of metastasis. Methods: We reviewed the clinical history of 453 breast cancer patients from Memorial Sloan Kettering Cancer Center who were non-metastatic at diagnosis but developed metastasis over time. We used the variables of organ site of metastases as well as time to create a Markov chain model of metastasis. We illustrate the probabilities of metastasis occurring at a given anatomic site together with the probability of spread to additional sites. Results: Based on the clinical histories of 453 breast cancer patients who developed metastasis, we have learned (i) how to create the Markov transition matrix governing the probabilities of cancer progression from site to site; (ii) how to create a systemic network diagram governing disease progression modeled as a random walk on a directed graph; (iii) how to classify metastatic sites as ‘sponges’ that tend to only receive cancer cells or ‘spreaders’ that receive and release them; (iv) how to model the time-scales of disease progression as a Weibull probability distribution function; (v) how to perform Monte Carlo simulations of disease progression; and (vi) how to interpret disease progression as an entropy-increasing stochastic process. Conclusion: Based on our modeling, metastatic spread may follow predictable pathways. Mapping metastasis not simply by organ site, but by function as either a ‘spreader’ or ‘sponge’ fundamentally reframes our understanding of metastatic processes. This model serves as a novel platform from which we may integrate the evolving genomic landscape that drives cancer metastasis. PS-OC Trans-Network Project Grant Award for “Data Assimilation and ensemble statistical forecasting methods applied to the MSKCC longitudinal metastatic breast cancer cohort.”.

60 APPLIED LIFE SCIENCES↗

A dictionary learning algorithm for compression and reconstruction of streaming data in preset order

There has been an emerging interest in developing and applying dictionary learning (DL) to process massive datasets in the last decade. Many of these efforts, however, focus on employing DL to compress and extract a set of important features from data, while considering restoring the original data from this set a secondary goal. On the other hand, although several methods are able to process streaming data by updating the dictionary incrementally as new snapshots pass by, most of those algorithms are designed for the setting where the snapshots are randomly drawn from a probability distribution. In this paper, we present a new DL approach to compress and denoise massive dataset in real time, in which the data are streamed through in a preset order (instances are videos and temporal experimental data), so at any time, we can only observe a biased sample set of the whole data. Here, our approach incrementally builds up the dictionary in a relatively simple manner: if the new snapshot is adequately explained by the current dictionary, we perform a sparse coding to find its sparse representation; otherwise, we add the new snapshot to the dictionary, with a Gram-Schmidt process to maintain the orthogonality. To compress and denoise noisy datasets, we apply the denoising to the snapshot directly before sparse coding, which deviates from traditional dictionary learning approach that achieves denoising via sparse coding. Compared to full-batch matrix decomposition methods, where the whole data is kept in memory, and other mini-batch approaches, where unbiased sampling is often assumed, our approach has minimal requirement in data sampling and storage: i) each snapshot is only seen once then discarded, and ii) the snapshots are drawn in a preset order, so can be highly biased. Through experiments on climate simulations and scanning transmission electron microscopy (STEM) data, we demonstrate that the proposed approach performs competitively to those methods in data reconstruction and denoising.

97 MATHEMATICS AND COMPUTING↗

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↗

In situ, 3D characterization of the deformation mechanics of a superelastic NiTi shape memory alloy single crystal under multiscale constraint

Microstructural elements in NiTi shape memory alloys (SMAs) – precipitates, phase boundaries, inclusions, grain boundaries – can be viewed as sources of multiscale constraint that influence their deformation response. In this paper, we characterized in situ, and in 3D, the deformation and the evolution of microstructure during a tension test in a superelastic NiTi specimen containing some of these sources of constraint. The method used was far-field high-energy X-ray diffraction microscopy (ff-HEDM), complemented by electron microscopy. We simulated the local stress state in the specimen using a microstructural model informed by the experimental data. Using these combined microstructure, deformation, and stress data, we report three phenomena, and relate them to specific sources of constraint. During initial elastic loading, axial lattice strain in austenite increased monotonically. On partial stress-induced phase transformation to martensite, the stress redistributed to both phases leading to a stress relaxation in austenite. The specimen contained a dense distribution of inclusions, which led to the activation of martensite habit plane variants that produce less than theoretical maximum transformation strain. Large Ni 4 Ti 3 precipitates potentially contributed to the poor transformation response. Under load, proportional gradients in local rotation and elastic stretch developed in the martensite phase, because of the constraint at phase interfaces. Finally, this combined ff-HEDM, electron microscopy, microstructural simulation toolbox provides a versatile method to understand the effect of constraint on inelastic deformation in other alloys with hierarchical microstructure.

36 MATERIALS SCIENCE↗

Methods for Detector Placement and Analysis of Criticality Accident Alarm Systems

Determining the optimum placement to minimize the number of detectors for a criticality accident alarm system (CAAS) in a large manufacturing facility is a complex problem. There is typically a target for the number of detectors that can be used over a given zone of the facility. A study to optimize detector placement typically begins with some initial guess at the placement of the detectors and is followed by either predictive calculations of accidents at specific locations or adjoint calculations based on preferred detector locations. Within an area of a facility, there may be a large number of potential criticality accident sites. For any given placement of the detectors, the list of accident sites can be reduced to a smaller number of locations at which accidents may be difficult for detectors to detect. Developing the initial detector placement and determining the list of difficult accident locations are both based on the practitioner's experience. Simulations following fission particles released from an accident location are called 'forward calculations.' These calculations can be used to answer the question 'where would an alarm be triggered?' by an accident at a specified location. Conversely, 'adjoint calculations' start at a detector site using the detector response function as a source and essentially run in reverse. These calculations can be used to answer the question 'where would an accident be detected?' by a specified detector location. If the number of accidents, P, is much less than the number of detectors, Q, then forward simulations may be more convenient and less time-consuming. If Q is large or the detectors are not placed yet, then a mesh tally of dose observed by a detector at any location must be computed over the entire zone. If Q is much less than P, then adjoint calculations may be more efficient. Adjoint calculations employing a mesh tally can be even more advantageous because they do not rely on a list of specific difficult-to-detect accident sites, which may not have included every possible accident location. Analog calculations (no biasing) simply follow particles naturally. For sparse buildings and line-of-sight calculations, analog Monte Carlo (MC) may be adequate. For buildings with internal walls or large amounts of heavy equipment (dense geometry), variance reduction may be required. Calculations employing the CADIS method use a deterministic calculation to create an importance map and a matching biased source distribution that optimize the final MC to quickly calculate one specific tally. Calculations employing the FW-CADIS method use two deterministic calculations (one forward and one adjoint) to create an importance map and a matching biased source distribution that are designed to make the MC calculate a mesh tally with more uniform uncertainties in both high-dose and low-dose areas. Depending on the geometry of the problem, the number of detectors, and the number of accident sites, different approaches to CAAS placement studies can be taken. These are summarized in Table I. SCALE 6.1 contains the MAVRIC sequence, which can be used to perform any of the forward-based approaches outlined in Table I. For analog calculations, MAVRIC simply calls the Monaco MC code. For CADIS and FW-CADIS, MAVRIC uses the Denovo discrete ordinates (SN) deterministic code to generate the importance map and biased source used by Monaco. An adjoint capability is currently being added to Monaco and should be available in the next release of SCALE. An adjoint-based approach could be performed with Denovo alone - although fine meshes, large amounts of memory, and long computation times may be required to obtain accurate solutions. Coarse-mesh SN simulations could be employed for adjoint-based scoping studies until the adjoint capability in Monaco is complete. CAAS placement studies, especially those dealing with mesh tallies, require some extra utilities to aid in the analysis. Detectors must receive a minimum dose rate in order to alarm; therefore, a simple yes/no plot could be more useful to the analyst than a standard dose rate contour plot. Alarm systems that require several detectors to alarm simultaneously for a given accident would need to combine several yes/no plots in order to show accident sites where multiple detectors would be triggered. This could require a plot of 'areas of coverage' that is mapped over the building geometry. Several new utilities (which will be part of SCALE 6.2) were created to help with CAAS analysis.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Cyberattack Detection and Mitigation on Central Volt‐VAr Using Circuit Law and Machine Learning

ABSTRACT In a distribution grid, voltage is maintained within a nominal range through a Volt‐VAr function that controls capacitor banks, reactive power of distributed energy resources (DER), and on‐load tap changers (OLTC). Availability of communications helps with the implementation of central Volt‐VAr control; however, it also opens the system to cyberattacks, causing voltage disturbances. Previous work has shown the adverse impacts of false data injection (FDI) on the central Volt‐VAr control; however, very few works have studied methods to detect and mitigate FDI on Volt‐VAr control. This paper addresses gaps in the detection and mitigation of FDI on the measurement packets of a central Volt‐VAr control. This work uses a two‐stage algorithm for cyberattack detection since the accuracy of a single‐stage machine learning (ML)–based detection method decreases while dealing with unseen data. The first stage is based on the verification of measurements against circuit laws, and the second stage utilizes a tree search algorithm and an ML method to detect the falsified data. This paper compares long short‐term memory (LSTM) and bidirectional LSTM (BiLSTM) as the employed ML algorithms. Finally, the mitigation algorithm replaces the falsified data with the estimated output of the ML algorithm. The effectiveness of the proposed method is tested for several cases using the IEEE 13‐bus test system in PSCAD software.

Beikbabaei, Milad [Bradley Department of Electrica↗

Collaborative Enhancements to Unlock Interregional Transmission

Multiple recent studies highlight significant benefits associated with expansion of interregional transfer capabilities for efficiently adapting to these changes. Despite these proposed benefits, few, if any, interregional transmission projects have been built in recent memory . The objective of this report is to confront the barriers to interregional transmission that exist today and address them with potential reforms and collaborative solutions. This report identifies solutions with the potential for immediate beneficial impact on interregional transmission with the ultimate goal of allowing more effective identification and advancement of interregional transmission projects that create the most positive net value to the participating systems . It distinguishes between states, federal government, and planning regions as key actors in implementing solutions designed to be flexible to accommodate regional differences.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Refine your search to explore more results.