Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nodes”

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

Mechanical behavior of ultralight nickel metamaterial

The mechanical response of ultralight kagomé structures consisting of hollow nickel (Ni) nanotubes and solid Ni nanorods to compression is studied using molecular dynamics simulations. In both kagomé architectures, 16[112] Shockley partial dislocations and twin formation are observed under compression. The structure made from solid nanorods shows deformation near both the nodes and beams of the kagomé lattice. The hollow kagomé architecture has a higher yield point than the solid kagomé structure. The deformation in the hollow nanotube structure is mostly localized in the nodal region for strains less than 11%. At higher strains, the deformation sets in all the struts and nodes of the hollow kagomé lattice. Owing to this two-stage deformation mechanism, the hollow Ni nanotube kagomé structure shows less bending and greater toughness than the solid Ni nanorod kagomé architecture.

Rajak, Pankaj (ORCID:0000000263446056)↗

Soft, malleable double diamond twin

A twin boundary (TB) is a common low energy planar defect in crystals including those with the atomic diamond structure (C, Si, Ge, etc.). We study twins in a self-assembled soft matter block copolymer (BCP) supramolecular crystal having the double diamond (DD) structure, consisting of two translationally shifted, interpenetrating diamond networks of the minority polydimethyl siloxane block embedded in a polystyrene block matrix. The coherent, low energy, mirror-symmetric double tubular network twin has one minority block network with its nodes offset from the (222) TB plane, while nodes of the second network lie in the plane of the boundary. The offset network, although at a scale about a factor of 10 3 larger, has precisely the same geometry and symmetry as a (111) twin in atomic single diamond where the tetrahedral units spanning the TB retain nearly the same strut (bond) lengths and strut (bond) angles as in the normal unit cell. In DD, the second network undergoes a dramatic restructuring—the tetrahedral nodes transform into two new types of mirror-symmetric nodes (pentahedral and trihedral) which alternate and link to form a hexagonal mesh in the plane of the TB. The collective reorganization of the supramolecular packing highlights the hierarchical structure of ordered BCP phases and emphasizes the remarkable malleability of soft matter.

36 MATERIALS SCIENCE↗

Reconstruction of the dark energy equation of state

One of the main challenges of modern cosmology is to investigate the nature of dark energy in our Universe. The properties of such a component are normally summarised as a perfect fluid with a (potentially) time-dependent equation-of-state parameter w(z). We investigate the evolution of this parameter with redshift by performing a Bayesian analysis of current cosmological observations. We model the temporal evolution as piecewise linear in redshift between 'nodes', whose w-values and redshifts are allowed to vary. The optimal number of nodes is chosen by the Bayesian evidence. In this way, we can both determine the complexity supported by current data and locate any features present in w(z). We compare this node-based reconstruction with some previously well-studied parameterisations: the Chevallier-Polarski-Linder (CPL), the Jassal-Bagla-Padmanabhan (JBP) and the Felice-Nesseris-Tsujikawa (FNT). By comparing the Bayesian evidence for all of these models we find an indication towards possible time-dependence in the dark energy equation-of-state. It is also worth noting that the CPL and JBP models are strongly disfavoured, whilst the FNT is just significantly disfavoured, when compared to a simple cosmological constant w = −1. We find that our node-based reconstruction model is slightly disfavoured with respect to the ΛCDM model.

79 ASTRONOMY AND ASTROPHYSICS↗

STAR Data Production Workflow on HPC: Lessons Learned & Best Practices

The Solenoidal Tracker at RHIC (STAR) is a multi-national supported experiment located at Brookhaven National Lab. The raw physics data captured from the detector is on the order of tens of PBytes per data acquisition campaign, which makes STAR fit well within the definition of a big data science experiment. The production of the data has typically run on standard nodes or on standard Grid computing environments. All embedding simulations (complex workflow mixing real and simulated events) have been run on standard Linux resources at the National Energy Research Scientific Computing Center (NERSC) aka PDSF. However, HPC resources such as Cori have become available for STAR's data production as well as embedding, and STAR has been the very first experiment to show feasibility of running a sustainable data production campaign on this computing resource. The use of Docker containers with Shifter is required to run on HPC @ NERSC - this approach encapsulates the environment in which a standard STAR workflow runs. From the deployment of a tailored Scientific Linux environment (requiring many of its own libraries and special configurations required to run) to the deployment of third-party software and the STAR specific software stack, it has become impractical to rely on a set of containers containing each specific software release. To this extent, solutions based on the CERN VM File System (CVMFS) for the deployment of software and services have been employed in HENP, but one needs to make careful scalability considerations when using a resource like Cori, such as not allowing all software to be deployed in containers or bare node. Additionally, CVMFS clients are not compatible on Cori nodes and one needs to rely on an indirect NFS/DVS mount scheme. In our contribution, we will discuss our strategies from the past and our current solution based on CVMFS. Furthermore, running on HPC is not a simple task as each aspect of the workflow must be enabled to scale, run efficiently, and the workflow needs to fit within the boundaries of the provided queue system (SLURM in this case). Lastly, we will also discuss what we have learned so far about what is the best method for grouping jobs to maximize a single 48 core HPC node within a specific time frame and maximize our workflow efficiency.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

SPiRaL: a multiresolution global tomography model of seismic wave speeds and radial anisotropy variations in the crust and mantle

SUMMARY SPiRaL is a joint global-scale model of wave speeds (P and S) and anisotropy (vertical transverse isotropy, VTI) variations in the crust and mantle. The model is comprised of >2.1 million nodes with five parameters at each node that capture velocity variations for P- and S-waves travelling at arbitrary directions in transversely isotropic media with a vertical symmetry axis (VTI). The crust (including ice, water, sediments and crystalline layers) is directly incorporated into the model. The default node spacing is approximately 2° in the lower mantle and 1° in the crust and upper mantle. The grid is refined with ∼0.25° minimum node spacing in highly sampled regions of the crust and upper mantle throughout North America and Eurasia. The data considered in the construction of SPiRaL includes millions of body wave traveltimes (crustal, regional and teleseismic phases with multiples) and surface wave (Rayleigh and Love) dispersion. A multiresolution inversion approach is employed to capture long-wavelength heterogeneities commonly depicted in global-scale tomography images as well as more localized details that are typically resolved in more focused regional-scale studies. Our previous work has demonstrated that such global-scale models with regional-scale detail can accurately predict both teleseismic and regional body wave traveltimes, which is necessary for more accurate location of small seismic events that may have limited signal at teleseismic distances. SPiRaL was constructed to predict traveltimes for event location and long-period waveform dispersion for seismic source inversion applications in regions without sufficiently tuned models. SPiRaL may also serve as a starting model for full-waveform inversion (FWI) with the goal of fitting waves with periods 10–50 s over multiple broad regions (thousands of kilometres) and potentially the globe. To gain insight to this possibility, we simulated waveforms for a small set of events using SPiRaL and independent waveform-based models for comparison. For the events tested, the performance of the traveltime-based SPiRaL model is shown to be generally on par with regional 3-D waveform-based models in three regions (western United States, Middle East, Korean Peninsula) suggesting SPiRaL may serve as a starting model for FWI over broad regions.

58 GEOSCIENCES↗

Microscopic Imprints of Learned Solutions in Tunable Networks

In physical networks trained using supervised learning, physical parameters are adjusted to produce desired responses to inputs. An example is an electrical contrastive local learning network of nodes connected by edges that adjust their conductances during training. When an edge conductance changes, it upsets the current balance of every node. In response, physics adjusts the node voltages to minimize the dissipated power. Learning in these systems is therefore a coupled double-optimization process, in which the network descends both a cost landscape in the high-dimensional space of edge conductances and a physical landscape—the power dissipation—in the high-dimensional space of node voltages. Because of this coupling, the physical landscape of a trained network contains information about the learned task. Here, we derive a structure-function relation for trained tunable networks and demonstrate that all the physical information relevant to the trained input-output relation can be captured by a tuning susceptibility, an experimentally measurable quantity. We supplement our theoretical results with simulations to show that the tuning susceptibility is correlated with functional importance and that we can extract physical insight into how the system performs the task from the conductances of highly susceptible edges. Our analysis is general and can be applied directly to mechanical networks, such as networks trained for protein-inspired function such as allostery.

36 MATERIALS SCIENCE↗

Reentrant stability of Bose-Einstein-condensate standing-wave patterns

We describe standing-wave patterns induced by an attractive finite-ranged external potential inside a large Bose-Einstein Condensate (BEC). As the potential depth increases, the time-independent Gross-Pitaevskii equation develops pairs of solutions that have nodes in their wave function. We elucidate the nature of these states and study their dynamical stability. Although we study the problem in a two-dimensional BEC subject to a cylindrically symmetric square well potential of a radius that is comparable to the coherence length of the BEC, our analysis reveals general trends that are valid in two and three dimensions, independent of the symmetry of the localized potential well, and suggestive of the behavior in general short-range and large-range potentials. One set of nodal BEC wave functions resembles the single particle n-node bound-state wave function of the potential well, the other wave functions resemble the n-1-node bound-state wave function with a kink state pinned by the potential. The second state, though corresponding to the lower free energy value of the pair of n-node BEC states, is always unstable, whereas the first can be dynamically stable in intervals of the potential well depth, implying that the standing-wave BEC can evolve from being dynamically unstable to stable and back to unstable as the potential well is adiabatically deepened - a phenomenon that we refer to as 'reentrant dynamical stability'.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Long-distance entanglement generation in two-dimensional networks

We consider two-dimensional networks composed of nodes initially linked by two-qubit mixed states. In these networks we develop a global error correction scheme that can generate distance-independent entanglement from arbitrary network geometries using rank-2 states. By using this method and combining it with the concept of percolation, we also show that the generation of long-distance entanglement is possible with rank-3 states. Entanglement percolation and global error correction have different advantages depending on the given situation. To reveal the trade-off between them we consider their application to networks containing pure states. In doing so we find a range of pure-state schemes, each of which has applications in particular circumstances: For instance, we can identify a protocol for creating perfect entanglement between two distant nodes. However, this protocol cannot generate a singlet between any two nodes. In contrast, we can also construct schemes for creating entanglement between any nodes, but the corresponding entanglement fidelity is lower.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Limited-path-length entanglement percolation in quantum complex networks

We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with an arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real-world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed-state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely, the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small-world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with a limited path length. We find that this probability can be significant even for paths limited to few connections and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Precision benchmark calculations for four particles at unitarity

The unitarity limit describes interacting particles where the range of the interaction is zero and the scattering length is infinite. We present precision benchmark calculations for two-component fermions at unitarity using three different ab initio methods: Hamiltonian lattice formalism using iterated eigenvector methods, Euclidean lattice formalism with auxiliary-field projection Monte Carlo methods, and continuum diffusion Monte Carlo methods with fixed and released nodes. We have calculated the ground-state energy of the unpolarized four-particle system in a periodic cube as a dimensionless fraction of the ground-state energy for the noninteracting system. We obtain values of 0.211(2) and 0.210(2) using two different Hamiltonian lattice representations, 0.206(9) using Euclidean lattice formalism, and an upper bound of 0.212(2) from fixed-node diffusion Monte Carlo methods. Released-node calculations starting from the fixed-node result yield a decrease of less than 0.002 over a propagation of 0.4E{sub F}{sup -1} in Euclidean time, where E{sub F} is the Fermi energy. We find good agreement among all three ab initio methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

First-principles theory of the Dirac semimetal Cd 3 As 2 under Zeeman magnetic field

Time-reversal broken Weyl semimetals have attracted much attention recently, but certain aspects of their behavior, including the evolution of their Fermi surface topology and anomalous Hall conductivity with Fermi-level position, have remained underexplored. A promising route to obtain such materials may be to start with a nonmagnetic Dirac semimetal and break time-reversal symmetry via magnetic doping or magnetic proximity. Here we explore this scenario in the case of the Dirac semimetal Cd 3 As 2 , based on first-principles density-functional calculations and subsequent low-energy modeling of Cd 3 As 2 in the presence of a Zeeman field applied along the symmetry axis. We clarify how each four-fold degenerate Dirac node splits into four Weyl nodes, two with chirality ±1 and two higher-order nodes with chirality ±2. Using a minimal k · p model Hamiltonian whose parameters are fit to the first-principles calculations, we detail the evolution of the Fermi surfaces and their Chern numbers as the Fermi energy is scanned across the region of the Weyl nodes at fixed Zeeman field. We also compute the intrinsic anomalous Hall conductivity as a function of Fermi-level position, finding a characteristic inverted-dome structure. Cd 3 As 2 is especially well suited to such a study because of its high mobility, but the qualitative behavior revealed here should be applicable to other Dirac semimetals as well.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Systematic reduction of sign errors in many-body problems: generalization of self-healing diffusion Monte Carlo to excited states

A recently developed Self-Healing Diffusion Monte Carlo Algorithm [PRB {\bf 79}, 195117 ] is extended to the calculation of excited states. The formalism is based on a excited-state fixed-node approximation and the mixed estimator of the excited-state probability density. The fixed-node ground state wave-functions of inequivalent nodal pockets are found simultaneously using a recursive approach. The decay of the wave-function into lower energy states is prevented using two methods: i) The projection of the improved trial-wave function into previously calculated eigenstates is removed. ii) The reference energy for each nodal pocket is adjusted in order to create a kink in the global fixed-node wave-function which, when locally smoothed out, increases the volume of the higher energy pockets at the expense of the lower energy ones until the energies of every pocket become equal. This reference energy method is designed to find nodal structures that are local minima for arbitrary fluctuations of the nodes within a given nodal topology. We demonstrate in a model system that the algorithm converges to many-body eigenstates in bosonic-like and fermionic cases.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Visual Understanding of COVID-19 Knowledge Graph for Predictive Analysis

This study aims to effectively analyze and visualize the concept to concept network derived from the COVID-19 Open Research Dataset (CORD-19) dataset, where we have more than 48,000 concepts with more than 300,000 relationships between concepts. In analyzing networks, we focus on finding relationship patterns between the coronavirus disease 2019 (COVID-19) concepts and other concepts. Given the node and edge datasets, we construct directional graphs and calculate all pair shortest paths based on multiple edge weight schemes. However, statistical metrics are not sufficient to identify specific relationships represented in the network. Therefore, we also propose a visual analytics approach to effectively understand the knowledge graph. Our highly interactive visual analytics allows users to effectively analyze the evolving graphs and (COVID-19) concept nodes and other nodes related to the COVID-19 nodes. We envision that this study will pave the path to develop strategies to provide more accurate and scalable predictive analysis on knowledge graphs related to CORD19 and other biomedical knowledge graphs.

Lim, Seung-Hwan↗

Containers for Massive Ensemble of I/O Bound Hierarchical Coupled Simulations

We present our experience using containers to scale up a massive ensemble of coupled I/O bound workloads on the NERSC Cori supercomputer. We describe the design of a hierarchical simulation structure using the Integrated Plasma Simulator (IPS) that enables the flexible execution of coupled simulations at the system, node, and core level using the same coupling abstraction and API. The hierarchical design allows for the node-level execution to be efficiently executed using containers while not impacting the structure of the simulation at the system level. We demonstrate the viability of the approach by presenting experimental results from applications in coupled fusion plasma simulations that illustrate the performance impact of using containers to deploy the node-level workloads, in conjunction with the user mountable XFS file systems to ameliorate the load on the Lustre parallel file system. We also present results from production runs showing the ability of the ensemble simulations to scale to hundreds of Cori Haswell nodes, with little or no overhead.

Elwasif, Wael↗

Accelerating Subsurface Transport Simulation on Heterogeneous Clusters

Reactive transport numerical models simulate chemical and microbiological reactions that occur along a flowpath. These models have to compute reactions for a large number of locations. They solve the set of ordinary differential equations (ODEs) that describes the reaction for each location through the Newton-Raphson technique. This technique involves computing a Jacobian matrix and a residual vector for each set of equation, and then solving iteratively the linearized system by performing Gaussian Elimination and LU decomposition until convergence. STOMP, a well known subsurface flow simulation tool, employs matrices with sizes in the order of 100x100 elements and, for numerical accuracy, LU factorization with full pivoting instead of the faster partial pivoting. Modern high performance computing systems are heterogeneous machines whose nodes integrate both CPUs and GPUs, exposing unprecedented amounts of parallelism. To exploit all their computational power, applications must use both the types of processing elements. For the case of subsurface flow simulation, this mainly requires implementing efficient batched LU-based solvers and identifying efficient solutions for enabling load balancing among the different processors of the system. In this paper we discuss two approaches that allows scaling STOMP's performance on heterogeneous clusters. We initially identify the challenges in implementing batched LU-based solvers for small matrices on GPUs, and propose an implementation that fulfills STOMP's requirements. We compare this implementation to other existing solutions. Then, we combine the batched GPU solver with an OpenMP-based CPU solver, and present an adaptive load balancer that dynamically distributes the linear systems to solve between the two components inside a node. We show how these approaches, integrated into the full application, provide speed ups from 6 to 7 times on large problems, executed on up to 16 nodes of a cluster with two AMD Opteron 6272 and a Tesla M2090 per node.

GPU↗

An Approach to Selecting Thread + Process Mixes for Hybrid MPI + OpenMP Applications, In: 2015 IEEE International Conference on Cluster Computing

Hybrid MPI + OpenMP is a popular means of programming modern machines that feature substantial parallelism both off-node and on-node. Determining the right mix of the two programming models to use, however, is not as straightforward as simply using exclusively OpenMP on-node and limiting MPI to only inter-node communication. We present a step-by-step methodology to help make the decision of which mix of the two programming models to use. It starts with an estimate of the performance of a generic hybrid application on a given machine and incorporates additional available information about the specific application and the machine to provide guidance for selecting effective mixes of MPI processes and OpenMP threads to use when running that application on the machine in question. We validate our approach on four different applications on an IBM Blue Gene/Q, a Cray XK7, and a Cray XC30.

Computer Science↗

Distributed Detection of Malicious Attacks on Consensus Algorithms with Applications in Power Networks

Consensus-based distributed algorithms are well suited for coordination among agents in a cyber-physical system. These distributed schemes, however, suffer from their vulnerability to cyber attacks that are aimed at manipulating data and control ow. In this article, we present a novel distributed method for detecting the presence of such intrusions for a distributed multi-agent system following ratio consensus. We employ a Max-Min protocol to develop low cost, easy to implement detection strategies where each participating node detects the intrusion independently, eliminating the need for a trusted certifying agent in the network. The effectiveness of the detection method is demonstrated by numerical simulations on a 1000 node network to demonstrate the efficacy and simplicity of implementation.

27 ARPA - Advanced Research Projects Agency-Energy↗

Accelerating the Global Arrays ComEx Runtime using Multiple Progress Ranks

Partitioned Global Address Space (PGAS) models are part of system software that are being designed to support communication runtime for exascale applications. Suitability of using MPI as a scalable PGAS communication subsystem has been shown as a viable option due to its standardization and higher performance. We used MPI two-sided semantics with a combination of automatic and user defined splitting of MPI communicators to achieve asynchronous progress. Our implementation can make use of multiple asynchronous progress ranks (PR) per node that can be mapped to the computing architecture of a node in a distributed cluster. We are able to show significant speed up of over 2.0X and scaling of communication bound computational chemistry application over 1024 nodes of state- of-the-art HPC clusters. Our results show that while running a communication bound application workload on a certain number of cluster nodes, a use of optimum number of ranks dedicated for communication may be used to achieve asynchronous communication progress and obtain highest performance.

PGAS, global-arrays, NWCHEM, NWChemEx, HPC, GPGPU↗