Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Serialization”

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 901 records · Page 50

Programming with BIG data in R: Scaling analytics from one to thousands of nodes

Here, we present a tutorial overview showing how one can achieve scalable performance with R. We do so by utilizing several package extensions, including those from the pbdR project. These packages consist of high performance, high-level interfaces to and extensions of MPI, PBLAS, ScaLAPACK, I/O libraries, profiling libraries, and more. While these libraries shine brightest on large distributed platforms, they also work rather well on small clusters and often, surprisingly, even on a laptop with only two cores. Our tutorial begins with recommendations on how to get more performance out of your R code before considering parallel implementations. Because R is a high-level language, a function can have a deep hierarchy of operations. For big data, this can easily lead to inefficiency. Profiling is an important tool to understand the performance of an R code for both serial and parallel improvements.

97 MATHEMATICS AND COMPUTING↗

Mutation in galP improved fermentation of mixed sugars to succinate using engineered Escherichia coli AS1600a and AM1 mineral salts medium

Escherichia coli KJ122 was engineered to produce succinate from glucose using the wild type GalP for glucose uptake instead of the native phosphotransferase system (ptsI mutation). This strain now ferments 10% xylose poorly. Mutants were selected by serial transfers in AM1 mineral salts medium with 10% xylose. Clones from this population all exhibited a similar improvement, co-fermentation of an equal mixture of xylose and glucose. One of these, AS1600a, produced 84.26 ± 1.37 g/L succinate, equivalent to that produced by the parent (KJ122) from 10% glucose (85.46 ± 1.78 g/L). AS1600a was sequenced and found to contain a mutation in galactose permease (GalP, G236D). This mutation was shown to be responsible for the improvement in fermentation using KJΔgalP as the host and expression vectors with native galP and with mutant galP*. Strain AS1600a and KJΔgalP(pLOI5746; galP*) also co-fermented a mixture of glucose, xylose, arabinose, and galactose in sugarcane bagasse hydrolysate using mineral salts medium.

59 BASIC BIOLOGICAL SCIENCES↗

Preface to the Special Issue on TOUGH Symposium 2015

The TOUGH Symposium 2015 was held in Berkeley, California, September 28-30, 2015. The TOUGH family of codes, developed at the Energy Geosciences Division of Lawrence Berkeley National Laboratory (LBNL), is a suite of computer programs for the simulation of multiphase and multicomponent fluid and heat flows in porous and fractured media with applications in many geosciences fields, such as geothermal reservoir engineering, nuclear waste disposal, geological carbon sequestration, oil and gas reservoirs, gas hydrate research, vadose zone hydrology and environmental remediation. Since the first release in the 1980s, many modifications and enhancements have been continuously made to TOUGH and its various descendants (iTOUGH2, TOUGH+, TOUGH-MP, TOUGHREACT, TOUGH+HYDRATE, TMVOC...), at LBNL and elsewhere. Today, these codes are used worldwide in academia, government organizations and private companies in problems involving coupled hydrological, thermal, biogeochemical and geomechanical processes. The Symposia, organized every 2-3 years, bring together developers and users for an open exchange on recent code enhancements and applications. In 2015, the Symposium was attended by one hundred participants, representing thirty-four nationalities. This Special Issue in Computers & Geosciences gathers extended versions of selected Symposium proceedings related to (i) recent enhancements to the TOUGH family of codes and (ii) coupled flow and geomechanics processes modeling. In this special issue, a paper by Jung et al. provides a new base version of TOUGH, TOUGH3. This latest version addresses the computational robustness and efficiency needed for the increasing complexity of the simulated processes and the growing size of model domains. Moreover, it consolidates the serial and parallel versions into a single code, hence, inconsistencies between different versions are less likely to occur, and code maintenance and development become more efficient. Finsterle et al. present a review of the capabilities of iTOUGH2 and illustrate the workflow of an integrated simulation-optimization framework. Liu et al. present an approach to reduce the computational cost of performing Bayesian inverse modeling and demonstrate their approach using a synthetic experiment simulated with TOUGH2. Regarding the mesh generation process, the paper by Doughty presents a generalization of the grid-generation algorithm embedded in TOUGH2 (MESHMAKER) to create one-column grids with fractal dimension, useful for representing flow through fractures or highly heterogeneous media with fractal geometry, and also for inverse methods. Sentís and Gable present a module to interface the open source code Lagrit with TOUGH2, that assists in the processes of mesh generation and model setup, and that can be particularly useful for complex geometries and large models. Bonduà et al. present a pre-processing tool (VORO2MESH) that features a full 3D Voronoi approach for structured and unstructured grids, and an enhanced post-processor (TOUGH2Viewer) for the visualization of 3D Voronoi grids. The literature review shows that coupled fluid flow and geomechanics has gained increasing attention in the last years in many geosciences fields. In this context, several codes of the TOUGH family have been successfully coupled with geomechanics software. The paper by Rutqvist presents a review of some of these TOUGH-based geomechanics models, of which the TOUGH-FLAC simulator – presented for the first time in the TOUGH Symposium 2003 – is well-known worldwide and has been used in a large variety of applications, encompassing the application domains of the TOUGH codes. Blanco-Martín et al. present an extension of TOUGH-FLAC to the finite strain framework, motivated by the existence of large strains associated with rock salt deformation in the context of heat-generating nuclear waste disposal. Following a paper published in the Special Issue of the TOUGH Symposium 2012 in this journal, Kim et al. present the current status of the TOUGH-RSBN simulator for coupled hydro-mechanical modeling of hydraulic fracturing using a discrete fracture network approach, and present some validation and demonstration cases. Rinaldi and Nespoli present TOUGH-SEED, an injection-induced seismicity modeling approach using TOUGH2 and a geomechanics stochastic model, and apply it to the Basel EGS project. Finally, Rinaldi et al. use the PEST protocol implemented in iTOUGH2, combined with TOUGH-FLAC as the forward model, to perform inverse modeling for the In Salah CO2 demonstration site in Algeria. Using pore pressures and InSAR displacements as observations, this approach allows for a multi-physics joint inversion and takes advantage of the inverse capabilities of iTOUGH2 (parameter estimation, sensitivity analysis, uncertainty estimation …), applied to coupled fluid flow and geomechanics. On behalf of the members of the TOUGH Symposium 2015 Organizing Committee, I hope that this collection of papers will provide the readers of Computers & Geosciences with a recent view of the capabilities of the TOUGH family of codes, as well as with current modeling research domains in the geosciences. Last but not least, I would like to express my gratitude to all the reviewers who kindly contributed to this Special Issue, as well as the Journal staff who have made this publication possible.

99 GENERAL AND MISCELLANEOUS↗

A Post-Transcriptional Feedback Mechanism for Noise Suppression and Fate Stabilization

Diverse biological systems utilize fluctuations (“noise”) in gene expression to drive lineage-commitment decisions. However, once a commitment is made, noise becomes detrimental to reliable function, and the mechanisms enabling post-commitment noise suppression are unclear. Here, we find that architectural constraints on noise suppression are overcome to stabilize fate commitment. Using single-molecule and time-lapse imaging, we find that—after a noise-driven event—human immunodeficiency virus (HIV) strongly attenuates expression noise through a non-transcriptional negative-feedback circuit. Feedback is established through a serial cascade of post-transcriptional splicing, whereby proteins generated from spliced mRNAs auto-deplete their own precursor unspliced mRNAs. Strikingly, this auto-depletion circuitry minimizes noise to stabilize HIV’s commitment decision, and a noise-suppression molecule promotes stabilization. Lastly, this feedback mechanism for noise suppression suggests a functional role for delayed splicing in other systems and may represent a generalizable architecture of diverse homeostatic signaling circuits.

59 BASIC BIOLOGICAL SCIENCES↗

A Zika virus mutation enhances transmission potential and confers escape from protective dengue virus immunity

Zika virus (ZIKV) and dengue virus (DENV) are arthropod-borne pathogenic flaviviruses that co-circulate in many countries. To understand some of the pressures that influence ZIKV evolution, we mimic the natural transmission cycle by repeating serial passaging of ZIKV through cultured mosquito cells and either DENV-naive or DENV-immune mice. Compared with wild-type ZIKV, the strains passaged under both conditions exhibit increased pathogenesis in DENV-immune mice. Application of reverse genetics identifies an isoleucine-to-valine mutation (I39V) in the NS2B proteins of both passaged strains that confers enhanced fitness and escape from pre-existing DENV immunity. Introduction of I39V or I39T, a naturally occurring homologous mutation detected in recent ZIKV isolates, increases the replication of wild-type ZIKV in human neuronal precursor cells and laboratory-raised mosquitoes. Our data indicate that ZIKV strains with enhanced transmissibility and pathogenicity can emerge in DENV-naive or -immune settings, and that NS2B-I39 mutants may represent ZIKV variants of interest.

59 BASIC BIOLOGICAL SCIENCES↗

Application of organic- and nanoparticle-modified foams in foamed concrete: Reinforcement and stabilization mechanisms

Highlights: • An ultra-stable foam was fabricated by modifying the gas–liquid interface. • A homogeneous and finer pore structure of foamed concrete was generated. • Stabilization and enhancement mechanisms were investigated. - Abstract: In this study, an ultra-stable foam used for foamed concrete was fabricated by modifying the gas–liquid interface by coupling the effects of an organic surfactant and nanoparticles. A serial of techniques was employed to study the products and microstructure development of foam and foamed concrete, respectively. The results show that nano-silica and hydroxypropyl methylcellulose can slow the coalescence and disproportionation of the bubbles by adsorbing at the air bubble surface and increasing the viscosity of cell wall paste, thus preventing gas transfer and hindering physical drainage between the gaseous and liquid phases. Also, a more homogeneous and finer pore structure is generated with the inclusion of the organic surfactant and nanoparticles. The pozzolanic reaction between the nano-silica and Ca(OH){sub 2} results in an increased C-S-H content and the densification of the cell wall structure. In addition, the stability of foamed concrete with modification and relevant stabilization mechanisms were also investigated.

36 MATERIALS SCIENCE↗

An overlapping Domain Decomposition preconditioning method for monolithic solution of shear bands

Metals subjected to high strain rate impact often exhibit a sudden and profound drop in the material’s load bearing capability, a ductile failure phenomenon known as shear banding. Shear bands, characterized as material instabilities, are driven by shear heating and described as narrow regions that have sustained intense plastic deformation and high temperature rise. This coupled thermo-mechanical localization problem can be formulated as a nonlinear system with two balance equations, momentum and energy, and two constitutive laws for elasticity and plasticity. Here in our formulation, mixed finite elements are used to discretize the equations in space and an implicit finite difference scheme is used to advance the system in time, where at every time step, a Newton type method is used to solve the system monolithically. To that end, a block Jacobian matrix is formed analytically using Gâteaux derivatives. The resulting Jacobian is sparse, nonsymmetric and its sparsity pattern and eigenvalue content vary with the different stages of shear bands formation, consequently posing a significant challenge to iterative solvers. To address this issue, an overlapping Domain Decomposition preconditioner that takes into account the physics of shear bands and the domain in which it forms, is proposed. The key idea is to resolve the shear band domain accurately while only solving the remaining domain approximately, with selective updates when necessary. The preconditioner is formed on the basis of an additive Schwartz method that is applied to a Schur complement partition of the system. The proposed preconditioner is implemented in parallel and tested on three different benchmark problems as compared against off-the-shelf solvers. We study the effect of h- and k-refinement that are obtained from Isogeometric discretizations of the system, the overlapping strategy and its parallel performance. Excellent performance is demonstrated in serial and parallel on all benchmark examples.

42 ENGINEERING↗

PPINN: Parareal physics-informed neural network for time-dependent PDEs

Physics-informed neural networks (PINNs) encode physical conservation laws and prior physical knowledge into the neural networks, ensuring the correct physics is represented accurately while alleviating the need for supervised learning to a great degree. While effective for relatively short-term time integration, when long time integration of the time-dependent PDEs is sought, the time–space domain may become arbitrarily large and hence training of the neural network may become prohibitively expensive. To this end, we develop a parareal physics-informed neural network (PPINN), hence decomposing a long-time problem into many independent short-time problems supervised by an inexpensive/fast coarse-grained (CG) solver. In particular, the serial CG solver is designed to provide approximate predictions of the solution at discrete times, while initiate many fine PINNs simultaneously to correct the solution iteratively. There is a two-fold benefit from training PINNs with small-data sets rather than working on a large-data set directly, i.e., training of individual PINNs with small-data is much faster, while training the fine PINNs can be readily parallelized. Consequently, compared to the original PINN approach, the proposed PPINN approach may achieve a significant speed-up for long-time integration of PDEs, assuming that the CG solver is fast and can provide reasonable predictions of the solution, hence aiding the PPINN solution to converge in just a few iterations. To investigate the PPINN performance on solving time-dependent PDEs, we first apply the PPINN to solve the Burgers equation, and subsequently we apply the PPINN to solve a two-dimensional nonlinear diffusion–reaction equation. Furthermore, our results demonstrate that PPINNs converge in a few iterations with significant speed-ups proportional to the number of time-subdomains employed.

42 ENGINEERING↗

Mesoscale modeling and semi-analytical approach for the microstructure-aware effective thermal conductivity of porous polygranular materials

Here we established a comprehensive modeling approach for investigating the microstructure-aware effective thermal conductivity ($κ_{eff}$) for porous microstructures containing solid particles and gaseous pores. Our approach combines the mesoscale computational modeling framework and the semi-analytical method, allowing for efficient prediction of $κ_{eff}$ for realistic porous microstructures, while considering complicated microstructural thermal conduction pathways effectively in the prediction. We used the diffuse-interface mesoscale computational model to generate extensive simulated $κ_{eff}$ data for realistic digital representations of microstructures with wide ranges of porosity ($f_p$), thermal conductivity of the gas phase ($κ_g$), and thermal conductivity of the solid phase ($κ_s$). From the simulated data, we identified two property variation regimes for $κ_{eff}$: (1) a slow $κ_{eff}$ increase for $κ_s ~ κ_g$; and (2) a faster $κ_{eff}$ increase for $κ_s \gg κ_g$. To capture the key features of the relationship between the microstructure and $κ_{eff}$, we derived a semi-analytical model by introducing structure and intensification factors. The two new factors incorporate the calibrated effective contribution of the solid volume with $κ_s$ and additional interfacial effects into the prediction of $κ_{eff}$, respectively, allowing for consideration of parallel, serial, and interfacial conduction mechanisms effectively. Using the selected simulation data, we quantified key model parameters within the semi-analytical model and verified that the parameterized model exhibits excellent agreement with simulated $κ_{eff}$ for the entire range of the parameter space.

36 MATERIALS SCIENCE↗

DECA: Discrete Event inspired Cellular Automata for grain structure prediction in additive manufacturing

Microstructure largely dictates macroscopic material properties and is strongly affected by processing. Therefore, the simulation of microstructure evolution in response to thermal fields during processing is of significant interest within the computational materials science community. Additive manufacturing (AM) has emerged as a technique for producing complex geometries and unique microstructures. Yet, complex and rapid thermal cycles in AM pose computational challenges for existing microstructure models. This work proposes a discrete event inspired cellular automata (CA) approach, titled DECA, to accelerate simulation of grain structure evolution in AM. In contrast to conventional time-stepped CA models, this model directly solves the times capture events would take place allowing for stepping in events rather than time (a technique also found in the field of discrete-event simulation). In comparison to purely serial discrete-event models, DECA allows for temporary violation of the causality constraint, but detects and corrects these violations, leading to an emergent phenomenon dubbed causality rippling, in which previously calculated capture events are overwritten. The amount of repeated calculations, defined by the capture ratio, is taken as a measure of computational inefficiency, and the model parameters that affect this ratio are evaluated. The new DECA approach was found to be more computationally efficient than conventional time-stepped CA models while guaranteeing an accurate solution, which can only be achieved in the conventional models for vanishingly small time steps. Finally, opportunities for parallelization and scaling of the new approach are discussed.

36 MATERIALS SCIENCE↗

Factorization in large-scale many-body calculations

One approach for solving interacting many-fermion systems is the configuration-interaction method, also sometimes called the interacting shell model, where one finds eigenvalues of the Hamiltonian in a many-body basis of Slater determinants (antisymmetrized products of single-particle wavefunctions). The resulting Hamiltonian matrix is typically very sparse, but for large systems the nonzero matrix elements can nonetheless require terabytes or more of storage. An alternate algorithm, applicable to a broad class of systems with symmetry, in our case rotational invariance, is to exactly factorize both the basis and the interaction using additive/multiplicative quantum numbers; such an algorithm recreates the many-body matrix elements on the fly and can reduce the storage requirements by an order of magnitude or more. Here, we discuss factorization in general and introduce a novel, generalized factorization method, essentially a ‘double-factorization’ which speeds up basis generation and set-up of required arrays. Although we emphasize techniques, we also place factorization in the context of a specific (unpublished) configuration-interaction code, BIGSTICK, which runs both on serial and parallel machines, and discuss the savings in memory due to factorization.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Scalable Metropolis Monte Carlo for simulation of hard shapes

We design and implement a scalable hard particle Monte Carlo simulation toolkit (HPMC), and release it open source as part of HOOMD-blue. HPMC runs in parallel on many CPUs and many GPUs using domain decomposition. We employ BVH trees instead of cell lists on the CPU for fast performance, especially with large particle size disparity, and optimize inner loops with SIMD vector intrinsics on the CPU. Our GPU kernel proposes many trial moves in parallel on a checkerboard and uses a block-level queue to redistribute work among threads and avoid divergence. HPMC supports a wide variety of shape classes, including spheres/disks, unions of spheres, convex polygons, convex spheropolygons, concave polygons, ellipsoids/ellipses, convex polyhedra, convex spheropolyhedra, spheres cut by planes, and concave polyhedra. NVT and NPT ensembles can be run in 2D or 3D triclinic boxes. Additional integration schemes permit Frenkel–Ladd free energy computations and implicit depletant simulations. In a benchmark system of a fluid of 4096 pentagons, HPMC performs 10 million sweeps in 10 min on 96 CPU cores on XSEDE Comet. The same simulation would take 7.6 h in serial. HPMC also scales to large system sizes, and the same benchmark with 16.8 million particles runs in 1.4 h on 2048 GPUs on OLCF Titan.

Computer Science↗

GPU acceleration of all-electron electronic structure theory using localized numeric atom-centered basis functions

We present an implementation of all-electron density-functional theory for massively parallel GPU-based platforms, using localized atom-centered basis functions and real-space integration grids. Special attention is paid to domain decomposition of the problem on non-uniform grids, which enables compute- and memory-parallel execution across thousands of nodes for real-space operations, e.g. the update of the electron density, the integration of the real-space Hamiltonian matrix, and calculation of Pulay forces. To assess the performance of our GPU implementation, we performed benchmarks on three different architectures using a 103-material test set. We find that operations which rely on dense serial linear algebra show dramatic speedups from GPU acceleration: in particular, SCF iterations including force and stress calculations exhibit speedups ranging from 4.5 to 6.6. For the architectures and problem types investigated here, this translates to an expected overall speedup between 3–4 for the entire calculation (including non-GPU accelerated parts), for problems featuring several tens to hundreds of atoms. Additional calculations for a 375-atom Bi2Se3 bilayer show that the present GPU strategy scales for large-scale distributed-parallel simulations.

42 ENGINEERING↗

SOMAFOAM: An OpenFOAM based solver for continuum simulations of low-temperature plasmas

Here, we report the development of SOMAFOAM, a finite volume framework for performing continuum simulations of low-temperature plasmas. The primary goal of this work is to discuss the features of SOMAFOAM along with representative results provided as examples for a range of operating conditions and geometries. This includes plasma and plasma–dielectric systems operating in direct current, radio frequency, and microwave regimes from pressures as low as 100 mTorr to atmospheric pressure. The code has several useful features including the ability to run massively parallel simulations using arbitrary geometries, structured/unstructured meshes, choice of models such as drift–diffusion/full-momentum at runtime, and species-dependent timesteps to name a few. The verification/validation studies presented include comparison with previously published continuum simulations (low-pressure direct current and radio frequency plasma), with experiments (Gaseous Electronics Conference Reference Cell and microwave microplasma ignited in a split ring resonator), and previously published kinetic simulations (low-pressure radio frequency plasma). Other examples provided include a direct current atmospheric pressure microplasma bounded by dielectric sidewalls and a helium–nitrogen plasma ignited using a needle electrode facing a dielectric. The performance of the code is also discussed with serial and distributed memory parallel runs demonstrated up to 512 cores. The design and implementation of the code in a modular object-oriented framework allows for easy extension and seamless coupling with other codes and can be expected to play an important role in both academia and industry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TUMME: Tsinghua University Minnesota Master Equation program

We report that TUMME is a program for assembling and solving master equations for gas-phase chemical kinetics based on chemically significant eigenmodes. TUMME has interfaces to the Gaussian, Polyrate, and/or MSTor output files that allow the master equation code to obtain the microcanonical flux coefficients needed for the coefficient matrix of the master equation. The flux coefficients for reactions with barriers can be calculated by multi-structural variational transition state theory with small-curvature tunneling (MS-VTST/SCT) or by simpler approximations to this such as conventional transition state theory without tunneling (also called RRKM theory). The flux coefficients for barrierless reactions are provided by a hard-sphere model. TUMME is written in double precision with Python 3; quadruple and octuple precision are also available for some subtasks in C++. The Python code can run in serial or parallel (MP or MPI), and the C++ code can run on a single processor or on multiple processors with OpenMP.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An extension to V ORO ++ for multithreaded computation of Voronoi cells

V ORO ++ is a software library written in C++ for computing the Voronoi tessellation, a technique in computational geometry that is widely used for analyzing systems of particles. V ORO ++ was released in 2009 and is based on computing the Voronoi cell for each particle individually. Here, we take advantage of modern computer hardware, and extend the original serial version to allow for multithreaded computation of Voronoi cells via the OpenMP application programming interface. We test the performance of the code, and demonstrate that it can achieve parallel efficiencies greater than 95% in many cases. Further, the multithreaded extension follows standard OpenMP programming paradigms, allowing it to be incorporated into other programs. We provide an example of this using the VoroTop software library, performing a multithreaded Voronoi cell topology analysis of up to 102.4 million particles.

97 MATHEMATICS AND COMPUTING↗

School dismissal as a pandemic influenza response: When, where and for how long?

We used individual-based computer simulation models at community, regional and national levels to evaluate the likely impact of coordinated pre-emptive school dismissal policies during an influenza pandemic. Such policies involve three key decisions: when, over what geographical scale, and how long to keep schools closed. Our evaluation includes uncertainty and sensitivity analyses, as well as model output uncertainties arising from variability in serial intervals and presumed modifications of social contacts during school dismissal periods. During the period before vaccines become widely available, school dismissals are particularly effective in delaying the epidemic peak, typically by 4–6 days for each additional week of dismissal. Assuming the surveillance is able to correctly and promptly diagnose at least 5–10% of symptomatic individuals within the jurisdiction, dismissals at the city or county level yield the greatest reduction in disease incidence for a given dismissal duration for all but the most severe pandemic scenarios considered here. Broader (multi-county) dismissals should be considered for the most severe and fast-spreading (1918-like) pandemics, in which multi-month closures may be necessary to delay the epidemic peak sufficiently to allow for vaccines to be implemented.

59 BASIC BIOLOGICAL SCIENCES↗