Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer 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 1,027 records · Page 57

A convolutional neural network approach to calibrating the rotation axis for X-ray computed tomography

This paper presents an algorithm to calibrate the center-of-rotation for X-ray tomography by using a machine learning approach, the Convolutional Neural Network (CNN). The algorithm shows excellent accuracy from the evaluation of synthetic data with various noise ratios. It is further validated with experimental data of four different shale samples measured at the Advanced Photon Source and at the Swiss Light Source. The results are as good as those determined by visual inspection and show better robustness than conventional methods. CNN has also great potential for reducing or removing other artifacts caused by instrument instability, detector non-linearity, etc . An open-source toolbox, which integrates the CNN methods described in this paper, is freely available through GitHub at tomography/xlearn and can be easily integrated into existing computational pipelines available at various synchrotron facilities. Source code, documentation and information on how to contribute are also provided.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Micro- and nano-X-ray computed-tomography: A step forward in the characterization of the pore network of a leached cement paste

Pore structure of leached cement pastes (w/c = 0.5) was studied for the first time from micro-scale down to the nano-scale by combining micro- and nano-X-ray computed tomography (micro- and nano-CT). This allowed assessing the 3D heterogeneity of the pore network along the cement profile (from the core to the altered layer) of almost the entire range of cement pore size, i.e. from capillary to gel pores. We successfully quantified an increase of porosity in the altered layer at both resolutions. Porosity is increasing from 1.8 to 6.1% and from 18 to 58% at the micro-(voxel = 1.81 μm) and nano-scale (voxel = 63.5 nm) respectively. The combination of both CT allowed to circumvent weaknesses inherent of both investigation scales. In addition the connectivity and the channel size of the pore network were also evaluated to obtain a complete 3D pore network characterization at both scales.

36 MATERIALS SCIENCE↗

Feasibility of Hybrid Electro- and Acousto-Dynamical Systems for Quantum Optical Networks

We present results on an exploratory research program that aims to study the feasibility of novel, sustained, dense, and efficient quantum information generation, storage, retrieval, relay and distribution devices and systems towards future advanced quantum networking architectures. The pathfinder program is anchored on original ideas and device conceptual designs that turn the phononic-sourced challenges into an opportunity towards optimized transduction chains over a broad range of length and energy/temperature scales. The proposal involves conceptual design and feasibility towards integration, commissioning and benchmarking of challenging transduction devices in a scaled quantum network setup.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Skip-Connected Self-Recurrent Spiking Neural Networks with Joint Intrinsic Parameter and Synaptic Weight Training

As an important class of spiking neural networks (SNNs), recurrent spiking neural networks (RSNNs) possess great computational power and have been widely used for processing sequential data like audio and text. However, most RSNNs suffer from two problems. 1. Due to the lack of architectural guidance, random recurrent connectivity is often adopted, which does not guarantee good performance. 2. Training of RSNNs is in general challenging, bottlenecking achievable model accuracy. To address these problems, we propose a new type of RSNNs called Skip-Connected Self-Recurrent SNNs (ScSr-SNNs). Recurrence in ScSr-SNNs is introduced in a stereotyped manner by adding self-recurrent connections to spiking neurons. The SNNs with self-recurrent connections can realize recurrent behaviors similar to those of more complex RSNNs while the error gradients can be more straightforwardly calculated due to the mostly feedforward nature of the network. The network dynamics is enriched by skip connections between nonadjacent layers. Moreover, we propose a new backpropagation (BP) method called backpropagated intrinsic plasticity (BIP) to further boost the performance of ScSr-SNNs by training intrinsic model parameters. Unlike standard intrinsic plasticity rules that adjust the neuron's intrinsic parameters according to neuronal activity, the proposed BIP method optimizes intrinsic parameters based on the backpropagated error gradient of a well-defined global loss function in addition to synaptic weight training. Here, based on challenging speech, neuromorphic speech, and neuromorphic image datasets, the proposed ScSr-SNNs can boost performance by up to 2.85% compared with other types of RSNNs trained by state-of-the-art BP methods.

97 MATHEMATICS AND COMPUTING↗

Memory node controller

A memory node controller for a node of a data processing network, the network including at least one computing device and at least one data resource, each data resource addressed by a physical address. The node is configured to couple the at least one computing device with the at least one data resource. Elements of the data processing network are addressed via a system address space. The memory node controller includes a first interface to the at least one data resource, a second interface to the at least one computing device, and a system to physical address translator cache configured to translate a system address in the system address space to a physical address in the physical address space of the at least one data resource.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Diagnosing Anomalous Network Performance with Confidence

Variability in network performance is a major obstacle in effectively analyzing the throughput of modern high performance computer systems. High performance interconnec- tion networks offer excellent best-case network latencies; how- ever, highly parallel applications running on parallel machines typically require consistently high levels of performance to adequately leverage the massive amounts of available computing power. Performance analysts have usually quantified network performance using traditional summary statistics that assume the observational data is sampled from a normal distribution. In our examinations of network performance, we have found this method of analysis often provides too little data to under- stand anomalous network performance. Our tool, Confidence, instead uses an empirically derived probability distribution to characterize network performance. In this paper we describe several instances where the Confidence toolkit allowed us to understand and diagnose network performance anomalies that we could not adequately explore with the simple summary statis- tics provided by traditional measurement tools. In particular, we examine a multi-modal performance scenario encountered with an Infiniband interconnection network and we explore the performance repeatability on the custom Cray SeaStar2 interconnection network after a set of software and driver updates.

Settlemyer, Bradley W↗

CRNT4SBML: a Python package for the detection of bistability in biochemical reaction networks

Motivation: Signaling pathways capable of switching between two states are ubiquitous within living organisms. They provide the cells with the means to produce reversible or irreversible decisions. Switchlike behavior of biological systems is realized through biochemical reaction networks capable of having two or more distinct steady states which are dependent on initial conditions. Investigation of whether a certain signaling pathway can confer bistability involves a substantial amount of hypothesis testing. The cost of direct experimental testing can be prohibitive. Therefore, constraining the hypothesis space is highly bene?cial. One such methodology is based on Chemical Reaction Network Theory which uses computational techniques to rule out pathways that are not capable of bistability regardless of kinetic constant values and molecule concentrations. Although useful, these methods are complicated from both pureandcomputationalmathematicsperspectives.Thus,theiradoptionisverylimitedamongstbiologists. Results: We brought Chemical Reaction Network Theory approaches closer to experimental biologists by automating all the necessary steps in CRNT4SMBL. The input is based on SBML format which is the community standard for biological pathway communication. The tool parses SBML and derives C-graph representations of the biological pathway with mass action kinetics. Next steps involve an ef?cient search for potential saddle-node bifurcation points using an optimization technique. This type of bifurcation is important as it has the potential of acting as a switching point between two steady states. Finally, if any bifurcation points are present, numerical continuation analysis extends the equilibria branches for generating the diagram. Presence of an S-shaped bifurcation diagram indicates that the pathway acts as a bistable switch for the given optimization parameters. Availability: CRNT4SBML is available via the Python Package Index. The documentation can be found at https://crnt4sbml.readthedocs.io. CRNT4SBML is licensed under the Apache Software License 2.0. Contact: vladislav.petyuk@pnnl.gov

Reyes, Brandon C.↗

An Intelligent Distributed Ledger Construction Algorithm for IoT

Blockchain is the next generation of secure data management that creates near-immutable decentralized storage. Secure cryptography created a niche for blockchain to provide alternatives to well-known security compromises. However, design bottlenecks with traditional blockchain data structures scale poorly with increased network usage and are extremely computation-intensive. This made the technology difficult to combine with limited devices, like those in Internet of Things networks. In protocols like IOTA, replacement of blockchain's linked-list queue processing with a lightweight dynamic ledger showed remarkable throughput performance increase. However, current stochastic algorithms for ledger construction suffer distinct trade-offs between efficiency and security. This work proposed a machine-learning approach with a multi-arm bandit that resolved these issues and was designed for auditing on limited devices. This algorithm was tested in a reinforcement-learning environment simulating the IOTA ledger's construction with a decision tree. This study showed through regret analysis and experimentation that this approach was secure against impulse manipulation attacks while remaining energy-efficient. Although the IOTA protocol was a pioneer for lightweight distributed ledgers, it is expected that future blockchain protocols will adopt techniques similar to those presented in this work.

multi-arm bandit↗

Hydrogen-Bonding Network and OH Stretch Vibration of Cellulose: Comparison of Computational Modeling with Polarized IR and SFG Spectra

Hydrogen bonds play critical roles in noncovalent directional interactions determining the crystal structure of cellulose. Although diffraction studies accurately determined the coordinates of carbon and oxygen atoms in crystalline cellulose, the structural information on hydrogen atoms involved in hydrogen-bonding is still elusive. This could be complemented by vibrational spectroscopy; but the assignment of the OH stretch peaks has been controversial. In this study, we performed calculations using density functional theory with dispersion corrections (DFT-D2) for the cellulose Iβ crystal lattices with the experimentally determined carbon and oxygen coordinates. DFT-D2 calculations revealed that the OH stretch vibrations of cellulose are highly coupled and delocalized through intra- and interchain hydrogen bonds involving all OH groups in the crystal. Additionally, molecular dynamics (MD) simulations of a single cellulose microfibril showed that the conformations of OH groups exposed at the microfibril surface are not well-defined. Finally, comparison of the computation results with the experimentally determined IR dichroism of uniaxially aligned cellulose microfibrils and the peak positions of various cellulose crystals allowed unambiguous identification of OH stretch modes observed in the vibrational spectra of cellulose.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis

The Theory of Bottleneck Structures is a recently-developed framework for studying the performance of data networks. It describes how local perturbations in one part of the network propagate and interact with others. This framework is a powerful analytical tool that allows network operators to make accurate predictions about network behavior and thereby optimize performance. Previous work implemented a software package for bottleneck structure analysis, but applied it only to toy examples. In this work, we introduce the first software package capable of scaling bottleneck structure analysis to production-size networks. Here, we benchmark our system using logs from ESnet, the Department of Energy's high-performance data network that connects research institutions in the U.S. Using the previously published tool as a baseline, we demonstrate that our system achieves vastly improved performance, constructing the bottleneck structure graphs in 0.21 s and calculating link derivatives in 0.09 s on average. We also study the asymptotic complexity of our core algorithms, demonstrating good scaling properties and strong agreement with theoretical bounds. These results indicate that our new software package can maintain its fast performance when applied to even larger networks. They also show that our software is efficient enough to analyze rapidly changing networks in real time. Overall, we demonstrate the feasibility of applying bottleneck structure analysis to solve practical problems in large, real-world data networks.

benchmark↗

Complex-valued universal linear transformations and image encryption using spatially incoherent diffractive networks

As an optical processor, a diffractive deep neural network (D2NN) utilizes engineered diffractive surfaces designed through machine learning to perform all-optical information processing, completing its tasks at the speed of light propagation through thin optical layers. With sufficient degrees of freedom, D2NNs can perform arbitrary complex-valued linear transformations using spatially coherent light. Similarly, D2NNs can also perform arbitrary linear intensity transformations with spatially incoherent illumination; however, under spatially incoherent light, these transformations are nonnegative, acting on diffraction-limited optical intensity patterns at the input field of view. Here, we expand the use of spatially incoherent D2NNs to complex-valued information processing for executing arbitrary complex-valued linear transformations using spatially incoherent light. Through simulations, we show that as the number of optimized diffractive features increases beyond a threshold dictated by the multiplication of the input and output space-bandwidth products, a spatially incoherent diffractive visual processor can approximate any complex-valued linear transformation and be used for all-optical image encryption using incoherent illumination. The findings are important for the all-optical processing of information under natural light using various forms of diffractive surface-based optical processors.

36 MATERIALS SCIENCE↗

Memristive Networks

Explore the source record for details and available documents.

Computer Science↗