Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computing,OTHER”

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 955 records · Page 53

Computation of neutron fluxes in clusters of fuel pins arranged in hexagonal assemblies (2D and 3D)

For computations of fluxes, we have used Carvik's method of collision probabilities. This method requires tracking algorithms. An algorithm to compute tracks (in 2D and 3D) has been developed for seven hexagonal geometries with cluster of fuel pins. This has been implemented in the NXT module of the code DRAGON. The flux distribution in cluster of pins has been computed by using this code. For testing the results, they are compared when possible with the EXCELT module of the code DRAGON. Tracks are plotted in the NXT module by using MATLAB, these plots are also presented here. Results are presented with increasing number of lines to show the convergence of these results. We have numerically computed volumes, surface areas and the percentage errors in these computations. These results show that 2D results converge faster than 3D results. The accuracy on the computation of fluxes up to second decimal is achieved with fewer lines. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Development of a series of Korean pediatric and adult head computational phantoms and application to nuclear medicine dosimetry - Paper 26

Over the past decades, advances in Single Photon Emission Computed Tomography (SPECT) and Positron Emission Tomography (PET) imaging techniques and an increasing number of new radiopharmaceuticals have resulted in a surge of neuroimaging applications in nuclear medicine on pediatric and adult patients. It is not feasible to directly measure the absorbed dose to the organs of the human body from nuclear medicine procedures. The formalism of the Medical Internal Radiation Dose (MIRD) committee of the Society of Nuclear Medicine has been adopted as the calculation method to estimate radiation dose to target organs from radionuclides distributed in source organs. The absorbed dose to a target organ from different types of radionuclides distributed within source organs can be estimated by the products of the time-integrated activity in each source region and organ dose conversion coefficients, called S values (Gy/MBq-s). S values are computed from a comprehensive set of Specific Absorbed Fraction (SAF), which are calculated from computational human phantoms with realistic anatomical structures coupled with Monte Carlo transport technique. The current SAF data for pediatric and adult head and brain dosimetry is based on a series of stylized computational phantoms. However, dosimetric errors caused by the unrealistic anatomy of stylized phantoms in internal dosimetry calculations have been reported by several studies. In the current study, we developed a series of realistic computational head phantoms representing 6, 9, 12, 15, and 22-year-old standard Korean males, and computed a comprehensive set of SAFs using the phantoms coupled with Monte Carlo transport technique. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Practical Implementation of GPU-based Computing at the Grid Edge for Resilience Scenarios

This paper presents a practical implementation of GPU-accelerated computing at the grid edge to enhance power system resilience through next-generation smart meters. Advanced Metering Infrastructure (AMI) systems rely predominantly on centralized processing architectures, which limit real-time response capabilities during grid disturbances. This work proposes the integration of GPU-enabled computational platforms directly within smart meter to enable local execution support for power system analytics, fault detection algorithms, and optimization routines. The proposed framework uses the Julia programming language to leverage highperformance parallel computing capabilities while maintaining code portability and development efficiency. We use two experimental scenarios to benchmark the computational feasibility of this approach: sparse linear system solutions representative of power flow analyses, and multi-stage production cost simulations incorporating unit commitment and economic dispatch operations. Results demonstrate that computationally intensive power system algorithms, such as those supporting resilience scenario calculations, can be effectively executed at the distribution edge using commercially available embedded GPU hardware. Keywords—GPU acceleration, edge computing, smart meters, grid resilience, AMI, resilience.

De Souza, Reubun [School of Electrical Engineering↗

Computational Speed-Up of Complex Durability Analysis of Large-Scale Composite Structures

The analysis of modern structures for aerospace, infrastructure, and automotive engineering applications necessitates the use of larger and larger computational models for accurate prediction of structural response. The ever-increasing size of computational structural mechanics simulations imposes a pressing need for commensurate increases in computational speed to keep costs and computation times in check. Innovative methods are needed to expedite the numerical analysis of complex structures while minimizing computational costs. The need for these methodologies is even more critical when performing durability and damage tolerance evaluation as the computation is repeated a number of times for various loading conditions. This paper describes a breakthrough for efficient and accurate predictive methodologies that are amenable to the analysis of progressive failure, reliability, and optimization of large-scale composite structures or structural components.

42 ENGINEERING↗

DOE Advanced Scientific Computing Advisory Subcommittee (ASCAC) Report: Top Ten Exascale Research Challenges

Exascale computing systems are essential for the scientific fields that will transform the 21st century global economy, including energy, biotechnology, nanotechnology, and materials science. Progress in these fields is predicated on the ability to perform advanced scientific and engineering simulations, and analyze the deluge of data. On July 29, 2013, ASCAC was charged by Patricia Dehmer, the Acting Director of the Office of Science, to assemble a subcommittee to provide advice on exascale computing. This subcommittee was directed to return a list of no more than ten technical approaches (hardware and software) that will enable the development of a system that achieves the Department's goals for exascale computing. Numerous reports over the past few years have documented the technical challenges and the non¬-viability of simply scaling existing computer designs to reach exascale. The technical challenges revolve around energy consumption, memory performance, resilience, extreme concurrency, and big data. Drawing from these reports and more recent experience, this ASCAC subcommittee has identified the top ten computing technology advancements that are critical to making a capable, economically viable, exascale system.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Applying the FAIR Principles to computational workflows

Recent trends within computational and data sciences show an increasing recognition and adoption of computational workflows as tools for productivity and reproducibility that also democratize access to platforms and processing know-how. As digital objects to be shared, discovered, and reused, computational workflows benefit from the FAIR principles, which stand for Findable, Accessible, Interoperable, and Reusable. The Workflows Community Initiative’s FAIR Workflows Working Group (WCI-FW), a global and open community of researchers and developers working with computational workflows across disciplines and domains, has systematically addressed the application of both FAIR data and software principles to computational workflows. We present recommendations with commentary that reflects our discussions and justifies our choices and adaptations. These are offered to workflow users and authors, workflow management system developers, and providers of workflow services as guidelines for adoption and fodder for discussion. The FAIR recommendations for workflows that we propose in this paper will maximize their value as research assets and facilitate their adoption by the wider community.

97 MATHEMATICS AND COMPUTING↗

Frontier (HPE Cray EX) Exascale Supercomputer at the Oak Ridge Leadership Computing Facility

Frontier is the HPE Cray EX exascale supercomputer deployed and operated by the Oak Ridge Leadership Computing Facility (OLCF) at Oak Ridge National Laboratory (ORNL). Frontier is designed for large-scale modeling, simulation, and AI workloads and is built from HPE Cray EX system architecture with AMD CPUs and AMD Instinct GPU accelerators connected by the HPE Slingshot interconnect. System composition (representative production configuration): Frontier is composed of approximately 74 cabinets with 128 compute nodes per cabinet (~9,400 compute nodes total). Each compute node contains one 64-core AMD EPYC CPU and four AMD Instinct MI250X GPUs. Nodes are connected using HPE Slingshot (Slingshot-200 class) networking with multiple NIC ports per node providing high injection bandwidth. Frontier is connected to the Orion parallel file system (multi-tier Lustre) providing a large, center-wide high-performance storage namespace. Operational context: Frontier entered public prominence as the first system to reach No. 1 on the TOP500 list in May 2022 (HPL benchmark), establishing the first widely recognized exascale-era performance milestone. The system supports DOE Office of Science mission workloads and enables leadership-class computational science and AI for open science users.

AMD EPYC↗

Data driven computing for Biological Systems

Biological breakthroughs that can lead to improved diagnosis and treatment of diseases, generation of clean energy, and solutions to other critical societal problems require high performance, data-intensive computational tools that have the ability to process, analyze and cohesively integrate massive amounts of data and information in real time. Biological computing problems are typically data-intensive and must share very large sets of data effectively across many processors. However, the various components of biological systems, composed of complex networks and pathways, must be integrated to gain a coherent understanding of the system. The more different types of data that can be integrated, the deeper the insights into the biology of the system being studied. Conventional analysis software, however, hasn’t been able to efficiently deal with such massive data set. The goal of the Data-Intensive Computing for Complex Biological Systems (BioPilot) project, a multiyear project funded by the U.S. Department of Energy’s Office of Advanced Scientific Computing Research (ASCR), is to create an integrated suite of highly flexible, highly adaptable pipelines of computational tools for analyzing large-scale data sets that will be used to address specific challenges facing the U.S. Department of Energy (DOE) and our society.

59 BASIC BIOLOGICAL SCIENCES↗

Deep learning for computational chemistry

The rise and fall of artificial neural networks is well documented in the scientific literature of both the fields of computer science and computational chemistry. Yet almost two decades later, we are now seeing a resurgence of interest in deep learning, a machine learning algorithm based on “deep” neural networks. Within the last few years, we have seen the transformative impact of deep learning the computer science domain, notably in speech recognition and computer vision, to the extent that the majority of practitioners in those field are now regularly eschewing prior established models in favor of deep learning models. In this review, we provide an introductory overview into the theory of deep neural networks and their unique properties as compared to traditional machine learning algorithms used in cheminformatics. By providing an overview of the variety of emerging applications of deep neural networks, we highlight its ubiquity and broad applicability to a wide range of challenges in the field, including QSAR, virtual screening, protein structure modeling, QM calculations, materials synthesis and property prediction. In reviewing the performance of deep neural networks, we observed a consistent outperformance against non neural networks state-of-the-art models across disparate research topics, and deep neural network based models often exceeded the “glass ceiling” expectations of their respective tasks. Coupled with the maturity of GPU-accelerated computing for training deep neural networks and the exponential growth of chemical data on which to train these networks on, we anticipate that deep learning algorithms will be a useful tool and may grow into a pivotal role for various challenges in the computational chemistry field.

Computational Chemistry↗

The MolSSI QCArchive project: An open-source platform to compute, organize, and share quantum chemistry data

The Molecular Sciences Software Institute's (MolSSI) Quantum Chemistry Archive (QCArchive) project is an umbrella name that covers both a central server hosted by MolSSI for community data and the Python-based software infrastructure that powers automated computation and storage of quantum chemistry (QC) results. The MolSSI-hosted central server provides the computational molecular sciences community a location to freely access tens of millions of QC computations for machine learning, methodology assessment, force-field fitting, and more through a Python interface. Facile, user-friendly mining of the centrally archived quantum chemical data also can be achieved through web applications found at the website. The software infrastructure can be used as a standalone platform to compute, structure, and distribute hundreds of millions of QC computations for individuals or groups of researchers at any scale. The QCArchiveInfrastructure is open-source (BSD-3C), code repositories can be found at github, and releases can be downloaded via PyPI and Conda. This article is categorized under: Electronic Structure Theory > Ab Initio Electronic Structure Methods Software > Quantum Chemistry Data Science > Computer Algorithms and Programming

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An elementary optical logic circuit for quantum computing: a review

The classical computing has already done wonders with computation, however limitations on speed and security of transmitted information is endorsing novel computation techniques. Quantum computing is expected to resolve complex problems especially for unachievable speed with best possible secure communication. The logic gates for two Quantum bits (qubits) are one of the most important part of information processing in Quantum computing. Although photons are the best candidates for the processing of qubit but they need lots of nonlinear coupling to perform logic operations. Recent developments in the field of integrated optics showing promising signs for the development of Quantum networks and Quantum computation. In this article we have reviewed the technology of handling polarization encoded Qubit to perform logic operations and interconnections of logic circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computation of turbulence and dispersion of cork in the NETL riser

The knowledge of dispersion coefficients is essential for reliable design of gasifiers. However, a literature review had shown that dispersion coefficients in fluidized beds differ by more than five orders of magnitude. This study presents a comparison of the computed axial solids dispersion coefficients for cork particles to the NETL riser cork data. The turbulence properties, the Reynolds stresses, the granular temperature spectra and the radial and axial gas and solids dispersion coefficients are computed. The standard kinetic theory model described in Gidaspow’s 1994 book, Multiphase Flow and Fluidization, Academic Press and the IIT and Fluent codes were used to compute the measured axial solids volume fraction profiles for flow of cork particles in the NETL riser. The Johnson–Jackson boundary conditions were used. Standard drag correlations were used. This study shows that the computed solids volume fractions for the low flux flow are within the experimental error of those measured, using a two-dimensional model. At higher solids fluxes the simulated solids volume fractions are close to the experimental measurements, but deviate significantly at the top of the riser. This disagreement is due to use of simplified geometry in the two-dimensional simulation. There is a good agreement between the experiment and the three-dimensional simulation for a high flux condition. This study concludes that the axial and radial gas and solids dispersion coefficients in risers operating in the turbulent flow regime can be computed using a multiphase computational fluid dynamics model.

42 ENGINEERING↗

A dynamic 2D Borehole Thermal Energy Storage (BTES) model for enhanced computational efficiency

Progressing toward a future increasingly reliant on renewable energy sources, the development of effective, durable energy storage solutions becomes essential to balance supply and demand fluctuations. Borehole Thermal Energy Storage (BTES) is a long-duration thermal energy storage technology that captures excess heat generated from renewable energy sources and stores it underground for later use, enabling the efficient utilization of sustainable energy. This approach is particularly valuable in district energy networks when integrated with Ground Source Heat Pumps (GSHP) to provide stable heating and cooling. However, traditional three-dimensional (3D) numerical models of BTES systems demand extensive computational resources, limiting their practicality for real-time and large-scale applications. This study introduces a novel two-dimensional (2D) modeling approach that reduces computational costs while maintaining high accuracy. By employing a radial ring-based discretization method, the model simulates heat injection, retention, and retrieval dynamics over seasonal cycles. A new thermal-mass weighted-average temperature parameter is introduced to evaluate the performance of BTES systems. Model validation against FEFLOW simulations demonstrates a 17-fold improvement in computational speed compared to traditional Computational Fluid Dynamics (CFD) models while achieving a mean absolute percentage error (MAPE) of 2 % during charging and 4 % during discharging. Additionally, a trade-off analysis between computational efficiency and accuracy is conducted, ensuring the model's applicability for real-world scenarios. The findings of this research contribute to the development of computationally efficient BTES models, facilitating better optimization, control, and integration into renewable energy systems. This work provides a foundation for further studies in techno-economic analysis, multi-year performance evaluation, and real-time operational strategies for BTES applications, supporting a more sustainable energy future.

2D modeling↗

A fast algorithm for sparse matrix computations related to inversion

We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green’s functions G{sup r} and G{sup <} for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width-2 separators used by its partitioning scheme. One problem is the presence of a large constant factor in the computational cost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round-off errors stay at a reasonable level.

97 MATHEMATICS AND COMPUTING↗

Special Issue on Data-Intensive Scalable Computing Systems

Traditional high performance computing (HPC) systems were designed from a compute-centric perspective, with an emphasis on high floating point performance. As scientific and analytics applications become more data intensive, there is a need to rethink HPC system architectures, programming models, runtime systems, and tools with a focus on scalable data intensive computing. Industry approaches supporting data intensive applications have been highly successful, leading many in the HPC community to search for ways to adapt them to HPC hardware and software contexts. Conversely, industry looks to the HPC community for their expertise in designing, deploying, and using extremely large and high performance computing systems. This special issue contains seven articles, each of which is an extended version of a paper presented in the 2015 International Workshop on Data Intensive Scalable Computing Systems (DISCS-2015) held in Austin, Texas on November 15, 2015. The workshop program included papers that ranged from programming models to systems software to storage, each with a strong focus on data intensive computing.

97 MATHEMATICS AND COMPUTING↗

Combined computational and experimental investigation of high temperature thermodynamics and structure of cubic ZrO 2 and HfO 2

Structure and thermodynamics of pure cubic ZrO 2 and HfO 2 were studied computationally and experimentally from their tetragonal to cubic transition temperatures (2311 and 2530 degrees C) to their melting points (2710 and 2800 degrees C). Computations were performed using automated ab initio molecular dynamics techniques. High temperature synchrotron X-ray diffraction on laser heated aerodynamically levitated samples provided experimental data on volume change during tetragonal-to-cubic phase transformation (0.55 +/- 0.09% for ZrO 2 and 0.87 +/- 0.08% for HfO 2 ), density and thermal expansion. Fusion enthalpies were measured using drop and catch calorimetry on laser heated levitated samples as 55 +/- 7 kJ/mol for ZrO 2 and 61 +/- 10 kJ/mol for HfO 2 , compared with 54 +/- 2 and 52 +/- 2 kJ/mol from computation. Volumetric thermal expansion for cubic ZrO 2 and HfO 2 are similar and reach (4 +/- 1).10 -5 /K from experiment and (5 +/- 1).10 -5 /K from computation. Finally, an agreement with experiment renders confidence in values obtained exclusively from computation: namely heat capacity of cubic HfO 2 and ZrO 2 , volume change on melting, and thermal expansion of the liquid to 3127 degrees C. Computed oxygen diffusion coefficients indicate that above 2400 degrees C pure ZrO 2 is an excellent oxygen conductor, perhaps even better than YSZ.

36 MATERIALS SCIENCE↗

Opportunities for neuromorphic computing algorithms and applications

Neuromorphic computing technologies will be important for the future of computing, but much of the work in neuromorphic computing has focused on hardware development. In this study, we review recent results in neuromorphic computing algorithms and applications. We highlight characteristics of neuromorphic computing technologies that make them attractive for the future of computing and we discuss opportunities for future development of algorithms and applications on these systems.

97 MATHEMATICS AND COMPUTING↗

CMS Computing Resources: Meeting the demands of the high-luminosity LHC physics program

The high-luminosity program has seen numerous extrapolations of its needed computing resources that each indicate the need for substantial changes if the desired HL-LHC physics program is to be supported within the current level of computing resource budgets. Drivers include large increases in event complexity (leading to increased processing time and analysis data size) and trigger rates needed (5-10 fold increases) for the HL-LHC program. The CMS experiment has recently undertaken an effort to merge the ideas behind short-term and long-term resource models in order to make easier and more reliable extrapolations to future needs. Near term computing resource estimation requirements depend on numerous parameters: LHC uptime and beam intensities; detector and online trigger performance; software performance; analysis data requirements; data access, management, and retention policies; site characteristics; and network performance. Longer term modeling is affected by the same characteristics, but with much larger uncertainties that must be considered to understand the most interesting handles for increasing the "physics per computing dollar" of the HL-LHC. In this presentation, we discuss the current status of long term modeling of the CMS computing resource needs for HL-LHC with emphasis on techniques for extrapolations, uncertainty quantification, and model results. We illustrate potential ways that high-luminosity CMS could accomplish its desired physics program within today's computing budgets.

97 MATHEMATICS AND COMPUTING↗