Physical Layer Network Management Tools Based on Automated Fiber Optic Patch-Panels
Explore the source record for details and available documents.
97 MATHEMATICS AND COMPUTING↗
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.
Mobiliti v1.0
Mobiliti is a software platform designed to emulate the dynamics of a regional transportation road network. It is built on open-source software that provides parallel discrete-event simulation. The software is transformative in the area of transportation network simulation because of the geospatial scale and fidelity of the network model and the computational time it takes to model a full day of travel demand. For example, it runs a simulation of the entire San Francisco Bay Area, with a network model of ~1M links and a population that completes ~19M trips in ~5 minutes. This scale of simulation has not been attempted with existing simulation models due to the complexity of the model and the computational time it would take to complete. The intent of the software is to create a digital twin capability for cities to evaluate consequences of infrastructure or policy changes on road network dynamics.
Macfarlane, Jane↗
Optimum aggregation of geographically distributed flexible resources in strategic smart-grid/microgrid locations
This paper determines optimum aggregation areas for a given distribution network considering spatial distribution of loads and costs of aggregation. An elitist genetic algorithm combined with a hierarchical clustering and a Thevenin network reduction is implemented to compute strategic locations and aggregate demand within each area. The aggregation reduces large distribution networks having thousands of nodes to an equivalent network with few aggregated loads, thereby significantly reducing the computational burden. Furthermore, it not only helps distribution system operators in making faster operational decisions by understanding during which time of the day will be in need of flexibility, from which specific area, and in which amount, but also enables the flexibilities stemming from small distributed resources to be traded in various power/energy markets. A combination of central and local aggregation scheme where a central aggregator enables market participation, while local aggregators materialize the accepted bids, is implemented to realize this concept. The effectiveness of the proposed method is evaluated by comparing network performances with and without aggregation. Finally, for a given network configuration, steady-state performance of aggregated network is significantly accurate (≈ ±1.5% error) compared to very high errors associated with forecast of individual consumer demand.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Combined Final Report for Colony II Project
(This report was originally submmited by the lead PI (Terry Jones, ORNL) on October 22, 2013 to the program manager, Lucy Nowell. It is being submitted from University of Illinois in accordance with instructions). HPC Colony II seeks to provide portable performance for leadership class machines. Our strategy is based on adaptive system software that aims to make the intelligent decisions necessary to allow domain scientists to safely focus on their task at hand and allow the system software stack to adapt their application to the underlying architecture. This report describes the research undertaken towards these objectives and the results obtained over the performance period of the project.
97 MATHEMATICS AND COMPUTING↗
Nonconvex regularization for sparse neural networks
Convex ℓ 1 regularization using an infinite dictionary of neurons has been suggested for constructing neural networks with desired approximation guarantees, but can be affected by an arbitrary amount of over-parametrization. This can lead to a loss of sparsity and result in networks with too many active neurons for the given data, in particular if the number of data samples is large. As a remedy, in this paper, a nonconvex regularization method is investigated in the context of shallow ReLU networks: We prove that in contrast to the convex approach, any resulting (locally optimal) network is finite even in the presence of infinite data (i.e., if the data distribution is known and the limiting case of infinite samples is considered). Moreover, here we show that approximation guarantees and existing bounds on the network size for finite data are maintained.
97 MATHEMATICS AND COMPUTING↗
The role of stereochemistry in combustion processes
Stereochemical effects significantly influence chemical processes, yet it is not well understood if they are a leading source of uncertainty in combustion modeling. Stereochemistry influences a combustion model (i) at the earliest stage of its construction when mapping the reaction network, (ii) in the computation of individual thermochemical and rate parameters, and (iii) in the prediction of combustion observables. The present work reviews the importance of enumerating stereochemical species and reactions at each of these steps. Further, it analyzes the separate influence of several types of stereochemistry, including geometric, optical, and fleeting transition state diastereomers. Three reaction networks serve to examine which stages of low-temperature oxidation are most affected by stereochemistry, including the first and second oxidation of n-butane, the third oxidation of n-pentane, and the early stages of pyrolysis of 1- and 2-pentene. The 149 reactions in the n-butane mechanism are expanded to 183 reactions when accounting for diastereomerism. Each of these 183 reactions is parameterized with ab initio kinetics computations to determine that, for the n-butane mechanism, the median factor of diastereomeric deviation is 3.5 at 360 K for rate constants and as high as 1.6 for mechanism reactivity, in terms of ignition delay times, as opposed to a mechanism without stereochemical expansion.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Freeze-cast alumina pore networks: Effects of freezing conditions and dispersion medium
Not Available
Miller, S. M.↗
A historical survey of algorithms and hardware architectures for neural-inspired and neuromorphic computing applications
In this study, biological neural networks continue to inspire new developments in algorithms and microelectronic hardware to solve challenging data processing and classification problems. Here in this research, we survey the history of neural-inspired and neuromorphic computing in order to examine the complex and intertwined trajectories of the mathematical theory and hardware developed in this field. Early research focused on adapting existing hardware to emulate the pattern recognition capabilities of living organisms. Contributions from psychologists, mathematicians, engineers, neuroscientists, and other professions were crucial to maturing the field from narrowly-tailored demonstrations to more generalizable systems capable of addressing difficult problem classes such as object detection and speech recognition. Algorithms that leverage fundamental principles found in neuroscience such as hierarchical structure, temporal integration, and robustness to error have been developed, and some of these approaches are achieving world-leading performance on particular data classification tasks. Additionally, novel microelectronic hardware is being developed to perform logic and to serve as memory in neuromorphic computing systems with optimized system integration and improved energy efficiency. Key to such advancements was the incorporation of new discoveries in neuroscience research, the transition away from strict structural replication and towards the functional replication of neural systems, and the use of mathematical theory frameworks to guide algorithm and hardware developments.
97 MATHEMATICS AND COMPUTING↗
Parallelized telecom quantum networking with an ytterbium-171 atom array
The integration of quantum computers and sensors into a quantum network enables new capabilities in quantum information science. Most networks with atom-like qubits operate at visible or near-ultraviolet wavelengths and require conversion to the telecom band for long-distance communication, which reduces efficiency and potentially introduces noise. In this article we report high-fidelity entanglement between ytterbium-171 atoms and optical photons generated directly in the telecommunication band, where fibre loss is low. The nuclear spin of the atom is entangled with a single photon in the time-bin basis, yielding a high atom-measurement-corrected atom–photon Bell state fidelity. This can be further improved by addressing photon measurement errors. By imaging the atom array onto an optical fibre array, we also implement a parallelized networking protocol that can increase the remote entanglement rate proportionately with the number of channels. We also preserve coherence on a memory qubit during operations on communication qubits. These results support the integration of atomic systems into scalable quantum networks.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Automatically parallelizing batch inference on deep neural networks using Fiats and Fortran 2023 `do concurrent`
This paper introduces novel programming strategies that leverage features of the Fortran 2023 standard of the International Standards Organization (ISO) to automatically parallelize computations on deep neural networks. The paper focuses on the interplay of object-oriented, parallel, and functional programming paradigms in the Fiats deep learning library. We demonstrate how several infrequently used language features play a role in enabling efficient, parallel execution. Specifically, the ability to explicitly declare that a procedure is pure facilitates inference in the context of the language’s loop-parallelism construct `do concurrent`. Also, explicitly prohibiting the overriding of a parent type’s type-bound procedures eliminates the need for dynamic dispatch in performance-critical code. Finally, this paper uses batch inference calculations on a neural network surrogate for atmospheric aerosol dynamics to demonstrate that LLVM Flang compiler’s automatic parallelization of `do concurrent` achieves roughly the same performance and scalability as achieved by OpenMP compiler directives. We also demonstrate that double-precision inference costs 37–72% longer runtime than default-real precision with most values in the range 57-60%.
Rouson, Damian↗
Sensitivity-Informed Bayesian Inference for Home PLC Network Models with Unknown Parameters
Bayesian inference is used to calibrate a bottom-up home PLC network model with unknown loads and wires at frequencies up to 30 MHz. A network topology with over 50 parameters is calibrated using global sensitivity analysis and transitional Markov Chain Monte Carlo (TMCMC). The sensitivity-informed Bayesian inference computes Sobol indices for each network parameter and applies TMCMC to calibrate the most sensitive parameters for a given network topology. A greedy random search with TMCMC is used to refine the discrete random variables of the network. This results in a model that can accurately compute the transfer function despite noisy training data and a high dimensional parameter space. The model is able to infer some parameters of the network used to produce the training data, and accurately computes the transfer function under extrapolative scenarios.
42 ENGINEERING↗
Quantitative relationships between film morphology, charge carrier dynamics, and photovoltaic performance in bulk-heterojunction binary vs. ternary acceptor blends
Addressing pertinent and perplexing questions regarding why nonfullerene acceptors (NFAs) promote higher power conversion efficiencies (PCEs) than traditional fullerenes and how photoactive bulk heterojunction (BHJ) film morphology, charge photogeneration, and recombination dynamics dictate solar cell performance have stimulated many studies of polymer solar cells (PSCs), yet quantitative relationships remain limited. Better understanding in these areas offers the potential to advance materials design and device engineering, afford higher PCEs, and ultimate commercialization. Here we probe quantitative relationships between BHJ film morphology, charge carrier dynamics, and photovoltaic performance in model binary and ternary blend systems having a wide bandgap donor polymer, a fullerene, and a promising NFA. We show that optimal PC 71 BM incorporation in a PBDB-TF:ITIC-Th binary system matrix retains the original π-face-on orientation, ITIC-Th crystallinity and BHJ film crystallite dimensions, and reduces film upper surface ITIC-Th segregation. Such morphology changes together simultaneously increase hole (μ h ) and electron (μ e ) mobilities, facilitate light-activated ITIC-Th to PC 71 BM domain electron delocalization, reduce free charge carrier (FC) bimolecular recombination (BR) within PBDB-TF:ITIC-Th mixed regions, and increase FC extraction pathways viaPBDB-TF:PC 71 BM pairs. The interplay of these effects yields significantly enhanced inverted cell short-circuit current density (J SC ), fill factor (FF), and PCE. Unexpectedly, we also find that excessive PC 71 BM in the PBDB-TF:ITIC-Th binary system alters the PBDB-TF orientation to π-edge-on, increases large scale PC 71 BM-rich aggregations and BHJ upper surface PC 71 BM composition. Further, these morphology changes increase parasitic decay processes such as intersystem crossing from photoexcited PC 71 BM, compromising the J SC , FF, and PCE metrics. ITIC-Th X-ray diffraction reveals a unique sidechain-dominated molecular network with previously unknown sidechain-end group stacking, rationalizing the STEM and GIWAXS results, photophysics, and the high μ e . DFT computation reveals charge transfer networks within ITIC-Th crystallites, supporting excited-state electron delocalization from ITIC-Th to PC 71 BM. This structure–property understanding leads to a newly reported NFA blend with PCE near 17%.
14 SOLAR ENERGY↗
Multisource Data Fusion Outage Location in Distribution Systems via Probabilistic Graphical Models
Efficient outage location is critical to enhancing the resilience of power distribution systems. However, accurate outage location requires combining massive evidence received from diverse data sources, including smart meter (SM) last gasp signals, customer trouble calls, social media messages, weather data, vegetation information, and physical parameters of the network. This is a computationally complex task due to the high dimensionality of data in distribution grids. In this paper, we propose a multi-source data fusion approach to locate outage events in partially observable distribution systems using Bayesian networks (BNs). A novel aspect of the proposed approach is that it takes multi-source evidence and the complex structure of distribution systems into account using a probabilistic graphical method. Our method can radically reduce the computational complexity of outage location inference in high-dimensional spaces. The graphical structure of the proposed BN is established based on the network’s topology and the causal relationship between random variables, such as the states of branches/customers and evidence. Utilizing this graphical model, accurate outage locations are obtained by leveraging a Gibbs sampling (GS) method, to infer the probabilities of de-energization for all branches. Compared with commonly-used exact inference methods that have exponential complexity in the size of the BN, GS quantifies the target conditional probability distributions in a timely manner. As a result, a case study of several real-world distribution systems is presented to validate the proposed method.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Optimizing power system restoration with damaged communications
Utility procedures for power system blackstart and restoration typically assume that energization decisions can be reliably communicated across the grid. In reality, the communications and control network would likely also be affected in power outages, such as those caused by extreme weather events or cyber-attacks. This paper studies the effect of damage to the power system communications and control infrastructure on restoration operations following a blackout. We model the communications infrastructure as a graph, overlaying the power grid, and imposing the requirement that every energized element in the power grid be observable from a control center. We expand on a specialized branch-and-bound algorithm from the literature to optimize the restoration process and devise an initialization heuristic and a rounding heuristic to improve solution speed. We perform numerical experiments on synthetic systems for Illinois and Texas with outages based on a solar flare or hurricane. We compare the results of our specialized branch-and-bound algorithm to the results from (i) the initialization heuristic alone, (ii) a variation of this heuristic that we use as a baseline, and (iii) the restoration optimization for the power system without communications constraints. Here, we find that damage to the communications infrastructure significantly increases the time required to re-energize the grid. Moreover, by simultaneously optimizing communications repairs and grid energization decisions, we are able to re-energize the grid significantly faster than if communications repairs and energization decisions were made independently or with partial coordination, motivating improvements to current industry practice.
97 MATHEMATICS AND COMPUTING↗
Resilience of the slow component in timescale separated synchronized oscillators
Physiological networks are usually made of a large number of biological oscillators evolving on a multitude of different timescales. Phase oscillators are particularly useful in the modelling of the synchronization dynamics of such systems. If the coupling is strong enough compared to the heterogeneity of the internal parameters, synchronized states might emerge where phase oscillators start to behave coherently. Here, we focus on the case where synchronized oscillators are divided into a fast and a slow component so that the two subsets evolve on separated timescales. We assess the resilience of the slow component by, first, reducing the dynamics of the fast one using Mori-Zwanzig formalism. Second, we evaluate the variance of the phase deviations when the oscillators in the two components are subject to noise with possibly distinct correlation times. From the general expression for the variance, we consider specific network structures and show how the noise transmission between the fast and slow components is affected. Interestingly, we find that oscillators that are among the most robust when there is only a single timescale, might become the most vulnerable when the system undergoes a timescale separation. We also find that layered networks seem to be insensitive to such timescale separations.
97 MATHEMATICS AND COMPUTING↗
Modeling Large-Scale Slim Fly Networks Using Parallel Discrete-Event Simulation
As supercomputers approach exascale performance, the increased number of processors translates to an increased demand on the underlying network interconnect. We present that the slim fly network topology, a new low-diameter, low-latency, and low-cost interconnection network, is gaining interest as one possible solution for next-generation supercomputing interconnect systems. In this article, we present a high-fidelity slim fly packet-level model leveraging the Rensselaer Optimistic Simulation System (ROSS) and Co-Design of Exascale Storage (CODES) frameworks. We validate the model with published work before scaling the network size up to an unprecedented 1 million compute nodes and confirming that the slim fly observes peak network throughput at extreme scale. In addition to synthetic workloads, we evaluate large-scale slim fly models with real communication workloads from applications in the Design Forward program with over 110,000 MPI processes. We show strong scaling of the slim fly model on an Intel cluster achieving a peak network packet transfer rate of 2.3 million packets per second and processing over 7 billion discrete events using 128 MPI tasks. Enabled by the strong performance capabilities of the model, we perform a detailed application trace and routing protocol performance study. Lastly, through analysis of metrics such as packet latency, hop count, and congestion, we find that the slim fly network is able to leverage simple minimal routing and achieve the same performance as more complex adaptive routing for tested DOE benchmark applications.
97 MATHEMATICS AND COMPUTING↗
Cost function dependent barren plateaus in shallow parametrized quantum circuits
Variational quantum algorithms (VQAs) optimize the parameters θ of a parametrized quantum circuit V(θ) to minimize a cost function C. While VQAs may enable practical applications of noisy quantum computers, they are nevertheless heuristic methods with unproven scaling. Here, we rigorously prove two results, assuming V(θ) is an alternating layered ansatz composed of blocks forming local 2-designs. Our first result states that defining C in terms of global observables leads to exponentially vanishing gradients (i.e., barren plateaus) even when V(θ) is shallow. Hence, several VQAs in the literature must revise their proposed costs. On the other hand, our second result states that defining C with local observables leads to at worst a polynomially vanishing gradient, so long as the depth of V(θ) is Ο(logn). Our results establish a connection between locality and trainability. We illustrate these ideas with large-scale simulations, up to 100 qubits, of a quantum autoencoder implementation.
97 MATHEMATICS AND COMPUTING↗
Quantum networks with neutral atom processing nodes
Abstract Quantum networks providing shared entanglement over a mesh of quantum nodes will revolutionize the field of quantum information science by offering novel applications in quantum computation, enhanced precision in networks of sensors and clocks, and efficient quantum communication over large distances. Recent experimental progress with individual neutral atoms demonstrates a high potential for implementing the crucial components of such networks. We highlight latest developments and near-term prospects on how arrays of individually controlled neutral atoms are suited for both efficient remote entanglement generation and large-scale quantum information processing, thereby providing the necessary features for sharing high-fidelity and error-corrected multi-qubit entangled states between the nodes. We describe both the functionality requirements and several examples for advanced, large-scale quantum networks composed of neutral atom processing nodes.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗