Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamic 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,405 records · Page 78

Interpreting and Stabilizing Machine-Learning Parametrizations of Convection

Neural networks are a promising technique for parameterizing subgrid-scale physics (e.g., moist atmospheric convection) in coarse-resolution climate models, but their lack of interpretability and reliability prevents widespread adoption. For instance, it is not fully understood why neural network parameterizations often cause dramatic instability when coupled to atmospheric fluid dynamics. This paper introduces tools for interpreting their behavior that are customized to the parameterization task. First, we assess the nonlinear sensitivity of a neural network to lower-tropospheric stability and the midtropospheric moisture, two widely studied controls of moist convection. Second, we couple the linearized response functions of these neural networks to simplified gravity wave dynamics, and analytically diagnose the corresponding phase speeds, growth rates, wavelengths, and spatial structures. To demonstrate their versatility, these techniques are tested on two sets of neural networks, one trained with a super-parameterized version of the Community Atmosphere Model (SPCAM) and the second with a near-global cloud-resolving model (GCRM). Additionally, even though the SPCAM simulation has a warmer climate than the cloud-resolving model, both neural networks predict stronger heating/drying in moist and unstable environments, which is consistent with observations. Moreover, the spectral analysis can predict that instability occurs when GCMs are coupled to networks that support gravity waves that are unstable and have phase speeds larger than 5 m s -1 . In contrast, standing unstable modes do not cause catastrophic instability. Using these tools, differences between the SPCAM-trained versus GCRM-trained neural networks are analyzed, and strategies to incrementally improve both of their coupled online performance unveiled.

54 ENVIRONMENTAL SCIENCES↗

Computational Challenges for Power System Operation

As the power grid technology evolution and information technology revolution converge, power grids are witnessing a revolutionary transition, represented by emerging grid technologies and large scale deployment of new sensors and meters in networks. This transition brings opportunities, as well as computational challenges in the field of power grid analysis and operation. This paper presents some research outcomes in the areas of parallel state estimation using the preconditioned conjugated gradient method, parallel contingency analysis with a dynamic load balancing scheme and distributed system architecture. Based on this research, three types of computational challenges are identified: highly coupled applications, loosely coupled applications, and centralized and distributed applications. Recommendations for future work for power grid applications are also presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Energy Transfer Networks within Upconverting Nanoparticles Are Complex Systems with Collective, Robust, and History-Dependent Dynamics

Applications of photon upconverting nanoparticles (UCNPs) in biological imaging and solar energy conversion demand that their anti-Stokes luminescence be both tunable and efficient. Rational design of more efficient UCNPs requires an understanding of energy transfer (ET) between their lanthanide dopants, dynamics that are typically characterized by measuring luminescence lifetimes. Existing knowledge, however, cannot explain basic observations in lifetime experiments, such as their dependence on excitation power, significantly limiting the generality and reliability of lifetime measurements. Here in this paper, we elucidate the origins of the ET dynamics and luminescence lifetimes of Yb 3+ -, Er 3+ -co-doped NaYF 4 UCNPs using time-resolved luminescence and novel applications of rate equations and stochastic simulations. Experiments and calculations consistently show that at high concentrations of Er 3+ , the luminescence lifetimes of UCNPs decrease as much as six-fold when excitation power densities are increased over 6 orders of magnitude. Since power-dependent lifetimes cannot be explained by intrinsic relaxation rates of individual transitions, we analyze lifetime data by treating each UCNP as a complex ET network. We find that UCNP ET networks exhibit four distinguishing characteristics of complex systems: collectivity, nonlinear feedback, robustness, and history dependence. We conclude that power-dependent lifetimes are the consequence of thousands of minor relaxation pathways that act collectively to depopulate and repopulate Er 3+ emitting levels. These ET pathways are dependent on past excitation power because they originate from excited donors and excited acceptors; however, each transition has an unexpectedly small impact on lifetimes due to negative feedback in the network. This robustness is determined by systematically “knocking out”, or disabling, ET transitions in kinetic models. Our classification of UCNP ET networks as complex systems explains why UCNP luminescence lifetimes do not match the intrinsic lifetimes of emitting states. In the future, UCNP networks may be engineered to rival the complexity of biological networks that pattern features with unmatched precision.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Distributed Framework for Dynamic Telescope and Instrument Control

Traditionally, instrument command and control systems have been developed specifically for a single instrument. Such solutions are frequently expensive and are inflexible to support the next instrument development effort. NASA Goddard Space Flight Center is developing an extensible framework, known as Instrument Remote Control (IRC) that applies to any kind of instrument that can be controlled by a computer. IRC combines the platform independent processing capabilities of Java with the power of the Extensible Markup Language (XML). A key aspect of the architecture is software that is driven by an instrument description, written using the Instrument Markup Language (IML). IML is an XML dialect used to describe graphical user interfaces to control and monitor the instrument, command sets and command formats, data streams, communication mechanisms, and data processing algorithms. The IRC framework provides the ability to communicate to components anywhere on a network using the JXTA protocol for dynamic discovery of distributed components. JXTA (see httD://www.jxta.org,) is a generalized protocol that allows any devices connected by a network to communicate in a peer-to-peer manner. IRC uses JXTA to advertise a device's IML and discover devices of interest on the network. Devices can join or leave the network and thus join or leave the instrument control environment of IRC. Currently, several astronomical instruments are working with the IRC development team to develop custom components for IRC to control their instruments. These instruments include: High resolution Airborne Wideband Camera (HAWC), a first light instrument for the Stratospheric Observatory for Infrared Astronomy (SOFIA); Submillimeter And Far Infrared Experiment (SAFIRE), a Principal Investigator instrument for SOFIA; and Fabry-Perot Interferometer Bolometer Research Experiment (FIBRE), a prototype of the SAFIRE instrument, used at the Caltech Submillimeter Observatory (CSO). Most recently, we have been working with the Submillimetre High Angular Resolution Camera IInd Generation (SHARCII) at the CSO to investigate using IRC capabilities with the SHARC instrument.

Ames, Troy J.↗

Stochastic approximation methods-Powerful tools for simulation and optimization: A survey of some recent work on multi-agent systems and cyber-physical systems

Stochastic approximation methods have found extensive and diversified applications. Recent emergence of networked systems and cyber-physical systems has generated renewed interest in advancing stochastic approximation into a general framework to support algorithm development for information processing and decisions in such systems. This paper presents a survey on some recent developments in stochastic approximation methods and their applications. Using connected vehicles in platoon formation and coordination as a platform, we highlight some traditional and new methodologies of stochastic approximation algorithms and explain how they can be used to capture essential features in networked systems. Distinct features of networked systems with randomly switching topologies, dynamically evolving parameters, and unknown delays are presented, and control strategies are provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data-driven discovery of coordinates and governing equations

The discovery of governing equations from scientific data has the potential to transform data-rich fields that lack well-characterized quantitative descriptions. Advances in sparse regression are currently enabling the tractable identification of both the structure and parameters of a nonlinear dynamical system from data. The resulting models have the fewest terms necessary to describe the dynamics, balancing model complexity with descriptive ability, and thus promoting interpretability and generalizability. This provides an algorithmic approach to Occam’s razor for model discovery. However, this approach fundamentally relies on an effective coordinate system in which the dynamics have a simple representation. In this work, we design a custom deep autoencoder network to discover a coordinate transformation into a reduced space where the dynamics may be sparsely represented. Thus, we simultaneously learn the governing equations and the associated coordinate system. We demonstrate this approach on several example high-dimensional systems with low-dimensional behavior. The resulting modeling framework combines the strengths of deep neural networks for flexible representation and sparse identification of nonlinear dynamics (SINDy) for parsimonious models. This method places the discovery of coordinates and models on an equal footing.

97 MATHEMATICS AND COMPUTING↗

Complex network synchronization of chaotic systems with delay coupling

The study of complex networks enables us to understand the collective behavior of the interconnected elements and provides vast real time applications from biology to laser dynamics. In this paper, synchronization of complex network of chaotic systems has been studied. Every identical node in the complex network is assumed to be in Lur’e system form. In particular, delayed coupling has been assumed along with identical sector bounded nonlinear systems which are interconnected over network topology.

97 MATHEMATICS AND COMPUTING↗

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↗

MetConSIN

Metabolic Context Species Interaction Networks (MetConSIN) generates microbe-metabolte and metabolite-metabolite interaction networks using constraint based metabolic modeling. To do this, MetConSIN simulates with the dynamic FBA system and saves the sequence of interaction networks implied by that system, as well as the time-average network.

Brunner, James↗

Does fluoride disrupt hydrogen bond network in cationic lipid bilayer? Time-dependent fluorescence shift of Laurdan and molecular dynamics simulations

Time-dependent fluorescence shift (TDFS) of Laurdan embedded in phospholipid bilayers reports on hydration and mobility of the phospholipid acylgroups. Exchange of H{sub 2}O with D{sub 2}O prolongs the lifetime of lipid-water and lipid-water-lipid interactions, which is reflected in a significantly slower TDFS kinetics. Combining TDFS measurements in H{sub 2}O and D{sub 2}O hydrated bilayers with atomistic molecular dynamics (MD) simulations provides a unique tool for characterization of the hydrogen bonding at the acylgroup level of lipid bilayers. In this work, we use this approach to study the influence of fluoride anions on the properties of cationic bilayers composed of trimethylammonium-propane (DOTAP). The results obtained for DOTAP are confronted with those for neutral phosphatidylcholine (DOPC) bilayers. Both in DOTAP and DOPC H{sub 2}O/D{sub 2}O exchange prolongs hydrogen-bonding lifetime and does not disturb bilayer structure. These results are confirmed by MD simulations. TDFS experiments show, however, that for DOTAP this effect is cancelled in the presence of fluoride ions. We interpret these results as evidence that strongly hydrated fluoride is able to steal water molecules that bridge lipid carbonyls. Consequently, when attracted to DOTAP bilayer, fluoride disrupts the local hydrogen-bonding network, and the differences in TDFS kinetics between H{sub 2}O and D{sub 2}O hydrated bilayers are no longer observed. A distinct behavior of fluoride is also evidenced by MD simulations, which show different lipid-ion binding for Cl{sup −} and F{sup −}.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Enabling complete multichannel nonadiabatic dynamics: A global representation of the two-channel coupled, 1,2 1 A and 1 3 A states of NH 3 using neural networks

Global coupled three-state two-channel potential energy and property/interaction (dipole and spin–orbit coupling) surfaces for the dissociation of NH 3 (Ã) into NH + H 2 and NH 2 + H are reported. The permutational invariant polynomial-neural network approach is used to simultaneously fit and diabatize the electronic Hamiltonian by fitting the energies, energy gradients, and derivative couplings of the two coupled lowest-lying singlet states as well as fitting the energy and energy gradients of the lowest-lying triplet state. The key issue in fitting property matrix elements in the diabatic basis is that the diabatic surfaces must be smooth, that is, the diabatization must remove spikes in the original adiabatic property surfaces attributable to the switch of electronic wavefunctions at the conical intersection seam. Here, we employ the fit potential energy matrix to transform properties in the adiabatic representation to a quasi-diabatic representation and remove the discontinuity near the conical intersection seam. The property matrix elements can then be fit with smooth neural network functions. The coupled potential energy surfaces along with the dipole and spin–orbit coupling surfaces will enable more accurate and complete treatment of optical transitions, as well as nonadiabatic internal conversion and intersystem crossing.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Effect of penetrant–polymer interactions and shape on the motion of molecular penetrants in dense polymer networks

The diffusion of dilute molecular penetrants within polymers plays a crucial role in the advancement of material engineering for applications such as coatings and membrane separations. The potential of highly cross-linked polymer networks in these applications stems from their capacity to adjust the size and shape selectivity through subtle changes in network structures. In this paper, we use molecular dynamics simulation to understand the role of penetrant shape (aspect ratios) and its interaction with polymer networks on its diffusivity. We characterize both local penetrant hopping and the long-time diffusive motion for penetrants and consider different aspect ratios and penetrant–network interaction strengths at a variety of cross-link densities and temperatures. The shape affects the coupling of penetrant motion to the cross-link density- and temperature-dependent structural relaxation of networks and also affects the way a penetrant experiences the confinement from the network meshes. The attractive interaction between the penetrant and network primarily affects the former since only the system of dilute limit is of present interest. These results offer fundamental insights into the intricate interplay between penetrant characteristics and polymer network properties and also suggest future directions for manipulating polymer design to enhance the separation efficiency.

Chemistry↗

Quantifying socio-economic indicators in developing countries from mobile phone communication data: applications to Côte d’Ivoire

The widespread adoption of mobile devices that record the communications, social relations, and movements of billions of individuals in great detail presents unique opportunities for the study of social structures and human dynamics at very large scales. This is particularly the case for developing countries where social and economic data can be hard to obtain and is often too sparse for real-time analytics. In this paper, we leverage mobile call log data from Côte d’Ivoire to analyze the relations between its nation-wide communications network and the socio-economic dynamics of its regional economies. We introduce the CallRank indicator to quantify the relative importance of an area on the basis of call records, and show that a region’s ratio of in- and out-going calls can predict its income level. We detect a communication divide between rich and poor regions of Côte d’Ivoire, which corresponds to existing socio-economic data. Our results demonstrate the potential of mobile communication data to monitor the economic development and social dynamics of low-income developing countries in the absence of extensive econometric and social data. Finally, our work may support efforts to stimulate sustainable economic development and to reduce poverty and inequality.

97 MATHEMATICS AND COMPUTING↗

Concurrent conversation modeling and parallel simulation of the naming game in social networks

The Naming Game is an effective self-organization model to understand the emergence of linguistic consensus and to investigate the system dynamics in a variety of phenomena over social networks of autonomous agents. The Naming Game is an effective description for the evolution of consensus despite the absence of any central coordination or specialized initialization even in large-scale networks. While the classical game is effective in description, it was defined with inherently sequential evaluation semantics over the entire network. Here, we develop a new concurrent model as a relaxation of the classical formulation and express it in a discrete event style of evaluation. Further, with the uncovered concurrency that was absent in the classical algorithm, we map the concurrent model to parallel discrete event simulation. Using a prototype implementation, we present an initial parallel performance study on networks containing hundreds of thousands of individuals, with a decrease in simulation time in the best-observed case from 4800 seconds down to 1400 seconds.

Perumalla, Kalyan↗

Partial synchronization in networks of non-linearly coupled oscillators: The Deserter Hubs Model

We study the Deserter Hubs Model: a Kuramoto-like model of coupled identical phase oscillators on a network, where attractive and repulsive couplings are balanced dynamically due to nonlinearity of interactions. Under weak force, an oscillator tends to follow the phase of its neighbors, but if an oscillator is compelled to follow its peers by a sufficient large number of cohesive neighbors, then it actually starts to act in the opposite manner, i.e., in anti-phase with the majority. Analytic results yield that if the repulsion parameter is small enough in comparison with the degree of the maximum hub, then the full synchronization state is locally stable. Numerical experiments are performed to explore the model beyond this threshold, where the overall cohesion is lost. We report in detail partially synchronous dynamical regimes, like stationary phase-locking, multistability, periodic and chaotic states. Via statistical analysis of different network organizations like tree, scale-free, and random ones, we found a measure allowing one to predict relative abundance of partially synchronous stationary states in comparison to time-dependent ones.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DGs for Service Restoration to Critical Loads in a Secondary Network

During a major outage in a secondary network distribution system, distributed generators (DGs) connected to the primary feeders as well as the secondary network can be used to serve critical loads. This paper proposed a resilience-oriented method to determine restoration strategies for secondary network distribution systems after a major disaster. Technical issues associated with the restoration process are analyzed, including the operation of network protectors, inrush currents caused by the energization of network transformers, synchronization of DGs to the network, and circulating currents among DGs. A look-ahead load restoration framework is proposed, incorporating technical issues associated with secondary networks, limits on DG capacity and generation resources, dynamic constraints, and operational limits. The entire outage duration is divided into a sequence of periods. Restoration strategies can be adjusted at the beginning of each period using the latest information. Numerical simulation of the modified IEEE 342-node low voltage networked test system is performed to validate the effectiveness of the proposed method.

Xu, Yin (ORCID:0000000209459024)↗

Bridging the Gap Between LLMs and LNS with Dynamic Data Format and Architecture Codesign

Deep neural networks (DNNs) have achieved tremendous success in the past few years. However, their training and inference demand exceptional computational and memory resources. Quantization has been shown as an effective approach to mitigate the cost, with the mainstream data types reduced from FP32 to FP16/BF16 and recently FP8 in the latest NVIDIA H100 GPUs. With increasingly aggressive quantization, however, the conventional floating-point formats suffer from limited precision in representing numbers around zero. Recently, NVIDIA demonstrated the potential of using a Logarithmic Number System (LNS) for the next generation of tensor cores. While LNS mitigates the hurdles in representing small numbers, in this work we observed a mismatch between LNS and the emerging Large Language Models (LLM), where LLM exhibits significant outliers when directly adopting the LNS format. In this paper, we present a data-format/architecture codesign to bright this gap. On the format side, we propose a dynamic LNS format to flexibly represent outliers at a higher precision, by exploiting asymmetry in the LNS representation and identifying outliers through a per-vector basis. On the architecture side, for demonstration, we realize the dynamic LNS format in a systolic array, which can handle the irregularity of the outliers at runtime. We implement our approach on an Alveo U280 FPGA as a prototype. Experimental results show that our design can effectively handle the outliers and resolve the mismatch between LNS and LLM, contributing to an accuracy improvement of 15.4% and 16% over the floating-point and the original LNS baselines, using four state-of-the-art LLM models. Our observation and design lay a solid foundation for the large-scale adoption of the LNS format in the next-generation deep learning hardware.

Haghi, Pouya↗

Towards a Scalable and Adaptive Application Support Platform for Large-Scale Distributed E-Sciences in High-Performance Network Environments

The advent of large-scale collaborative scientific applications has demonstrated the potential for broad scientific communities to pool globally distributed resources to produce unprecedented data acquisition, movement, and analysis. System resources including supercomputers, data repositories, computing facilities, network infrastructures, storage systems, and display devices have been increasingly deployed at national laboratories and academic institutes. These resources are typically shared by large communities of users over Internet or dedicated networks and hence exhibit an inherent dynamic nature in their availability, accessibility, capacity, and stability. Scientific applications using either experimental facilities or computation-based simulations with various physical, chemical, climatic, and biological models feature diverse scientific workflows as simple as linear pipelines or as complex as a directed acyclic graphs, which must be executed and supported over wide-area networks with massively distributed resources. Application users oftentimes need to manually configure their computing tasks over networks in an ad hoc manner, hence significantly limiting the productivity of scientists and constraining the utilization of resources. The success of these large-scale distributed applications requires a highly adaptive and massively scalable workflow platform that provides automated and optimized computing and networking services. This project is to design and develop a generic Scientific Workflow Automation and Management Platform (SWAMP), which contains a web-based user interface specially tailored for a target application, a set of user libraries, and several easy-to-use computing and networking toolkits for application scientists to conveniently assemble, execute, monitor, and control complex computing workflows in heterogeneous high-performance network environments. SWAMP will enable the automation and management of the entire process of scientific workflows with the convenience of a few mouse clicks while hiding the implementation and technical details from end users. Particularly, we will consider two types of applications with distinct performance requirements: data-centric and service-centric applications. For data-centric applications, the main workflow task involves large-volume data generation, catalog, storage, and movement typically from supercomputers or experimental facilities to a team of geographically distributed users; while for service-centric applications, the main focus of workflow is on data archiving, preprocessing, filtering, synthesis, visualization, and other application-specific analysis. We will conduct a comprehensive comparison of existing workflow systems and choose the best suited one with open-source code, a flexible system structure, and a large user base as the starting point for our development. Based on the chosen system, we will develop and integrate new components including a black box design of computing modules, performance monitoring and prediction, and workflow optimization and reconfiguration, which are missing from existing workflow systems. A modular design for separating specification, execution, and monitoring aspects will be adopted to establish a common generic infrastructure suited for a wide spectrum of science applications. We will further design and develop efficient workflow mapping and scheduling algorithms to optimize the workflow performance in terms of minimum end-to-end delay, maximum frame rate, and highest reliability. We will develop and demonstrate the SWAMP system in a local environment, the grid network, and the 100Gpbs Advanced Network Initiative (ANI) testbed. The demonstration will target scientific applications in climate modeling and high energy physics and the functions to be demonstrated include workflow deployment, execution, steering, and reconfiguration. Throughout the project period, we will work closely with the science communities in the fields of climate modeling and high energy physics including Spallation Neutron Source (SNS) and Large Hadron Collider (LHC) projects to mature the system for production use.

97 MATHEMATICS AND COMPUTING↗