Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “DATA NETWORKS”

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 505 records · Page 28

Co-ordination of the International Network of Nuclear Structure and Decay Data Evaluators

The 21st meeting of the International Network of Nuclear Structure and Decay Data Evaluators was convened at the IAEA Headquarters, Vienna, from 20 to 24 April 2015 under the auspices of the IAEA Nuclear Data Section. This meeting was attended by 36 scientists from 15 Member States, plus IAEA staff, concerned with the compilation, evaluation and dissemination of nuclear structure and decay data. A summary of the meeting, data centre reports, various proposals considered, and actions agreed by the participants, as well as recommendations/conclusions are presented within this document.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A genomic data archive from the Network for Pancreatic Organ donors with Diabetes

The Network for Pancreatic Organ donors with Diabetes (nPOD) is the largest biorepository of human pancreata and associated immune organs from donors with type 1 diabetes (T1D), maturity-onset diabetes of the young (MODY), cystic fibrosis-related diabetes (CFRD), type 2 diabetes (T2D), gestational diabetes, islet autoantibody positivity (AAb+), and without diabetes. nPOD recovers, processes, analyzes, and distributes high-quality biospecimens, collected using optimized standard operating procedures, and associated de-identified data/metadata to researchers around the world. Herein describes the release of high-parameter genotyping data from this collection. 372 donors were genotyped using a custom precision medicine single nucleotide polymorphism (SNP) microarray. Data were technically validated using published algorithms to evaluate donor relatedness, ancestry, imputed HLA, and T1D genetic risk score. Additionally, 207 donors were assessed for rare known and novel coding region variants via whole exome sequencing (WES). These data are publicly-available to enable genotype-specific sample requests and the study of novel genotype:phenotype associations, aiding in the mission of nPOD to enhance understanding of diabetes pathogenesis to promote the development of novel therapies.

59 BASIC BIOLOGICAL SCIENCES↗

Recovering missing CFD data for high-order discretizations using deep neural networks and dynamics learning

Data I/O poses a significant bottleneck in large-scale CFD simulations; thus, practitioners would like to significantly reduce the number of times the solution is saved to disk, yet retain the ability to recover any field quantity (at any time instance) a posteriori . The objective of this work is therefore to accurately recover missing CFD data a posteriori at any time instance, given that the solution has been written to disk at only a relatively small number of time instances. We consider in particular high-order discretizations (e.g., discontinuous Galerkin), as such techniques are becoming increasingly popular for the simulation of highly separated flows. To satisfy this objective, this work proposes a methodology consisting of two stages: 1) dimensionality reduction and 2) dynamics learning. For dimensionality reduction, we propose a novel hierarchical approach. First, the method reduces the number of degrees of freedom within each element of the high-order discretization by applying autoencoders from deep learning. Second, the methodology applies principal component analysis to compress the global vector of encodings. This leads to a low-dimensional state, which associates with a nonlinear embedding of the original CFD data. For dynamics learning, we propose to apply regression techniques (e.g., kernel methods) to learn the discrete-time velocity characterizing the time evolution of this low-dimensional state. In conclusion, a numerical example on a large-scale CFD example characterized by nearly 13 million degrees of freedom illustrates the suitability of the proposed method in an industrial setting.

97 MATHEMATICS AND COMPUTING↗

Using new edges for anomaly detection in computer networks

Creation of new edges in a network may be used as an indication of a potential attack on the network. Historical data of a frequency with which nodes in a network create and receive new edges may be analyzed. Baseline models of behavior among the edges in the network may be established based on the analysis of the historical data. A new edge that deviates from a respective baseline model by more than a predetermined threshold during a time window may be detected. The new edge may be flagged as potentially anomalous when the deviation from the respective baseline model is detected. Probabilities for both new and existing edges may be obtained for all edges in a path or other subgraph. The probabilities may then be combined to obtain a score for the path or other subgraph. A threshold may be obtained by calculating an empirical distribution of the scores under historical conditions.

97 MATHEMATICS AND COMPUTING↗

Using new edges for anomaly detection in computer networks

Creation of new edges in a network may be used as an indication of a potential attack on the network. Historical data of a frequency with which nodes in a network create and receive new edges may be analyzed. Baseline models of behavior among the edges in the network may be established based on the analysis of the historical data. A new edge that deviates from a respective baseline model by more than a predetermined threshold during a time window may be detected. The new edge may be flagged as potentially anomalous when the deviation from the respective baseline model is detected. Probabilities for both new and existing edges may be obtained for all edges in a path or other subgraph. The probabilities may then be combined to obtain a score for the path or other subgraph. A threshold may be obtained by calculating an empirical distribution of the scores under historical conditions.

97 MATHEMATICS AND COMPUTING↗

Using new edges for anomaly detection in computer networks

Creation of new edges in a network may be used as an indication of a potential attack on the network. Historical data of a frequency with which nodes in a network create and receive new edges may be analyzed. Baseline models of behavior among the edges in the network may be established based on the analysis of the historical data. A new edge that deviates from a respective baseline model by more than a predetermined threshold during a time window may be detected. The new edge may be flagged as potentially anomalous when the deviation from the respective baseline model is detected. Probabilities for both new and existing edges may be obtained for all edges in a path or other subgraph. The probabilities may then be combined to obtain a score for the path or other subgraph. A threshold may be obtained by calculating an empirical distribution of the scores under historical conditions.

97 MATHEMATICS AND COMPUTING↗

Using new edges for anomaly detection in computer networks

Creation of new edges in a network may be used as an indication of a potential attack on the network. Historical data of a frequency with which nodes in a network create and receive new edges may be analyzed. Baseline models of behavior among the edges in the network may be established based on the analysis of the historical data. A new edge that deviates from a respective baseline model by more than a predetermined threshold during a time window may be detected. The new edge may be flagged as potentially anomalous when the deviation from the respective baseline model is detected. Probabilities for both new and existing edges may be obtained for all edges in a path or other subgraph. The probabilities may then be combined to obtain a score for the path or other subgraph. A threshold may be obtained by calculating an empirical distribution of the scores under historical conditions.

97 MATHEMATICS AND COMPUTING↗

Landscape composition and configuration have scale-dependent effects on agricultural pest suppression

Increasing landscape heterogeneity (composition and configuration) can enhance natural enemy populations and support pest suppression in agricultural landscapes. Using a network-based data mining approach, we examined independent gradients of landscape composition and configuration at six spatial scales that were associated with pest suppression services measured at 32 sites in Michigan and Wisconsin, USA. We compared the relative effects of landscape composition and configuration across scales with those of local crop type (corn or grassland). We found that multiple gradients of configurational heterogeneity were independent of composition and strongly associated with pest suppression, with different configuration metrics being predictive of pest suppression depending on the spatial scales and regions considered. Landscapes that were more configurationally heterogeneous at smaller spatial scales consistently supported higher pest suppression. In Michigan, pest suppression increased in landscapes with high edge contrast between annual crops and surrounding habitats and high edge density of grassland within 250-500 m radii. In Wisconsin, pest suppression increased with large core area of grassland and high field density within a 250 m radius. The main compositional effect we found was a positive relationship between grassland cover and pest suppression occurring at larger spatial scales (1000-1500 m) and occurring in Wisconsin but not in Michigan. Our findings demonstrate that effects of landscape composition and configuration on pest suppression differ across spatial scales and vary regionally. The network-based data mining techniques used here could be useful for disentangling intercorrelated landscape metrics in a variety of other contexts in landscape ecology.

54 ENVIRONMENTAL SCIENCES↗

Finding, Organizing, and Preserving Legacy Nuclear Test Monitoring Data—Examples from the Livermore Nevada Network

A challenge for geophysical research is the relatively short time for which continuous digital data have been available. There are many events of research interest where much of the data were collected by analog or temporary digital means. These legacy data require special efforts to find, organize, and preserve for future research. Here, we focus on one type of legacy data, nuclear explosions, and associated events (e.g., collapses, aftershocks) of high interest for nuclear monitoring research and development. For nuclear tests conducted in Nevada, the Lawrence Livermore Nevada Network recorded valuable data on a variety of formats. In this article, we briefly review this network, and describe one set of data that previously was available via CD-ROM by request, and since 2018 has become available through Incorporated Research Institutions for Seismology as assembled dataset 18-001.

58 GEOSCIENCES↗

Newberry EGS Seismic Velocity Model

We use ambient noise correlation (ANC) to create a detailed image of the subsurface seismic velocity at the Newberry EGS site down to 5 km. We collected continuous data for the 22 stations in the Newberry network, together with 12 additional stations from the nearby CC, UO and UW networks. The data were instrument corrected, whitened and converted to single bit traces before cross correlation according to the methodology in Benson (2007). There are 231 unique paths connecting the 22 stations of the Newberry network. The additional networks extended that to 402 unique paths crossing beneath the Newberry site.

15 GEOTHERMAL ENERGY↗

High Throughput WAN Data Transfer with Hadoop-Based Storage

Hadoop distributed file system (HDFS) is becoming more popular in recent years as a key building block of integrated grid storage solution in the field of scientific computing. Wide Area Network (WAN) data transfer is one of the important data operations for large high energy physics experiments to manage, share and process datasets of PetaBytes scale in a highly distributed grid computing environment. In this paper, we present the experience of high throughput WAN data transfer with HDFS-based Storage Element. Two protocols, GridFTP and fast data transfer (FDT), are used to characterize the network performance of WAN data transfer.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

In-pixel AI for lossy data compression at source for X-ray detectors

Integrating neural networks for data compression directly in the Read-Out Integrated Circuits (ROICs), i.e. the pixelated front-end, would result in a significant reduction in off-chip data transfer, overcoming the I/O bottleneck. Our ROIC test chip (AI-In-Pixel-65) is designed in a 65 nm Low Power CMOS process for the readout of pixelated X-ray detectors. Each pixel consists of an analog front-end for signal processing and a 10b analog-to-digital converter operating at 100KSPS. Here, we compare two non-reconfigurable techniques, Principal Component Analysis (PCA) and an AutoEncoder (AE) as lossy data compression engines implemented within the pixelated area. The PCA algorithm achieves 50$×$ compression, adds one clock cycle latency, and results in a 21% increase in the pixel area. The AE achieves 70$×$ compression, adds 30 clock cycle latency, and results in a similar area increase.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Learning reduced kinetic Monte Carlo models of complex chemistry from molecular dynamics

Here, we propose a novel statistical learning framework for automatically and efficiently building reduced kinetic Monte Carlo (KMC) models of large-scale elementary reaction networks from data generated by a single or few molecular dynamics simulations (MD). Existing approaches for identifying species and reactions from molecular dynamics typically use bond length and duration criteria, where bond duration is a fixed parameter motivated by an understanding of bond vibrational frequencies. Conversely, we show that for highly reactive systems, bond duration should be a model parameter that is chosen to maximize the predictive power of the resulting statistical model. We demonstrate our method on a high temperature, high pressure system of reacting liquid methane, and show that the learned KMC model is able to extrapolate more than an order of magnitude in time for key molecules. Additionally, our KMC model of elementary reactions enables us to isolate the most important set of reactions governing the behavior of key molecules found in the MD simulation. We develop a new data-driven algorithm to reduce the chemical reaction network which can be solved either as an integer program or efficiently using L1 regularization, and compare our results with simple count-based reduction. For our liquid methane system, we discover that rare reactions do not play a significant role in the system, and find that less than 7% of the approximately 2000 reactions observed from molecular dynamics are necessary to reproduce the molecular concentration over time of methane. Furthermore, we describe a framework in this work that paves the way towards a genomic approach to studying complex chemical systems, where expensive MD simulation data can be reused to contribute to an increasingly large and accurate genome of elementary reactions and rates.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗