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,765 records · Page 98

Impacts of the Conductive Networks on Solid‐State Battery Operation

The micromorphology of composite cathodes is known to play a vital role in determining all-solid-state battery (ASSB) performance. However, much of our current understanding is derived from empirical observations, lacking a deeper mechanistic foundation. The “rocking chair” concept of battery chemistry requires maintaining charge neutrality, emphasizing the necessity of examining electrode micromorphology from the perspective of conductive networks. This study systematically investigates the microscopic electrochemical impacts of conductive network micromorphology by varying the Li + -to-e − channel ratio in cathodes comprising LiNbO 3 -coated LiNi 0.8 Co 0.1 Mn 0.1 O 2 , Li 6 PS 5 Cl, and carbon fibers. Utilizing multiscale synchrotron-based spectro-microscopy, we unravel that unbalanced Li + and e − conducting channels intensify charge polarization within active cathode particles and accelerate their degradation. A further model system with X-ray nano-tomography resolved e − and Li + channels indicates that spatially uniform and well-paired Li + and e − conducting channels are highly desirable as they could promote more uniform lithiation/delithiation, mitigating microscopic electrochemical polarization. Electrode-scale X-ray holotomography analysis reveals that the impact of conductive networks is particle-size-dependent, with smaller cathode particles being more significantly affected. These findings provide mechanistic insights into the interplay between conductive networks and all-solid-state battery operation, laying the groundwork for rational design and optimization of cathode architectures in future solid-state battery technologies.

36 MATERIALS SCIENCE↗

Statistical methods for network surveillance

The term network surveillance is defined in general terms and illustrated with many examples. Statistical methodologies that can be used as tools for network surveillance are discussed. Details for 3 illustrative examples that address network security, surveillance for data network failures, and surveillance of email traffic flows are presented. Some open areas of research are identified.

Jeske, Daniel R.↗

A Parallel Computing Framework for Finding the Supported Solutions to a Biobjective Network Optimization Problem

Abstract Solving multi‐objective combinatorial optimization problems can quickly become computationally challenging when applied to large networks generated from big data. Present‐day first‐rate Mixed Integer Programming (MIP) solvers have parallelism built‐in to take advantage of multicore architectures; but specialized network optimization algorithms that can often solve graph problems more efficiently than a general MIP solver are typically programmed serially. Thus, these network algorithm implementations do not take full advantage of modern multicore computer capabilities. Many parallel computing languages include a fork/join framework into their concurrency packages that allow for simple conversion of recursive serial algorithms to operate in parallel without having to use complicated low‐level message‐passing interfaces. Fork/join is particularly well suited to divide and conquer algorithms such as Non‐Inferior Set Estimation (NISE) method for computing the supported Pareto front of a multi‐objective optimization problem. This work develops a simple general parallel NISE (pNISE) implementation using the Java 7 concurrency tools, and then offers results from a specific implementation of solving a bi‐objective shortest path problem. The results indicate that this method is capable of sizeable speed‐ups on both small‐scale personal computers as well as large‐scale shared memory supercomputers. Finally, other network problems suitable to this method are discussed, including multi‐objective variants of the minimum spanning tree problem, transportation problem, assignment problem, maximum flow problem, and the minimum‐cost flow problem. Copyright © 2015 John Wiley & Sons, Ltd.

Medrano, Fernando Antonio↗

An approach to structural analysis using Moore-Shannon network reliability

We develop a formalism for approaching many questions dealing with network structure. The formalism is based on Shannon-Moore network reliability and on the Birnbaum definition of importance that uses it. The methods we suggest based on this formalism apply to a wide variety of dynamics on very general inter- action networks. They are designed to answer specific questions about how network structure affects particular aspects of the dynamics. We first introduce the concepts that make up the formalism, explain basic methods of using these concepts, and demonstrate applications to problems such as edge ranking.

97 MATHEMATICS AND COMPUTING↗

Towards Efficient Convolutional Neural Networks Through Low-Error Filter Saliency Estimation

Filter saliency based channel pruning is a state-of-the-art method for deep convolutional neural network compression and acceleration. This channel pruning method ranks the importance of individual filter by estimating its impact of each filter’s removal on the training loss, and then remove the least important filters and fine-tune the remnant network. In this work, we propose a systematic channel pruning method that significantly reduces the estimation error of filter saliency. Different from existing approaches, our method largely reduces the magnitude of parameters in a network by introducing alternating direction method of multipliers (ADMM) into the pre-training procedure. Therefore, the estimation of filter saliency based on Taylor expansion is significantly improved. Extensive experiments with various benchmark network architectures and datasets demonstrate that the proposed method has a much improved unimportant filter selection capability and outperform state-of-the-art channel pruning method.

Wang, Zi↗

Exploring the Role of Intrinsic Nodal Activation on the Spread of Influence in Complex Networks

In many complex networked systems such as online social networks, at any given time, activity originates at certain nodes and subsequently spreads on the network through influence. To model the spread of influence in such a scenario, we consider the problem of identification of influential entities in a complex network when nodal activation can happen through two different mechanisms. The first mode of activation is due mechanisms intrinsic to the node. The second mechanism is through the influence of connected neighbors. In this work, we present a simple probabilistic formulation that models such self-evolving systems where information diffusion occurs primarily because of the intrinsic activity of users and the spread of activity occurs due to influence. We provide an algorithm to mine for the influential seeds in such a scenario by modifying the well-known influence maximization framework with the independent cascade diffusion model. We provide small motivating examples to provide an intuitive understanding of the effect of including the intrinsic activation mechanism. We sketch a proof of the submodularity of the influence function under the new formulation and demonstrate the same with larger graphs. We then show by means of additional experiments on a real-world twitter dataset how the formulation can be applied to real-world social media datasets. Finally we derive a computationally efficient centrality metric that takes into account, both the mechanisms of activation and provides for an accurate as well as computationally efficient alternative approach to the problem of identifying influencers under intrinsic activation.

Visweswara Sathanur, Arun↗

Energy flow networks: deep sets for particle jets

A key question for machine learning approaches in particle physics is how to best represent and learn from collider events. As an event is intrinsically a variable-length unordered set of particles, we build upon recent machine learning efforts to learn directly from sets of features or “point clouds”. Adapting and specializing the “Deep Sets” framework to particle physics, we introduce Energy Flow Networks, which respect infrared and collinear safety by construction. We also develop Particle Flow Networks, which allow for general energy dependence and the inclusion of additional particle-level information such as charge and flavor. These networks feature a per-particle internal (latent) representation, and summing over all particles yields an overall event-level latent representation. We show how this latent space decomposition unifies existing event representations based on detector images and radiation moments. To demonstrate the power and simplicity of this set-based approach, we apply these networks to the collider task of discriminating quark jets from gluon jets, finding similar or improved performance compared to existing methods. We also show how the learned event representation can be directly visualized, providing insight into the inner workings of the model. These architectures lend themselves to efficiently processing and analyzing events for a wide variety of tasks at the Large Hadron Collider. Implementations and examples of our architectures are available online in our EnergyFlow package.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Predicting Fracture Network Development in Crystalline Rocks

The geometric properties of fractures influence whether they propagate, arrest, or coalesce with other fractures. Thus, quantifying the relationship between fracture network characteristics may help predict fracture network development, and perhaps precursors to catastrophic failure. To constrain the relationship and predictability of fracture characteristics, we deform eight one centimeter tall rock cores under triaxial compression while acquiring in situ X-ray tomograms. The tomograms reveal precise measurements of the fracture network characteristics above the spatial resolution of 6.5 µm. We develop machine learning models to predict the value of each characteristic using the other characteristics, and excluding the macroscopic stress or strain imposed on the rock. The models predict fracture development more accurately in the experiments performed on granite and monzonite, than the experiments on marble. Fracture network development may be more predictable in these igneous rocks because their microstructure is more mechanically homogeneous than the marble, producing more systematic fracture development that is not strongly impeded by grain contacts and cleavage planes. The varying performance of the models suggest that fracture volume, length, and aperture are the most predictable of the characteristics, while fracture orientation is the least predictable. Orientation does not correlate with length, as suggested by the idea that the orientation evolves with increasing differential stress and thus fracture length. This difference between the observed and expected relationship between orientation and length highlights the influence of mechanical heterogeneities and local stress perturbations on fracture growth as fractures propagate, link, and coalesce.

58 GEOSCIENCES↗

Detecting anomalous packets in network transfers: investigations using PCA, autoencoder and isolation forest in TCP

Large-scale scientific workflows rely heavily on high-performance file transfers. These transfers require strict quality parameters such as guaranteed bandwidth, no packet loss or data duplication. To have successful file transfers, methods such as predetermined thresholds and statistical analysis need to be done to determine abnormal patterns. Network administrators routinely monitor and analyze network data for diagnosing and alleviating these, making decisions based on their experience. However, as networks grow and become complex, monitoring large data files and quickly processing them, makes it improbable to identify errors and rectify these. Abnormal file transfers have been classified by simply setting alert thresholds, via tools such as PerfSonar and TCP statistics (Tstat). This paper investigates the feasibility of unsupervised feature extraction methods for identifying network anomaly patterns with three unsupervised classification methods—principal component analysis, autoencoder and isolation forest. Here, we collect file transfer statistics from two experiment sets—synthetic iPerf generated traffic and 1000 Genome workflow runs, with synthetically introduced anomalies. Our results show that while PCA and a simple autoencoder finds it difficult to detect clusters, the tree-variant isolation forest is able to identify anomalous packets by breaking down TCP traces into tree classes early.

97 MATHEMATICS AND COMPUTING↗

Determining the Impact of Personal Mobility Carbon Allowance Schemes in Transportation Networks

We know that personal mobility carbon allowance (PMCA) schemes are designed to reduce carbon consumption from transportation networks. PMCA schemes influence the travel decision process of users and accordingly impact the system metrics including travel time and greenhouse gas (GHG) emissions. Here, we develop a multi-user class dynamic user equilibrium model to evaluate the transportation system performance when PMCA scheme is implemented. The results using Sioux-Falls test network indicate that PMCA schemes can achieve the emissions reduction goals for transportation networks. Further, users characterized by high value of travel time are found to be less sensitive to carbon budget in the context of work trips. Results also show that PMCA scheme can lead to higher emissions for a path compared with the case without PMCA because of flow redistribution. The developed network equilibrium model allows us to examine the change in system states at different carbon allocation levels and to design parameters of PMCA schemes accounting for population heterogeneity.

54 ENVIRONMENTAL SCIENCES↗

Scale-bridging Optimization Framework for Desalination Integrated Produced Water Networks

Produced water (PW) management poses a major challenge to U.S. oil and gas development. Due to freshwater scarcity and PW injection curtailments, desalination may become a necessity in some parts of the country. Integrating rigorous desalination process models within a produced water network for co-optimization of desalination design and network operation can be challenging to scale-up due to computational complexity. In this work we use the trust region filter framework to decompose the integrated optimization problem into an optimization master problem consisting of the network model and simplified surrogates for the desalination units and an optimization sub problem for the rigorous desalination unit model. The approach is demonstrated on a multiperiod produced water network from the PARETO library with thermal desalination units.

Naik, Sakshi↗

Three-dimensional dendritic needle network model for alloy solidification

Here, we present a three-dimensional (3D) formulation of the multiscale Dendritic Needle Network (DNN) model for dendritic microstructure growth. This approach is aimed at simulating quantitatively the solidification dynamics of complex hierarchical networks in spatially extended dendritic arrays, hence bridging the scale gap between phase-field simulations at the scale of a few dendrites and coarse-grained simulations on the larger scale of entire polycrystalline structures. In the DNN model, the dendritic network is represented by a network of branches that interact through the solutal diffusion field. The tip velocity V(t) and tip radius ρ(t) of each needle is determined by combining a standard solvability condition that fixes the product ρ 2 V and a solute flux conservation condition that fixes the product ρV 2 in 2D and ρV in 3D as a function of a solutal flux intensity factor ℱ(t). The latter measures the intensity of the solute flux in the dendrite tip region and can be calculated by contour (2D) or surface (3D) integration around the tip of each needle. We first present an extended formulation of the 2D DNN model where needles have a finite thickness and parabolic tips. This formulation remains valid for a larger range of tip Péclet number than the original thin needle formulation and is readily extended to 3D needles with paraboloidal tips. The 3D DNN model based on this thick-needle formulation is developed for both isothermal and directional solidification. Model predictions are validated by comparisons with known analytical solutions that describe the early transient and steady-state growth regimes. We exploit the power of the DNN model to characterize the competitive growth of well-developed secondary branches in 3D on the scale of the diffusion length. The results show that the length of active secondary branches increases as a power law of distance behind the tip with an exponent in good quantitative agreement with experimental measurements. Finally, we apply the model to simulate the three-dimensional directional solidification of an Al-7wt% Si alloy, which we directly compare to observed microstructures from microgravity experiments onboard the International Space Station. The predictions of selected microstructural features, such as dendrite arm spacings, show a good agreement with experiments. The computationally-efficient DNN model opens new avenues for investigating the dynamics of large dendritic arrays at length and time scales relevant to solidification experiments and processes.

36 MATERIALS SCIENCE↗

Non-abelian symmetries in tensor networks: A quantum symmetry space approach

A general framework for non-abelian symmetries is presented for matrix-product and tensor-network states in the presence of well-defined orthonormal local as well as effective basis sets. The two crucial ingredients, the Clebsch-Gordan algebra for multiplet spaces as well as the Wigner-Eckart theorem for operators, are accounted for in a natural, well-organized, and computationally straightforward way. The unifying tensor-representation for quantum symmetry spaces, dubbed QSpace, is particularly suitable to deal with standard renormalization group algorithms such as the numerical renormalization group (NRG), the density matrix renormalization group (DMRG), or also more general tensor networks such as the multi-scale entanglement renormalization ansatz (MERA). In this paper, the focus is on the application of the non-abelian framework within the NRG. A detailed analysis is presented for a fully screened spin- 3/2 three-channel Anderson impurity model in the presence of conservation of total spin, particle-hole symmetry, and SU(3) channel symmetry. The same system is analyzed using several alternative symmetry scenarios based on combinations of U(1){sub charge}, SU(2){sub spin}, SU(2){sub charge}, SU(3){sub channel}, as well as the enveloping symplectic Sp(6) symmetry. These are compared in detail, including their respective dramatic gain in numerical efficiency. In the Appendix, finally, an extensive introduction to non-abelian symmetries is given for practical applications, together with simple self-contained numerical procedures to obtain Clebsch-Gordan coefficients and irreducible operators sets. The resulting QSpace tensors can deal with any set of abelian symmetries together with arbitrary non-abelian symmetries with compact, i.e. finite-dimensional, semi-simple Lie algebras. - Highlights: Black-Right-Pointing-Pointer We introduce a transparent framework for non-abelian symmetries in tensor networks. Black-Right-Pointing-Pointer The framework was successfully applied within the numerical renormalization group. Black-Right-Pointing-Pointer Combinations of SU(N{<=}3) and Sp(6) are implemented and discussed in detail. Black-Right-Pointing-Pointer Non-abelian symmetries allow to speed up calculations by orders of magnitude. Black-Right-Pointing-Pointer The framework is equally applicable to other tensor networks such as DMRG or MERA.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A practical introduction to tensor networks: Matrix product states and projected entangled pair states

This is a partly non-technical introduction to selected topics on tensor network methods, based on several lectures and introductory seminars given on the subject. It should be a good place for newcomers to get familiarized with some of the key ideas in the field, specially regarding the numerics. After a very general introduction we motivate the concept of tensor network and provide several examples. We then move on to explain some basics about Matrix Product States (MPS) and Projected Entangled Pair States (PEPS). Selected details on some of the associated numerical methods for 1d and 2d quantum lattice systems are also discussed. - Highlights: • A practical introduction to selected aspects of tensor network methods is presented. • We provide analytical examples of MPS and 2d PEPS. • We provide basic aspects on several numerical methods for MPS and 2d PEPS. • We discuss a number of applications of tensor network methods from a broad perspective.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulation of gas mixture dynamics in a pipeline network using explicit staggered-grid discretization

Here we develop an explicit staggered finite difference discretization scheme for simulating the transport of highly heterogeneous gas mixtures through pipeline networks. This study is motivated by the proposed blending of hydrogen into natural gas pipelines to reduce end use carbon emissions while using existing pipeline systems throughout their planned lifetimes. Our computational method accommodates an arbitrary number of constituent gases with very different physical properties that may be injected into a network with significant spatiotemporal variation. In this setting, the gas flow physics are highly location- and time- dependent, so that local composition and nodal mixing must be accounted for. The resulting conservation laws are formulated in terms of pressure, partial densities and flows, and volumetric and mass fractions of the constituents. We include non-ideal equations of state that employ linear approximations of gas compressibility factors, so that the pressure dynamics propagate locally according to a variable wave speed that depends on mixture composition and density. We derive compatibility relationships for network edge boundary values that are more complex than for a homogeneous gas. The simulation method is evaluated on initial boundary value problems for a single pipe and a small network, is cross-validated with a lumped element simulation, and used to demonstrate a local monitoring and control policy for maintaining allowable concentration levels.

97 MATHEMATICS AND COMPUTING↗

Classifying Cancer Pathology Reports with Hierarchical Self-Attention Networks

We introduce a deep learning architecture, hierarchical self-attention networks (HiSANs), designed for classifying pathology reports and show how its unique architecture leads to a new state-of-the-art in accuracy, faster training, and clear interpretability. We evaluate performance on a corpus of 374,899 pathology reports obtained from the National Cancer Institute's (NCI) Surveillance, Epidemiology, and End Results (SEER) program. Each pathology report is associated with five clinical classification tasks – site, laterality, behavior, histology, and grade. We compare the performance of the HiSAN against other machine learning and deep learning approaches commonly used on medical text data – Naive Bayes, logistic regression, convolutional neural networks, and hierarchical attention networks (the previous state-of-the-art). We show that HiSANs are superior to other machine learning and deep learning text classifiers in both accuracy and macro F-score across all five classification tasks. Compared to the previous state-of-the-art, hierarchical attention networks, HiSANs not only are an order of magnitude faster to train, but also achieve about 1% better relative accuracy and 5% better relative macro F-score.

60 APPLIED LIFE SCIENCES↗

Roles of the {beta} subunit hinge domain in ATP synthase F{sub 1} sector: Hydrophobic network formed by introduced {beta}Phe174 inhibits subunit rotation

The ATP synthase {beta} subunit hinge domain ({beta}Phe148 {approx} {beta}Gly186, P-loop/{alpha}-helixB/loop/{beta}-sheet4, Escherichia coli residue numbering) dramatically changes in conformation upon nucleotide binding. We previously reported that F{sub 1} with the {beta}Ser174 to Phe mutation in the domain lowered the {gamma} subunit rotation speed, and thus decreased the ATPase activity [M. Nakanishi-Matsui, S. Kashiwagi, T. Ubukata, A. Iwamoto-Kihara, Y. Wada, M. Futai, Rotational catalysis of Escherichia coli ATP synthase F{sub 1} sector. Stochastic fluctuation and a key domain of the {beta} subunit, J. Biol. Chem. 282 (2007) 20698-20704.]. Homology modeling indicates that the amino acid replacement induces a hydrophobic network, in which the {beta}Met159, {beta}Ile163, and {beta}Ala167 residues of the {beta} subunit are involved together with the mutant {beta}Phe174. The network is expected to stabilize the conformation of {beta}{sub DP} (nucleotide-bound form of the {beta} subunit), resulting in increased activation energy for transition to {beta}{sub E} (empty {beta} subunit). The modeling further predicts that replacement of {beta}Met159 with Ala or Ile weakens the hydrophobic network. As expected, these two mutations experimentally suppressed the ATPase activities as well as subunit rotation of {beta}S174F. Furthermore, the rotation rate decreased with the increase of the strength in the hydrophobic network. These results indicate that the smooth conformational change of the {beta} subunit hinge domain is pertinent for the rotational catalysis.

60 APPLIED LIFE SCIENCES↗

Transcription factor FOXA2-centered transcriptional regulation network in non-small cell lung cancer

Lung cancer is the leading cause of cancer-mediated death. Although various therapeutic approaches are used for lung cancer treatment, these mainly target the tumor suppressor p53 transcription factor, which is involved in apoptosis and cell cycle arrest. However, p53-targeted therapies have limited application in lung cancer, since p53 is found to be mutated in more than half of lung cancers. In this study, we propose tumor suppressor FOXA2 as an alternative target protein for therapies against lung cancer and reveal a possible FOXA2-centered transcriptional regulation network by identifying new target genes and binding partners of FOXA2 by using various screening techniques. The genes encoding Glu/Asp-rich carboxy-terminal domain 2 (CITED2), nuclear receptor subfamily 0, group B, member 2 (NR0B2), cell adhesion molecule 1 (CADM1) and BCL2-associated X protein (BAX) were identified as putative target genes of FOXA2. Additionally, the proteins including highly similar to heat shock protein HSP 90-beta (HSP90A), heat shock 70 kDa protein 1A variant (HSPA1A), histone deacetylase 1 (HDAC1) and HDAC3 were identified as novel interacting partners of FOXA2. Moreover, we showed that FOXA2-dependent promoter activation of BAX and p21 genes is significantly reduced via physical interactions between the identified binding partners and FOXA2. These results provide opportunities to understand the FOXA2-centered transcriptional regulation network and novel therapeutic targets to modulate this network in p53-deficient lung cancer. - Highlights: • Identification of new target genes of FOXA2. • Identifications of novel interaction proteins of FOXA2. • Construction of FOXA2-centered transcriptional regulatory network in non-small cell lung cancer.

60 APPLIED LIFE SCIENCES↗