Using Neural Networks to Model Multigroup Neutron Cross Sections
This presentation provides an overview of the efforts to implement neural networks to model neutron cross section data.
SEARCH · Search NASA
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.
This presentation provides an overview of the efforts to implement neural networks to model neutron cross section data.
Models that predict brain responses to stimuli provide one measure of understanding of a sensory system and have many potential applications in science and engineering. Deep artificial neural networks have emerged as the leading such predictive models of the visual system but are less explored in audition. Prior work provided examples of audio-trained neural networks that produced good predictions of auditory cortical fMRI responses and exhibited correspondence between model stages and brain regions, but left it unclear whether these results generalize to other neural network models and, thus, how to further improve models in this domain. We evaluated model-brain correspondence for publicly available audio neural network models along with in-house models trained on 4 different tasks. Most tested models outpredicted standard spectromporal filter-bank models of auditory cortex and exhibited systematic model-brain correspondence: Middle stages best predicted primary auditory cortex, while deep stages best predicted non-primary cortex. However, some state-of-the-art models produced substantially worse brain predictions. Models trained to recognize speech in background noise produced better brain predictions than models trained to recognize speech in quiet, potentially because hearing in noise imposes constraints on biological auditory representations. The training task influenced the prediction quality for specific cortical tuning properties, with best overall predictions resulting from models trained on multiple tasks. The results generally support the promise of deep neural networks as models of audition, though they also indicate that current models do not explain auditory cortical responses in their entirety.
Recent years have seen a lot of progress in algorithms for learning parameters of spreading dynamics from both full and partial data. Some of the remaining challenges include model selection under the scenarios of unknown network structure, noisy data, missing observations in time, as well as an efficient incorporation of prior information to minimize the number of samples required for an accurate learning. Here, in this work, we introduce a universal learning method based on a scalable dynamic message-passing technique that addresses these challenges often encountered in real data. The algorithm leverages available prior knowledge on the model and on the data, and reconstructs both network structure and parameters of a spreading model. We show that a linear computational complexity of the method with the key model parameters makes the algorithm scalable to large network instances.
Network intrusion detection systems (NIDS) are commonly used to detect malware communications, including command-and-control (C2) traffic from botnets. NIDS performance assessments have been studied for decades, but mathematical modeling has rarely been used to explore NIDS performance. This paper details a mathematical model that describes a NIDS performing packet inspection and its detection of malware's C2 traffic. Here, the paper further describes an emulation testbed and a set of cyber experiments that used the testbed to validate the model. These experiments included a commonly used NIDS (Snort) and traffic with contents from a pervasive malware (Emotet). Results are presented for two scenarios: a nominal scenario and a “stressed” scenario in which the NIDS cannot process all incoming packets. Model and experiment results match well, with model estimates mostly falling within 95 % confidence intervals on the experiment means. Model results were produced 70-3000 times faster than the experimental results. Consequently, the model's predictive capability could potentially be used to support decisions about NIDS configuration and effectiveness that require high confidence results, quantification of uncertainty, and exploration of large parameter spaces. Furthermore, the experiments provide an example for how emulation testbeds can be used to validate cyber models that include stochastic variability.
Energy-efficient separation processes are essential for a wide range of applications ranging from clean fuels (e.g., hydrogen purification) and petroleum refining (e.g., natural gas processing) to water purification and carbon capture. Membrane-mediated separations have shown tremendous promise in providing high productivity and high separation efficiency at significantly lower energy consumption, e.g., up to 90% less energy cost than traditional thermally driven processes such as distillation. Polymeric membranes–the dominant separation membrane materials–have yet to reach their full potential due to their limitations in long-term durability (e.g., productivity loss over the period of their lifetime due to physical aging) or insufficient stability under harsh conditions (e.g., high temperature, chemically complex feeds). This research seeks to establish a new paradigm in polymer membrane material design by harnessing crosslinked model networks with well-defined yet finely tailorable microstructure to facilitate fast and selective gas transport and simultaneously enhance membrane stability. Unlike traditional randomly crosslinked polymers, which suffer from structural inconsistencies and consequently suboptimal gas separation performance, crosslinked model network membranes prepared via a precisely controlled end-linking process enables the creation of previously unattainable microstructure tunability, which, in turn, results in versatile crosslinked membranes with high separation performance that meet the needs of various challenging gas separations. Using model network framework as a fundamental tool by applying this concept in diverse polymer categories, this work has led to the development of various innovative crosslinked membrane structures such as unimodal, bimodal and clustered model networks. These advanced crosslinked polymer membranes not only demonstrate exceptional gas separation performance that significantly outperform existing randomly crosslinked membranes, but also possess excellent long-term durability and robust stability under complex operating conditions. From a fundamental perspective, results from this research provide critical mechanistic insights into gas separation in crosslinked polymer membranes, addressing key knowledge gaps and opening new avenues for membrane design to meet various separation needs. The new membrane materials produced from this research enable the use of polymeric membranes for high temperature gas separations, offering substantial energy and cost savings by eliminating the need for repeated cooling-heating cycles in industrial processes.
To assist NASA in identifying research art, with the greatest potential for improving the air transportation system, two models were developed as part of its Aviation System Analysis Capability (ASAC). The ASAC Flight Segment Cost Model (FSCM) is used to predict aircraft trajectories, resource consumption, and variable operating costs for one or more flight segments. The Network Cost Model can either summarize the costs for a network of flight segments processed by the FSCM or can be used to independently estimate the variable operating costs of flying a fleet of equipment given the number of departures and average flight stage lengths.
Statistical methods for classification of data from multiple data sources are investigated and compared to neural network models. A problem with using conventional multivariate statistical approaches for classification of data of multiple types is in general that a multivariate distribution cannot be assumed for the classes in the data sources. Another common problem with statistical classification methods is that the data sources are not equally reliable. This means that the data sources need to be weighted according to their reliability but most statistical classification methods do not have a mechanism for this. This research focuses on statistical methods which can overcome these problems: a method of statistical multisource analysis and consensus theory. Reliability measures for weighting the data sources in these methods are suggested and investigated. Secondly, this research focuses on neural network models. The neural networks are distribution free since no prior knowledge of the statistical distribution of the data is needed. This is an obvious advantage over most statistical classification methods. The neural networks also automatically take care of the problem involving how much weight each data source should have. On the other hand, their training process is iterative and can take a very long time. Methods to speed up the training procedure are introduced and investigated. Experimental results of classification using both neural network models and statistical methods are given, and the approaches are compared based on these results.
Dynamical systems see widespread use in natural sciences like physics, biology, and chemistry, as well as engineering disciplines such as circuit analysis, computational fluid dynamics, and control. For simple systems, the differential equations governing the dynamics can be derived by applying fundamental physical laws. However, for more complex systems, this approach becomes exceedingly difficult. Data-driven modeling is an alternative paradigm that seeks to learn an approximation of the dynamics of a system using observations of the true system. In recent years, there has been an increased interest in applying data-driven modeling techniques to solve a wide range of problems in physics and engineering. Here this article provides a survey of the different ways to construct models of dynamical systems using neural networks. In addition to the basic overview, we review the related literature and outline the most significant challenges from numerical simulations that this modeling paradigm must overcome. Based on the reviewed literature and identified challenges, we provide a discussion on promising research areas.
Control of both the magnitude and the shape of tokamak profiles will be necessary to achieve stable, high-performance plasmas. In order to reject disturbances in real time, feedback-control algorithms rely on accurate real-time knowledge of the plasma state. When diagnostics alone are insufficient, either because they are limited in number or their measurements are too noisy, observers can be used to combine diagnostic data with a response model to provide a better estimation of different plasma properties. An observer has been developed to estimate the electron temperature profile in real time using both diagnostic data from the Thomson scattering system and a model based on the electron heat transport equation describing the evolution of the electron temperature profile. Here, neural network surrogate models are leveraged to help improve the overall model prediction while staying within computation time constraints for real-time use. The observer algorithm is shown in offline tests to produce smooth profiles that are consistent with both the diagnostic data and the electron heat transport equation. When implemented into the real-time plasma control system, this observer will provide valuable information on the electron temperature profile to many potential feedback-control applications.
This article proposes a new traffic signal control algorithm to deal with unknown-traffic-system uncertainties and reduce delays in vehicle travel time. Unknown-traffic-system dynamics are approximated using a recurrent neural network (NN). To accurately identify the traffic system model, an online-learning scheme is developed to switch among a set of candidate NNs (i.e., multiple-model NNs) based on their estimation errors. Then, a bank of optimal signal-timing controllers is designed based on the online identification of the traffic system. Simulation studies have been carried out for the obtained control strategies using multiple-model NNs, and the desired results have been obtained. Moreover, compared with the widely used actuated traffic signal control schemes, it is shown that the proposed method can reduce vehicle travel delays and improve traffic system robustness.
A finite volume-based network flow modeling tool, Generalized Fluid System Simulation Program (GFSSP), was used to simulate the no-vent filling of a cryogenic tank with a thermodynamic vent system assisted injector. The tank was discretized into nodes in the radial and axial directions to calculate two-dimensional axisymmetric flow with heat transfer between the solid wall and fluid. The nodes are connected by branches where momentum equations are solved to calculate the flowrates. The mass and energy conservation equations and the equation of state are solved to calculate pressure, temperature, and resident mass at the nodes. The energy conservation equations at the solid nodes were solved to calculate the temperature of the solid wall. The system of equations was solved by a combination of successive substitution and simultaneous Newton-Raphson method. The numerical model accounts for a) different regimes of pool boiling heat transfer, b) condensation of vapor around the spray droplets, c) condensation of vapor at the interface of the cooled injector and ullage, and d) condensation at the liquid-vapor interphase. The numerical predictions of tank pressure, filling rate, and wall temperatures were compared with the test data. The paper also presents the effect of nodal discretization by comparing the results of the 1D and 2D models and examines the effect of the droplet diameter on tank filling.
A finite volume-based network flow modeling tool, Generalized Fluid System Simulation Program (GFSSP), was used to simulate the no-vent filling of a cryogenic tank with a thermodynamic vent system assisted injector. The tank was discretized into nodes in the radial and axial directions to calculate two-dimensional axisymmetric flow with heat transfer between the solid wall and fluid. The nodes are connected by branches where momentum equations are solved to calculate the flowrates. The mass and energy conservation equations and the equation of state are solved to calculate pressure, temperature, and resident mass at the nodes. The energy conservation equations at the solid nodes were solved to calculate the temperature of the solid wall. The system of equations was solved by a combination of successive substitution and simultaneous Newton-Raphson method. The numerical model accounts for a) different regimes of pool boiling heat transfer, b) condensation of vapor around the spray droplets, c) condensation of vapor at the interface of the cooled injector and ullage, and d) condensation at the liquid-vapor interphase. The numerical predictions of tank pressure, filling rate, and wall temperatures were compared with the test data. The paper also presents the effect of nodal discretization by comparing the results of the 1D and 2D models and examines the effect of the droplet diameter on tank filling.
Modeling adversarial activities is a critical component of developing high-con?dence indicators of efforts to acquire, fabricate, proliferate, and/or deploy weapons of mass terror (WMTs). Current approaches to generating representative patterns of interest (a.k.a templates) from the real-world domains involve a Subject Matter Expert (SME)-guided manual process. The goal of Data-Driven Template Discovery (DDTD) is to use a (potentially small) set of SME generated templates to discover other previously unknown and interesting templates in an attributed graph. A template is an activity pattern describing a set of interactions among a group of nodes in the graph. The motivation behind DDTD is to expand the original set of templates, without having SMEs craft all the templates by hand. DDTD also provides seed templates to SMEs, to help them construct larger, high-?delity, and scenario-oriented templates. In these cases, obtaining a larger set of templates that are related (contain similar signals) to the original set is of great value. In this work, we propose to use Graph Convolutional Neural Networks (GCNs) to discover new templates that are heavily related to the original set. GCNs are a family of Neural Network (NN) architectures especially designed to work directly on graphs. In contrast to the traditional NNs, that require considerable amounts of labeled data, GCNs do not require a big labeled training set because they can directly leverage the graph structure instead. This property makes GCNs the perfect tool for creating activity templates.
Neural networks are a very useful tool for analyzing and modeling complex real world systems. Applying neural network simulations to real world problems generally involves large amounts of data and massive amounts of computation. To efficiently handle the computational requirements of large problems, we have implemented at Los Alamos a highly efficient neural network compiler for serial computers, vector computers, vector parallel computers, and fine grain SIMD computers such as the CM-2 connection machine. This paper describes the mapping used by the compiler to implement feed-forward backpropagation neural networks for a SIMD (Single Instruction Multiple Data) architecture parallel computer. Thinking Machines Corporation has benchmarked our code at 1.3 billion interconnects per second (approximately 3 gigaflops) on a 64,000 processor CM-2 connection machine (Singer 1990). This mapping is applicable to other SIMD computers and can be implemented on MIMD computers such as the CM-5 connection machine. Our mapping has virtually no communications overhead with the exception of the communications required for a global summation across the processors (which has a sub-linear runtime growth on the order of O(log(number of processors)). We can efficiently model very large neural networks which have many neurons and interconnects and our mapping can extend to arbitrarily large networks (within memory limitations) by merging the memory space of separate processors with fast adjacent processor interprocessor communications. This paper will consider the simulation of only feed forward neural network although this method is extendable to recurrent networks.
The present invention is a fully connected feed forward network that includes at least one hidden layer 16. The hidden layer 16 includes nodes 20 in which the output of the node is fed back to that node as an input with a unit delay produced by a delay device 24 occurring in the feedback path 22 (local feedback). Each node within each layer also receives a delayed output (crosstalk) produced by a delay unit 36 from all the other nodes within the same layer 16. The node performs a transfer function operation based on the inputs from the previous layer and the delayed outputs. The network can be implemented as analog or digital or within a general purpose processor. Two teaching methods can be used: (1) back propagation of weight calculation that includes the local feedback and the crosstalk or (2) more preferably a feed forward gradient decent which immediately follows the output computations and which also includes the local feedback and the crosstalk. Subsequent to the gradient propagation, the weights can be normalized, thereby preventing convergence to a local optimum. Education of the network can be incremental both on and off-line. An educated network is suitable for modeling and controlling dynamic nonlinear systems and time series systems and predicting the outputs as well as hidden states and parameters. The educated network can also be further educated during on-line processing.
Concurrent systems are computers that use multiple processors to solve a single problem. A means to predict the application performance on these systems is a useful tool in many areas of concurrent system research. A computationally efficient and accurate method to predict performance for a class of parallel computations on concurrent systems is described. A parallel computation is modeled as a task system with precedence relationships expressed as a series parallel directed acyclic graph. Resources in concurrent systems are modeled as service centers in queueing network models. Using these two models as inputs, the method outputs predictions of both the time to complete the computation and the concurrent system utilization. The algorithm used is based on the approximate Mean Value Analysis in queueing network modeling with extensions to model concurrency in the computation. The new algorithm was validated against both detailed simulation and actual execution on a commercial multiprocessor.
Numerical simulation has become indispensable in advancing cost-effective process optimization and control of flow batteries. We propose an enhanced version of the physics-constrained deep neural network (PCDNN) approach to provide high-accuracy voltage predictions in the vanadium redox flow batteries (VRFBs). The purpose of the PCDNN approach is to enforce the physics-based zero-dimensional (0D) VRFB model in a neural network to assure model generalization for various battery operation conditions. However, limited by the simplifications of the 0D model, the PCDNN cannot capture sharp voltage changes in the extreme SOC regions. To improve the accuracy of voltage prediction at extreme ranges, we introduce a second (enhanced) DNN to mitigate the prediction errors carried from the 0D model itself and call the resulting approach enhanced PCDNN (ePCDNN). By comparing with experimental data, we demonstrate that the ePCDNN approach can accurately capture the voltage response throughout the charge–discharge cycle, including the tail region of the voltage discharge curve. The loss function for training the ePCDNN is designed to be flexible by adjusting the weights of the physics-constrained DNN and the enhanced DNN. In conclusion, this allows the ePCDNN framework to be transferable to battery systems with variable physical model fidelity.
We report that TensorBNN is a new package based on TensorFlow that implements Bayesian inference for modern neural network models. The posterior density of neural network model parameters is represented as a point cloud sampled using Hamiltonian Monte Carlo. The TensorBNN package leverages TensorFlow's architecture and its ability to use modern graphics processing units in both the training and prediction stages.