Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “NETWORK”

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,621 records · Page 90
All sourcesNASA NTRSDOE OSTI
DOE OSTI2013

Active patterning and asymmetric transport in a model actomyosin network

Cytoskeletal networks, which are essentially motor-filament assemblies, play a major role in many developmental processes involving structural remodeling and shape changes. These are achieved by nonequilibrium self-organization processes that generate functional patterns and drive intracellular transport. We construct a minimal physical model that incorporates the coupling between nonlinear elastic responses of individual filaments and force-dependent motor action. By performing stochastic simulations we show that the interplay of motor processes, described as driving anti-correlated motion of the network vertices, and the network connectivity, which determines the percolation character of the structure, can indeed capture the dynamical and structural cooperativity which gives rise to diverse patterns observed experimentally. The buckling instability of individual filaments is found to play a key role in localizing collapse events due to local force imbalance. Motor-driven buckling-induced node aggregation provides a dynamic mechanism that stabilizes the two-dimensional patterns below the apparent static percolation limit. Coordinated motor action is also shown to suppress random thermal noise on large time scales, the two-dimensional configuration that the system starts with thus remaining planar during the structural development. By carrying out similar simulations on a three-dimensional anchored network, we find that the myosin-driven isotropic contraction of a well-connected actin network, when combined with mechanical anchoring that confers directionality to the collective motion, may represent a novel mechanism of intracellular transport, as revealed by chromosome translocation in the starfish oocyte.

36 MATERIALS SCIENCE↗
DOE OSTI2014

Hybrid function projective synchronization in complex dynamical networks

This paper investigates hybrid function projective synchronization in complex dynamical networks. When the complex dynamical networks could be synchronized up to an equilibrium or periodic orbit, a hybrid feedback controller is designed to realize the different component of vector of node could be synchronized up to different desired scaling function in complex dynamical networks with time delay. Hybrid function projective synchronization (HFPS) in complex dynamical networks with constant delay and HFPS in complex dynamical networks with time-varying coupling delay are researched, respectively. Finally, the numerical simulations show the effectiveness of theoretical analysis.

36 MATERIALS SCIENCE↗
DOE OSTI2014

Control of collective network chaos

Under certain conditions, the collective behavior of a large globally-coupled heterogeneous network of coupled oscillators, as quantified by the macroscopic mean field or order parameter, can exhibit low-dimensional chaotic behavior. Recent advances describe how a small set of “reduced” ordinary differential equations can be derived that captures this mean field behavior. Here, we show that chaos control algorithms designed using the reduced equations can be successfully applied to imperfect realizations of the full network. To systematically study the effectiveness of this technique, we measure the quality of control as we relax conditions that are required for the strict accuracy of the reduced equations, and hence, the controller. Although the effects are network-dependent, we show that the method is effective for surprisingly small networks, for modest departures from global coupling, and even with mild inaccuracy in the estimate of network heterogeneity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Note: Design and development of wireless controlled aerosol sampling network for large scale aerosol dispersion experiments

Wireless based custom built aerosol sampling network is designed, developed, and implemented for environmental aerosol sampling. These aerosol sampling systems are used in field measurement campaign, in which sodium aerosol dispersion experiments have been conducted as a part of environmental impact studies related to sodium cooled fast reactor. The sampling network contains 40 aerosol sampling units and each contains custom built sampling head and the wireless control networking designed with Programmable System on Chip (PSoC™) and Xbee Pro RF modules. The base station control is designed using graphical programming language LabView. The sampling network is programmed to operate in a preset time and the running status of the samplers in the network is visualized from the base station. The system is developed in such a way that it can be used for any other environment sampling system deployed in wide area and uneven terrain where manual operation is difficult due to the requirement of simultaneous operation and status logging.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2015

Synchronized states and multistability in a random network of coupled discontinuous maps

The synchronization behavior of coupled chaotic discontinuous maps over a ring network with dynamic random connections is reported in this paper. It is observed that random rewiring stabilizes one of the two strongly unstable fixed points of the local map. Depending on initial conditions, the network synchronizes to different unstable fixed points, which signifies the existence of synchronized multistability in the complex network. Moreover, the length of discontinuity of the local map has an important role in generating windows of different synchronized fixed points. Synchronized fixed point and synchronized periodic orbits are found in the network depending on coupling strength and different parameter values of the local map. We have identified the existence of period subtracting bifurcation with respect to coupling strength in the network. The range of coupling strength for the occurrence of synchronized multistable spatiotemporal fixed points is determined. This range strongly depends upon the dynamic rewiring probability and also on the local map.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Phase diagram of hopping conduction mechanisms in polymer nanofiber network

Network formation by nanofiber crosslinking is usually in polymer materials as application in organic semiconductor devices. Electron hopping transport mechanisms depend on polymer morphology in network. Conducting polymers morphology in a random network structure is modeled by a quasi-one-dimensional system coupled of chains or fibers. We observe the varying hopping conduction mechanisms in the polyaniline nanofibers of the random network structure. The average diameter d of the nanofibers is varied from approximately 10 to 100 nm. The different dominant hopping mechanisms including Efros-Shklovskii variable-range hopping (VRH), Mott VRH, and nearest-neighbor hopping are dependent on temperature range and d in crossover changes. The result of this study is first presented in a phase diagram of hopping conduction mechanisms based on the theories of the random network model. The hopping conduction mechanism is unlike in normal semiconductor materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Stabilization of model-based networked control systems

A class of networked control systems called Model-Based Networked Control Systems (MB-NCSs) is considered. Stabilization of MB-NCSs is studied using feedback controls and simulation of stabilization for different feedbacks is made with the purpose to reduce the network trafic. The feedback control input is applied in a compensated model of the plant that approximates the plant dynamics and stabilizes the plant even under slow network conditions. Conditions for global exponential stabilizability and for the choosing of a feedback control input for a given constant time between the information moments of the network are derived. An optimal control problem to obtain an optimal feedback control is also presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Structural complexity of quantum networks

Quantum network is a set of nodes connected with channels, through which the nodes communicate photons and classical information. Classical structural complexity of a quantum network may be defined through its physical structure, i.e. mutual position of nodes and channels connecting them. We show here that the classical structural complexity of a quantum network does not restrict the structural complexity of entanglement graphs, which may be created in the quantum network with local operations and classical communication. We show, in particular, that 1D quantum network can simulate both simple entanglement graphs such as lattices and random graphs and complex small-world graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Two-dimensional plasmons in lateral carbon nanotube network structures and their effect on the terahertz radiation detection

We consider the carrier transport and plasmonic phenomena in the lateral carbon nanotube (CNT) networks forming the device channel with asymmetric electrodes. One electrode is the Ohmic contact to the CNT network and the other contact is the Schottky contact. These structures can serve as detectors of the terahertz (THz) radiation. We develop the device model for collective response of the lateral CNT networks which comprise a mixture of randomly oriented semiconductor CNTs (s-CNTs) and quasi-metal CNTs (m-CNTs). The proposed model includes the concept of the collective two-dimensional (2D) plasmons in relatively dense networks of randomly oriented CNTs (CNT “felt”) and predicts the detector responsivity spectral characteristics exhibiting sharp resonant peaks at the signal frequencies corresponding to the 2D plasmonic resonances. The detection mechanism is the rectification of the ac current due the nonlinearity of the Schottky contact current-voltage characteristics under the conditions of a strong enhancement of the potential drop at this contact associated with the plasmon excitation. The detector responsivity depends on the fractions of the s- and m-CNTs. The burning of the near-contact regions of the m-CNTs or destruction of these CNTs leads to a marked increase in the responsivity in agreement with our experimental data. The resonant THz detectors with sufficiently dense lateral CNT networks can compete and surpass other THz detectors using plasmonic effects at room temperatures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Parallel replica dynamics method for bistable stochastic reaction networks: Simulation and sensitivity analysis

Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Atlas of putative minima and low-lying energy networks of water clusters n = 3 - 25

We report a database consisting of the putative minima and ~3.2 million local minima lying within 5 kcal/mol from the putative minima for water clusters of sizes n = 3 – 25 using an improved version of the Monte Carlo Temperature Basin Paving (MCTBP) global optimization procedure in conjunction with the ab-initio based, flexible, polarizable Thole-Type Model (TTM2.1-F, version 2.1) interaction potential for water. Several of the low-lying structures, as well as lowlying penta-coordinated water networks obtained with the TTM2.1-F potential, were further refined at the Møller-Plesset second order perturbation MP2/aug-cc-pVTZ level of theory. In total, we have identified 3,138,303 networks corresponding to local minima of the clusters n = 3 – 25, whose Cartesian coordinates and relative energies can be obtained from the webpage https://sites.uw.edu/wdbase/. Networks containing penta-coordinated water molecules start to appear at n = 11 and, quite surprisingly, are energetically close (within 1 – 3 kcal/mol) to the putative minima, a fact that has been confirmed from the MP2 calculations. This large database of water cluster minima spanning quite dissimilar hydrogen bonding networks is expected to influence the development and assessment of the accuracy of interaction potentials for water as well as lower scaling electronic structure methods (such as different density functionals). Furthermore, it can also be used in conjunction with data science approaches (including but no limited to neural networks, machine and deep learning) to understand the properties of water, nature’s most important substance.

Rakshit, Avijit↗
DOE OSTI2023

Self-consistent hopping theory of activated relaxation and diffusion of dilute penetrants in dense crosslinked polymer networks

We generalize a microscopic statistical mechanical theory of the activated dynamics of dilute spherical penetrants in glass-forming liquids to study the influence of crosslinking in polymer networks on the penetrant relaxation time and diffusivity over a wide range of temperature and crosslink fraction (f n ). Our calculations are relevant to recent experimental studies of a nm-sized molecule diffusing in poly-(n-butyl methacrylate) networks. The theory predicts the penetrant relaxation time increases exponentially with the glass transition temperature, T g (f n ), which grows roughly linearly with the square root of fn due to the coupling of local hopping to longer-range collective elasticity. Moreover, T g is also found to be proportional to a geometric confinement parameter defined as the ratio of the penetrant diameter to the mean network mesh size. The decoupling ratio of the penetrant and Kuhn segment alpha times displays a complex non-monotonic dependence on f n and temperature that is well collapsed based on the variable T g (f n )/T. A model for the penetrant diffusion constant that combines activated relaxation and entropic mesh confinement is proposed, which results in a significantly stronger suppression of mass transport with degree of effective supercooling than predicted for the penetrant alpha time. Furthermore, this behavior corresponds to a new network-based type of “decoupling” of diffusion and relaxation. In contrast to the diffusion of larger nanoparticles in high temperature rubbery networks, our analysis in the supercooled regime suggests that for the penetrants studied the mesh confinement effects are of secondary importance relative to the consequences of crosslink-induced slowing down of activated hopping of glassy physics origin.

Chemistry↗
DOE OSTI2024

Using the Metropolis algorithm to explore the loss surface of a recurrent neural network

In the limit of small trial moves the Metropolis Monte Carlo algorithm is equivalent to gradient descent on the energy function in the presence of Gaussian white noise. This observation was originally used to demonstrate a correspondence between Metropolis Monte Carlo moves of model molecules and overdamped Langevin dynamics, but it also applies in the context of training a neural network: making small random changes to the weights of a neural network, accepted with the Metropolis probability, with the loss function playing the role of energy, has the same effect as training by explicit gradient descent in the presence of Gaussian white noise. We explore this correspondence in the context of a simple recurrent neural network. We also explore regimes in which this correspondence breaks down, where the gradient of the loss function becomes very large or small. In these regimes the Metropolis algorithm can still effect training, and so can be used as a probe of the loss function of a neural network in regimes in which gradient descent struggles. We also show that training can be accelerated by making purposely-designed Monte Carlo trial moves of neural-network weights.

Casert, Corneel↗
DOE OSTI2024

Machine learning without a processor: Emergent learning in a nonlinear analog network

Standard deep learning algorithms require differentiating large nonlinear networks, a process that is slow and power-hungry. Electronic contrastive local learning networks (CLLNs) offer potentially fast, efficient, and fault-tolerant hardware for analog machine learning, but existing implementations are linear, severely limiting their capabilities. These systems differ significantly from artificial neural networks as well as the brain, so the feasibility and utility of incorporating nonlinear elements have not been explored. Here, we introduce a nonlinear CLLN—an analog electronic network made of self-adjusting nonlinear resistive elements based on transistors. We demonstrate that the system learns tasks unachievable in linear systems, including XOR (exclusive or) and nonlinear regression, without a computer. We find our decentralized system reduces modes of training error in order (mean, slope, curvature), similar to spectral bias in artificial neural networks. The circuitry is robust to damage, retrainable in seconds, and performs learned tasks in microseconds while dissipating only picojoules of energy across each transistor. This suggests enormous potential for fast, low-power computing in edge systems like sensors, robotic controllers, and medical devices, as well as manufacturability at scale for performing and studying emergent learning.

Science & Technology - Other Topics↗
DOE OSTI2017

A novel approach to estimate emissions from large transportation networks: Hierarchical clustering-based link-driving-schedules for EPA-MOVES using dynamic time warping measures

We present that EPA-MOVES (Motor Vehicle Emission Simulator) is often integrated with traffic simulators to assess emission levels of large-scale urban networks with signalized intersections. High variations in speed profiles exist in the context of congested urban networks with signalized intersections. The traditional average-speed-based emission estimation technique with EPA-MOVES provides faster execution while underestimates the emissions in most cases because of ignoring the speed variation at congested networks with signalized intersections. In contrast, the atomic second-by-second speed profile (i.e., the trajectory of each vehicle)-based technique provides accurate emissions at the cost of excessive computational power and time. We addressed this issue by developing a novel method to determine the link-driving-schedules (LDSs) for the EPA-MOVES tool. Our research developed a hierarchical clustering technique with dynamic time warping similarity measures (HC-DTW) to find the LDS for EPA-MOVES that is capable of producing emission estimates better than the average-speed-based technique with execution time faster than the atomic speed profile approach. We applied the HC-DTW on a sample data from a signalized corridor and found that HC-DTW can significantly reduce computational time without compromising the accuracy. The developed technique in this research can substantially contribute to the EPA-MOVES-based emission estimation process for large-scale urban transportation network by reducing the computational time with reasonably accurate estimates. This method is highly appropriate for transportation networks with higher variation in speed such as signalized intersections. Lastly, experimental results show error difference ranging from 2% to 8% for most pollutants except PM 10 .

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Particle image velocimetry analysis with simultaneous uncertainty quantification using Bayesian neural networks

Particle image velocimetry (PIV) is an effective tool in experimental fluid mechanics for extracting flow fields from images. Recently, convolutional neural networks (CNNs) have been used to perform PIV analysis with accuracy on par with classical methods. Here we extend the use of CNNs to analyze PIV data while providing simultaneous uncertainty quantification on the inferred flow field. The method we apply in this paper is a Bayesian convolutional neural network (BCNN) which learns distributions of the CNN weights through variational Bayes. In order to demonstrate the utility of BCNNs for the PIV task, we compare the performance of three distinct BCNN models with simple architectures. The first network estimates flow velocity from image interrogation regions only. Our second model learns to infer velocity from both the image interrogation regions and interrogation region cross-correlation maps. Finally, our best performing network infers velocities from interrogation region cross-correlation maps only. We find that BCNNs using interrogation region cross-correlation maps as inputs perform better than those using interrogation windows only as inputs and discuss reasons why this may be the case. Additionally, we test the best performing BCNN on a full synthetic test image pair and a real image pair from the 1st International PIV Challenge. We show that ~98% of true particle displacements from the full synthetic image pair can be captured within the BCNN's 95% confidence intervals, and that the BCNN's performance on the real image pair is quantitatively similar to that of algorithms tested in the 1st International PIV Challenge. Finally, we show that BCNNs can be generalized to be used with multi-pass PIV algorithms with a moderate loss in accuracy, which may be overcome by future work on finetuning and training schemes. So to our knowledge, this is the first use of Bayesian neural networks to perform PIV.

47 OTHER INSTRUMENTATION↗
DOE OSTI2014

Big Data over a 100G network at Fermilab

As the need for Big Data in science becomes ever more relevant, networks around the world are upgrading their infrastructure to support high-speed interconnections. To support its mission, the high-energy physics community as a pioneer in Big Data has always been relying on the Fermi National Accelerator Laboratory to be at the forefront of storage and data movement. This need was reiterated in recent years with the data-taking rate of the major LHC experiments reaching tens of petabytes per year. At Fermilab, this resulted regularly in peaks of data movement on the Wide area network (WAN) in and out of the laboratory of about 30 Gbit/s and on the Local are network (LAN) between storage and computational farms of 160 Gbit/s. To address these ever increasing needs, as of this year Fermilab is connected to the Energy Sciences Network (ESnet) through a 100 Gb/s link. To understand the optimal system-and application-level configuration to interface computational systems with the new highspeed interconnect, Fermilab has deployed a Network Research & Development facility connected to the ESnet 100G Testbed. For the past two years, the High Throughput Data Program (HTDP) has been using the Testbed to identify gaps in data movement middleware [5] when transferring data at these high-speeds. The program has published evaluations of technologies typically used in High Energy Physics, such as GridFTP [4], XrootD [9], and Squid [8]. Furthermore, this work presents the new R&D facility and the continuation of the evaluation program.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

On the use of neural networks for energy reconstruction in high-granularity calorimeters

We contrasted the performance of deep neural networks — Convolutional Neural Network (CNN) and Graph Neural Network (GNN) — to current state of the art energy regression methods in a finely 3D-segmented calorimeter simulated by GEANT4. This comparative benchmark gives us some insight to assess the particular latent signals neural network methods exploit to achieve superior resolution. A CNN trained solely on a pure sample of pions achieved substantial improvement in the energy resolution for both single pions and jets over the conventional approaches. It maintained good performance for electron and photon reconstruction. We also used the Graph Neural Network (GNN) with edge convolution to assess the importance of timing information in the shower development for improved energy reconstruction. We implement a simple simulation based correction to the energy sum derived from the fraction of energy deposited in the electromagnetic shower component. This serves as an approximate dual-readout analogue for our benchmark comparison. Although this study does not include the simulation of detector effects, such as electronic noise, the margin of improvement seems robust enough to suggest these benefits will endure in real-world application. We also find reason to infer that the CNN/GNN methods leverage latent features that concur with our current understanding of the physics of calorimeter measurement.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗