Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational graph”

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 775 records · Page 43

Computational Workflow for Accelerated Molecular Design Using Quantum Chemical Simulations and Deep Learning Models

Efficient methods for searching the chemical space of molecular compounds are needed to automate and accelerate the design of new functional molecules such as pharmaceuticals. Given the high cost in both resources and time for experimental efforts, computational approaches play a key role in guiding the selection of promising molecules for further investigation. Here, we construct a workflow to accelerate design by combining approximate quantum chemical methods [i.e. density-functional tight-binding (DFTB)], a graph convolutional neural network (GCNN) surrogate model for chemical property prediction, and a masked language model (MLM) for molecule generation. Property data from the DFTB calculations are used to train the surrogate model; the surrogate model is used to score candidates generated by the MLM. The surrogate reduces computation time by orders of magnitude compared to the DFTB calculations, enabling an increased search of chemical space. Furthermore, the MLM generates a diverse set of chemical modifications based on pre-training from a large compound library. We utilize the workflow to search for near-infrared photoactive molecules by minimizing the predicted HOMO-LUMO gap as the target property. Our results show that the workflow can generate optimized molecules outside of the original training set, which suggests that iterations of the workflow could be useful for searching vast chemical spaces in a wide range of design problems.

Blanchard, Andrew↗

Large-Scale Parallel Viscous Flow Computations using an Unstructured Multigrid Algorithm

The development and testing of a parallel unstructured agglomeration multigrid algorithm for steady-state aerodynamic flows is discussed. The agglomeration multigrid strategy uses a graph algorithm to construct the coarse multigrid levels from the given fine grid, similar to an algebraic multigrid approach, but operates directly on the non-linear system using the FAS (Full Approximation Scheme) approach. The scalability and convergence rate of the multigrid algorithm are examined on the SGI Origin 2000 and the Cray T3E. An argument is given which indicates that the asymptotic scalability of the multigrid algorithm should be similar to that of its underlying single grid smoothing scheme. For medium size problems involving several million grid points, near perfect scalability is obtained for the single grid algorithm, while only a slight drop-off in parallel efficiency is observed for the multigrid V- and W-cycles, using up to 128 processors on the SGI Origin 2000, and up to 512 processors on the Cray T3E. For a large problem using 25 million grid points, good scalability is observed for the multigrid algorithm using up to 1450 processors on a Cray T3E, even when the coarsest grid level contains fewer points than the total number of processors.

Mavriplis, Dimitri J.↗

Graph theory approach to determine configurations of multidentate and high coverage adsorbates for heterogeneous catalysis

Abstract Heterogeneous catalysts constitute a crucial component of many industrial processes, and to gain an understanding of the atomic-scale features of such catalysts, ab initio density functional theory is widely employed. Recently, growing computational power has permitted the extension of such studies to complex reaction networks involving either high adsorbate coverages or multidentate adsorbates, which bind to the surface through multiple atoms. Describing all possible adsorbate configurations for such systems, however, is often not possible based on chemical intuition alone. To systematically treat such complexities, we present a generalized Python-based graph theory approach to convert atomic scale models into undirected graph representations. These representations, when combined with workflows such as evolutionary algorithms, can systematically generate high coverage adsorbate models and classify unique minimum energy multidentate adsorbate configurations for surfaces of low symmetry, including multi-elemental alloy surfaces, steps, and kinks. Two case studies are presented which demonstrate these capabilities; first, an analysis of a coverage-dependent phase diagram of absorbate NO on the Pt 3 Sn(111) terrace surface, and second, an investigation of adsorption energies, together with identifying unique minimum energy configurations, for the reaction intermediate propyne (CHCCH 3 *) adsorbed on a PdIn(021) step surface. The evolutionary algorithm approach reproduces high coverage configurations of NO on Pt 3 Sn(111) using only 15% of the number of simulations required for a brute force approach. Furthermore, the screening of potentially hundreds of multidentate adsorbates is shown to be possible without human intervention. The strategy presented is quite general and can be applied to a spectrum of complex atomic systems.

36 MATERIALS SCIENCE↗

Structure-aware graph neural network based deep transfer learning framework for enhanced predictive analytics on diverse materials datasets

Abstract Modern data mining methods have demonstrated effectiveness in comprehending and predicting materials properties. An essential component in the process of materials discovery is to know which material(s) will possess desirable properties. For many materials properties, performing experiments and density functional theory computations are costly and time-consuming. Hence, it is challenging to build accurate predictive models for such properties using conventional data mining methods due to the small amount of available data. Here we present a framework for materials property prediction tasks using structure information that leverages graph neural network-based architecture along with deep-transfer-learning techniques to drastically improve the model’s predictive ability on diverse materials (3D/2D, inorganic/organic, computational/experimental) data. We evaluated the proposed framework in cross-property and cross-materials class scenarios using 115 datasets to find that transfer learning models outperform the models trained from scratch in 104 cases, i.e., ≈90%, with additional benefits in performance for extrapolation problems. We believe the proposed framework can be widely useful in accelerating materials discovery in materials science.

Chemistry↗

Quantum Simulations of Radiation Damage in a Molecular Polyethylene Analog

Abstract An atomic‐level understanding of radiation‐induced damage in simple polymers like polyethylene is essential for determining how these chemical changes can alter the physical and mechanical properties of important technological materials such as plastics. Ensembles of quantum simulations of radiation damage in a polyethylene analog are performed using the Density Functional Tight Binding method to help bind its radiolysis and subsequent degradation as a function of radiation dose. Chemical degradation products are categorized with a graph theory approach, and occurrence rates of unsaturated carbon bond formation, crosslinking, cycle formation, chain scission reactions, and out‐gassing products are computed. Statistical correlations between product pairs show significant correlations between chain scission reactions, unsaturated carbon bond formation, and out‐gassing products, though these correlations decrease with increasing atom recoil energy. The results present relatively simple chemical descriptors as possible indications of network rearrangements in the middle range of excitation energies. Ultimately, the work provides a computational framework for determining the coupling between nonequilibrium chemistry in polymers and potential changes to macro‐scale properties that can aid in the interpretation of future radiation damage experiments on plastic materials.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

A Theoretical Approach for Reliability Within Information Supply Chains With Cycles and Negations

Complex networks of information processing systems, or information supply chains, present challenges for performance analysis. Here, we establish a mathematical setting, in which a process within an information supply chain can be analyzed in terms of the functionality of the system’s components. Principles of this methodology are rigorously defended and induce a model for determining the reliability for the various products in these networks. Our model does not limit us from having cycles in the network, as long as the cycles do not contain negation. It is shown that our approach to reliability resolves the nonuniqueness caused by cycles in a probabilistic Boolean network. An iterative algorithm is given to find the reliability values of the model, using a process that can be fully automated. This automated method of discerning reliability is beneficial for systems managers. As a systems manager considers systems modification, such as the replacement of owned and maintained hardware systems with cloud computing resources, the need for comparative analysis of system reliability is paramount. The model is extended to handle conditional knowledge about the network, allowing one to make predictions of weaknesses in the system. Finally, to illustrate the model’s flexibility over different forms, it is demonstrated on a system of components and subcomponents.

97 MATHEMATICS AND COMPUTING↗

"Russians in the Grid" Enrichment Process

Threat intelligence sources are numerous, and the quality of their intelligence is equally variable. The need for quality, actionable, and shareable intelligence is becoming increasingly important as cyber-threats continue to increase. In this paper, we describe the process we used to enrich U.S. CERT’s Technical Alert entitled “Russian Government Cyber-Activity Targeting Energy and Other Critical Infrastructure Sectors,” affectionately referred to as “Russians In the Grid,” from a series of separate but related reports to a final, actionable, unified Structured Threat Information Expression (STIX) v2 representation of the report. In the process, we detail the tools and procedures we used, some of which are automated and others highly manual. We identify some of the limitations of current STIX enrichment tools and techniques, and propose enhancements to allow for more effective enrichment and better overall threat intelligence to be used for more effective threat data-sharing, as well as machine learning-based predictive threat work being conducted at Idaho National Laboratory.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Seal Strength Calculations for Low Mass DDT Vessel

Lawrence Livermore National Laboratory (LLNL) is collaborating with Colorado School of Mines (Mines), to field the first dynamic experiments on the 3-ring flash radiography system (3-ring). One set of experiments for 3-ring concerns the deflagration to detonation transition (DDT), within a sealed column of high-explosives. The high-explosive material is ignited at one end with a BK-80, an igniter made from Boron Potassium-Nitrate (BKNO 3 ). The initial deflagration reaction will increase the pressure in the sealed vessel, resulting in the formation of a dense "plug" of material ahead of the deflagration front. The transition to detonation is thought to be related to the plug formation. Previous experiments have been able to resolve the plug geometry, but only in a two dimensional radio-graph. 3-ring offers a novel diagnostic tool which could provide three dimensional density fields via few-view reconstruction algorithms and computed tomography.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Artificial Intelligence/Machine Learning Technology in Power System Applications

The primary purpose of this report is to provide an overview of the advancement in artificial intelligence and machine learning (AI/ML) technologies and their applications in power systems. It offers a foundation for understanding the transformative role of AI/ML in power systems and aims to stimulate further research and development in this area. This report begins with a historical perspective of AI/ML technologies, then explores their advancement to today’s prominence. The document highlights key contributors to the success of AI/ML technologies, including increased computational power, greater data availability, innovative algorithms, and advanced tools. It further introduces various AI/ML techniques, including supervised, unsupervised and reinforcement learning, graph neural networks, and generative AI. It also emphasizes the critical importance of ensuring the safety, security, and trustworthiness of these AI/ML techniques within this sector. The report reviews the recent representative advancements in various power system applications enhanced by AI/ML techniques, underscoring key developments and their transformative impact as evidenced by numerous studies. It also explores both the opportunities and challenges associated with the application of AI/ML technologies to improve power system applications. While the report extensively covers AI/ML applications in power systems, focusing primarily on the technical and operational aspects, it may not thoroughly explore the sociopolitical, economic, and broader regulatory implications of AI/ML integration in power systems. AI/ML techniques hold significant potential for enhancing power system applications; however, they are not omnipotent. It is crucial to acknowledge their limitations and understand that they may not be able to address all challenges in the power system domain. Various factors must be considered that influence the implementation, adoption, and effectiveness of AI/ML solutions, including but not limited to safety, security, transparency, and trustworthiness. Additionally, the incorporation of advanced human–machine interfaces is essential, as it enables humans to validate the effectiveness of AI/ML solutions while remaining actively engaged, fostering trust in AI/ML deployment. Finally, the report summarizes AI/ML research activities supported by the Department of Energy (DOE) Office of Electricity (OE) through the Advanced Grid Modeling (AGM) program. The work aligns with the interests and mission of DOE-OE AGM, with the report serving as a resource for identifying existing progress and for pinpointing future applications within AI/ML that need further exploration and support.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A survey of compiler optimization techniques

Major optimization techniques of compilers are described and grouped into three categories: machine dependent, architecture dependent, and architecture independent. Machine-dependent optimizations tend to be local and are performed upon short spans of generated code by using particular properties of an instruction set to reduce the time or space required by a program. Architecture-dependent optimizations are global and are performed while generating code. These optimizations consider the structure of a computer, but not its detailed instruction set. Architecture independent optimizations are also global but are based on analysis of the program flow graph and the dependencies among statements of source program. A conceptual review of a universal optimizer that performs architecture-independent optimizations at source-code level is also presented.

Schneck, P. B.↗

Comparison of Three Multicylinder Icing Meters and Critique of Multicylinder Method

Three multicylinder cloud meters, fundamentally similar but differing in important details, were compared in use at the Mount Washington Observatory. Determinations of liquid water content were found to agree within the limits of the probable error, but the two instruments designed by the National Advisory Committee for Aeronautics indicated larger drop sizes than did the Observatory's instrument, apparently because of spurious ice catch on the rather rough surface of the larger cylinders. Comparisons of drop-size distribution were largely indeterminate., In a critique of the method, the probable error of determination of liquid water content was found to be +/-8 percent; of drop size, +/-6 percent; and of drop-size distribution, about +/-0.7 unit of the modulus of distribution. Of the systematic errors, run-off of unfrozen water is most important, blow-off and erosion seldom being hampering. Revision of collection-efficiency computations for cylinders in clouds with distributed drop sizes was found necessary and also revision of one of the correction-factor graphs heretofore used. The assumption of constant ice density in deriving cylinder size was found to be permissible for cylinders 1 inch or more in diameter.

Howell, Wallace E.↗

Prediction of tip vortex self-induced motion parameters in terms of rotor blade loading

The self-induced motion of curved vortex filaments at the tip of a helicopter rotor blade is investigated analytically. The derivation of a method for inviscid roll-up (IRU) is presented in detail, with attention to the cutoff-distance reformulation of the problem, a control-volume analysis of the self-induction properties of the vortex core, the adaptation of the roll-up method of Betz (1932) to IRU in three dimensions, the treatment of linear and elliptic loading, vortices with turbulent central cores, and the effect of cutoff distance on helicopter free-wake computations. Numerical results showing the significant effect of core properties on the geometry of a rotor wake in hover are presented in graphs and briefly characterized.

Bliss, Donald B.↗

A new technique in the global reliability of cyclic communications network

The global reliability of a communications network is the probability that given any pair of nodes, there exists a viable path between them. A characterization of connectivity, for a given class of networks, can enable one to find this reliability. Such a characterization is described for a useful class of undirected networks called daisy-chained or braided networks. This leads to a new method of quickly computing the global reliability of these networks. Asymptotic behavior in terms of component reliability is related to geometric properties of the given graph. Generalization of the technique is discussed.

Sjogren, Jon A.↗

Program Computes Receiver Gain And Noise Profiles

RCVRPROF computer program is computer-aided-design (CAD) software tool useful in analysis and design of communication receivers and downconverters. Provides customized spreadsheet with formulas and graphs providing detailed description of performance of receiver. Such performance parameters as noise temperature, gain, noise power, noise spectral density, and dynamic range analyzed for contribution of each to overall performance of receiver.

Mcwatters, Dalia↗

Quantum-accelerated Global Constraint Filtering

Motivated by recent advances in quantum algorithms and gate-model quantum computation, we introduce quantum-accelerated filtering algorithms for global constraints in constraint programming. We adapt recent work in quantum algorithms for graph problems and identify quantum subroutines that accelerate the main domain consistency algorithms for the all different constraint and the global cardinality constraint (gcc). The subroutines are based on quantum algorithms for finding maximum matchings and strongly connected components in graphs, and provide speedups over the best classical algorithms. We detail both complete and bounded-probability frameworks for quantum-accelerated global constraint filtering algorithms within backtracking search.

Quantum algorithms↗

System and method for reasoning about the optimality of a configuration parameter of a distributed system

Embodiments provide a system and method for reasoning about the optimality of a configuration parameter of a distributed system. During operation, the system obtains a multi-layer graph for a system with a plurality of components, wherein the multi-layer graph comprises a configuration subgraph, a vulnerability subgraph, and a dependency subgraph. The system determines, based on the multi-layer graph, constraint relationships associated with configuration parameters for the components, wherein the constraint relationships include security constraints and functionality constraints. The system computes an unsatisfiable core which comprises a set of mutually incompatible constraints. The system resolves, based on a strategy and over multiple iterations, the unsatisfiable core by analyzing one pair of mutually incompatible constraints per a respective iteration, to obtain a new unsatisfiable core which comprises a smaller number of mutually incompatible constraints than the computed unsatisfiable core or a previously computed unsatisfiable core from a most recent iteration.

Soroush, Hamed↗