Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “NETWORKING”

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

Variational neural network approach to QFT in the field basis

We present a variational neural network approach for solving quantum field theories in the field basis, focusing on the free Klein-Gordon model formulated in momentum space. While recent studies have explored neural-network-based variational methods for scalar field theory in position space, a systematic benchmark of the analytically solvable Klein-Gordon ground state—particularly in the momentum-space field basis—has been lacking. In this work, we represent the ground-state wavefunctional as a neural network defined on a discretized set of field configurations and train it by minimizing the Hamiltonian expectation value. This framework enables direct comparison to exact analytic results for a range of key observables, including the ground-state energy, two-point correlators, expectation value of the field, and the structure of the learned wavefunctional itself. Our results provide quantitative diagnostics of accuracy and establish a validated foundation for extending neural-network wavefunctional methods to interacting field theories and position-space formulations.

Klein-Gordon model↗

Crosslinked Matrimid®-like polyimide membranes with unimodal network structure for enhanced stability and gas separation performance

Gas separation membranes have attracted academic and industrial attention, and crosslinking has been identified to be one of the most effective ways to enhance membrane stability. In this paper, a series of crosslinked Matrimid®-like films with unimodal network structures are prepared via thermally end-linking phenylethnyl-terminated BTDA-DAPI oligomers with well-controlled molecular weight (i.e., 3000–15,000 g/mol), wherein the crosslink density (the inter-crosslink chain length) of resulting unimodal networks is systematically varied by using oligomers with various molecular weight. Comprehensive characterizations of chemical structure, thermal properties, microstructures are performed. Pure-gas permeation measurements are performed focusing on H 2 /CH 4 and CO 2 /CH 4 separations as a function of crosslink density. In sharp contrast to the commonly observed permeability reduction in randomly crosslinked networks, all the crosslinked unimodal films, even when densely crosslinked, present markedly enhanced permeability and well-maintained ideal selectivity relative to the uncrosslinked linear counterpart, leading to almost horizontal movements towards upper bounds along with expectedly enhanced membrane stability. In conclusion, it is concluded that introducing bulky groups at the crosslink sites provide a practical means to counteract the densification effect induced by crosslinking and the construction of unimodal networks exemplifies a fundamentally new strategy to regulate the microstructure and property of crosslinked membranes for gas separations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Baseflow Identification via Explainable AI With Kolmogorov‐Arnold Networks

Abstract Hydrological models often involve constitutive laws that may not be optimal in every application. We propose to replace such laws with the Kolmogorov‐Arnold networks (KANs), a class of neural networks designed to identify symbolic expressions. We demonstrate KAN's potential on the problem of baseflow identification, a notoriously challenging task plagued by significant uncertainty. KAN‐derived functional dependencies of the baseflow components on the aridity index outperform their original counterparts; they demonstrate that water availability, rather than potential evapotranspiration, drives baseflow by constraining actual evapotranspiration under arid conditions. On a test set, they increase the Nash‐Sutcliffe efficiency (NSE) by 65%, decrease the root mean squared error by 29%, and increase the Kling‐Gupta efficiency by 34%. This superior performance is achieved while reducing the number of fitting parameters from three to two. Next, we use data from 378 catchments across the continental United States to refine the water‐balance equation at the mean‐annual scale. The KAN‐derived equations based on the refined water balance outperform both the current aridity index model, with up to a 105% increase in NSE, and the KAN‐derived equations based on the original water balance. While the performance of our model and tree‐based machine learning methods is similar, KANs offer the advantage of simplicity and transparency and require no specific software or computational tools. This case study focuses on the aridity index formulation, but the approach is flexible and transferable to other hydrological processes. Plain Language Summary Equations used in hydrologic model are often suboptimal, resulting in reduced prediction accuracy and efficiency. We implemented Kolmogorov‐Arnold networks (KAN), a machine learning algorithm for deriving symbolic formulations, to estimate groundwater recharge and showed that it outperforms an existing state‐of‐the‐art semi‐empirical formulation. In hydrology, Nash‐Sutcliffe efficiency (NSE), root mean squared error (RMSE), and Kling‐Gupta efficiency (KGE) are commonly used to evaluate model performance. Higher NSE and KGE values indicate better performance, while lower RMSE values are preferable. Our results show that NSE increased by 71%, RMSE decreased by 32%, and KGE improved by 25%. In addition, KAN identifies an optimal functional form and can be used to derive new analytical formulas using the prior knowledge. The KAN‐inspired equation outperformed the original formulation and reduced the fitting parameters. Furthermore, we refined the water‐balance equation at the mean‐annual scale and showed that, based on the new water‐balance equation, KAN can derive new formulations that are superior to the original aridity index formulations (up to 105% increase in NSE) and KAN‐derived equations based on the original water balance. These findings highlight the significant potential of KAN to advance the scientific understanding of a wide range of hydrologic processes. Key Points Kolmogorov‐Arnold networks (KANs) enhance interpretability of machine‐learned hydrological models KAN‐derived symbolic formulations outperform state‐of‐the‐art semi‐empirical aridity indices KAN‐identified functional form yields an analytical index with fewer fitting parameters and improved performance

baseflow↗

Augmented lagrange hopfield network for economic dispatch with multiple fuel options

This paper proposes an augmented Lagrange Hopfield network (ALHN) for solving economic dispatch (ED) problem with multiple fuel options. The proposed ALHN method is a continuous Hopfield neural network with its energy function based on augmented Lagrangian function. The advantages of ALHN over the conventional Hopfield neural network are easier use, more general applications, faster convergence, better optimal solution, and larger scale of problem implementation. The method solves the problem by directly searching the most suitable fuel among the available fuels of each unit and finding the optimal solution for the problem based on minimization of the energy function of the continuous Hopfield neural network. The proposed method is tested on systems up to 100 units and the obtained results are compared to those from other methods in the literature. The results have shown that the proposed method is efficient for solving the ED problem with multiple fuel options and favorable for implementation in large scale problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluating the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks

In this work the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks is evaluated. The first one code based on traditional iterative procedures and called Neutron spectrometry and dosimetry from the Universidad Autonoma de Zacatecas (NSDUAZ) use the SPUNIT iterative algorithm and was designed to unfold neutron spectrum and calculate 15 dosimetric quantities and 7 IAEA survey meters. The main feature of this code is the automated selection of the initial guess spectrum trough a compendium of neutron spectrum compiled by the IAEA. The second one code known as Neutron spectrometry and dosimetry with artificial neural networks (NDSann) is a code designed using neural nets technology. The artificial intelligence approach of neural net does not solve mathematical equations. By using the knowledge stored at synaptic weights on a neural net properly trained, the code is capable to unfold neutron spectrum and to simultaneously calculate 15 dosimetric quantities, needing as entrance data, only the rate counts measured with a Bonner spheres system. Similarities of both NSDUAZ and NSDann codes are: they follow the same easy and intuitive user's philosophy and were designed in a graphical interface under the LabVIEW programming environment. Both codes unfold the neutron spectrum expressed in 60 energy bins, calculate 15 dosimetric quantities and generate a full report in HTML format. Differences of these codes are: NSDUAZ code was designed using classical iterative approaches and needs an initial guess spectrum in order to initiate the iterative procedure. In NSDUAZ, a programming routine was designed to calculate 7 IAEA instrument survey meters using the fluence-dose conversion coefficients. NSDann code use artificial neural networks for solving the ill-conditioned equation system of neutron spectrometry problem through synaptic weights of a properly trained neural network. Contrary to iterative procedures, in neural net approach it is possible to reduce the rate counts used to unfold the neutron spectrum. To evaluate these codes a computer tool called Neutron Spectrometry and dosimetry computer tool was designed. The results obtained with this package are showed. The codes here mentioned are freely available upon request to the authors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Conductance with stochastic resonance in Mn{sub 12} redox network without tuning

Artificial neuron-based information processing is one of the attractive approaches of molecular-scale electronics, which can exploit the ability of molecular system for self-assembling or self-organization. The self-organized Mn{sub 12}/DNA redox network shows nonlinear current-voltage characteristics that can be described by the Coulomb blockade network model. As a demonstration of the nonlinear network system, we have observed stochastic resonance without tuning for weak periodic input signals and thermal noise, which suggests a route to neural network composed of molecular materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Satisfiability of logic programming based on radial basis function neural networks

In this paper, we propose a new technique to test the Satisfiability of propositional logic programming and quantified Boolean formula problem in radial basis function neural networks. For this purpose, we built radial basis function neural networks to represent the proportional logic which has exactly three variables in each clause. We used the Prey-predator algorithm to calculate the output weights of the neural networks, while the K-means clustering algorithm is used to determine the hidden parameters (the centers and the widths). Mean of the sum squared error function is used to measure the activity of the two algorithms. We applied the developed technique with the recurrent radial basis function neural networks to represent the quantified Boolean formulas. The new technique can be applied to solve many applications such as electronic circuits and NP-complete problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

QuTree: A tree tensor network package

Here we present QuTree, a C++ library for tree tensor network approaches. QuTree provides class structures for tensors, tensor trees, and related linear algebra functions that facilitate the fast development of tree tensor network approaches such as the multilayer multiconfigurational time-dependent Hartree approach or the density matrix renormalization group approach and its various extensions. We investigate the efficiency of relevant tensor and tensor network operations and show that the overhead for managing the network structure is negligible, even in cases with a million leaves and small tensors. QuTree focuses on providing simple, high-level routines while retaining easy access to the backend to facilitate novel developments. We demonstrate the capabilities of the package by computing the eigenstates of coupled harmonic oscillator Hamiltonians and performing random circuit simulations on a virtual quantum computer.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fibre optical measuring network based on quasi-distributed amplitude sensors for detecting deformation loads

A new design of a sensitive element for a fibre optical sensor of deformation loads is proposed. A distributed fibre optical measuring network, aimed at determining both the load application point and the load mass, has been developed based on these elements. It is shown that neural network methods of data processing make it possible to combine quasi-distributed amplitude sensors of different types into a unified network. The results of the experimental study of a breadboard of a fibre optical measuring network are reported, which demonstrate successful reconstruction of the trajectory of a moving object (load) with a spatial resolution of 8 cm, as well as the load mass in the range of 1 - 10 kg with a sensitivity of 0.043 kg{sup -1}. (laser optics 2012)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stability-driven nonnegative matrix factorization to interpret spatial gene expression and build local gene networks

Spatial gene expression patterns enable the detection of local covariability and are extremely useful for identifying local gene interactions during normal development. The abundance of spatial expression data in recent years has led to the modeling and analysis of regulatory networks. The inherent complexity of such data makes it a challenge to extract biological information. We developed staNMF, a method that combines a scalable implementation of nonnegative matrix factorization (NMF) with a new stability-driven model selection criterion. When applied to a set of Drosophila early embryonic spatial gene expression images, one of the largest datasets of its kind, staNMF identified 21 principal patterns (PP). Providing a compact yet biologically interpretable representation of Drosophila expression patterns, PP are comparable to a fate map generated experimentally by laser ablation and show exceptional promise as a data-driven alternative to manual annotations. Our analysis mapped genes to cell-fate programs and assigned putative biological roles to uncharacterized genes. Finally, we used the PP to generate local transcription factor regulatory networks. Spatially local correlation networks were constructed for six PP that span along the embryonic anterior-posterior axis. Using a two-tail 5% cutoff on correlation, we reproduced 10 of the 11 links in the well-studied gap gene network. In conclusion, the performance of PP with the Drosophila data suggests that staNMF provides informative decompositions and constitutes a useful computational lens through which to extract biological insight from complex and often noisy gene expression data.

59 BASIC BIOLOGICAL SCIENCES↗

Criticality analysis of nuclear binding energy neural networks

Machine learning methods, in particular deep learning methods such as artificial neural networks (ANNs) with many layers, have become widespread and useful tools in nuclear physics. However, these ANNs are typically treated as ‘black boxes’, with their architecture (width, depth, and weight/bias initialization) and the training algorithm and parameters chosen empirically by optimizing learning based on limited exploration. We test a non-empirical approach to understanding and optimizing nuclear physics ANNs by adapting a criticality analysis based on renormalization group flows in terms of the hyperparameters for weight/bias initialization, training rates, and the ratio of depth to width. This treatment utilizes the statistical properties of neural network initialization to find a generating functional for network outputs at any layer, allowing for a path integral formulation of the ANN outputs as a Euclidean statistical field theory. We use a prototypical example to test the applicability of this approach: a simple ANN for nuclear binding energies. We find that with training using a stochastic gradient descent optimizer, the predicted criticality behavior is realized, and optimal performance is found with critical tuning. However, the use of an adaptive learning algorithm leads to somewhat superior results without concern for tuning and thus obscures the analysis. Nevertheless, the criticality analysis offers a way to look within the black box of ANNs, which is a first step towards potential improvements in network performance beyond using adaptive optimizers.

artificial neural network↗

Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming

Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Results: Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs.

59 BASIC BIOLOGICAL SCIENCES↗

Simultaneous global and local clustering in multiplex networks with covariate information

Understanding both global and layer-specific group structures is useful for uncovering complex patterns in networks with multiple interaction types. In this work, we introduce a new model, the hierarchical multiplex stochastic blockmodel, which simultaneously detects communities within individual layers of a multiplex network while inferring a global node clustering across the layers. A stochastic blockmodel is assumed in each layer, with probabilities of layer-level group memberships determined by a node’s global group assignment. Our model uses a Bayesian framework, employing a probit stick-breaking process to construct node-specific mixing proportions over a set of shared Griffiths–Engen–McCloseky distributions. These proportions determine layer-level community assignment, allowing for an unknown and varying number of groups across layers, while incorporating nodal covariate information to inform the global clustering. We propose a scalable variational inference procedure with parallelisable updates for application to large networks. Extensive simulation studies demonstrate our model’s ability to accurately recover both global and layer-level clusters in complicated settings, and applications to real data showcase the model’s effectiveness in uncovering interesting latent network structure.

community detection↗

Deforestation impacts network co-occurrence patterns of microbial communities in Amazon soils

Co-occurrence networks allow for the identification of potential associations among species, which may be important for understanding community assembly and ecosystem functions. We employed this strategy to examine prokaryotic co-occurrence patterns in the Amazon soils and the response of these patterns to land use change to pasture, with the hypothesis that altered microbial composition due to deforestation will mirror the co-occurrence patterns across prokaryotic taxa. In this study, we calculated Spearman correlations between operational taxonomic units (OTUs) as determined by 16S rRNA gene sequencing, and only robust correlations were considered for network construction (-0.80 ≥ ρ ≥ 0.80, adjusted P <0.01). The constructed network represents distinct forest and pasture components, with altered compositional and topological features. A comparative analysis between two representative modules of these contrasting ecosystems revealed novel information regarding changes to metabolic pathways related to nitrogen cycling. Our results showed that soil physicochemical properties such as temperature, C/N and H + +Al 3+ had a significant impact on prokaryotic communities, with alterations to network topologies. Taken together, changes in co-occurrence patterns and physicochemical properties may contribute to ecosystem processes including nitrification and denitrification, two important biogeochemical processes occurring in tropical forest systems.

54 ENVIRONMENTAL SCIENCES↗

Sample-Efficient Adaptive Calibration of Quantum Networks Using Bayesian Optimization

All physical systems employed for quantum information tasks must act as unbiased carriers of encoded quantum states. Ensuring such indistinguishability of information carriers is a major challenge in many quantum information applications, including advanced quantum communication protocols. For photons, the workhorses of quantum communication networks, it is difficult to obtain and maintain their indistinguishability because of environment-induced transformations and loss imparted by communication channels, especially in noisy scenarios. Conventional strategies to mitigate these transformations often require hardware or software overhead that is restrictive (e.g., adding noise), infeasible (e.g., on a satellite), or time-consuming for deployed networks. In this work we propose and develop resource-efficient Bayesian optimization techniques to rapidly and adaptively calibrate the indistinguishability of individual photons for quantum networks using only information derived from their measurement. To experimentally validate our approach, we demonstrate the optimization of Hong-Ou-Mandel interference between two photons-a central task in quantum networking- finding rapid, efficient, and reliable convergence towards maximal photon indistinguishability in the presence of high loss and shot noise. We expect our resource-optimized and experimentally friendly methodology will allow fast and reliable calibration of indistinguishable quanta, a necessary task in distributed quantum computing, communications, and sensing, as well as for fundamental investigations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement phase transitions in random stabilizer tensor networks

Here we explore a class of random tensor network models with “stabilizer” local tensors which we name random stabilizer tensor networks (RSTNs). For RSTNs defined on a two-dimensional square lattice, we perform extensive numerical studies of entanglement phase transitions between volume-law and area-law entangled phases of the one-dimensional boundary states. These transitions occur when either (a) the bond dimension D of the constituent tensors is varied or (b) the tensor network is subject to random breaking of bulk bonds, implemented by forced measurements. In the absence of broken bonds, we find that the RSTN supports a volume-law entangled boundary state with bond dimension D ≥ 3 where D is a prime number, and an area-law entangled boundary state for D = 2. Upon breaking bonds at random in the bulk with probability p, there exists a critical measurement rate p c for each D ≥ 3 above which the boundary state becomes area-law entangled. To explore the conformal invariance at these entanglement transitions for different prime D, we consider tensor networks on a finite rectangular geometry with a variety of boundary conditions, and extract universal operator scaling dimensions via extensive numerical calculations of the entanglement entropy, mutual information, and mutual negativity at their respective critical points. Our results at large D approach known universal data of percolation conformal field theory, while showing clear discrepancies at smaller D, suggesting a distinct entanglement transition universality class for each prime D. We further study universal entanglement properties in the volume-law phase and demonstrate quantitative agreement with the recently proposed description in terms of a directed polymer in a random environment.

36 MATERIALS SCIENCE↗

Real-time evolution of Anderson impurity models via tensor network influence functionals

In this work, we present and analyze two tensor network-based influence functional approaches for simulating the real-time dynamics of quantum impurity models such as the Anderson model. Via comparison with recent numerically exact simulations, we show that such methods accurately capture the long-time nonequilibrium quench dynamics. The two parameters that must be controlled in these tensor network influence functional approaches are a time discretization (Trotter) error and a bond dimension (tensor network truncation) error. We show that the actual numerical uncertainties are controlled by an intricate interplay of these two approximations, which we demonstrate in different regimes. Our work opens the door to using these tensor network influence functional methods as general impurity solvers.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Data-driven analysis of dipole strength functions using artificial neural networks

Here, we present a data-driven analysis of dipole strength functions across the nuclear chart, employing an artificial neural network to model nuclear dipole responses. We train the network on a dataset of experimentally measured dipole strength functions for 216 different nuclei. To assess its predictive capability, we test the trained model on an additional set of 10 new nuclei, where experimental data exist. We demonstrate that the artificial neural network not only accurately reproduces known data but also identifies potential inconsistencies in experimental datasets, indicating which results may warrant further review or possible rejection. For nuclei where experimental data are sparse or unavailable, the network confirms theoretical calculations, reinforcing its utility as a predictive tool in nuclear physics. Finally, utilizing the predicted electric dipole polarizability, we extract the value of the symmetry energy at saturation density and find it consistent with results from the literature.

artificial neural networks↗