An embedded Python model interpreter for Xyce TM (Xyce-PyMi)
This is the documentation for the Xyce-PyMi embedded Python model interpreter in Xyce.
97 MATHEMATICS AND COMPUTING↗
SEARCH · Engineering Papers
Results for “Embedded computing”
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.
Explicit quantification of residence and flushing times in the Salish Sea using a sub-basin scale shoreline resolving model
The Salish Sea, located in the Pacific Northwest region of North America has complex currents and circulation features distributed over numerous interconnected deep basins with islands. Increased risk of exposure to oil spills and untreated wastewater from maritime emergencies and treatment plant failures have led to a need for quantifying residence and flushing characteristics at a sub-basin scale using a shoreline resolving hydrodynamic model. An unstructured grid model of the Salish Sea was developed using FVCOM with a ≈75-100m shoreline resolution. In addition to 7 tides and 23 salinity and temperature monitoring stations, an extensive currents data set from 135 stations collected over a span of three years was used for skill assessment and validation. Explicit forward computations were then conducted to define and quantify residence and flushing times in various sub-basins of interest using (a) Lagrangian particles and (b) Numerical/virtual dye experiments. The results in most basins show expected seasonal variability with longer flushing time associated with summer lower tides and lower freshwater inflows. However, contrary to expectation, flushing time is significantly longer in wintertime in large fjord-like basins such as Hood Canal (≈138 days), likely due to increased stratification and reduced mixing. The flushing time for the Puget Sound region of the Salish Sea is ≈115 days, while Georgia Basin is 240 days when analyzed as stand-alone basins with zero background concentrations. When examined as part of the flushing of the entire Puget Sound filled with virtual dye, the compounded flushing times for embedded sub-basins can be significantly longer in order of magnitudes and largely dictated by the flushing time of Puget Sound. The computed residence and flushing time scales tabulated over 36 sub-basins provide an improved understanding of water renewal in the system, informing pollution management actions.
54 ENVIRONMENTAL SCIENCES↗
Metal-to-Ligand Charge-Transfer Spectrum of a Ru-Bipyridine-Sensitized TiO 2 Cluster from Embedded Multiconfigurational Excited-State Theory
Understanding optical properties of the dye molecule in dye-sensitized solar cells (DSSCs) from first-principles quantum mechanics can contribute to improving the efficiency of such devices. While density functional theory (DFT) and time-dependent DFT have been pivotal in simulating optoelectronic properties of photoanodes used in DSSCs at the atomic scale, questions remain regarding DFT’s adequacy and accuracy to furnish critical information needed to understand the various excited-state processes involved. In this work, we simulate the absorption spectra of a dye-sensitized solar cell analogue, comprised of a Ru-bipyridine (Ru-bpy) dye molecule and a small TiO2 cluster via DFT and via an accurate embedded correlated wavefunction (CW) theory. We generated CW spectra for the adsorbed Ru-bpy dye via a recently introduced capped density functional embedding theory or capped-DFET (to generate the embedding potential that accounts for the interaction of the molecule and the TiO 2 cluster). We then combined capped-DFET with the accurate but expensive multiconfigurational complete active space second-order perturbation theory (CASPT2)—embedded CASPT2. Because the CW theory is conducted on only a portion of the total system in the presence of an embedding potential that describes that portion’s interaction with its environment, we efficiently obtain CW-quality predictions that reflect local properties of the entire system. Specifically, for example, with capped-DFET and embedded CW theory, we can simulate accurately a plethora of metal-to-ligand charge-transfer excited properties at a manageable computational cost. Here, we predict detailed electronic spectra within the visible region, featuring the lowest three singlet and triplet excited states, along with predictions of the singlets’ lifetimes. We illustrated these results using a Jablonski diagram that show the relative energy position of the singlet and longer-lived triplet excited states and analyzed and proposed relaxation paths for the excited state corresponding to the most intense but short-lived absorption (interconversion, intersystem crossing, fluorescence, and phosphorescence) that may lead to longer-lived excited states necessary for efficient charge separation required to generate current in solar cells.
14 SOLAR ENERGY↗
Advanced Visualization for Scientific Data Analysis and Insight [Slides]
This talk will explore how we have used advanced visualization technologies to support analytical reasoning and knowledge discovery. Specifically, we will present several examples detailing some recent scientific successes using state-of-the-art immersive and high-resolution visualization at the National Renewable Energy Laboratory's Computational Science Center. On multiple occasions, we have observed scientists and engineers discover features in their data using advanced visualization technologies that they had not seen in prior investigations of their data on traditional desktop displays. We have embedded more information into our analytics tools, allowing engineers to explore complex multivariate spaces. We have observed how interactions seem to catalyze understanding.
97 MATHEMATICS AND COMPUTING↗
CRISPR-COPIES: Web Tool
CRISPR/Cas system has emerged as a powerful genome-editing tool for metabolic engineering and human gene therapy. However, the conundrum of where to integrate heterologous genes on the chromosome using the CRISPR/Cas system remains an open question. Selecting a site for gene integration requires incorporation of complex criteria such as factors involved in CRISPR/Cas-mediated integration, genetic stability, and gene expression and therefore, usually requires strenuous characterization of sites on particular or different chromosomal locations. To address these issues, we developed CRISPR-COPIES, a COmputational Pipeline for the Identification of CRISPR/Cas-facilitated intEgration Sites. The tool applies ScaNN, a state-of-the-art model on the embedding-based nearest neighbor search for fast and accurate off-target search and can identify genome-wide intergenic sites for most bacterial and fungal genomes within minutes. This submission contains the code we developed to create a user-friendly web interface for CRISPR-COPIES (https://biofoundry.web.illinois.edu/copies/). We anticipate CRISPR-COPIES will serve as a useful tool for targeted DNA integration and aid in the characterization of synthetic biology toolkits, rapid strain construction to produce valuable biochemicals, and human gene and cell therapy.
Bioinformatics↗
Electronically Modified Atomic Sites Within a Multicomponent Co/Cu Composite for Efficient Oxygen El
Explore the source record for details and available documents.
Zhang, Qingran↗
Specificity determinants revealed by the structure of glycosyltransferase Campylobacter concisus PglA
Abstract In selected Campylobacter species, the biosynthesis of N‐linked glycoconjugates via the pgl pathway is essential for pathogenicity and survival. However, most of the membrane‐associated GT‐B fold glycosyltransferases responsible for diversifying glycans in this pathway have not been structurally characterized which hinders the understanding of the structural factors that govern substrate specificity and prediction of resulting glycan composition. Herein, we report the 1.8 Å resolution structure of Campylobacter concisus PglA, the glycosyltransferase responsible for the transfer of N ‐acetylgalatosamine (GalNAc) from uridine 5′‐diphospho‐ N ‐acetylgalactosamine (UDP‐GalNAc) to undecaprenyl‐diphospho‐ N , N ′‐diacetylbacillosamine (UndPP‐diNAcBac) in complex with the sugar donor GalNAc. This study identifies distinguishing characteristics that set PglA apart within the GT4 enzyme family. Computational docking of the structure in the membrane in comparison to homologs points to differences in interactions with the membrane‐embedded acceptor and the structural analysis of the complex together with bioinformatics and site‐directed mutagenesis identifies donor sugar binding motifs. Notably, E113, conserved solely among PglA enzymes, forms a hydrogen bond with the GalNAc C6″‐OH. Mutagenesis of E113 reveals activity consistent with this role in substrate binding, rather than stabilization of the oxocarbenium ion transition state, a function sometimes ascribed to the corresponding residue in GT4 homologs. The bioinformatic analyses reveal a substrate‐specificity motif, showing that Pro281 in a substrate binding loop of PglA directs configurational preference for GalNAc over GlcNAc. This proline is replaced by a conformationally flexible glycine, even in distant homologs, which favor substrates with the same stereochemistry at C4, such as glucose. The signature loop is conserved across all Campylobacter PglA enzymes, emphasizing its importance in substrate specificity.
Vuksanovic, Nemanja↗
Combining machine-learned and empirical force fields with the parareal algorithm: application to the diffusion of atomistic defects
We numerically investigate an adaptive version of the parareal algorithm in the context of molecular dynamics. This adaptive variant has been originally introduced in [1]. We focus here on test cases of physical interest where the dynamics of the system is modelled by the Langevin equation and is simulated using the molecular dynamics software LAMMPS. In this work, the parareal algorithm uses a family of machine-learning spectral neighbor analysis potentials (SNAP) as fine, reference, potentials and embedded-atom method potentials (EAM) as coarse potentials. We consider a self-interstitial atom in a tungsten lattice and compute the average residence time of the system in metastable states. Our numerical results demonstrate significant computational gains using the adaptive parareal algorithm in comparison to a sequential integration of the Langevin dynamics. We also identify a large regime of numerical parameters for which statistical accuracy is reached without being a consequence of trajectorial accuracy.
36 MATERIALS SCIENCE↗
Realization of the Werner-Holevo and Landau-Streater Quantum Channels for Qutrits on Quantum Computers.
We realize the Landau-Streater (LS) and Werner-Holevo (WH) quantum channels for qutrits on IBM quantum computers. These channels correspond to the interaction between a qutrit and its environment that results in the globally unitarily covariant qutrit transformation violating the multiplicativity of the maximal p-norm. Our realization of the LS and WH channels is based on embedding the qutrit states into states of two qubits and using the single-qubit and two-qubit CNOT gates to implement the specific interaction. We employ the standard quantum gates, hence the developed algorithm suits any quantum computer. We run our algorithm on a 5-qubit computer and a 20-qubit computer, as well as on a simulator. We quantify the quality of the implemented channels comparing their action on different input states with theoretical predictions. The overall efficiency is quantified by the fidelity between the theoretical and experimental Choi states implemented on the 20-qubit computer.
completely-positive trace-preserving map↗
A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems
Constructing surrogate models for uncertainty quantification (UQ) on complex partial differential equations (PDEs) having inherently high-dimensional O(10 n ), n ≥ 2, stochastic inputs (e.g., forcing terms, boundary conditions, initial conditions) poses tremendous challenges. The “curse of dimensionality” can be addressed with suitable unsupervised learning techniques used as a pre-processing tool to encode inputs onto lower-dimensional subspaces while retaining its structural information and meaningful properties. In this work, we review and investigate thirteen dimension reduction methods including linear and nonlinear, spectral, blind source separation, convex and non-convex methods and utilize the resulting embeddings to construct a mapping to quantities of interest via polynomial chaos expansions (PCE). Here, we refer to the general proposed approach as manifold PCE (m-PCE), where manifold corresponds to the latent space resulting from any of the studied dimension reduction methods. To investigate the capabilities and limitations of these methods we conduct numerical tests for three physics-based systems (treated as black-boxes) having high-dimensional stochastic inputs of varying complexity modeled as both Gaussian and non-Gaussian random fields to investigate the effect of the intrinsic dimensionality of input data. We demonstrate both the advantages and limitations of the unsupervised learning methods and we conclude that a suitable m-PCE model provides a cost-effective approach compared to alternative algorithms proposed in the literature, including recently proposed expensive deep neural network-based surrogates and can be readily applied for high-dimensional UQ in stochastic PDEs.
42 ENGINEERING↗
Position Papers for the ASCR Workshop on Reimagining Codesign
On behalf of the Advanced Scientific Computing Research (ASCR) program in the US Department of Energy (DOE) Office of Science, we are organizing a Workshop on Reimagining Codesign (ReCoDe). Codesign is the process of jointly designing interoperating components of a computing system—in particular: applications, algorithms, system software, programming models, and the hardware on which they run. The goal is to maximize the overall performance, efficiency, and other desirable qualities of the system as a whole. Codesign is a standard methodology in the embedded-systems community, where space, power, and cost constraints are commonly pitted against execution speed for a tightly constrained feature set. Over the last decade, the DOE has invested in codesign efforts to foster the development of exascale computing systems for broad classes of scientific and engineering applications. The ReCoDe workshop hopes to explore how scientific applications of interest to the DOE can be accelerated through close interactions with hardware designers and software-stack developers, in which all components adapt to each other’s requirements and constraints. We want to answer the question of what are the key tools and methodologies for accomplishing codesign in today’s computing landscape, and what will be the highest impact targets for meeting DOE’s emerging mission requirements. This workshop aims to bring together DOE, industry, and academia to identify opportunities to build on past codesign successes and identify new areas that are either emerging or that may need reimagining for the future. We want to continue to find opportunities that can be pursued as a joint effort and continue to break down the traditional customer/vendor dichotomy with true partnerships. From this work, DOE will benefit from increased application performance relative to what stock hardware or existing general-purpose roadmaps can provide, and vendors will benefit from expanding their hardware’s capabilities to address needs they might have not otherwise anticipated and thereby create more widespread interest in their products. The workshop will be structured around a set of breakout sessions, with every attendee expected to participate actively in the discussions. Afterward, workshop attendees—from DOE, industry, and academia—will produce a report for ASCR that summarizes the findings made during the workshop.
97 MATHEMATICS AND COMPUTING↗
GrAMME: Semisupervised Learning Using Multilayered Graph Attention Models
Modern data analysis pipelines are becoming increasingly complex due to the presence of multiview information sources. While graphs are effective in modeling complex relationships, in many scenarios, a single graph is rarely sufficient to succinctly represent all interactions, and hence, multilayered graphs have become popular. Though this leads to richer representations, extending solutions from the single-graph case is not straightforward. Consequently, there is a strong need for novel solutions to solve classical problems, such as node classification, in the multilayered case. In this article, we consider the problem of semisupervised learning with multilayered graphs. Though deep network embeddings, e.g., DeepWalk, are widely adopted for community discovery, we argue that feature learning with random node attributes, using graph neural networks, can be more effective. To this end, we propose to use attention models for effective feature learning and develop two novel architectures, GrAMME-SG and GrAMME-Fusion, that exploit the interlayer dependences for building multilayered graph embeddings. Using empirical studies on several benchmark data sets, we evaluate the proposed approaches and demonstrate significant performance improvements in comparison with the state-of-the-art network embedding strategies. The results also show that using simple random features is an effective choice, even in cases where explicit node attributes are not available.
97 MATHEMATICS AND COMPUTING↗
Optimal sensor network design for multi-scale, time-varying differential algebraic equation systems: Application to an entrained-flow gasifier refractory brick
An algorithm for optimal sensor network design for multi-scale, time-varying differential algebraic equation systems with non-separable dynamics is presented. As the process is time-varying, an integral normalized posterior error covariance of a multi-scale filter is minimized to obtain the optimal sensor locations. For reducing the computational cost, an adaptive sampling rate approach is considered for the slowly-varying variables. The algorithm is applied to a smart refractory brick with embedded sensors as part of an entrained-flow gasifier. Thermistors and interdigital capacitors are considered as candidate measurement technologies for estimating temperature and slag penetration profile along the gasifier wall. Finally, when the optimal set of sensors obtained from the algorithm is used for estimating temperature and slag penetration profiles in a multi-scale Kalman filter framework, satisfactory estimates are obtained despite high measurement noise and model mismatch.
42 ENGINEERING↗
Finite deformation implementation of a mixed-mode single-integral type cohesive zone with reorienting surfaces of separation
To model material ductile failure and crack propagation, cohesive zone elements can be embedded along potential fracture paths in a finite element simulation. When damage criteria are met, elements in the mesh decohere, simulating the formation and propagation of a crack. In this paper, we present a novel computational algorithm based on finite deformation theory, essential to modeling crack initiation and growth in solids undergoing large deformations. This new algorithm was formulated within a Lagrangian frame of reference to extend previous cohesive zone algorithms to include modeling crack growth in finite deformation contexts. The local coordinate system, necessary for defining an embedded cohesive zone, is constructed based upon the current configuration and is updated within the nonlinear iteration process, thereby resulting in the convergence of the solution for a growing crack in a large deformation quasi-static setting. The model’s accuracy was demonstrated by comparing finite element model simulation results with the analytic case of a constant surface separation, as shown in the verification examples. The power and efficacy of the algorithm to capture large deformations during crack growth were then demonstrated with a double cantilever beam example case. It indicates that the model can be applied to a variety of physical circumstances for predicting crack initiation and growth with delamination and fracture.
42 ENGINEERING↗
CRISPR-COPIES: an in silico platform for discovery of neutral integration sites for CRISPR/Cas-facilitated gene integration
Abstract The CRISPR/Cas system has emerged as a powerful tool for genome editing in metabolic engineering and human gene therapy. However, locating the optimal site on the chromosome to integrate heterologous genes using the CRISPR/Cas system remains an open question. Selecting a suitable site for gene integration involves considering multiple complex criteria, including factors related to CRISPR/Cas-mediated integration, genetic stability, and gene expression. Consequently, identifying such sites on specific or different chromosomal locations typically requires extensive characterization efforts. To address these challenges, we have developed CRISPR-COPIES, a COmputational Pipeline for the Identification of CRISPR/Cas-facilitated intEgration Sites. This tool leverages ScaNN, a state-of-the-art model on the embedding-based nearest neighbor search for fast and accurate off-target search, and can identify genome-wide intergenic sites for most bacterial and fungal genomes within minutes. As a proof of concept, we utilized CRISPR-COPIES to characterize neutral integration sites in three diverse species: Saccharomyces cerevisiae, Cupriavidus necator, and HEK293T cells. In addition, we developed a user-friendly web interface for CRISPR-COPIES (https://biofoundry.web.illinois.edu/copies/). We anticipate that CRISPR-COPIES will serve as a valuable tool for targeted DNA integration and aid in the characterization of synthetic biology toolkits, enable rapid strain construction to produce valuable biochemicals, and support human gene and cell therapy applications.
59 BASIC BIOLOGICAL SCIENCES↗
Really Embedding Domain-Specific Languages into C++
The following topics are dealt with: program compilers; optimising compilers; parallel processing; software engineering; learning (artificial intelligence); multiprocessing systems; shared memory systems; optimisation; computational complexity; specification languages.
Finkel, Hal J.↗
Coupling SCALE with DAKOTA for Axial Burnup Profiles Assessment in Burnup Credit
This paper presents a computational study that demonstrates the application of the SCALE code system in conjunction with the Design Analysis Kit for Optimization and Terascale Applications (DAKOTA) for the analysis of key factors influencing the evaluation of burnup credit (BUC) in pressurized water reactors (PWRs). The primary objective of this analysis is to characterize the model by utilizing parameterization, uncertainty quantification, and optimization studies. Using this approach, we can comprehensively assess the system and conduct informed predictive studies. This study highlights the effectiveness of the SCALE code system integrated within the DAKOTA framework in terms of efficiency and capability. With the coupling of the burnup code ORIGAMI with the CSAS or TSUNAMI-3D sequence embedded in a DAKOTA analysis, we can characterize the factors that influence the k eff of PWR 17x17 spent nuclear fuel (SNF) in the GBC-32 computational benchmark cask for the assessment of BUC in criticality safety analysis. The coupling methodology used in this study is not exclusive to BUC analysis. However, the choice to apply this methodology to the BUC problem is particularly significant because of the diverse range of aspects it encompasses in nuclear criticality safety analyses. This problem presents a unique opportunity to explore and address multiple facets of such analyses related to BUC and illustrates the capability of the SCALE code system with DAKOTA. This analysis makes use of historical reference data for the axial burnup profile, where the entire space within the bounds is considered. Both SCALE and DAKOTA are currently integrated in the Nuclear Energy Advanced Modeling Simulation (NEAMS) Workbench code system, which has a user-friendly graphical interface that simplifies the setup of simulations and configuration of input parameters as well as the visualization of simulation results.
21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
VeloxChem: A Python-driven density-functional theory program for spectroscopy simulations in high-performance computing environments
An open-source program named VeloxChem has been developed for the calculation of electronic real and complex linear response functions at the levels of Hartree–Fock and Kohn–Sham density functional theories. With an object-oriented program structure written in a Python/C++ layered fashion, VeloxChem enables time-efficient prototyping of novel scientific approaches without sacrificing computational efficiency, so that molecular systems involving up to and beyond 500 second-row atoms (or some 10,000 contracted and in part diffuse Gaussian basis functions) can be routinely addressed. In addition, VeloxChem is equipped with a polarizable embedding scheme for the treatment of the classical electrostatic interactions with an environment that in turn is modeled by atomic site charges and polarizabilities. The underlying hybrid message passing interface (MPI)/open multiprocessing (OpenMP) parallelization scheme makes VeloxChem suitable for execution in high-performance computing cluster environments, showing even slightly beyond linear scaling for the Fock matrix construction with use of up to 16,384 central processing unit (CPU) cores. An efficient—with respect to convergence rate and overall computational cost—multifrequency/gradient complex linear response equation solver enables calculations not only of conventional spectra, such as visible/ultraviolet/X-ray electronic absorption and circular dichroism spectra, but also time-resolved linear response signals as due to ultra-short weak laser pulses.
97 MATHEMATICS AND COMPUTING↗