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,477 records · Page 82

Social-ecological network analysis for sustainability sciences: a systematic review and innovative research agenda for the future

Social-ecological network (SEN) concepts and tools are increasingly used in human-environment and sustainability sciences. We take stock of this budding research area to further show the strength of SEN analysis for complex human-environment settings, identify future synergies between SEN and wider human-environment research, and provide guidance about when to use different kinds of SEN approaches and models. We characterize SEN research along a spectrum specifying the degree of explicit network representation of system components and dynamics. We then systematically review one end of this spectrum, what we term ‘fully articulated SEN’ studies, which specifically model unique social and ecological units and relationships. Results show a larger number of papers focus on methodological advancement and applied ends. While there has been some development and testing of theories, this remains an area for future work and would help develop SENs as a unique field of research, not just a method. Authors have studied diverse systems, while mainly focusing on the problem of social-ecological fit alongside a scattering of other topics. There is strong potential, however, to engage other issues central to human-environment studies. Analyzing the simultaneous effects of multiple social, environmental, and coupled processes, change over time, and linking network structures to outcomes are also areas for future advancement. This review provides a comprehensive assessment of (fully articulated) SEN research, a necessary step that can help scholars develop comparable cases and fill research gaps.

environmental governance↗

High Energy Physics Network Requirements Review: Final Report, July 2024–December 2024

The world-class research infrastructure at the US Department of Energy (DOE) Office of Science (SC) provides the research community with premier observational, experimental, computational, and network capabilities. Each user facility is designed to provide unique capabilities to advance the core DOE mission in science and technology for its SC program to stimulate rich scientific discoveries and enhance its innovation ecosystem. Research communities gather and flourish around each user facility, bringing together new and enhanced perspectives. The continual reinvention of the practice of science — as users and staff forge novel approaches expressed in research workflows — unlocks new discoveries and propels scientific progress. Within this research ecosystem, the high-performance computing (HPC) and networking user facilities stewarded by the SC’s Advanced Scientific Computing Research (ASCR) program play a dynamic cross-cutting role, enabling complex workflows demanding high-performance data, networking, and computing solutions. The ASCR facilities enterprise seeks to understand and meet the needs and requirements across SC and DOE domain science programs and priority efforts, highlighted by the formal requirements review methodology. Between July and December 2024, the Energy Sciences Network (ESnet) and the Office of High Energy Physics (HEP) of the DOE-SC organized an ESnet requirements review of HEP-supported program activities. Preparation for these events included identification of key stakeholders: program and facility management, research groups, and technology providers. Each stakeholder group was asked to prepare formal case study documents about its relationship to the HEP program to build a complete understanding of the current, near-term, and long-term status, expectations, and processes that will support the science going forward.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Switched electrical networks and bilinear equations

State equations arising in the description of power processing systems are described. The role played by Lie groups and Lie algebras in characterizing the inherent dynamical features of these systems is outlined, and network examples are presented for illustration.

Wood, J. R.↗

Fluid System Stability Analysis Techniques

Fluid systems, or networks, consist of multiple components that work together to achieve some desired thermofluid state. For any generic application, this fluid state can be a combination of the fluid pressure, flow rate, enthalpy, or species concentration. Fluid system components, such as pumps and valves, are often governed by nonlinear differential equations, resulting in complex component-to-component interactions. System-level fluid network stability occurs when the flow through the system can maintain a steady-state solution in the presence of small perturbations, which depends on these component interactions. System instability, however, can go undetected until issues arise during integrated system testing. This presentation explores a method for system designers to think of the fluid network as an assembly of components, each with their own thermofluid surfaces of partial stability, called nullclines. The intersections of all nullclines yields system-level solutions, called equilibrium points. When designers define operating points, they are tuning system parameters so that these equilibrium points move to the desired location in the thermofluid state plane. However, linearization theory shows us that the dynamic behavior around these points can be unstable. The local stability of these equilibrium points can be assessed analytically with eigen-analysis, or numerically by propagating state-plane samples to construct a phase portrait. Investigating a phase portrait can help designers gain a qualitative understanding of a system’s dynamic performance. This understanding can then help inform requirement definitions, component selection, and operational procedures. This presentation includes an example of the phase portrait technique on a system featuring a centrifugal pump and a back-pressure regulator (BPR). Numerical modeling of this system suggests that equilibrium points on the left-hand side of the pump curve are dynamically unstable.

Fluid System↗

SIDDA: SInkhorn Dynamic Domain Adaptation for Image Classification

SInkhorn Dynamic Domain Adaptation (SIDDA) supplements the experiments presented in 2501.14048, SIDDA: SInkhorn Dynamic Domain Adaptation for Image Classification with Equivariant Neural Networks. SIDDA introduces a semi-supervised, automatic domain adaptation method that leverages Sinkhorn divergences to dynamically adjust the regularization in the optimal transport plan and the weighting between classification and domain adaptation loss terms during training.

Pandya, Sneh [Fermi National Accelerator Laborator↗

Evolution of Robustness in Growing Random Networks

Networks are widely used to model the interaction between individual dynamic systems. In many instances, the total number of units and interaction coupling are not fixed in time, and instead constantly evolve. In networks, this means that the number of nodes and edges both change over time. Various properties of coupled dynamic systems, such as their robustness against noise, essentially depend on the structure of the interaction network. Therefore, it is of considerable interest to predict how these properties are affected when the network grows as well as their relationship to the growth mechanism. Here, we focus on the time evolution of a network’s Kirchhoff index. We derive closed-form expressions for its variation in various scenarios, including the addition of both edges and nodes. For the latter case, we investigate the evolution where single nodes with one or two edges connecting to existing nodes are added recursively to a network. In both cases, we derive the relations between the properties of the nodes to which the new node connects along with the global evolution of network robustness. In particular, we show how different scalings of the Kirchhoff index can be obtained as a function of the number of nodes. We illustrate and confirm this theory via numerical simulations of randomly growing networks.

97 MATHEMATICS AND COMPUTING↗

Causally‐Informed Deep Learning to Improve Climate Models and Projections

Abstract Climate models are essential to understand and project climate change, yet long‐standing biases and uncertainties in their projections remain. This is largely associated with the representation of subgrid‐scale processes, particularly clouds and convection. Deep learning can learn these subgrid‐scale processes from computationally expensive storm‐resolving models while retaining many features at a fraction of computational cost. Yet, climate simulations with embedded neural network parameterizations are still challenging and highly depend on the deep learning solution. This is likely associated with spurious non‐physical correlations learned by the neural networks due to the complexity of the physical dynamical system. Here, we show that the combination of causality with deep learning helps removing spurious correlations and optimizing the neural network algorithm. To resolve this, we apply a causal discovery method to unveil causal drivers in the set of input predictors of atmospheric subgrid‐scale processes of a superparameterized climate model in which deep convection is explicitly resolved. The resulting causally‐informed neural networks are coupled to the climate model, hence, replacing the superparameterization and radiation scheme. We show that the climate simulations with causally‐informed neural network parameterizations retain many convection‐related properties and accurately generate the climate of the original high‐resolution climate model, while retaining similar generalization capabilities to unseen climates compared to the non‐causal approach. The combination of causal discovery and deep learning is a new and promising approach that leads to stable and more trustworthy climate simulations and paves the way toward more physically‐based causal deep learning approaches also in other scientific disciplines.

Meteorology & Atmospheric Sciences↗

Robust Online Sequential RVFLNs for Data Modeling of Dynamic Time-Varying Systems with Application of an Ironmaking Blast Furnace

In a world where the increasing complexity of modern industrial processes brings difficulties for accurate mathematical modeling, taking advantage of data has become an efficient solution to complex dynamic process modeling issue. In this paper, we develop a novel robust online sequential version of random vector functional-link networks (RVFLNs) for data-driven modeling of dynamic time-varying system and applied it in a blast furnace (BF) ironmaking process. First, to overcome the time-varying dynamics of process and to enable the RVFLNs to learn online with avoiding data saturation, an improved online sequential version of RVFLNs (OS-RFVLNs) is first presented by online sequential learning with forgetting factor. This improved OS-RVFLNs algorithm is not only suitable for the real-time and large data transfer situation, but also can adjust the sensitivity of the algorithm to different samples with the help of the introduced forgetting factor. Second, since the output weights of the improved OS-RVFLNs as well as other RVFLNs algorithms are obtained by the least squares approach, a robustness problem may occur when the training dataset is contaminated with various outliers. To solve this problem, a Cauchy distribution weighted M-estimator is introduced to improve the robustness of the improved OS- RVFLNs. For this proposed robust OS-RVFLNs (R-OS- RVFLNs), since the weights of different outlier data are properly determined by the Cauchy distribution function, their corresponding contribution on modeling can be properly distinguished. Thus robust and better modeling results can be achieved. Experiments using actual industrial data of BF ironmaking process and comparative studies have demonstrated that the proposed method produces a better estimation accuracy and stronger robustness than other methods.

Blast furnace (BF), Modelling, Dynamic systems↗

Neural Network Approaches for Mobile Spectroscopic Gamma-Ray Source Detection

Artificial neural networks (ANNs) for performing spectroscopic gamma-ray source identification have been previously introduced, primarily for applications in controlled laboratory settings. To understand the utility of these methods in scenarios and environments more relevant to nuclear safety and security, this work examines the use of ANNs for mobile detection, which involves highly variable gamma-ray background, low signal-to-noise ratio measurements, and low false alarm rates. Simulated data from a 2” × 4” × 16” NaI(Tl) detector are used in this work for demonstrating these concepts, and the minimum detectable activity (MDA) is used as a performance metric in assessing model performance.In addition to examining simultaneous detection and identification, binary spectral anomaly detection using autoencoders is introduced in this work, and benchmarked using detection methods based on Non-negative Matrix Factorization (NMF) and Principal Component Analysis (PCA). On average, the autoencoder provides a 12% and 23% improvement over NMF- and PCA-based detection methods, respectively. Additionally, source identification using ANNs is extended to leverage temporal dynamics by means of recurrent neural networks, and these time-dependent models outperform their time-independent counterparts by 17% for the analysis examined here. The paper concludes with a discussion on tradeoffs between the ANN-based approaches and the benchmark methods examined here.

Bilton, Kyle J. (ORCID:0000000184553689)↗

SYP73 Is a Novel Membrane‐Associated Actin‐Binding Protein that Anchors the ER to the Actin Cytoskeleton in Arabidopsis

The endoplasmic reticulum (ER) is an essential organelle that spreads throughout the cytoplasm and undergoes extensive remodeling. In plants, the remodeling and motility of the ER rely mainly on actin and to a minor extent on microtubules. Although the actomyosin system has been suggested functional for ER streaming in plant cells, the mechanisms underlying stable interaction of the ER membrane with actin are unknown. We demonstrate that SYP73, a member of the plant Syp7 subgroup of SNARE proteins is a novel ER membrane‐associated actin‐binding protein. We show that overexpression of SYP73 causes a striking rearrangement of the ER over actin and that loss of SYP73 reduces ER streaming and affects overall ER network morphology and plant growth. A potential mechanism that regulates SYP73 functions has been investigated. Although conserved domain prediction tools did not detect any actin‐binding domain in SYP73, we identified a fragment that is mainly responsible for SYP73 actin binding. Furthermore, the role of SYP73 in regulating actin reorganization has also been examined. We propose a model for plant ER remodeling whereby the dynamic rearrangement and streaming of the ER network depend on the propelling action of myosin‐XI over actin coupled with a SYP73‐mediated bridging, which dynamically anchors the ER membrane with actin filaments. Support or Funding Information This work is support by the Chemical Sciences, Geosciences and Biosciences Division, Office of Basic Energy Sciences, Office of Science, US Department of Energy, the National Science Foundation, and MSU AgBioResearch. This abstract is from the Experimental Biology 2018 Meeting. There is no full text article associated with this abstract published in The FASEB Journal .

Cao, Pengfei↗

XNsim: Internet-Enabled Collaborative Distributed Simulation via an Extensible Network

In this paper, the XNsim approach to achieve Internet-enabled, dynamically scalable collaborative distributed simulation capabilities is presented. With this approach, a complete simulation can be assembled from shared component subsystems written in different formats, that run on different computing platforms, with different sampling rates, in different geographic locations, and over singlelmultiple networks. The subsystems interact securely with each other via the Internet. Furthermore, the simulation topology can be dynamically modified. The distributed simulation uses a combination of hub-and-spoke and peer-topeer network topology. A proof-of-concept demonstrator is also presented. The XNsim demonstrator can be accessed at http://www.jsc.draver.corn/xn that hosts various examples of Internet enabled simulations.

Novotny, John↗

Evaluation of convergence behavior of metamodeling techniques for bridging scales in multi-scale multimaterial simulation

The effectiveness of several metamodeling techniques, viz. the Polynomial Stochastic Collocation method, Adaptive Stochastic Collocation method, a Radial Basis Function Neural Network, a Kriging Method and a Dynamic Kriging Method is evaluated. This is done with the express purpose of using metamodels to bridge scales between micro- and macro-scale models in a multi-scale multimaterial simulation. The rate of convergence of the error when used to reconstruct hypersurfaces of known functions is studied. For sufficiently large number of training points, Stochastic Collocation methods generally converge faster than the other metamodeling techniques, while the DKG method converges faster when the number of input points is less than 100 in a two-dimensional parameter space. Because the input points correspond to computationally expensive micro/meso-scale computations, the DKG is favored for bridging scales in a multi-scale solver.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Conceptual Framework to Enable Early Warning of Relevant Phenomena (Emerging Phenomena and Big Data)

Graphs are commonly used to represent natural and man-made dynamic systems such as food webs, economic and social networks, gene regulation, and the internet. We describe a conceptual framework to enable early warning of relevant phenomena that is based on an artificial time-based, evolving network graph that can give rise to one or more recognizable structures. We propose to quantify the dynamics using the method of delays through Takens Theorem to produce another graph we call the Phase Graph. The Phase Graph enables us to quantify changes of the system that form a topology in phase space. Our proposed method is unique because it is based on dynamic system analysis that incorporates Takens Theorem, Graph Theory, and Franzosi-Pettini (F-P) theorem about topology and phase transitions. The F-P Theorem states that the necessary condition for phase transition is a change in the topology. By detecting a change in the topology that we represent as a set of M-order Phase Graphs, we conclude a corresponding change in the phase of the system. The onset of this phase change enables early warning of emerging relevant phenomena.

complexity↗

Situating Green Infrastructure in Context: A Framework for Adaptive Socio‐Hydrology in Cities

Abstract Management of urban hydrologic processes using green infrastructure (GI) has largely focused on storm water management. Thus, design and implementation of GI usually rely on physical site characteristics and local rainfall patterns, and do not typically account for human or social dimensions. This traditional approach leads to highly centralized storm water management in a disconnected urban landscape and can deemphasize additional benefits that GI offers, such as increased property value, greenspace aesthetics, heat island amelioration, carbon sequestration, and habitat for biodiversity. We propose the Framework for Adaptive Socio‐Hydrology (FrASH) in which GI planning and implementation moves from a purely hydrology‐driven perspective to an integrated sociohydrological approach. This allows for an iterative, multifaceted decision‐making process that would enable a network of stakeholders to collaboratively set a dynamic, context‐guided project plan for the installation of GI, rather than a “one‐size‐fits‐all” installation. We explain how different sectors (e.g., governance, nongovernmental organizations, communities, academia, and industry) can create a connected network of organizations that work toward a common goal. Through a graphical Chambered Nautilus model, FrASH is experimentally applied to contrasting GI case studies and shows that this multistakeholder, connected, decentralized network with a coevolving decision‐making project plan results in enhanced multifunctionality, potentially allowing for the management of resilience in urban systems at multiple scales.

Schifman, L. A.↗

r -process nucleosynthesis from matter ejected in binary neutron star mergers [On r -process nucleosynthesis from matter ejected in binary neutron star mergers]

Here, when binary systems of neutron stars merge, a very small fraction of their rest mass is ejected, either dynamically or secularly. This material is neutron-rich and its nucleosynthesis provides the astrophysical site for the production of heavy elements in the Universe, together with a kilonova signal confirming neutron-star mergers as the origin of short gamma-ray bursts. We perform full general-relativistic simulations of binary neutron-star mergers employing three different nuclear-physics equations of state (EOSs), considering both equal- and unequal-mass configurations, and adopting a leakage scheme to account for neutrino radiative losses. Using a combination of techniques, we carry out an extensive and systematic study of the hydrodynamical, thermodynamical, and geometrical properties of the matter ejected dynamically, employing the WinNet nuclear-reaction network to recover the relative abundances of heavy elements produced by each configurations. Among the results obtained, three are particularly important. First, we find that, within the sample considered here, both the properties of the dynamical ejecta and the nucleosynthesis yields are robust against variations of the EOS and masses. Second, using a conservative but robust criterion for unbound matter, we find that the amount of ejected mass is ≲10 –3 M⊙, hence at least one order of magnitude smaller than what normally assumed in modelling kilonova signals. Finally, using a simplified and gray-opacity model we assess the observability of the infrared kilonova emission finding, that for all binaries the luminosity peaks around ~1/2 day in the H-band, reaching a maximum magnitude of –13, and decreasing rapidly after one day.

79 ASTRONOMY AND ASTROPHYSICS↗

Generic, Sparse Tensor Core for Neural Networks

Sparse neural network attracts more attention for model compression, fast execution, and power reduction. The state-of-the-art designed sparse tensor core for structured and static sparsity, which did not support well for generic or dynamic sparsity. We design a sparse tensor core to support generic sparsity pruning with a novel hybrid and blocked sparse matrix storage format, HB-ELL, which saves computation and storage while keeping the most significant elements, as well as supporting dynamic sparsity for data flow in neural networks. We achieve better performance with preliminary results than the state-of- the-art on an NVIDIA GPU simulator.

Wu, Xiaolong↗

Simulating the Impact of Dynamic Rerouting on Metropolitan-scale Traffic Systems

The rapid introduction of mobile navigation aides that use real-time road network information to suggest alternate routes to drivers is making it more difficult for researchers and government transportation agencies to understand and predict the dynamics of congested transportation systems. Computer simulation is a key capability for these organizations to analyze hypothetical scenarios; however, the complexity of transportation systems makes it challenging for them to simulate very large geographical regions, such as multi-city metropolitan areas. In this article, we describe enhancements to the Mobiliti parallel traffic simulator to model dynamic rerouting behavior with the addition of vehicle controller actors and vehicle-to-controller reroute requests. The simulator is designed to support distributed-memory parallel execution using discrete event simulation and be scalable on high-performance computing platforms. We demonstrate the potential of the simulator by analyzing the impact of varying the population penetration rate of dynamic rerouting on the San Francisco Bay Area road network. Using high-performance parallel computing, we can simulate a day in the San Francisco Bay Area with 19 million vehicle trips with 50 percent dynamic rerouting penetration over a road network with 0.5 million nodes and 1 million links in less than three minutes. We present a sensitivity study on the dynamic rerouting parameters, discuss the simulator’s parallel scalability, and analyze system-level impacts of changing the dynamic rerouting penetration. Furthermore, we examine the varying effects on different functional classes and geographical regions and present a validation of the simulation results compared to real-world data.

97 MATHEMATICS AND COMPUTING↗

Accurate Consensus-based Distributed Averaging with Variable Time Delay in Support of Distributed Secondary Control Algorithms

We report that distributed secondary control has been widely used in hierarchical control structures, where multiple distributed generators (DGs) need to coordinate to regulate system voltage and frequency. In these systems, consensus algorithms determine the average of a group of dynamic states (e.g. voltages measured by a group of DGs). To be useful, consensus algorithms must be computationally efficient, stable and accurate. In practice, numerous practical implementation challenges significantly affect the consensus equilibrium. In this paper, we quantify the accuracy deviations of the distributed average observer algorithms proposed in the literature to demonstrate the problems with the state-of-the-art distributed averaging techniques. A novel approach is proposed that achieves accurate average tracking in the presence of time-varying communication delays among agents. In our implementation, time synchronization of all distributed controllers is enabled by a novel software platform, called Resilient Information Architecture Platform for the Smart Grid (RIAPS). The proposed distributed average observer is implemented on hardware controllers and its effectiveness is validated in a controller hardware-in-the-loop testbed.

24 POWER TRANSMISSION AND DISTRIBUTION↗